{"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/fsspec-exists","entry":"fsspec_exists","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":8,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":3,"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":3,"ran_draft_wrong":0,"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":"2605.22765","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-22765","title":"Uniform Diffusion Models Revisited: Leave-One-Out Denoiser and Absorbing State Reformulation","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"samsongourevitch/rev_udm","path":"trainer_sudoku.py","file_url":"https://github.com/samsongourevitch/rev_udm/blob/HEAD/trainer_sudoku.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f13d3a0d1019499f","code_sha256_prefix":"f13d3a0d1019499f","mcp_get_code":{"code_sha256":"f13d3a0d1019499f"}},{"arxiv_id":"2605.11125","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-11125","title":"Language Modeling with Hyperspherical Flows","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"s-sahoo/duo","path":"utils.py","file_url":"https://github.com/s-sahoo/duo/blob/HEAD/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dec1de00023a923b","code_sha256_prefix":"dec1de00023a923b","mcp_get_code":{"code_sha256":"dec1de00023a923b"}},{"arxiv_id":"2601.19232","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-19232","title":"Structure-based RNA Design by Step-wise Optimization of Latent Diffusion Model","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"ChenyuWang-Monica/DRAKES","path":"drakes_dna/utils.py","file_url":"https://github.com/ChenyuWang-Monica/DRAKES/blob/HEAD/drakes_dna/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, ChenyuWang-Monica/DRAKES when it was checked","code_sha256":"dec1de00023a923b","code_sha256_prefix":"dec1de00023a923b","mcp_get_code":{"code_sha256":"dec1de00023a923b"}},{"arxiv_id":"2509.18577","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-18577","title":"Prior-based Noisy Text Data Filtering: Fast and Strong Alternative For Perplexity","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"ybseo-ac/prior_filter","path":"utils.py","file_url":"https://github.com/ybseo-ac/prior_filter/blob/HEAD/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, ybseo-ac/prior_filter when it was checked","code_sha256":"dec1de00023a923b","code_sha256_prefix":"dec1de00023a923b","mcp_get_code":{"code_sha256":"dec1de00023a923b"}},{"arxiv_id":"2505.18883","arxiv_id_is_arxiv":true,"paper":"/paper/partition-generative-modeling-masked-modeling","title":"Partition Generative Modeling: Masked Modeling Without Masks","date":"2025-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kuleshov-group/mdlm","path":"utils.py","file_url":"https://github.com/kuleshov-group/mdlm/blob/HEAD/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dec1de00023a923b","code_sha256_prefix":"dec1de00023a923b","mcp_get_code":{"code_sha256":"dec1de00023a923b"}},{"arxiv_id":"2502.01384","arxiv_id_is_arxiv":true,"paper":"/paper/fine-tuning-discrete-diffusion-models-with","title":"Fine-Tuning Discrete Diffusion Models with Policy Gradient Methods","date":"2025-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ozekri/SEPO","path":"GRPO_MDLM_DNA/utils.py","file_url":"https://github.com/ozekri/SEPO/blob/HEAD/GRPO_MDLM_DNA/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dec1de00023a923b","code_sha256_prefix":"dec1de00023a923b","mcp_get_code":{"code_sha256":"dec1de00023a923b"}},{"arxiv_id":"2410.13643","arxiv_id_is_arxiv":true,"paper":"/paper/fine-tuning-discrete-diffusion-models-via","title":"Fine-Tuning Discrete Diffusion Models via Reward Optimization with Applications to DNA and Protein Design","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenyuwang-monica/drakes","path":"drakes_dna/utils.py","file_url":"https://github.com/chenyuwang-monica/drakes/blob/HEAD/drakes_dna/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, chenyuwang-monica/drakes when it was checked","code_sha256":"dec1de00023a923b","code_sha256_prefix":"dec1de00023a923b","mcp_get_code":{"code_sha256":"dec1de00023a923b"}},{"arxiv_id":"2403.03234","arxiv_id_is_arxiv":true,"paper":"/paper/caduceus-bi-directional-equivariant-long","title":"Caduceus: Bi-Directional Equivariant Long-Range DNA Sequence Modeling","date":"2024-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kuleshov-group/caduceus","path":"vep_embeddings.py","file_url":"https://github.com/kuleshov-group/caduceus/blob/HEAD/vep_embeddings.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"31a8ada19e8c38e8","code_sha256_prefix":"31a8ada19e8c38e8","mcp_get_code":{"code_sha256":"31a8ada19e8c38e8"}}],"record_sha256":"b87e3dbec0619de89df91ddd068efbf7603856b167c7d73a5a4868723da7aedc","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}