{"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"}