{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6AP7HGOVVS5ZXSR4BSED4GDVEE","short_pith_number":"pith:6AP7HGOV","canonical_record":{"source":{"id":"1812.00647","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-12-03T10:34:01Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"1ddac2583e804c2775c45885af6eebd74096ed89ae949299901fba70d953478f","abstract_canon_sha256":"2b0dfb3cc6c615ac1894117194de8ee3074b1b85a1c28c549861c320e12d2a43"},"schema_version":"1.0"},"canonical_sha256":"f01ff399d5acbb9bca3c0c883e1875210b6b21f0b3d28856dd719fefc1bbdda5","source":{"kind":"arxiv","id":"1812.00647","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.00647","created_at":"2026-05-17T23:59:19Z"},{"alias_kind":"arxiv_version","alias_value":"1812.00647v1","created_at":"2026-05-17T23:59:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00647","created_at":"2026-05-17T23:59:19Z"},{"alias_kind":"pith_short_12","alias_value":"6AP7HGOVVS5Z","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6AP7HGOVVS5ZXSR4","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6AP7HGOV","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6AP7HGOVVS5ZXSR4BSED4GDVEE","target":"record","payload":{"canonical_record":{"source":{"id":"1812.00647","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-12-03T10:34:01Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"1ddac2583e804c2775c45885af6eebd74096ed89ae949299901fba70d953478f","abstract_canon_sha256":"2b0dfb3cc6c615ac1894117194de8ee3074b1b85a1c28c549861c320e12d2a43"},"schema_version":"1.0"},"canonical_sha256":"f01ff399d5acbb9bca3c0c883e1875210b6b21f0b3d28856dd719fefc1bbdda5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:19.320683Z","signature_b64":"xf7ls4N/HxlMB6zLcDumVQ390lMdSj9S00KuVID5vI6O4R1LHDrtuWJzmeoX9IPTft/TIBgbLJMR5O3nuy8OAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f01ff399d5acbb9bca3c0c883e1875210b6b21f0b3d28856dd719fefc1bbdda5","last_reissued_at":"2026-05-17T23:59:19.320355Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:19.320355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.00647","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-17T23:59:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7yRRdBHQ58qa6eRQvTVkvznO2cdza8KUzoskKSf70nR/lWcGKM4aKdKPm+OCRHOjv+/diRTjZDwGIcYFrQGcCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:34:36.599107Z"},"content_sha256":"a7fc00df3de5f44b85a0f4f685b9e52c5a02b82a3e644196299d6924323e8e20","schema_version":"1.0","event_id":"sha256:a7fc00df3de5f44b85a0f4f685b9e52c5a02b82a3e644196299d6924323e8e20"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6AP7HGOVVS5ZXSR4BSED4GDVEE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep Hierarchical Machine: a Flexible Divide-and-Conquer Architecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Shichao Li, Tim Cheng, Xin Yang","submitted_at":"2018-12-03T10:34:01Z","abstract_excerpt":"We propose Deep Hierarchical Machine (DHM), a model inspired from the divide-and-conquer strategy while emphasizing representation learning ability and flexibility. A stochastic routing framework as used by recent deep neural decision/regression forests is incorporated, but we remove the need to evaluate unnecessary computation paths by utilizing a different topology and introducing a probabilistic pruning technique. We also show a specified version of DHM (DSHM) for efficiency, which inherits the sparse feature extraction process as in traditional decision tree with pixel-difference feature. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00647","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-17T23:59:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y11jR1pGme6V0V0MC5rVdcuBxKi4zt3u27MEtxqwXfcmpej+m8Xs9uELRfvI2jk8Yj1bsrLanyL/340wx7DJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:34:36.599819Z"},"content_sha256":"32e7a49ebc72e0b179801a9cda664195643fd34b3317748bd334cae396f9eb7e","schema_version":"1.0","event_id":"sha256:32e7a49ebc72e0b179801a9cda664195643fd34b3317748bd334cae396f9eb7e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6AP7HGOVVS5ZXSR4BSED4GDVEE/bundle.json","state_url":"https://pith.science/pith/6AP7HGOVVS5ZXSR4BSED4GDVEE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6AP7HGOVVS5ZXSR4BSED4GDVEE/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-05-25T16:34:36Z","links":{"resolver":"https://pith.science/pith/6AP7HGOVVS5ZXSR4BSED4GDVEE","bundle":"https://pith.science/pith/6AP7HGOVVS5ZXSR4BSED4GDVEE/bundle.json","state":"https://pith.science/pith/6AP7HGOVVS5ZXSR4BSED4GDVEE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6AP7HGOVVS5ZXSR4BSED4GDVEE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6AP7HGOVVS5ZXSR4BSED4GDVEE","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":"2b0dfb3cc6c615ac1894117194de8ee3074b1b85a1c28c549861c320e12d2a43","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-12-03T10:34:01Z","title_canon_sha256":"1ddac2583e804c2775c45885af6eebd74096ed89ae949299901fba70d953478f"},"schema_version":"1.0","source":{"id":"1812.00647","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.00647","created_at":"2026-05-17T23:59:19Z"},{"alias_kind":"arxiv_version","alias_value":"1812.00647v1","created_at":"2026-05-17T23:59:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00647","created_at":"2026-05-17T23:59:19Z"},{"alias_kind":"pith_short_12","alias_value":"6AP7HGOVVS5Z","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6AP7HGOVVS5ZXSR4","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6AP7HGOV","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:32e7a49ebc72e0b179801a9cda664195643fd34b3317748bd334cae396f9eb7e","target":"graph","created_at":"2026-05-17T23:59:19Z","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":"We propose Deep Hierarchical Machine (DHM), a model inspired from the divide-and-conquer strategy while emphasizing representation learning ability and flexibility. A stochastic routing framework as used by recent deep neural decision/regression forests is incorporated, but we remove the need to evaluate unnecessary computation paths by utilizing a different topology and introducing a probabilistic pruning technique. We also show a specified version of DHM (DSHM) for efficiency, which inherits the sparse feature extraction process as in traditional decision tree with pixel-difference feature. ","authors_text":"Shichao Li, Tim Cheng, Xin Yang","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-12-03T10:34:01Z","title":"Deep Hierarchical Machine: a Flexible Divide-and-Conquer Architecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00647","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:a7fc00df3de5f44b85a0f4f685b9e52c5a02b82a3e644196299d6924323e8e20","target":"record","created_at":"2026-05-17T23:59:19Z","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":"2b0dfb3cc6c615ac1894117194de8ee3074b1b85a1c28c549861c320e12d2a43","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-12-03T10:34:01Z","title_canon_sha256":"1ddac2583e804c2775c45885af6eebd74096ed89ae949299901fba70d953478f"},"schema_version":"1.0","source":{"id":"1812.00647","kind":"arxiv","version":1}},"canonical_sha256":"f01ff399d5acbb9bca3c0c883e1875210b6b21f0b3d28856dd719fefc1bbdda5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f01ff399d5acbb9bca3c0c883e1875210b6b21f0b3d28856dd719fefc1bbdda5","first_computed_at":"2026-05-17T23:59:19.320355Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:19.320355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xf7ls4N/HxlMB6zLcDumVQ390lMdSj9S00KuVID5vI6O4R1LHDrtuWJzmeoX9IPTft/TIBgbLJMR5O3nuy8OAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:19.320683Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.00647","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7fc00df3de5f44b85a0f4f685b9e52c5a02b82a3e644196299d6924323e8e20","sha256:32e7a49ebc72e0b179801a9cda664195643fd34b3317748bd334cae396f9eb7e"],"state_sha256":"a92cba3f4952f060e8aca7e06d836b7983c53c49dad34913e42ffaf9a0650546"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Kbr1ODhnPgJZn3oqhYSVW6IWktBHuzgj/uEZyWfUq9bXG7CfRtQ1ky9MMHFnjief8h8Qpja6FUErRqvpCF1BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:34:36.602997Z","bundle_sha256":"676c5b9deee7b5712c09b83e114b441455fc24f663bd847e989c5ca8c418510e"}}