{"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/calc-metrics","entry":"calc_metrics","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":9,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":2,"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":9,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":2,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":9,"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":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":2,"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":"2607.29168","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-29168","title":"Authorship Verification of Transcribed German-Language Videos","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"Fraunhofer-SIT/WIFS2026-TranscribedGermanAV","path":"common.py","file_url":"https://github.com/Fraunhofer-SIT/WIFS2026-TranscribedGermanAV/blob/HEAD/common.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":"af822b1447bf45aa","code_sha256_prefix":"af822b1447bf45aa","mcp_get_code":{"code_sha256":"af822b1447bf45aa"}},{"arxiv_id":"2605.14888","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-14888","title":"PROCESS-2: A Benchmark Speech Corpus for Early Cognitive Impairment Detection","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"CognoSpeak/PROCESS-2","path":"codes/PROCESS2_BASELINE_LLM.py","file_url":"https://github.com/CognoSpeak/PROCESS-2/blob/HEAD/codes/PROCESS2_BASELINE_LLM.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fb6dacde90d3d10b","code_sha256_prefix":"fb6dacde90d3d10b","mcp_get_code":{"code_sha256":"fb6dacde90d3d10b"}},{"arxiv_id":"2312.10890","arxiv_id_is_arxiv":true,"paper":"/paper/low-latency-space-time-supersampling-for-real","title":"Low-latency Space-time Supersampling for Real-time Rendering","date":"2023-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ryanhe312/STSSNet-AAAI2024","path":"utils/matlab_metric.py","file_url":"https://github.com/ryanhe312/STSSNet-AAAI2024/blob/HEAD/utils/matlab_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":"aa273a27e3ac59d7","code_sha256_prefix":"aa273a27e3ac59d7","mcp_get_code":{"code_sha256":"aa273a27e3ac59d7"}},{"arxiv_id":"2310.05885","arxiv_id_is_arxiv":true,"paper":"/paper/dtpp-differentiable-joint-conditional","title":"DTPP: Differentiable Joint Conditional Prediction and Cost Evaluation for Tree Policy Planning in Autonomous Driving","date":null,"month_inferred_from_arxiv_id":"2023-10","title_source":"archive","repo":"mczhi/dtpp","path":"train_utils.py","file_url":"https://github.com/mczhi/dtpp/blob/HEAD/train_utils.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":"992910bad800e5b8","code_sha256_prefix":"992910bad800e5b8","mcp_get_code":{"code_sha256":"992910bad800e5b8"}},{"arxiv_id":"2309.12253","arxiv_id_is_arxiv":true,"paper":"/paper/salsa-clrs-a-sparse-and-scalable-benchmark","title":"SALSA-CLRS: A Sparse and Scalable Benchmark for Algorithmic Reasoning","date":"2023-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jkminder/salsa-clrs","path":"baselines/core/metrics.py","file_url":"https://github.com/jkminder/salsa-clrs/blob/HEAD/baselines/core/metrics.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":"f241688601e43b20","code_sha256_prefix":"f241688601e43b20","mcp_get_code":{"code_sha256":"f241688601e43b20"}},{"arxiv_id":"2307.07002","arxiv_id_is_arxiv":true,"paper":"/paper/classical-out-of-distribution-detection","title":"Classical Out-of-Distribution Detection Methods Benchmark in Text Classification Tasks","date":"2023-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mateuszbaransanok/TrustworthyAI","path":"trustworthyai/utils/metrics.py","file_url":"https://github.com/mateuszbaransanok/TrustworthyAI/blob/HEAD/trustworthyai/utils/metrics.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, mateuszbaransanok/TrustworthyAI when it was checked","code_sha256":"a356e503fd42cd9a","code_sha256_prefix":"a356e503fd42cd9a","mcp_get_code":{"code_sha256":"a356e503fd42cd9a"}},{"arxiv_id":"2307.02028","arxiv_id_is_arxiv":true,"paper":"/paper/ehrshot-an-ehr-benchmark-for-few-shot-1","title":"EHRSHOT: An EHR Benchmark for Few-Shot Evaluation of Foundation Models","date":"2023-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"som-shahlab/ehrshot-benchmark","path":"ehrshot/7b_eval_zero_shot.py","file_url":"https://github.com/som-shahlab/ehrshot-benchmark/blob/HEAD/ehrshot/7b_eval_zero_shot.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":"e387d3515af3e462","code_sha256_prefix":"e387d3515af3e462","mcp_get_code":{"code_sha256":"e387d3515af3e462"}},{"arxiv_id":"2306.06955","arxiv_id_is_arxiv":true,"paper":"/paper/a-brief-review-of-hypernetworks-in-deep","title":"A Brief Review of Hypernetworks in Deep Learning","date":"2023-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jmdvinodjmd/HyperITE","path":"src/utils.py","file_url":"https://github.com/jmdvinodjmd/HyperITE/blob/HEAD/src/utils.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":"b96b4b3c56d7f938","code_sha256_prefix":"b96b4b3c56d7f938","mcp_get_code":{"code_sha256":"b96b4b3c56d7f938"}},{"arxiv_id":"2002.08772","arxiv_id_is_arxiv":true,"paper":"/paper/set2graph-learning-graphs-from-sets","title":"Set2Graph: Learning Graphs From Sets","date":"2020-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hadarser/SetToGraphPaper","path":"main_scripts/main_jets.py","file_url":"https://github.com/hadarser/SetToGraphPaper/blob/HEAD/main_scripts/main_jets.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3979bb6a4cc7dc13","code_sha256_prefix":"3979bb6a4cc7dc13","mcp_get_code":{"code_sha256":"3979bb6a4cc7dc13"}}],"record_sha256":"9f4a51823a96c20a5fbef72c1b86e75b3fa87453f1af5aff6fd49276f21e37a5","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}