{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:UFD25OIQPNL337WVM6LPTPBZY2","short_pith_number":"pith:UFD25OIQ","schema_version":"1.0","canonical_sha256":"a147aeb9107b57bdfed56796f9bc39c69947e875ea35cd8bb5b9409fa237a9af","source":{"kind":"arxiv","id":"1304.2331","version":1},"attestation_state":"computed","paper":{"title":"The PAV algorithm optimizes binary proper scoring rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"stat.AP","authors_text":"Johan du Preez, Niko Brummer","submitted_at":"2013-04-08T19:49:51Z","abstract_excerpt":"There has been much recent interest in application of the pool-adjacent-violators (PAV) algorithm for the purpose of calibrating the probabilistic outputs of automatic pattern recognition and machine learning algorithms. Special cost functions, known as proper scoring rules form natural objective functions to judge the goodness of such calibration. We show that for binary pattern classifiers, the non-parametric optimization of calibration, subject to a monotonicity constraint, can be solved by PAV and that this solution is optimal for all regular binary proper scoring rules. This extends previ"},"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":"1304.2331","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2013-04-08T19:49:51Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"1a409befb0932eca32ea99486131a99d7e5c518d818a541e1ccf31c5dbc48a29","abstract_canon_sha256":"acdc21cb79141fcbb2505b948f3f03a63a62cfa92d3d6b8078db5ca88586aa96"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:28.805587Z","signature_b64":"s6B9PU/EBODIqgiA8n/37xvT6n/S3QHSWwxCENEwj9T1uAq+2AErgD6pyvaAbFb2t5Cqh4Hk+AAq4Jv/bJqJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a147aeb9107b57bdfed56796f9bc39c69947e875ea35cd8bb5b9409fa237a9af","last_reissued_at":"2026-05-18T03:28:28.804801Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:28.804801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The PAV algorithm optimizes binary proper scoring rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"stat.AP","authors_text":"Johan du Preez, Niko Brummer","submitted_at":"2013-04-08T19:49:51Z","abstract_excerpt":"There has been much recent interest in application of the pool-adjacent-violators (PAV) algorithm for the purpose of calibrating the probabilistic outputs of automatic pattern recognition and machine learning algorithms. Special cost functions, known as proper scoring rules form natural objective functions to judge the goodness of such calibration. We show that for binary pattern classifiers, the non-parametric optimization of calibration, subject to a monotonicity constraint, can be solved by PAV and that this solution is optimal for all regular binary proper scoring rules. This extends previ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2331","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":""},"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":"1304.2331","created_at":"2026-05-18T03:28:28.804904+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.2331v1","created_at":"2026-05-18T03:28:28.804904+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2331","created_at":"2026-05-18T03:28:28.804904+00:00"},{"alias_kind":"pith_short_12","alias_value":"UFD25OIQPNL3","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"UFD25OIQPNL337WV","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"UFD25OIQ","created_at":"2026-05-18T12:28:02.375192+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/UFD25OIQPNL337WVM6LPTPBZY2","json":"https://pith.science/pith/UFD25OIQPNL337WVM6LPTPBZY2.json","graph_json":"https://pith.science/api/pith-number/UFD25OIQPNL337WVM6LPTPBZY2/graph.json","events_json":"https://pith.science/api/pith-number/UFD25OIQPNL337WVM6LPTPBZY2/events.json","paper":"https://pith.science/paper/UFD25OIQ"},"agent_actions":{"view_html":"https://pith.science/pith/UFD25OIQPNL337WVM6LPTPBZY2","download_json":"https://pith.science/pith/UFD25OIQPNL337WVM6LPTPBZY2.json","view_paper":"https://pith.science/paper/UFD25OIQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.2331&json=true","fetch_graph":"https://pith.science/api/pith-number/UFD25OIQPNL337WVM6LPTPBZY2/graph.json","fetch_events":"https://pith.science/api/pith-number/UFD25OIQPNL337WVM6LPTPBZY2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UFD25OIQPNL337WVM6LPTPBZY2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UFD25OIQPNL337WVM6LPTPBZY2/action/storage_attestation","attest_author":"https://pith.science/pith/UFD25OIQPNL337WVM6LPTPBZY2/action/author_attestation","sign_citation":"https://pith.science/pith/UFD25OIQPNL337WVM6LPTPBZY2/action/citation_signature","submit_replication":"https://pith.science/pith/UFD25OIQPNL337WVM6LPTPBZY2/action/replication_record"}},"created_at":"2026-05-18T03:28:28.804904+00:00","updated_at":"2026-05-18T03:28:28.804904+00:00"}