{"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-groups","entry":"get_groups","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":12,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":7,"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":11,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":2,"n_places":12,"n_places_pointer_only":1,"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":2,"ran_fixture":0,"ran":6,"unverified":2},"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":"2607.02956","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-02956","title":"MORE: A Multilingual Document Parsing Benchmark and Evaluation","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"zimoqingfeng/MORE","path":"metrics/cal_metric.py","file_url":"https://github.com/zimoqingfeng/MORE/blob/HEAD/metrics/cal_metric.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":"3e418b81ad6bb2c4","code_sha256_prefix":"3e418b81ad6bb2c4","mcp_get_code":{"code_sha256":"3e418b81ad6bb2c4"}},{"arxiv_id":"2606.20461","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-20461","title":"Data Bias Mitigation under Coverage Constraints & The Price of Fairness","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"bscarone/data-bias-coverage","path":"bias_coverage_utils.py","file_url":"https://github.com/bscarone/data-bias-coverage/blob/HEAD/bias_coverage_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7fce169d428880e9","code_sha256_prefix":"7fce169d428880e9","mcp_get_code":{"code_sha256":"7fce169d428880e9"}},{"arxiv_id":"2501.00321","arxiv_id_is_arxiv":true,"paper":"/paper/ocrbench-v2-an-improved-benchmark-for","title":"OCRBench v2: An Improved Benchmark for Evaluating Large Multimodal Models on Visual Text Localization and Reasoning","date":"2024-12-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuliang-liu/multimodalocr","path":"MDPBench/metrics/cal_metric.py","file_url":"https://github.com/yuliang-liu/multimodalocr/blob/HEAD/MDPBench/metrics/cal_metric.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":"3e418b81ad6bb2c4","code_sha256_prefix":"3e418b81ad6bb2c4","mcp_get_code":{"code_sha256":"3e418b81ad6bb2c4"}},{"arxiv_id":"2412.07626","arxiv_id_is_arxiv":true,"paper":"/paper/omnidocbench-benchmarking-diverse-pdf","title":"OmniDocBench: Benchmarking Diverse PDF Document Parsing with Comprehensive Annotations","date":"2024-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opendatalab/OmniDocBench","path":"src/metrics/cal_metric.py","file_url":"https://github.com/opendatalab/OmniDocBench/blob/HEAD/src/metrics/cal_metric.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":"f8346cfe1dd760da","code_sha256_prefix":"f8346cfe1dd760da","mcp_get_code":{"code_sha256":"f8346cfe1dd760da"}},{"arxiv_id":"2406.13733","arxiv_id_is_arxiv":true,"paper":"/paper/you-can-t-handle-the-dirty-truth-data-centric","title":"You can't handle the (dirty) truth: Data-centric insights improve pseudo-labeling","date":"2024-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seedatnabeel/dips","path":"src/dips_selector.py","file_url":"https://github.com/seedatnabeel/dips/blob/HEAD/src/dips_selector.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":"254a0e35017d123a","code_sha256_prefix":"254a0e35017d123a","mcp_get_code":{"code_sha256":"254a0e35017d123a"}},{"arxiv_id":"2404.04518","arxiv_id_is_arxiv":true,"paper":"/paper/medianomaly-a-comparative-study-of-anomaly","title":"MedIAnomaly: A comparative study of anomaly detection in medical images","date":"2024-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"caiyu6666/medianomaly","path":"reconstruction/networks/unet.py","file_url":"https://github.com/caiyu6666/medianomaly/blob/HEAD/reconstruction/networks/unet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fdccec046e9fb69e","code_sha256_prefix":"fdccec046e9fb69e","mcp_get_code":{"code_sha256":"fdccec046e9fb69e"}},{"arxiv_id":"2312.12112","arxiv_id_is_arxiv":true,"paper":"/paper/curated-llm-synergy-of-llms-and-data-curation","title":"Curated LLM: Synergy of LLMs and Data Curation for tabular augmentation in low-data regimes","date":"2023-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vanderschaarlab/cllm","path":"src/cllm/curation.py","file_url":"https://github.com/vanderschaarlab/cllm/blob/HEAD/src/cllm/curation.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":"fd6630c30769b27c","code_sha256_prefix":"fd6630c30769b27c","mcp_get_code":{"code_sha256":"fd6630c30769b27c"}},{"arxiv_id":"2311.04076","arxiv_id_is_arxiv":true,"paper":"/paper/do-llms-exhibit-human-like-response-biases-a","title":"Do LLMs exhibit human-like response biases? A case study in survey design","date":"2023-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lindiatjuatja/biasmonkey","path":"analysis/utils.py","file_url":"https://github.com/lindiatjuatja/biasmonkey/blob/HEAD/analysis/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, lindiatjuatja/biasmonkey when it was checked","code_sha256":"0a616818ffca3445","code_sha256_prefix":"0a616818ffca3445","mcp_get_code":{"code_sha256":"0a616818ffca3445"}},{"arxiv_id":"2110.09192","arxiv_id_is_arxiv":true,"paper":"/paper/learning-optimal-conformal-classifiers-1","title":"Learning Optimal Conformal Classifiers","date":"2021-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepmind/conformal_training","path":"colab_utils.py","file_url":"https://github.com/deepmind/conformal_training/blob/HEAD/colab_utils.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":"678c8c5bb71dae99","code_sha256_prefix":"678c8c5bb71dae99","mcp_get_code":{"code_sha256":"678c8c5bb71dae99"}},{"arxiv_id":"2103.17202","arxiv_id_is_arxiv":true,"paper":"/paper/groomed-nms-grouped-mathematically","title":"GrooMeD-NMS: Grouped Mathematically Differentiable NMS for Monocular 3D Object Detection","date":"2021-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abhi1kumar/groomed_nms","path":"lib/groomed_nms.py","file_url":"https://github.com/abhi1kumar/groomed_nms/blob/HEAD/lib/groomed_nms.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"43c8ee53afde7f84","code_sha256_prefix":"43c8ee53afde7f84","mcp_get_code":{"code_sha256":"43c8ee53afde7f84"}},{"arxiv_id":"2008.11364","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-semi-supervised-federated","title":"Improving Semi-supervised Federated Learning by Reducing the Gradient Diversity of Models","date":"2020-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jhcknzzm/SSFL-Benchmarking-Semi-supervised-Federated-Learning","path":"Grad_Diff.py","file_url":"https://github.com/jhcknzzm/SSFL-Benchmarking-Semi-supervised-Federated-Learning/blob/HEAD/Grad_Diff.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":"068a61460ff86dc6","code_sha256_prefix":"068a61460ff86dc6","mcp_get_code":{"code_sha256":"068a61460ff86dc6"}},{"arxiv_id":"1603.06937","arxiv_id_is_arxiv":true,"paper":"/paper/stacked-hourglass-networks-for-human-pose","title":"Stacked Hourglass Networks for Human Pose Estimation","date":"2016-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wbenbihi/hourglasstensorflow","path":"ci/changelog.py","file_url":"https://github.com/wbenbihi/hourglasstensorflow/blob/HEAD/ci/changelog.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":"8da26b7cda8f4004","code_sha256_prefix":"8da26b7cda8f4004","mcp_get_code":{"code_sha256":"8da26b7cda8f4004"}}],"record_sha256":"e4f66ac64712fe7b692920dcdf5ac076cfbc2a21a0d73417fac7bc2966a6187e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}