Divi19 commited on
Commit
8732fc1
·
verified ·
1 Parent(s): 9e2f56f

v1.2 release (16)

Browse files
.gitattributes CHANGED
@@ -33,3 +33,6 @@ saved_model/**/* filter=lfs diff=lfs merge=lfs -text
33
  *.zip filter=lfs diff=lfs merge=lfs -text
34
  *.zst filter=lfs diff=lfs merge=lfs -text
35
  *tfevents* filter=lfs diff=lfs merge=lfs -text
 
 
 
 
33
  *.zip filter=lfs diff=lfs merge=lfs -text
34
  *.zst filter=lfs diff=lfs merge=lfs -text
35
  *tfevents* filter=lfs diff=lfs merge=lfs -text
36
+ text/text_encoder.onnx.data filter=lfs diff=lfs merge=lfs -text
37
+ text/text_encoder_int8.onnx.data filter=lfs diff=lfs merge=lfs -text
38
+ text/tokenizer/tokenizer.json filter=lfs diff=lfs merge=lfs -text
CREDITS.csv ADDED
The diff for this file is too large to render. See raw diff
 
LICENSE ADDED
@@ -0,0 +1,202 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+
2
+ Apache License
3
+ Version 2.0, January 2004
4
+ http://www.apache.org/licenses/
5
+
6
+ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
7
+
8
+ 1. Definitions.
9
+
10
+ "License" shall mean the terms and conditions for use, reproduction,
11
+ and distribution as defined by Sections 1 through 9 of this document.
12
+
13
+ "Licensor" shall mean the copyright owner or entity authorized by
14
+ the copyright owner that is granting the License.
15
+
16
+ "Legal Entity" shall mean the union of the acting entity and all
17
+ other entities that control, are controlled by, or are under common
18
+ control with that entity. For the purposes of this definition,
19
+ "control" means (i) the power, direct or indirect, to cause the
20
+ direction or management of such entity, whether by contract or
21
+ otherwise, or (ii) ownership of fifty percent (50%) or more of the
22
+ outstanding shares, or (iii) beneficial ownership of such entity.
23
+
24
+ "You" (or "Your") shall mean an individual or Legal Entity
25
+ exercising permissions granted by this License.
26
+
27
+ "Source" form shall mean the preferred form for making modifications,
28
+ including but not limited to software source code, documentation
29
+ source, and configuration files.
30
+
31
+ "Object" form shall mean any form resulting from mechanical
32
+ transformation or translation of a Source form, including but
33
+ not limited to compiled object code, generated documentation,
34
+ and conversions to other media types.
35
+
36
+ "Work" shall mean the work of authorship, whether in Source or
37
+ Object form, made available under the License, as indicated by a
38
+ copyright notice that is included in or attached to the work
39
+ (an example is provided in the Appendix below).
40
+
41
+ "Derivative Works" shall mean any work, whether in Source or Object
42
+ form, that is based on (or derived from) the Work and for which the
43
+ editorial revisions, annotations, elaborations, or other modifications
44
+ represent, as a whole, an original work of authorship. For the purposes
45
+ of this License, Derivative Works shall not include works that remain
46
+ separable from, or merely link (or bind by name) to the interfaces of,
47
+ the Work and Derivative Works thereof.
48
+
49
+ "Contribution" shall mean any work of authorship, including
50
+ the original version of the Work and any modifications or additions
51
+ to that Work or Derivative Works thereof, that is intentionally
52
+ submitted to Licensor for inclusion in the Work by the copyright owner
53
+ or by an individual or Legal Entity authorized to submit on behalf of
54
+ the copyright owner. For the purposes of this definition, "submitted"
55
+ means any form of electronic, verbal, or written communication sent
56
+ to the Licensor or its representatives, including but not limited to
57
+ communication on electronic mailing lists, source code control systems,
58
+ and issue tracking systems that are managed by, or on behalf of, the
59
+ Licensor for the purpose of discussing and improving the Work, but
60
+ excluding communication that is conspicuously marked or otherwise
61
+ designated in writing by the copyright owner as "Not a Contribution."
62
+
63
+ "Contributor" shall mean Licensor and any individual or Legal Entity
64
+ on behalf of whom a Contribution has been received by Licensor and
65
+ subsequently incorporated within the Work.
66
+
67
+ 2. Grant of Copyright License. Subject to the terms and conditions of
68
+ this License, each Contributor hereby grants to You a perpetual,
69
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
70
+ copyright license to reproduce, prepare Derivative Works of,
71
+ publicly display, publicly perform, sublicense, and distribute the
72
+ Work and such Derivative Works in Source or Object form.
73
+
74
+ 3. Grant of Patent License. Subject to the terms and conditions of
75
+ this License, each Contributor hereby grants to You a perpetual,
76
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
77
+ (except as stated in this section) patent license to make, have made,
78
+ use, offer to sell, sell, import, and otherwise transfer the Work,
79
+ where such license applies only to those patent claims licensable
80
+ by such Contributor that are necessarily infringed by their
81
+ Contribution(s) alone or by combination of their Contribution(s)
82
+ with the Work to which such Contribution(s) was submitted. If You
83
+ institute patent litigation against any entity (including a
84
+ cross-claim or counterclaim in a lawsuit) alleging that the Work
85
+ or a Contribution incorporated within the Work constitutes direct
86
+ or contributory patent infringement, then any patent licenses
87
+ granted to You under this License for that Work shall terminate
88
+ as of the date such litigation is filed.
89
+
90
+ 4. Redistribution. You may reproduce and distribute copies of the
91
+ Work or Derivative Works thereof in any medium, with or without
92
+ modifications, and in Source or Object form, provided that You
93
+ meet the following conditions:
94
+
95
+ (a) You must give any other recipients of the Work or
96
+ Derivative Works a copy of this License; and
97
+
98
+ (b) You must cause any modified files to carry prominent notices
99
+ stating that You changed the files; and
100
+
101
+ (c) You must retain, in the Source form of any Derivative Works
102
+ that You distribute, all copyright, patent, trademark, and
103
+ attribution notices from the Source form of the Work,
104
+ excluding those notices that do not pertain to any part of
105
+ the Derivative Works; and
106
+
107
+ (d) If the Work includes a "NOTICE" text file as part of its
108
+ distribution, then any Derivative Works that You distribute must
109
+ include a readable copy of the attribution notices contained
110
+ within such NOTICE file, excluding those notices that do not
111
+ pertain to any part of the Derivative Works, in at least one
112
+ of the following places: within a NOTICE text file distributed
113
+ as part of the Derivative Works; within the Source form or
114
+ documentation, if provided along with the Derivative Works; or,
115
+ within a display generated by the Derivative Works, if and
116
+ wherever such third-party notices normally appear. The contents
117
+ of the NOTICE file are for informational purposes only and
118
+ do not modify the License. You may add Your own attribution
119
+ notices within Derivative Works that You distribute, alongside
120
+ or as an addendum to the NOTICE text from the Work, provided
121
+ that such additional attribution notices cannot be construed
122
+ as modifying the License.
123
+
124
+ You may add Your own copyright statement to Your modifications and
125
+ may provide additional or different license terms and conditions
126
+ for use, reproduction, or distribution of Your modifications, or
127
+ for any such Derivative Works as a whole, provided Your use,
128
+ reproduction, and distribution of the Work otherwise complies with
129
+ the conditions stated in this License.
130
+
131
+ 5. Submission of Contributions. Unless You explicitly state otherwise,
132
+ any Contribution intentionally submitted for inclusion in the Work
133
+ by You to the Licensor shall be under the terms and conditions of
134
+ this License, without any additional terms or conditions.
135
+ Notwithstanding the above, nothing herein shall supersede or modify
136
+ the terms of any separate license agreement you may have executed
137
+ with Licensor regarding such Contributions.
138
+
139
+ 6. Trademarks. This License does not grant permission to use the trade
140
+ names, trademarks, service marks, or product names of the Licensor,
141
+ except as required for reasonable and customary use in describing the
142
+ origin of the Work and reproducing the content of the NOTICE file.
143
+
144
+ 7. Disclaimer of Warranty. Unless required by applicable law or
145
+ agreed to in writing, Licensor provides the Work (and each
146
+ Contributor provides its Contributions) on an "AS IS" BASIS,
147
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
148
+ implied, including, without limitation, any warranties or conditions
149
+ of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
150
+ PARTICULAR PURPOSE. You are solely responsible for determining the
151
+ appropriateness of using or redistributing the Work and assume any
152
+ risks associated with Your exercise of permissions under this License.
153
+
154
+ 8. Limitation of Liability. In no event and under no legal theory,
155
+ whether in tort (including negligence), contract, or otherwise,
156
+ unless required by applicable law (such as deliberate and grossly
157
+ negligent acts) or agreed to in writing, shall any Contributor be
158
+ liable to You for damages, including any direct, indirect, special,
159
+ incidental, or consequential damages of any character arising as a
160
+ result of this License or out of the use or inability to use the
161
+ Work (including but not limited to damages for loss of goodwill,
162
+ work stoppage, computer failure or malfunction, or any and all
163
+ other commercial damages or losses), even if such Contributor
164
+ has been advised of the possibility of such damages.
165
+
166
+ 9. Accepting Warranty or Additional Liability. While redistributing
167
+ the Work or Derivative Works thereof, You may choose to offer,
168
+ and charge a fee for, acceptance of support, warranty, indemnity,
169
+ or other liability obligations and/or rights consistent with this
170
+ License. However, in accepting such obligations, You may act only
171
+ on Your own behalf and on Your sole responsibility, not on behalf
172
+ of any other Contributor, and only if You agree to indemnify,
173
+ defend, and hold each Contributor harmless for any liability
174
+ incurred by, or claims asserted against, such Contributor by reason
175
+ of your accepting any such warranty or additional liability.
176
+
177
+ END OF TERMS AND CONDITIONS
178
+
179
+ APPENDIX: How to apply the Apache License to your work.
180
+
181
+ To apply the Apache License to your work, attach the following
182
+ boilerplate notice, with the fields enclosed by brackets "[]"
183
+ replaced with your own identifying information. (Don't include
184
+ the brackets!) The text should be enclosed in the appropriate
185
+ comment syntax for the file format. We also recommend that a
186
+ file or class name and description of purpose be included on the
187
+ same "printed page" as the copyright notice for easier
188
+ identification within third-party archives.
189
+
190
+ Copyright [yyyy] [name of copyright owner]
191
+
192
+ Licensed under the Apache License, Version 2.0 (the "License");
193
+ you may not use this file except in compliance with the License.
194
+ You may obtain a copy of the License at
195
+
196
+ http://www.apache.org/licenses/LICENSE-2.0
197
+
198
+ Unless required by applicable law or agreed to in writing, software
199
+ distributed under the License is distributed on an "AS IS" BASIS,
200
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
201
+ See the License for the specific language governing permissions and
202
+ limitations under the License.
README.md ADDED
@@ -0,0 +1,161 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ ---
2
+ license: apache-2.0
3
+ library_name: onnx
4
+ pipeline_tag: feature-extraction
5
+ base_model: Qwen/Qwen3-Embedding-0.6B
6
+ datasets:
7
+ - Divi19/vibebench
8
+ tags:
9
+ - music
10
+ - audio
11
+ - text-to-audio-retrieval
12
+ - embeddings
13
+ - onnx
14
+ - raspberry-pi
15
+ ---
16
+
17
+ # vibe-embed v1.2
18
+
19
+ Search music by how it sounds and feels: "rainy Sunday coffee shop", "upbeat but melancholic, no vocals", "something for a long night drive". Songs and descriptions share one 512-number vector space, so you can search a library by text or find songs with the same vibe as another song.
20
+
21
+ - **Small:** the audio model is EfficientAT mn20_as (35 MB in 8-bit) and runs on a CPU; the search side is Qwen3-Embedding-0.6B plus a small trained layer (818 MB in 8-bit).
22
+ - **Open:** Apache-2.0, trained only on CC0, CC BY and public-domain music. Every training song is credited in `CREDITS.csv`.
23
+ - **Languages:** English, Spanish, German, French, Brazilian Portuguese and Japanese (translated training texts; scores per language are in `results/languages.md`).
24
+
25
+ Try it: [demo](https://huggingface.co/spaces/Divi19/vibe-search) · benchmark: [Divi19/vibebench](https://huggingface.co/datasets/Divi19/vibebench)
26
+
27
+ ## Use it
28
+
29
+ **In AudioMuse-AI** (self-hosted music server analysis): Plugins → add `https://huggingface.co/Divi19/vibe-embed/resolve/main/plugin/manifest.json` → install Vibe Search. The plugin indexes your library on your own machine; details in `plugin/README.md`.
30
+
31
+ **In Python** (onnxruntime ≥ 1.28 for the 8-bit search file; numpy; tokenizers):
32
+
33
+ ```python
34
+ from huggingface_hub import snapshot_download
35
+ import sys
36
+ d = snapshot_download("Divi19/vibe-embed")
37
+ sys.path.insert(0, d + "/plugin/plugins/VibeSearch")
38
+ import vibemodel # the plugin's loader: preprocessing plus self-checks against parity.json
39
+ m = vibemodel.VibeModel(d, "mn20_as", "int8")
40
+ m.load_audio(); m.load_text()
41
+ song_vec, n = m.embed_audio(wave_32k_mono) # float32 numpy array, 32 kHz mono
42
+ query_vecs = m.embed_texts(["rainy Sunday coffee shop"])
43
+ score = query_vecs @ song_vec # cosine similarity
44
+ ```
45
+
46
+ The exact preprocessing is written in `config.json`: 32 kHz mono, 10-second windows (a last window of at least 2 s is kept), window vectors averaged and normalised; search texts get the instruction prompt in `config.json`, left padding, at most 256 tokens.
47
+
48
+ | file | what |
49
+ |---|---|
50
+ | `mn20_as/audio_encoder_int8.onnx`, `audio_encoder.onnx` | audio model, 8-bit and full precision (35 / 72 MB) |
51
+ | `text/text_encoder_int8.onnx`, `text_encoder.onnx` (+ `.data`) | search model, 8-bit and full precision (818 / 2396 MB) |
52
+ | `text/tokenizer/` | tokenizer |
53
+ | `config.json`, `parity.json` | preprocessing, and reference outputs that loaders check against |
54
+ | `plugin/` | the AudioMuse-AI plugin catalogue |
55
+ | `results/` | full result tables |
56
+
57
+ ## Results
58
+
59
+ **Measured by us**, same code for every model. IncompeBench: 500 written searches over 1,574 permissively licensed songs, nDCG@10 × 100. Song Describer: one caption per recording, recall@10.
60
+
61
+ | model | size | licence | IncompeBench lenient | IncompeBench strict | Song Describer R@10 |
62
+ |:---------------------------------------------------------------|:----------------------------|:-----------|-----------------------:|:----------------------|----------------------:|
63
+ | **vibe-embed v1.2, shipped 8-bit files** (this repo) | 35 MB audio + 818 MB search | Apache-2.0 | 71.8 | | 47.1 |
64
+ | vibe-embed v1.2, full precision | 72 MB + 2396 MB | Apache-2.0 | 72 | | 47.1 |
65
+ | its teacher (LCO-Omni-7B + LoRA with e5-omni-7B, not released) | 2 × 7B | | 79.2 | | 58.8 |
66
+ | DCLAP (AudioMuse-AI's current model) | | AGPL-3.0 | 56.2 | 46.5 | 30.8 |
67
+ | LAION-CLAP music + speech | | Apache-2.0 | 53.3 | 44.0 | 31.7 |
68
+ | PE-AV large | | Apache-2.0 | 55.9 | 47.8 | 48.6 |
69
+ | PE-AV base | | Apache-2.0 | 50.7 | 42.6 | 46.4 |
70
+ | PE-AV small | | Apache-2.0 | 52.8 | 44.6 | 47.8 |
71
+ | LCO-Embedding-Omni-7B | | Apache-2.0 | 76.9 | 68.2 | 41.9 |
72
+ | e5-omni-7B | | MIT | 74.4 | 65.3 | 53 |
73
+
74
+ **Published** on [Mixedbread's IncompeBench page](https://www.mixedbread.com/evals/incompebench) (tested March 2026; not re-measured by us):
75
+
76
+ | model | IncompeBench lenient | IncompeBench strict |
77
+ |:------------------------------------|-----------------------:|----------------------:|
78
+ | Mixedbread (Wholembed V3, API only) | 77.3 | 65.1 |
79
+ | Gemini Embedding 2 (API only) | 72.5 | 64 |
80
+ | CLaMP 3 | 70.4 | 57.9 |
81
+ | ColQwen-Omni | 65.4 | 51.4 |
82
+ | TTMR++ | 64.5 | 50.2 |
83
+ | CLAP | 59.4 | 46 |
84
+
85
+ On IncompeBench (lenient) the shipped 8-bit files score 71.8: above CLaMP 3, ColQwen-Omni, TTMR++, CLAP; below Mixedbread (Wholembed V3, API only), Gemini Embedding 2 (API only) as published. The test half of IncompeBench, which was never used to choose between versions, gives 72.8 with the shipped 8-bit files.
86
+
87
+ ### VibeBench
88
+
89
+ VibeBench ranks 1,831 held-out CC songs for 500 real music requests from CPCD (Google Research, CC BY 4.0). Every system's top 10 is graded by an LLM (Phi-4) against a written description of each song. Main board: grades rescaled with cut-points fitted on IncompeBench's human-validated grades.
90
+
91
+ Rescaled grades (prompt-1 cut-points)
92
+
93
+ | system | nDCG@10 all | nDCG@10 test | nDCG@10 dev | judged@10 |
94
+ |:-------------------------------------------|--------------:|---------------:|--------------:|------------:|
95
+ | teacher, its own 7B search side | 0.8031 | 0.7922 | 0.8382 | 1 |
96
+ | combined teacher, its own 7B search side | 0.7939 | 0.7866 | 0.8176 | 1 |
97
+ | combined teacher, the v1.2 search side | 0.7644 | 0.7537 | 0.7991 | 1 |
98
+ | teacher, the student's search side (Qwen3) | 0.7536 | 0.7397 | 0.7983 | 1 |
99
+ | LCO-Omni-7B as is | 0.7494 | 0.7415 | 0.775 | 1 |
100
+ | v1.2 student + v1.2 search side (ships) | 0.7329 | 0.7191 | 0.7775 | 1 |
101
+ | e5-omni-7B as is | 0.7309 | 0.7214 | 0.7615 | 1 |
102
+ | v1 student + v1.1 search side | 0.718 | 0.708 | 0.7507 | 1 |
103
+ | v1 student + v1 search side (07) | 0.6861 | 0.6769 | 0.7159 | 1 |
104
+ | DCLAP (AudioMuse-AI) | 0.6371 | 0.6312 | 0.6561 | 1 |
105
+ | LAION CLAP music+speech | 0.574 | 0.5683 | 0.5923 | 1 |
106
+ | BM25 over the song cards | 0.5307 | 0.5245 | 0.5508 | 1 |
107
+
108
+ As answered
109
+
110
+ | system | nDCG@10 all | nDCG@10 test | nDCG@10 dev | judged@10 |
111
+ |:-------------------------------------------|--------------:|---------------:|--------------:|------------:|
112
+ | teacher, its own 7B search side | 0.8283 | 0.8238 | 0.8427 | 1 |
113
+ | combined teacher, its own 7B search side | 0.8132 | 0.8115 | 0.8186 | 1 |
114
+ | combined teacher, the v1.2 search side | 0.7847 | 0.782 | 0.7936 | 1 |
115
+ | teacher, the student's search side (Qwen3) | 0.7773 | 0.771 | 0.7977 | 1 |
116
+ | LCO-Omni-7B as is | 0.7635 | 0.7631 | 0.7649 | 1 |
117
+ | v1.2 student + v1.2 search side (ships) | 0.7509 | 0.7449 | 0.7705 | 1 |
118
+ | v1 student + v1.1 search side | 0.744 | 0.7391 | 0.76 | 1 |
119
+ | e5-omni-7B as is | 0.7421 | 0.7383 | 0.7545 | 1 |
120
+ | v1 student + v1 search side (07) | 0.7039 | 0.6994 | 0.7184 | 1 |
121
+ | DCLAP (AudioMuse-AI) | 0.6513 | 0.6472 | 0.6646 | 1 |
122
+ | LAION CLAP music+speech | 0.5857 | 0.5881 | 0.5779 | 1 |
123
+ | BM25 over the song cards | 0.5496 | 0.5486 | 0.5529 | 1 |
124
+
125
+ | v1.2 student + v1.2 search side minus | rescaled, all [95% CI] | rescaled, test [95% CI] | as answered, all [95% CI] |
126
+ |:-----------------------------------------|:-------------------------|:--------------------------|:----------------------------|
127
+ | DCLAP (AudioMuse-AI) | +0.096 [+0.078, +0.115] | +0.088 [+0.067, +0.109] | +0.100 [+0.083, +0.117] |
128
+ | LAION CLAP music+speech | +0.159 [+0.139, +0.179] | +0.151 [+0.128, +0.175] | +0.165 [+0.147, +0.185] |
129
+ | v1 student + v1.1 search side | +0.015 [+0.004, +0.026] | +0.011 [-0.002, +0.025] | +0.007 [-0.002, +0.016] |
130
+ | v1 student + v1 search side (07) | +0.047 [+0.033, +0.060] | +0.042 [+0.028, +0.057] | +0.047 [+0.036, +0.059] |
131
+ | LCO-Omni-7B as is | -0.017 [-0.031, -0.002] | -0.022 [-0.040, -0.005] | -0.013 [-0.026, +0.001] |
132
+ | combined teacher, its own 7B search side | -0.061 [-0.074, -0.048] | -0.068 [-0.084, -0.052] | -0.062 [-0.074, -0.051] |
133
+
134
+ ### Speed
135
+
136
+ One 180-second song indexed on a Colab CPU (8 CPUs), decoding included, median of 3 runs. DCLAP is run exactly as AudioMuse-AI runs it.
137
+
138
+ | threads | ours int8 (s/song) | ours fp32 (s/song) | DCLAP (s/song) | DCLAP / ours int8 |
139
+ |----------:|---------------------:|---------------------:|-----------------:|--------------------:|
140
+ | 4 | 0.902 | 0.903 | 4.243 | 4.7 |
141
+ | 1 | 1.897 | 1.909 | 2.677 | 1.41 |
142
+
143
+ ## How it was made
144
+
145
+ 1. **Captions.** An audio-language model wrote listener-style descriptions of CC0 / CC BY Jamendo and FMA songs.
146
+ 2. **Teacher.** LCO-Embedding-Omni-7B, fine-tuned with LoRA on those pairs, combined with e5-omni-7B (both built on Qwen2.5-Omni-7B, Apache-2.0) and reduced to 512 numbers. The teacher is not released.
147
+ 3. **Student.** EfficientAT mn20_as (MIT; initialised from its authors' AudioSet weights) learns to reproduce the teacher's song vectors on 35,661 CC songs. The search side, Qwen3-Embedding-0.6B (Apache-2.0) with a trained layer, learns to reproduce the teacher's text vectors.
148
+ 4. **Selection.** Every choice between versions was made on the dev halves of IncompeBench and Song Describer; the test halves were only reported.
149
+
150
+ Never used for training: IncompeBench, Song Describer, MTG-Jamendo tags, or outputs of closed models.
151
+
152
+ ## Limits
153
+
154
+ - Trained and tested on royalty-free music. Mainstream commercial music was not part of training or testing, so how well it handles it is unmeasured.
155
+ - VibeBench is graded by an LLM. Its agreement with human-validated grades is κ ≈ 0.47, below the usual 0.6 bar, so treat VibeBench as a secondary signal.
156
+ - Speed was measured on a cloud CPU, not on a Raspberry Pi.
157
+ - On onnxruntime older than 1.28 (for example AudioMuse-AI's no-AVX2 image), the 8-bit search file does not load; the plugin then uses the full-precision file, which is larger and needs more RAM. Results are the same.
158
+
159
+ ## Licence and credits
160
+
161
+ Model files: Apache-2.0 (`LICENSE`). The AudioMuse-AI plugin in `plugin/` is AGPL-3.0, like AudioMuse-AI itself. Training music: CC0, CC BY and public-domain songs from Jamendo and the Free Music Archive; every song with its artist, licence and link is in `CREDITS.csv` (CC BY: 35,661).
config.json ADDED
@@ -0,0 +1,60 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {
2
+ "audio": {
3
+ "sample_rate": 32000,
4
+ "channels": "mono (average of channels)",
5
+ "window_s": 10,
6
+ "song_vector": "split into non-overlapping 10 s windows (keep a shorter last window if it is at least 2 s), embed each window, average the window vectors, L2-normalise",
7
+ "front_end": "inside the ONNX model: pre-emphasis 0.97, STFT n_fft 1024 / hop 320 / Hann 800 centred, 128 Kaldi mel bands 0–15 kHz, log(x + 1e-5), (x + 4.5) / 5 (EfficientAT)",
8
+ "onnx_input": "audio_32k float32 [batch, samples]",
9
+ "onnx_output": "vibe_vector float32 [batch, 512], L2-normalised"
10
+ },
11
+ "text": {
12
+ "model": "Qwen/Qwen3-Embedding-0.6B (fine-tuned)",
13
+ "prompt": "Instruct: Given a description of how a piece of music sounds or feels, or of a moment it suits, retrieve music that matches it\nQuery:",
14
+ "tokenizer": "left padding, truncation 256 tokens",
15
+ "onnx_input": "input_ids, attention_mask int64 [batch, tokens] (prompt + query)",
16
+ "onnx_output": "text_vector float32 [batch, 512], L2-normalised",
17
+ "int8_method": "8-bit weights (block 32), int8 arithmetic (accuracy level 4) + 16-bit vocabulary",
18
+ "int8_min_onnxruntime": "1.28",
19
+ "int8_checks": {
20
+ "cos_mean": 0.99976,
21
+ "cos_min": 0.99919,
22
+ "plugin_parity_min": 0.99979,
23
+ "incompe_full": 0.7187,
24
+ "ms_per_query_4thread": 55.8,
25
+ "MB": 818.5
26
+ },
27
+ "version": "v1.2",
28
+ "fine_tune": "Qwen3-Embedding-0.6B and the text layer trained to copy the combined teacher's 7B text vectors; translated training texts (es, de, fr, pt-BR, ja) map to their English text's vector",
29
+ "languages": [
30
+ "en",
31
+ "es",
32
+ "de",
33
+ "fr",
34
+ "pt",
35
+ "ja"
36
+ ]
37
+ },
38
+ "matryoshka": {
39
+ "sizes": [
40
+ 128,
41
+ 256,
42
+ 512
43
+ ],
44
+ "how": "take the first N numbers and L2-normalise again"
45
+ },
46
+ "students": {
47
+ "mn20_as": {
48
+ "efficientat": "mn20_as",
49
+ "efficientat_commit": "a425fdce92572e602a1d5634799bd9f1f2efa806",
50
+ "params_m": 17.87,
51
+ "best_epoch": 8,
52
+ "v1_2": "C · trained on the teacher's song vectors only (epoch 3)"
53
+ }
54
+ },
55
+ "default_student": "mn20_as",
56
+ "selection": "epoch and size chosen on the dev halves of IncompeBench (nDCG@10, lenient) and Song Describer (R@10)",
57
+ "teacher": "combined: LCO-Embedding-Omni-7B (LoRA) + e5-omni-7B, 512 numbers (teacher/combined)",
58
+ "licence": "Apache-2.0 (EfficientAT code: MIT)",
59
+ "version": "v1.2"
60
+ }
mn20_as/audio_encoder.onnx ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:d8d1043e319af592844bfba51d7e1a346cff679a90a909ccd643ca3e81cae026
3
+ size 72128459
mn20_as/audio_encoder_int8.onnx ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:8ab03373ced4e37538e43f7a757ee030e62eaa21801bef793e8256fe1496f697
3
+ size 35325949
parity.json ADDED
@@ -0,0 +1 @@
 
 
1
+ {"note": "Expected outputs for fixed inputs. Audio: 0.1 * sin(2*pi*(220*t + 50*t^2)), t = n / 32000, n = 0..319999 (10 s at 32 kHz, float32). Text: prompt + query, tokenised as listed (left padding).", "text_prompt": "Instruct: Given a description of how a piece of music sounds or feels, or of a moment it suits, retrieve music that matches it\nQuery:", "texts": [{"query": "calm piano for a rainy evening", "vector": [0.449381, 0.103875, 0.348616, 0.11685, -0.098239, -0.140739, 0.035575, -0.015314, -0.10139, 0.094073, -0.000846, -0.014633, 0.019474, 0.100868, -0.12975, -0.013874, 0.223867, 0.074736, -0.1169, 0.103907, 0.060795, -0.038611, -0.053007, -0.013287, 0.050969, -0.046215, 0.00664, -0.062335, 0.012815, -0.001636, -0.074938, 0.056834, 0.010358, -0.041056, -0.006446, -0.0645, -0.016434, -0.042048, 0.066652, 0.004823, -0.069685, 0.011265, -0.013866, -0.058265, -0.069626, -0.023437, 0.052143, 0.01787, -0.027564, -0.017573, 0.000395, -0.023652, -0.07202, 0.012861, -0.013457, 0.066246, -0.04521, 0.025836, -0.023285, -0.005665, -0.044692, 0.036348, -0.066907, -0.110038, -0.00055, 0.01599, -0.000621, 0.032206, 0.004636, 0.091345, -0.031063, -0.063112, 0.025284, 0.042219, 0.076433, -0.034066, 0.006953, 0.079152, 0.060674, -0.029486, -0.04811, -0.037652, 0.054643, 0.005618, 0.090589, 0.040513, 0.074232, 0.043583, 0.034565, -0.005082, 0.000575, 0.012025, 0.059825, -0.017076, -0.066963, -0.003517, 0.026718, 0.080569, -0.028259, 0.042302, 0.0517, -0.006822, 0.032396, -0.101137, -0.027028, -0.060546, -0.077142, 0.076997, 0.012875, -0.001405, 0.052877, -0.0134, -0.007089, -0.026059, -0.026092, -0.015368, 0.010968, 0.026841, -0.045266, -0.078603, -0.043716, -0.000798, -0.021584, 0.030729, -0.014835, 0.018572, 0.0216, -0.018604, -0.019603, -0.048062, 0.037376, -0.006051, 0.052861, -0.110985, 0.073161, -0.007679, -0.042883, 0.094259, 0.009309, 0.009804, 0.015619, 0.034418, -0.014808, -0.008477, 0.020006, -0.007936, -0.006012, -0.011029, -0.074273, -0.075971, -0.070604, -0.010452, -0.032946, -0.013638, -0.014199, -0.008355, 0.062529, -0.042756, -0.009269, -0.034695, 0.073526, -0.002317, -0.00811, 0.060604, -0.008459, -0.016496, 0.005614, -0.027719, 0.022643, -0.002706, -0.006949, -0.007566, 0.013493, 0.062581, 0.050696, -0.046819, 0.014295, -0.018176, -0.033578, 0.026407, -0.019806, -0.023102, 0.012132, 0.006236, 0.042991, 0.045668, 0.056614, -0.003258, -0.046994, -0.02413, 0.031626, -0.039543, -0.016834, -0.026249, 0.007845, -0.009544, -0.022672, -0.041571, -0.001196, 0.050556, 0.030501, 0.005873, -0.002932, 0.042159, -0.011064, 0.030662, -0.042715, -0.021225, -0.020082, 0.000262, -0.023659, -0.016201, 0.011797, 0.03416, -0.018026, 0.048849, -0.020635, 0.002398, -0.021619, -0.025866, 0.013667, 0.010928, -0.036106, -0.020262, -0.024957, -0.022259, 0.052994, -0.01102, 0.030729, 0.015931, 0.027753, 0.022343, 0.002226, 0.009095, 0.01834, 0.025398, 0.024124, -0.003719, 0.006424, 0.014843, -0.015914, -0.007672, -0.033036, 0.016662, -0.028363, -0.019697, 0.013937, 8.4e-05, 0.016, 0.024394, 0.037548, 0.005972, -0.033724, 0.010011, -0.009617, -0.004953, -0.006034, -0.054506, -0.022892, -0.009655, 0.022292, 0.017381, 0.00448, 0.053945, 0.000281, 0.03344, 0.013344, 0.030149, 0.007842, 0.028759, 0.020941, -0.005409, -0.012541, -0.009041, -0.00588, 0.012097, 0.011574, 0.016522, 0.036979, 0.041994, -0.055622, -0.013502, 0.006822, -0.02157, 0.019923, -0.026466, 0.022499, 0.056885, 0.018313, -0.029667, -0.010597, 0.000413, -0.014406, 0.000685, -0.018914, 0.059016, 0.003666, 0.009077, -0.005443, 0.017964, 0.002873, -0.06385, 0.066604, 0.001535, -0.030096, -0.029967, 0.000738, 0.009891, 0.013058, 0.001279, 0.046195, -0.016249, 0.023838, -0.001154, 0.028235, -0.017994, -0.023987, -0.019954, 0.034558, 0.010479, 0.002409, 0.012647, -0.009645, 0.045188, -0.010376, 0.004333, -0.058823, -0.042253, 5.3e-05, -0.02751, 0.014082, -0.009774, 0.005066, -0.014462, 0.01542, -0.02859, -0.007678, 0.024536, -0.002986, -0.009001, 0.020613, 0.020753, -0.032943, 0.027988, -0.008459, -0.009541, 0.033889, 0.007317, -0.001992, -0.004996, -0.038201, 0.032905, 0.043478, 0.020964, -0.022735, 0.023094, -0.00618, 0.02108, -0.023271, -0.010505, -0.006794, 0.010972, -0.02473, 0.013103, 0.00122, 0.007737, 0.044896, -0.049104, 0.007783, 0.050941, 0.006701, 0.001504, -0.019082, -0.021418, 0.023383, -0.003076, -0.037061, -0.019014, -0.072215, 0.03281, -0.01012, 0.019037, -0.020971, -0.001495, -0.014603, 0.019812, -0.019017, 0.006916, -0.011303, -0.003865, -0.014778, -0.014326, -0.037381, 0.041265, 0.048365, 0.001955, 0.015722, -0.001895, 0.004474, -0.001164, -0.016954, 0.01577, 0.028368, 0.027396, -0.011801, 0.041945, 0.008551, -0.003768, 0.01219, 0.034911, -0.033803, -0.021302, -0.005389, 0.017914, 0.054704, 0.001594, -0.008519, -0.003575, -0.013712, 0.003649, 0.018383, 0.001829, -0.018222, 0.013084, -0.027371, -0.011154, -0.017469, 0.006046, 0.006863, -0.030751, 0.005043, -0.005997, -0.042105, -0.002504, 0.027011, -0.023509, -0.015226, -0.030839, -0.041226, -0.022661, -0.02713, -0.044308, -0.009151, -0.018087, 0.005959, 0.050134, -0.023358, 0.000955, -0.00926, 0.00414, -0.009557, -0.028443, 0.006921, -0.015259, -0.019114, 0.007267, 0.01047, 0.0001, -0.025391, -0.005993, -0.00605, 0.006534, 0.002213, 0.002527, 0.016418, 0.005525, -0.027138, 0.025466, 0.026348, -0.003956, 0.01441, -0.002913, 0.014022, -0.002165, 0.005573, -0.001356, -0.000857, -0.01244, -0.016557, -0.007059, -0.007734, 0.000783, -0.001411, 0.034522, -0.0211, 0.0197, 0.043162, -0.010475, -0.011299, -0.007067, 0.0184, 0.03765, -0.003159, -0.022364, 0.03106, 0.002421, 0.010408, 0.032432, -0.006503, 0.021052, -0.022039, 0.006592, 0.035919, -0.002603, 0.001707, 0.035404, 0.015254, 0.007158, -0.008157, 0.000279, 0.041703, 0.037969], "input_ids": [641, 1235, 25, 16246, 264, 4008, 315, 1246, 264, 6573, 315, 4627, 10362, 476, 11074, 11, 476, 315, 264, 4445, 432, 27976, 11, 17179, 4627, 429, 9071, 432, 198, 2859, 25, 5416, 76, 26278, 369, 264, 62757, 11458, 151643]}, {"query": "something to dance to at a summer party", "vector": [0.462266, -0.006368, -0.168885, 0.186422, 0.226769, 0.070224, 0.042009, 0.019953, -0.006341, -0.146086, -0.049587, 0.035868, -0.127851, 0.032907, 0.045092, 0.023214, 0.026555, 0.068883, -0.029198, 0.120346, -0.034544, -0.005507, -0.09788, -0.04839, 0.006343, -0.038157, -0.012783, 0.044413, 0.019277, -0.01167, -0.064706, 0.084224, 0.019454, -0.003194, -0.038871, -0.015337, -0.039273, 0.071878, 0.091434, 0.000568, -0.108515, 0.009655, 0.018775, -0.072826, -0.064497, 0.00062, 0.066294, 0.036048, -0.110082, 0.023185, -0.028892, -0.011867, -0.02088, -0.003181, -0.029439, 0.062593, -0.054383, 0.109905, -0.006088, 0.012953, -0.035216, 0.058128, 0.009684, -0.049106, -0.023436, 0.101053, -0.050454, -0.032301, -0.049672, 0.04152, -0.03438, -0.021295, 0.034721, 0.045129, 0.064405, -0.116382, 0.020281, 0.020228, 0.026689, -0.017245, 0.010372, 0.03845, -0.020653, -0.036632, 0.092486, 0.066179, 0.060491, 0.017355, 0.043964, 0.024721, -0.053865, 0.013745, 0.031148, 0.01016, -0.025159, 0.015931, -0.06873, -0.061683, 0.019269, 0.029985, 0.070456, -0.022289, 0.014029, -0.021656, 0.039682, 0.000815, 0.048599, -0.041037, -0.07994, -0.019721, -0.039081, 0.050752, -0.008438, -0.014122, -0.068508, 0.022258, -0.01098, -0.012403, 3.3e-05, 0.025375, -0.016938, -0.008005, 0.013622, -0.087369, -0.031997, -0.031802, 0.011845, -0.035269, 0.033227, 0.000896, -0.00305, -0.010735, 0.01719, 0.034976, -0.007427, -0.024582, -0.026858, -0.066097, 0.010074, 0.007781, -0.001696, -0.017843, -0.020945, -0.01155, -0.021929, -0.024078, 0.036776, -0.008627, -0.080554, -0.022272, 0.032851, -0.002796, -0.059357, -0.00435, 0.010618, 0.090335, 0.008881, -0.024697, 0.027131, -0.052785, 0.063347, 0.035317, 0.035762, 0.047505, 0.009293, -0.06218, 0.018333, 0.010048, 0.066793, -0.044665, -0.031067, 0.011486, -0.051078, 0.075496, -0.020568, -0.005873, -0.048706, -0.035552, 0.016814, 0.052093, 0.040859, -0.006404, -0.012192, 0.020626, 0.038457, 0.016385, -0.00937, -0.002545, 0.020998, 0.011422, 0.009125, -0.013382, -0.046638, -0.024781, -0.016758, -0.015613, -0.047654, 0.005235, -0.023236, -0.021968, 0.059292, 0.067647, 0.015428, 0.01499, 0.009575, 0.044618, -0.038565, -0.031615, -0.012194, -0.024584, -0.021103, -0.009642, 0.050397, -0.016976, 0.031926, 0.031724, -0.023033, 0.022695, -0.012005, 0.028346, -0.042766, -0.00488, -0.007689, -0.017809, 0.00749, 0.006155, 0.003553, -0.025774, -0.029422, 0.052448, 0.020289, -0.011146, 0.018808, -0.036821, -0.037175, 0.001195, -0.019562, -0.016171, 0.033883, -0.027751, 0.008279, 0.035323, -0.031213, 0.01689, 0.035743, -0.042256, 0.032213, 0.003422, 0.002113, 0.039514, 0.017372, -0.026301, 0.008616, 0.040113, 0.039081, 0.068599, 0.036847, -0.048279, 0.017155, 0.019553, -0.029391, 0.067894, 0.038268, 0.002155, -0.016381, 0.03276, -0.051384, 0.057214, 0.022794, 0.049229, 0.0002, 0.025539, -0.021433, -0.00598, -0.037329, 0.061178, -0.015724, 0.047727, 0.101877, 0.051952, 0.002468, 0.034056, 0.011349, 0.05416, 0.003528, 0.008505, -0.008947, -0.005862, -0.037672, 0.002668, -0.007026, -0.019951, 0.069019, 0.04222, -0.008218, 0.016634, -0.000408, 0.043838, 0.011228, 0.018552, 0.007062, -0.024807, 0.007273, -0.010996, -0.045795, -0.04002, -0.012421, -0.002459, 0.016574, -0.049586, 0.05254, -0.071079, -0.024123, -0.016801, -0.053191, 0.0108, -0.001798, -0.022168, -0.040848, 0.018544, -0.026771, 0.028674, -0.013092, 0.006996, 0.064428, 0.003268, -0.031746, -0.030613, 0.003696, -0.04388, 0.012437, -0.014279, 0.017421, -0.029546, -0.004581, 0.005505, 0.014321, 0.032569, 0.086621, 0.048243, 0.068902, 0.01627, -0.042168, 0.010103, -0.047062, 0.044805, -0.005042, -0.018889, 0.019037, -0.032323, 0.024295, 0.061692, 0.054214, 0.000119, -0.016199, -0.038415, -0.010464, 0.015621, 0.026354, 0.009491, 0.009827, 0.05231, -0.035527, 0.036422, -0.016576, 0.046716, 0.002289, -0.033171, -0.002789, 0.081125, 0.042662, 0.003972, 0.004482, -0.010893, -0.01897, 0.034929, -0.034731, -0.016709, -0.040042, -0.039906, 0.067596, -0.028689, 0.001787, -0.026913, -0.004452, -0.004687, 0.014398, -0.036045, 0.036484, 0.009519, 0.019115, -0.013701, 0.009453, -0.008592, 0.021324, 0.04165, 0.031958, 0.034321, -0.007663, 0.044368, 0.019437, -0.021369, -0.014421, 0.028154, 0.012443, 0.028694, -0.013007, -0.007069, -0.009244, 0.048745, 0.023002, -0.017095, -0.075635, -0.00415, 0.006508, 0.019883, -0.023402, -0.012638, -0.032638, 0.049652, -0.022371, 0.011487, 0.007752, 0.028083, -0.023767, -0.048049, 0.032885, -0.011576, 0.027658, -0.040324, 0.009368, -0.042296, -0.01395, 0.023305, -0.031345, 0.009566, -0.002223, 0.001221, -0.016502, -0.010469, -0.019017, 0.002881, -0.002105, -0.010363, -0.002573, 0.024909, -0.041355, -0.02142, -0.005711, 0.036485, 0.005745, 0.016178, 0.018276, 0.010891, 0.002427, 0.008954, 0.025936, -0.027367, -0.002314, -0.005163, -0.012281, 0.013734, 0.009741, -0.005757, 0.007926, 0.041395, 0.05061, -0.011352, 0.009688, -0.010112, -0.00186, 0.006204, 0.002025, -0.059236, -0.02474, 0.00775, 0.018322, 0.027497, 0.006386, -0.034504, 0.00612, 0.000337, -0.014648, -0.04182, -0.041928, -0.000866, 0.02912, 0.025649, -0.019669, 0.0115, 0.028639, -0.015587, -0.00253, 0.007013, 0.004356, 0.0355, -0.002211, -0.002103, -0.024985, 0.008677, -0.031785, 0.00013, -0.000705, -0.006222, -0.022163, 0.03106, 0.001395, -0.014595, 0.018201, -0.034539, -0.002836, 0.034745], "input_ids": [641, 1235, 25, 16246, 264, 4008, 315, 1246, 264, 6573, 315, 4627, 10362, 476, 11074, 11, 476, 315, 264, 4445, 432, 27976, 11, 17179, 4627, 429, 9071, 432, 198, 2859, 14495, 11532, 311, 15254, 311, 518, 264, 7324, 4614, 151643]}, {"query": "I just got dumped and want something that hurts in a good way", "vector": [0.437251, -0.199139, -0.087866, -0.064321, -0.010544, -0.019679, -0.018545, -0.079563, -0.032132, 0.056996, -0.061226, 0.072231, 0.025003, 0.037509, 0.11835, -0.004925, 0.111983, -0.064409, -0.035716, 0.144408, -0.130013, 0.019042, -0.043381, 0.018038, 0.069902, 0.043984, 0.048685, 0.115197, 0.011606, 0.07995, -0.052483, 0.072108, 0.044648, -0.063891, -0.153875, -0.10569, 0.01783, 0.028159, 0.081106, -0.006548, -0.042624, -0.024804, -0.025507, -0.050959, 0.06657, -0.065327, 0.015746, 0.07283, -0.093813, -0.042155, -0.081474, 0.026336, 0.014288, 0.043243, 0.092635, 0.072158, 0.009505, 0.090552, -0.005768, -0.031685, -0.034286, -0.02567, -0.025176, -0.078235, -0.047787, -0.002003, -0.024186, 0.025141, -0.076523, 0.015012, -0.024957, -0.007429, 0.009524, 0.037639, 0.043076, -0.128089, 0.045608, -0.020246, 0.016137, 0.11254, 0.046517, 0.024708, -0.010964, -0.01812, -0.025947, 0.067605, -0.003273, -0.040237, -0.01037, -0.056188, -0.047939, -0.070665, 0.039858, -0.066777, 0.045825, 0.002437, -0.088985, -0.02262, -0.044809, -0.031746, 0.042265, -0.007368, 0.069578, 0.004672, -0.005328, -0.035015, 0.001719, 0.002165, -0.035989, 0.07447, 0.081769, 0.071645, 0.072523, 0.004865, 0.018444, -0.047169, 0.005494, -0.003544, 0.028919, -0.003606, 0.010392, -0.037257, -0.019115, 0.012122, -0.056731, -0.019586, -0.010903, -0.05074, 0.009699, -0.079772, -0.006409, 0.001628, 0.044638, 0.002148, -0.011083, 0.04525, 0.02513, -0.020945, -0.011816, 0.046793, 0.009025, 0.008023, -0.084512, 0.002387, 0.075716, 0.013266, -0.031179, -0.024529, -0.034651, -0.036808, 0.014079, 0.016529, -0.068272, 0.046254, -0.014446, 0.027313, -0.003606, 0.042222, -0.07368, -0.059756, 0.004365, -0.045331, -0.009641, -0.014772, 0.010762, -0.018229, 0.001348, 0.003367, 0.028721, -0.023076, -0.023037, -0.052958, -0.024017, 0.033891, -0.042988, 0.058358, -0.062306, 0.036139, -0.085488, 0.045173, -0.034207, 0.04684, 0.008231, -0.063844, 0.076488, 0.045597, 0.036243, -0.012945, 0.020146, 0.04711, 0.085618, -0.016813, 0.006496, -0.034443, -0.005438, 0.015316, -0.023328, -0.04342, 0.040998, -0.018386, 0.013578, 0.020705, 0.000921, 0.063074, -0.022452, 0.011781, -0.017627, 0.001716, -0.039805, -0.06243, 0.040576, -0.064981, 0.011441, -0.034984, 0.035412, 0.00699, 0.002711, -0.019043, -0.040534, 0.011183, 0.014871, 0.034763, -0.025103, -3e-05, 0.029742, -0.01213, 0.007354, -0.044985, -0.03583, 0.046864, -0.016078, 0.041489, -0.005773, 0.03423, 0.015569, 0.002061, 0.002514, 0.026508, 0.008612, -0.016069, 0.022098, -0.030062, -0.022269, -0.005688, 0.046301, -0.030628, 0.038027, -0.001773, -0.028691, 0.019128, 0.003247, -0.052098, 0.039786, 0.062309, 0.012744, 0.023084, 0.033568, 0.013142, 0.000903, -0.005587, 0.031496, -0.008134, 0.021316, 0.04497, -0.046377, 0.01878, -0.002919, 0.063354, -0.002993, 0.00481, -0.045918, 0.002932, 0.06859, 0.054758, -0.008352, 0.001902, -0.029011, -0.00306, 0.027567, -0.017976, -0.016133, 0.032118, 0.003252, 0.051871, 0.013102, -0.010141, -0.038149, -0.03459, 0.000989, 0.015706, 0.020697, -0.052089, 0.029288, 0.039493, 0.016717, 0.050262, -0.024278, -0.038813, -0.021606, -0.047581, -0.003145, -0.05325, 0.035226, 0.001187, -0.007906, -0.000191, 0.006541, 0.0231, 0.040409, -0.032652, 0.048071, -0.021426, 0.036675, -0.005286, 0.017287, 0.04119, -0.005616, 0.048218, -0.011256, -0.011084, 0.011723, 0.031248, -0.06067, -0.028984, 0.023461, -0.014924, -0.032437, -0.003631, 0.019235, -0.034479, -0.004306, 0.070319, -0.023527, -9e-05, 0.009467, 0.037079, 0.049703, 0.017283, 0.001969, -0.031023, 0.014445, -0.030069, -0.016981, -0.030647, 0.000713, 0.012533, -0.015246, -0.021861, 0.001005, -0.024677, -0.046262, 0.034477, 0.055527, -0.017146, 0.030394, 0.00298, -0.005236, 0.011215, 0.048699, -0.000454, -0.033425, -1.4e-05, -0.011855, 0.056591, -0.026317, -0.024572, 0.05053, -0.029737, -0.018997, 0.055604, 0.022454, -0.004748, -0.00371, 0.043945, -0.036405, 0.009237, -0.065513, 0.002377, -0.065208, 0.028366, 0.058345, 0.012216, -0.046409, -0.008085, -0.042302, 0.038231, 0.021766, -0.008303, 0.06213, -0.041214, 0.017296, 0.007856, -0.02922, -0.024656, 0.055276, -0.009324, 0.022954, -0.005841, 0.001217, 0.027143, -0.024495, -0.026338, -0.010965, 0.023649, -0.022516, -0.004242, -0.044017, -0.028745, 0.037121, -0.007535, 0.019122, -0.021888, -0.024519, -0.007267, -0.023496, 0.008005, -0.042465, 0.045319, -0.057786, 0.033204, -0.062775, -0.002924, -0.038458, 0.029716, -0.028389, -0.067703, -0.029994, 0.020298, 0.014625, -0.027408, 0.019281, 0.008726, 0.016905, 0.006925, -0.016101, -0.010506, 0.052314, -0.043749, -0.048339, 0.023493, -0.023314, 0.015353, 0.002669, -0.01887, -0.008639, 0.058984, 0.007959, -0.00805, -0.030032, 0.042373, 0.028487, 0.000604, 0.023622, 0.026912, 0.016432, -0.005994, 0.002236, -0.00078, -0.005235, 0.008886, -0.012376, -0.003201, 0.023331, -0.02055, -0.023095, 0.009845, 0.030012, 0.001297, -0.012381, -0.027387, 0.03577, 0.006024, -0.001835, -0.015938, -0.005125, -0.015216, -0.028741, 0.022875, 0.004421, 0.010226, 0.00995, -0.024446, -0.009679, -0.02495, -0.021058, -0.01851, 0.003259, 0.023409, -0.005495, -0.01175, 0.056167, 0.040192, 0.021468, 0.024182, -0.002808, 0.004699, -0.037093, 0.008463, -0.019105, -0.001797, -0.011008, -0.025125, 0.008913, -0.001347, -0.009148, -0.006661, -0.000196, -0.016401, 0.020544, 0.043032, 0.020629, 0.005801], "input_ids": [641, 1235, 25, 16246, 264, 4008, 315, 1246, 264, 6573, 315, 4627, 10362, 476, 11074, 11, 476, 315, 264, 4445, 432, 27976, 11, 17179, 4627, 429, 9071, 432, 198, 2859, 57155, 1101, 2684, 48273, 323, 1366, 2494, 429, 43064, 304, 264, 1661, 1616, 151643]}, {"query": "upbeat but melancholic, no vocals", "vector": [0.537263, 0.130001, 0.039916, 0.085039, 0.187985, -0.071962, -0.002231, -0.018549, 0.01143, 0.055039, 0.010713, 0.009172, 0.033704, 0.053015, -0.024994, 0.039902, -0.049035, -0.095409, -0.02111, 0.00086, -0.034074, -0.025482, -0.067456, -0.041997, 0.080145, -0.05187, 0.02217, -0.031882, -0.072497, -0.004819, -0.09541, 0.112422, 0.055607, -0.065281, -0.067917, -0.021112, 0.076941, 0.021218, -0.005884, -0.107557, -0.00221, -0.054261, 0.056742, -0.003846, 0.01981, -0.07575, 0.099273, 0.063008, -0.114297, 0.034207, -0.000912, 0.018086, 0.035176, -0.018579, -0.006317, 0.077082, 0.039896, 0.099025, -0.029891, -0.042447, -0.041708, 0.015288, -0.026906, -0.058212, 0.072433, 0.071106, -0.095385, -0.010748, -0.044605, -0.053569, -0.000388, -0.037207, -0.02103, 0.050075, 0.04556, -0.094532, 0.021043, 0.079205, 0.032625, 0.068443, 0.005318, -0.006425, -0.013166, -0.076988, 0.026086, 0.030379, 0.03786, 0.054715, -0.028843, -0.011151, -0.007053, 0.017422, -0.013339, 0.004936, -0.010541, 0.000959, -0.045262, 0.068161, 0.000399, 0.05136, 0.042241, 0.011589, 0.037318, 0.011537, -0.013388, -0.015582, -0.017909, 0.047264, 0.002382, -0.055804, 0.085921, 0.047916, 0.044471, 0.008703, -0.03374, 0.004078, -0.026959, 0.070473, -0.010528, -0.018586, 0.02102, -0.011682, -0.05335, -0.052315, -0.018775, 0.023872, -0.015929, 0.017821, 0.011993, -0.100818, 0.006918, 0.011453, 0.059956, -0.010559, 0.044905, 0.005578, -0.021856, -0.040642, -0.003671, -0.101185, -0.013252, -0.028685, -0.002781, 0.016948, -0.003602, -0.024367, 0.021347, -0.020079, -0.071798, -0.004163, 0.039286, 0.014966, -0.044326, -0.030459, -0.078849, 0.086523, 0.056484, -0.046448, 0.016559, -0.001904, 0.066339, 0.060139, 0.06907, 0.020312, 0.021302, 0.015067, 0.008647, -0.049004, 0.021289, -0.040932, -0.003523, -0.013369, -0.070499, 0.066301, 0.038978, 0.030474, -0.055172, 0.001587, -0.020425, 0.001544, -0.004465, 0.008349, -0.05569, -0.015567, 0.042244, 0.03969, 0.049324, 0.016712, 0.045652, 0.007427, 0.067637, -0.0153, -0.048713, -0.016125, -0.007935, -0.023044, -0.022508, -0.016379, 0.015659, 0.029752, -0.000821, -0.013386, 0.011974, 0.013961, 0.016303, -0.028094, -0.057159, 0.020744, -0.021502, 0.018424, 0.024613, -0.022465, 0.04741, 0.007456, -0.066718, 0.013734, 0.003415, 0.06251, 0.011173, 0.000647, 0.049063, -0.020796, -0.04251, -0.024622, -0.009956, -0.020052, 0.016032, -0.005434, -0.070136, -0.003404, -0.005635, 0.053635, -0.038925, 0.063597, 0.034139, -0.039631, 0.017311, 0.010271, -0.007256, -0.0148, 0.025534, 0.033362, -0.047935, 0.020538, -0.002613, -0.012648, 0.07466, 0.016728, 0.029667, 0.028669, 0.01526, 0.010929, -0.027137, 0.00862, 0.014325, 0.027227, 0.027613, 0.029844, 0.00241, -0.035974, -0.024795, 0.026239, 0.042166, 0.052043, -0.00881, -0.006188, -0.046924, 0.044832, -0.003898, 0.037335, -0.014283, -0.00766, 0.007949, 0.015684, -0.001713, -0.011504, -0.019648, 0.004973, 0.054474, -0.018396, -0.027055, 0.017932, 0.013833, 0.059385, 0.039007, 0.033154, 0.021095, 0.026525, 0.033756, 0.034877, 0.003102, 0.014473, 0.015598, 0.05614, 0.026149, 0.062041, 0.028034, 0.063997, -0.009535, -0.030426, 0.015644, 0.003648, 0.031355, 0.010809, 0.004882, -0.039357, -0.015911, -0.018773, 0.013971, -0.031288, -0.000573, -0.01187, 0.046839, 0.027957, -0.030867, 0.028091, -0.077707, -0.007768, 0.049326, -0.025592, -0.029783, 0.029945, 0.056419, 0.038918, -0.011379, 0.015824, -0.034852, -0.039566, -0.032864, -0.014999, 0.001728, 0.033829, -0.014244, 0.0501, -0.026391, -0.015807, 0.003012, 0.0021, 0.026238, -0.010381, 0.037096, -0.056696, -0.050776, -0.021021, -0.030115, 0.067179, 0.020577, -0.035566, -0.022724, -0.054335, -0.020197, 0.040043, 0.043783, -0.003686, 0.025113, 0.01386, 0.01939, 0.050099, -0.027323, 0.013483, -0.043239, -0.023473, -0.011161, 0.022849, 0.012469, 0.006889, -0.009257, -0.012693, -0.004041, 0.048583, 0.050581, -0.005626, 0.014624, -0.029794, 0.025651, -0.04302, -0.021772, -0.020991, 0.027266, -0.00823, -0.026421, 0.011227, -0.048122, 0.003318, -0.047364, 0.048364, -0.023994, 0.035847, 0.024935, -0.029376, -0.029766, -0.058777, -0.047058, 0.038506, 0.029639, -0.024908, 0.022415, 0.025484, -0.013703, 0.01553, 0.004313, 0.014963, -0.009451, 0.011481, -0.008065, 0.012406, -0.048703, -0.03767, -0.000946, -0.00233, 0.016134, 0.009145, 0.013741, 0.004219, 0.019835, -0.034577, -0.017709, -0.00613, 0.02328, 0.00513, -0.010869, -0.020604, 0.020018, -0.009155, -0.043854, -0.013417, -0.015481, 0.030056, -0.00151, -0.036977, 0.025183, -0.002289, 0.000878, 0.027996, -0.020798, -0.022085, -0.022105, -0.028302, 0.018164, 0.001798, -0.025373, -0.008084, -0.016608, -0.021142, -0.01438, 0.02195, -0.011719, 0.007276, -0.034891, 0.036764, -0.019666, -0.01739, -0.020502, 0.022879, 0.048859, 0.011108, -0.032811, -0.028569, -0.031345, 0.01178, 0.008451, -0.040998, -0.00443, 0.004828, 0.010131, -0.00533, 0.008063, -0.000163, -0.028091, -0.001964, 0.043608, -0.001771, -0.035194, -0.016379, -0.000138, -0.014766, -0.007186, -0.005812, 0.013819, -0.012927, -0.02398, 0.024916, 0.019546, -0.006134, -0.016931, 0.01467, 0.013533, -0.019022, 0.028656, -0.018139, 0.010607, 0.023768, -0.007815, -0.003113, -0.024535, 0.00828, -0.009972, -0.015077, -0.075545, -0.000382, -0.002634, 0.006237, -0.01269, -0.030293, -0.007097, -0.011853, -0.014635, 0.025451, 0.017905, -0.035638, -0.003449, 0.051472], "input_ids": [641, 1235, 25, 16246, 264, 4008, 315, 1246, 264, 6573, 315, 4627, 10362, 476, 11074, 11, 476, 315, 264, 4445, 432, 27976, 11, 17179, 4627, 429, 9071, 432, 198, 2859, 25, 454, 22227, 714, 86063, 7762, 11, 902, 46096, 151643]}, {"query": "sounds like a neon city at 3am", "vector": [0.544808, 0.065895, -0.201714, -0.036626, -0.074407, 0.072528, 0.082339, -0.010483, 0.109895, -0.004123, 0.09968, 0.093018, 0.018639, -0.062674, -0.021353, -0.007929, 0.13578, 0.025387, -0.083471, -0.007839, -0.101239, -0.02837, -0.037517, -0.103965, -0.027608, -0.030478, 0.025656, 0.068935, 0.031684, -0.013251, -0.012641, -0.006006, 0.036325, 0.024567, -0.051614, 0.000592, 0.082769, 0.043008, 0.058077, 0.020571, -0.02596, 0.037135, -0.005226, -0.052077, -0.022412, 0.007449, -0.009406, -0.047868, -0.040633, 0.036479, -0.015719, -0.046721, -0.080084, 0.023358, -0.028306, -0.020692, -0.072322, -0.047454, -0.024995, 0.054233, -0.080441, 0.026007, 0.000539, -0.070257, 0.044206, 0.009118, -0.02904, -0.049112, -0.032031, 0.006529, -0.038781, -0.098189, 0.044175, -0.005577, -0.014797, 0.009316, -0.025178, 0.031575, 0.054022, 0.04849, 0.028297, -0.030375, -0.049524, -0.025303, -0.011535, 0.022067, 0.134663, 0.028195, -0.004528, 0.059163, 0.030277, -0.052892, 0.089541, 0.023794, -0.065769, 0.037137, -0.059876, 0.039398, 0.044044, 0.032715, 0.060236, -0.059166, 0.003112, -0.122548, -0.149164, 0.011824, 0.001895, 0.041016, -0.066293, -0.001945, 0.046244, -0.037119, 0.029519, 0.036296, -0.004505, -0.002738, 0.019973, 0.003737, -0.026629, -0.078815, -0.00322, 0.032644, -0.006263, -0.02415, -0.044542, 0.015888, 0.042592, 0.013339, -0.010181, -0.002865, -0.023955, -0.000649, 0.035104, 0.023287, 0.049341, -0.048573, -0.002756, 0.051984, 0.050909, 0.003013, -0.00082, -0.061376, -0.065601, 0.024769, 0.050661, 0.019184, -0.050513, -0.013191, -0.075497, 0.004121, -0.037003, 0.012104, -0.046853, 0.043898, -0.056407, 0.08707, 0.041493, 0.005661, 0.061848, 0.024232, -0.022872, -0.036729, -0.034507, -0.015035, 0.025571, 0.008293, 0.006271, -0.049016, 0.072785, -0.004383, -0.048587, -0.083077, -0.03128, 0.019247, -0.000974, 0.038555, 0.003099, 0.030594, -0.019941, -0.041616, 0.016606, 0.029334, 0.006135, -0.053294, -0.004183, 0.000538, 0.040498, 0.001713, -0.03479, -0.025951, 0.054766, 0.026687, 0.005126, -0.036902, -0.020644, -0.0034, -0.016893, -0.018868, 0.013281, 0.001733, 0.010029, -0.060086, -0.037041, 0.017143, 0.02787, -0.032257, 0.032441, -0.026047, -0.049385, 0.027053, 0.041479, -0.036163, 0.006425, 0.045497, -0.024897, -0.010454, -0.010718, -0.02971, -0.004771, 0.012935, 0.042687, -0.04953, 0.020831, 0.000688, 0.00816, 0.021528, -0.040842, -0.063262, -0.061219, 0.062743, -0.077252, -0.001991, -0.043626, -0.031885, 0.006644, 0.003185, 0.023511, -0.00575, 0.012267, 0.019825, 0.001536, -0.016748, -0.010233, 0.007181, -0.016544, 0.036656, 0.059561, 0.00112, 0.002511, 0.027835, -0.022796, -0.041191, 0.041906, -0.01744, 0.021977, 0.032565, 0.036993, -0.039822, 0.044765, 0.015569, 0.014792, -0.000332, -0.023332, 0.002678, -0.024861, -0.027495, -0.02274, 0.059989, 0.007597, 0.031973, 0.010931, -0.011201, -2.5e-05, -0.004997, -0.018736, -0.027506, 0.007841, 0.001923, 7.6e-05, -0.00348, -0.036915, 0.022826, -0.011997, 0.051197, 0.0106, 0.000394, 0.035678, 0.028162, 0.022791, -0.008165, -0.009579, -0.048431, 0.017831, 0.008395, 0.037816, 0.014223, -0.036565, 0.014186, -0.065381, -0.025515, 0.022573, 0.011908, 0.01185, -0.018609, -0.043469, -0.017099, -0.030902, 0.003041, 0.036049, 0.01523, -0.00335, -0.048724, 0.051584, 0.018704, 0.039402, 0.012422, -0.04454, -0.020392, -0.00888, 0.017886, -0.037728, 0.032715, 0.011419, -0.01339, 0.001994, -0.063846, 0.028156, -0.006494, -0.01948, -0.033815, 0.021191, 0.002637, -0.025622, -0.031057, 0.02325, -0.033831, 0.053309, 0.034222, 0.000651, 0.043337, 0.054628, 0.021596, -0.034371, -0.021919, -0.006042, -0.008544, 0.024508, -0.018299, -0.044139, 0.030943, -0.050568, 0.029052, 0.058997, -0.019805, -0.011777, -0.003207, 0.01631, 0.037659, -0.014142, -0.029693, -0.007125, -0.02621, -0.004891, 0.004325, 0.019167, -0.004842, 0.020761, -0.020111, -0.028084, 0.060061, 0.05704, 0.002327, 0.00084, 0.043053, -0.01719, 0.003688, 0.000405, -0.021064, -0.003884, 0.026005, 0.030661, 0.018113, -0.013703, 0.001265, -0.009322, -0.020521, 0.003736, 0.020081, -0.002752, -0.025758, 0.037312, -0.050279, -0.03024, 0.002616, 0.010934, -0.01263, 0.054502, 0.00289, -0.012621, 0.027616, -0.018483, 0.01863, 0.00658, 0.00786, -0.004437, -0.007617, -0.032383, -0.020239, -0.031064, -0.016088, 0.04476, -0.038203, 0.009206, -0.029008, 0.001488, 0.002879, -0.049418, 0.029547, 0.016658, 0.012976, -0.03765, 0.007415, -0.059655, 0.025869, -0.038348, -0.05282, 0.009337, -0.00437, 0.012479, -0.006093, 0.008723, 0.022786, -0.016434, -0.011764, -0.040182, -0.042101, 0.028877, -0.032814, -0.034815, 0.017289, -0.016796, -0.006153, -0.005675, -0.006079, -0.017169, 0.042952, -0.02506, -0.023189, 0.00114, -0.000422, 0.0008, -0.018644, 0.033395, 0.035593, -0.001017, 0.000317, 0.03038, 0.012671, -0.031099, 0.011896, 0.0341, -0.000112, -0.02034, 0.031925, 0.009897, 0.035703, 0.003323, 0.03053, 0.027622, -0.012754, 0.014461, 0.022101, 0.006562, -0.023323, -0.03795, -0.020029, -0.000469, 0.019466, -0.015442, -0.025482, 0.002855, -0.019748, 0.027431, -0.006764, -0.047395, 0.025495, 0.016773, -0.018084, -0.033103, 0.012686, 0.03307, -0.020155, -0.013902, 0.029512, 0.021975, 0.01712, 0.006047, 0.001748, 0.00753, -0.011865, 0.000127, -0.018894, 0.042479, 0.013981, -0.022671, 0.002458, 0.01408, 0.043276, 0.009255, 0.022059, -0.042036, 0.033451], "input_ids": [641, 1235, 25, 16246, 264, 4008, 315, 1246, 264, 6573, 315, 4627, 10362, 476, 11074, 11, 476, 315, 264, 4445, 432, 27976, 11, 17179, 4627, 429, 9071, 432, 198, 2859, 14495, 3095, 1075, 264, 46652, 3283, 518, 220, 18, 309, 151643]}], "audio": {"mn20_as": [0.884677, 0.178047, 0.110852, -0.112718, -0.127523, 0.032097, 0.08004, 0.139187, -0.026441, -0.025732, -0.0036, 0.062365, -0.081567, -0.053306, 0.131207, -0.006478, 0.040466, 0.070919, 0.018695, 0.034105, 0.026123, 0.06575, 0.021522, -0.050446, -0.085595, -0.024919, 0.00827, 0.01113, 0.047158, 0.089948, -0.022122, 0.034115, 0.116938, 0.017057, -0.041192, 0.024911, -0.006995, 0.00512, -0.01946, 0.013502, -0.001546, 0.037766, 0.012276, -0.00434, 0.025332, -0.012091, -0.001598, 0.017392, -0.010714, 8.7e-05, -0.013785, 0.032292, -0.028163, -0.028314, 0.033682, 0.008355, -0.034726, 0.02855, 0.013911, 0.009482, 0.008325, -0.005153, 0.016219, -0.006815, 0.000599, -0.000753, -0.002983, -0.010823, -0.028578, 0.03524, 0.002395, 0.000193, -0.030185, 0.013127, 0.015966, -0.013755, -0.020603, 0.010651, -0.010937, 0.007395, -0.020212, -0.005532, -0.017791, -0.024392, -0.024068, -0.002089, -0.009146, 0.005131, 0.000514, -0.013067, 0.002569, -0.015774, -0.016128, -0.006796, -0.008098, 0.003405, 0.014682, 0.001769, -0.001234, -0.007046, 0.004163, 0.01088, 0.017552, -0.008663, 0.000224, 0.000446, -0.007487, -0.007413, -0.004599, 0.008949, -0.020437, -0.013179, -0.021011, 0.011181, 0.0182, -0.014854, 0.00534, -0.001916, -0.008588, -0.01379, -0.011435, 0.003627, 0.011994, 0.008127, -0.007482, 0.006446, -0.00425, -0.00727, -0.004966, 0.01153, 0.008974, -0.004049, 0.004621, -0.006169, 0.003495, -0.002867, 0.0031, -0.016785, -0.016665, -0.006054, 0.002186, -0.000315, -0.004158, 0.009605, 0.017285, -0.009541, -0.004839, 0.002, 0.015385, 0.011687, 0.008729, -0.013583, -0.010783, -0.008274, 0.000301, -0.007895, -0.010689, -0.008134, 0.003272, -0.006454, -0.020808, 0.002113, -0.004323, -0.001209, -0.000741, -0.030036, 0.002562, -0.007348, -0.011812, 0.003314, 0.009551, -0.005418, 0.02167, -0.003817, 0.007962, -0.002626, 0.005213, -0.008208, 0.001327, 0.008688, -0.006616, 0.006494, -0.012173, 0.000473, 0.006294, -0.017232, -0.000951, 0.008241, -0.004113, 0.005658, -0.008635, -0.002679, 0.014154, -0.002539, -0.007188, -0.000932, 0.003905, -0.011806, 0.014731, -0.016437, 0.005337, -0.008703, -0.00252, 0.011153, 0.002197, 0.001126, 0.007643, -0.006396, 0.007029, 0.006987, -0.008621, 0.00038, 0.012744, 0.004225, -0.000192, -0.000269, -0.005617, -0.002237, -0.004918, -0.014503, -0.001458, -0.009063, -0.008946, 0.001498, -0.009929, 0.003657, -0.000465, -0.001004, -0.001943, -0.002169, 0.002566, 0.001301, -0.006427, 0.001381, -0.007559, -0.001848, -3.5e-05, 0.001326, 0.006025, -7.5e-05, -0.003485, 0.002824, -0.000166, -0.001077, -0.003571, 1.5e-05, 0.007706, -0.002859, -0.003961, 0.007879, 0.006949, -0.000647, 0.008086, 0.001833, 0.004481, -0.000396, -0.007767, 0.00313, -5e-06, -0.008, 7.2e-05, 0.006326, -0.006613, 0.002005, 0.00354, 0.001589, -0.001619, 0.002772, -0.002868, -0.00732, 0.011442, 0.006757, 0.000887, -0.001546, 0.00404, -0.003805, -0.000935, -0.000769, 0.003467, 0.008004, 0.005388, 0.003733, -0.003016, -0.003252, 0.003899, -0.000851, -0.004547, -0.010178, 0.008415, 0.008418, -0.006802, -0.002741, 0.001161, -0.001224, -0.007931, 0.003538, 0.003122, 0.000302, 0.002822, 0.003161, -0.00067, -0.002333, -0.004209, -0.000907, 0.003378, 0.003283, 0.002, -0.004056, -0.00462, 0.002722, -0.00419, 0.004576, -0.002429, -0.008145, -0.000669, -0.003444, -0.00612, 0.004123, 0.000338, -0.002875, -0.004913, -0.000579, -0.006742, -0.002801, 0.005017, 0.000116, 0.004556, -0.005455, 0.000427, -0.008282, -0.004807, -0.002015, -0.002166, -0.005136, 0.001738, 0.005796, -0.000502, -0.003968, 0.003282, 0.003111, -0.003464, -0.00259, -9.3e-05, -0.00058, -0.000315, -0.000124, -0.000944, -0.003987, 0.006711, -0.003203, -0.009028, 0.000149, -0.002791, 0.00093, -9.2e-05, -0.000979, 0.00376, 0.003239, -0.003177, 0.00789, 0.00607, 0.001069, 0.003095, -0.002355, 0.003542, -0.000879, -0.000192, 0.000614, 0.002463, -0.000277, 0.001551, -0.00096, -0.000555, -0.002244, 0.001471, -0.004263, -0.000327, -0.002529, 0.005464, 0.005041, -0.006095, -0.000927, 0.005793, 0.002741, 0.002241, 0.001709, 0.002131, -0.006105, -2.6e-05, -0.006769, -0.004206, 0.002284, -0.001288, -0.007282, -0.002174, 0.004637, -0.000934, -0.001635, 0.003793, 0.001389, 0.008106, -0.003569, -0.001103, -0.000189, 2.3e-05, 0.001124, 0.004643, 0.001556, -0.000782, 0.000647, 0.004972, -0.002441, -0.002859, -0.000902, -0.0033, 0.005236, 0.004095, 0.004694, -0.00493, 0.001573, 0.002148, 0.003873, -0.001837, 0.001216, 0.000766, 0.001559, -0.002694, 0.00306, 0.005443, 0.007167, -0.003925, -0.002194, -0.007278, 0.00178, 0.000996, 0.002159, 0.002829, -0.003636, 0.002685, 0.001338, -0.004143, -0.003068, -0.001795, -0.003996, -0.001382, -0.004506, 0.002091, 0.003376, 0.003115, 0.000794, -0.000788, 0.003553, -0.001909, -6.9e-05, -0.002457, 0.000998, 0.004423, 0.002469, -0.000319, -0.000336, 0.004238, -0.000425, 0.000643, -0.004788, 0.001138, -0.002579, 0.000343, 0.003834, 0.001392, -0.002489, 0.002097, 0.000757, -0.001981, 0.00562, 0.001733, 0.00147, 0.001814, -0.000142, 0.000914, 0.001167, 0.003017, 0.00765, -0.000846, -0.001376, 0.004185, -0.000859, 0.000462, -0.000913, -0.001501, -0.000846, -0.000851, 0.002277, 0.007043, -0.00305, 0.003615, -0.001089, -0.000335, -0.004058, -0.000634, 0.000877, -0.001618, 0.001278, -0.005522, 0.00088, -0.008068, -0.005328, -0.002183, 0.003321, -0.000738, 0.001492, 0.003649, -0.002215]}}
plugin/LICENSE ADDED
@@ -0,0 +1,695 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ GNU AFFERO GENERAL PUBLIC LICENSE
2
+ Version 3, 19 November 2007
3
+
4
+ Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
5
+ Everyone is permitted to copy and distribute verbatim copies
6
+ of this license document, but changing it is not allowed.
7
+
8
+ Preamble
9
+
10
+ The GNU Affero General Public License is a free, copyleft license for
11
+ software and other kinds of works, specifically designed to ensure
12
+ cooperation with the community in the case of network server software.
13
+
14
+ The licenses for most software and other practical works are designed
15
+ to take away your freedom to share and change the works. By contrast,
16
+ our General Public Licenses are intended to guarantee your freedom to
17
+ share and change all versions of a program--to make sure it remains free
18
+ software for all its users.
19
+
20
+ When we speak of free software, we are referring to freedom, not
21
+ price. Our General Public Licenses are designed to make sure that you
22
+ have the freedom to distribute copies of free software (and charge for
23
+ them if you wish), that you receive source code or can get it if you
24
+ want it, that you can change the software or use pieces of it in new
25
+ free programs, and that you know you can do these things.
26
+
27
+ Developers that use our General Public Licenses protect your rights
28
+ with two steps: (1) assert copyright on the software, and (2) offer
29
+ you this License which gives you legal permission to copy, distribute
30
+ and/or modify the software.
31
+
32
+ A secondary benefit of defending all users' freedom is that
33
+ improvements made in alternate versions of the program, if they
34
+ receive widespread use, become available for other developers to
35
+ incorporate. Many developers of free software are heartened and
36
+ encouraged by the resulting cooperation. However, in the case of
37
+ software used on network servers, this result may fail to come about.
38
+ The GNU General Public License permits making a modified version and
39
+ letting the public access it on a server without ever releasing its
40
+ source code to the public.
41
+
42
+ The GNU Affero General Public License is designed specifically to
43
+ ensure that, in such cases, the modified source code becomes available
44
+ to the community. It requires the operator of a network server to
45
+ provide the source code of the modified version running there to the
46
+ users of that server. Therefore, public use of a modified version, on
47
+ a publicly accessible server, gives the public access to the source
48
+ code of the modified version.
49
+
50
+ An older license, called the Affero General Public License and
51
+ published by Affero, was designed to accomplish similar goals. This is
52
+ a different license, not a version of the Affero GPL, but Affero has
53
+ released a new version of the Affero GPL which permits relicensing under
54
+ this license.
55
+
56
+ The precise terms and conditions for copying, distribution and
57
+ modification follow.
58
+
59
+ TERMS AND CONDITIONS
60
+
61
+ 0. Definitions.
62
+
63
+ "This License" refers to version 3 of the GNU Affero General Public License.
64
+
65
+ "Copyright" also means copyright-like laws that apply to other kinds of
66
+ works, such as semiconductor masks.
67
+
68
+ "The Program" refers to any copyrightable work licensed under this
69
+ License. Each licensee is addressed as "you". "Licensees" and
70
+ "recipients" may be individuals or organizations.
71
+
72
+ To "modify" a work means to copy from or adapt all or part of the work
73
+ in a fashion requiring copyright permission, other than the making of an
74
+ exact copy. The resulting work is called a "modified version" of the
75
+ earlier work or a work "based on" the earlier work.
76
+
77
+ A "covered work" means either the unmodified Program or a work based
78
+ on the Program.
79
+
80
+ To "propagate" a work means to do anything with it that, without
81
+ permission, would make you directly or secondarily liable for
82
+ infringement under applicable copyright law, except executing it on a
83
+ computer or modifying a private copy. Propagation includes copying,
84
+ distribution (with or without modification), making available to the
85
+ public, and in some countries other activities as well.
86
+
87
+ To "convey" a work means any kind of propagation that enables other
88
+ parties to make or receive copies. Mere interaction with a user through
89
+ a computer network, with no transfer of a copy, is not conveying.
90
+
91
+ An interactive user interface displays "Appropriate Legal Notices"
92
+ to the extent that it includes a convenient and prominently visible
93
+ feature that (1) displays an appropriate copyright notice, and (2)
94
+ tells the user that there is no warranty for the work (except to the
95
+ extent that warranties are provided), that licensees may convey the
96
+ work under this License, and how to view a copy of this License. If
97
+ the interface presents a list of user commands or options, such as a
98
+ menu, a prominent item in the list meets this criterion.
99
+
100
+ 1. Source Code.
101
+
102
+ The "source code" for a work means the preferred form of the work
103
+ for making modifications to it. "Object code" means any non-source
104
+ form of a work.
105
+
106
+ A "Standard Interface" means an interface that either is an official
107
+ standard defined by a recognized standards body, or, in the case of
108
+ interfaces specified for a particular programming language, one that
109
+ is widely used among developers working in that language.
110
+
111
+ The "System Libraries" of an executable work include anything, other
112
+ than the work as a whole, that (a) is included in the normal form of
113
+ packaging a Major Component, but which is not part of that Major
114
+ Component, and (b) serves only to enable use of the work with that
115
+ Major Component, or to implement a Standard Interface for which an
116
+ implementation is available to the public in source code form. A
117
+ "Major Component", in this context, means a major essential component
118
+ (kernel, window system, and so on) of the specific operating system
119
+ (if any) on which the executable work runs, or a compiler used to
120
+ produce the work, or an object code interpreter used to run it.
121
+
122
+ The "Corresponding Source" for a work in object code form means all
123
+ the source code needed to generate, install, and (for an executable
124
+ work) run the object code and to modify the work, including scripts to
125
+ control those activities. However, it does not include the work's
126
+ System Libraries, or general-purpose tools or generally available free
127
+ programs which are used unmodified in performing those activities but
128
+ which are not part of the work. For example, Corresponding Source
129
+ includes interface definition files associated with source files for
130
+ the work, and the source code for shared libraries and dynamically
131
+ linked subprograms that the work is specifically designed to require,
132
+ such as by intimate data communication or control flow between those
133
+ subprograms and other parts of the work.
134
+
135
+ The Corresponding Source need not include anything that users
136
+ can regenerate automatically from other parts of the Corresponding
137
+ Source.
138
+
139
+ The Corresponding Source for a work in source code form is that
140
+ same work.
141
+
142
+ 2. Basic Permissions.
143
+
144
+ All rights granted under this License are granted for the term of
145
+ copyright on the Program, and are irrevocable provided the stated
146
+ conditions are met. This License explicitly affirms your unlimited
147
+ permission to run the unmodified Program. The output from running a
148
+ covered work is covered by this License only if the output, given its
149
+ content, constitutes a covered work. This License acknowledges your
150
+ rights of fair use or other equivalent, as provided by copyright law.
151
+
152
+ You may make, run and propagate covered works that you do not
153
+ convey, without conditions so long as your license otherwise remains
154
+ in force. You may convey covered works to others for the sole purpose
155
+ of having them make modifications exclusively for you, or provide you
156
+ with facilities for running those works, provided that you comply with
157
+ the terms of this License in conveying all material for which you do
158
+ not control copyright. Those thus making or running the covered works
159
+ for you must do so exclusively on your behalf, under your direction
160
+ and control, on terms that prohibit them from making any copies of
161
+ your copyrighted material outside their relationship with you.
162
+
163
+ Conveying under any other circumstances is permitted solely under
164
+ the conditions stated below. Sublicensing is not allowed; section 10
165
+ makes it unnecessary.
166
+
167
+ 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
168
+
169
+ No covered work shall be deemed part of an effective technological
170
+ measure under any applicable law fulfilling obligations under article
171
+ 11 of the WIPO copyright treaty adopted on 20 December 1996, or
172
+ similar laws prohibiting or restricting circumvention of such
173
+ measures.
174
+
175
+ When you convey a covered work, you waive any legal power to forbid
176
+ circumvention of technological measures to the extent such circumvention
177
+ is effected by exercising rights under this License with respect to
178
+ the covered work, and you disclaim any intention to limit operation or
179
+ modification of the work as a means of enforcing, against the work's
180
+ users, your or third parties' legal rights to forbid circumvention of
181
+ technological measures.
182
+
183
+ 4. Conveying Verbatim Copies.
184
+
185
+ You may convey verbatim copies of the Program's source code as you
186
+ receive it, in any medium, provided that you conspicuously and
187
+ appropriately publish on each copy an appropriate copyright notice;
188
+ keep intact all notices stating that this License and any
189
+ non-permissive terms added in accord with section 7 apply to the code;
190
+ keep intact all notices of the absence of any warranty; and give all
191
+ recipients a copy of this License along with the Program.
192
+
193
+ You may charge any price or no price for each copy that you convey,
194
+ and you may offer support or warranty protection for a fee.
195
+
196
+ 5. Conveying Modified Source Versions.
197
+
198
+ You may convey a work based on the Program, or the modifications to
199
+ produce it from the Program, in the form of source code under the
200
+ terms of section 4, provided that you also meet all of these conditions:
201
+
202
+ a) The work must carry prominent notices stating that you modified
203
+ it, and giving a relevant date.
204
+
205
+ b) The work must carry prominent notices stating that it is
206
+ released under this License and any conditions added under section
207
+ 7. This requirement modifies the requirement in section 4 to
208
+ "keep intact all notices".
209
+
210
+ c) You must license the entire work, as a whole, under this
211
+ License to anyone who comes into possession of a copy. This
212
+ License will therefore apply, along with any applicable section 7
213
+ additional terms, to the whole of the work, and all its parts,
214
+ regardless of how they are packaged. This License gives no
215
+ permission to license the work in any other way, but it does not
216
+ invalidate such permission if you have separately received it.
217
+
218
+ d) If the work has interactive user interfaces, each must display
219
+ Appropriate Legal Notices; however, if the Program has interactive
220
+ interfaces that do not display Appropriate Legal Notices, your
221
+ work need not make them do so.
222
+
223
+ A compilation of a covered work with other separate and independent
224
+ works, which are not by their nature extensions of the covered work,
225
+ and which are not combined with it such as to form a larger program,
226
+ in or on a volume of a storage or distribution medium, is called an
227
+ "aggregate" if the compilation and its resulting copyright are not
228
+ used to limit the access or legal rights of the compilation's users
229
+ beyond what the individual works permit. Inclusion of a covered work
230
+ in an aggregate does not cause this License to apply to the other
231
+ parts of the aggregate.
232
+
233
+ 6. Conveying Non-Source Forms.
234
+
235
+ You may convey a covered work in object code form under the terms
236
+ of sections 4 and 5, provided that you also convey the
237
+ machine-readable Corresponding Source under the terms of this License,
238
+ in one of these ways:
239
+
240
+ a) Convey the object code in, or embodied in, a physical product
241
+ (including a physical distribution medium), accompanied by the
242
+ Corresponding Source fixed on a durable physical medium
243
+ customarily used for software interchange.
244
+
245
+ b) Convey the object code in, or embodied in, a physical product
246
+ (including a physical distribution medium), accompanied by a
247
+ written offer, valid for at least three years and valid for as
248
+ long as you offer spare parts or customer support for that product
249
+ model, to give anyone who possesses the object code either (1) a
250
+ copy of the Corresponding Source for all the software in the
251
+ product that is covered by this License, on a durable physical
252
+ medium customarily used for software interchange, for a price no
253
+ more than your reasonable cost of physically performing this
254
+ conveying of source, or (2) access to copy the
255
+ Corresponding Source from a network server at no charge.
256
+
257
+ c) Convey individual copies of the object code with a copy of the
258
+ written offer to provide the Corresponding Source. This
259
+ alternative is allowed only occasionally and noncommercially, and
260
+ only if you received the object code with such an offer, in accord
261
+ with subsection 6b.
262
+
263
+ d) Convey the object code by offering access from a designated
264
+ place (gratis or for a charge), and offer equivalent access to the
265
+ Corresponding Source in the same way through the same place at no
266
+ further charge. You need not require recipients to copy the
267
+ Corresponding Source along with the object code. If the place to
268
+ copy the object code is a network server, the Corresponding Source
269
+ may be on a different server (operated by you or a third party)
270
+ that supports equivalent copying facilities, provided you maintain
271
+ clear directions next to the object code saying where to find the
272
+ Corresponding Source. Regardless of what server hosts the
273
+ Corresponding Source, you remain obligated to ensure that it is
274
+ available for as long as needed to satisfy these requirements.
275
+
276
+ e) Convey the object code using peer-to-peer transmission, provided
277
+ you inform other peers where the object code and Corresponding
278
+ Source of the work are being offered to the general public at no
279
+ charge under subsection 6d.
280
+
281
+ A separable portion of the object code, whose source code is excluded
282
+ from the Corresponding Source as a System Library, need not be
283
+ included in conveying the object code work.
284
+
285
+ A "User Product" is either (1) a "consumer product", which means any
286
+ tangible personal property which is normally used for personal, family,
287
+ or household purposes, or (2) anything designed or sold for incorporation
288
+ into a dwelling. In determining whether a product is a consumer product,
289
+ doubtful cases shall be resolved in favor of coverage. For a particular
290
+ product received by a particular user, "normally used" refers to a
291
+ typical or common use of that class of product, regardless of the status
292
+ of the particular user or of the way in which the particular user
293
+ actually uses, or expects or is expected to use, the product. A product
294
+ is a consumer product regardless of whether the product has substantial
295
+ commercial, industrial or non-consumer uses, unless such uses represent
296
+ the only significant mode of use of the product.
297
+
298
+ "Installation Information" for a User Product means any methods,
299
+ procedures, authorization keys, or other information required to install
300
+ and execute modified versions of a covered work in that User Product from
301
+ a modified version of its Corresponding Source. The information must
302
+ suffice to ensure that the continued functioning of the modified object
303
+ code is in no case prevented or interfered with solely because
304
+ modification has been made.
305
+
306
+ If you convey an object code work under this section in, or with, or
307
+ specifically for use in, a User Product, and the conveying occurs as
308
+ part of a transaction in which the right of possession and use of the
309
+ User Product is transferred to the recipient in perpetuity or for a
310
+ fixed term (regardless of how the transaction is characterized), the
311
+ Corresponding Source conveyed under this section must be accompanied
312
+ by the Installation Information. But this requirement does not apply
313
+ if neither you nor any third party retains the ability to install
314
+ modified object code on the User Product (for example, the work has
315
+ been installed in ROM).
316
+
317
+ The requirement to provide Installation Information does not include a
318
+ requirement to continue to provide support service, warranty, or updates
319
+ for a work that has been modified or installed by the recipient, or for
320
+ the User Product in which it has been modified or installed. Access to a
321
+ network may be denied when the modification itself materially and
322
+ adversely affects the operation of the network or violates the rules and
323
+ protocols for communication across the network.
324
+
325
+ Corresponding Source conveyed, and Installation Information provided,
326
+ in accord with this section must be in a format that is publicly
327
+ documented (and with an implementation available to the public in
328
+ source code form), and must require no special password or key for
329
+ unpacking, reading or copying.
330
+
331
+ 7. Additional Terms.
332
+
333
+ "Additional permissions" are terms that supplement the terms of this
334
+ License by making exceptions from one or more of its conditions.
335
+ Additional permissions that are applicable to the entire Program shall
336
+ be treated as though they were included in this License, to the extent
337
+ that they are valid under applicable law. If additional permissions
338
+ apply only to part of the Program, that part may be used separately
339
+ under those permissions, but the entire Program remains governed by
340
+ this License without regard to the additional permissions.
341
+
342
+ When you convey a copy of a covered work, you may at your option
343
+ remove any additional permissions from that copy, or from any part of
344
+ it. (Additional permissions may be written to require their own
345
+ removal in certain cases when you modify the work.) You may place
346
+ additional permissions on material, added by you to a covered work,
347
+ for which you have or can give appropriate copyright permission.
348
+
349
+ Notwithstanding any other provision of this License, for material you
350
+ add to a covered work, you may (if authorized by the copyright holders of
351
+ that material) supplement the terms of this License with terms:
352
+
353
+ a) Disclaiming warranty or limiting liability differently from the
354
+ terms of sections 15 and 16 of this License; or
355
+
356
+ b) Requiring preservation of specified reasonable legal notices or
357
+ author attributions in that material or in the Appropriate Legal
358
+ Notices displayed by works containing it; or
359
+
360
+ c) Prohibiting misrepresentation of the origin of that material, or
361
+ requiring that modified versions of such material be marked in
362
+ reasonable ways as different from the original version; or
363
+
364
+ d) Limiting the use for publicity purposes of names of licensors or
365
+ authors of the material; or
366
+
367
+ e) Declining to grant rights under trademark law for use of some
368
+ trade names, trademarks, or service marks; or
369
+
370
+ f) Requiring indemnification of licensors and authors of that
371
+ material by anyone who conveys the material (or modified versions of
372
+ it) with contractual assumptions of liability to the recipient, for
373
+ any liability that these contractual assumptions directly impose on
374
+ those licensors and authors.
375
+
376
+ All other non-permissive additional terms are considered "further
377
+ restrictions" within the meaning of section 10. If the Program as you
378
+ received it, or any part of it, contains a notice stating that it is
379
+ governed by this License along with a term that is a further
380
+ restriction, you may remove that term. If a license document contains
381
+ a further restriction but permits relicensing or conveying under this
382
+ License, you may add to a covered work material governed by the terms
383
+ of that license document, provided that the further restriction does
384
+ not survive such relicensing or conveying.
385
+
386
+ If you add terms to a covered work in accord with this section, you
387
+ must place, in the relevant source files, a statement of the
388
+ additional terms that apply to those files, or a notice indicating
389
+ where to find the applicable terms.
390
+
391
+ Additional terms, permissive or non-permissive, may be stated in the
392
+ form of a separately written license, or stated as exceptions;
393
+ the above requirements apply either way.
394
+
395
+ 8. Termination.
396
+
397
+ You may not propagate or modify a covered work except as expressly
398
+ provided under this License. Any attempt otherwise to propagate or
399
+ modify it is void, and will automatically terminate your rights under
400
+ this License (including any patent licenses granted under the third
401
+ paragraph of section 11).
402
+
403
+ However, if you cease all violation of this License, then your
404
+ license from a particular copyright holder is reinstated (a)
405
+ provisionally, unless and until the copyright holder explicitly and
406
+ finally terminates your license, and (b) permanently, if the copyright
407
+ holder fails to notify you of the violation by some reasonable means
408
+ prior to 60 days after the cessation.
409
+
410
+ Moreover, your license from a particular copyright holder is
411
+ reinstated permanently if the copyright holder notifies you of the
412
+ violation by some reasonable means, this is the first time you have
413
+ received notice of violation of this License (for any work) from that
414
+ copyright holder, and you cure the violation prior to 30 days after
415
+ your receipt of the notice.
416
+
417
+ Termination of your rights under this section does not terminate the
418
+ licenses of parties who have received copies or rights from you under
419
+ this License. If your rights have been terminated and not permanently
420
+ reinstated, you do not qualify to receive new licenses for the same
421
+ material under section 10.
422
+
423
+ 9. Acceptance Not Required for Having Copies.
424
+
425
+ You are not required to accept this License in order to receive or
426
+ run a copy of the Program. Ancillary propagation of a covered work
427
+ occurring solely as a consequence of using peer-to-peer transmission
428
+ to receive a copy likewise does not require acceptance. However,
429
+ nothing other than this License grants you permission to propagate or
430
+ modify any covered work. These actions infringe copyright if you do
431
+ not accept this License. Therefore, by modifying or propagating a
432
+ covered work, you indicate your acceptance of this License to do so.
433
+
434
+ 10. Automatic Licensing of Downstream Recipients.
435
+
436
+ Each time you convey a covered work, the recipient automatically
437
+ receives a license from the original licensors, to run, modify and
438
+ propagate that work, subject to this License. You are not responsible
439
+ for enforcing compliance by third parties with this License.
440
+
441
+ An "entity transaction" is a transaction transferring control of an
442
+ organization, or substantially all assets of one, or subdividing an
443
+ organization, or merging organizations. If propagation of a covered
444
+ work results from an entity transaction, each party to that
445
+ transaction who receives a copy of the work also receives whatever
446
+ licenses to the work the party's predecessor in interest had or could
447
+ give under the previous paragraph, plus a right to possession of the
448
+ Corresponding Source of the work from the predecessor in interest, if
449
+ the predecessor has it or can get it with reasonable efforts.
450
+
451
+ You may not impose any further restrictions on the exercise of the
452
+ rights granted or affirmed under this License. For example, you may
453
+ not impose a license fee, royalty, or other charge for exercise of
454
+ rights granted under this License, and you may not initiate litigation
455
+ (including a cross-claim or counterclaim in a lawsuit) alleging that
456
+ any patent claim is infringed by making, using, selling, offering for
457
+ sale, or importing the Program or any portion of it.
458
+
459
+ 11. Patents.
460
+
461
+ A "contributor" is a copyright holder who authorizes use under this
462
+ License of the Program or a work on which the Program is based. The
463
+ work thus licensed is called the contributor's "contributor version".
464
+
465
+ A contributor's "essential patent claims" are all patent claims
466
+ owned or controlled by the contributor, whether already acquired or
467
+ hereafter acquired, that would be infringed by some manner, permitted
468
+ by this License, of making, using, or selling its contributor version,
469
+ but do not include claims that would be infringed only as a
470
+ consequence of further modification of the contributor version. For
471
+ purposes of this definition, "control" includes the right to grant
472
+ patent sublicenses in a manner consistent with the requirements of
473
+ this License.
474
+
475
+ Each contributor grants you a non-exclusive, worldwide, royalty-free
476
+ patent license under the contributor's essential patent claims, to
477
+ make, use, sell, offer for sale, import and otherwise run, modify and
478
+ propagate the contents of its contributor version.
479
+
480
+ In the following three paragraphs, a "patent license" is any express
481
+ agreement or commitment, however denominated, not to enforce a patent
482
+ (such as an express permission to practice a patent or covenant not to
483
+ sue for patent infringement). To "grant" such a patent license to a
484
+ party means to make such an agreement or commitment not to enforce a
485
+ patent against the party.
486
+
487
+ If you convey a covered work, knowingly relying on a patent license,
488
+ and the Corresponding Source of the work is not available for anyone
489
+ to copy, free of charge and under the terms of this License, through a
490
+ publicly available network server or other readily accessible means,
491
+ then you must either (1) cause the Corresponding Source to be so
492
+ available, or (2) arrange to deprive yourself of the benefit of the
493
+ patent license for this particular work, or (3) arrange, in a manner
494
+ consistent with the requirements of this License, to extend the patent
495
+ license to downstream recipients. "Knowingly relying" means you have
496
+ actual knowledge that, but for the patent license, your conveying the
497
+ covered work in a country, or your recipient's use of the covered work
498
+ in a country, would infringe one or more identifiable patents in that
499
+ country that you have reason to believe are valid.
500
+
501
+ If, pursuant to or in connection with a single transaction or
502
+ arrangement, you convey, or propagate by procuring conveyance of, a
503
+ covered work, and grant a patent license to some of the parties
504
+ receiving the covered work authorizing them to use, propagate, modify
505
+ or convey a specific copy of the covered work, then the patent license
506
+ you grant is automatically extended to all recipients of the covered
507
+ work and works based on it.
508
+
509
+ A patent license is "discriminatory" if it does not include within
510
+ the scope of its coverage, prohibits the exercise of, or is
511
+ conditioned on the non-exercise of one or more of the rights that are
512
+ specifically granted under this License. You may not convey a covered
513
+ work if you are a party to an arrangement with a third party that is
514
+ in the business of distributing software, under which you make payment
515
+ to the third party based on the extent of your activity of conveying
516
+ the work, and under which the third party grants, to any of the
517
+ parties who would receive the covered work from you, a discriminatory
518
+ patent license (a) in connection with copies of the covered work
519
+ conveyed by you (or copies made from those copies), or (b) primarily
520
+ for and in connection with specific products or compilations that
521
+ contain the covered work, unless you entered into that arrangement,
522
+ or that patent license was granted, prior to 28 March 2007.
523
+
524
+ Nothing in this License shall be construed as excluding or limiting
525
+ any implied license or other defenses to infringement that may
526
+ otherwise be available to you under applicable patent law.
527
+
528
+ 12. No Surrender of Others' Freedom.
529
+
530
+ If conditions are imposed on you (whether by court order, agreement or
531
+ otherwise) that contradict the conditions of this License, they do not
532
+ excuse you from the conditions of this License. If you cannot convey a
533
+ covered work so as to satisfy simultaneously your obligations under this
534
+ License and any other pertinent obligations, then as a consequence you may
535
+ not convey it at all. For example, if you agree to terms that obligate you
536
+ to collect a royalty for further conveying from those to whom you convey
537
+ the Program, the only way you could satisfy both those terms and this
538
+ License would be to refrain entirely from conveying the Program.
539
+
540
+ 13. Remote Network Interaction; Use with the GNU General Public License.
541
+
542
+ Notwithstanding any other provision of this License, if you modify the
543
+ Program, your modified version must prominently offer all users
544
+ interacting with it remotely through a computer network (if your version
545
+ supports such interaction) an opportunity to receive the Corresponding
546
+ Source of your version by providing access to the Corresponding Source
547
+ from a network server at no charge, through some standard or customary
548
+ means of facilitating copying of software. This Corresponding Source
549
+ shall include the Corresponding Source for any work covered by version 3
550
+ of the GNU General Public License that is incorporated pursuant to the
551
+ following paragraph.
552
+
553
+ Notwithstanding any other provision of this License, you have
554
+ permission to link or combine any covered work with a work licensed
555
+ under version 3 of the GNU General Public License into a single
556
+ combined work, and to convey the resulting work. The terms of this
557
+ License will continue to apply to the part which is the covered work,
558
+ but the work with which it is combined will remain governed by version
559
+ 3 of the GNU General Public License.
560
+
561
+ 14. Revised Versions of this License.
562
+
563
+ The Free Software Foundation may publish revised and/or new versions of
564
+ the GNU Affero General Public License from time to time. Such new versions
565
+ will be similar in spirit to the present version, but may differ in detail to
566
+ address new problems or concerns.
567
+
568
+ Each version is given a distinguishing version number. If the
569
+ Program specifies that a certain numbered version of the GNU Affero General
570
+ Public License "or any later version" applies to it, you have the
571
+ option of following the terms and conditions either of that numbered
572
+ version or of any later version published by the Free Software
573
+ Foundation. If the Program does not specify a version number of the
574
+ GNU Affero General Public License, you may choose any version ever published
575
+ by the Free Software Foundation.
576
+
577
+ If the Program specifies that a proxy can decide which future
578
+ versions of the GNU Affero General Public License can be used, that proxy's
579
+ public statement of acceptance of a version permanently authorizes you
580
+ to choose that version for the Program.
581
+
582
+ Later license versions may give you additional or different
583
+ permissions. However, no additional obligations are imposed on any
584
+ author or copyright holder as a result of your choosing to follow a
585
+ later version.
586
+
587
+ 15. Disclaimer of Warranty.
588
+
589
+ THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
590
+ APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
591
+ HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
592
+ OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
593
+ THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
594
+ PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
595
+ IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
596
+ ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
597
+
598
+ 16. Limitation of Liability.
599
+
600
+ IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
601
+ WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
602
+ THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
603
+ GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
604
+ USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
605
+ DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
606
+ PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
607
+ EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
608
+ SUCH DAMAGES.
609
+
610
+ 17. Interpretation of Sections 15 and 16.
611
+
612
+ If the disclaimer of warranty and limitation of liability provided
613
+ above cannot be given local legal effect according to their terms,
614
+ reviewing courts shall apply local law that most closely approximates
615
+ an absolute waiver of all civil liability in connection with the
616
+ Program, unless a warranty or assumption of liability accompanies a
617
+ copy of the Program in return for a fee.
618
+
619
+ END OF TERMS AND CONDITIONS
620
+
621
+ ----------------------------------------------------------------------
622
+ ADDITIONAL NOTICE: INCLUDED MACHINE LEARNING MODELS
623
+ ----------------------------------------------------------------------
624
+
625
+ This Program distributes pre-trained machine learning models which are
626
+ governed by their own respective licenses. These binary could be NOT
627
+ licensed under the GNU AGPLv3.
628
+
629
+ From AudioMuse-AI v0.9.0 the following models are included and you agree to
630
+ the following terms:
631
+
632
+ 1. MUSICNN MODELS:
633
+ - License: ISC
634
+ - Official Project: https://github.com/jordipons/musicnn
635
+
636
+ 2. LAION-CLAP MODEL (only Text Head):
637
+ - License: CC0 1.0 (Public Domain)
638
+ - Official Project: https://github.com/LAION-AI/CLAP
639
+
640
+ 3. AudioMuse-AI-DCLAP MODELS (only Audio Head):
641
+ - License: AGPLv3
642
+ - Official Project: https://github.com/NeptuneHub/AudioMuse-AI-DCLAP
643
+
644
+ 4. NEURAL MUSIC FINGERPRINT MODEL (Neural Music FP):
645
+ - License: AGPLv3 (code and model weights)
646
+ - Official Project: https://github.com/raraz15/neural-music-fp
647
+
648
+ 5. AudioMuse-AI-SAE MODELS (sparse autoencoder over the DCLAP embedding):
649
+ - License: AGPLv3
650
+ - Official Project: https://github.com/NeptuneHub/AudioMuse-AI-SAE
651
+
652
+ 6. WHISPER SMALL MODEL (ONNX export of openai/whisper-small):
653
+ - License: MIT (code and model weights, as released by OpenAI); the
654
+ Hugging Face openai/whisper-small checkpoint used for the ONNX export
655
+ is tagged Apache 2.0
656
+ - Official Project: https://github.com/openai/whisper
657
+ - Model Checkpoint: https://huggingface.co/openai/whisper-small
658
+
659
+ 7. SILERO VAD MODEL (voice activity detection):
660
+ - License: MIT
661
+ - Official Project: https://github.com/snakers4/silero-vad
662
+
663
+ 8. GTE MULTILINGUAL BASE MODEL (INT8 ONNX export, lyrics text embedding):
664
+ - License: Apache 2.0
665
+ - Official Project: https://huggingface.co/Alibaba-NLP/gte-multilingual-base
666
+
667
+ 9. ROBERTA-BASE TOKENIZER (used by the LAION-CLAP text head):
668
+ - License: MIT
669
+ - Official Project: https://huggingface.co/FacebookAI/roberta-base
670
+
671
+ To maintain a clear distinction between the open-source code and the
672
+ model weights, all machine learning models are treated as distinct assets.
673
+ While these models are pre-embedded within our containerized releases and
674
+ Docker images for "out-of-the-box" functionality, they remain easily
675
+ identifiable.
676
+
677
+ The specific model binaries used in each version are cross-referenced in
678
+ the repository via dedicated model-only releases:
679
+
680
+ - Release Naming Convention: v[version]-model (e.g., `v4.0.0-model`)
681
+ - Download Location: https://github.com/NeptuneHub/AudioMuse-AI/releases
682
+
683
+ or in AudioMuse-AI-DCLAP release:
684
+ - https://github.com/NeptuneHub/AudioMuse-AI-DCLAP/releases
685
+
686
+ or in AudioMuse-AI-SAE release:
687
+ - https://github.com/NeptuneHub/AudioMuse-AI-SAE/releases
688
+
689
+ This naming convention allows users to clearly audit which restricted weights
690
+ are present within the combined software distribution.
691
+
692
+ SUMMARY FOR USERS:
693
+ The software code is Open Source under AGPLv3. However, the complete
694
+ distribution (including Docker images or releases containing these files)
695
+ depends from the model weight used.
plugin/README.md ADDED
@@ -0,0 +1,68 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ # Vibe Search for AudioMuse-AI
2
+
3
+ Search your own music library by how songs sound and feel ("rainy Sunday coffee shop", "upbeat but melancholic, no vocals", "something for a long night drive"). You can also find songs with the same vibe as one you pick, and save any result list as a playlist on your media server.
4
+
5
+ The model is small and runs on the CPU. It sits next to AudioMuse-AI's own analysis and leaves it alone: the plugin keeps its vectors in its own table and never edits AudioMuse-AI's data.
6
+
7
+ ## What it does
8
+
9
+ - **Vibe vectors for every song.** Each time AudioMuse-AI analyses a song, the plugin runs a small audio model (EfficientAT mn20_as, distilled from a combined LCO-Embedding-Omni-7B + e5-omni-7B teacher) over the song in 10-second windows. It stores one 512-number vector per song.
10
+ - **Index my library.** This fills in vectors for songs that were analysed before the plugin was installed. It runs as a background task and reports its progress.
11
+ - **Search.** Your search text goes through the matching text model (Qwen3-Embedding-0.6B plus a small trained layer) and is compared with every song's vector.
12
+ - **Same vibe.** Pick a song to list the songs whose vectors are closest to it.
13
+ - **Playlists.** Save a result list to your media server in one click.
14
+
15
+ Model version: v1.2. Benchmarks and limits are on the model card: https://huggingface.co/Divi19/vibe-embed
16
+
17
+ ## Install
18
+
19
+ Requires AudioMuse-AI 3.7.1 or later.
20
+
21
+ 1. In AudioMuse-AI, open **Plugins**, add this repository URL, and refresh the catalog:
22
+ `https://huggingface.co/Divi19/vibe-embed/resolve/main/plugin/manifest.json`
23
+ 2. Install **Vibe Search**, then apply. AudioMuse-AI restarts its workers.
24
+ 3. Open the Vibe Search page and press **Index my library** once. From then on, new songs get their vectors automatically when they are analysed.
25
+
26
+ On first use, the plugin downloads its models into `PLUGINS_DIR/_data/vibe_search/models/`: about 35 MB for the audio model and about 818 MB for the 8-bit search model. It needs no extra Python packages: it uses the ONNX Runtime, numpy and tokenizers that AudioMuse-AI already ships with.
27
+
28
+ ### ONNX Runtime versions
29
+
30
+ - The 8-bit search model needs onnxruntime 1.28 or later, which the standard AudioMuse-AI images have.
31
+ - On older onnxruntime builds (the no-AVX2 image ships 1.19), the plugin uses the full-precision search model instead (about 2396 MB, more RAM). It does this by itself and says so on its page. Results are the same.
32
+ - If an 8-bit file fails to load for any other reason, the plugin falls back to full precision the same way.
33
+
34
+ ## Settings
35
+
36
+ | setting | default | meaning |
37
+ |---|---|---|
38
+ | model_repo | `Divi19/vibe-embed` | Hugging Face repository with the model files |
39
+ | revision | `main` | branch, tag or commit of that repository |
40
+ | base_url | `https://huggingface.co` | change this only for a mirror |
41
+ | precision | `int8` | `int8` (smaller, faster) or `fp32` |
42
+ | threads | 4 | CPU threads for the models |
43
+ | embed_on_analysis | on | embed each song right after AudioMuse-AI analyses it |
44
+ | result_limit | 50 | songs shown per search |
45
+
46
+ If you change model_repo or revision, press **Index my library** again. Vectors from a different model are not mixed in: every vector is stored with the tag of the model that made it. Changing precision does not need re-indexing.
47
+
48
+ ## Safety checks
49
+
50
+ The model repository includes `parity.json`, which holds reference outputs recorded when the models were exported. Before first use, the plugin runs a test signal and five test searches through the downloaded models and compares the results (and the search tokens) with those references. If anything does not match (a wrong file, a broken download or a tokenizer mismatch), it refuses to run and shows the reason on its page. It does not silently return bad results.
51
+
52
+ ## Model files
53
+
54
+ The plugin expects this layout in the Hugging Face repository:
55
+
56
+ ```
57
+ config.json
58
+ parity.json
59
+ mn20_as/audio_encoder_int8.onnx mn20_as/audio_encoder.onnx
60
+ text/text_encoder_int8.onnx(.data) text/text_encoder.onnx(.data)
61
+ text/tokenizer/tokenizer.json text/tokenizer/tokenizer_config.json
62
+ ```
63
+
64
+ ## Licences
65
+
66
+ - The plugin code is licensed under AGPL-3.0 (see LICENSE), the same as AudioMuse-AI, because it runs inside AudioMuse-AI.
67
+ - The models it downloads are released separately under Apache-2.0.
68
+ - The training music is CC0 / CC-BY / public-domain audio; the attribution list is in the model repository.
plugin/dist/vibe_search/vibe_search_0.1.0.zip ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:810fa2dc326f54af03932a16b402fee390fc66c62d8f643ed59e344dff301846
3
+ size 22083
plugin/manifest.json ADDED
@@ -0,0 +1,11 @@
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {
2
+ "plugins": [
3
+ {
4
+ "id": "vibe_search",
5
+ "name": "Vibe Search",
6
+ "author": "Divieleisch19",
7
+ "description": "Search your library by how music sounds and feels (\"rainy Sunday coffee shop\", \"upbeat but melancholic, no vocals\"), find songs with the same vibe, and save the results as playlists. Uses a small open (Apache-2.0) music-text model that runs on a CPU.",
8
+ "pluginUrl": "https://huggingface.co/Divi19/vibe-embed/resolve/main/plugin/plugins/VibeSearch/plugin.json"
9
+ }
10
+ ]
11
+ }
plugin/plugins/VibeSearch/LICENSE ADDED
@@ -0,0 +1,695 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ GNU AFFERO GENERAL PUBLIC LICENSE
2
+ Version 3, 19 November 2007
3
+
4
+ Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
5
+ Everyone is permitted to copy and distribute verbatim copies
6
+ of this license document, but changing it is not allowed.
7
+
8
+ Preamble
9
+
10
+ The GNU Affero General Public License is a free, copyleft license for
11
+ software and other kinds of works, specifically designed to ensure
12
+ cooperation with the community in the case of network server software.
13
+
14
+ The licenses for most software and other practical works are designed
15
+ to take away your freedom to share and change the works. By contrast,
16
+ our General Public Licenses are intended to guarantee your freedom to
17
+ share and change all versions of a program--to make sure it remains free
18
+ software for all its users.
19
+
20
+ When we speak of free software, we are referring to freedom, not
21
+ price. Our General Public Licenses are designed to make sure that you
22
+ have the freedom to distribute copies of free software (and charge for
23
+ them if you wish), that you receive source code or can get it if you
24
+ want it, that you can change the software or use pieces of it in new
25
+ free programs, and that you know you can do these things.
26
+
27
+ Developers that use our General Public Licenses protect your rights
28
+ with two steps: (1) assert copyright on the software, and (2) offer
29
+ you this License which gives you legal permission to copy, distribute
30
+ and/or modify the software.
31
+
32
+ A secondary benefit of defending all users' freedom is that
33
+ improvements made in alternate versions of the program, if they
34
+ receive widespread use, become available for other developers to
35
+ incorporate. Many developers of free software are heartened and
36
+ encouraged by the resulting cooperation. However, in the case of
37
+ software used on network servers, this result may fail to come about.
38
+ The GNU General Public License permits making a modified version and
39
+ letting the public access it on a server without ever releasing its
40
+ source code to the public.
41
+
42
+ The GNU Affero General Public License is designed specifically to
43
+ ensure that, in such cases, the modified source code becomes available
44
+ to the community. It requires the operator of a network server to
45
+ provide the source code of the modified version running there to the
46
+ users of that server. Therefore, public use of a modified version, on
47
+ a publicly accessible server, gives the public access to the source
48
+ code of the modified version.
49
+
50
+ An older license, called the Affero General Public License and
51
+ published by Affero, was designed to accomplish similar goals. This is
52
+ a different license, not a version of the Affero GPL, but Affero has
53
+ released a new version of the Affero GPL which permits relicensing under
54
+ this license.
55
+
56
+ The precise terms and conditions for copying, distribution and
57
+ modification follow.
58
+
59
+ TERMS AND CONDITIONS
60
+
61
+ 0. Definitions.
62
+
63
+ "This License" refers to version 3 of the GNU Affero General Public License.
64
+
65
+ "Copyright" also means copyright-like laws that apply to other kinds of
66
+ works, such as semiconductor masks.
67
+
68
+ "The Program" refers to any copyrightable work licensed under this
69
+ License. Each licensee is addressed as "you". "Licensees" and
70
+ "recipients" may be individuals or organizations.
71
+
72
+ To "modify" a work means to copy from or adapt all or part of the work
73
+ in a fashion requiring copyright permission, other than the making of an
74
+ exact copy. The resulting work is called a "modified version" of the
75
+ earlier work or a work "based on" the earlier work.
76
+
77
+ A "covered work" means either the unmodified Program or a work based
78
+ on the Program.
79
+
80
+ To "propagate" a work means to do anything with it that, without
81
+ permission, would make you directly or secondarily liable for
82
+ infringement under applicable copyright law, except executing it on a
83
+ computer or modifying a private copy. Propagation includes copying,
84
+ distribution (with or without modification), making available to the
85
+ public, and in some countries other activities as well.
86
+
87
+ To "convey" a work means any kind of propagation that enables other
88
+ parties to make or receive copies. Mere interaction with a user through
89
+ a computer network, with no transfer of a copy, is not conveying.
90
+
91
+ An interactive user interface displays "Appropriate Legal Notices"
92
+ to the extent that it includes a convenient and prominently visible
93
+ feature that (1) displays an appropriate copyright notice, and (2)
94
+ tells the user that there is no warranty for the work (except to the
95
+ extent that warranties are provided), that licensees may convey the
96
+ work under this License, and how to view a copy of this License. If
97
+ the interface presents a list of user commands or options, such as a
98
+ menu, a prominent item in the list meets this criterion.
99
+
100
+ 1. Source Code.
101
+
102
+ The "source code" for a work means the preferred form of the work
103
+ for making modifications to it. "Object code" means any non-source
104
+ form of a work.
105
+
106
+ A "Standard Interface" means an interface that either is an official
107
+ standard defined by a recognized standards body, or, in the case of
108
+ interfaces specified for a particular programming language, one that
109
+ is widely used among developers working in that language.
110
+
111
+ The "System Libraries" of an executable work include anything, other
112
+ than the work as a whole, that (a) is included in the normal form of
113
+ packaging a Major Component, but which is not part of that Major
114
+ Component, and (b) serves only to enable use of the work with that
115
+ Major Component, or to implement a Standard Interface for which an
116
+ implementation is available to the public in source code form. A
117
+ "Major Component", in this context, means a major essential component
118
+ (kernel, window system, and so on) of the specific operating system
119
+ (if any) on which the executable work runs, or a compiler used to
120
+ produce the work, or an object code interpreter used to run it.
121
+
122
+ The "Corresponding Source" for a work in object code form means all
123
+ the source code needed to generate, install, and (for an executable
124
+ work) run the object code and to modify the work, including scripts to
125
+ control those activities. However, it does not include the work's
126
+ System Libraries, or general-purpose tools or generally available free
127
+ programs which are used unmodified in performing those activities but
128
+ which are not part of the work. For example, Corresponding Source
129
+ includes interface definition files associated with source files for
130
+ the work, and the source code for shared libraries and dynamically
131
+ linked subprograms that the work is specifically designed to require,
132
+ such as by intimate data communication or control flow between those
133
+ subprograms and other parts of the work.
134
+
135
+ The Corresponding Source need not include anything that users
136
+ can regenerate automatically from other parts of the Corresponding
137
+ Source.
138
+
139
+ The Corresponding Source for a work in source code form is that
140
+ same work.
141
+
142
+ 2. Basic Permissions.
143
+
144
+ All rights granted under this License are granted for the term of
145
+ copyright on the Program, and are irrevocable provided the stated
146
+ conditions are met. This License explicitly affirms your unlimited
147
+ permission to run the unmodified Program. The output from running a
148
+ covered work is covered by this License only if the output, given its
149
+ content, constitutes a covered work. This License acknowledges your
150
+ rights of fair use or other equivalent, as provided by copyright law.
151
+
152
+ You may make, run and propagate covered works that you do not
153
+ convey, without conditions so long as your license otherwise remains
154
+ in force. You may convey covered works to others for the sole purpose
155
+ of having them make modifications exclusively for you, or provide you
156
+ with facilities for running those works, provided that you comply with
157
+ the terms of this License in conveying all material for which you do
158
+ not control copyright. Those thus making or running the covered works
159
+ for you must do so exclusively on your behalf, under your direction
160
+ and control, on terms that prohibit them from making any copies of
161
+ your copyrighted material outside their relationship with you.
162
+
163
+ Conveying under any other circumstances is permitted solely under
164
+ the conditions stated below. Sublicensing is not allowed; section 10
165
+ makes it unnecessary.
166
+
167
+ 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
168
+
169
+ No covered work shall be deemed part of an effective technological
170
+ measure under any applicable law fulfilling obligations under article
171
+ 11 of the WIPO copyright treaty adopted on 20 December 1996, or
172
+ similar laws prohibiting or restricting circumvention of such
173
+ measures.
174
+
175
+ When you convey a covered work, you waive any legal power to forbid
176
+ circumvention of technological measures to the extent such circumvention
177
+ is effected by exercising rights under this License with respect to
178
+ the covered work, and you disclaim any intention to limit operation or
179
+ modification of the work as a means of enforcing, against the work's
180
+ users, your or third parties' legal rights to forbid circumvention of
181
+ technological measures.
182
+
183
+ 4. Conveying Verbatim Copies.
184
+
185
+ You may convey verbatim copies of the Program's source code as you
186
+ receive it, in any medium, provided that you conspicuously and
187
+ appropriately publish on each copy an appropriate copyright notice;
188
+ keep intact all notices stating that this License and any
189
+ non-permissive terms added in accord with section 7 apply to the code;
190
+ keep intact all notices of the absence of any warranty; and give all
191
+ recipients a copy of this License along with the Program.
192
+
193
+ You may charge any price or no price for each copy that you convey,
194
+ and you may offer support or warranty protection for a fee.
195
+
196
+ 5. Conveying Modified Source Versions.
197
+
198
+ You may convey a work based on the Program, or the modifications to
199
+ produce it from the Program, in the form of source code under the
200
+ terms of section 4, provided that you also meet all of these conditions:
201
+
202
+ a) The work must carry prominent notices stating that you modified
203
+ it, and giving a relevant date.
204
+
205
+ b) The work must carry prominent notices stating that it is
206
+ released under this License and any conditions added under section
207
+ 7. This requirement modifies the requirement in section 4 to
208
+ "keep intact all notices".
209
+
210
+ c) You must license the entire work, as a whole, under this
211
+ License to anyone who comes into possession of a copy. This
212
+ License will therefore apply, along with any applicable section 7
213
+ additional terms, to the whole of the work, and all its parts,
214
+ regardless of how they are packaged. This License gives no
215
+ permission to license the work in any other way, but it does not
216
+ invalidate such permission if you have separately received it.
217
+
218
+ d) If the work has interactive user interfaces, each must display
219
+ Appropriate Legal Notices; however, if the Program has interactive
220
+ interfaces that do not display Appropriate Legal Notices, your
221
+ work need not make them do so.
222
+
223
+ A compilation of a covered work with other separate and independent
224
+ works, which are not by their nature extensions of the covered work,
225
+ and which are not combined with it such as to form a larger program,
226
+ in or on a volume of a storage or distribution medium, is called an
227
+ "aggregate" if the compilation and its resulting copyright are not
228
+ used to limit the access or legal rights of the compilation's users
229
+ beyond what the individual works permit. Inclusion of a covered work
230
+ in an aggregate does not cause this License to apply to the other
231
+ parts of the aggregate.
232
+
233
+ 6. Conveying Non-Source Forms.
234
+
235
+ You may convey a covered work in object code form under the terms
236
+ of sections 4 and 5, provided that you also convey the
237
+ machine-readable Corresponding Source under the terms of this License,
238
+ in one of these ways:
239
+
240
+ a) Convey the object code in, or embodied in, a physical product
241
+ (including a physical distribution medium), accompanied by the
242
+ Corresponding Source fixed on a durable physical medium
243
+ customarily used for software interchange.
244
+
245
+ b) Convey the object code in, or embodied in, a physical product
246
+ (including a physical distribution medium), accompanied by a
247
+ written offer, valid for at least three years and valid for as
248
+ long as you offer spare parts or customer support for that product
249
+ model, to give anyone who possesses the object code either (1) a
250
+ copy of the Corresponding Source for all the software in the
251
+ product that is covered by this License, on a durable physical
252
+ medium customarily used for software interchange, for a price no
253
+ more than your reasonable cost of physically performing this
254
+ conveying of source, or (2) access to copy the
255
+ Corresponding Source from a network server at no charge.
256
+
257
+ c) Convey individual copies of the object code with a copy of the
258
+ written offer to provide the Corresponding Source. This
259
+ alternative is allowed only occasionally and noncommercially, and
260
+ only if you received the object code with such an offer, in accord
261
+ with subsection 6b.
262
+
263
+ d) Convey the object code by offering access from a designated
264
+ place (gratis or for a charge), and offer equivalent access to the
265
+ Corresponding Source in the same way through the same place at no
266
+ further charge. You need not require recipients to copy the
267
+ Corresponding Source along with the object code. If the place to
268
+ copy the object code is a network server, the Corresponding Source
269
+ may be on a different server (operated by you or a third party)
270
+ that supports equivalent copying facilities, provided you maintain
271
+ clear directions next to the object code saying where to find the
272
+ Corresponding Source. Regardless of what server hosts the
273
+ Corresponding Source, you remain obligated to ensure that it is
274
+ available for as long as needed to satisfy these requirements.
275
+
276
+ e) Convey the object code using peer-to-peer transmission, provided
277
+ you inform other peers where the object code and Corresponding
278
+ Source of the work are being offered to the general public at no
279
+ charge under subsection 6d.
280
+
281
+ A separable portion of the object code, whose source code is excluded
282
+ from the Corresponding Source as a System Library, need not be
283
+ included in conveying the object code work.
284
+
285
+ A "User Product" is either (1) a "consumer product", which means any
286
+ tangible personal property which is normally used for personal, family,
287
+ or household purposes, or (2) anything designed or sold for incorporation
288
+ into a dwelling. In determining whether a product is a consumer product,
289
+ doubtful cases shall be resolved in favor of coverage. For a particular
290
+ product received by a particular user, "normally used" refers to a
291
+ typical or common use of that class of product, regardless of the status
292
+ of the particular user or of the way in which the particular user
293
+ actually uses, or expects or is expected to use, the product. A product
294
+ is a consumer product regardless of whether the product has substantial
295
+ commercial, industrial or non-consumer uses, unless such uses represent
296
+ the only significant mode of use of the product.
297
+
298
+ "Installation Information" for a User Product means any methods,
299
+ procedures, authorization keys, or other information required to install
300
+ and execute modified versions of a covered work in that User Product from
301
+ a modified version of its Corresponding Source. The information must
302
+ suffice to ensure that the continued functioning of the modified object
303
+ code is in no case prevented or interfered with solely because
304
+ modification has been made.
305
+
306
+ If you convey an object code work under this section in, or with, or
307
+ specifically for use in, a User Product, and the conveying occurs as
308
+ part of a transaction in which the right of possession and use of the
309
+ User Product is transferred to the recipient in perpetuity or for a
310
+ fixed term (regardless of how the transaction is characterized), the
311
+ Corresponding Source conveyed under this section must be accompanied
312
+ by the Installation Information. But this requirement does not apply
313
+ if neither you nor any third party retains the ability to install
314
+ modified object code on the User Product (for example, the work has
315
+ been installed in ROM).
316
+
317
+ The requirement to provide Installation Information does not include a
318
+ requirement to continue to provide support service, warranty, or updates
319
+ for a work that has been modified or installed by the recipient, or for
320
+ the User Product in which it has been modified or installed. Access to a
321
+ network may be denied when the modification itself materially and
322
+ adversely affects the operation of the network or violates the rules and
323
+ protocols for communication across the network.
324
+
325
+ Corresponding Source conveyed, and Installation Information provided,
326
+ in accord with this section must be in a format that is publicly
327
+ documented (and with an implementation available to the public in
328
+ source code form), and must require no special password or key for
329
+ unpacking, reading or copying.
330
+
331
+ 7. Additional Terms.
332
+
333
+ "Additional permissions" are terms that supplement the terms of this
334
+ License by making exceptions from one or more of its conditions.
335
+ Additional permissions that are applicable to the entire Program shall
336
+ be treated as though they were included in this License, to the extent
337
+ that they are valid under applicable law. If additional permissions
338
+ apply only to part of the Program, that part may be used separately
339
+ under those permissions, but the entire Program remains governed by
340
+ this License without regard to the additional permissions.
341
+
342
+ When you convey a copy of a covered work, you may at your option
343
+ remove any additional permissions from that copy, or from any part of
344
+ it. (Additional permissions may be written to require their own
345
+ removal in certain cases when you modify the work.) You may place
346
+ additional permissions on material, added by you to a covered work,
347
+ for which you have or can give appropriate copyright permission.
348
+
349
+ Notwithstanding any other provision of this License, for material you
350
+ add to a covered work, you may (if authorized by the copyright holders of
351
+ that material) supplement the terms of this License with terms:
352
+
353
+ a) Disclaiming warranty or limiting liability differently from the
354
+ terms of sections 15 and 16 of this License; or
355
+
356
+ b) Requiring preservation of specified reasonable legal notices or
357
+ author attributions in that material or in the Appropriate Legal
358
+ Notices displayed by works containing it; or
359
+
360
+ c) Prohibiting misrepresentation of the origin of that material, or
361
+ requiring that modified versions of such material be marked in
362
+ reasonable ways as different from the original version; or
363
+
364
+ d) Limiting the use for publicity purposes of names of licensors or
365
+ authors of the material; or
366
+
367
+ e) Declining to grant rights under trademark law for use of some
368
+ trade names, trademarks, or service marks; or
369
+
370
+ f) Requiring indemnification of licensors and authors of that
371
+ material by anyone who conveys the material (or modified versions of
372
+ it) with contractual assumptions of liability to the recipient, for
373
+ any liability that these contractual assumptions directly impose on
374
+ those licensors and authors.
375
+
376
+ All other non-permissive additional terms are considered "further
377
+ restrictions" within the meaning of section 10. If the Program as you
378
+ received it, or any part of it, contains a notice stating that it is
379
+ governed by this License along with a term that is a further
380
+ restriction, you may remove that term. If a license document contains
381
+ a further restriction but permits relicensing or conveying under this
382
+ License, you may add to a covered work material governed by the terms
383
+ of that license document, provided that the further restriction does
384
+ not survive such relicensing or conveying.
385
+
386
+ If you add terms to a covered work in accord with this section, you
387
+ must place, in the relevant source files, a statement of the
388
+ additional terms that apply to those files, or a notice indicating
389
+ where to find the applicable terms.
390
+
391
+ Additional terms, permissive or non-permissive, may be stated in the
392
+ form of a separately written license, or stated as exceptions;
393
+ the above requirements apply either way.
394
+
395
+ 8. Termination.
396
+
397
+ You may not propagate or modify a covered work except as expressly
398
+ provided under this License. Any attempt otherwise to propagate or
399
+ modify it is void, and will automatically terminate your rights under
400
+ this License (including any patent licenses granted under the third
401
+ paragraph of section 11).
402
+
403
+ However, if you cease all violation of this License, then your
404
+ license from a particular copyright holder is reinstated (a)
405
+ provisionally, unless and until the copyright holder explicitly and
406
+ finally terminates your license, and (b) permanently, if the copyright
407
+ holder fails to notify you of the violation by some reasonable means
408
+ prior to 60 days after the cessation.
409
+
410
+ Moreover, your license from a particular copyright holder is
411
+ reinstated permanently if the copyright holder notifies you of the
412
+ violation by some reasonable means, this is the first time you have
413
+ received notice of violation of this License (for any work) from that
414
+ copyright holder, and you cure the violation prior to 30 days after
415
+ your receipt of the notice.
416
+
417
+ Termination of your rights under this section does not terminate the
418
+ licenses of parties who have received copies or rights from you under
419
+ this License. If your rights have been terminated and not permanently
420
+ reinstated, you do not qualify to receive new licenses for the same
421
+ material under section 10.
422
+
423
+ 9. Acceptance Not Required for Having Copies.
424
+
425
+ You are not required to accept this License in order to receive or
426
+ run a copy of the Program. Ancillary propagation of a covered work
427
+ occurring solely as a consequence of using peer-to-peer transmission
428
+ to receive a copy likewise does not require acceptance. However,
429
+ nothing other than this License grants you permission to propagate or
430
+ modify any covered work. These actions infringe copyright if you do
431
+ not accept this License. Therefore, by modifying or propagating a
432
+ covered work, you indicate your acceptance of this License to do so.
433
+
434
+ 10. Automatic Licensing of Downstream Recipients.
435
+
436
+ Each time you convey a covered work, the recipient automatically
437
+ receives a license from the original licensors, to run, modify and
438
+ propagate that work, subject to this License. You are not responsible
439
+ for enforcing compliance by third parties with this License.
440
+
441
+ An "entity transaction" is a transaction transferring control of an
442
+ organization, or substantially all assets of one, or subdividing an
443
+ organization, or merging organizations. If propagation of a covered
444
+ work results from an entity transaction, each party to that
445
+ transaction who receives a copy of the work also receives whatever
446
+ licenses to the work the party's predecessor in interest had or could
447
+ give under the previous paragraph, plus a right to possession of the
448
+ Corresponding Source of the work from the predecessor in interest, if
449
+ the predecessor has it or can get it with reasonable efforts.
450
+
451
+ You may not impose any further restrictions on the exercise of the
452
+ rights granted or affirmed under this License. For example, you may
453
+ not impose a license fee, royalty, or other charge for exercise of
454
+ rights granted under this License, and you may not initiate litigation
455
+ (including a cross-claim or counterclaim in a lawsuit) alleging that
456
+ any patent claim is infringed by making, using, selling, offering for
457
+ sale, or importing the Program or any portion of it.
458
+
459
+ 11. Patents.
460
+
461
+ A "contributor" is a copyright holder who authorizes use under this
462
+ License of the Program or a work on which the Program is based. The
463
+ work thus licensed is called the contributor's "contributor version".
464
+
465
+ A contributor's "essential patent claims" are all patent claims
466
+ owned or controlled by the contributor, whether already acquired or
467
+ hereafter acquired, that would be infringed by some manner, permitted
468
+ by this License, of making, using, or selling its contributor version,
469
+ but do not include claims that would be infringed only as a
470
+ consequence of further modification of the contributor version. For
471
+ purposes of this definition, "control" includes the right to grant
472
+ patent sublicenses in a manner consistent with the requirements of
473
+ this License.
474
+
475
+ Each contributor grants you a non-exclusive, worldwide, royalty-free
476
+ patent license under the contributor's essential patent claims, to
477
+ make, use, sell, offer for sale, import and otherwise run, modify and
478
+ propagate the contents of its contributor version.
479
+
480
+ In the following three paragraphs, a "patent license" is any express
481
+ agreement or commitment, however denominated, not to enforce a patent
482
+ (such as an express permission to practice a patent or covenant not to
483
+ sue for patent infringement). To "grant" such a patent license to a
484
+ party means to make such an agreement or commitment not to enforce a
485
+ patent against the party.
486
+
487
+ If you convey a covered work, knowingly relying on a patent license,
488
+ and the Corresponding Source of the work is not available for anyone
489
+ to copy, free of charge and under the terms of this License, through a
490
+ publicly available network server or other readily accessible means,
491
+ then you must either (1) cause the Corresponding Source to be so
492
+ available, or (2) arrange to deprive yourself of the benefit of the
493
+ patent license for this particular work, or (3) arrange, in a manner
494
+ consistent with the requirements of this License, to extend the patent
495
+ license to downstream recipients. "Knowingly relying" means you have
496
+ actual knowledge that, but for the patent license, your conveying the
497
+ covered work in a country, or your recipient's use of the covered work
498
+ in a country, would infringe one or more identifiable patents in that
499
+ country that you have reason to believe are valid.
500
+
501
+ If, pursuant to or in connection with a single transaction or
502
+ arrangement, you convey, or propagate by procuring conveyance of, a
503
+ covered work, and grant a patent license to some of the parties
504
+ receiving the covered work authorizing them to use, propagate, modify
505
+ or convey a specific copy of the covered work, then the patent license
506
+ you grant is automatically extended to all recipients of the covered
507
+ work and works based on it.
508
+
509
+ A patent license is "discriminatory" if it does not include within
510
+ the scope of its coverage, prohibits the exercise of, or is
511
+ conditioned on the non-exercise of one or more of the rights that are
512
+ specifically granted under this License. You may not convey a covered
513
+ work if you are a party to an arrangement with a third party that is
514
+ in the business of distributing software, under which you make payment
515
+ to the third party based on the extent of your activity of conveying
516
+ the work, and under which the third party grants, to any of the
517
+ parties who would receive the covered work from you, a discriminatory
518
+ patent license (a) in connection with copies of the covered work
519
+ conveyed by you (or copies made from those copies), or (b) primarily
520
+ for and in connection with specific products or compilations that
521
+ contain the covered work, unless you entered into that arrangement,
522
+ or that patent license was granted, prior to 28 March 2007.
523
+
524
+ Nothing in this License shall be construed as excluding or limiting
525
+ any implied license or other defenses to infringement that may
526
+ otherwise be available to you under applicable patent law.
527
+
528
+ 12. No Surrender of Others' Freedom.
529
+
530
+ If conditions are imposed on you (whether by court order, agreement or
531
+ otherwise) that contradict the conditions of this License, they do not
532
+ excuse you from the conditions of this License. If you cannot convey a
533
+ covered work so as to satisfy simultaneously your obligations under this
534
+ License and any other pertinent obligations, then as a consequence you may
535
+ not convey it at all. For example, if you agree to terms that obligate you
536
+ to collect a royalty for further conveying from those to whom you convey
537
+ the Program, the only way you could satisfy both those terms and this
538
+ License would be to refrain entirely from conveying the Program.
539
+
540
+ 13. Remote Network Interaction; Use with the GNU General Public License.
541
+
542
+ Notwithstanding any other provision of this License, if you modify the
543
+ Program, your modified version must prominently offer all users
544
+ interacting with it remotely through a computer network (if your version
545
+ supports such interaction) an opportunity to receive the Corresponding
546
+ Source of your version by providing access to the Corresponding Source
547
+ from a network server at no charge, through some standard or customary
548
+ means of facilitating copying of software. This Corresponding Source
549
+ shall include the Corresponding Source for any work covered by version 3
550
+ of the GNU General Public License that is incorporated pursuant to the
551
+ following paragraph.
552
+
553
+ Notwithstanding any other provision of this License, you have
554
+ permission to link or combine any covered work with a work licensed
555
+ under version 3 of the GNU General Public License into a single
556
+ combined work, and to convey the resulting work. The terms of this
557
+ License will continue to apply to the part which is the covered work,
558
+ but the work with which it is combined will remain governed by version
559
+ 3 of the GNU General Public License.
560
+
561
+ 14. Revised Versions of this License.
562
+
563
+ The Free Software Foundation may publish revised and/or new versions of
564
+ the GNU Affero General Public License from time to time. Such new versions
565
+ will be similar in spirit to the present version, but may differ in detail to
566
+ address new problems or concerns.
567
+
568
+ Each version is given a distinguishing version number. If the
569
+ Program specifies that a certain numbered version of the GNU Affero General
570
+ Public License "or any later version" applies to it, you have the
571
+ option of following the terms and conditions either of that numbered
572
+ version or of any later version published by the Free Software
573
+ Foundation. If the Program does not specify a version number of the
574
+ GNU Affero General Public License, you may choose any version ever published
575
+ by the Free Software Foundation.
576
+
577
+ If the Program specifies that a proxy can decide which future
578
+ versions of the GNU Affero General Public License can be used, that proxy's
579
+ public statement of acceptance of a version permanently authorizes you
580
+ to choose that version for the Program.
581
+
582
+ Later license versions may give you additional or different
583
+ permissions. However, no additional obligations are imposed on any
584
+ author or copyright holder as a result of your choosing to follow a
585
+ later version.
586
+
587
+ 15. Disclaimer of Warranty.
588
+
589
+ THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
590
+ APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
591
+ HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
592
+ OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
593
+ THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
594
+ PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
595
+ IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
596
+ ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
597
+
598
+ 16. Limitation of Liability.
599
+
600
+ IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
601
+ WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
602
+ THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
603
+ GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
604
+ USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
605
+ DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
606
+ PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
607
+ EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
608
+ SUCH DAMAGES.
609
+
610
+ 17. Interpretation of Sections 15 and 16.
611
+
612
+ If the disclaimer of warranty and limitation of liability provided
613
+ above cannot be given local legal effect according to their terms,
614
+ reviewing courts shall apply local law that most closely approximates
615
+ an absolute waiver of all civil liability in connection with the
616
+ Program, unless a warranty or assumption of liability accompanies a
617
+ copy of the Program in return for a fee.
618
+
619
+ END OF TERMS AND CONDITIONS
620
+
621
+ ----------------------------------------------------------------------
622
+ ADDITIONAL NOTICE: INCLUDED MACHINE LEARNING MODELS
623
+ ----------------------------------------------------------------------
624
+
625
+ This Program distributes pre-trained machine learning models which are
626
+ governed by their own respective licenses. These binary could be NOT
627
+ licensed under the GNU AGPLv3.
628
+
629
+ From AudioMuse-AI v0.9.0 the following models are included and you agree to
630
+ the following terms:
631
+
632
+ 1. MUSICNN MODELS:
633
+ - License: ISC
634
+ - Official Project: https://github.com/jordipons/musicnn
635
+
636
+ 2. LAION-CLAP MODEL (only Text Head):
637
+ - License: CC0 1.0 (Public Domain)
638
+ - Official Project: https://github.com/LAION-AI/CLAP
639
+
640
+ 3. AudioMuse-AI-DCLAP MODELS (only Audio Head):
641
+ - License: AGPLv3
642
+ - Official Project: https://github.com/NeptuneHub/AudioMuse-AI-DCLAP
643
+
644
+ 4. NEURAL MUSIC FINGERPRINT MODEL (Neural Music FP):
645
+ - License: AGPLv3 (code and model weights)
646
+ - Official Project: https://github.com/raraz15/neural-music-fp
647
+
648
+ 5. AudioMuse-AI-SAE MODELS (sparse autoencoder over the DCLAP embedding):
649
+ - License: AGPLv3
650
+ - Official Project: https://github.com/NeptuneHub/AudioMuse-AI-SAE
651
+
652
+ 6. WHISPER SMALL MODEL (ONNX export of openai/whisper-small):
653
+ - License: MIT (code and model weights, as released by OpenAI); the
654
+ Hugging Face openai/whisper-small checkpoint used for the ONNX export
655
+ is tagged Apache 2.0
656
+ - Official Project: https://github.com/openai/whisper
657
+ - Model Checkpoint: https://huggingface.co/openai/whisper-small
658
+
659
+ 7. SILERO VAD MODEL (voice activity detection):
660
+ - License: MIT
661
+ - Official Project: https://github.com/snakers4/silero-vad
662
+
663
+ 8. GTE MULTILINGUAL BASE MODEL (INT8 ONNX export, lyrics text embedding):
664
+ - License: Apache 2.0
665
+ - Official Project: https://huggingface.co/Alibaba-NLP/gte-multilingual-base
666
+
667
+ 9. ROBERTA-BASE TOKENIZER (used by the LAION-CLAP text head):
668
+ - License: MIT
669
+ - Official Project: https://huggingface.co/FacebookAI/roberta-base
670
+
671
+ To maintain a clear distinction between the open-source code and the
672
+ model weights, all machine learning models are treated as distinct assets.
673
+ While these models are pre-embedded within our containerized releases and
674
+ Docker images for "out-of-the-box" functionality, they remain easily
675
+ identifiable.
676
+
677
+ The specific model binaries used in each version are cross-referenced in
678
+ the repository via dedicated model-only releases:
679
+
680
+ - Release Naming Convention: v[version]-model (e.g., `v4.0.0-model`)
681
+ - Download Location: https://github.com/NeptuneHub/AudioMuse-AI/releases
682
+
683
+ or in AudioMuse-AI-DCLAP release:
684
+ - https://github.com/NeptuneHub/AudioMuse-AI-DCLAP/releases
685
+
686
+ or in AudioMuse-AI-SAE release:
687
+ - https://github.com/NeptuneHub/AudioMuse-AI-SAE/releases
688
+
689
+ This naming convention allows users to clearly audit which restricted weights
690
+ are present within the combined software distribution.
691
+
692
+ SUMMARY FOR USERS:
693
+ The software code is Open Source under AGPLv3. However, the complete
694
+ distribution (including Docker images or releases containing these files)
695
+ depends from the model weight used.
plugin/plugins/VibeSearch/__init__.py ADDED
@@ -0,0 +1,409 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ """Vibe Search: search your library by how music sounds and feels ("rainy Sunday coffee shop", "upbeat but
2
+ melancholic, no vocals"), or find songs with the same vibe as one you pick, and save the results as a playlist.
3
+
4
+ It runs next to AudioMuse-AI's own models and changes nothing in them:
5
+ * after each song is analysed, a small audio model (EfficientAT mn20_as, distilled from a teacher that joins
6
+ LCO-Embedding-Omni-7B and e5-omni-7B) gives it a 512-number vibe vector, stored in this plugin's own table;
7
+ * "Index my library" fills in the songs that were analysed before the plugin was installed;
8
+ * searches are turned into the same kind of vector by a text model (Qwen3-Embedding-0.6B plus a small trained layer)
9
+ and compared with every song.
10
+ The models are downloaded on first use from the Hugging Face repository set on the settings page.
11
+ """
12
+ import html
13
+ import os
14
+ import threading
15
+ import time
16
+
17
+ import numpy as np
18
+ from flask import Blueprint, redirect, request, url_for
19
+
20
+ from plugin.api import (config, enqueue, get_db, get_score_data_by_ids, get_setting, logger, manage_plugins_url,
21
+ render_page, set_setting, table)
22
+
23
+ from . import vibemodel
24
+
25
+ bp = Blueprint("vibe_search", __name__)
26
+
27
+ DEFAULTS = {
28
+ "model_repo": "Divi19/vibe-embed",
29
+ "revision": "main",
30
+ "base_url": "https://huggingface.co",
31
+ "precision": "int8",
32
+ "threads": 4,
33
+ "embed_on_analysis": True,
34
+ "result_limit": 50,
35
+ }
36
+
37
+
38
+ STUDENT = "mn20_as" # the only audio model size the release ships
39
+ INT8_TEXT_MIN_ORT = (1, 28) # the 8-bit text model uses an operator setting that older onnxruntime builds lack
40
+
41
+
42
+ def setting(key):
43
+ return get_setting(key, DEFAULTS[key])
44
+
45
+
46
+ def ort_version():
47
+ try:
48
+ import onnxruntime as ort
49
+ return tuple(int(x) for x in ort.__version__.split(".")[:2])
50
+ except Exception:
51
+ return (0, 0)
52
+
53
+
54
+ def model_dir():
55
+ base = getattr(config, "PLUGINS_DIR", "") or "/tmp"
56
+ return os.path.join(base, "_data", "vibe_search", "models", setting("model_repo").replace("/", "__"), setting("revision"))
57
+
58
+
59
+ # ---------------------------------------------------------------- models (loaded once per container, on first use)
60
+ _models, _model_errors, _model_notes, _model_lock = {}, {}, {}, threading.Lock()
61
+
62
+
63
+ def get_model(kind):
64
+ """kind: 'audio' (worker: indexing) or 'text' (web: searching). Returns the loaded model or None (error logged)."""
65
+ wanted = setting("precision")
66
+ key = (kind, setting("model_repo"), setting("revision"), STUDENT, wanted)
67
+ with _model_lock:
68
+ if key in _models:
69
+ return _models[key]
70
+ tries = [wanted] if wanted == "fp32" else ["int8", "fp32"]
71
+ if kind == "text" and wanted == "int8" and ort_version() < INT8_TEXT_MIN_ORT:
72
+ tries = ["fp32"] # e.g. AudioMuse-AI's no-AVX2 image (onnxruntime 1.19): skip the 600 MB download that cannot run
73
+ _model_notes[kind] = (f"The search model runs at full precision: this onnxruntime ({'.'.join(map(str, ort_version()))}) "
74
+ f"is older than {'.'.join(map(str, INT8_TEXT_MIN_ORT))}, which the 8-bit file needs.")
75
+ errors = []
76
+ for precision in tries:
77
+ try:
78
+ d = model_dir()
79
+ vibemodel.download_files(d, setting("base_url"), setting("model_repo"), setting("revision"),
80
+ vibemodel.files_needed(STUDENT, precision, [kind]), log=logger.info)
81
+ m = vibemodel.VibeModel(d, STUDENT, precision, setting("threads"))
82
+ cos = m.load_audio() if kind == "audio" else m.load_text()
83
+ logger.info(f"vibe_search: {kind} model ready ({m.tag}, {precision}, check {cos:.4f})")
84
+ if precision != wanted and kind not in _model_notes:
85
+ _model_notes[kind] = f"The {kind} model runs at full precision because the 8-bit file failed: {errors[-1]}"
86
+ _models[key] = m
87
+ _model_errors.pop(kind, None)
88
+ return m
89
+ except Exception as e:
90
+ errors.append(f"{precision}: {type(e).__name__}: {e}")
91
+ logger.exception(f"vibe_search: the {kind} model ({precision}) could not be loaded")
92
+ _model_errors[kind] = "; ".join(errors)
93
+ return None
94
+
95
+
96
+ def current_tag():
97
+ """The model version stored vectors must match. Read from config.json without loading a model."""
98
+ try:
99
+ import json, hashlib
100
+ cfg = json.load(open(os.path.join(model_dir(), "config.json")))
101
+ return f"{STUDENT}:{hashlib.md5(json.dumps(cfg, sort_keys=True).encode()).hexdigest()[:12]}"
102
+ except Exception:
103
+ return None
104
+
105
+
106
+ # ---------------------------------------------------------------- storage
107
+ def vec_table():
108
+ return table("vectors")
109
+
110
+
111
+ def migrate(db):
112
+ cur = db.cursor()
113
+ cur.execute("CREATE TABLE IF NOT EXISTS " + vec_table() + " (item_id TEXT PRIMARY KEY, model_tag TEXT NOT NULL, "
114
+ "vec BYTEA NOT NULL, n_windows INTEGER, updated_at TIMESTAMP DEFAULT CURRENT_TIMESTAMP)")
115
+ cur.execute("CREATE INDEX IF NOT EXISTS " + vec_table() + "_tag ON " + vec_table() + " (model_tag)")
116
+ db.commit()
117
+ cur.close()
118
+
119
+
120
+ def save_vector(item_id, tag, vec, n_windows):
121
+ db = get_db()
122
+ cur = db.cursor()
123
+ cur.execute("INSERT INTO " + vec_table() + " (item_id, model_tag, vec, n_windows) VALUES (%s, %s, %s, %s) "
124
+ "ON CONFLICT (item_id) DO UPDATE SET model_tag = EXCLUDED.model_tag, vec = EXCLUDED.vec, "
125
+ "n_windows = EXCLUDED.n_windows, updated_at = CURRENT_TIMESTAMP",
126
+ (str(item_id), tag, np.asarray(vec, np.float16).tobytes(), int(n_windows)))
127
+ db.commit()
128
+ cur.close()
129
+ _matrix_cache.clear()
130
+
131
+
132
+ def indexed_ids(tag):
133
+ cur = get_db().cursor()
134
+ cur.execute("SELECT item_id FROM " + vec_table() + " WHERE model_tag = %s", (tag,))
135
+ out = {r[0] for r in cur.fetchall()}
136
+ cur.close()
137
+ return out
138
+
139
+
140
+ _matrix_cache = {}
141
+
142
+
143
+ def song_matrix(tag):
144
+ """All stored song vectors of this model version, cached until a vector is added."""
145
+ cur = get_db().cursor()
146
+ cur.execute("SELECT COUNT(*), MAX(updated_at) FROM " + vec_table() + " WHERE model_tag = %s", (tag,))
147
+ stamp = tuple(str(x) for x in cur.fetchone())
148
+ if _matrix_cache.get("stamp") == (tag,) + stamp:
149
+ cur.close()
150
+ return _matrix_cache["ids"], _matrix_cache["mat"]
151
+ cur.execute("SELECT item_id, vec FROM " + vec_table() + " WHERE model_tag = %s", (tag,))
152
+ rows = cur.fetchall()
153
+ cur.close()
154
+ ids = [r[0] for r in rows]
155
+ mat = np.stack([np.frombuffer(bytes(r[1]), np.float16) for r in rows]) if rows else np.zeros((0, 512), np.float16)
156
+ _matrix_cache.update(stamp=(tag,) + stamp, ids=ids, mat=mat)
157
+ return ids, mat
158
+
159
+
160
+ def top_k(query_vec, tag, k, exclude=None):
161
+ ids, mat = song_matrix(tag)
162
+ if not ids:
163
+ return []
164
+ scores = np.concatenate([mat[i:i + 50000].astype(np.float32) @ query_vec for i in range(0, len(ids), 50000)])
165
+ order = np.argsort(-scores)
166
+ out = []
167
+ for j in order:
168
+ if ids[j] != exclude:
169
+ out.append((ids[j], float(scores[j])))
170
+ if len(out) >= k:
171
+ break
172
+ return out
173
+
174
+
175
+ # ---------------------------------------------------------------- audio
176
+ def load_wave(path):
177
+ """Decode to 32 kHz mono with AudioMuse-AI's own loader (the same one its analysis uses)."""
178
+ try:
179
+ from tasks.analysis.song import robust_load_audio_with_fallback
180
+ audio, sr = robust_load_audio_with_fallback(path, target_sr=vibemodel.SR)
181
+ if audio is not None and sr == vibemodel.SR:
182
+ return np.asarray(audio, np.float32)
183
+ except Exception:
184
+ logger.exception("vibe_search: AudioMuse-AI's audio loader failed; trying soundfile")
185
+ import soundfile as sf
186
+ y, sr = sf.read(path, dtype="float32", always_2d=True)
187
+ y = y.mean(1)
188
+ if sr != vibemodel.SR:
189
+ import soxr
190
+ y = soxr.resample(y, sr, vibemodel.SR, quality="HQ").astype(np.float32)
191
+ return y
192
+
193
+
194
+ def canonical_id(item_id, server_id=None):
195
+ try:
196
+ from tasks.mediaserver.registry import canonical_input_ids
197
+ return canonical_input_ids([item_id], server_id).get(str(item_id), str(item_id))
198
+ except Exception:
199
+ return str(item_id)
200
+
201
+
202
+ def embed_file(path, item_id):
203
+ m = get_model("audio")
204
+ if m is None:
205
+ return False
206
+ t0 = time.time()
207
+ vec, n = m.embed_audio(load_wave(path))
208
+ save_vector(item_id, m.tag, vec, n)
209
+ logger.info(f"vibe_search: {item_id} embedded ({n} windows, {time.time() - t0:.1f} s)")
210
+ return True
211
+
212
+
213
+ def on_song_analyzed(song):
214
+ """Runs on the worker right after AudioMuse-AI finishes a song; the audio file is deleted once this returns."""
215
+ if not setting("embed_on_analysis") or not song.get("audio_path"):
216
+ return
217
+ embed_file(song["audio_path"], canonical_id(song["item_id"], song.get("server_id")))
218
+
219
+
220
+ def index_library():
221
+ """Worker task: give a vibe vector to every song that does not have one yet (for songs analysed before install)."""
222
+ from tasks.mediaserver import download_track, get_all_songs
223
+ m = get_model("audio")
224
+ if m is None:
225
+ raise RuntimeError("the audio model could not be loaded: " + _model_errors.get("audio", "unknown error"))
226
+ songs = get_all_songs() or []
227
+ done = indexed_ids(m.tag)
228
+ todo = [s for s in songs if canonical_id(s.get("Id")) not in done]
229
+ status = {"started": time.strftime("%Y-%m-%d %H:%M"), "total": len(todo), "done": 0, "failed": 0, "finished": False}
230
+ set_setting("index_status", status)
231
+ logger.info(f"vibe_search: indexing {len(todo)} of {len(songs)} songs")
232
+ temp_dir = getattr(config, "TEMP_DIR", "/tmp")
233
+ os.makedirs(temp_dir, exist_ok=True)
234
+ for i, item in enumerate(todo):
235
+ path = None
236
+ try:
237
+ path = download_track(temp_dir, item)
238
+ if not path or not embed_file(path, canonical_id(item.get("Id"))):
239
+ status["failed"] += 1
240
+ else:
241
+ status["done"] += 1
242
+ except Exception:
243
+ status["failed"] += 1
244
+ logger.exception(f"vibe_search: could not index {item.get('Id')}")
245
+ finally:
246
+ if path and os.path.exists(path):
247
+ os.remove(path)
248
+ if (i + 1) % 25 == 0:
249
+ set_setting("index_status", status)
250
+ status["finished"] = True
251
+ set_setting("index_status", status)
252
+
253
+
254
+ # ---------------------------------------------------------------- pages
255
+ CSS = """<style>
256
+ .vs { max-width: 980px; display: grid; gap: 16px; }
257
+ .vs form.search { display: flex; gap: 8px; flex-wrap: wrap; }
258
+ .vs input[type=text] { flex: 1 1 360px; padding: 8px 10px; font-size: 1rem; }
259
+ .vs table { border-collapse: collapse; width: 100%; }
260
+ .vs td, .vs th { padding: 6px 8px; border-bottom: 1px solid rgba(128,128,128,.25); text-align: left; vertical-align: top; }
261
+ .vs .score { font-variant-numeric: tabular-nums; opacity: .7; }
262
+ .vs .note { opacity: .75; font-size: .92rem; }
263
+ .vs .err { color: #b3261e; }
264
+ </style>"""
265
+
266
+
267
+ def page(body, title="Vibe Search"):
268
+ return render_page(CSS + '<div class="vs">' + body + "</div>", title=title)
269
+
270
+
271
+ def status_html():
272
+ tag = current_tag()
273
+ n_songs = n_vec = 0
274
+ try:
275
+ cur = get_db().cursor()
276
+ cur.execute("SELECT COUNT(*) FROM score")
277
+ n_songs = cur.fetchone()[0]
278
+ if tag:
279
+ cur.execute("SELECT COUNT(*) FROM " + vec_table() + " WHERE model_tag = %s", (tag,))
280
+ n_vec = cur.fetchone()[0]
281
+ cur.close()
282
+ except Exception:
283
+ logger.exception("vibe_search: status query failed")
284
+ st = get_setting("index_status", None)
285
+ msg = f"{n_vec:,} of {n_songs:,} analysed songs have a vibe vector."
286
+ if st and not st.get("finished"):
287
+ msg += f" Indexing: {st['done']:,} of {st['total']:,} done" + (f", {st['failed']} failed" if st["failed"] else "") + "."
288
+ err = "".join(f'<p class="err">The {k} model is not available: {html.escape(v)}</p>' for k, v in _model_errors.items())
289
+ notes = "".join(f'<p class="note">{html.escape(v)}</p>' for v in _model_notes.values())
290
+ return f'<p class="note">{msg}</p>{notes}{err}'
291
+
292
+
293
+ def results_html(rows, heading, playlist_name):
294
+ if not rows:
295
+ return "<p>No songs with a vibe vector yet. Analyse your library, or use Index my library below.</p>"
296
+ info = {r["item_id"]: r for r in (get_score_data_by_ids([i for i, _ in rows]) or [])}
297
+ trs = []
298
+ for item_id, score in rows:
299
+ r = info.get(item_id, {})
300
+ trs.append(
301
+ f'<tr><td><input type="checkbox" name="ids" value="{html.escape(item_id)}" checked></td>'
302
+ f'<td>{html.escape(str(r.get("title") or item_id))}</td><td>{html.escape(str(r.get("author") or ""))}</td>'
303
+ f'<td>{html.escape(str(r.get("album") or ""))}</td><td class="score">{score:.3f}</td>'
304
+ f'<td><a href="{url_for("vibe_search.similar", item_id=item_id)}">same vibe</a></td></tr>')
305
+ return (f"<h3>{html.escape(heading)}</h3>"
306
+ f'<form method="post" action="{url_for("vibe_search.playlist")}">'
307
+ f"<table><tr><th></th><th>Title</th><th>Artist</th><th>Album</th><th>Match</th><th></th></tr>{''.join(trs)}</table>"
308
+ f'<p><input type="text" name="name" value="{html.escape(playlist_name)}" aria-label="Playlist name"> '
309
+ f'<button type="submit">Save ticked songs as a playlist</button></p></form>')
310
+
311
+
312
+ def search_form(q=""):
313
+ return (f'<form class="search" method="get" action="{url_for("vibe_search.home")}">'
314
+ f'<input type="text" name="q" value="{html.escape(q)}" placeholder="late night drive, rainy Sunday, upbeat but melancholic..." '
315
+ f'aria-label="Describe the music"><button type="submit">Search</button></form>')
316
+
317
+
318
+ @bp.route("/")
319
+ def home():
320
+ q = (request.args.get("q") or "").strip()
321
+ body = "<h2>Vibe Search</h2>" + search_form(q) + status_html()
322
+ if q:
323
+ m = get_model("text")
324
+ if m is None:
325
+ body += '<p class="err">The search model could not be loaded; see the message above.</p>'
326
+ else:
327
+ tag = current_tag() or m.tag
328
+ rows = top_k(m.embed_texts([q])[0], tag, int(setting("result_limit")))
329
+ body += results_html(rows, f"Songs that match “{q}”", f"Vibe: {q[:60]}")
330
+ body += (f'<form method="post" action="{url_for("vibe_search.index")}"><button type="submit">Index my library</button> '
331
+ '<span class="note">Gives a vibe vector to analysed songs that do not have one yet (runs in the background).</span></form>')
332
+ return page(body)
333
+
334
+
335
+ @bp.route("/similar/<path:item_id>")
336
+ def similar(item_id):
337
+ tag = current_tag()
338
+ ids, mat = song_matrix(tag) if tag else ([], None)
339
+ body = "<h2>Vibe Search</h2>" + search_form() + status_html()
340
+ if item_id not in ids:
341
+ body += "<p>This song has no vibe vector yet.</p>"
342
+ else:
343
+ seed = mat[ids.index(item_id)].astype(np.float32)
344
+ r = (get_score_data_by_ids([item_id]) or [{}])[0]
345
+ name = f'{r.get("title") or item_id}' + (f' by {r.get("author")}' if r.get("author") else "")
346
+ body += results_html(top_k(seed, tag, int(setting("result_limit")), exclude=item_id),
347
+ f"Same vibe as {name}", f"Same vibe: {name[:60]}")
348
+ return page(body)
349
+
350
+
351
+ @bp.route("/playlist", methods=["POST"])
352
+ def playlist():
353
+ ids = request.form.getlist("ids")
354
+ name = (request.form.get("name") or "Vibe Search").strip()[:120]
355
+ if not ids:
356
+ return page("<h2>Vibe Search</h2><p>No songs were ticked.</p>" + search_form())
357
+ try:
358
+ from tasks.mediaserver import create_or_replace_playlist
359
+ create_or_replace_playlist(name, ids)
360
+ msg = f"<p>Saved {len(ids)} songs as the playlist “{html.escape(name)}” on your media server.</p>"
361
+ except Exception as e:
362
+ logger.exception("vibe_search: playlist creation failed")
363
+ msg = f'<p class="err">The playlist could not be created: {html.escape(str(e))}</p>'
364
+ return page("<h2>Vibe Search</h2>" + msg + search_form())
365
+
366
+
367
+ @bp.route("/index", methods=["POST"])
368
+ def index():
369
+ try:
370
+ enqueue(index_library)
371
+ msg = "<p>Indexing started in the background. This page shows the progress.</p>"
372
+ except Exception as e:
373
+ msg = f'<p class="err">Indexing could not start now: {html.escape(str(e))}</p>'
374
+ return page("<h2>Vibe Search</h2>" + msg + search_form() + status_html())
375
+
376
+
377
+ @bp.route("/settings", methods=["GET", "POST"])
378
+ def settings():
379
+ if request.method == "POST":
380
+ for k, v in DEFAULTS.items():
381
+ if k not in request.form and not isinstance(v, bool):
382
+ continue
383
+ raw = request.form.get(k)
384
+ val = (raw == "on") if isinstance(v, bool) else (int(raw) if isinstance(v, int) else raw.strip())
385
+ set_setting(k, val)
386
+ _models.clear(); _model_errors.clear(); _model_notes.clear(); _matrix_cache.clear()
387
+ return redirect(manage_plugins_url())
388
+ rows = []
389
+ for k, v in DEFAULTS.items():
390
+ cur = setting(k)
391
+ if isinstance(v, bool):
392
+ field = f'<input type="checkbox" name="{k}" id="{k}"{" checked" if cur else ""}>'
393
+ else:
394
+ field = f'<input type="text" name="{k}" id="{k}" value="{html.escape(str(cur))}">'
395
+ rows.append(f'<tr><td><label for="{k}">{k}</label></td><td>{field}</td></tr>')
396
+ note = ("<p class=\"note\">precision: int8 (smaller, faster) or fp32. With int8, a model that cannot run on this "
397
+ "installation (for example the 8-bit search model on onnxruntime older than 1.28) falls back to fp32 by itself. "
398
+ "Changing the model repository or revision makes stored vectors outdated: run "
399
+ "Index my library afterwards. Models are stored in " + html.escape(model_dir()) + ".</p>")
400
+ return page(f'<h2>Vibe Search settings</h2><form method="post"><table>{"".join(rows)}</table>'
401
+ f'<button type="submit">Save</button></form>{note}', title="Vibe Search settings")
402
+
403
+
404
+ def register(ctx):
405
+ ctx.on_install(migrate)
406
+ ctx.add_blueprint(bp)
407
+ ctx.add_menu_item("Vibe Search", "vibe_search.home")
408
+ ctx.on_song_analyzed(on_song_analyzed)
409
+ ctx.add_task("index_library", index_library)
plugin/plugins/VibeSearch/plugin.json ADDED
@@ -0,0 +1,17 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {
2
+ "id": "vibe_search",
3
+ "name": "Vibe Search",
4
+ "author": "Divieleisch19",
5
+ "description": "Search your library by how music sounds and feels (\"rainy Sunday coffee shop\", \"upbeat but melancholic, no vocals\"), find songs with the same vibe, and save the results as playlists. Uses a small open (Apache-2.0) music-text model that runs on a CPU.",
6
+ "requirements": [],
7
+ "versions": [
8
+ {
9
+ "version": "0.1.0",
10
+ "min_core_version": "3.7.1",
11
+ "changelog": "First release (model v1.2): vibe vectors for analysed songs, text and same-vibe search, playlists, library indexing. One audio model (mn20_as); automatic full-precision fallback on onnxruntime older than 1.28.",
12
+ "imageUrl": "",
13
+ "sourceUrl": "https://huggingface.co/Divi19/vibe-embed/resolve/main/plugin/dist/vibe_search/vibe_search_0.1.0.zip",
14
+ "checksum": "df93e118aaae01a05f1be6aff59581b2"
15
+ }
16
+ ]
17
+ }
plugin/plugins/VibeSearch/vibemodel.py ADDED
@@ -0,0 +1,190 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ """Runtime for the vibe models: ONNX audio and text encoders, with the exact preprocessing they were trained with.
2
+
3
+ This module has no AudioMuse-AI imports, so it can be used and tested on its own.
4
+
5
+ Audio: 32 kHz mono float32. A song is split into non-overlapping 10 s windows (a shorter last window is kept if it
6
+ is at least 2 s long), each window is embedded, the window vectors are L2-normalised and averaged, and the average is
7
+ L2-normalised again. Text: the prompt from config.json is put in front of the query, the result is tokenised (left
8
+ padding, at most 256 tokens) and embedded. Both give 512 numbers in the same space, so cosine similarity compares a
9
+ search with a song, or a song with a song.
10
+ """
11
+ import hashlib
12
+ import json
13
+ import os
14
+ import threading
15
+
16
+ import numpy as np
17
+
18
+ SR = 32000
19
+ WIN = 10 * SR
20
+ MIN_LAST = 2 * SR
21
+ MAX_TOKENS = 256
22
+
23
+ AUDIO_FILE = {"int8": "audio_encoder_int8.onnx", "fp32": "audio_encoder.onnx"}
24
+ TEXT_FILE = {"int8": "text/text_encoder_int8.onnx", "fp32": "text/text_encoder.onnx"}
25
+ TOKENIZER_FILES = ["text/tokenizer/tokenizer.json", "text/tokenizer/tokenizer_config.json"]
26
+ COMMON_FILES = ["config.json", "parity.json"]
27
+ PARITY_MIN = {"fp32": 0.995, "int8": 0.98}
28
+
29
+
30
+ def l2n(x):
31
+ x = np.asarray(x, dtype=np.float32)
32
+ return x / np.maximum(np.linalg.norm(x, axis=-1, keepdims=True), 1e-12)
33
+
34
+
35
+ def split_windows(wave):
36
+ """Non-overlapping 10 s windows; a shorter last window is kept if it is at least 2 s (or if it is the only one)."""
37
+ n = len(wave)
38
+ out = []
39
+ for a in range(0, max(n, 1), WIN):
40
+ b = min(a + WIN, n)
41
+ if b - a >= MIN_LAST or a == 0:
42
+ out.append(wave[a:b])
43
+ return [w for w in out if len(w) > 0]
44
+
45
+
46
+ def files_needed(student, precision, kinds):
47
+ need = list(COMMON_FILES)
48
+ if "audio" in kinds:
49
+ need.append(f"{student}/{AUDIO_FILE[precision]}")
50
+ if "text" in kinds:
51
+ need += [TEXT_FILE[precision]] + TOKENIZER_FILES
52
+ return need
53
+
54
+
55
+ def download_files(model_dir, base_url, repo, revision, rel_paths, log=None, timeout=(10, 120)):
56
+ """Fetch missing files from a Hugging Face style repository (<base>/<repo>/resolve/<revision>/<path>).
57
+ A large ONNX model may come with a companion .onnx.data file; it is fetched when the repository has one."""
58
+ import requests
59
+ base = f"{base_url.rstrip('/')}/{repo}/resolve/{revision}/"
60
+ wanted = []
61
+ for rel in rel_paths:
62
+ wanted.append((rel, False))
63
+ if rel.endswith(".onnx"):
64
+ wanted.append((rel + ".data", True))
65
+ for rel, optional in wanted:
66
+ dst = os.path.join(model_dir, rel)
67
+ if os.path.exists(dst):
68
+ continue
69
+ os.makedirs(os.path.dirname(dst), exist_ok=True)
70
+ with requests.get(base + rel, stream=True, timeout=timeout) as r:
71
+ if optional and r.status_code == 404:
72
+ continue
73
+ r.raise_for_status()
74
+ with open(dst + ".part", "wb") as f:
75
+ for chunk in r.iter_content(1 << 22):
76
+ f.write(chunk)
77
+ os.replace(dst + ".part", dst)
78
+ if log:
79
+ log(f"vibe_search: downloaded {rel}")
80
+
81
+
82
+ class VibeModel:
83
+ """Loads one side (audio or text) of the vibe model and checks it against the reference values in parity.json."""
84
+
85
+ def __init__(self, model_dir, student="mn20_as", precision="int8", threads=4):
86
+ self.model_dir, self.student, self.precision = model_dir, student, precision
87
+ self.threads = max(1, int(threads))
88
+ self.config = json.load(open(os.path.join(model_dir, "config.json")))
89
+ self.parity = json.load(open(os.path.join(model_dir, "parity.json")))
90
+ self.prompt = self.config["text"]["prompt"]
91
+ self.audio = self.text = self.tok = None
92
+ self._lock = threading.Lock()
93
+
94
+ @property
95
+ def tag(self):
96
+ """Identifies the model version the stored song vectors belong to (int8 and fp32 give the same vectors)."""
97
+ h = hashlib.md5(json.dumps(self.config, sort_keys=True).encode()).hexdigest()[:12]
98
+ return f"{self.student}:{h}"
99
+
100
+ def _session(self, rel):
101
+ import onnxruntime as ort
102
+ so = ort.SessionOptions()
103
+ so.intra_op_num_threads = self.threads
104
+ so.inter_op_num_threads = 1
105
+ return ort.InferenceSession(os.path.join(self.model_dir, rel), so, providers=["CPUExecutionProvider"])
106
+
107
+ # ---------- audio ----------
108
+ def load_audio(self):
109
+ self.audio = self._session(f"{self.student}/{AUDIO_FILE[self.precision]}")
110
+ self.audio_input = self.audio.get_inputs()[0].name
111
+ ref = np.asarray(self.parity["audio"][self.student], np.float32)
112
+ t = np.arange(WIN, dtype=np.float64) / SR
113
+ wave = (0.1 * np.sin(2 * np.pi * (220.0 * t + 50.0 * t ** 2))).astype(np.float32)
114
+ cos = float((self._run_audio(wave[None])[0] * l2n(ref)).sum())
115
+ if cos < PARITY_MIN[self.precision]:
116
+ raise RuntimeError(f"audio model check failed: cosine {cos:.4f} to the reference (expected >= {PARITY_MIN[self.precision]})")
117
+ return cos
118
+
119
+ def _run_audio(self, batch):
120
+ with self._lock:
121
+ return l2n(self.audio.run(None, {self.audio_input: np.ascontiguousarray(batch, dtype=np.float32)})[0])
122
+
123
+ def embed_audio(self, wave, batch=8):
124
+ """wave: 32 kHz mono float32. Returns (512-number song vector, number of windows)."""
125
+ wins = split_windows(np.asarray(wave, np.float32))
126
+ if not wins:
127
+ raise ValueError("empty audio")
128
+ full = [w for w in wins if len(w) == WIN]
129
+ rest = [w for w in wins if len(w) != WIN]
130
+ vecs = [self._run_audio(np.stack(full[i:i + batch])) for i in range(0, len(full), batch)]
131
+ vecs += [self._run_audio(w[None]) for w in rest]
132
+ return l2n(np.concatenate(vecs).mean(0)), len(wins)
133
+
134
+ # ---------- text ----------
135
+ def _load_tokenizer(self, expected):
136
+ """The tokenizers library first; transformers as a fallback. Either must reproduce the reference token ids."""
137
+ tdir = os.path.join(self.model_dir, "text", "tokenizer")
138
+ errors = []
139
+ try:
140
+ from tokenizers import Tokenizer
141
+ tok = Tokenizer.from_file(os.path.join(tdir, "tokenizer.json"))
142
+ cfg = json.load(open(os.path.join(tdir, "tokenizer_config.json")))
143
+ pad = cfg.get("pad_token")
144
+ pad = pad.get("content") if isinstance(pad, dict) else pad
145
+ pad_id = tok.token_to_id(pad) if pad else None
146
+ if pad_id is None:
147
+ pad_id = tok.token_to_id("<|endoftext|>") or 0
148
+ pad = tok.id_to_token(pad_id)
149
+ tok.enable_truncation(MAX_TOKENS)
150
+ tok.enable_padding(direction="left", pad_id=pad_id, pad_token=pad)
151
+ def enc_tok(texts):
152
+ e = tok.encode_batch([self.prompt + t for t in texts])
153
+ return np.array([x.ids for x in e], np.int64), np.array([x.attention_mask for x in e], np.int64)
154
+ if all(ids is None or list(enc_tok([q])[0][0]) == ids for q, ids in expected):
155
+ return enc_tok, "tokenizers"
156
+ errors.append("tokenizers: token ids differ from the reference")
157
+ except Exception as e:
158
+ errors.append(f"tokenizers: {e}")
159
+ try:
160
+ from transformers import AutoTokenizer
161
+ hf = AutoTokenizer.from_pretrained(tdir, padding_side="left", local_files_only=True)
162
+ def enc_hf(texts):
163
+ e = hf([self.prompt + t for t in texts], padding=True, truncation=True, max_length=MAX_TOKENS, return_tensors="np")
164
+ return e["input_ids"].astype(np.int64), e["attention_mask"].astype(np.int64)
165
+ if all(ids is None or list(enc_hf([q])[0][0]) == ids for q, ids in expected):
166
+ return enc_hf, "transformers"
167
+ errors.append("transformers: token ids differ from the reference")
168
+ except Exception as e:
169
+ errors.append(f"transformers: {e}")
170
+ raise RuntimeError("could not reproduce the model's tokenisation: " + "; ".join(errors))
171
+
172
+ def load_text(self):
173
+ # token ids are compared when parity.json has them; the vectors below are always compared
174
+ expected = [(t["query"], t.get("input_ids")) for t in self.parity["texts"]]
175
+ self.tok, self.tokenizer_backend = self._load_tokenizer(expected)
176
+ self.text = self._session(TEXT_FILE[self.precision])
177
+ got = self.embed_texts([q for q, _ in expected])
178
+ ref = l2n(np.asarray([t["vector"] for t in self.parity["texts"]], np.float32))
179
+ cos = float((got * ref).sum(1).min())
180
+ if cos < PARITY_MIN[self.precision]:
181
+ raise RuntimeError(f"text model check failed: cosine {cos:.4f} to the reference (expected >= {PARITY_MIN[self.precision]})")
182
+ return cos
183
+
184
+ def embed_texts(self, texts, batch=16):
185
+ out = []
186
+ for i in range(0, len(texts), batch):
187
+ ids, mask = self.tok(texts[i:i + batch])
188
+ with self._lock:
189
+ out.append(self.text.run(None, {"input_ids": ids, "attention_mask": mask})[0])
190
+ return l2n(np.concatenate(out))
results/languages.md ADDED
@@ -0,0 +1,8 @@
 
 
 
 
 
 
 
 
 
1
+ | language | 2b dev | chosen dev | 2b test | chosen test |
2
+ |:---------------------|---------:|-------------:|----------:|--------------:|
3
+ | English | 0.7105 | 0.7122 | 0.7368 | 0.7289 |
4
+ | Spanish | 0.6219 | 0.6817 | 0.6252 | 0.6958 |
5
+ | German | 0.6164 | 0.679 | 0.5986 | 0.6806 |
6
+ | French | 0.6365 | 0.6802 | 0.6355 | 0.6792 |
7
+ | Brazilian Portuguese | 0.5764 | 0.6904 | 0.5857 | 0.6907 |
8
+ | Japanese | 0.5551 | 0.6669 | 0.6049 | 0.6842 |
results/speed.md ADDED
@@ -0,0 +1,4 @@
 
 
 
 
 
1
+ | threads | ours int8 (s/song) | ours fp32 (s/song) | DCLAP (s/song) | DCLAP / ours int8 |
2
+ |----------:|---------------------:|---------------------:|-----------------:|--------------------:|
3
+ | 4 | 0.902 | 0.903 | 4.243 | 4.7 |
4
+ | 1 | 1.897 | 1.909 | 2.677 | 1.41 |
results/summary.json ADDED
@@ -0,0 +1,472 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {
2
+ "step14": {
3
+ "notebook": "14_step4_v12",
4
+ "gpu": "NVIDIA RTX PRO 6000 Blackwell Server Edition",
5
+ "time_utc": "2026-11-14T18:26:34+00:00",
6
+ "student": "C · trained on the teacher's song vectors only (epoch 3)",
7
+ "clips": {
8
+ "train": 68404,
9
+ "validation": 2901,
10
+ "vibebench_pool": 1831,
11
+ "shards": 78
12
+ },
13
+ "translations": {
14
+ "es used": 38204,
15
+ "es unchanged": 38,
16
+ "es failed": 1758,
17
+ "de used": 37036,
18
+ "de unchanged": 426,
19
+ "de failed": 2538,
20
+ "fr used": 37928,
21
+ "fr unchanged": 103,
22
+ "fr failed": 1969,
23
+ "pt used": 38331,
24
+ "pt unchanged": 27,
25
+ "pt failed": 1642,
26
+ "ja used": 36715,
27
+ "ja unchanged": 201,
28
+ "ja failed": 3084
29
+ },
30
+ "search_2b": {
31
+ "english": {
32
+ "incompe_dev_lenient": 0.7105,
33
+ "incompe_test_lenient": 0.7368,
34
+ "incompe_full_lenient": 0.7235,
35
+ "sdd_dev_R@10": 50.2752,
36
+ "sdd_test_R@10": 44.385,
37
+ "sdd_full_R@10": 47.2875
38
+ },
39
+ "languages_dev": 0.6013
40
+ },
41
+ "training": {
42
+ "steps": 2143,
43
+ "minutes": 21.8,
44
+ "final_loss": 0.1463,
45
+ "checks": [
46
+ {
47
+ "check": 1,
48
+ "step": 357,
49
+ "english_incompe_dev": 0.7069,
50
+ "english_sdd_dev_R@10": 50.5,
51
+ "languages_incompe_dev": 0.6693,
52
+ "select": 1.8808
53
+ },
54
+ {
55
+ "check": 2,
56
+ "step": 714,
57
+ "english_incompe_dev": 0.7085,
58
+ "english_sdd_dev_R@10": 49.9,
59
+ "languages_incompe_dev": 0.6738,
60
+ "select": 1.8814
61
+ },
62
+ {
63
+ "check": 3,
64
+ "step": 1072,
65
+ "english_incompe_dev": 0.7056,
66
+ "english_sdd_dev_R@10": 50.1,
67
+ "languages_incompe_dev": 0.6737,
68
+ "select": 1.8802
69
+ },
70
+ {
71
+ "check": 4,
72
+ "step": 1429,
73
+ "english_incompe_dev": 0.7139,
74
+ "english_sdd_dev_R@10": 49.7,
75
+ "languages_incompe_dev": 0.6785,
76
+ "select": 1.8896
77
+ },
78
+ {
79
+ "check": 5,
80
+ "step": 1786,
81
+ "english_incompe_dev": 0.7116,
82
+ "english_sdd_dev_R@10": 49.9,
83
+ "languages_incompe_dev": 0.6801,
84
+ "select": 1.8908
85
+ },
86
+ {
87
+ "check": 6,
88
+ "step": 2143,
89
+ "english_incompe_dev": 0.7122,
90
+ "english_sdd_dev_R@10": 50.1,
91
+ "languages_incompe_dev": 0.6796,
92
+ "select": 1.8927
93
+ }
94
+ ]
95
+ },
96
+ "language_rule": {
97
+ "english_incompe_dev": 0.0017,
98
+ "english_sdd_dev_R@10": -0.18,
99
+ "languages_incompe_dev": 0.0784,
100
+ "adopted": true,
101
+ "chosen": "trained with translations (check 6)"
102
+ },
103
+ "languages_board": [
104
+ {
105
+ "language": "English",
106
+ "2b dev": 0.7105,
107
+ "chosen dev": 0.7122,
108
+ "2b test": 0.7368,
109
+ "chosen test": 0.7289
110
+ },
111
+ {
112
+ "language": "Spanish",
113
+ "2b dev": 0.6219,
114
+ "chosen dev": 0.6817,
115
+ "2b test": 0.6252,
116
+ "chosen test": 0.6958
117
+ },
118
+ {
119
+ "language": "German",
120
+ "2b dev": 0.6164,
121
+ "chosen dev": 0.679,
122
+ "2b test": 0.5986,
123
+ "chosen test": 0.6806
124
+ },
125
+ {
126
+ "language": "French",
127
+ "2b dev": 0.6365,
128
+ "chosen dev": 0.6802,
129
+ "2b test": 0.6355,
130
+ "chosen test": 0.6792
131
+ },
132
+ {
133
+ "language": "Brazilian Portuguese",
134
+ "2b dev": 0.5764,
135
+ "chosen dev": 0.6904,
136
+ "2b test": 0.5857,
137
+ "chosen test": 0.6907
138
+ },
139
+ {
140
+ "language": "Japanese",
141
+ "2b dev": 0.5551,
142
+ "chosen dev": 0.6669,
143
+ "2b test": 0.6049,
144
+ "chosen test": 0.6842
145
+ }
146
+ ],
147
+ "search_chosen": {
148
+ "english": {
149
+ "incompe_dev_lenient": 0.7122,
150
+ "incompe_test_lenient": 0.7289,
151
+ "incompe_full_lenient": 0.7204,
152
+ "sdd_dev_R@10": 50.0917,
153
+ "sdd_test_R@10": 44.2068,
154
+ "sdd_full_R@10": 47.1067
155
+ }
156
+ },
157
+ "export_checks": {
158
+ "audio_fp32_min_cos": 1.0,
159
+ "audio_int8_min_cos": 0.99979,
160
+ "text_onnx_vs_pytorch_min_cos": 1.0,
161
+ "text_fp32": {
162
+ "cos_mean": 1.0,
163
+ "cos_min": 1.0,
164
+ "plugin_parity_min": 1.0,
165
+ "incompe_full": 0.7199,
166
+ "ms_per_query_4thread": 71.1,
167
+ "MB": 2395.7
168
+ },
169
+ "text_int8": {
170
+ "cos_mean": 0.99976,
171
+ "cos_min": 0.99919,
172
+ "plugin_parity_min": 0.99979,
173
+ "incompe_full": 0.7187,
174
+ "ms_per_query_4thread": 55.8,
175
+ "MB": 818.5
176
+ },
177
+ "incompe_full_pytorch": 0.7204,
178
+ "incompe_full_all_int8": 0.7184,
179
+ "incompe_test_all_int8": 0.7276,
180
+ "sdd_full_R@10_int8_text": 47.1,
181
+ "ok": true
182
+ },
183
+ "cpu_speed_this_machine": {
184
+ "audio_encoder": {
185
+ "ms_per_10s_1thread": 43.4,
186
+ "ms_per_10s_4thread": 26.2,
187
+ "MB": 72.1
188
+ },
189
+ "audio_encoder_int8": {
190
+ "ms_per_10s_1thread": 42.7,
191
+ "ms_per_10s_4thread": 25.6,
192
+ "MB": 35.3
193
+ },
194
+ "text_encoder_int8": {
195
+ "ms_per_query_4thread": 55.8,
196
+ "MB": 818.5
197
+ }
198
+ },
199
+ "installed": true,
200
+ "total_hours": 1.35
201
+ },
202
+ "step15": {
203
+ "notebook": "15_vibebench_v12",
204
+ "gpu": "NVIDIA RTX PRO 6000 Blackwell Server Edition",
205
+ "time_utc": "2026-11-14T20:39:02+00:00",
206
+ "installed_version": "v1.2",
207
+ "new_pairs": 7675,
208
+ "judge_minutes": 9.9,
209
+ "judge": {
210
+ "cuts": [
211
+ 0.9949183095027374,
212
+ 1.1303260818861856,
213
+ 2.9999961623507643
214
+ ],
215
+ "dev_kappa": 0.445,
216
+ "test_kappa": 0.47,
217
+ "kappa_as_answered": 0.384
218
+ },
219
+ "main_system": "v1.2 student + v1.2 search side (ships)",
220
+ "requests_scored_rescaled": 500,
221
+ "scoreboard_rescaled": {
222
+ "teacher, its own 7B search side": {
223
+ "nDCG@10 all": 0.8031,
224
+ "nDCG@10 test": 0.7922,
225
+ "nDCG@10 dev": 0.8382,
226
+ "judged@10": 1.0
227
+ },
228
+ "combined teacher, its own 7B search side": {
229
+ "nDCG@10 all": 0.7939,
230
+ "nDCG@10 test": 0.7866,
231
+ "nDCG@10 dev": 0.8176,
232
+ "judged@10": 1.0
233
+ },
234
+ "combined teacher, the v1.2 search side": {
235
+ "nDCG@10 all": 0.7644,
236
+ "nDCG@10 test": 0.7537,
237
+ "nDCG@10 dev": 0.7991,
238
+ "judged@10": 1.0
239
+ },
240
+ "teacher, the student's search side (Qwen3)": {
241
+ "nDCG@10 all": 0.7536,
242
+ "nDCG@10 test": 0.7397,
243
+ "nDCG@10 dev": 0.7983,
244
+ "judged@10": 1.0
245
+ },
246
+ "LCO-Omni-7B as is": {
247
+ "nDCG@10 all": 0.7494,
248
+ "nDCG@10 test": 0.7415,
249
+ "nDCG@10 dev": 0.775,
250
+ "judged@10": 1.0
251
+ },
252
+ "v1.2 student + v1.2 search side (ships)": {
253
+ "nDCG@10 all": 0.7329,
254
+ "nDCG@10 test": 0.7191,
255
+ "nDCG@10 dev": 0.7775,
256
+ "judged@10": 1.0
257
+ },
258
+ "e5-omni-7B as is": {
259
+ "nDCG@10 all": 0.7309,
260
+ "nDCG@10 test": 0.7214,
261
+ "nDCG@10 dev": 0.7615,
262
+ "judged@10": 1.0
263
+ },
264
+ "v1 student + v1.1 search side": {
265
+ "nDCG@10 all": 0.718,
266
+ "nDCG@10 test": 0.708,
267
+ "nDCG@10 dev": 0.7507,
268
+ "judged@10": 1.0
269
+ },
270
+ "v1 student + v1 search side (07)": {
271
+ "nDCG@10 all": 0.6861,
272
+ "nDCG@10 test": 0.6769,
273
+ "nDCG@10 dev": 0.7159,
274
+ "judged@10": 1.0
275
+ },
276
+ "DCLAP (AudioMuse-AI)": {
277
+ "nDCG@10 all": 0.6371,
278
+ "nDCG@10 test": 0.6312,
279
+ "nDCG@10 dev": 0.6561,
280
+ "judged@10": 1.0
281
+ },
282
+ "LAION CLAP music+speech": {
283
+ "nDCG@10 all": 0.574,
284
+ "nDCG@10 test": 0.5683,
285
+ "nDCG@10 dev": 0.5923,
286
+ "judged@10": 1.0
287
+ },
288
+ "BM25 over the song cards": {
289
+ "nDCG@10 all": 0.5307,
290
+ "nDCG@10 test": 0.5245,
291
+ "nDCG@10 dev": 0.5508,
292
+ "judged@10": 1.0
293
+ }
294
+ },
295
+ "scoreboard_as_answered": {
296
+ "teacher, its own 7B search side": {
297
+ "nDCG@10 all": 0.8283,
298
+ "nDCG@10 test": 0.8238,
299
+ "nDCG@10 dev": 0.8427,
300
+ "judged@10": 1.0
301
+ },
302
+ "combined teacher, its own 7B search side": {
303
+ "nDCG@10 all": 0.8132,
304
+ "nDCG@10 test": 0.8115,
305
+ "nDCG@10 dev": 0.8186,
306
+ "judged@10": 1.0
307
+ },
308
+ "combined teacher, the v1.2 search side": {
309
+ "nDCG@10 all": 0.7847,
310
+ "nDCG@10 test": 0.782,
311
+ "nDCG@10 dev": 0.7936,
312
+ "judged@10": 1.0
313
+ },
314
+ "teacher, the student's search side (Qwen3)": {
315
+ "nDCG@10 all": 0.7773,
316
+ "nDCG@10 test": 0.771,
317
+ "nDCG@10 dev": 0.7977,
318
+ "judged@10": 1.0
319
+ },
320
+ "LCO-Omni-7B as is": {
321
+ "nDCG@10 all": 0.7635,
322
+ "nDCG@10 test": 0.7631,
323
+ "nDCG@10 dev": 0.7649,
324
+ "judged@10": 1.0
325
+ },
326
+ "v1.2 student + v1.2 search side (ships)": {
327
+ "nDCG@10 all": 0.7509,
328
+ "nDCG@10 test": 0.7449,
329
+ "nDCG@10 dev": 0.7705,
330
+ "judged@10": 1.0
331
+ },
332
+ "v1 student + v1.1 search side": {
333
+ "nDCG@10 all": 0.744,
334
+ "nDCG@10 test": 0.7391,
335
+ "nDCG@10 dev": 0.76,
336
+ "judged@10": 1.0
337
+ },
338
+ "e5-omni-7B as is": {
339
+ "nDCG@10 all": 0.7421,
340
+ "nDCG@10 test": 0.7383,
341
+ "nDCG@10 dev": 0.7545,
342
+ "judged@10": 1.0
343
+ },
344
+ "v1 student + v1 search side (07)": {
345
+ "nDCG@10 all": 0.7039,
346
+ "nDCG@10 test": 0.6994,
347
+ "nDCG@10 dev": 0.7184,
348
+ "judged@10": 1.0
349
+ },
350
+ "DCLAP (AudioMuse-AI)": {
351
+ "nDCG@10 all": 0.6513,
352
+ "nDCG@10 test": 0.6472,
353
+ "nDCG@10 dev": 0.6646,
354
+ "judged@10": 1.0
355
+ },
356
+ "LAION CLAP music+speech": {
357
+ "nDCG@10 all": 0.5857,
358
+ "nDCG@10 test": 0.5881,
359
+ "nDCG@10 dev": 0.5779,
360
+ "judged@10": 1.0
361
+ },
362
+ "BM25 over the song cards": {
363
+ "nDCG@10 all": 0.5496,
364
+ "nDCG@10 test": 0.5486,
365
+ "nDCG@10 dev": 0.5529,
366
+ "judged@10": 1.0
367
+ }
368
+ },
369
+ "deltas": [
370
+ {
371
+ "v1.2 student + v1.2 search side minus": "DCLAP (AudioMuse-AI)",
372
+ "rescaled, all [95% CI]": "+0.096 [+0.078, +0.115]",
373
+ "rescaled, test [95% CI]": "+0.088 [+0.067, +0.109]",
374
+ "as answered, all [95% CI]": "+0.100 [+0.083, +0.117]"
375
+ },
376
+ {
377
+ "v1.2 student + v1.2 search side minus": "LAION CLAP music+speech",
378
+ "rescaled, all [95% CI]": "+0.159 [+0.139, +0.179]",
379
+ "rescaled, test [95% CI]": "+0.151 [+0.128, +0.175]",
380
+ "as answered, all [95% CI]": "+0.165 [+0.147, +0.185]"
381
+ },
382
+ {
383
+ "v1.2 student + v1.2 search side minus": "v1 student + v1.1 search side",
384
+ "rescaled, all [95% CI]": "+0.015 [+0.004, +0.026]",
385
+ "rescaled, test [95% CI]": "+0.011 [-0.002, +0.025]",
386
+ "as answered, all [95% CI]": "+0.007 [-0.002, +0.016]"
387
+ },
388
+ {
389
+ "v1.2 student + v1.2 search side minus": "v1 student + v1 search side (07)",
390
+ "rescaled, all [95% CI]": "+0.047 [+0.033, +0.060]",
391
+ "rescaled, test [95% CI]": "+0.042 [+0.028, +0.057]",
392
+ "as answered, all [95% CI]": "+0.047 [+0.036, +0.059]"
393
+ },
394
+ {
395
+ "v1.2 student + v1.2 search side minus": "LCO-Omni-7B as is",
396
+ "rescaled, all [95% CI]": "-0.017 [-0.031, -0.002]",
397
+ "rescaled, test [95% CI]": "-0.022 [-0.040, -0.005]",
398
+ "as answered, all [95% CI]": "-0.013 [-0.026, +0.001]"
399
+ },
400
+ {
401
+ "v1.2 student + v1.2 search side minus": "combined teacher, its own 7B search side",
402
+ "rescaled, all [95% CI]": "-0.061 [-0.074, -0.048]",
403
+ "rescaled, test [95% CI]": "-0.068 [-0.084, -0.052]",
404
+ "as answered, all [95% CI]": "-0.062 [-0.074, -0.051]"
405
+ }
406
+ ],
407
+ "total_minutes": 48.8
408
+ },
409
+ "decision13b": {
410
+ "adopted": true,
411
+ "student": "mn20_as",
412
+ "chosen": "C · trained on the teacher's song vectors only (epoch 3)",
413
+ "teacher": "combined (teacher/combined)",
414
+ "search_side_for_selection": "student/text_v12_base",
415
+ "scores": {
416
+ "incompe_dev_lenient": 0.7105,
417
+ "incompe_test_lenient": 0.7368,
418
+ "incompe_full_lenient": 0.7235,
419
+ "sdd_dev_R@10": 50.2752,
420
+ "sdd_test_R@10": 44.385,
421
+ "sdd_full_R@10": 47.2875
422
+ }
423
+ },
424
+ "release": {
425
+ "plugin_checks": {
426
+ "int8": {
427
+ "audio_cos": 0.99982,
428
+ "text_cos_min": 0.99976,
429
+ "tokenizer": "tokenizers"
430
+ },
431
+ "fp32": {
432
+ "audio_cos": 1.0,
433
+ "text_cos_min": 1.0,
434
+ "tokenizer": "tokenizers"
435
+ }
436
+ },
437
+ "sizes": {
438
+ "audio_int8_MB": 35.3,
439
+ "audio_fp32_MB": 72.1,
440
+ "text_int8_MB": 818.5,
441
+ "text_fp32_MB": 2395.7
442
+ },
443
+ "catalogue": {
444
+ "songs": 1831,
445
+ "left_out_licence": 0,
446
+ "left_out_unreadable": 0,
447
+ "cos_to_pytorch_mean": 0.9998,
448
+ "cos_to_pytorch_min": 0.9925,
449
+ "minutes": 6.4
450
+ },
451
+ "speed": {
452
+ "song_seconds": 180.0,
453
+ "board": [
454
+ {
455
+ "threads": 4,
456
+ "ours int8 (s/song)": 0.902,
457
+ "ours fp32 (s/song)": 0.903,
458
+ "DCLAP (s/song)": 4.243,
459
+ "DCLAP / ours int8": 4.7
460
+ },
461
+ {
462
+ "threads": 1,
463
+ "ours int8 (s/song)": 1.897,
464
+ "ours fp32 (s/song)": 1.909,
465
+ "DCLAP (s/song)": 2.677,
466
+ "DCLAP / ours int8": 1.41
467
+ }
468
+ ],
469
+ "gate_passed": true
470
+ }
471
+ }
472
+ }
results/vibebench.md ADDED
@@ -0,0 +1,42 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ Rescaled grades (prompt-1 cut-points)
2
+
3
+ | system | nDCG@10 all | nDCG@10 test | nDCG@10 dev | judged@10 |
4
+ |:-------------------------------------------|--------------:|---------------:|--------------:|------------:|
5
+ | teacher, its own 7B search side | 0.8031 | 0.7922 | 0.8382 | 1 |
6
+ | combined teacher, its own 7B search side | 0.7939 | 0.7866 | 0.8176 | 1 |
7
+ | combined teacher, the v1.2 search side | 0.7644 | 0.7537 | 0.7991 | 1 |
8
+ | teacher, the student's search side (Qwen3) | 0.7536 | 0.7397 | 0.7983 | 1 |
9
+ | LCO-Omni-7B as is | 0.7494 | 0.7415 | 0.775 | 1 |
10
+ | v1.2 student + v1.2 search side (ships) | 0.7329 | 0.7191 | 0.7775 | 1 |
11
+ | e5-omni-7B as is | 0.7309 | 0.7214 | 0.7615 | 1 |
12
+ | v1 student + v1.1 search side | 0.718 | 0.708 | 0.7507 | 1 |
13
+ | v1 student + v1 search side (07) | 0.6861 | 0.6769 | 0.7159 | 1 |
14
+ | DCLAP (AudioMuse-AI) | 0.6371 | 0.6312 | 0.6561 | 1 |
15
+ | LAION CLAP music+speech | 0.574 | 0.5683 | 0.5923 | 1 |
16
+ | BM25 over the song cards | 0.5307 | 0.5245 | 0.5508 | 1 |
17
+
18
+ As answered
19
+
20
+ | system | nDCG@10 all | nDCG@10 test | nDCG@10 dev | judged@10 |
21
+ |:-------------------------------------------|--------------:|---------------:|--------------:|------------:|
22
+ | teacher, its own 7B search side | 0.8283 | 0.8238 | 0.8427 | 1 |
23
+ | combined teacher, its own 7B search side | 0.8132 | 0.8115 | 0.8186 | 1 |
24
+ | combined teacher, the v1.2 search side | 0.7847 | 0.782 | 0.7936 | 1 |
25
+ | teacher, the student's search side (Qwen3) | 0.7773 | 0.771 | 0.7977 | 1 |
26
+ | LCO-Omni-7B as is | 0.7635 | 0.7631 | 0.7649 | 1 |
27
+ | v1.2 student + v1.2 search side (ships) | 0.7509 | 0.7449 | 0.7705 | 1 |
28
+ | v1 student + v1.1 search side | 0.744 | 0.7391 | 0.76 | 1 |
29
+ | e5-omni-7B as is | 0.7421 | 0.7383 | 0.7545 | 1 |
30
+ | v1 student + v1 search side (07) | 0.7039 | 0.6994 | 0.7184 | 1 |
31
+ | DCLAP (AudioMuse-AI) | 0.6513 | 0.6472 | 0.6646 | 1 |
32
+ | LAION CLAP music+speech | 0.5857 | 0.5881 | 0.5779 | 1 |
33
+ | BM25 over the song cards | 0.5496 | 0.5486 | 0.5529 | 1 |
34
+
35
+ | v1.2 student + v1.2 search side minus | rescaled, all [95% CI] | rescaled, test [95% CI] | as answered, all [95% CI] |
36
+ |:-----------------------------------------|:-------------------------|:--------------------------|:----------------------------|
37
+ | DCLAP (AudioMuse-AI) | +0.096 [+0.078, +0.115] | +0.088 [+0.067, +0.109] | +0.100 [+0.083, +0.117] |
38
+ | LAION CLAP music+speech | +0.159 [+0.139, +0.179] | +0.151 [+0.128, +0.175] | +0.165 [+0.147, +0.185] |
39
+ | v1 student + v1.1 search side | +0.015 [+0.004, +0.026] | +0.011 [-0.002, +0.025] | +0.007 [-0.002, +0.016] |
40
+ | v1 student + v1 search side (07) | +0.047 [+0.033, +0.060] | +0.042 [+0.028, +0.057] | +0.047 [+0.036, +0.059] |
41
+ | LCO-Omni-7B as is | -0.017 [-0.031, -0.002] | -0.022 [-0.040, -0.005] | -0.013 [-0.026, +0.001] |
42
+ | combined teacher, its own 7B search side | -0.061 [-0.074, -0.048] | -0.068 [-0.084, -0.052] | -0.062 [-0.074, -0.051] |
text/text_encoder.onnx ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:84f56fac66ba9e3d66488512c7c5c39c36ef6fce6886895c319e7b2fb312c032
3
+ size 4238566
text/text_encoder.onnx.data ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:458c466faf31c0d60f1cd642c840f102874d83b07814f53e5ed7ba1d3bd58b1b
3
+ size 2391511040
text/text_encoder_int8.onnx ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:db2004b55ccd51f2ad3a8a18b997ef41611943480b026e73a5f6d8f44051183e
3
+ size 3801928
text/text_encoder_int8.onnx.data ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:2b1eb67d7d49bd7fabcd01fb6f84bc53f9222af3ed17e5ff41f258fdcb14c04b
3
+ size 814708736
text/tokenizer/chat_template.jinja ADDED
@@ -0,0 +1,85 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {%- if tools %}
2
+ {{- '<|im_start|>system\n' }}
3
+ {%- if messages[0].role == 'system' %}
4
+ {{- messages[0].content + '\n\n' }}
5
+ {%- endif %}
6
+ {{- "# Tools\n\nYou may call one or more functions to assist with the user query.\n\nYou are provided with function signatures within <tools></tools> XML tags:\n<tools>" }}
7
+ {%- for tool in tools %}
8
+ {{- "\n" }}
9
+ {{- tool | tojson }}
10
+ {%- endfor %}
11
+ {{- "\n</tools>\n\nFor each function call, return a json object with function name and arguments within <tool_call></tool_call> XML tags:\n<tool_call>\n{\"name\": <function-name>, \"arguments\": <args-json-object>}\n</tool_call><|im_end|>\n" }}
12
+ {%- else %}
13
+ {%- if messages[0].role == 'system' %}
14
+ {{- '<|im_start|>system\n' + messages[0].content + '<|im_end|>\n' }}
15
+ {%- endif %}
16
+ {%- endif %}
17
+ {%- set ns = namespace(multi_step_tool=true, last_query_index=messages|length - 1) %}
18
+ {%- for message in messages[::-1] %}
19
+ {%- set index = (messages|length - 1) - loop.index0 %}
20
+ {%- if ns.multi_step_tool and message.role == "user" and not(message.content.startswith('<tool_response>') and message.content.endswith('</tool_response>')) %}
21
+ {%- set ns.multi_step_tool = false %}
22
+ {%- set ns.last_query_index = index %}
23
+ {%- endif %}
24
+ {%- endfor %}
25
+ {%- for message in messages %}
26
+ {%- if (message.role == "user") or (message.role == "system" and not loop.first) %}
27
+ {{- '<|im_start|>' + message.role + '\n' + message.content + '<|im_end|>' + '\n' }}
28
+ {%- elif message.role == "assistant" %}
29
+ {%- set content = message.content %}
30
+ {%- set reasoning_content = '' %}
31
+ {%- if message.reasoning_content is defined and message.reasoning_content is not none %}
32
+ {%- set reasoning_content = message.reasoning_content %}
33
+ {%- else %}
34
+ {%- if '</think>' in message.content %}
35
+ {%- set content = message.content.split('</think>')[-1].lstrip('\n') %}
36
+ {%- set reasoning_content = message.content.split('</think>')[0].rstrip('\n').split('<think>')[-1].lstrip('\n') %}
37
+ {%- endif %}
38
+ {%- endif %}
39
+ {%- if loop.index0 > ns.last_query_index %}
40
+ {%- if loop.last or (not loop.last and reasoning_content) %}
41
+ {{- '<|im_start|>' + message.role + '\n<think>\n' + reasoning_content.strip('\n') + '\n</think>\n\n' + content.lstrip('\n') }}
42
+ {%- else %}
43
+ {{- '<|im_start|>' + message.role + '\n' + content }}
44
+ {%- endif %}
45
+ {%- else %}
46
+ {{- '<|im_start|>' + message.role + '\n' + content }}
47
+ {%- endif %}
48
+ {%- if message.tool_calls %}
49
+ {%- for tool_call in message.tool_calls %}
50
+ {%- if (loop.first and content) or (not loop.first) %}
51
+ {{- '\n' }}
52
+ {%- endif %}
53
+ {%- if tool_call.function %}
54
+ {%- set tool_call = tool_call.function %}
55
+ {%- endif %}
56
+ {{- '<tool_call>\n{"name": "' }}
57
+ {{- tool_call.name }}
58
+ {{- '", "arguments": ' }}
59
+ {%- if tool_call.arguments is string %}
60
+ {{- tool_call.arguments }}
61
+ {%- else %}
62
+ {{- tool_call.arguments | tojson }}
63
+ {%- endif %}
64
+ {{- '}\n</tool_call>' }}
65
+ {%- endfor %}
66
+ {%- endif %}
67
+ {{- '<|im_end|>\n' }}
68
+ {%- elif message.role == "tool" %}
69
+ {%- if loop.first or (messages[loop.index0 - 1].role != "tool") %}
70
+ {{- '<|im_start|>user' }}
71
+ {%- endif %}
72
+ {{- '\n<tool_response>\n' }}
73
+ {{- message.content }}
74
+ {{- '\n</tool_response>' }}
75
+ {%- if loop.last or (messages[loop.index0 + 1].role != "tool") %}
76
+ {{- '<|im_end|>\n' }}
77
+ {%- endif %}
78
+ {%- endif %}
79
+ {%- endfor %}
80
+ {%- if add_generation_prompt %}
81
+ {{- '<|im_start|>assistant\n' }}
82
+ {%- if enable_thinking is defined and enable_thinking is false %}
83
+ {{- '<think>\n\n</think>\n\n' }}
84
+ {%- endif %}
85
+ {%- endif %}
text/tokenizer/tokenizer.json ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:d64aeef96961b86f38a6b6044489fcfaad27796eda19d4ae9491294615a33bf0
3
+ size 11423966
text/tokenizer/tokenizer_config.json ADDED
@@ -0,0 +1,37 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {
2
+ "add_prefix_space": false,
3
+ "backend": "tokenizers",
4
+ "bos_token": null,
5
+ "clean_up_tokenization_spaces": false,
6
+ "eos_token": "<|im_end|>",
7
+ "errors": "replace",
8
+ "extra_special_tokens": [
9
+ "<|im_start|>",
10
+ "<|im_end|>",
11
+ "<|object_ref_start|>",
12
+ "<|object_ref_end|>",
13
+ "<|box_start|>",
14
+ "<|box_end|>",
15
+ "<|quad_start|>",
16
+ "<|quad_end|>",
17
+ "<|vision_start|>",
18
+ "<|vision_end|>",
19
+ "<|vision_pad|>",
20
+ "<|image_pad|>",
21
+ "<|video_pad|>"
22
+ ],
23
+ "is_local": true,
24
+ "local_files_only": false,
25
+ "max_length": 256,
26
+ "model_max_length": 131072,
27
+ "pad_to_multiple_of": null,
28
+ "pad_token": "<|endoftext|>",
29
+ "pad_token_type_id": 0,
30
+ "padding_side": "left",
31
+ "split_special_tokens": false,
32
+ "stride": 0,
33
+ "tokenizer_class": "Qwen2Tokenizer",
34
+ "truncation_side": "right",
35
+ "truncation_strategy": "longest_first",
36
+ "unk_token": null
37
+ }