{"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/nucleus-sampling","entry":"nucleus_sampling","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":5,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":4,"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":5,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":4,"n_samples_unverified":1,"n_samples_fingerprinted":3,"n_places":5,"n_places_pointer_only":4,"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":2,"ran_fixture":2,"ran":0,"unverified":1},"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":"2505.02625","arxiv_id_is_arxiv":true,"paper":"/paper/llama-omni2-llm-based-real-time-spoken","title":"LLaMA-Omni2: LLM-based Real-time Spoken Chatbot with Autoregressive Streaming Speech Synthesis","date":"2025-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rainbowluocs/openomni","path":"openomni/model/speech_generator_ar/speech_generator.py","file_url":"https://github.com/rainbowluocs/openomni/blob/HEAD/openomni/model/speech_generator_ar/speech_generator.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, rainbowluocs/openomni when it was checked","code_sha256":"553c8e5537c2683d","code_sha256_prefix":"553c8e5537c2683d","mcp_get_code":{"code_sha256":"553c8e5537c2683d"}},{"arxiv_id":"2406.01946","arxiv_id_is_arxiv":true,"paper":"/paper/bileve-securing-text-provenance-in-large","title":"Bileve: Securing Text Provenance in Large Language Models Against Spoofing with Bi-level Signature","date":"2024-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Tongzhou0101/Bileve-official","path":"utils.py","file_url":"https://github.com/Tongzhou0101/Bileve-official/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, Tongzhou0101/Bileve-official (NOASSERTION)","code_sha256":"c708dd26a18ad6cb","code_sha256_prefix":"c708dd26a18ad6cb","mcp_get_code":{"code_sha256":"c708dd26a18ad6cb"}},{"arxiv_id":"2401.01326","arxiv_id_is_arxiv":true,"paper":"/paper/an-autoregressive-text-to-graph-framework-for","title":"An Autoregressive Text-to-Graph Framework for Joint Entity and Relation Extraction","date":"2024-01-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"urchade/ATG","path":"model.py","file_url":"https://github.com/urchade/ATG/blob/HEAD/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, urchade/ATG when it was checked","code_sha256":"8d729b1a9f22286e","code_sha256_prefix":"8d729b1a9f22286e","mcp_get_code":{"code_sha256":"8d729b1a9f22286e"}},{"arxiv_id":"2306.05423","arxiv_id_is_arxiv":true,"paper":"/paper/addp-learning-general-representations-for","title":"ADDP: Learning General Representations for Image Recognition and Generation with Alternating Denoising Diffusion Process","date":"2023-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"changyaotian/addp","path":"engine_generate.py","file_url":"https://github.com/changyaotian/addp/blob/HEAD/engine_generate.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, changyaotian/addp (NOASSERTION)","code_sha256":"39c9792b52fbf3c8","code_sha256_prefix":"39c9792b52fbf3c8","mcp_get_code":{"code_sha256":"39c9792b52fbf3c8"}},{"arxiv_id":"2110.15797","arxiv_id_is_arxiv":true,"paper":"/paper/discovering-non-monotonic-autoregressive","title":"Discovering Non-monotonic Autoregressive Orderings with Variational Inference","date":"2021-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuanlinli17/autoregressive_inference","path":"voi/algorithms/nucleus_sampling.py","file_url":"https://github.com/xuanlinli17/autoregressive_inference/blob/HEAD/voi/algorithms/nucleus_sampling.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":"6d0af24619eaf852","code_sha256_prefix":"6d0af24619eaf852","mcp_get_code":{"code_sha256":"6d0af24619eaf852"}}],"record_sha256":"8079533688c07532fab473a2b07bedd5fd0d8aa7405226513603a3c0db9be4d4","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}