{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:4NU22FMJKL2VNQLSYWYXH7RJW5","short_pith_number":"pith:4NU22FMJ","schema_version":"1.0","canonical_sha256":"e369ad158952f556c172c5b173fe29b76c7bea564420c84a84bad4857b9cfdaa","source":{"kind":"arxiv","id":"2210.08649","version":2},"attestation_state":"computed","paper":{"title":"Loss Minimization through the Lens of Outcome Indistinguishability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Lunjia Hu, Michael P. Kim, Omer Reingold, Parikshit Gopalan, Udi Wieder","submitted_at":"2022-10-16T22:25:27Z","abstract_excerpt":"We present a new perspective on loss minimization and the recent notion of Omniprediction through the lens of Outcome Indistingusihability. For a collection of losses and hypothesis class, omniprediction requires that a predictor provide a loss-minimization guarantee simultaneously for every loss in the collection compared to the best (loss-specific) hypothesis in the class. We present a generic template to learn predictors satisfying a guarantee we call Loss Outcome Indistinguishability. For a set of statistical tests--based on a collection of losses and hypothesis class--a predictor is Loss "},"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":"2210.08649","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-16T22:25:27Z","cross_cats_sorted":[],"title_canon_sha256":"5dff99f4ddfea7b4095afe5f84c62e46860c9a7c5bf7d078a09a0f933af41e34","abstract_canon_sha256":"ec57e8f4a7a2af3480db5ad163b05740cd6b2f132c22ab0b3673711437cb9aa7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:23:33.896932Z","signature_b64":"G9I6LFo1TF5mj7/xaSK3yyoGTJibyw2pVGEQMLDZjWLDvaYMvpBWwKbbGCAENetHb9ShMFLEBwyi6Aeqma4ABw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e369ad158952f556c172c5b173fe29b76c7bea564420c84a84bad4857b9cfdaa","last_reissued_at":"2026-07-05T05:23:33.896457Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:23:33.896457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Loss Minimization through the Lens of Outcome Indistinguishability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Lunjia Hu, Michael P. Kim, Omer Reingold, Parikshit Gopalan, Udi Wieder","submitted_at":"2022-10-16T22:25:27Z","abstract_excerpt":"We present a new perspective on loss minimization and the recent notion of Omniprediction through the lens of Outcome Indistingusihability. For a collection of losses and hypothesis class, omniprediction requires that a predictor provide a loss-minimization guarantee simultaneously for every loss in the collection compared to the best (loss-specific) hypothesis in the class. We present a generic template to learn predictors satisfying a guarantee we call Loss Outcome Indistinguishability. For a set of statistical tests--based on a collection of losses and hypothesis class--a predictor is Loss "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.08649","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/2210.08649/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":"2210.08649","created_at":"2026-07-05T05:23:33.896516+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.08649v2","created_at":"2026-07-05T05:23:33.896516+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.08649","created_at":"2026-07-05T05:23:33.896516+00:00"},{"alias_kind":"pith_short_12","alias_value":"4NU22FMJKL2V","created_at":"2026-07-05T05:23:33.896516+00:00"},{"alias_kind":"pith_short_16","alias_value":"4NU22FMJKL2VNQLS","created_at":"2026-07-05T05:23:33.896516+00:00"},{"alias_kind":"pith_short_8","alias_value":"4NU22FMJ","created_at":"2026-07-05T05:23:33.896516+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.08964","citing_title":"Trustworthy AI: Ensuring Reliability and Accountability from Models to Agents","ref_index":62,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07805","citing_title":"Flexible Routing via Uncertainty Decomposition","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4NU22FMJKL2VNQLSYWYXH7RJW5","json":"https://pith.science/pith/4NU22FMJKL2VNQLSYWYXH7RJW5.json","graph_json":"https://pith.science/api/pith-number/4NU22FMJKL2VNQLSYWYXH7RJW5/graph.json","events_json":"https://pith.science/api/pith-number/4NU22FMJKL2VNQLSYWYXH7RJW5/events.json","paper":"https://pith.science/paper/4NU22FMJ"},"agent_actions":{"view_html":"https://pith.science/pith/4NU22FMJKL2VNQLSYWYXH7RJW5","download_json":"https://pith.science/pith/4NU22FMJKL2VNQLSYWYXH7RJW5.json","view_paper":"https://pith.science/paper/4NU22FMJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.08649&json=true","fetch_graph":"https://pith.science/api/pith-number/4NU22FMJKL2VNQLSYWYXH7RJW5/graph.json","fetch_events":"https://pith.science/api/pith-number/4NU22FMJKL2VNQLSYWYXH7RJW5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4NU22FMJKL2VNQLSYWYXH7RJW5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4NU22FMJKL2VNQLSYWYXH7RJW5/action/storage_attestation","attest_author":"https://pith.science/pith/4NU22FMJKL2VNQLSYWYXH7RJW5/action/author_attestation","sign_citation":"https://pith.science/pith/4NU22FMJKL2VNQLSYWYXH7RJW5/action/citation_signature","submit_replication":"https://pith.science/pith/4NU22FMJKL2VNQLSYWYXH7RJW5/action/replication_record"}},"created_at":"2026-07-05T05:23:33.896516+00:00","updated_at":"2026-07-05T05:23:33.896516+00:00"}