{"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/new-arange","entry":"new_arange","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":0,"n_papers_ran_no_instrument_failure":0,"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":2,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":0,"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":0,"unverified":2},"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":"2411.02120","arxiv_id_is_arxiv":true,"paper":"/paper/bridge-if-learning-inverse-protein-folding","title":"Bridge-IF: Learning Inverse Protein Folding with Markov Bridges","date":"2024-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"violet-sto/Bridge-IF","path":"src/tasks/fixedbb/markov_bridge_pifold.py","file_url":"https://github.com/violet-sto/Bridge-IF/blob/HEAD/src/tasks/fixedbb/markov_bridge_pifold.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":"5e40de0eec5388cd","code_sha256_prefix":"5e40de0eec5388cd","mcp_get_code":{"code_sha256":"5e40de0eec5388cd"}},{"arxiv_id":"2312.09193","arxiv_id_is_arxiv":true,"paper":"/paper/fast-sampling-via-de-randomization-for","title":"Fast Sampling via Discrete Non-Markov Diffusion Models with Predetermined Transition Time","date":"2023-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uclaml/dndm","path":"discrete_diffusion/discrete_diffusions/utils.py","file_url":"https://github.com/uclaml/dndm/blob/HEAD/discrete_diffusion/discrete_diffusions/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":"5e40de0eec5388cd","code_sha256_prefix":"5e40de0eec5388cd","mcp_get_code":{"code_sha256":"5e40de0eec5388cd"}},{"arxiv_id":"2302.05737","arxiv_id_is_arxiv":true,"paper":"/paper/a-reparameterized-discrete-diffusion-model","title":"A Reparameterized Discrete Diffusion Model for Text Generation","date":"2023-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkunlp/reparam-discrete-diffusion","path":"discrete_diffusion/discrete_diffusions/utils.py","file_url":"https://github.com/hkunlp/reparam-discrete-diffusion/blob/HEAD/discrete_diffusion/discrete_diffusions/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":"5e40de0eec5388cd","code_sha256_prefix":"5e40de0eec5388cd","mcp_get_code":{"code_sha256":"5e40de0eec5388cd"}},{"arxiv_id":"2302.01649","arxiv_id_is_arxiv":true,"paper":"/paper/structure-informed-language-models-are","title":"Structure-informed Language Models Are Protein Designers","date":"2023-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bytedprotein/byprot","path":"src/byprot/models/fixedbb/lm_design/esm2_adapter.py","file_url":"https://github.com/bytedprotein/byprot/blob/HEAD/src/byprot/models/fixedbb/lm_design/esm2_adapter.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":"5e40de0eec5388cd","code_sha256_prefix":"5e40de0eec5388cd","mcp_get_code":{"code_sha256":"5e40de0eec5388cd"}},{"arxiv_id":"2208.06073","arxiv_id_is_arxiv":true,"paper":"/paper/conditional-antibody-design-as-3d-equivariant","title":"Conditional Antibody Design as 3D Equivariant Graph Translation","date":"2022-08-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lkny123/agn","path":"src/models/generator.py","file_url":"https://github.com/lkny123/agn/blob/HEAD/src/models/generator.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":"5e40de0eec5388cd","code_sha256_prefix":"5e40de0eec5388cd","mcp_get_code":{"code_sha256":"5e40de0eec5388cd"}},{"arxiv_id":"2109.04084","arxiv_id_is_arxiv":true,"paper":"/paper/thinking-clearly-talking-fast-concept-guided","title":"Thinking Clearly, Talking Fast: Concept-Guided Non-Autoregressive Generation for Open-Domain Dialogue Systems","date":"2021-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rowitzou/cg-nar","path":"src/models/insertion_transformer.py","file_url":"https://github.com/rowitzou/cg-nar/blob/HEAD/src/models/insertion_transformer.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":"5e40de0eec5388cd","code_sha256_prefix":"5e40de0eec5388cd","mcp_get_code":{"code_sha256":"5e40de0eec5388cd"}},{"arxiv_id":"2002.03079","arxiv_id_is_arxiv":true,"paper":"/paper/blank-language-models","title":"Blank Language Models","date":"2020-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Varal7/blank_language_model","path":"models/torch_utils.py","file_url":"https://github.com/Varal7/blank_language_model/blob/HEAD/models/torch_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":"4c0673e3894b47a3","code_sha256_prefix":"4c0673e3894b47a3","mcp_get_code":{"code_sha256":"4c0673e3894b47a3"}}],"record_sha256":"e7e51b329a266eec0e80396649a7e590e69bf6f9e96f4dd6542f1dc9366925de","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}