{"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/split-train-test","entry":"split_train_test","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":9,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":7,"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":9,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":3,"n_places":9,"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":1,"ran_fixture":0,"ran":6,"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":"2606.10448","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-10448","title":"Mitigating Bias in Low-SNR Financial Reinforcement Learning via Quantum Representations","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"ZeyuLIU-UST/FPQC-SAC-main","path":"fpqc_sac/repro_utils.py","file_url":"https://github.com/ZeyuLIU-UST/FPQC-SAC-main/blob/HEAD/fpqc_sac/repro_utils.py","status":"ran","verification_level":1,"contract_check":null,"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, ZeyuLIU-UST/FPQC-SAC-main (NOASSERTION)","code_sha256":"f2717776c2577d1e","code_sha256_prefix":"f2717776c2577d1e","mcp_get_code":{"code_sha256":"f2717776c2577d1e"}},{"arxiv_id":"2406.02790","arxiv_id_is_arxiv":true,"paper":"/paper/building-socially-equitable-public-models","title":"Building Socially-Equitable Public Models","date":"2024-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ren-research/socially-equitable-public-models","path":"main_dc_workload.py","file_url":"https://github.com/ren-research/socially-equitable-public-models/blob/HEAD/main_dc_workload.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"95eb53dff36c1705","code_sha256_prefix":"95eb53dff36c1705","mcp_get_code":{"code_sha256":"95eb53dff36c1705"}},{"arxiv_id":"2306.10168","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-geometry-comparing-the-temporal","title":"Beyond Geometry: Comparing the Temporal Structure of Computation in Neural Circuits with Dynamical Similarity Analysis","date":"2023-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mitchellostrow/dsa","path":"DSA/sweeps.py","file_url":"https://github.com/mitchellostrow/dsa/blob/HEAD/DSA/sweeps.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":"16779f71fd8051f6","code_sha256_prefix":"16779f71fd8051f6","mcp_get_code":{"code_sha256":"16779f71fd8051f6"}},{"arxiv_id":"2304.04183","arxiv_id_is_arxiv":true,"paper":"/paper/nearest-neighbor-sampling-based-conditional","title":"Nearest-Neighbor Sampling Based Conditional Independence Testing","date":"2023-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yanfeng-yang-0316/cdcit","path":"nnlscit.py","file_url":"https://github.com/yanfeng-yang-0316/cdcit/blob/HEAD/nnlscit.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, yanfeng-yang-0316/cdcit when it was checked","code_sha256":"aeb422e5bb499306","code_sha256_prefix":"aeb422e5bb499306","mcp_get_code":{"code_sha256":"aeb422e5bb499306"}},{"arxiv_id":"2007.04238","arxiv_id_is_arxiv":true,"paper":"/paper/predicting-the-accuracy-of-a-few-shot","title":"Predicting the Accuracy of a Few-Shot Classifier","date":"2020-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mbonto/fewshot_generalization","path":"case_study_toolbox/loaders.py","file_url":"https://github.com/mbonto/fewshot_generalization/blob/HEAD/case_study_toolbox/loaders.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":"b8616787a1c2279e","code_sha256_prefix":"b8616787a1c2279e","mcp_get_code":{"code_sha256":"b8616787a1c2279e"}},{"arxiv_id":"1906.12330","arxiv_id_is_arxiv":true,"paper":"/paper/graph-star-net-for-generalized-multi-task-1","title":"Graph Star Net for Generalized Multi-Task Learning","date":"2019-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"graph-star-team/graph_star","path":"utils/create_text_graph.py","file_url":"https://github.com/graph-star-team/graph_star/blob/HEAD/utils/create_text_graph.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":"378ae7e2907239c5","code_sha256_prefix":"378ae7e2907239c5","mcp_get_code":{"code_sha256":"378ae7e2907239c5"}},{"arxiv_id":"1906.03526","arxiv_id_is_arxiv":true,"paper":"/paper/provably-robust-boosted-decision-stumps-and","title":"Provably Robust Boosted Decision Stumps and Trees against Adversarial Attacks","date":"2019-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"max-andr/provably-robust-boosting","path":"data.py","file_url":"https://github.com/max-andr/provably-robust-boosting/blob/HEAD/data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9ecc4a0f8c651c2d","code_sha256_prefix":"9ecc4a0f8c651c2d","mcp_get_code":{"code_sha256":"9ecc4a0f8c651c2d"}},{"arxiv_id":"1811.02798","arxiv_id_is_arxiv":true,"paper":"/paper/multi-task-graph-autoencoders","title":"Multi-Task Graph Autoencoders","date":"2018-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vuptran/graph-representation-learning","path":"longae/utils.py","file_url":"https://github.com/vuptran/graph-representation-learning/blob/HEAD/longae/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":"b5a670bde4ab55d0","code_sha256_prefix":"b5a670bde4ab55d0","mcp_get_code":{"code_sha256":"b5a670bde4ab55d0"}},{"arxiv_id":"1205.2618","arxiv_id_is_arxiv":true,"paper":"/paper/bpr-bayesian-personalized-ranking-from","title":"BPR: Bayesian Personalized Ranking from Implicit Feedback","date":"2012-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EternalImmortal/bpr","path":"preprocess.py","file_url":"https://github.com/EternalImmortal/bpr/blob/HEAD/preprocess.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":"2f78e267baa58c42","code_sha256_prefix":"2f78e267baa58c42","mcp_get_code":{"code_sha256":"2f78e267baa58c42"}}],"record_sha256":"7940516d0b7b31abf1d9f63a7ff1654fecffa0d3fd8acd7d7de366a3502ce8eb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}