{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PKVH2OO2QBPRRAY7THYS7KWSLY","short_pith_number":"pith:PKVH2OO2","canonical_record":{"source":{"id":"1408.1162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-08-06T02:04:43Z","cross_cats_sorted":["cs.LG","stat.ME"],"title_canon_sha256":"2d4c5695fe5965cc32c4ffb19e9fb086f8977d6c4aac6cdb8f5fae17f5aae5d3","abstract_canon_sha256":"29cb12d2a68478ca124b02642aea857dcee24ab19184fc3a312bcddadb9ecde1"},"schema_version":"1.0"},"canonical_sha256":"7aaa7d39da805f18831f99f12faad25e17158ae046b3faa3808bc707a174d709","source":{"kind":"arxiv","id":"1408.1162","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1162","created_at":"2026-05-18T02:45:48Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1162v1","created_at":"2026-05-18T02:45:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1162","created_at":"2026-05-18T02:45:48Z"},{"alias_kind":"pith_short_12","alias_value":"PKVH2OO2QBPR","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PKVH2OO2QBPRRAY7","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PKVH2OO2","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PKVH2OO2QBPRRAY7THYS7KWSLY","target":"record","payload":{"canonical_record":{"source":{"id":"1408.1162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-08-06T02:04:43Z","cross_cats_sorted":["cs.LG","stat.ME"],"title_canon_sha256":"2d4c5695fe5965cc32c4ffb19e9fb086f8977d6c4aac6cdb8f5fae17f5aae5d3","abstract_canon_sha256":"29cb12d2a68478ca124b02642aea857dcee24ab19184fc3a312bcddadb9ecde1"},"schema_version":"1.0"},"canonical_sha256":"7aaa7d39da805f18831f99f12faad25e17158ae046b3faa3808bc707a174d709","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:48.053119Z","signature_b64":"FW8k3/HJE5v33vVJYRoZIN3bjzgfUAUFsGiPx6wUKTF2G1flbfT5WNBa55Tuo8SMNoBkINCTeqftxSvcOr6ABw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7aaa7d39da805f18831f99f12faad25e17158ae046b3faa3808bc707a174d709","last_reissued_at":"2026-05-18T02:45:48.052627Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:48.052627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.1162","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-18T02:45:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jdoyyD+3q1VViXe2aEmtQiFB78MghNcz+FkzzPcvBvspSHReL3ST+7Y/ANgjmtBX7piNj2rN6TdxvRamx+XXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T18:14:56.632179Z"},"content_sha256":"035102c4d78b4633eebc764cbcb0447f7b20e917f8f1cf09c2f6cf0b31573bbb","schema_version":"1.0","event_id":"sha256:035102c4d78b4633eebc764cbcb0447f7b20e917f8f1cf09c2f6cf0b31573bbb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PKVH2OO2QBPRRAY7THYS7KWSLY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MCMC for Hierarchical Semi-Markov Conditional Random Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Dinh Phung, Hung H. Bui, Svetha Venkatesh, Truyen Tran","submitted_at":"2014-08-06T02:04:43Z","abstract_excerpt":"Deep architecture such as hierarchical semi-Markov models is an important class of models for nested sequential data. Current exact inference schemes either cost cubic time in sequence length, or exponential time in model depth. These costs are prohibitive for large-scale problems with arbitrary length and depth. In this contribution, we propose a new approximation technique that may have the potential to achieve sub-cubic time complexity in length and linear time depth, at the cost of some loss of quality. The idea is based on two well-known methods: Gibbs sampling and Rao-Blackwellisation. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1162","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-18T02:45:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z5IJ6D7GOHgEu4OtkvsUHczsEwcIksHOrGgcAXH1W6GGnH1s3iAtXaNDr2llP5fUDs4oNJG0c4H8HRvRIEW1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T18:14:56.632557Z"},"content_sha256":"6bb1795a7b6dffa9edc08751b00451c9bac47b142d155f0e1f908cd75a9b3152","schema_version":"1.0","event_id":"sha256:6bb1795a7b6dffa9edc08751b00451c9bac47b142d155f0e1f908cd75a9b3152"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PKVH2OO2QBPRRAY7THYS7KWSLY/bundle.json","state_url":"https://pith.science/pith/PKVH2OO2QBPRRAY7THYS7KWSLY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PKVH2OO2QBPRRAY7THYS7KWSLY/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-19T18:14:56Z","links":{"resolver":"https://pith.science/pith/PKVH2OO2QBPRRAY7THYS7KWSLY","bundle":"https://pith.science/pith/PKVH2OO2QBPRRAY7THYS7KWSLY/bundle.json","state":"https://pith.science/pith/PKVH2OO2QBPRRAY7THYS7KWSLY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PKVH2OO2QBPRRAY7THYS7KWSLY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PKVH2OO2QBPRRAY7THYS7KWSLY","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":"29cb12d2a68478ca124b02642aea857dcee24ab19184fc3a312bcddadb9ecde1","cross_cats_sorted":["cs.LG","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-08-06T02:04:43Z","title_canon_sha256":"2d4c5695fe5965cc32c4ffb19e9fb086f8977d6c4aac6cdb8f5fae17f5aae5d3"},"schema_version":"1.0","source":{"id":"1408.1162","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1162","created_at":"2026-05-18T02:45:48Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1162v1","created_at":"2026-05-18T02:45:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1162","created_at":"2026-05-18T02:45:48Z"},{"alias_kind":"pith_short_12","alias_value":"PKVH2OO2QBPR","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PKVH2OO2QBPRRAY7","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PKVH2OO2","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:6bb1795a7b6dffa9edc08751b00451c9bac47b142d155f0e1f908cd75a9b3152","target":"graph","created_at":"2026-05-18T02:45:48Z","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":"Deep architecture such as hierarchical semi-Markov models is an important class of models for nested sequential data. Current exact inference schemes either cost cubic time in sequence length, or exponential time in model depth. These costs are prohibitive for large-scale problems with arbitrary length and depth. In this contribution, we propose a new approximation technique that may have the potential to achieve sub-cubic time complexity in length and linear time depth, at the cost of some loss of quality. The idea is based on two well-known methods: Gibbs sampling and Rao-Blackwellisation. W","authors_text":"Dinh Phung, Hung H. Bui, Svetha Venkatesh, Truyen Tran","cross_cats":["cs.LG","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-08-06T02:04:43Z","title":"MCMC for Hierarchical Semi-Markov Conditional Random Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1162","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:035102c4d78b4633eebc764cbcb0447f7b20e917f8f1cf09c2f6cf0b31573bbb","target":"record","created_at":"2026-05-18T02:45:48Z","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":"29cb12d2a68478ca124b02642aea857dcee24ab19184fc3a312bcddadb9ecde1","cross_cats_sorted":["cs.LG","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-08-06T02:04:43Z","title_canon_sha256":"2d4c5695fe5965cc32c4ffb19e9fb086f8977d6c4aac6cdb8f5fae17f5aae5d3"},"schema_version":"1.0","source":{"id":"1408.1162","kind":"arxiv","version":1}},"canonical_sha256":"7aaa7d39da805f18831f99f12faad25e17158ae046b3faa3808bc707a174d709","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7aaa7d39da805f18831f99f12faad25e17158ae046b3faa3808bc707a174d709","first_computed_at":"2026-05-18T02:45:48.052627Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:48.052627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FW8k3/HJE5v33vVJYRoZIN3bjzgfUAUFsGiPx6wUKTF2G1flbfT5WNBa55Tuo8SMNoBkINCTeqftxSvcOr6ABw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:48.053119Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.1162","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:035102c4d78b4633eebc764cbcb0447f7b20e917f8f1cf09c2f6cf0b31573bbb","sha256:6bb1795a7b6dffa9edc08751b00451c9bac47b142d155f0e1f908cd75a9b3152"],"state_sha256":"37492b3fb5f072619dff8c1b3311549f6c9cfe25c76737a3d70b44f43167330e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tWizO6jgQfrHKu/9vVgkI/zvniEIgLjT1sZlEA+lN5w+AgAtJj2oJSEjuId8r10UlmnOVMv8Kvfb2VZLJquRCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T18:14:56.634870Z","bundle_sha256":"ff72e2aae91be1fdaf831136c03174e7125b66ddb7c553e37ae563ed92b85c7d"}}