{"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/train-val-test-split","entry":"train_val_test_split","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":15,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":13,"n_papers_ran_instrument_only":1,"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":13,"n_samples_ran":12,"n_samples_constructed":0,"n_samples_ran_checked":11,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":15,"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":1,"ran_fixture":0,"ran":11,"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":"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":"datasets_scripts/tabdiff_process_dataset.py","file_url":"https://github.com/april-tools/tabpc/blob/HEAD/datasets_scripts/tabdiff_process_dataset.py","status":"ran","verification_level":1,"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":"e034defca8827e6c","code_sha256_prefix":"e034defca8827e6c","mcp_get_code":{"code_sha256":"e034defca8827e6c"}},{"arxiv_id":"2502.01171","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-and-scalable-density-functional","title":"Efficient and Scalable Density Functional Theory Hamiltonian Prediction through Adaptive Sparsity","date":"2025-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/sphnet","path":"src/training/utils.py","file_url":"https://github.com/microsoft/sphnet/blob/HEAD/src/training/utils.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":"451a8000566c7c43","code_sha256_prefix":"451a8000566c7c43","mcp_get_code":{"code_sha256":"451a8000566c7c43"}},{"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":"process_dataset.py","file_url":"https://github.com/minkaixu/tabdiff/blob/HEAD/process_dataset.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":"e034defca8827e6c","code_sha256_prefix":"e034defca8827e6c","mcp_get_code":{"code_sha256":"e034defca8827e6c"}},{"arxiv_id":"2404.17169","arxiv_id_is_arxiv":true,"paper":"/paper/fairgt-a-fairness-aware-graph-transformer","title":"FairGT: A Fairness-aware Graph Transformer","date":"2024-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yushuowiki/fairgt","path":"utils.py","file_url":"https://github.com/yushuowiki/fairgt/blob/HEAD/utils.py","status":"ran","verification_level":1,"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, yushuowiki/fairgt when it was checked","code_sha256":"5e16588d4905b5fe","code_sha256_prefix":"5e16588d4905b5fe","mcp_get_code":{"code_sha256":"5e16588d4905b5fe"}},{"arxiv_id":"2311.18639","arxiv_id_is_arxiv":true,"paper":"/paper/targeted-reduction-of-causal-models","title":"Targeted Reduction of Causal Models","date":"2023-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"akekic/targeted-causal-reduction","path":"targeted_causal_reduction/data_generators/processing/core.py","file_url":"https://github.com/akekic/targeted-causal-reduction/blob/HEAD/targeted_causal_reduction/data_generators/processing/core.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":"57a92be91162a459","code_sha256_prefix":"57a92be91162a459","mcp_get_code":{"code_sha256":"57a92be91162a459"}},{"arxiv_id":"2310.03240","arxiv_id_is_arxiv":true,"paper":"/paper/relational-convolutional-networks-a-framework","title":"Learning Hierarchical Relational Representations through Relational Convolutions","date":"2023-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"awni00/relational-convolutions","path":"utils.py","file_url":"https://github.com/awni00/relational-convolutions/blob/HEAD/utils.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":"8f28cfccddd15816","code_sha256_prefix":"8f28cfccddd15816","mcp_get_code":{"code_sha256":"8f28cfccddd15816"}},{"arxiv_id":"2307.10683","arxiv_id_is_arxiv":true,"paper":"/paper/fractional-denoising-for-3d-molecular-pre","title":"Fractional Denoising for 3D Molecular Pre-training","date":"2023-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fengshikun/frad","path":"torchmdnet/utils.py","file_url":"https://github.com/fengshikun/frad/blob/HEAD/torchmdnet/utils.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":"9b9f6689028801f7","code_sha256_prefix":"9b9f6689028801f7","mcp_get_code":{"code_sha256":"9b9f6689028801f7"}},{"arxiv_id":"2303.08951","arxiv_id_is_arxiv":true,"paper":"/paper/the-tiny-time-series-transformer-low-latency","title":"The Tiny Time-series Transformer: Low-latency High-throughput Classification of Astronomical Transients using Deep Model Compression","date":"2023-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tallamjr/astronet","path":"astronet/utils.py","file_url":"https://github.com/tallamjr/astronet/blob/HEAD/astronet/utils.py","status":"ran","verification_level":1,"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":"99fc3ce23c4cb98b","code_sha256_prefix":"99fc3ce23c4cb98b","mcp_get_code":{"code_sha256":"99fc3ce23c4cb98b"}},{"arxiv_id":"2206.00133","arxiv_id_is_arxiv":true,"paper":"/paper/pre-training-via-denoising-for-molecular","title":"Pre-training via Denoising for Molecular Property Prediction","date":"2022-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shehzaidi/pre-training-via-denoising","path":"torchmdnet/utils.py","file_url":"https://github.com/shehzaidi/pre-training-via-denoising/blob/HEAD/torchmdnet/utils.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":"6a633af654f04a42","code_sha256_prefix":"6a633af654f04a42","mcp_get_code":{"code_sha256":"6a633af654f04a42"}},{"arxiv_id":"2009.12710","arxiv_id_is_arxiv":true,"paper":"/paper/heterogeneous-molecular-graph-neural-networks","title":"Heterogeneous Molecular Graph Neural Networks for Predicting Molecule Properties","date":"2020-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shuix007/HMGNN","path":"Preprocess.py","file_url":"https://github.com/shuix007/HMGNN/blob/HEAD/Preprocess.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, shuix007/HMGNN when it was checked","code_sha256":"c49e32e26635d7a8","code_sha256_prefix":"c49e32e26635d7a8","mcp_get_code":{"code_sha256":"c49e32e26635d7a8"}},{"arxiv_id":"2004.05150","arxiv_id_is_arxiv":true,"paper":"/paper/longformer-the-long-document-transformer","title":"Longformer: The Long-Document Transformer","date":"2020-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jaketae/pytorch-malware-detection","path":"src/deep_malware_detection/dataset.py","file_url":"https://github.com/jaketae/pytorch-malware-detection/blob/HEAD/src/deep_malware_detection/dataset.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":"e71dea05795c03bf","code_sha256_prefix":"e71dea05795c03bf","mcp_get_code":{"code_sha256":"e71dea05795c03bf"}},{"arxiv_id":"1710.09435","arxiv_id_is_arxiv":true,"paper":"/paper/malware-detection-by-eating-a-whole-exe","title":"Malware Detection by Eating a Whole EXE","date":"2017-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jaketae/deep-malware-detection","path":"src/deep_malware_detection/dataset.py","file_url":"https://github.com/jaketae/deep-malware-detection/blob/HEAD/src/deep_malware_detection/dataset.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":"e71dea05795c03bf","code_sha256_prefix":"e71dea05795c03bf","mcp_get_code":{"code_sha256":"e71dea05795c03bf"}},{"arxiv_id":"1612.09106","arxiv_id_is_arxiv":true,"paper":"/paper/sequence-to-point-learning-with-neural","title":"Sequence-to-point learning with neural networks for nonintrusive load monitoring","date":"2016-12-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"redefik/ConvNILM","path":"data_preprocessing.py","file_url":"https://github.com/redefik/ConvNILM/blob/HEAD/data_preprocessing.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":"fc452ed44ce06dea","code_sha256_prefix":"fc452ed44ce06dea","mcp_get_code":{"code_sha256":"fc452ed44ce06dea"}},{"arxiv_id":"ijcai2025_0872","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2025_0872","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"HongxinXiang/EDG","path":"EDG-for-VisNet/visnet_for_EDG/utils.py","file_url":"https://github.com/HongxinXiang/EDG/blob/HEAD/EDG-for-VisNet/visnet_for_EDG/utils.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":"65759d84ca6eef27","code_sha256_prefix":"65759d84ca6eef27","mcp_get_code":{"code_sha256":"65759d84ca6eef27"}},{"arxiv_id":"aaai_35067","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_35067","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"unicef/giga-global-school-mapping","path":"utils/model_utils.py","file_url":"https://github.com/unicef/giga-global-school-mapping/blob/HEAD/utils/model_utils.py","status":"ran","verification_level":1,"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":"527fd02693c69301","code_sha256_prefix":"527fd02693c69301","mcp_get_code":{"code_sha256":"527fd02693c69301"}}],"record_sha256":"66880c71ce7de7d39a8d791bdec198638b2b07f6e15c20ab8aa3b31334fdde23","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}