{"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/greedy-search","entry":"greedy_search","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":7,"n_papers_ran":1,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":1,"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":0,"n_samples_ran_checked":0,"n_samples_instrument":1,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":2,"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":1,"ran_fixture":0,"ran":0,"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":"2607.10661","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-10661","title":"Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"MINE-USTC/PTD","path":"tree_draft/decode_strategy/autoregressive.py","file_url":"https://github.com/MINE-USTC/PTD/blob/HEAD/tree_draft/decode_strategy/autoregressive.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":"d509548acb6dcc24","code_sha256_prefix":"d509548acb6dcc24","mcp_get_code":{"code_sha256":"d509548acb6dcc24"}},{"arxiv_id":"2502.06130","arxiv_id_is_arxiv":true,"paper":"/paper/self-correcting-decoding-with-generative","title":"Self-Correcting Decoding with Generative Feedback for Mitigating Hallucinations in Large Vision-Language Models","date":"2025-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangce01/degf","path":"degf_utils/degf_sample.py","file_url":"https://github.com/zhangce01/degf/blob/HEAD/degf_utils/degf_sample.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, zhangce01/degf when it was checked","code_sha256":"128612930e882fac","code_sha256_prefix":"128612930e882fac","mcp_get_code":{"code_sha256":"128612930e882fac"}},{"arxiv_id":"2410.02745","arxiv_id_is_arxiv":true,"paper":"/paper/avg-llava-a-large-multimodal-model-with","title":"AVG-LLaVA: A Large Multimodal Model with Adaptive Visual Granularity","date":"2024-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deeplearnxmu/avg-llava","path":"llava/generate_utils.py","file_url":"https://github.com/deeplearnxmu/avg-llava/blob/HEAD/llava/generate_utils.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":"6c3e7a3c3b9dba43","code_sha256_prefix":"6c3e7a3c3b9dba43","mcp_get_code":{"code_sha256":"6c3e7a3c3b9dba43"}},{"arxiv_id":"2402.14874","arxiv_id_is_arxiv":true,"paper":"/paper/distillation-contrastive-decoding-improving","title":"Distillation Contrastive Decoding: Improving LLMs Reasoning with Contrastive Decoding and Distillation","date":"2024-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pphuc25/distil-cd","path":"src/dcd/generate.py","file_url":"https://github.com/pphuc25/distil-cd/blob/HEAD/src/dcd/generate.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, pphuc25/distil-cd when it was checked","code_sha256":"ad7789fd83efa143","code_sha256_prefix":"ad7789fd83efa143","mcp_get_code":{"code_sha256":"ad7789fd83efa143"}},{"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/greedy_search.py","file_url":"https://github.com/xuanlinli17/autoregressive_inference/blob/HEAD/voi/algorithms/greedy_search.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":"6f6c9fbef829da96","code_sha256_prefix":"6f6c9fbef829da96","mcp_get_code":{"code_sha256":"6f6c9fbef829da96"}},{"arxiv_id":"1706.03762","arxiv_id_is_arxiv":true,"paper":"/paper/attention-is-all-you-need","title":"Attention Is All You Need","date":"2017-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"demelin/nematode","path":"codebase/transformer.py","file_url":"https://github.com/demelin/nematode/blob/HEAD/codebase/transformer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d6c7992b8eee6f31","code_sha256_prefix":"d6c7992b8eee6f31","mcp_get_code":{"code_sha256":"d6c7992b8eee6f31"}},{"arxiv_id":"2025.findings-acl.865","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.findings-acl.865","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"DeepLearnXMU/AVG-LLaVA","path":"llava/generate_utils.py","file_url":"https://github.com/DeepLearnXMU/AVG-LLaVA/blob/HEAD/llava/generate_utils.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":"6c3e7a3c3b9dba43","code_sha256_prefix":"6c3e7a3c3b9dba43","mcp_get_code":{"code_sha256":"6c3e7a3c3b9dba43"}}],"record_sha256":"2021eedcd464aa5c07e94959ae3c120ada3b4eb1c18911a24dc670c93f0c6d2f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}