{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RXAZHX6CBIPBOOOZQWQHPM5OAO","short_pith_number":"pith:RXAZHX6C","schema_version":"1.0","canonical_sha256":"8dc193dfc20a1e1739d985a077b3ae03ab5b48d3d93c4414acd420ea642484f7","source":{"kind":"arxiv","id":"1305.0321","version":1},"attestation_state":"computed","paper":{"title":"Hidden Markov Model Identifiability via Tensors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hung X. Nguyen, Matthew Roughan, Paul Tune","submitted_at":"2013-05-02T01:01:18Z","abstract_excerpt":"The prevalence of hidden Markov models (HMMs) in various applications of statistical signal processing and communications is a testament to the power and flexibility of the model. In this paper, we link the identifiability problem with tensor decomposition, in particular, the Canonical Polyadic decomposition. Using recent results in deriving uniqueness conditions for tensor decomposition, we are able to provide a necessary and sufficient condition for the identification of the parameters of discrete time finite alphabet HMMs. This result resolves a long standing open problem regarding the deri"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1305.0321","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-02T01:01:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"617024066042ac4188a4ce43daa4b2aec1ed44202e8027924fc6d0341f41726e","abstract_canon_sha256":"957ae80354fa571848a3c41f8f1cc4a72a86b367535ba1a077e2ba3f46d6f65c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:40.582204Z","signature_b64":"jgrcxSbONPHGzghH1EDzfq5eosc3yOfYjLAJnoeZwG2HQScvEPMrWTlRfE54FM2MTIrrJZPKHN9W6Zb9dyxtCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8dc193dfc20a1e1739d985a077b3ae03ab5b48d3d93c4414acd420ea642484f7","last_reissued_at":"2026-05-18T03:26:40.581746Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:40.581746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hidden Markov Model Identifiability via Tensors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hung X. Nguyen, Matthew Roughan, Paul Tune","submitted_at":"2013-05-02T01:01:18Z","abstract_excerpt":"The prevalence of hidden Markov models (HMMs) in various applications of statistical signal processing and communications is a testament to the power and flexibility of the model. In this paper, we link the identifiability problem with tensor decomposition, in particular, the Canonical Polyadic decomposition. Using recent results in deriving uniqueness conditions for tensor decomposition, we are able to provide a necessary and sufficient condition for the identification of the parameters of discrete time finite alphabet HMMs. This result resolves a long standing open problem regarding the deri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0321","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1305.0321","created_at":"2026-05-18T03:26:40.581817+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.0321v1","created_at":"2026-05-18T03:26:40.581817+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0321","created_at":"2026-05-18T03:26:40.581817+00:00"},{"alias_kind":"pith_short_12","alias_value":"RXAZHX6CBIPB","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"RXAZHX6CBIPBOOOZ","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"RXAZHX6C","created_at":"2026-05-18T12:27:59.945178+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RXAZHX6CBIPBOOOZQWQHPM5OAO","json":"https://pith.science/pith/RXAZHX6CBIPBOOOZQWQHPM5OAO.json","graph_json":"https://pith.science/api/pith-number/RXAZHX6CBIPBOOOZQWQHPM5OAO/graph.json","events_json":"https://pith.science/api/pith-number/RXAZHX6CBIPBOOOZQWQHPM5OAO/events.json","paper":"https://pith.science/paper/RXAZHX6C"},"agent_actions":{"view_html":"https://pith.science/pith/RXAZHX6CBIPBOOOZQWQHPM5OAO","download_json":"https://pith.science/pith/RXAZHX6CBIPBOOOZQWQHPM5OAO.json","view_paper":"https://pith.science/paper/RXAZHX6C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.0321&json=true","fetch_graph":"https://pith.science/api/pith-number/RXAZHX6CBIPBOOOZQWQHPM5OAO/graph.json","fetch_events":"https://pith.science/api/pith-number/RXAZHX6CBIPBOOOZQWQHPM5OAO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RXAZHX6CBIPBOOOZQWQHPM5OAO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RXAZHX6CBIPBOOOZQWQHPM5OAO/action/storage_attestation","attest_author":"https://pith.science/pith/RXAZHX6CBIPBOOOZQWQHPM5OAO/action/author_attestation","sign_citation":"https://pith.science/pith/RXAZHX6CBIPBOOOZQWQHPM5OAO/action/citation_signature","submit_replication":"https://pith.science/pith/RXAZHX6CBIPBOOOZQWQHPM5OAO/action/replication_record"}},"created_at":"2026-05-18T03:26:40.581817+00:00","updated_at":"2026-05-18T03:26:40.581817+00:00"}