{"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/calculate-f1","entry":"calculate_f1","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":0,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":6,"n_places":8,"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":5,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":0},"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":"2604.01432","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-01432","title":"Are Finer Citations Always Better? Rethinking Granularity for Attributed Generation","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"JHU-CLSP/citation-granularity","path":"evaluate_stratification.py","file_url":"https://github.com/JHU-CLSP/citation-granularity/blob/HEAD/evaluate_stratification.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, JHU-CLSP/citation-granularity when it was checked","code_sha256":"96f69f1680124fd8","code_sha256_prefix":"96f69f1680124fd8","mcp_get_code":{"code_sha256":"96f69f1680124fd8"}},{"arxiv_id":"2603.07487","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-07487","title":"A Joint Neural Baseline for Concept, Assertion, and Relation Extraction from Clinical Text","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"racerandom/JaMIE","path":"clinical_eval.py","file_url":"https://github.com/racerandom/JaMIE/blob/HEAD/clinical_eval.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, racerandom/JaMIE when it was checked","code_sha256":"12d328b2a64b0209","code_sha256_prefix":"12d328b2a64b0209","mcp_get_code":{"code_sha256":"12d328b2a64b0209"}},{"arxiv_id":"2411.17465","arxiv_id_is_arxiv":true,"paper":"/paper/showui-one-vision-language-action-model-for","title":"ShowUI: One Vision-Language-Action Model for GUI Visual Agent","date":"2024-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"showlab/showui","path":"main/eval_mind2web.py","file_url":"https://github.com/showlab/showui/blob/HEAD/main/eval_mind2web.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c3c22ae25acb9f88","code_sha256_prefix":"c3c22ae25acb9f88","mcp_get_code":{"code_sha256":"c3c22ae25acb9f88"}},{"arxiv_id":"2411.16495","arxiv_id_is_arxiv":true,"paper":"/paper/atomr-atomic-operator-empowered-large","title":"AtomR: Atomic Operator-Empowered Large Language Models for Heterogeneous Knowledge Reasoning","date":"2024-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"THU-KEG/AtomR","path":"src/calculate_metrics.py","file_url":"https://github.com/THU-KEG/AtomR/blob/HEAD/src/calculate_metrics.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, THU-KEG/AtomR when it was checked","code_sha256":"06bd0fab42352980","code_sha256_prefix":"06bd0fab42352980","mcp_get_code":{"code_sha256":"06bd0fab42352980"}},{"arxiv_id":"2312.13772","arxiv_id_is_arxiv":true,"paper":"/paper/on-task-performance-and-model-calibration","title":"On Task Performance and Model Calibration with Supervised and Self-Ensembled In-Context Learning","date":"2023-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cambridgeltl/ensembled-sicl","path":"utils/evaluator.py","file_url":"https://github.com/cambridgeltl/ensembled-sicl/blob/HEAD/utils/evaluator.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, cambridgeltl/ensembled-sicl when it was checked","code_sha256":"bdb225300bc83baa","code_sha256_prefix":"bdb225300bc83baa","mcp_get_code":{"code_sha256":"bdb225300bc83baa"}},{"arxiv_id":"2312.07000","arxiv_id_is_arxiv":true,"paper":"/paper/alignment-for-honesty","title":"Alignment for Honesty","date":"2023-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GAIR-NLP/alignment-for-honesty","path":"evaluation/utils.py","file_url":"https://github.com/GAIR-NLP/alignment-for-honesty/blob/HEAD/evaluation/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, GAIR-NLP/alignment-for-honesty when it was checked","code_sha256":"647d5f0831f57b1c","code_sha256_prefix":"647d5f0831f57b1c","mcp_get_code":{"code_sha256":"647d5f0831f57b1c"}},{"arxiv_id":"Lin_ShowUI_One_Vision-Language-Action_Model_for_GUI_Visual_Agent_CVPR_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Lin_ShowUI_One_Vision-Language-Action_Model_for_GUI_Visual_Agent_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"showlab/ShowUI","path":"main/eval_mind2web.py","file_url":"https://github.com/showlab/ShowUI/blob/HEAD/main/eval_mind2web.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c3c22ae25acb9f88","code_sha256_prefix":"c3c22ae25acb9f88","mcp_get_code":{"code_sha256":"c3c22ae25acb9f88"}},{"arxiv_id":"2025.acl-long.179","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.acl-long.179","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"RUC-NLPIR/RAG-Critic","path":"rag_error_bench/caculate_acc.py","file_url":"https://github.com/RUC-NLPIR/RAG-Critic/blob/HEAD/rag_error_bench/caculate_acc.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":"4f35f7112f7c5044","code_sha256_prefix":"4f35f7112f7c5044","mcp_get_code":{"code_sha256":"4f35f7112f7c5044"}}],"record_sha256":"1087fc34542d81d0285399838ef117638ec8196370b27618d1d11c90e3730e0f","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}