{"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/compute-confidence","entry":"compute_confidence","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":6,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":3,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":4,"n_places":6,"n_places_pointer_only":2,"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":2,"ran":2,"unverified":1},"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.22747","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-22747","title":"Set-based v.s. Distribution-based Representations of Epistemic Uncertainty: A Comparative Study","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"DBO-DKFZ/uncertainty-benchmark","path":"src/metrics/metrics.py","file_url":"https://github.com/DBO-DKFZ/uncertainty-benchmark/blob/HEAD/src/metrics/metrics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, DBO-DKFZ/uncertainty-benchmark when it was checked","code_sha256":"19b084e416e0aaa0","code_sha256_prefix":"19b084e416e0aaa0","mcp_get_code":{"code_sha256":"19b084e416e0aaa0"}},{"arxiv_id":"2402.05457","arxiv_id_is_arxiv":true,"paper":"/paper/it-s-never-too-late-fusing-acoustic","title":"It's Never Too Late: Fusing Acoustic Information into Large Language Models for Automatic Speech Recognition","date":"2024-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Hypotheses-Paradise/UADF","path":"generate_uadf.py","file_url":"https://github.com/Hypotheses-Paradise/UADF/blob/HEAD/generate_uadf.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":"c8644d93f21cdf49","code_sha256_prefix":"c8644d93f21cdf49","mcp_get_code":{"code_sha256":"c8644d93f21cdf49"}},{"arxiv_id":"2310.05797","arxiv_id_is_arxiv":true,"paper":"/paper/are-large-language-models-post-hoc-explainers","title":"In-Context Explainers: Harnessing LLMs for Explaining Black Box Models","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AI4LIFE-GROUP/LLM_Explainer","path":"llms/icl.py","file_url":"https://github.com/AI4LIFE-GROUP/LLM_Explainer/blob/HEAD/llms/icl.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":"293df5ab7abda673","code_sha256_prefix":"293df5ab7abda673","mcp_get_code":{"code_sha256":"293df5ab7abda673"}},{"arxiv_id":"2305.15048","arxiv_id_is_arxiv":true,"paper":"/paper/ranger-a-toolkit-for-effect-size-based-multi","title":"Ranger: A Toolkit for Effect-Size Based Multi-Task Evaluation","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MeteSertkan/ranger","path":"ranger/meta_analysis.py","file_url":"https://github.com/MeteSertkan/ranger/blob/HEAD/ranger/meta_analysis.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a2295f3fccce2f7f","code_sha256_prefix":"a2295f3fccce2f7f","mcp_get_code":{"code_sha256":"a2295f3fccce2f7f"}},{"arxiv_id":"2305.10564","arxiv_id_is_arxiv":true,"paper":"/paper/counterfactually-comparing-abstaining-1","title":"Counterfactually Comparing Abstaining Classifiers","date":"2023-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yjchoe/ComparingAbstainingClassifiers","path":"comparecast_causal/abstaining_predictors.py","file_url":"https://github.com/yjchoe/ComparingAbstainingClassifiers/blob/HEAD/comparecast_causal/abstaining_predictors.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":"7dc1be337fe9d277","code_sha256_prefix":"7dc1be337fe9d277","mcp_get_code":{"code_sha256":"7dc1be337fe9d277"}},{"arxiv_id":"2208.09652","arxiv_id_is_arxiv":true,"paper":"/paper/few-shot-learning-of-accurate-folding","title":"Unsupervisedly Prompting AlphaFold2 for Few-Shot Learning of Accurate Folding Landscape and Protein Structure Prediction","date":"2022-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"2023-MindSpore-1/ms-code-141","path":"model/fold.py","file_url":"https://github.com/2023-MindSpore-1/ms-code-141/blob/HEAD/model/fold.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, 2023-MindSpore-1/ms-code-141 when it was checked","code_sha256":"ed40f6ad0d53b48d","code_sha256_prefix":"ed40f6ad0d53b48d","mcp_get_code":{"code_sha256":"ed40f6ad0d53b48d"}}],"record_sha256":"ae692b8e1bb386c1fc9eb360ed10726ce308539304193ea447f0c8b93015b650","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}