{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:O23ZBLPUZIQUIADBTVXEKZIATJ","short_pith_number":"pith:O23ZBLPU","schema_version":"1.0","canonical_sha256":"76b790adf4ca214400619d6e4565009a5a8700328d507430935a9e317ea42eb9","source":{"kind":"arxiv","id":"2402.07821","version":2},"attestation_state":"computed","paper":{"title":"On Computationally Efficient Multi-Class Calibration","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Guy N. Rothblum, Lunjia Hu, Parikshit Gopalan","submitted_at":"2024-02-12T17:25:23Z","abstract_excerpt":"Consider a multi-class labelling problem, where the labels can take values in $[k]$, and a predictor predicts a distribution over the labels. In this work, we study the following foundational question: Are there notions of multi-class calibration that give strong guarantees of meaningful predictions and can be achieved in time and sample complexities polynomial in $k$? Prior notions of calibration exhibit a tradeoff between computational efficiency and expressivity: they either suffer from having sample complexity exponential in $k$, or needing to solve computationally intractable problems, or"},"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":"2402.07821","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-12T17:25:23Z","cross_cats_sorted":["cs.CC","cs.DS","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"57c7c959d93070ecefbecae7a9f850c901a5c9d3773706700b0c7f5264436f79","abstract_canon_sha256":"a8940002f42e2b96087ea51a7d166d4a2b59873eda112f16f369d65a173f3f6b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:28:59.417772Z","signature_b64":"a/3emtUo2KD9JLesujkjGC2aRuebd0xzwmpymAArjaNoPqSEq3YwgUM2iw/yP0GBAsCpobUiKpn5YqaObBUlBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76b790adf4ca214400619d6e4565009a5a8700328d507430935a9e317ea42eb9","last_reissued_at":"2026-07-05T08:28:59.417293Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:28:59.417293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Computationally Efficient Multi-Class Calibration","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Guy N. Rothblum, Lunjia Hu, Parikshit Gopalan","submitted_at":"2024-02-12T17:25:23Z","abstract_excerpt":"Consider a multi-class labelling problem, where the labels can take values in $[k]$, and a predictor predicts a distribution over the labels. In this work, we study the following foundational question: Are there notions of multi-class calibration that give strong guarantees of meaningful predictions and can be achieved in time and sample complexities polynomial in $k$? Prior notions of calibration exhibit a tradeoff between computational efficiency and expressivity: they either suffer from having sample complexity exponential in $k$, or needing to solve computationally intractable problems, or"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.07821","kind":"arxiv","version":2},"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/2402.07821/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":"2402.07821","created_at":"2026-07-05T08:28:59.417362+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.07821v2","created_at":"2026-07-05T08:28:59.417362+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.07821","created_at":"2026-07-05T08:28:59.417362+00:00"},{"alias_kind":"pith_short_12","alias_value":"O23ZBLPUZIQU","created_at":"2026-07-05T08:28:59.417362+00:00"},{"alias_kind":"pith_short_16","alias_value":"O23ZBLPUZIQUIADB","created_at":"2026-07-05T08:28:59.417362+00:00"},{"alias_kind":"pith_short_8","alias_value":"O23ZBLPU","created_at":"2026-07-05T08:28:59.417362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.23017","citing_title":"Smoothed Elicitation Complexity for Approximate $\\Gamma$-calibration of Discrete Classification Tasks","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O23ZBLPUZIQUIADBTVXEKZIATJ","json":"https://pith.science/pith/O23ZBLPUZIQUIADBTVXEKZIATJ.json","graph_json":"https://pith.science/api/pith-number/O23ZBLPUZIQUIADBTVXEKZIATJ/graph.json","events_json":"https://pith.science/api/pith-number/O23ZBLPUZIQUIADBTVXEKZIATJ/events.json","paper":"https://pith.science/paper/O23ZBLPU"},"agent_actions":{"view_html":"https://pith.science/pith/O23ZBLPUZIQUIADBTVXEKZIATJ","download_json":"https://pith.science/pith/O23ZBLPUZIQUIADBTVXEKZIATJ.json","view_paper":"https://pith.science/paper/O23ZBLPU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.07821&json=true","fetch_graph":"https://pith.science/api/pith-number/O23ZBLPUZIQUIADBTVXEKZIATJ/graph.json","fetch_events":"https://pith.science/api/pith-number/O23ZBLPUZIQUIADBTVXEKZIATJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O23ZBLPUZIQUIADBTVXEKZIATJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O23ZBLPUZIQUIADBTVXEKZIATJ/action/storage_attestation","attest_author":"https://pith.science/pith/O23ZBLPUZIQUIADBTVXEKZIATJ/action/author_attestation","sign_citation":"https://pith.science/pith/O23ZBLPUZIQUIADBTVXEKZIATJ/action/citation_signature","submit_replication":"https://pith.science/pith/O23ZBLPUZIQUIADBTVXEKZIATJ/action/replication_record"}},"created_at":"2026-07-05T08:28:59.417362+00:00","updated_at":"2026-07-05T08:28:59.417362+00:00"}