{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:BAKPWKLXR3ON5IBXEDU2FRWXJL","short_pith_number":"pith:BAKPWKLX","canonical_record":{"source":{"id":"2405.11533","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-19T12:24:30Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"ca867d533f25b43d4010da9bcd39f1be972b692f9b5ae01d63cedf4ae790647c","abstract_canon_sha256":"b16d27af12bf02597f2ad4fea70b8cbc5c3ef7088e49a6ab3027c95b8eefa3ef"},"schema_version":"1.0"},"canonical_sha256":"0814fb29778edcdea03720e9a2c6d74aea806f2c8fbb7e270e3c5906f48e8146","source":{"kind":"arxiv","id":"2405.11533","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.11533","created_at":"2026-07-05T09:56:51Z"},{"alias_kind":"arxiv_version","alias_value":"2405.11533v2","created_at":"2026-07-05T09:56:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.11533","created_at":"2026-07-05T09:56:51Z"},{"alias_kind":"pith_short_12","alias_value":"BAKPWKLXR3ON","created_at":"2026-07-05T09:56:51Z"},{"alias_kind":"pith_short_16","alias_value":"BAKPWKLXR3ON5IBX","created_at":"2026-07-05T09:56:51Z"},{"alias_kind":"pith_short_8","alias_value":"BAKPWKLX","created_at":"2026-07-05T09:56:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:BAKPWKLXR3ON5IBXEDU2FRWXJL","target":"record","payload":{"canonical_record":{"source":{"id":"2405.11533","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-19T12:24:30Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"ca867d533f25b43d4010da9bcd39f1be972b692f9b5ae01d63cedf4ae790647c","abstract_canon_sha256":"b16d27af12bf02597f2ad4fea70b8cbc5c3ef7088e49a6ab3027c95b8eefa3ef"},"schema_version":"1.0"},"canonical_sha256":"0814fb29778edcdea03720e9a2c6d74aea806f2c8fbb7e270e3c5906f48e8146","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:56:51.540169Z","signature_b64":"pPKvrkK6Lp+5u6Ws+XSo/YsjGtzxcjTKfqBvgedG03/6jeElcouKRxzGSJLVZ+PWlBmZ01YpBhWj483dITU/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0814fb29778edcdea03720e9a2c6d74aea806f2c8fbb7e270e3c5906f48e8146","last_reissued_at":"2026-07-05T09:56:51.539632Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:56:51.539632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.11533","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:56:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qDFeaY/Hja3BNxW8F8tU0FL32LpBzsw3/mjRa0xwM1yPCtw6IXHAnQV4Tlb92RFYsdDqMTSwo8uY+pk1mPUlCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T23:56:36.914090Z"},"content_sha256":"53d383573498216410186a737f1c55d64e998f4dd59487a9fe0e4af64b3c0938","schema_version":"1.0","event_id":"sha256:53d383573498216410186a737f1c55d64e998f4dd59487a9fe0e4af64b3c0938"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:BAKPWKLXR3ON5IBXEDU2FRWXJL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hierarchical Selective Classification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Ido Galil, Ran El-Yaniv, Shani Goren","submitted_at":"2024-05-19T12:24:30Z","abstract_excerpt":"Deploying deep neural networks for risk-sensitive tasks necessitates an uncertainty estimation mechanism. This paper introduces hierarchical selective classification, extending selective classification to a hierarchical setting. Our approach leverages the inherent structure of class relationships, enabling models to reduce the specificity of their predictions when faced with uncertainty. In this paper, we first formalize hierarchical risk and coverage, and introduce hierarchical risk-coverage curves. Next, we develop algorithms for hierarchical selective classification (which we refer to as \"i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.11533","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/2405.11533/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:56:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e/gJsY0X70fuPdT7X9pYDVparHj3SCazCjfm0jB7Nmz7dYaiWfea21nB+IOIcWBuggoa4M6F7zgGcmpiLP2mCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T23:56:36.914933Z"},"content_sha256":"14468b2767b33851c1119efb1e7e037bfa5765da54aeb69cc4bc90d01cdf7232","schema_version":"1.0","event_id":"sha256:14468b2767b33851c1119efb1e7e037bfa5765da54aeb69cc4bc90d01cdf7232"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BAKPWKLXR3ON5IBXEDU2FRWXJL/bundle.json","state_url":"https://pith.science/pith/BAKPWKLXR3ON5IBXEDU2FRWXJL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BAKPWKLXR3ON5IBXEDU2FRWXJL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T23:56:36Z","links":{"resolver":"https://pith.science/pith/BAKPWKLXR3ON5IBXEDU2FRWXJL","bundle":"https://pith.science/pith/BAKPWKLXR3ON5IBXEDU2FRWXJL/bundle.json","state":"https://pith.science/pith/BAKPWKLXR3ON5IBXEDU2FRWXJL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BAKPWKLXR3ON5IBXEDU2FRWXJL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:BAKPWKLXR3ON5IBXEDU2FRWXJL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b16d27af12bf02597f2ad4fea70b8cbc5c3ef7088e49a6ab3027c95b8eefa3ef","cross_cats_sorted":["cs.CV"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-19T12:24:30Z","title_canon_sha256":"ca867d533f25b43d4010da9bcd39f1be972b692f9b5ae01d63cedf4ae790647c"},"schema_version":"1.0","source":{"id":"2405.11533","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.11533","created_at":"2026-07-05T09:56:51Z"},{"alias_kind":"arxiv_version","alias_value":"2405.11533v2","created_at":"2026-07-05T09:56:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.11533","created_at":"2026-07-05T09:56:51Z"},{"alias_kind":"pith_short_12","alias_value":"BAKPWKLXR3ON","created_at":"2026-07-05T09:56:51Z"},{"alias_kind":"pith_short_16","alias_value":"BAKPWKLXR3ON5IBX","created_at":"2026-07-05T09:56:51Z"},{"alias_kind":"pith_short_8","alias_value":"BAKPWKLX","created_at":"2026-07-05T09:56:51Z"}],"graph_snapshots":[{"event_id":"sha256:14468b2767b33851c1119efb1e7e037bfa5765da54aeb69cc4bc90d01cdf7232","target":"graph","created_at":"2026-07-05T09:56:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2405.11533/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Deploying deep neural networks for risk-sensitive tasks necessitates an uncertainty estimation mechanism. This paper introduces hierarchical selective classification, extending selective classification to a hierarchical setting. Our approach leverages the inherent structure of class relationships, enabling models to reduce the specificity of their predictions when faced with uncertainty. In this paper, we first formalize hierarchical risk and coverage, and introduce hierarchical risk-coverage curves. Next, we develop algorithms for hierarchical selective classification (which we refer to as \"i","authors_text":"Ido Galil, Ran El-Yaniv, Shani Goren","cross_cats":["cs.CV"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-19T12:24:30Z","title":"Hierarchical Selective Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.11533","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:53d383573498216410186a737f1c55d64e998f4dd59487a9fe0e4af64b3c0938","target":"record","created_at":"2026-07-05T09:56:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b16d27af12bf02597f2ad4fea70b8cbc5c3ef7088e49a6ab3027c95b8eefa3ef","cross_cats_sorted":["cs.CV"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-19T12:24:30Z","title_canon_sha256":"ca867d533f25b43d4010da9bcd39f1be972b692f9b5ae01d63cedf4ae790647c"},"schema_version":"1.0","source":{"id":"2405.11533","kind":"arxiv","version":2}},"canonical_sha256":"0814fb29778edcdea03720e9a2c6d74aea806f2c8fbb7e270e3c5906f48e8146","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0814fb29778edcdea03720e9a2c6d74aea806f2c8fbb7e270e3c5906f48e8146","first_computed_at":"2026-07-05T09:56:51.539632Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:56:51.539632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pPKvrkK6Lp+5u6Ws+XSo/YsjGtzxcjTKfqBvgedG03/6jeElcouKRxzGSJLVZ+PWlBmZ01YpBhWj483dITU/Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:56:51.540169Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.11533","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53d383573498216410186a737f1c55d64e998f4dd59487a9fe0e4af64b3c0938","sha256:14468b2767b33851c1119efb1e7e037bfa5765da54aeb69cc4bc90d01cdf7232"],"state_sha256":"c55e2948ea7edfdb32c22252eaa7c2c7824823d5c9b0e96f6f6b787105eddb03"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+HsaHYN1wyDKGQ2Q3cSQ3JuNAy9wVfEk6KsujiI88sQ0AXqm5WH4O7M+EvBvz2nT3eFW33uDALI2hOFkIs/8CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T23:56:36.919622Z","bundle_sha256":"0e627d48182b711f8c19f7a27edb6a4407e054e015d5cae0f12e7cd13d3834f6"}}