{"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/calc-accuracy","entry":"calc_accuracy","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":14,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":9,"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":11,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":1,"n_samples_unverified":4,"n_samples_fingerprinted":2,"n_places":14,"n_places_pointer_only":5,"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":0,"ran_fixture":1,"ran":5,"unverified":4},"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":"2608.10042","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-10042","title":"UserToolBench: A User-Profile-Hidden Benchmark for Personalized Decision Making in Tool-Use LLMs","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"xxy212/UserToolBench","path":"utb/evaluation/wtb/eval_runner.py","file_url":"https://github.com/xxy212/UserToolBench/blob/HEAD/utb/evaluation/wtb/eval_runner.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, xxy212/UserToolBench when it was checked","code_sha256":"529f98bd3b1e03f2","code_sha256_prefix":"529f98bd3b1e03f2","mcp_get_code":{"code_sha256":"529f98bd3b1e03f2"}},{"arxiv_id":"2505.22389","arxiv_id_is_arxiv":true,"paper":"/paper/train-with-perturbation-infer-after-merging-a","title":"Train with Perturbation, Infer after Merging: A Two-Stage Framework for Continual Learning","date":"2025-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qhmiao/P-M-for-Continual-Learning","path":"utils/misc.py","file_url":"https://github.com/qhmiao/P-M-for-Continual-Learning/blob/HEAD/utils/misc.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":"971c46b0aa73eb28","code_sha256_prefix":"971c46b0aa73eb28","mcp_get_code":{"code_sha256":"971c46b0aa73eb28"}},{"arxiv_id":"2502.20704","arxiv_id_is_arxiv":true,"paper":"/paper/fuzzy-speculative-decoding-for-a-tunable","title":"Fuzzy Speculative Decoding for a Tunable Accuracy-Runtime Tradeoff","date":"2025-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maxholsman/fsd","path":"csqa_eval_example.py","file_url":"https://github.com/maxholsman/fsd/blob/HEAD/csqa_eval_example.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, maxholsman/fsd when it was checked","code_sha256":"92f93f96f83d7a87","code_sha256_prefix":"92f93f96f83d7a87","mcp_get_code":{"code_sha256":"92f93f96f83d7a87"}},{"arxiv_id":"2412.10504","arxiv_id_is_arxiv":true,"paper":"/paper/aspen-open-jets-unlocking-lhc-data-for","title":"Aspen Open Jets: Unlocking LHC Data for Foundation Models in Particle Physics","date":"2024-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uhh-pd-ml/omnijet_alpha","path":"gabbro/metrics/utils.py","file_url":"https://github.com/uhh-pd-ml/omnijet_alpha/blob/HEAD/gabbro/metrics/utils.py","status":"ran","verification_level":1,"contract_check":null,"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, uhh-pd-ml/omnijet_alpha when it was checked","code_sha256":"3f9c6aeac2a8c7f6","code_sha256_prefix":"3f9c6aeac2a8c7f6","mcp_get_code":{"code_sha256":"3f9c6aeac2a8c7f6"}},{"arxiv_id":"2406.05658","arxiv_id_is_arxiv":true,"paper":"/paper/visual-prompt-tuning-in-null-space-for","title":"Visual Prompt Tuning in Null Space for Continual Learning","date":"2024-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zugexiaodui/VPTinNSforCL","path":"utils/misc.py","file_url":"https://github.com/zugexiaodui/VPTinNSforCL/blob/HEAD/utils/misc.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":"971c46b0aa73eb28","code_sha256_prefix":"971c46b0aa73eb28","mcp_get_code":{"code_sha256":"971c46b0aa73eb28"}},{"arxiv_id":"2402.09303","arxiv_id_is_arxiv":true,"paper":"/paper/immediate-generalisation-in-humans-but-a","title":"Comparing supervised learning dynamics: Deep neural networks match human data efficiency but show a generalisation lag","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wichmann-lab/supervised-learning-dynamics","path":"analysis/utils/analyses.py","file_url":"https://github.com/wichmann-lab/supervised-learning-dynamics/blob/HEAD/analysis/utils/analyses.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, wichmann-lab/supervised-learning-dynamics when it was checked","code_sha256":"b15d046ac1514495","code_sha256_prefix":"b15d046ac1514495","mcp_get_code":{"code_sha256":"b15d046ac1514495"}},{"arxiv_id":"2402.09050","arxiv_id_is_arxiv":true,"paper":"/paper/end-to-end-training-induces-information","title":"End-to-End Training Induces Information Bottleneck through Layer-Role Differentiation: A Comparative Analysis with Layer-wise Training","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"keitaroskmt/e2e-info","path":"main_ff.py","file_url":"https://github.com/keitaroskmt/e2e-info/blob/HEAD/main_ff.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, keitaroskmt/e2e-info when it was checked","code_sha256":"6a41b002f7083cee","code_sha256_prefix":"6a41b002f7083cee","mcp_get_code":{"code_sha256":"6a41b002f7083cee"}},{"arxiv_id":"2304.08028","arxiv_id_is_arxiv":true,"paper":"/paper/mmanet-margin-aware-distillation-and-modality","title":"MMANet: Margin-aware Distillation and Modality-aware Regularization for Incomplete Multimodal Learning","date":"2023-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shicaiwei123/mmanet","path":"classification/lib/model_develop_utils.py","file_url":"https://github.com/shicaiwei123/mmanet/blob/HEAD/classification/lib/model_develop_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":"cabd997ca3e75a0c","code_sha256_prefix":"cabd997ca3e75a0c","mcp_get_code":{"code_sha256":"cabd997ca3e75a0c"}},{"arxiv_id":"2211.09224","arxiv_id_is_arxiv":true,"paper":"/paper/are-we-certain-it-s-anomalous","title":"Are we certain it's anomalous?","date":"2022-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aleflabo/HypAD","path":"hyperspace/utils.py","file_url":"https://github.com/aleflabo/HypAD/blob/HEAD/hyperspace/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d09bfd0a1223d58a","code_sha256_prefix":"d09bfd0a1223d58a","mcp_get_code":{"code_sha256":"d09bfd0a1223d58a"}},{"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":"utils/utils.py","file_url":"https://github.com/TengdaHan/MemDPC/blob/HEAD/utils/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d09bfd0a1223d58a","code_sha256_prefix":"d09bfd0a1223d58a","mcp_get_code":{"code_sha256":"d09bfd0a1223d58a"}},{"arxiv_id":"2006.04292","arxiv_id_is_arxiv":true,"paper":"/paper/achieving-equalized-odds-by-resampling","title":"Achieving Equalized Odds by Resampling Sensitive Attributes","date":"2020-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yromano/fair_dummies","path":"fair_dummies/utility_functions.py","file_url":"https://github.com/yromano/fair_dummies/blob/HEAD/fair_dummies/utility_functions.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":"155d81bdb4a2fc74","code_sha256_prefix":"155d81bdb4a2fc74","mcp_get_code":{"code_sha256":"155d81bdb4a2fc74"}},{"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":"utils/utils.py","file_url":"https://github.com/TengdaHan/DPC/blob/HEAD/utils/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d09bfd0a1223d58a","code_sha256_prefix":"d09bfd0a1223d58a","mcp_get_code":{"code_sha256":"d09bfd0a1223d58a"}},{"arxiv_id":"1907.04809","arxiv_id_is_arxiv":true,"paper":"/paper/variational-autoencoders-and-nonlinear-ica-a","title":"Variational Autoencoders and Nonlinear ICA: A Unifying Framework","date":"2019-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ilkhem/ivae","path":"models/tcl/tcl_eval.py","file_url":"https://github.com/ilkhem/ivae/blob/HEAD/models/tcl/tcl_eval.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":"9b26734cdfd6df16","code_sha256_prefix":"9b26734cdfd6df16","mcp_get_code":{"code_sha256":"9b26734cdfd6df16"}},{"arxiv_id":"1904.06387","arxiv_id_is_arxiv":true,"paper":"/paper/extrapolating-beyond-suboptimal","title":"Extrapolating Beyond Suboptimal Demonstrations via Inverse Reinforcement Learning from Observations","date":"2019-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hiwonjoon/ICML2019-TREX","path":"atari/LearnAtariMTurkRankings.py","file_url":"https://github.com/hiwonjoon/ICML2019-TREX/blob/HEAD/atari/LearnAtariMTurkRankings.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":"e5de5dc1ff3645df","code_sha256_prefix":"e5de5dc1ff3645df","mcp_get_code":{"code_sha256":"e5de5dc1ff3645df"}}],"record_sha256":"e2d4ec1d5fc9a55920e1171a79fdf329771c2d6f2a46083962215eb09c3d0942","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}