{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:XL2B4KFFHEOAW2NVYN64GU5FFW","short_pith_number":"pith:XL2B4KFF","schema_version":"1.0","canonical_sha256":"baf41e28a5391c0b69b5c37dc353a52d943760a43e48502700bd9f902a0c2a75","source":{"kind":"arxiv","id":"2301.09044","version":2},"attestation_state":"computed","paper":{"title":"Learning to Reject with a Fixed Predictor: Application to Decontextualization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Christopher Mohri, Daniel Andor, Eunsol Choi, Michael Collins","submitted_at":"2023-01-22T03:04:19Z","abstract_excerpt":"We study the problem of classification with a reject option for a fixed predictor, applicable in natural language processing. We introduce a new problem formulation for this scenario, and an algorithm minimizing a new surrogate loss function. We provide a complete theoretical analysis of the surrogate loss function with a strong $H$-consistency guarantee. For evaluation, we choose the decontextualization task, and provide a manually-labelled dataset of $2\\mathord,000$ examples. Our algorithm significantly outperforms the baselines considered, with a $\\sim\\!\\!25\\%$ improvement in coverage when "},"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":"2301.09044","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-01-22T03:04:19Z","cross_cats_sorted":[],"title_canon_sha256":"0f26e98c552445280f841192ec180c568c7e6098cfc6a57f92fa095ebd95b1a6","abstract_canon_sha256":"e0923269b251b9457d2f6d255d6b2fb406f396f2d2ea7b33ec47acadaf1bdb96"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:37:11.781505Z","signature_b64":"jXgTKrWLJjJt4GcM+CSw91rTAXDQLagRNx5UkxMrU+6FaSBSuS75ti4/iAIEby+WiXnoiZMW/qS5/18sb+BMBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"baf41e28a5391c0b69b5c37dc353a52d943760a43e48502700bd9f902a0c2a75","last_reissued_at":"2026-07-05T05:37:11.781018Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:37:11.781018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Reject with a Fixed Predictor: Application to Decontextualization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Christopher Mohri, Daniel Andor, Eunsol Choi, Michael Collins","submitted_at":"2023-01-22T03:04:19Z","abstract_excerpt":"We study the problem of classification with a reject option for a fixed predictor, applicable in natural language processing. We introduce a new problem formulation for this scenario, and an algorithm minimizing a new surrogate loss function. We provide a complete theoretical analysis of the surrogate loss function with a strong $H$-consistency guarantee. For evaluation, we choose the decontextualization task, and provide a manually-labelled dataset of $2\\mathord,000$ examples. Our algorithm significantly outperforms the baselines considered, with a $\\sim\\!\\!25\\%$ improvement in coverage when "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.09044","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/2301.09044/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":"2301.09044","created_at":"2026-07-05T05:37:11.781072+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.09044v2","created_at":"2026-07-05T05:37:11.781072+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.09044","created_at":"2026-07-05T05:37:11.781072+00:00"},{"alias_kind":"pith_short_12","alias_value":"XL2B4KFFHEOA","created_at":"2026-07-05T05:37:11.781072+00:00"},{"alias_kind":"pith_short_16","alias_value":"XL2B4KFFHEOAW2NV","created_at":"2026-07-05T05:37:11.781072+00:00"},{"alias_kind":"pith_short_8","alias_value":"XL2B4KFF","created_at":"2026-07-05T05:37:11.781072+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2506.14067","citing_title":"Online Conformal Abstention for Factuality Control Under Adversarial Bandit Feedback","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07805","citing_title":"Flexible Routing via Uncertainty Decomposition","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XL2B4KFFHEOAW2NVYN64GU5FFW","json":"https://pith.science/pith/XL2B4KFFHEOAW2NVYN64GU5FFW.json","graph_json":"https://pith.science/api/pith-number/XL2B4KFFHEOAW2NVYN64GU5FFW/graph.json","events_json":"https://pith.science/api/pith-number/XL2B4KFFHEOAW2NVYN64GU5FFW/events.json","paper":"https://pith.science/paper/XL2B4KFF"},"agent_actions":{"view_html":"https://pith.science/pith/XL2B4KFFHEOAW2NVYN64GU5FFW","download_json":"https://pith.science/pith/XL2B4KFFHEOAW2NVYN64GU5FFW.json","view_paper":"https://pith.science/paper/XL2B4KFF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.09044&json=true","fetch_graph":"https://pith.science/api/pith-number/XL2B4KFFHEOAW2NVYN64GU5FFW/graph.json","fetch_events":"https://pith.science/api/pith-number/XL2B4KFFHEOAW2NVYN64GU5FFW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XL2B4KFFHEOAW2NVYN64GU5FFW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XL2B4KFFHEOAW2NVYN64GU5FFW/action/storage_attestation","attest_author":"https://pith.science/pith/XL2B4KFFHEOAW2NVYN64GU5FFW/action/author_attestation","sign_citation":"https://pith.science/pith/XL2B4KFFHEOAW2NVYN64GU5FFW/action/citation_signature","submit_replication":"https://pith.science/pith/XL2B4KFFHEOAW2NVYN64GU5FFW/action/replication_record"}},"created_at":"2026-07-05T05:37:11.781072+00:00","updated_at":"2026-07-05T05:37:11.781072+00:00"}