{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:JUEE6EBR3QO53VPHMSYBBSCCOH","short_pith_number":"pith:JUEE6EBR","canonical_record":{"source":{"id":"2506.01552","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-02T11:29:40Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ca62997b95ceb01ff4b9b8a6a95e7db1b584a43c6185ac65a17a17413f0845fa","abstract_canon_sha256":"6c4b969445049d2970189b039417103f71b2111ea8675b9b6d559b0eacf5c120"},"schema_version":"1.0"},"canonical_sha256":"4d084f1031dc1dddd5e764b010c84271f23cf2e73e1909ac118117cfc3e6a7a6","source":{"kind":"arxiv","id":"2506.01552","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.01552","created_at":"2026-07-05T11:14:15Z"},{"alias_kind":"arxiv_version","alias_value":"2506.01552v1","created_at":"2026-07-05T11:14:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01552","created_at":"2026-07-05T11:14:15Z"},{"alias_kind":"pith_short_12","alias_value":"JUEE6EBR3QO5","created_at":"2026-07-05T11:14:15Z"},{"alias_kind":"pith_short_16","alias_value":"JUEE6EBR3QO53VPH","created_at":"2026-07-05T11:14:15Z"},{"alias_kind":"pith_short_8","alias_value":"JUEE6EBR","created_at":"2026-07-05T11:14:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:JUEE6EBR3QO53VPHMSYBBSCCOH","target":"record","payload":{"canonical_record":{"source":{"id":"2506.01552","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-02T11:29:40Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ca62997b95ceb01ff4b9b8a6a95e7db1b584a43c6185ac65a17a17413f0845fa","abstract_canon_sha256":"6c4b969445049d2970189b039417103f71b2111ea8675b9b6d559b0eacf5c120"},"schema_version":"1.0"},"canonical_sha256":"4d084f1031dc1dddd5e764b010c84271f23cf2e73e1909ac118117cfc3e6a7a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:14:15.655564Z","signature_b64":"eLasfnVHKlL254cwQZ6Y1/48Mnpm7ZMNroa9aOfdIo3soSa5Jq5cma35hVh1ie1BPmmg7UMjCnzuzX4dKWdOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d084f1031dc1dddd5e764b010c84271f23cf2e73e1909ac118117cfc3e6a7a6","last_reissued_at":"2026-07-05T11:14:15.655004Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:14:15.655004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.01552","source_version":1,"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-05T11:14:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H77IWNrN6nIcAh0u74wevrJZZHxQ261QphQZt/cb7o481ov2CLy88MfS21ozm9u67gcLzqcw/fDuzmTGtVXTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T07:05:58.287597Z"},"content_sha256":"e98cb9b300a524670ffc7cb5b1b9bcb7daa601aa24cf649bbdc24507db733db4","schema_version":"1.0","event_id":"sha256:e98cb9b300a524670ffc7cb5b1b9bcb7daa601aa24cf649bbdc24507db733db4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:JUEE6EBR3QO53VPHMSYBBSCCOH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"To Each Metric Its Decoding: Post-Hoc Optimal Decision Rules of Probabilistic Hierarchical Classifiers","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexandre Perez-Lebel, Antoine Saillenfest, Matthieu Labeau, Roman Plaud, Thomas Bonald","submitted_at":"2025-06-02T11:29:40Z","abstract_excerpt":"Hierarchical classification offers an approach to incorporate the concept of mistake severity by leveraging a structured, labeled hierarchy. However, decoding in such settings frequently relies on heuristic decision rules, which may not align with task-specific evaluation metrics. In this work, we propose a framework for the optimal decoding of an output probability distribution with respect to a target metric. We derive optimal decision rules for increasingly complex prediction settings, providing universal algorithms when candidates are limited to the set of nodes. In the most general case o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01552","kind":"arxiv","version":1},"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/2506.01552/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-05T11:14:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XyQdL+kfJhRi4nB5J9Wa44viTQ309ZtxzRIdeTKw1je04JcpLII1hBkFiQhYgiWjyI9b3se07tKBJ6MhK1UwAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T07:05:58.288502Z"},"content_sha256":"cce61290de27cc8b49a13d68b3329d9c49c7d1743abd05f9865827ec16e3a58a","schema_version":"1.0","event_id":"sha256:cce61290de27cc8b49a13d68b3329d9c49c7d1743abd05f9865827ec16e3a58a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JUEE6EBR3QO53VPHMSYBBSCCOH/bundle.json","state_url":"https://pith.science/pith/JUEE6EBR3QO53VPHMSYBBSCCOH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JUEE6EBR3QO53VPHMSYBBSCCOH/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-14T07:05:58Z","links":{"resolver":"https://pith.science/pith/JUEE6EBR3QO53VPHMSYBBSCCOH","bundle":"https://pith.science/pith/JUEE6EBR3QO53VPHMSYBBSCCOH/bundle.json","state":"https://pith.science/pith/JUEE6EBR3QO53VPHMSYBBSCCOH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JUEE6EBR3QO53VPHMSYBBSCCOH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:JUEE6EBR3QO53VPHMSYBBSCCOH","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":"6c4b969445049d2970189b039417103f71b2111ea8675b9b6d559b0eacf5c120","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-02T11:29:40Z","title_canon_sha256":"ca62997b95ceb01ff4b9b8a6a95e7db1b584a43c6185ac65a17a17413f0845fa"},"schema_version":"1.0","source":{"id":"2506.01552","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.01552","created_at":"2026-07-05T11:14:15Z"},{"alias_kind":"arxiv_version","alias_value":"2506.01552v1","created_at":"2026-07-05T11:14:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01552","created_at":"2026-07-05T11:14:15Z"},{"alias_kind":"pith_short_12","alias_value":"JUEE6EBR3QO5","created_at":"2026-07-05T11:14:15Z"},{"alias_kind":"pith_short_16","alias_value":"JUEE6EBR3QO53VPH","created_at":"2026-07-05T11:14:15Z"},{"alias_kind":"pith_short_8","alias_value":"JUEE6EBR","created_at":"2026-07-05T11:14:15Z"}],"graph_snapshots":[{"event_id":"sha256:cce61290de27cc8b49a13d68b3329d9c49c7d1743abd05f9865827ec16e3a58a","target":"graph","created_at":"2026-07-05T11:14:15Z","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/2506.01552/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Hierarchical classification offers an approach to incorporate the concept of mistake severity by leveraging a structured, labeled hierarchy. However, decoding in such settings frequently relies on heuristic decision rules, which may not align with task-specific evaluation metrics. In this work, we propose a framework for the optimal decoding of an output probability distribution with respect to a target metric. We derive optimal decision rules for increasingly complex prediction settings, providing universal algorithms when candidates are limited to the set of nodes. In the most general case o","authors_text":"Alexandre Perez-Lebel, Antoine Saillenfest, Matthieu Labeau, Roman Plaud, Thomas Bonald","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-02T11:29:40Z","title":"To Each Metric Its Decoding: Post-Hoc Optimal Decision Rules of Probabilistic Hierarchical Classifiers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01552","kind":"arxiv","version":1},"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:e98cb9b300a524670ffc7cb5b1b9bcb7daa601aa24cf649bbdc24507db733db4","target":"record","created_at":"2026-07-05T11:14:15Z","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":"6c4b969445049d2970189b039417103f71b2111ea8675b9b6d559b0eacf5c120","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-02T11:29:40Z","title_canon_sha256":"ca62997b95ceb01ff4b9b8a6a95e7db1b584a43c6185ac65a17a17413f0845fa"},"schema_version":"1.0","source":{"id":"2506.01552","kind":"arxiv","version":1}},"canonical_sha256":"4d084f1031dc1dddd5e764b010c84271f23cf2e73e1909ac118117cfc3e6a7a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d084f1031dc1dddd5e764b010c84271f23cf2e73e1909ac118117cfc3e6a7a6","first_computed_at":"2026-07-05T11:14:15.655004Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:14:15.655004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eLasfnVHKlL254cwQZ6Y1/48Mnpm7ZMNroa9aOfdIo3soSa5Jq5cma35hVh1ie1BPmmg7UMjCnzuzX4dKWdOAw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:14:15.655564Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.01552","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e98cb9b300a524670ffc7cb5b1b9bcb7daa601aa24cf649bbdc24507db733db4","sha256:cce61290de27cc8b49a13d68b3329d9c49c7d1743abd05f9865827ec16e3a58a"],"state_sha256":"261a11bd6a5b51d8fe40679a1e51181c03d237088ff23f2f776da75937299040"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VHfMXrr+kTvC4R0aiPcwBm2GwiD1pkaKiF4Z0B86JlU2/qrqnjt6hzYWFlS1+FZTHM0oCxfWPbGODnLkpdLKDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T07:05:58.295942Z","bundle_sha256":"34ea669556ff06f6f475dc5b5be1b7a9162bbe7a706aa4b1461c5fe448411298"}}