{"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","entry":"calculate","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":13,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":7,"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":13,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":6,"n_samples_fingerprinted":1,"n_places":14,"n_places_pointer_only":4,"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":0,"ran":6,"unverified":6},"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":"2602.19531","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-19531","title":"A Statistical Approach for Modeling Irregular Multivariate Time Series with Missing Observations","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"YerevaNN/mimic3-benchmarks","path":"mimic3models/feature_extractor.py","file_url":"https://github.com/YerevaNN/mimic3-benchmarks/blob/HEAD/mimic3models/feature_extractor.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":"faa1e84a0a25b341","code_sha256_prefix":"faa1e84a0a25b341","mcp_get_code":{"code_sha256":"faa1e84a0a25b341"}},{"arxiv_id":"2510.12110","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-12110","title":"Deep Associations, High Creativity: A Simple yet Effective Metric for Evaluating Large Language Models","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"ziliang6/PACE","path":"src/association_calculate_model.py","file_url":"https://github.com/ziliang6/PACE/blob/HEAD/src/association_calculate_model.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":"f8ee4a05dbab4e99","code_sha256_prefix":"f8ee4a05dbab4e99","mcp_get_code":{"code_sha256":"f8ee4a05dbab4e99"}},{"arxiv_id":"2505.05195","arxiv_id_is_arxiv":true,"paper":"/paper/concept-based-unsupervised-domain-adaptation","title":"Concept-Based Unsupervised Domain Adaptation","date":"2025-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xmed-lab/CUDA","path":"analysis/a_distance.py","file_url":"https://github.com/xmed-lab/CUDA/blob/HEAD/analysis/a_distance.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":"687e10b619fffd63","code_sha256_prefix":"687e10b619fffd63","mcp_get_code":{"code_sha256":"687e10b619fffd63"}},{"arxiv_id":"2410.04521","arxiv_id_is_arxiv":true,"paper":"/paper/mc-cot-a-modular-collaborative-cot-framework","title":"MC-CoT: A Modular Collaborative CoT Framework for Zero-shot Medical-VQA with LLM and MLLM Integration","date":"2024-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thomaswei-cn/MC-CoT","path":"evaluation/eval_recall.py","file_url":"https://github.com/thomaswei-cn/MC-CoT/blob/HEAD/evaluation/eval_recall.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, thomaswei-cn/MC-CoT when it was checked","code_sha256":"6b92bbd5846da32b","code_sha256_prefix":"6b92bbd5846da32b","mcp_get_code":{"code_sha256":"6b92bbd5846da32b"}},{"arxiv_id":"2406.12284","arxiv_id_is_arxiv":true,"paper":"/paper/demystifying-the-recency-heuristic-in","title":"Demystifying the Recency Heuristic in Temporal-Difference Learning","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brett-daley/recency-heuristic","path":"learning/return_estimators.py","file_url":"https://github.com/brett-daley/recency-heuristic/blob/HEAD/learning/return_estimators.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, brett-daley/recency-heuristic when it was checked","code_sha256":"12cca2249119d079","code_sha256_prefix":"12cca2249119d079","mcp_get_code":{"code_sha256":"12cca2249119d079"}},{"arxiv_id":"2406.01549","arxiv_id_is_arxiv":true,"paper":"/paper/an-information-bottleneck-perspective-for","title":"An Information Bottleneck Perspective for Effective Noise Filtering on Retrieval-Augmented Generation","date":"2024-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhukun1020/noisefilter_ib","path":"Info_Bottle.py","file_url":"https://github.com/zhukun1020/noisefilter_ib/blob/HEAD/Info_Bottle.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, zhukun1020/noisefilter_ib when it was checked","code_sha256":"3d877a67b69fead5","code_sha256_prefix":"3d877a67b69fead5","mcp_get_code":{"code_sha256":"3d877a67b69fead5"}},{"arxiv_id":"2204.00987","arxiv_id_is_arxiv":true,"paper":"/paper/binsformer-revisiting-adaptive-bins-for","title":"BinsFormer: Revisiting Adaptive Bins for Monocular Depth Estimation","date":"2022-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhyever/monocular-depth-estimation-toolbox","path":"depth/core/evaluation/metrics.py","file_url":"https://github.com/zhyever/monocular-depth-estimation-toolbox/blob/HEAD/depth/core/evaluation/metrics.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":"0d757a05c5b90822","code_sha256_prefix":"0d757a05c5b90822","mcp_get_code":{"code_sha256":"0d757a05c5b90822"}},{"arxiv_id":"2203.11819","arxiv_id_is_arxiv":true,"paper":"/paper/a-broad-study-of-pre-training-for-domain","title":"A Broad Study of Pre-training for Domain Generalization and Adaptation","date":"2022-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VisionLearningGroup/Benchmark_Domain_Transfer","path":"utils/analysis/a_distance.py","file_url":"https://github.com/VisionLearningGroup/Benchmark_Domain_Transfer/blob/HEAD/utils/analysis/a_distance.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":"63d6af78700f6500","code_sha256_prefix":"63d6af78700f6500","mcp_get_code":{"code_sha256":"63d6af78700f6500"}},{"arxiv_id":"1810.04805","arxiv_id_is_arxiv":true,"paper":"/paper/bert-pre-training-of-deep-bidirectional","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","date":"2018-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haydlite/sparse-bert-ner","path":"metrics.py","file_url":"https://github.com/haydlite/sparse-bert-ner/blob/HEAD/metrics.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":"8cbcf76f3222a300","code_sha256_prefix":"8cbcf76f3222a300","mcp_get_code":{"code_sha256":"8cbcf76f3222a300"}},{"arxiv_id":"1805.12076","arxiv_id_is_arxiv":true,"paper":"/paper/towards-understanding-the-role-of-over","title":"Towards Understanding the Role of Over-Parametrization in Generalization of Neural Networks","date":"2018-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bneyshabur/over-parametrization","path":"measures.py","file_url":"https://github.com/bneyshabur/over-parametrization/blob/HEAD/measures.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, bneyshabur/over-parametrization when it was checked","code_sha256":"eb36850fb9092242","code_sha256_prefix":"eb36850fb9092242","mcp_get_code":{"code_sha256":"eb36850fb9092242"}},{"arxiv_id":"1703.07771","arxiv_id_is_arxiv":true,"paper":"/paper/multitask-learning-and-benchmarking-with","title":"Multitask learning and benchmarking with clinical time series data","date":"2017-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Dongximing/Mimic3","path":"mimic3models/feature_extractor.py","file_url":"https://github.com/Dongximing/Mimic3/blob/HEAD/mimic3models/feature_extractor.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":"faa1e84a0a25b341","code_sha256_prefix":"faa1e84a0a25b341","mcp_get_code":{"code_sha256":"faa1e84a0a25b341"}},{"arxiv_id":"1703.07771","arxiv_id_is_arxiv":true,"paper":"/paper/multitask-learning-and-benchmarking-with","title":"Multitask learning and benchmarking with clinical time series data","date":"2017-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zzzace2000/mimic-preprocess","path":"mimic3models/feature_extractor.py","file_url":"https://github.com/zzzace2000/mimic-preprocess/blob/HEAD/mimic3models/feature_extractor.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":"53c6097a0fd76435","code_sha256_prefix":"53c6097a0fd76435","mcp_get_code":{"code_sha256":"53c6097a0fd76435"}},{"arxiv_id":"2025.findings-acl.1183","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.findings-acl.1183","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"thunlp/TritonBench","path":"EVAL/eval_G/2_efficiency.py","file_url":"https://github.com/thunlp/TritonBench/blob/HEAD/EVAL/eval_G/2_efficiency.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":"6c5603b32e76815a","code_sha256_prefix":"6c5603b32e76815a","mcp_get_code":{"code_sha256":"6c5603b32e76815a"}},{"arxiv_id":"136720506","arxiv_id_is_arxiv":false,"paper":null,"title":"id 136720506 (not an arXiv id)","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"YuchenLiu98/ECCV2022-SDA-FAS","path":"SDA-FAS/utils/statistic.py","file_url":"https://github.com/YuchenLiu98/ECCV2022-SDA-FAS/blob/HEAD/SDA-FAS/utils/statistic.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":"3a3a83a1a3f2053f","code_sha256_prefix":"3a3a83a1a3f2053f","mcp_get_code":{"code_sha256":"3a3a83a1a3f2053f"}}],"record_sha256":"d510250e1748e7ea6e2fa41fe40d59bc5f0dfc6d95270c191ae2ef7256d3893e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}