{"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/reorder","entry":"reorder","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":4,"n_papers_ran_no_instrument_failure":2,"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":7,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":2,"n_samples_unverified":3,"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":2,"ran_fixture":0,"ran":2,"unverified":3},"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":"2603.23016","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-23016","title":"A Sobering Look at Tabular Data Generation via Probabilistic Circuits","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"april-tools/tabpc","path":"src/metrics/metrics.py","file_url":"https://github.com/april-tools/tabpc/blob/HEAD/src/metrics/metrics.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":"9f9ff63f9c999000","code_sha256_prefix":"9f9ff63f9c999000","mcp_get_code":{"code_sha256":"9f9ff63f9c999000"}},{"arxiv_id":"2504.03933","arxiv_id_is_arxiv":true,"paper":"/paper/language-models-are-implicitly-continuous","title":"Language Models Are Implicitly Continuous","date":"2025-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samuelemarro/continuous-llm-experiments","path":"utils.py","file_url":"https://github.com/samuelemarro/continuous-llm-experiments/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, samuelemarro/continuous-llm-experiments, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"2f02a58663c23730","code_sha256_prefix":"2f02a58663c23730","mcp_get_code":{"code_sha256":"2f02a58663c23730"}},{"arxiv_id":"2410.20626","arxiv_id_is_arxiv":true,"paper":"/paper/tabdiff-a-multi-modal-diffusion-model-for","title":"TabDiff: a Multi-Modal Diffusion Model for Tabular Data Generation","date":"2024-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minkaixu/tabdiff","path":"tabdiff/metrics.py","file_url":"https://github.com/minkaixu/tabdiff/blob/HEAD/tabdiff/metrics.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":"d8b268750aea91e4","code_sha256_prefix":"d8b268750aea91e4","mcp_get_code":{"code_sha256":"d8b268750aea91e4"}},{"arxiv_id":"2405.08460","arxiv_id_is_arxiv":true,"paper":"/paper/evaluating-llms-at-evaluating-temporal","title":"Is Your LLM Outdated? Evaluating LLMs at Temporal Generalization","date":"2024-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"freedomintelligence/freshbench","path":"reorder.py","file_url":"https://github.com/freedomintelligence/freshbench/blob/HEAD/reorder.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, freedomintelligence/freshbench when it was checked","code_sha256":"2a20bf01a50913bf","code_sha256_prefix":"2a20bf01a50913bf","mcp_get_code":{"code_sha256":"2a20bf01a50913bf"}},{"arxiv_id":"2403.08335","arxiv_id_is_arxiv":true,"paper":"/paper/a-sparsity-principle-for-partially-observable","title":"A Sparsity Principle for Partially Observable Causal Representation Learning","date":"2024-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danrux/sparsity-crl","path":"Ball/evaluation.py","file_url":"https://github.com/danrux/sparsity-crl/blob/HEAD/Ball/evaluation.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":"6d0e79fdb10ec36d","code_sha256_prefix":"6d0e79fdb10ec36d","mcp_get_code":{"code_sha256":"6d0e79fdb10ec36d"}},{"arxiv_id":"2310.09656","arxiv_id_is_arxiv":true,"paper":"/paper/mixed-type-tabular-data-synthesis-with-score","title":"Mixed-Type Tabular Data Synthesis with Score-based Diffusion in Latent Space","date":"2023-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-science/tabsyn","path":"eval/eval_density.py","file_url":"https://github.com/amazon-science/tabsyn/blob/HEAD/eval/eval_density.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":"1c17b2f36fed33d5","code_sha256_prefix":"1c17b2f36fed33d5","mcp_get_code":{"code_sha256":"1c17b2f36fed33d5"}},{"arxiv_id":"2305.14663","arxiv_id_is_arxiv":true,"paper":"/paper/you-are-what-you-annotate-towards-better","title":"You Are What You Annotate: Towards Better Models through Annotator Representations","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"michigannlp/annotator-embeddings","path":"ablation_studies/ablation_plot.py","file_url":"https://github.com/michigannlp/annotator-embeddings/blob/HEAD/ablation_studies/ablation_plot.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"15d7e67ac3ad51cd","code_sha256_prefix":"15d7e67ac3ad51cd","mcp_get_code":{"code_sha256":"15d7e67ac3ad51cd"}}],"record_sha256":"8cc6b41a73eda6b18501923042fcb2ac56cda5941fa8601f28a107525b7b9a11","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}