{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RBD4R7NN3FGRMFRBOXWSEE4PTN","short_pith_number":"pith:RBD4R7NN","canonical_record":{"source":{"id":"1705.11105","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-31T14:08:03Z","cross_cats_sorted":[],"title_canon_sha256":"c3f8b15417a0b305a00af4dac4df442ab3350a9311768a5094239fc9e0b11d55","abstract_canon_sha256":"66c6d6f4b84fcc33392341fcac11f48f8ac142131993285a1da432fb8b78540c"},"schema_version":"1.0"},"canonical_sha256":"8847c8fdadd94d16162175ed22138f9b5fe46126bf5511b4bdda76cb5549276d","source":{"kind":"arxiv","id":"1705.11105","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.11105","created_at":"2026-05-18T00:26:12Z"},{"alias_kind":"arxiv_version","alias_value":"1705.11105v2","created_at":"2026-05-18T00:26:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.11105","created_at":"2026-05-18T00:26:12Z"},{"alias_kind":"pith_short_12","alias_value":"RBD4R7NN3FGR","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RBD4R7NN3FGRMFRB","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RBD4R7NN","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RBD4R7NN3FGRMFRBOXWSEE4PTN","target":"record","payload":{"canonical_record":{"source":{"id":"1705.11105","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-31T14:08:03Z","cross_cats_sorted":[],"title_canon_sha256":"c3f8b15417a0b305a00af4dac4df442ab3350a9311768a5094239fc9e0b11d55","abstract_canon_sha256":"66c6d6f4b84fcc33392341fcac11f48f8ac142131993285a1da432fb8b78540c"},"schema_version":"1.0"},"canonical_sha256":"8847c8fdadd94d16162175ed22138f9b5fe46126bf5511b4bdda76cb5549276d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:12.802274Z","signature_b64":"b4eDtqBkiDpL87EUKvUZsAEu1wiCRj9drvcsgkooFNxslpfKlWEw4WYf91VTSHEZKkxQxv8fO0WeKpD9x/axCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8847c8fdadd94d16162175ed22138f9b5fe46126bf5511b4bdda76cb5549276d","last_reissued_at":"2026-05-18T00:26:12.801786Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:12.801786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.11105","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-05-18T00:26:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l3eJqPUJELK8Vh3Bd4WijIoitI1iW0PnCAT5RVlS0VgoS/BBwlP0MMt1AoeRt2ZoKIDSXtK9GPqDa2u0X6ZRBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T13:09:05.037495Z"},"content_sha256":"70fe648183472744cb6d793467f717d0e7d49c74daecbc8125bdfcdfcb1a23d8","schema_version":"1.0","event_id":"sha256:70fe648183472744cb6d793467f717d0e7d49c74daecbc8125bdfcdfcb1a23d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RBD4R7NN3FGRMFRBOXWSEE4PTN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"HiNet: Hierarchical Classification with Neural Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Sean Saito, Zhenzhou Wu","submitted_at":"2017-05-31T14:08:03Z","abstract_excerpt":"Traditionally, classifying large hierarchical labels with more than 10000 distinct traces can only be achieved with flatten labels. Although flatten labels is feasible, it misses the hierarchical information in the labels. Hierarchical models like HSVM by \\cite{vural2004hierarchical} becomes impossible to train because of the sheer number of SVMs in the whole architecture. We developed a hierarchical architecture based on neural networks that is simple to train. Also, we derived an inference algorithm that can efficiently infer the MAP (maximum a posteriori) trace guaranteed by our theorems. F"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.11105","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":""},"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:26:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PURn5/deEFq7WuBoAvksvjJy8S3AwL9zk8oufZlV8tUu7XZkIclZFngXwwie+czX7vKZ6GAVyhI53z8BsVqSDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T13:09:05.097684Z"},"content_sha256":"b6b7339c8b79c4c3251baf9651fdce436ecbdb877a5964d14c7048b9dd4d8126","schema_version":"1.0","event_id":"sha256:b6b7339c8b79c4c3251baf9651fdce436ecbdb877a5964d14c7048b9dd4d8126"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RBD4R7NN3FGRMFRBOXWSEE4PTN/bundle.json","state_url":"https://pith.science/pith/RBD4R7NN3FGRMFRBOXWSEE4PTN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RBD4R7NN3FGRMFRBOXWSEE4PTN/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-13T13:09:05Z","links":{"resolver":"https://pith.science/pith/RBD4R7NN3FGRMFRBOXWSEE4PTN","bundle":"https://pith.science/pith/RBD4R7NN3FGRMFRBOXWSEE4PTN/bundle.json","state":"https://pith.science/pith/RBD4R7NN3FGRMFRBOXWSEE4PTN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RBD4R7NN3FGRMFRBOXWSEE4PTN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RBD4R7NN3FGRMFRBOXWSEE4PTN","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":"66c6d6f4b84fcc33392341fcac11f48f8ac142131993285a1da432fb8b78540c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-31T14:08:03Z","title_canon_sha256":"c3f8b15417a0b305a00af4dac4df442ab3350a9311768a5094239fc9e0b11d55"},"schema_version":"1.0","source":{"id":"1705.11105","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.11105","created_at":"2026-05-18T00:26:12Z"},{"alias_kind":"arxiv_version","alias_value":"1705.11105v2","created_at":"2026-05-18T00:26:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.11105","created_at":"2026-05-18T00:26:12Z"},{"alias_kind":"pith_short_12","alias_value":"RBD4R7NN3FGR","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RBD4R7NN3FGRMFRB","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RBD4R7NN","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:b6b7339c8b79c4c3251baf9651fdce436ecbdb877a5964d14c7048b9dd4d8126","target":"graph","created_at":"2026-05-18T00:26:12Z","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":"Traditionally, classifying large hierarchical labels with more than 10000 distinct traces can only be achieved with flatten labels. Although flatten labels is feasible, it misses the hierarchical information in the labels. Hierarchical models like HSVM by \\cite{vural2004hierarchical} becomes impossible to train because of the sheer number of SVMs in the whole architecture. We developed a hierarchical architecture based on neural networks that is simple to train. Also, we derived an inference algorithm that can efficiently infer the MAP (maximum a posteriori) trace guaranteed by our theorems. F","authors_text":"Sean Saito, Zhenzhou Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-31T14:08:03Z","title":"HiNet: Hierarchical Classification with Neural Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.11105","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:70fe648183472744cb6d793467f717d0e7d49c74daecbc8125bdfcdfcb1a23d8","target":"record","created_at":"2026-05-18T00:26:12Z","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":"66c6d6f4b84fcc33392341fcac11f48f8ac142131993285a1da432fb8b78540c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-31T14:08:03Z","title_canon_sha256":"c3f8b15417a0b305a00af4dac4df442ab3350a9311768a5094239fc9e0b11d55"},"schema_version":"1.0","source":{"id":"1705.11105","kind":"arxiv","version":2}},"canonical_sha256":"8847c8fdadd94d16162175ed22138f9b5fe46126bf5511b4bdda76cb5549276d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8847c8fdadd94d16162175ed22138f9b5fe46126bf5511b4bdda76cb5549276d","first_computed_at":"2026-05-18T00:26:12.801786Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:12.801786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b4eDtqBkiDpL87EUKvUZsAEu1wiCRj9drvcsgkooFNxslpfKlWEw4WYf91VTSHEZKkxQxv8fO0WeKpD9x/axCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:12.802274Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.11105","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70fe648183472744cb6d793467f717d0e7d49c74daecbc8125bdfcdfcb1a23d8","sha256:b6b7339c8b79c4c3251baf9651fdce436ecbdb877a5964d14c7048b9dd4d8126"],"state_sha256":"5ec9f2a9c6f634da99d06f039ab535b18d0ecf5b33feabe7ae7d50e43ce5f208"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8zR7PAKiP+bA4NhS9KryHBGKSQde8G4koB8PR7IU3z7nNa8ssO/XcBWK5EIN2HI2PSzTVTfCJLedBaW7yQVnAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T13:09:05.104373Z","bundle_sha256":"1e75848a4f0d15c904c6cde7eaf9a2b18ea4eff094b85d76ca24970994c32ead"}}