{"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/parse-date","entry":"parse_date","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":5,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":2,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":5,"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":1,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":2,"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":"2506.20920","arxiv_id_is_arxiv":true,"paper":"/paper/fineweb2-one-pipeline-to-scale-them-all","title":"FineWeb2: One Pipeline to Scale Them All -- Adapting Pre-Training Data Processing to Every Language","date":"2025-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huggingface/fineweb-2","path":"ablations/evaluation/launch_evals.py","file_url":"https://github.com/huggingface/fineweb-2/blob/HEAD/ablations/evaluation/launch_evals.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"25e77cb73f28dda5","code_sha256_prefix":"25e77cb73f28dda5","mcp_get_code":{"code_sha256":"25e77cb73f28dda5"}},{"arxiv_id":"2406.09072","arxiv_id_is_arxiv":true,"paper":"/paper/living-in-the-moment-can-large-language","title":"Living in the Moment: Can Large Language Models Grasp Co-Temporal Reasoning?","date":"2024-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaochen0110/cotempqa","path":"data_construct/facts_to_raw_data.py","file_url":"https://github.com/zhaochen0110/cotempqa/blob/HEAD/data_construct/facts_to_raw_data.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, zhaochen0110/cotempqa when it was checked","code_sha256":"fd241f0a32ac51bb","code_sha256_prefix":"fd241f0a32ac51bb","mcp_get_code":{"code_sha256":"fd241f0a32ac51bb"}},{"arxiv_id":"2312.01728","arxiv_id_is_arxiv":true,"paper":"/paper/imputeformer-graph-transformers-for","title":"ImputeFormer: Low Rankness-Induced Transformers for Generalizable Spatiotemporal Imputation","date":"2023-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tongnie/imputeformer","path":"experiments/imputeformer/datasets/cer_en.py","file_url":"https://github.com/tongnie/imputeformer/blob/HEAD/experiments/imputeformer/datasets/cer_en.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d940f96a0bc64ecf","code_sha256_prefix":"d940f96a0bc64ecf","mcp_get_code":{"code_sha256":"d940f96a0bc64ecf"}},{"arxiv_id":"2306.13891","arxiv_id_is_arxiv":true,"paper":"/paper/estimating-the-causal-effect-of-early","title":"Estimating the Causal Effect of Early ArXiving on Paper Acceptance","date":"2023-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CogComp/iclr_database","path":"src/pdf_txt_parser.py","file_url":"https://github.com/CogComp/iclr_database/blob/HEAD/src/pdf_txt_parser.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b56142048b11f367","code_sha256_prefix":"b56142048b11f367","mcp_get_code":{"code_sha256":"b56142048b11f367"}},{"arxiv_id":"2009.07365","arxiv_id_is_arxiv":true,"paper":"/paper/fast-semantic-parsing-with-well-typedness","title":"Fast semantic parsing with well-typedness guarantees","date":"2020-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Oneplus/tamr","path":"amr_aligner/system/eager/state.py","file_url":"https://github.com/Oneplus/tamr/blob/HEAD/amr_aligner/system/eager/state.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Oneplus/tamr when it was checked","code_sha256":"cfb3f2e80b865160","code_sha256_prefix":"cfb3f2e80b865160","mcp_get_code":{"code_sha256":"cfb3f2e80b865160"}}],"record_sha256":"a09014ea944b62a5e9ad4c20988ee8acf7f27ef3a187a89af5b1bc257aa7b222","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}