{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/calc-func","entry":"calc_func","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":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":6,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":4},"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":"2410.11820","paper":"/paper/adaptive-data-optimization-dynamic-sample","title":"Adaptive Data Optimization: Dynamic Sample Selection with Scaling Laws","date":"2024-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eth-easl/mixtera","path":"mixtera_integrationtests/utils.py","file_url":"https://github.com/eth-easl/mixtera/blob/HEAD/mixtera_integrationtests/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2d3d99ed392e678e","mcp_get_code":{"code_sha256":"2d3d99ed392e678e"}},{"arxiv_id":"2311.11202","paper":"/paper/unmasking-and-improving-data-credibility-a","title":"Unmasking and Improving Data Credibility: A Study with Datasets for Training Harmless Language Models","date":"2023-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"docta-ai/docta","path":"docta/core/hoc.py","file_url":"https://github.com/docta-ai/docta/blob/HEAD/docta/core/hoc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"74db7fb95cfa89aa","mcp_get_code":{"code_sha256":"74db7fb95cfa89aa"}},{"arxiv_id":"2311.11202","paper":"/paper/unmasking-and-improving-data-credibility-a","title":"Unmasking and Improving Data Credibility: A Study with Datasets for Training Harmless Language Models","date":"2023-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Docta-ai/docta","path":"docta/core/hoc.py","file_url":"https://github.com/Docta-ai/docta/blob/HEAD/docta/core/hoc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"1bd3269708552425","mcp_get_code":{"code_sha256":"1bd3269708552425"}},{"arxiv_id":"2202.01273","paper":"/paper/beyond-images-label-noise-transition-matrix","title":"Beyond Images: Label Noise Transition Matrix Estimation for Tasks with Lower-Quality Features","date":"2022-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucsc-real/beyondimages","path":"hoc.py","file_url":"https://github.com/ucsc-real/beyondimages/blob/HEAD/hoc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"95864ec98b0352e1","mcp_get_code":{"code_sha256":"95864ec98b0352e1"}},{"arxiv_id":"2110.06283","paper":"/paper/a-good-representation-detects-noisy-labels-1","title":"Detecting Corrupted Labels Without Training a Model to Predict","date":"2021-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucsc-real/simirep","path":"hoc.py","file_url":"https://github.com/ucsc-real/simirep/blob/HEAD/hoc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"0c0ad9290383617a","mcp_get_code":{"code_sha256":"0c0ad9290383617a"}},{"arxiv_id":"2102.05291","paper":"/paper/clusterability-as-an-alternative-to-anchor","title":"Clusterability as an Alternative to Anchor Points When Learning with Noisy Labels","date":"2021-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhaoweiZhu1995/HOC","path":"hoc.py","file_url":"https://github.com/ZhaoweiZhu1995/HOC/blob/HEAD/hoc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f388201005d0b814","mcp_get_code":{"code_sha256":"f388201005d0b814"}}]}