{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:BR7UX3H52WYG7KVZ5VYYZV6NRK","short_pith_number":"pith:BR7UX3H5","canonical_record":{"source":{"id":"1009.2009","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-09-10T13:25:05Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"110d2e8f70aaf2ed44891146250ee6b5ac084e6747c3ac28108b0efcd2fd4581","abstract_canon_sha256":"7549b4dc9b7ce857d13a3f4c70987b3339f51021ff109aaf81cebd73ee4a830d"},"schema_version":"1.0"},"canonical_sha256":"0c7f4becfdd5b06faab9ed718cd7cd8a8ea890e3ecfbe598fe5205a56c524643","source":{"kind":"arxiv","id":"1009.2009","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.2009","created_at":"2026-05-18T04:41:05Z"},{"alias_kind":"arxiv_version","alias_value":"1009.2009v1","created_at":"2026-05-18T04:41:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2009","created_at":"2026-05-18T04:41:05Z"},{"alias_kind":"pith_short_12","alias_value":"BR7UX3H52WYG","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"BR7UX3H52WYG7KVZ","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"BR7UX3H5","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:BR7UX3H52WYG7KVZ5VYYZV6NRK","target":"record","payload":{"canonical_record":{"source":{"id":"1009.2009","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-09-10T13:25:05Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"110d2e8f70aaf2ed44891146250ee6b5ac084e6747c3ac28108b0efcd2fd4581","abstract_canon_sha256":"7549b4dc9b7ce857d13a3f4c70987b3339f51021ff109aaf81cebd73ee4a830d"},"schema_version":"1.0"},"canonical_sha256":"0c7f4becfdd5b06faab9ed718cd7cd8a8ea890e3ecfbe598fe5205a56c524643","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:05.595723Z","signature_b64":"8f26Uo6vSxG1musmUyTy3rRCnqhwkAJOScCOa/mD2lOU6pHMovHuvv6op6sYo228YJRsIlEG1i9YSHcR+5KXCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c7f4becfdd5b06faab9ed718cd7cd8a8ea890e3ecfbe598fe5205a56c524643","last_reissued_at":"2026-05-18T04:41:05.595269Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:05.595269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.2009","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-18T04:41:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SKilN0ON6kM5iTM9kNTz/2L3BuUmm4oPtDkPfjSw/XqyaFWAwls7GbhPS1e3ZFpeiJL5Ues1M14PRRnzHhW/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:23:58.880002Z"},"content_sha256":"ee08ad4b670f6156f6cadd41051be9b00d4d40d21fa928b411f9a081703cc12f","schema_version":"1.0","event_id":"sha256:ee08ad4b670f6156f6cadd41051be9b00d4d40d21fa928b411f9a081703cc12f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:BR7UX3H52WYG7KVZ5VYYZV6NRK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hierarchical Semi-Markov Conditional Random Fields for Recursive Sequential Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"stat.ML","authors_text":"Dinh Q. Phung, Hung H. Bui, Svetha Venkatesh, Tran The Truyen","submitted_at":"2010-09-10T13:25:05Z","abstract_excerpt":"Inspired by the hierarchical hidden Markov models (HHMM), we present the hierarchical semi-Markov conditional random field (HSCRF), a generalisation of embedded undirectedMarkov chains tomodel complex hierarchical, nestedMarkov processes. It is parameterised in a discriminative framework and has polynomial time algorithms for learning and inference. Importantly, we consider partiallysupervised learning and propose algorithms for generalised partially-supervised learning and constrained inference. We demonstrate the HSCRF in two applications: (i) recognising human activities of daily living (AD"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.2009","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-18T04:41:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r/DUKrHgcTY03nJYpB6wh9s32MXVZHVzqzeIspwylhMpF63j8beWeTWL26GuDALQlUJPOP5dHH+2srXKd7d8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:23:58.880359Z"},"content_sha256":"77ded873296c8c378a02d730fddc84e16eef1d0ddd447dcabb898d0543664fee","schema_version":"1.0","event_id":"sha256:77ded873296c8c378a02d730fddc84e16eef1d0ddd447dcabb898d0543664fee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BR7UX3H52WYG7KVZ5VYYZV6NRK/bundle.json","state_url":"https://pith.science/pith/BR7UX3H52WYG7KVZ5VYYZV6NRK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BR7UX3H52WYG7KVZ5VYYZV6NRK/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-05T12:23:58Z","links":{"resolver":"https://pith.science/pith/BR7UX3H52WYG7KVZ5VYYZV6NRK","bundle":"https://pith.science/pith/BR7UX3H52WYG7KVZ5VYYZV6NRK/bundle.json","state":"https://pith.science/pith/BR7UX3H52WYG7KVZ5VYYZV6NRK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BR7UX3H52WYG7KVZ5VYYZV6NRK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:BR7UX3H52WYG7KVZ5VYYZV6NRK","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":"7549b4dc9b7ce857d13a3f4c70987b3339f51021ff109aaf81cebd73ee4a830d","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-09-10T13:25:05Z","title_canon_sha256":"110d2e8f70aaf2ed44891146250ee6b5ac084e6747c3ac28108b0efcd2fd4581"},"schema_version":"1.0","source":{"id":"1009.2009","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.2009","created_at":"2026-05-18T04:41:05Z"},{"alias_kind":"arxiv_version","alias_value":"1009.2009v1","created_at":"2026-05-18T04:41:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2009","created_at":"2026-05-18T04:41:05Z"},{"alias_kind":"pith_short_12","alias_value":"BR7UX3H52WYG","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"BR7UX3H52WYG7KVZ","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"BR7UX3H5","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:77ded873296c8c378a02d730fddc84e16eef1d0ddd447dcabb898d0543664fee","target":"graph","created_at":"2026-05-18T04:41:05Z","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":"Inspired by the hierarchical hidden Markov models (HHMM), we present the hierarchical semi-Markov conditional random field (HSCRF), a generalisation of embedded undirectedMarkov chains tomodel complex hierarchical, nestedMarkov processes. It is parameterised in a discriminative framework and has polynomial time algorithms for learning and inference. Importantly, we consider partiallysupervised learning and propose algorithms for generalised partially-supervised learning and constrained inference. We demonstrate the HSCRF in two applications: (i) recognising human activities of daily living (AD","authors_text":"Dinh Q. Phung, Hung H. Bui, Svetha Venkatesh, Tran The Truyen","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-09-10T13:25:05Z","title":"Hierarchical Semi-Markov Conditional Random Fields for Recursive Sequential Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.2009","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:ee08ad4b670f6156f6cadd41051be9b00d4d40d21fa928b411f9a081703cc12f","target":"record","created_at":"2026-05-18T04:41:05Z","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":"7549b4dc9b7ce857d13a3f4c70987b3339f51021ff109aaf81cebd73ee4a830d","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-09-10T13:25:05Z","title_canon_sha256":"110d2e8f70aaf2ed44891146250ee6b5ac084e6747c3ac28108b0efcd2fd4581"},"schema_version":"1.0","source":{"id":"1009.2009","kind":"arxiv","version":1}},"canonical_sha256":"0c7f4becfdd5b06faab9ed718cd7cd8a8ea890e3ecfbe598fe5205a56c524643","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c7f4becfdd5b06faab9ed718cd7cd8a8ea890e3ecfbe598fe5205a56c524643","first_computed_at":"2026-05-18T04:41:05.595269Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:05.595269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8f26Uo6vSxG1musmUyTy3rRCnqhwkAJOScCOa/mD2lOU6pHMovHuvv6op6sYo228YJRsIlEG1i9YSHcR+5KXCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:05.595723Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.2009","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee08ad4b670f6156f6cadd41051be9b00d4d40d21fa928b411f9a081703cc12f","sha256:77ded873296c8c378a02d730fddc84e16eef1d0ddd447dcabb898d0543664fee"],"state_sha256":"d750b2c10cec35ac3f05b7175b2c1be52d27445f27da485593556a055855e822"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Be22uxLvRUPZEq3cZebF/44K+e4XKy50XXafttWv4FMksvbZhiXaUgUgXZ34MoKCoNlELS1J7kHGk28spB6pAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:23:58.882393Z","bundle_sha256":"38ba69f6632569b40dd11279db1a6cce124ac672bf9a98c97ad32480afdf464e"}}