{"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/top-p-logits","entry":"top_p_logits","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":13,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":9,"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":8,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":5,"n_samples_unverified":1,"n_samples_fingerprinted":7,"n_places":13,"n_places_pointer_only":8,"n_places_pointer_only_link_open":2,"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":3,"ran_fixture":2,"ran":2,"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":"2608.10288","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-10288","title":"Power law graph attention: exact generalization of scaled dot-product attention, empirical collapse at inference","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"burcgokden/lm-evaluation-harness-with-PLDR-LLM","path":"lm_eval/models/pldrllm.py","file_url":"https://github.com/burcgokden/lm-evaluation-harness-with-PLDR-LLM/blob/HEAD/lm_eval/models/pldrllm.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":"8110b89018ed3fcc","code_sha256_prefix":"8110b89018ed3fcc","mcp_get_code":{"code_sha256":"8110b89018ed3fcc"}},{"arxiv_id":"2606.18781","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-18781","title":"Lost in a Single Vector: Improving Long-Document Retrieval with Chunk Evidence Aggregation","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"PunchlineAAAA/DICE","path":"dream/generation_utils.py","file_url":"https://github.com/PunchlineAAAA/DICE/blob/HEAD/dream/generation_utils.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 xiaoshideta/Streaming-dLLM, and GitHub detected no licence in that repository when it was checked","code_sha256":"8139ba2bcf3eb84b","code_sha256_prefix":"8139ba2bcf3eb84b","mcp_get_code":{"code_sha256":"8139ba2bcf3eb84b"}},{"arxiv_id":"2604.18995","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-18995","title":"R 2 -dLLM: Accelerating Diffusion Large Language Models via Spatio-Temporal Redundancy Reduction","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"GATECH-EIC/R2-dLLM","path":"dream/model/generation_utils.py","file_url":"https://github.com/GATECH-EIC/R2-dLLM/blob/HEAD/dream/model/generation_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, GATECH-EIC/R2-dLLM when it was checked","code_sha256":"8139ba2bcf3eb84b","code_sha256_prefix":"8139ba2bcf3eb84b","mcp_get_code":{"code_sha256":"8139ba2bcf3eb84b"}},{"arxiv_id":"2604.15750","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-15750","title":"DepCap: Adaptive Block-Wise Parallel Decoding for Efficient Diffusion LM Inference","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"X-Xia0828/DepCap","path":"dream/model/generation_utils.py","file_url":"https://github.com/X-Xia0828/DepCap/blob/HEAD/dream/model/generation_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, X-Xia0828/DepCap when it was checked","code_sha256":"8139ba2bcf3eb84b","code_sha256_prefix":"8139ba2bcf3eb84b","mcp_get_code":{"code_sha256":"8139ba2bcf3eb84b"}},{"arxiv_id":"2602.06953","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-06953","title":"DAWN: Dependency-Aware Fast Inference for Diffusion LLMs","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"lizhuo-luo/DAWN","path":"dream/model/generation_utils.py","file_url":"https://github.com/lizhuo-luo/DAWN/blob/HEAD/dream/model/generation_utils.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 xiaoshideta/Streaming-dLLM, and GitHub detected no licence in that repository when it was checked","code_sha256":"8139ba2bcf3eb84b","code_sha256_prefix":"8139ba2bcf3eb84b","mcp_get_code":{"code_sha256":"8139ba2bcf3eb84b"}},{"arxiv_id":"2602.02178","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-02178","title":"AR-MAP: Are Autoregressive Large Language Models Implicit Teachers for Diffusion Large Language Models?","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"AMAP-ML/AR-MAP","path":"dLLM-RL-main/generate.py","file_url":"https://github.com/AMAP-ML/AR-MAP/blob/HEAD/dLLM-RL-main/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, AMAP-ML/AR-MAP when it was checked","code_sha256":"66db01566412a3db","code_sha256_prefix":"66db01566412a3db","mcp_get_code":{"code_sha256":"66db01566412a3db"}},{"arxiv_id":"2601.17917","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-17917","title":"Streaming-dLLM: Accelerating Diffusion LLMs via Suffix Pruning and Dynamic Decoding","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"xiaoshideta/Streaming-dLLM","path":"OpenPangu/inference/generation_utils_streaming.py","file_url":"https://github.com/xiaoshideta/Streaming-dLLM/blob/HEAD/OpenPangu/inference/generation_utils_streaming.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, xiaoshideta/Streaming-dLLM when it was checked","code_sha256":"8139ba2bcf3eb84b","code_sha256_prefix":"8139ba2bcf3eb84b","mcp_get_code":{"code_sha256":"8139ba2bcf3eb84b"}},{"arxiv_id":"2601.10926","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-10926","title":"Selecting Language Models for Social Science: Start Small, Start Open, and Validate Preprint XX(X):1-22 ©The Author(s) 2026","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"openai/gpt-2","path":"src/sample.py","file_url":"https://github.com/openai/gpt-2/blob/HEAD/src/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, openai/gpt-2 when it was checked","code_sha256":"8110b89018ed3fcc","code_sha256_prefix":"8110b89018ed3fcc","mcp_get_code":{"code_sha256":"8110b89018ed3fcc"}},{"arxiv_id":"2502.14204","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-fly-preference-alignment-via-principle","title":"On-the-fly Preference Alignment via Principle-Guided Decoding","date":"2025-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stevie1023/opad","path":"model.py","file_url":"https://github.com/stevie1023/opad/blob/HEAD/model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e2ba2c099a65a9cd","code_sha256_prefix":"e2ba2c099a65a9cd","mcp_get_code":{"code_sha256":"e2ba2c099a65a9cd"}},{"arxiv_id":"2410.17891","arxiv_id_is_arxiv":true,"paper":"/paper/scaling-diffusion-language-models-via","title":"Scaling Diffusion Language Models via Adaptation from Autoregressive Models","date":"2024-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HKUNLP/DiffuLLaMA","path":"evaluation/eval-diffullama.py","file_url":"https://github.com/HKUNLP/DiffuLLaMA/blob/HEAD/evaluation/eval-diffullama.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, HKUNLP/DiffuLLaMA when it was checked","code_sha256":"fd2fe76b57111989","code_sha256_prefix":"fd2fe76b57111989","mcp_get_code":{"code_sha256":"fd2fe76b57111989"}},{"arxiv_id":"1908.09451","arxiv_id_is_arxiv":true,"paper":"/paper/improving-neural-story-generation-by-targeted","title":"Improving Neural Story Generation by Targeted Common Sense Grounding","date":"2019-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"calclavia/story-generation","path":"analysis/generate.py","file_url":"https://github.com/calclavia/story-generation/blob/HEAD/analysis/generate.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f4bdad69d56eb2a0","code_sha256_prefix":"f4bdad69d56eb2a0","mcp_get_code":{"code_sha256":"f4bdad69d56eb2a0"}},{"arxiv_id":"openreview_QrC8OgQyOI","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_QrC8OgQyOI","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"viiika/Prism","path":"Dream/Dream_Prism/src/diffllm/gen_utils.py","file_url":"https://github.com/viiika/Prism/blob/HEAD/Dream/Dream_Prism/src/diffllm/gen_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5b9d49f026840bbb","code_sha256_prefix":"5b9d49f026840bbb","mcp_get_code":{"code_sha256":"5b9d49f026840bbb"}},{"arxiv_id":"2023.findings-acl.765","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-acl.765","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"qtli/EIB","path":"code/BottleSum/bottleSelf_summarize.py","file_url":"https://github.com/qtli/EIB/blob/HEAD/code/BottleSum/bottleSelf_summarize.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3b9dbc9cbc681120","code_sha256_prefix":"3b9dbc9cbc681120","mcp_get_code":{"code_sha256":"3b9dbc9cbc681120"}}],"record_sha256":"32005f63fad38e7e74da53b0fdc4142ce3fcfdc7b1d14b4c6f0594365c21e392","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}