{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/euclideancodebook","entry":"EuclideanCodebook","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":1,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":0,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":6,"n_samples_ran":1,"n_samples_constructed":1,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":3,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":5},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2605.23402","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-23402","title":"Parametric Prior Mapping Framework for Non-stationary Probabilistic Time Series Forecasting","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"ljl8336/PPM","path":"layers/SVQ/SVQ_block.py","file_url":"https://github.com/ljl8336/PPM/blob/HEAD/layers/SVQ/SVQ_block.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d57ad3d13bb25601","code_sha256_prefix":"d57ad3d13bb25601","mcp_get_code":{"code_sha256":"d57ad3d13bb25601"}},{"arxiv_id":"2411.06070","arxiv_id_is_arxiv":true,"paper":"/paper/gft-graph-foundation-model-with-transferable","title":"GFT: Graph Foundation Model with Transferable Tree Vocabulary","date":"2024-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zehong-wang/gft","path":"GFT/model/vq.py","file_url":"https://github.com/zehong-wang/gft/blob/HEAD/GFT/model/vq.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"74f95d115c4d707c","code_sha256_prefix":"74f95d115c4d707c","mcp_get_code":{"code_sha256":"74f95d115c4d707c"}},{"arxiv_id":"2402.16321","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-speech-quality-estimation-and","title":"Self-Supervised Speech Quality Estimation and Enhancement Using Only Clean Speech","date":"2024-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JasonSWFu/VQscore","path":"models/VQVAE_models.py","file_url":"https://github.com/JasonSWFu/VQscore/blob/HEAD/models/VQVAE_models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, JasonSWFu/VQscore when it was checked","code_sha256":"252f6a2a01339c05","code_sha256_prefix":"252f6a2a01339c05","mcp_get_code":{"code_sha256":"252f6a2a01339c05"}},{"arxiv_id":"2311.17245","arxiv_id_is_arxiv":true,"paper":"/paper/lightgaussian-unbounded-3d-gaussian","title":"LightGaussian: Unbounded 3D Gaussian Compression with 15x Reduction and 200+ FPS","date":"2023-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/LightGaussian","path":"vectree/vectree.py","file_url":"https://github.com/VITA-Group/LightGaussian/blob/HEAD/vectree/vectree.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, VITA-Group/LightGaussian (NOASSERTION)","code_sha256":"6370a5cd0634f900","code_sha256_prefix":"6370a5cd0634f900","mcp_get_code":{"code_sha256":"6370a5cd0634f900"}},{"arxiv_id":"2308.02117","arxiv_id_is_arxiv":true,"paper":"/paper/vqgraph-graph-vector-quantization-for","title":"VQGraph: Rethinking Graph Representation Space for Bridging GNNs and MLPs","date":"2023-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangling0818/vqgraph","path":"vq.py","file_url":"https://github.com/yangling0818/vqgraph/blob/HEAD/vq.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yangling0818/vqgraph when it was checked","code_sha256":"b6e2f12aa29482a4","code_sha256_prefix":"b6e2f12aa29482a4","mcp_get_code":{"code_sha256":"b6e2f12aa29482a4"}},{"arxiv_id":"2306.06546","arxiv_id_is_arxiv":true,"paper":"/paper/high-fidelity-audio-compression-with-improved","title":"High-Fidelity Audio Compression with Improved RVQGAN","date":"2023-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangxinfd/speechtokenizer","path":"speechtokenizer/model.py","file_url":"https://github.com/zhangxinfd/speechtokenizer/blob/HEAD/speechtokenizer/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"88ebb93ff05f77f2","code_sha256_prefix":"88ebb93ff05f77f2","mcp_get_code":{"code_sha256":"88ebb93ff05f77f2"}}],"record_sha256":"97bc3d2b5e8936f1eb8615d018ad79dbbbaef7dc0edb421c6693e465147acc81","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}