{"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/get-split","entry":"get_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":17,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":8,"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":16,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":1,"n_samples_unverified":7,"n_samples_fingerprinted":0,"n_places":19,"n_places_pointer_only":5,"n_places_pointer_only_link_open":1,"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":1,"ran":8,"unverified":7},"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":"2606.17113","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-17113","title":"The Critical Role of Model Selection in Causal Inference: A Comparative Analysis of Classification Models within the InferBERT Framework for Pharmacovigilance","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"hsdslab/biomedical-causal-inference","path":"src/Analgesics-induced_acute_liver_failure/albert_train_src.py","file_url":"https://github.com/hsdslab/biomedical-causal-inference/blob/HEAD/src/Analgesics-induced_acute_liver_failure/albert_train_src.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, hsdslab/biomedical-causal-inference when it was checked","code_sha256":"87e47297b4c3db5c","code_sha256_prefix":"87e47297b4c3db5c","mcp_get_code":{"code_sha256":"87e47297b4c3db5c"}},{"arxiv_id":"2606.17113","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-17113","title":"The Critical Role of Model Selection in Causal Inference: A Comparative Analysis of Classification Models within the InferBERT Framework for Pharmacovigilance","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"hsdslab/biomedical-causal-inference","path":"src/Analgesics-induced_acute_liver_failure/biobert_llm_train_src.py","file_url":"https://github.com/hsdslab/biomedical-causal-inference/blob/HEAD/src/Analgesics-induced_acute_liver_failure/biobert_llm_train_src.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, hsdslab/biomedical-causal-inference when it was checked","code_sha256":"54c8f407d8ba3697","code_sha256_prefix":"54c8f407d8ba3697","mcp_get_code":{"code_sha256":"54c8f407d8ba3697"}},{"arxiv_id":"2603.00599","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-00599","title":"Heterophily-Agnostic Hypergraph Neural Networks with Riemannian Local Exchanger","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"Mingzhang21/HealHGNN","path":"HealHGNN/utils/data_utils.py","file_url":"https://github.com/Mingzhang21/HealHGNN/blob/HEAD/HealHGNN/utils/data_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":"373a389551605855","code_sha256_prefix":"373a389551605855","mcp_get_code":{"code_sha256":"373a389551605855"}},{"arxiv_id":"2510.17457","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-17457","title":"Deeper with Riemannian Geometry: Overcoming Oversmoothing and Oversquashing for Graph Foundation Models","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"ZhenhHuang/GBN","path":"utils/data_utils.py","file_url":"https://github.com/ZhenhHuang/GBN/blob/HEAD/utils/data_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, ZhenhHuang/GBN when it was checked","code_sha256":"373a389551605855","code_sha256_prefix":"373a389551605855","mcp_get_code":{"code_sha256":"373a389551605855"}},{"arxiv_id":"2409.07429","arxiv_id_is_arxiv":true,"paper":"/paper/agent-workflow-memory","title":"Agent Workflow Memory","date":"2024-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zorazrw/agent-workflow-memory","path":"mind2web/offline_induction.py","file_url":"https://github.com/zorazrw/agent-workflow-memory/blob/HEAD/mind2web/offline_induction.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":"1c21d96a59bbdec1","code_sha256_prefix":"1c21d96a59bbdec1","mcp_get_code":{"code_sha256":"1c21d96a59bbdec1"}},{"arxiv_id":"2409.02772","arxiv_id_is_arxiv":true,"paper":"/paper/unifying-causal-representation-learning-with","title":"Unifying Causal Representation Learning with the Invariance Principle","date":"2024-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"causallearningai/istant","path":"src/data.py","file_url":"https://github.com/causallearningai/istant/blob/HEAD/src/data.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":"a1679135216baa49","code_sha256_prefix":"a1679135216baa49","mcp_get_code":{"code_sha256":"a1679135216baa49"}},{"arxiv_id":"2401.15330","arxiv_id_is_arxiv":true,"paper":"/paper/optimal-sparse-survival-trees","title":"Optimal Sparse Survival Trees","date":"2024-01-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ruizhang1996/optimal-sparse-survival-trees-public","path":"osst/model/imbalance/osdt_imb_v9.py","file_url":"https://github.com/ruizhang1996/optimal-sparse-survival-trees-public/blob/HEAD/osst/model/imbalance/osdt_imb_v9.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, ruizhang1996/optimal-sparse-survival-trees-public (NOASSERTION)","code_sha256":"3124c55e58633650","code_sha256_prefix":"3124c55e58633650","mcp_get_code":{"code_sha256":"3124c55e58633650"}},{"arxiv_id":"2304.14329","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-extrapolate-a-transductive","title":"Learning to Extrapolate: A Transductive Approach","date":"2023-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"learningmatter-mit/matex","path":"baselines/modnet/aflow_mp.py","file_url":"https://github.com/learningmatter-mit/matex/blob/HEAD/baselines/modnet/aflow_mp.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":"a26982da6e0216ef","code_sha256_prefix":"a26982da6e0216ef","mcp_get_code":{"code_sha256":"a26982da6e0216ef"}},{"arxiv_id":"2207.04997","arxiv_id_is_arxiv":true,"paper":"/paper/a-closer-look-at-invariances-in-self","title":"A Closer Look at Invariances in Self-supervised Pre-training for 3D Vision","date":"2022-07-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lilanxiao/invar3d","path":"scannet/sampler.py","file_url":"https://github.com/lilanxiao/invar3d/blob/HEAD/scannet/sampler.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":"a93412e4a677be68","code_sha256_prefix":"a93412e4a677be68","mcp_get_code":{"code_sha256":"a93412e4a677be68"}},{"arxiv_id":"2105.05226","arxiv_id_is_arxiv":true,"paper":"/paper/home-action-genome-cooperative-compositional","title":"Home Action Genome: Cooperative Compositional Action Understanding","date":"2021-05-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nishantrai18/homage","path":"process_data/src/write_csv.py","file_url":"https://github.com/nishantrai18/homage/blob/HEAD/process_data/src/write_csv.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":"9075ce1ec911ec14","code_sha256_prefix":"9075ce1ec911ec14","mcp_get_code":{"code_sha256":"9075ce1ec911ec14"}},{"arxiv_id":"2105.00956","arxiv_id_is_arxiv":true,"paper":"/paper/unignn-a-unified-framework-for-graph-and","title":"UniGNN: a Unified Framework for Graph and Hypergraph Neural Networks","date":"2021-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OneForward/UniGNN","path":"train_evolving.py","file_url":"https://github.com/OneForward/UniGNN/blob/HEAD/train_evolving.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":"b3b69434e62c6fb8","code_sha256_prefix":"b3b69434e62c6fb8","mcp_get_code":{"code_sha256":"b3b69434e62c6fb8"}},{"arxiv_id":"2105.00956","arxiv_id_is_arxiv":true,"paper":"/paper/unignn-a-unified-framework-for-graph-and","title":"UniGNN: a Unified Framework for Graph and Hypergraph Neural Networks","date":"2021-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OneForward/UniGNN","path":"train_val.py","file_url":"https://github.com/OneForward/UniGNN/blob/HEAD/train_val.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":"b965596d50610d7a","code_sha256_prefix":"b965596d50610d7a","mcp_get_code":{"code_sha256":"b965596d50610d7a"}},{"arxiv_id":"2104.08060","arxiv_id_is_arxiv":true,"paper":"/paper/meg-generating-molecular-counterfactual","title":"MEG: Generating Molecular Counterfactual Explanations for Deep Graph Networks","date":"2021-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danilonumeroso/MEG","path":"utils/data.py","file_url":"https://github.com/danilonumeroso/MEG/blob/HEAD/utils/data.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":"d26022a6dfd1f791","code_sha256_prefix":"d26022a6dfd1f791","mcp_get_code":{"code_sha256":"d26022a6dfd1f791"}},{"arxiv_id":"2008.01065","arxiv_id_is_arxiv":true,"paper":"/paper/memory-augmented-dense-predictive-coding-for","title":"Memory-augmented Dense Predictive Coding for Video Representation Learning","date":"2020-08-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TengdaHan/MemDPC","path":"process_data/src/write_csv.py","file_url":"https://github.com/TengdaHan/MemDPC/blob/HEAD/process_data/src/write_csv.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":"488a3f6281af3479","code_sha256_prefix":"488a3f6281af3479","mcp_get_code":{"code_sha256":"488a3f6281af3479"}},{"arxiv_id":"2006.08690","arxiv_id_is_arxiv":true,"paper":"/paper/generalized-optimal-sparse-decision-trees","title":"Generalized and Scalable Optimal Sparse Decision Trees","date":"2020-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhichen96/interpretable_ml_metamaterials","path":"gosdt/osdt_imb_v9.py","file_url":"https://github.com/zhichen96/interpretable_ml_metamaterials/blob/HEAD/gosdt/osdt_imb_v9.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from ruizhang1996/optimal-sparse-survival-trees-public, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"3124c55e58633650","code_sha256_prefix":"3124c55e58633650","mcp_get_code":{"code_sha256":"3124c55e58633650"}},{"arxiv_id":"1909.04656","arxiv_id_is_arxiv":true,"paper":"/paper/video-representation-learning-by-dense","title":"Video Representation Learning by Dense Predictive Coding","date":"2019-09-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TengdaHan/DPC","path":"process_data/src/write_csv.py","file_url":"https://github.com/TengdaHan/DPC/blob/HEAD/process_data/src/write_csv.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":"488a3f6281af3479","code_sha256_prefix":"488a3f6281af3479","mcp_get_code":{"code_sha256":"488a3f6281af3479"}},{"arxiv_id":"1908.07116","arxiv_id_is_arxiv":true,"paper":"/paper/protecting-neural-networks-with-hierarchical","title":"Protecting Neural Networks with Hierarchical Random Switching: Towards Better Robustness-Accuracy Trade-off for Stochastic Defenses","date":"2019-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KieranXWang/HRS","path":"block_split_config.py","file_url":"https://github.com/KieranXWang/HRS/blob/HEAD/block_split_config.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":"b595c3277f371195","code_sha256_prefix":"b595c3277f371195","mcp_get_code":{"code_sha256":"b595c3277f371195"}},{"arxiv_id":"1805.04980","arxiv_id_is_arxiv":true,"paper":"/paper/unifying-and-merging-well-trained-deep-neural","title":"Unifying and Merging Well-trained Deep Neural Networks for Inference Stage","date":"2018-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ivclab/NeuralMerger","path":"Fine-tuning/datasets/gender.py","file_url":"https://github.com/ivclab/NeuralMerger/blob/HEAD/Fine-tuning/datasets/gender.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":"35318fc2899ca955","code_sha256_prefix":"35318fc2899ca955","mcp_get_code":{"code_sha256":"35318fc2899ca955"}},{"arxiv_id":"aaai_25573","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_25573","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yixinliu233/GREET","path":"data_loader.py","file_url":"https://github.com/yixinliu233/GREET/blob/HEAD/data_loader.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":"cfb46fb9c212aa87","code_sha256_prefix":"cfb46fb9c212aa87","mcp_get_code":{"code_sha256":"cfb46fb9c212aa87"}}],"record_sha256":"8d1b060bec849c0db53aa262446a10ad289889ca6ffa8a47bfb736db981e21aa","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}