{"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/brier-score","entry":"brier_score","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":5,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":5,"n_places_pointer_only_link_open":1,"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":1,"ran_draft_wrong":2,"ran_fixture":0,"ran":1,"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":"2410.00393","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-essential-and-nonessential","title":"Revisiting Essential and Nonessential Settings of Evidential Deep Learning","date":"2024-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mengyuanchen21/re-edl","path":"code_fsl/metrics.py","file_url":"https://github.com/mengyuanchen21/re-edl/blob/HEAD/code_fsl/metrics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, mengyuanchen21/re-edl when it was checked","code_sha256":"a27310bc46a19912","code_sha256_prefix":"a27310bc46a19912","mcp_get_code":{"code_sha256":"a27310bc46a19912"}},{"arxiv_id":"2404.13016","arxiv_id_is_arxiv":true,"paper":"/paper/optimizing-calibration-by-gaining-aware-of","title":"Optimizing Calibration by Gaining Aware of Prediction Correctness","date":"2024-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuyvchi/correctness-aware-calibration","path":"src/cal_metrics/BS.py","file_url":"https://github.com/liuyvchi/correctness-aware-calibration/blob/HEAD/src/cal_metrics/BS.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, liuyvchi/correctness-aware-calibration when it was checked","code_sha256":"0738ab13a0a3dd82","code_sha256_prefix":"0738ab13a0a3dd82","mcp_get_code":{"code_sha256":"0738ab13a0a3dd82"}},{"arxiv_id":"2404.09127","arxiv_id_is_arxiv":true,"paper":"/paper/confidence-calibration-and-rationalization","title":"Confidence Calibration and Rationalization for LLMs via Multi-Agent Deliberation","date":"2024-04-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minnesotanlp/collaborative-calibration","path":"collaborative-calibration/analysis_utils.py","file_url":"https://github.com/minnesotanlp/collaborative-calibration/blob/HEAD/collaborative-calibration/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, minnesotanlp/collaborative-calibration when it was checked","code_sha256":"29c9baba710b8f9d","code_sha256_prefix":"29c9baba710b8f9d","mcp_get_code":{"code_sha256":"29c9baba710b8f9d"}},{"arxiv_id":"2402.06160","arxiv_id_is_arxiv":true,"paper":"/paper/improved-evidential-deep-learning-via-a","title":"Are Uncertainty Quantification Capabilities of Evidential Deep Learning a Mirage?","date":"2024-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maohaos2/edl-mirage","path":"src/edl_mirage/posterior_networks/metrics.py","file_url":"https://github.com/maohaos2/edl-mirage/blob/HEAD/src/edl_mirage/posterior_networks/metrics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d6163ccad1b08028","code_sha256_prefix":"d6163ccad1b08028","mcp_get_code":{"code_sha256":"d6163ccad1b08028"}},{"arxiv_id":"2401.15330","arxiv_id_is_arxiv":true,"paper":"/paper/optimal-sparse-survival-trees","title":"Optimal Sparse Survival Trees","date":"2024-01-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ruizhang1996/optimal-sparse-survival-trees-public","path":"osst/model/metrics.py","file_url":"https://github.com/ruizhang1996/optimal-sparse-survival-trees-public/blob/HEAD/osst/model/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, ruizhang1996/optimal-sparse-survival-trees-public (NOASSERTION)","code_sha256":"47effd42a0a6af4a","code_sha256_prefix":"47effd42a0a6af4a","mcp_get_code":{"code_sha256":"47effd42a0a6af4a"}},{"arxiv_id":"2303.02045","arxiv_id_is_arxiv":true,"paper":"/paper/uncertainty-estimation-by-fisher-information","title":"Uncertainty Estimation by Fisher Information-based Evidential Deep Learning","date":"2023-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danruod/iedl","path":"code_fsl/metrics.py","file_url":"https://github.com/danruod/iedl/blob/HEAD/code_fsl/metrics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from mengyuanchen21/re-edl, and GitHub detected no licence in that repository when it was checked","code_sha256":"a27310bc46a19912","code_sha256_prefix":"a27310bc46a19912","mcp_get_code":{"code_sha256":"a27310bc46a19912"}}],"record_sha256":"139dbef07fc951931b4d7c8b4c782fe4c295fddcd5e5b590d359ebac9ba9ef89","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}