{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OE3GDKUI4KRAQQWO4N2IMU7BA3","short_pith_number":"pith:OE3GDKUI","canonical_record":{"source":{"id":"1802.06771","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-02-17T12:51:06Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"779fd7cb8184156ccb4258818adca9b238be4f8fcfe07cfbf2ab1ddda446e626","abstract_canon_sha256":"857d7c747ef7045fecba690110b10e357b4d2c7daf7ff423e16880c0c3b2756e"},"schema_version":"1.0"},"canonical_sha256":"713661aa88e2a20842cee3748653e106efb923b01e6f1cbdeb5565a4fef3d0d9","source":{"kind":"arxiv","id":"1802.06771","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06771","created_at":"2026-05-18T00:22:54Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06771v1","created_at":"2026-05-18T00:22:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06771","created_at":"2026-05-18T00:22:54Z"},{"alias_kind":"pith_short_12","alias_value":"OE3GDKUI4KRA","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OE3GDKUI4KRAQQWO","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OE3GDKUI","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OE3GDKUI4KRAQQWO4N2IMU7BA3","target":"record","payload":{"canonical_record":{"source":{"id":"1802.06771","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-02-17T12:51:06Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"779fd7cb8184156ccb4258818adca9b238be4f8fcfe07cfbf2ab1ddda446e626","abstract_canon_sha256":"857d7c747ef7045fecba690110b10e357b4d2c7daf7ff423e16880c0c3b2756e"},"schema_version":"1.0"},"canonical_sha256":"713661aa88e2a20842cee3748653e106efb923b01e6f1cbdeb5565a4fef3d0d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:54.331749Z","signature_b64":"yPcBLDsmH8buosWxTz3oV7EF1q0NIa+5r0XeoVHv3nXIUV/68YBweWusoc26vy/QWZ5AbMivRjknoMfzQoPNDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"713661aa88e2a20842cee3748653e106efb923b01e6f1cbdeb5565a4fef3d0d9","last_reissued_at":"2026-05-18T00:22:54.331179Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:54.331179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.06771","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-05-18T00:22:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ps/W8PgJljqMrMjhyrdCk4iHsnLXIS8vS5Sv6sPhivPVVml+MyTYv2XcqhaQbyawtknXnHsKvCL2nY+Fy2UeBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T12:45:30.125799Z"},"content_sha256":"e170c5219aa291cc74ac103305d34be73f16da13b15296efeb57b18b21445915","schema_version":"1.0","event_id":"sha256:e170c5219aa291cc74ac103305d34be73f16da13b15296efeb57b18b21445915"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OE3GDKUI4KRAQQWO4N2IMU7BA3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayes-optimal Hierarchical Classification over Asymmetric Tree-Distance Loss","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Dheeraj Mekala, Harish Karnick, Purushottam Kar, Vivek Gupta","submitted_at":"2018-02-17T12:51:06Z","abstract_excerpt":"Hierarchical classification is supervised multi-class classification problem over the set of class labels organized according to a hierarchy. In this report, we study the work by Ramaswamy et. al. on hierarchical classification over symmetric tree distance loss. We extend the consistency of hierarchical classification algorithm over asymmetric tree distance loss. We design a $\\mathcal{O}(nk\\log{}n)$ algorithm to find Bayes optimal classification for a k-ary tree as a hierarchy. We show that under reasonable assumptions over asymmetric loss function, the Bayes optimal classification over this a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06771","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":""},"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-05-18T00:22:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2oa/UvEw588qxf4lDIb9wrXAB3K++DOGZvBNUb+MYyq5SKd6Y4PnheuHtVLT4hbxiPb6fMY5bWyeAeWOpQQOAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T12:45:30.126160Z"},"content_sha256":"499933a79d4989fc0011f482e5b9b90734894005097e1a4f604f6cdacccd5ff9","schema_version":"1.0","event_id":"sha256:499933a79d4989fc0011f482e5b9b90734894005097e1a4f604f6cdacccd5ff9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OE3GDKUI4KRAQQWO4N2IMU7BA3/bundle.json","state_url":"https://pith.science/pith/OE3GDKUI4KRAQQWO4N2IMU7BA3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OE3GDKUI4KRAQQWO4N2IMU7BA3/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-06-21T12:45:30Z","links":{"resolver":"https://pith.science/pith/OE3GDKUI4KRAQQWO4N2IMU7BA3","bundle":"https://pith.science/pith/OE3GDKUI4KRAQQWO4N2IMU7BA3/bundle.json","state":"https://pith.science/pith/OE3GDKUI4KRAQQWO4N2IMU7BA3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OE3GDKUI4KRAQQWO4N2IMU7BA3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OE3GDKUI4KRAQQWO4N2IMU7BA3","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":"857d7c747ef7045fecba690110b10e357b4d2c7daf7ff423e16880c0c3b2756e","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-02-17T12:51:06Z","title_canon_sha256":"779fd7cb8184156ccb4258818adca9b238be4f8fcfe07cfbf2ab1ddda446e626"},"schema_version":"1.0","source":{"id":"1802.06771","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06771","created_at":"2026-05-18T00:22:54Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06771v1","created_at":"2026-05-18T00:22:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06771","created_at":"2026-05-18T00:22:54Z"},{"alias_kind":"pith_short_12","alias_value":"OE3GDKUI4KRA","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OE3GDKUI4KRAQQWO","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OE3GDKUI","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:499933a79d4989fc0011f482e5b9b90734894005097e1a4f604f6cdacccd5ff9","target":"graph","created_at":"2026-05-18T00:22:54Z","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"},"paper":{"abstract_excerpt":"Hierarchical classification is supervised multi-class classification problem over the set of class labels organized according to a hierarchy. In this report, we study the work by Ramaswamy et. al. on hierarchical classification over symmetric tree distance loss. We extend the consistency of hierarchical classification algorithm over asymmetric tree distance loss. We design a $\\mathcal{O}(nk\\log{}n)$ algorithm to find Bayes optimal classification for a k-ary tree as a hierarchy. We show that under reasonable assumptions over asymmetric loss function, the Bayes optimal classification over this a","authors_text":"Dheeraj Mekala, Harish Karnick, Purushottam Kar, Vivek Gupta","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-02-17T12:51:06Z","title":"Bayes-optimal Hierarchical Classification over Asymmetric Tree-Distance Loss"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06771","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:e170c5219aa291cc74ac103305d34be73f16da13b15296efeb57b18b21445915","target":"record","created_at":"2026-05-18T00:22:54Z","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":"857d7c747ef7045fecba690110b10e357b4d2c7daf7ff423e16880c0c3b2756e","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-02-17T12:51:06Z","title_canon_sha256":"779fd7cb8184156ccb4258818adca9b238be4f8fcfe07cfbf2ab1ddda446e626"},"schema_version":"1.0","source":{"id":"1802.06771","kind":"arxiv","version":1}},"canonical_sha256":"713661aa88e2a20842cee3748653e106efb923b01e6f1cbdeb5565a4fef3d0d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"713661aa88e2a20842cee3748653e106efb923b01e6f1cbdeb5565a4fef3d0d9","first_computed_at":"2026-05-18T00:22:54.331179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:54.331179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yPcBLDsmH8buosWxTz3oV7EF1q0NIa+5r0XeoVHv3nXIUV/68YBweWusoc26vy/QWZ5AbMivRjknoMfzQoPNDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:54.331749Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06771","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e170c5219aa291cc74ac103305d34be73f16da13b15296efeb57b18b21445915","sha256:499933a79d4989fc0011f482e5b9b90734894005097e1a4f604f6cdacccd5ff9"],"state_sha256":"8b2f5f6068539fda50e3011546c787806152a8ff6ae5cbff9e9722b6d9820770"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v0VWmbwi3Z5OTYqApnOGNF9WDOdzsFfj2PIhzLoxc2oMrgmcqytjvQV7GnG90kXCc9Ja45sFu4R0azLRiXI0Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T12:45:30.128192Z","bundle_sha256":"c339972b7bf3695e759d82acdc68bd71d2822cdf001e222e323f4796ac3f6057"}}