{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/brier-score","entry":"brier_score","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":5,"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_fingerprinted":1,"n_places":6,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"unverified":1},"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","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a27310bc46a19912","mcp_get_code":{"code_sha256":"a27310bc46a19912"}},{"arxiv_id":"2404.13016","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0738ab13a0a3dd82","mcp_get_code":{"code_sha256":"0738ab13a0a3dd82"}},{"arxiv_id":"2404.09127","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,"code_sha256_prefix":"29c9baba710b8f9d","mcp_get_code":{"code_sha256":"29c9baba710b8f9d"}},{"arxiv_id":"2402.06160","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d6163ccad1b08028","mcp_get_code":{"code_sha256":"d6163ccad1b08028"}},{"arxiv_id":"2401.15330","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,"code_sha256_prefix":"47effd42a0a6af4a","mcp_get_code":{"code_sha256":"47effd42a0a6af4a"}},{"arxiv_id":"2303.02045","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a27310bc46a19912","mcp_get_code":{"code_sha256":"a27310bc46a19912"}}]}