{"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/multinomial-sample-one-no-sync","entry":"multinomial_sample_one_no_sync","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":10,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":10,"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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":10,"n_places_pointer_only":6,"n_places_pointer_only_link_open":1,"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":4,"ran_fixture":0,"ran":0,"unverified":0},"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":"2602.06283","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-06283","title":"SOCKET: SOft Collision Kernel EsTimator for Sparse Attention","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"amarka8/SOCKET","path":"GPT-FAST/generate.py","file_url":"https://github.com/amarka8/SOCKET/blob/HEAD/GPT-FAST/generate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, amarka8/SOCKET when it was checked","code_sha256":"060506d7f037e907","code_sha256_prefix":"060506d7f037e907","mcp_get_code":{"code_sha256":"060506d7f037e907"}},{"arxiv_id":"2511.00351","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-00351","title":"Reject Only Critical Tokens: Pivot-Aware Speculative Decoding","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"amir-zsh/PAD","path":"src/gpt_fast/gpt_fast_utils.py","file_url":"https://github.com/amir-zsh/PAD/blob/HEAD/src/gpt_fast/gpt_fast_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, amir-zsh/PAD when it was checked","code_sha256":"0b5f90e8856ad7af","code_sha256_prefix":"0b5f90e8856ad7af","mcp_get_code":{"code_sha256":"0b5f90e8856ad7af"}},{"arxiv_id":"2501.06589","arxiv_id_is_arxiv":true,"paper":"/paper/ladder-residual-parallelism-aware","title":"Ladder-residual: parallelism-aware architecture for accelerating large model inference with communication overlapping","date":"2025-01-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mayank31398/ladder-residual-inference","path":"benchmark.py","file_url":"https://github.com/mayank31398/ladder-residual-inference/blob/HEAD/benchmark.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5b6f45360aa68edd","code_sha256_prefix":"5b6f45360aa68edd","mcp_get_code":{"code_sha256":"5b6f45360aa68edd"}},{"arxiv_id":"2408.14690","arxiv_id_is_arxiv":true,"paper":"/paper/training-free-activation-sparsity-in-large","title":"Training-Free Activation Sparsity in Large Language Models","date":"2024-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FasterDecoding/TEAL","path":"gpt-fast/generate.py","file_url":"https://github.com/FasterDecoding/TEAL/blob/HEAD/gpt-fast/generate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5b6f45360aa68edd","code_sha256_prefix":"5b6f45360aa68edd","mcp_get_code":{"code_sha256":"5b6f45360aa68edd"}},{"arxiv_id":"2408.07092","arxiv_id_is_arxiv":true,"paper":"/paper/post-training-sparse-attention-with-double","title":"Post-Training Sparse Attention with Double Sparsity","date":"2024-08-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andy-yang-1/doublesparse","path":"models/generate.py","file_url":"https://github.com/andy-yang-1/doublesparse/blob/HEAD/models/generate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"968f7cbd56cd3206","code_sha256_prefix":"968f7cbd56cd3206","mcp_get_code":{"code_sha256":"968f7cbd56cd3206"}},{"arxiv_id":"2406.11235","arxiv_id_is_arxiv":true,"paper":"/paper/qtip-quantization-with-trellises-and","title":"QTIP: Quantization with Trellises and Incoherence Processing","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Cornell-RelaxML/qtip","path":"eval/interactive_gen.py","file_url":"https://github.com/Cornell-RelaxML/qtip/blob/HEAD/eval/interactive_gen.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, Cornell-RelaxML/qtip, is not in the permissive set Syntology serves inline","code_sha256":"0b5f90e8856ad7af","code_sha256_prefix":"0b5f90e8856ad7af","mcp_get_code":{"code_sha256":"0b5f90e8856ad7af"}},{"arxiv_id":"2402.04396","arxiv_id_is_arxiv":true,"paper":"/paper/quip-even-better-llm-quantization-with","title":"QuIP#: Even Better LLM Quantization with Hadamard Incoherence and Lattice Codebooks","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Cornell-RelaxML/quip-sharp","path":"eval/interactive_gen.py","file_url":"https://github.com/Cornell-RelaxML/quip-sharp/blob/HEAD/eval/interactive_gen.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, Cornell-RelaxML/quip-sharp, is not in the permissive set Syntology serves inline","code_sha256":"0b5f90e8856ad7af","code_sha256_prefix":"0b5f90e8856ad7af","mcp_get_code":{"code_sha256":"0b5f90e8856ad7af"}},{"arxiv_id":"2308.02560","arxiv_id_is_arxiv":true,"paper":"/paper/from-discrete-tokens-to-high-fidelity-audio","title":"From Discrete Tokens to High-Fidelity Audio Using Multi-Band Diffusion","date":"2023-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"metavoiceio/metavoice-src","path":"fam/llm/fast_inference_utils.py","file_url":"https://github.com/metavoiceio/metavoice-src/blob/HEAD/fam/llm/fast_inference_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5b6f45360aa68edd","code_sha256_prefix":"5b6f45360aa68edd","mcp_get_code":{"code_sha256":"5b6f45360aa68edd"}},{"arxiv_id":"2306.05284","arxiv_id_is_arxiv":true,"paper":"/paper/simple-and-controllable-music-generation","title":"Simple and Controllable Music Generation","date":"2023-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"collabora/whisperspeech","path":"whisperspeech/inference.py","file_url":"https://github.com/collabora/whisperspeech/blob/HEAD/whisperspeech/inference.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Cornell-RelaxML/qtip, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"0b5f90e8856ad7af","code_sha256_prefix":"0b5f90e8856ad7af","mcp_get_code":{"code_sha256":"0b5f90e8856ad7af"}},{"arxiv_id":"2212.04356","arxiv_id_is_arxiv":true,"paper":"/paper/robust-speech-recognition-via-large-scale-1","title":"Robust Speech Recognition via Large-Scale Weak Supervision","date":"2022-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"0b5f90e8856ad7af","code_sha256_prefix":"0b5f90e8856ad7af","mcp_get_code":{"code_sha256":"0b5f90e8856ad7af"}}],"record_sha256":"0b451d2780ddc9ae52440b62a015d5ec026c7db66f8f4cf1894c3285ce6b51fa","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}