{"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/error","entry":"error","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":16,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":4,"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":11,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":4,"n_samples_unverified":5,"n_samples_fingerprinted":5,"n_places":16,"n_places_pointer_only":6,"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":3,"ran":7,"unverified":5},"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":"2408.05148","arxiv_id_is_arxiv":true,"paper":"/paper/impacts-of-floating-point-non-associativity","title":"Impacts of floating-point non-associativity on reproducibility for HPC and deep learning applications","date":"2024-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minnervva/correctness","path":"codes/test-suite/scaffold.py","file_url":"https://github.com/minnervva/correctness/blob/HEAD/codes/test-suite/scaffold.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, minnervva/correctness when it was checked","code_sha256":"e1af5393c12652ab","code_sha256_prefix":"e1af5393c12652ab","mcp_get_code":{"code_sha256":"e1af5393c12652ab"}},{"arxiv_id":"2405.16325","arxiv_id_is_arxiv":true,"paper":"/paper/slope-double-pruned-sparse-plus-lazy-low-rank","title":"SLoPe: Double-Pruned Sparse Plus Lazy Low-Rank Adapter Pretraining of LLMs","date":"2024-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Mohammad-Mozaffari/slope","path":"slope/utils.py","file_url":"https://github.com/Mohammad-Mozaffari/slope/blob/HEAD/slope/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, Mohammad-Mozaffari/slope when it was checked","code_sha256":"dcce7bf66b0c8b73","code_sha256_prefix":"dcce7bf66b0c8b73","mcp_get_code":{"code_sha256":"dcce7bf66b0c8b73"}},{"arxiv_id":"2310.20581","arxiv_id_is_arxiv":true,"paper":"/paper/stochastic-gradient-descent-for-gaussian","title":"Stochastic Gradient Descent for Gaussian Processes Done Right","date":"2023-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cambridge-mlg/sgd-gp","path":"scalable_gps/linear_model.py","file_url":"https://github.com/cambridge-mlg/sgd-gp/blob/HEAD/scalable_gps/linear_model.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":"e0776f5f9f8da068","code_sha256_prefix":"e0776f5f9f8da068","mcp_get_code":{"code_sha256":"e0776f5f9f8da068"}},{"arxiv_id":"2310.18910","arxiv_id_is_arxiv":true,"paper":"/paper/instant-semi-supervised-learning-with","title":"InstanT: Semi-supervised Learning with Instance-dependent Thresholds","date":"2023-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmllab/2023_NeurIPS_InstanT","path":"semilearn/algorithms/instant/utils.py","file_url":"https://github.com/tmllab/2023_NeurIPS_InstanT/blob/HEAD/semilearn/algorithms/instant/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":"51c251b61229e788","code_sha256_prefix":"51c251b61229e788","mcp_get_code":{"code_sha256":"51c251b61229e788"}},{"arxiv_id":"2305.09235","arxiv_id_is_arxiv":true,"paper":"/paper/synthetic-data-real-errors-how-not-to-publish","title":"Synthetic data, real errors: how (not) to publish and use synthetic data","date":"2023-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bvanbreugel/deep_generative_ensemble","path":"DGE_utils.py","file_url":"https://github.com/bvanbreugel/deep_generative_ensemble/blob/HEAD/DGE_utils.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, bvanbreugel/deep_generative_ensemble when it was checked","code_sha256":"b253c16de5b20700","code_sha256_prefix":"b253c16de5b20700","mcp_get_code":{"code_sha256":"b253c16de5b20700"}},{"arxiv_id":"2302.02169","arxiv_id_is_arxiv":true,"paper":"/paper/how-many-and-which-training-points-would-need","title":"How Many and Which Training Points Would Need to be Removed to Flip this Prediction?","date":"2023-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ecielyang/smallest_set","path":"recursive.py","file_url":"https://github.com/ecielyang/smallest_set/blob/HEAD/recursive.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ecielyang/smallest_set when it was checked","code_sha256":"51f77e4457107d04","code_sha256_prefix":"51f77e4457107d04","mcp_get_code":{"code_sha256":"51f77e4457107d04"}},{"arxiv_id":"2110.06282","arxiv_id_is_arxiv":true,"paper":"/paper/the-rich-get-richer-disparate-impact-of-semi-1","title":"The Rich Get Richer: Disparate Impact of Semi-Supervised Learning","date":"2021-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucsc-real/disparate-ssl","path":"plot_c100.py","file_url":"https://github.com/ucsc-real/disparate-ssl/blob/HEAD/plot_c100.py","status":"unverified","verification_level":0,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3426b3cc1bedc32b","code_sha256_prefix":"3426b3cc1bedc32b","mcp_get_code":{"code_sha256":"3426b3cc1bedc32b"}},{"arxiv_id":"2108.13679","arxiv_id_is_arxiv":true,"paper":"/paper/task-oriented-dialogue-system-as-natural","title":"Task-Oriented Dialogue System as Natural Language Generation","date":"2021-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"victorwz/tod_as_nlg","path":"Convlab/convlab/lib/logger.py","file_url":"https://github.com/victorwz/tod_as_nlg/blob/HEAD/Convlab/convlab/lib/logger.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":"638bf85c03a64f0d","code_sha256_prefix":"638bf85c03a64f0d","mcp_get_code":{"code_sha256":"638bf85c03a64f0d"}},{"arxiv_id":"2012.08950","arxiv_id_is_arxiv":true,"paper":"/paper/deep-reinforcement-learning-of-graph-matching","title":"Revocable Deep Reinforcement Learning with Affinity Regularization for Outlier-Robust Graph Matching","date":"2020-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thinklab-sjtu/rgm","path":"dqn_model_r.py","file_url":"https://github.com/thinklab-sjtu/rgm/blob/HEAD/dqn_model_r.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, thinklab-sjtu/rgm when it was checked","code_sha256":"e9fa3a13b7a2637f","code_sha256_prefix":"e9fa3a13b7a2637f","mcp_get_code":{"code_sha256":"e9fa3a13b7a2637f"}},{"arxiv_id":"2011.14880","arxiv_id_is_arxiv":true,"paper":"/paper/occlusion-guided-scene-flow-estimation-on-3d","title":"Occlusion Guided Scene Flow Estimation on 3D Point Clouds","date":"2020-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BillOuyang/OGSFNet","path":"evaluate.py","file_url":"https://github.com/BillOuyang/OGSFNet/blob/HEAD/evaluate.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, BillOuyang/OGSFNet when it was checked","code_sha256":"1870d894309f38e9","code_sha256_prefix":"1870d894309f38e9","mcp_get_code":{"code_sha256":"1870d894309f38e9"}},{"arxiv_id":"1912.12482","arxiv_id_is_arxiv":true,"paper":"/paper/slm-lab-a-comprehensive-benchmark-and-modular-1","title":"SLM Lab: A Comprehensive Benchmark and Modular Software Framework for Reproducible Deep Reinforcement Learning","date":"2019-12-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kengz/SLM-Lab","path":"slm_lab/lib/logger.py","file_url":"https://github.com/kengz/SLM-Lab/blob/HEAD/slm_lab/lib/logger.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":"ac80a904d8e853b1","code_sha256_prefix":"ac80a904d8e853b1","mcp_get_code":{"code_sha256":"ac80a904d8e853b1"}},{"arxiv_id":"1911.02357","arxiv_id_is_arxiv":true,"paper":"/paper/uninformed-students-student-teacher-anomaly","title":"Uninformed Students: Student-Teacher Anomaly Detection with Discriminative Latent Embeddings","date":"2019-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LuyaooChen/uninformed-students-pytorch","path":"evaluate.py","file_url":"https://github.com/LuyaooChen/uninformed-students-pytorch/blob/HEAD/evaluate.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"90288aa22857bfaf","code_sha256_prefix":"90288aa22857bfaf","mcp_get_code":{"code_sha256":"90288aa22857bfaf"}},{"arxiv_id":"1910.06262","arxiv_id_is_arxiv":true,"paper":"/paper/restoring-ancient-text-using-deep-learning-a","title":"Restoring ancient text using deep learning: a case study on Greek epigraphy","date":"2019-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sommerschield/ancient-text-restoration","path":"pythia/model/loss.py","file_url":"https://github.com/sommerschield/ancient-text-restoration/blob/HEAD/pythia/model/loss.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":"1da3e2dd45219cde","code_sha256_prefix":"1da3e2dd45219cde","mcp_get_code":{"code_sha256":"1da3e2dd45219cde"}},{"arxiv_id":"1906.04933","arxiv_id_is_arxiv":true,"paper":"/paper/non-parametric-calibration-for-classification","title":"Non-Parametric Calibration for Classification","date":"2019-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JonathanWenger/pycalib","path":"pycalib/scoring.py","file_url":"https://github.com/JonathanWenger/pycalib/blob/HEAD/pycalib/scoring.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":"187e9f7c92123922","code_sha256_prefix":"187e9f7c92123922","mcp_get_code":{"code_sha256":"187e9f7c92123922"}},{"arxiv_id":"ijcai2025_0949","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2025_0949","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"RDLLab/pomdp-py-porpp","path":"pomdp_py/utils/typ.py","file_url":"https://github.com/RDLLab/pomdp-py-porpp/blob/HEAD/pomdp_py/utils/typ.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":"923323df81e1a87d","code_sha256_prefix":"923323df81e1a87d","mcp_get_code":{"code_sha256":"923323df81e1a87d"}},{"arxiv_id":"2024.findings-acl.347","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.findings-acl.347","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"dtamayo-nlp/MEMAT","path":"Figure_9.py","file_url":"https://github.com/dtamayo-nlp/MEMAT/blob/HEAD/Figure_9.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":"071b2ae40fd43b0c","code_sha256_prefix":"071b2ae40fd43b0c","mcp_get_code":{"code_sha256":"071b2ae40fd43b0c"}}],"record_sha256":"85b955c58ac537d4459eb624c0fecea47cb294a4d01cfd9e4b7d763fbd48fce5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}