{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:MVD3AGKBLZTTWH5KT3DYFL5GJH","short_pith_number":"pith:MVD3AGKB","schema_version":"1.0","canonical_sha256":"6547b019415e673b1faa9ec782afa649cc2d70f17a674de75f9bcc7437939ccc","source":{"kind":"arxiv","id":"2209.03148","version":2},"attestation_state":"computed","paper":{"title":"Improving Out-of-Distribution Detection via Epistemic Uncertainty Adversarial Training","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Andre T. Nguyen, Derek Everett, Edward Raff, Luke E. Richards","submitted_at":"2022-09-05T14:32:19Z","abstract_excerpt":"The quantification of uncertainty is important for the adoption of machine learning, especially to reject out-of-distribution (OOD) data back to human experts for review. Yet progress has been slow, as a balance must be struck between computational efficiency and the quality of uncertainty estimates. For this reason many use deep ensembles of neural networks or Monte Carlo dropout for reasonable uncertainty estimates at relatively minimal compute and memory. Surprisingly, when we focus on the real-world applicable constraint of $\\leq 1\\%$ false positive rate (FPR), prior methods fail to reliab"},"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":"2209.03148","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-09-05T14:32:19Z","cross_cats_sorted":[],"title_canon_sha256":"af078611751bff2ecb4b53c09919eb1a573abbbbd08e6aec476264da53228fe1","abstract_canon_sha256":"0fd745fb71d438ebe8fcf890574f9a8115f34c4cb75796e744be652e7c2251ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:55:54.293482Z","signature_b64":"Hn0lXQPbK0NcZieOMdN6WcOZKzrIZ8GqDFTZOGoSCNyOAmQe6ik9IsBIOqZtqQizBRI7vZz96nMlyNQUa02oBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6547b019415e673b1faa9ec782afa649cc2d70f17a674de75f9bcc7437939ccc","last_reissued_at":"2026-07-05T04:55:54.293070Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:55:54.293070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving Out-of-Distribution Detection via Epistemic Uncertainty Adversarial Training","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Andre T. Nguyen, Derek Everett, Edward Raff, Luke E. Richards","submitted_at":"2022-09-05T14:32:19Z","abstract_excerpt":"The quantification of uncertainty is important for the adoption of machine learning, especially to reject out-of-distribution (OOD) data back to human experts for review. Yet progress has been slow, as a balance must be struck between computational efficiency and the quality of uncertainty estimates. For this reason many use deep ensembles of neural networks or Monte Carlo dropout for reasonable uncertainty estimates at relatively minimal compute and memory. Surprisingly, when we focus on the real-world applicable constraint of $\\leq 1\\%$ false positive rate (FPR), prior methods fail to reliab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.03148","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/2209.03148/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":"2209.03148","created_at":"2026-07-05T04:55:54.293131+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.03148v2","created_at":"2026-07-05T04:55:54.293131+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.03148","created_at":"2026-07-05T04:55:54.293131+00:00"},{"alias_kind":"pith_short_12","alias_value":"MVD3AGKBLZTT","created_at":"2026-07-05T04:55:54.293131+00:00"},{"alias_kind":"pith_short_16","alias_value":"MVD3AGKBLZTTWH5K","created_at":"2026-07-05T04:55:54.293131+00:00"},{"alias_kind":"pith_short_8","alias_value":"MVD3AGKB","created_at":"2026-07-05T04:55:54.293131+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2404.14642","citing_title":"Uncertainty Quantification on Graph Learning: A Survey","ref_index":52,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MVD3AGKBLZTTWH5KT3DYFL5GJH","json":"https://pith.science/pith/MVD3AGKBLZTTWH5KT3DYFL5GJH.json","graph_json":"https://pith.science/api/pith-number/MVD3AGKBLZTTWH5KT3DYFL5GJH/graph.json","events_json":"https://pith.science/api/pith-number/MVD3AGKBLZTTWH5KT3DYFL5GJH/events.json","paper":"https://pith.science/paper/MVD3AGKB"},"agent_actions":{"view_html":"https://pith.science/pith/MVD3AGKBLZTTWH5KT3DYFL5GJH","download_json":"https://pith.science/pith/MVD3AGKBLZTTWH5KT3DYFL5GJH.json","view_paper":"https://pith.science/paper/MVD3AGKB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.03148&json=true","fetch_graph":"https://pith.science/api/pith-number/MVD3AGKBLZTTWH5KT3DYFL5GJH/graph.json","fetch_events":"https://pith.science/api/pith-number/MVD3AGKBLZTTWH5KT3DYFL5GJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MVD3AGKBLZTTWH5KT3DYFL5GJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MVD3AGKBLZTTWH5KT3DYFL5GJH/action/storage_attestation","attest_author":"https://pith.science/pith/MVD3AGKBLZTTWH5KT3DYFL5GJH/action/author_attestation","sign_citation":"https://pith.science/pith/MVD3AGKBLZTTWH5KT3DYFL5GJH/action/citation_signature","submit_replication":"https://pith.science/pith/MVD3AGKBLZTTWH5KT3DYFL5GJH/action/replication_record"}},"created_at":"2026-07-05T04:55:54.293131+00:00","updated_at":"2026-07-05T04:55:54.293131+00:00"}