{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:BBSEEGWFPGNRF47AQJWYG54UTM","short_pith_number":"pith:BBSEEGWF","schema_version":"1.0","canonical_sha256":"0864421ac5799b12f3e0826d8377949b3513b3a1cedf50c780dc2ec75da94398","source":{"kind":"arxiv","id":"2104.01000","version":1},"attestation_state":"computed","paper":{"title":"A Proper Scoring Rule for Validation of Competing Risks Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Zoe Guan","submitted_at":"2021-04-02T11:59:14Z","abstract_excerpt":"Scoring rules are used to evaluate the quality of predictions that take the form of probability distributions. A scoring rule is strictly proper if its expected value is uniquely minimized by the true probability distribution. One of the most well-known and widely used strictly proper scoring rules is the logarithmic scoring rule. We propose a version of the logarithmic scoring rule for competing risks data and show that it remains strictly proper under non-informative censoring."},"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":"2104.01000","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2021-04-02T11:59:14Z","cross_cats_sorted":[],"title_canon_sha256":"a0a27fdb1f9be73646eb8a0a46ef86cb41dc764e610443825ea3b4c24914d044","abstract_canon_sha256":"b5cbe83c3ff1356d9c6052e5d0a3bac7bfb034c1a94db0839a46c8d3496b719a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:28:38.532175Z","signature_b64":"c5igFNWCrc2gUQqSIMCZFFjcFjLqUf26t1miIVbpCgR6T0EspPzp7n+TTZM34fKhlxepJ6zQmAz4FNVtRioLDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0864421ac5799b12f3e0826d8377949b3513b3a1cedf50c780dc2ec75da94398","last_reissued_at":"2026-07-05T02:28:38.531802Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:28:38.531802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Proper Scoring Rule for Validation of Competing Risks Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Zoe Guan","submitted_at":"2021-04-02T11:59:14Z","abstract_excerpt":"Scoring rules are used to evaluate the quality of predictions that take the form of probability distributions. A scoring rule is strictly proper if its expected value is uniquely minimized by the true probability distribution. One of the most well-known and widely used strictly proper scoring rules is the logarithmic scoring rule. We propose a version of the logarithmic scoring rule for competing risks data and show that it remains strictly proper under non-informative censoring."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.01000","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/2104.01000/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":"2104.01000","created_at":"2026-07-05T02:28:38.531856+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.01000v1","created_at":"2026-07-05T02:28:38.531856+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.01000","created_at":"2026-07-05T02:28:38.531856+00:00"},{"alias_kind":"pith_short_12","alias_value":"BBSEEGWFPGNR","created_at":"2026-07-05T02:28:38.531856+00:00"},{"alias_kind":"pith_short_16","alias_value":"BBSEEGWFPGNRF47A","created_at":"2026-07-05T02:28:38.531856+00:00"},{"alias_kind":"pith_short_8","alias_value":"BBSEEGWF","created_at":"2026-07-05T02:28:38.531856+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BBSEEGWFPGNRF47AQJWYG54UTM","json":"https://pith.science/pith/BBSEEGWFPGNRF47AQJWYG54UTM.json","graph_json":"https://pith.science/api/pith-number/BBSEEGWFPGNRF47AQJWYG54UTM/graph.json","events_json":"https://pith.science/api/pith-number/BBSEEGWFPGNRF47AQJWYG54UTM/events.json","paper":"https://pith.science/paper/BBSEEGWF"},"agent_actions":{"view_html":"https://pith.science/pith/BBSEEGWFPGNRF47AQJWYG54UTM","download_json":"https://pith.science/pith/BBSEEGWFPGNRF47AQJWYG54UTM.json","view_paper":"https://pith.science/paper/BBSEEGWF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.01000&json=true","fetch_graph":"https://pith.science/api/pith-number/BBSEEGWFPGNRF47AQJWYG54UTM/graph.json","fetch_events":"https://pith.science/api/pith-number/BBSEEGWFPGNRF47AQJWYG54UTM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BBSEEGWFPGNRF47AQJWYG54UTM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BBSEEGWFPGNRF47AQJWYG54UTM/action/storage_attestation","attest_author":"https://pith.science/pith/BBSEEGWFPGNRF47AQJWYG54UTM/action/author_attestation","sign_citation":"https://pith.science/pith/BBSEEGWFPGNRF47AQJWYG54UTM/action/citation_signature","submit_replication":"https://pith.science/pith/BBSEEGWFPGNRF47AQJWYG54UTM/action/replication_record"}},"created_at":"2026-07-05T02:28:38.531856+00:00","updated_at":"2026-07-05T02:28:38.531856+00:00"}