{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:COXKT6I2WLW3UDTWJSEOBVHCYG","short_pith_number":"pith:COXKT6I2","schema_version":"1.0","canonical_sha256":"13aea9f91ab2edba0e764c88e0d4e2c19a33efd8cc686ec445d7e9c45dfc024e","source":{"kind":"arxiv","id":"2505.22538","version":1},"attestation_state":"computed","paper":{"title":"Uncertainty Quantification with Proper Scoring Rules: Adjusting Measures to Prediction Tasks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Eyke H\\\"ullermeier, Paul Hofman, Yusuf Sale","submitted_at":"2025-05-28T16:22:53Z","abstract_excerpt":"We address the problem of uncertainty quantification and propose measures of total, aleatoric, and epistemic uncertainty based on a known decomposition of (strictly) proper scoring rules, a specific type of loss function, into a divergence and an entropy component. This leads to a flexible framework for uncertainty quantification that can be instantiated with different losses (scoring rules), which makes it possible to tailor uncertainty quantification to the use case at hand. We show that this flexibility is indeed advantageous. In particular, we analyze the task of selective prediction and s"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2505.22538","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-28T16:22:53Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e7e6444993ca532c10326c10c085fdb9876d0dc677fc1037dc410b836accb435","abstract_canon_sha256":"44b9bbe14fa7f4c386768470d3cc7dfc052f3c1df8d96d25600adba269dcc6cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:26.253031Z","signature_b64":"JFIsGpFPnAoRiZN9SAdElwBWdUj8mPe3Eoh5BKZ+cJ2Cy/YR09NyKk/AE8n7/4XmUAgiY/yjNhM11uJ18eU3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13aea9f91ab2edba0e764c88e0d4e2c19a33efd8cc686ec445d7e9c45dfc024e","last_reissued_at":"2026-07-05T11:11:26.252543Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:26.252543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uncertainty Quantification with Proper Scoring Rules: Adjusting Measures to Prediction Tasks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Eyke H\\\"ullermeier, Paul Hofman, Yusuf Sale","submitted_at":"2025-05-28T16:22:53Z","abstract_excerpt":"We address the problem of uncertainty quantification and propose measures of total, aleatoric, and epistemic uncertainty based on a known decomposition of (strictly) proper scoring rules, a specific type of loss function, into a divergence and an entropy component. This leads to a flexible framework for uncertainty quantification that can be instantiated with different losses (scoring rules), which makes it possible to tailor uncertainty quantification to the use case at hand. We show that this flexibility is indeed advantageous. In particular, we analyze the task of selective prediction and s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.22538","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.22538/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2505.22538","created_at":"2026-07-05T11:11:26.252602+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.22538v1","created_at":"2026-07-05T11:11:26.252602+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.22538","created_at":"2026-07-05T11:11:26.252602+00:00"},{"alias_kind":"pith_short_12","alias_value":"COXKT6I2WLW3","created_at":"2026-07-05T11:11:26.252602+00:00"},{"alias_kind":"pith_short_16","alias_value":"COXKT6I2WLW3UDTW","created_at":"2026-07-05T11:11:26.252602+00:00"},{"alias_kind":"pith_short_8","alias_value":"COXKT6I2","created_at":"2026-07-05T11:11:26.252602+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.01530","citing_title":"ST-LoRA: Single Trajectory LoRA Ensemble for Uncertainty Aware Agricultural Segmentation","ref_index":150,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/COXKT6I2WLW3UDTWJSEOBVHCYG","json":"https://pith.science/pith/COXKT6I2WLW3UDTWJSEOBVHCYG.json","graph_json":"https://pith.science/api/pith-number/COXKT6I2WLW3UDTWJSEOBVHCYG/graph.json","events_json":"https://pith.science/api/pith-number/COXKT6I2WLW3UDTWJSEOBVHCYG/events.json","paper":"https://pith.science/paper/COXKT6I2"},"agent_actions":{"view_html":"https://pith.science/pith/COXKT6I2WLW3UDTWJSEOBVHCYG","download_json":"https://pith.science/pith/COXKT6I2WLW3UDTWJSEOBVHCYG.json","view_paper":"https://pith.science/paper/COXKT6I2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.22538&json=true","fetch_graph":"https://pith.science/api/pith-number/COXKT6I2WLW3UDTWJSEOBVHCYG/graph.json","fetch_events":"https://pith.science/api/pith-number/COXKT6I2WLW3UDTWJSEOBVHCYG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/COXKT6I2WLW3UDTWJSEOBVHCYG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/COXKT6I2WLW3UDTWJSEOBVHCYG/action/storage_attestation","attest_author":"https://pith.science/pith/COXKT6I2WLW3UDTWJSEOBVHCYG/action/author_attestation","sign_citation":"https://pith.science/pith/COXKT6I2WLW3UDTWJSEOBVHCYG/action/citation_signature","submit_replication":"https://pith.science/pith/COXKT6I2WLW3UDTWJSEOBVHCYG/action/replication_record"}},"created_at":"2026-07-05T11:11:26.252602+00:00","updated_at":"2026-07-05T11:11:26.252602+00:00"}