{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:SEQD7X76MUND6PGCBJCDFJIRXG","short_pith_number":"pith:SEQD7X76","canonical_record":{"source":{"id":"0809.4086","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2008-09-24T05:34:56Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"title_canon_sha256":"0439a0b2148b1470b4b3a196caf90969dc2691502e27b7c2dee214d38df37bd3","abstract_canon_sha256":"6e9ee14bd66bf23bfdc7397d36bf47ee31a52dfeb25795593433d5ec808ee665"},"schema_version":"1.0"},"canonical_sha256":"91203fdffe651a3f3cc20a4432a511b9a3f21f5a2165c11257c5454a578744a1","source":{"kind":"arxiv","id":"0809.4086","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0809.4086","created_at":"2026-05-18T04:31:52Z"},{"alias_kind":"arxiv_version","alias_value":"0809.4086v2","created_at":"2026-05-18T04:31:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.4086","created_at":"2026-05-18T04:31:52Z"},{"alias_kind":"pith_short_12","alias_value":"SEQD7X76MUND","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"SEQD7X76MUND6PGC","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"SEQD7X76","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:SEQD7X76MUND6PGCBJCDFJIRXG","target":"record","payload":{"canonical_record":{"source":{"id":"0809.4086","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2008-09-24T05:34:56Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"title_canon_sha256":"0439a0b2148b1470b4b3a196caf90969dc2691502e27b7c2dee214d38df37bd3","abstract_canon_sha256":"6e9ee14bd66bf23bfdc7397d36bf47ee31a52dfeb25795593433d5ec808ee665"},"schema_version":"1.0"},"canonical_sha256":"91203fdffe651a3f3cc20a4432a511b9a3f21f5a2165c11257c5454a578744a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:52.586260Z","signature_b64":"qpiT1bS84IOfXmou6mIgkdnsP92R85fLiIQMu44X2+lsJzPO+BbB/p/TjbwiYhN8gJiScarrwi6pwlPIBgzLAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91203fdffe651a3f3cc20a4432a511b9a3f21f5a2165c11257c5454a578744a1","last_reissued_at":"2026-05-18T04:31:52.585841Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:52.585841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0809.4086","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-18T04:31:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vQ0NMwnI7/p0KYc25uyDn3/xqErdjNeJkY21TkCC72sL6i+zrwtMUZr34ngh2K90SCqjTdUN5ZpE5aw6drYCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:09:47.786356Z"},"content_sha256":"2bc0c1f523c14ffc34b44a89e51981cfc550ad5a105340cc03738bb5ceb9523c","schema_version":"1.0","event_id":"sha256:2bc0c1f523c14ffc34b44a89e51981cfc550ad5a105340cc03738bb5ceb9523c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:SEQD7X76MUND6PGCBJCDFJIRXG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Hidden Markov Models using Non-Negative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"George Cybenko, Valentino Crespi","submitted_at":"2008-09-24T05:34:56Z","abstract_excerpt":"The Baum-Welsh algorithm together with its derivatives and variations has been the main technique for learning Hidden Markov Models (HMM) from observational data. We present an HMM learning algorithm based on the non-negative matrix factorization (NMF) of higher order Markovian statistics that is structurally different from the Baum-Welsh and its associated approaches. The described algorithm supports estimation of the number of recurrent states of an HMM and iterates the non-negative matrix factorization (NMF) algorithm to improve the learned HMM parameters. Numerical examples are provided as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0809.4086","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-18T04:31:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oEGUezHZ8FWtPtPWEkyF2J7Bd2rpvr5KcIKO7SbItqmZ0QxjTGY2C38/3tYmKoDUSmH08wzx8bBNrTOmlxsACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:09:47.786707Z"},"content_sha256":"26611da715d18661b9f26054153fd02ee3a08072ee061e4bfbe4dd3180e065bf","schema_version":"1.0","event_id":"sha256:26611da715d18661b9f26054153fd02ee3a08072ee061e4bfbe4dd3180e065bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SEQD7X76MUND6PGCBJCDFJIRXG/bundle.json","state_url":"https://pith.science/pith/SEQD7X76MUND6PGCBJCDFJIRXG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SEQD7X76MUND6PGCBJCDFJIRXG/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-07-06T18:09:47Z","links":{"resolver":"https://pith.science/pith/SEQD7X76MUND6PGCBJCDFJIRXG","bundle":"https://pith.science/pith/SEQD7X76MUND6PGCBJCDFJIRXG/bundle.json","state":"https://pith.science/pith/SEQD7X76MUND6PGCBJCDFJIRXG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SEQD7X76MUND6PGCBJCDFJIRXG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:SEQD7X76MUND6PGCBJCDFJIRXG","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":"6e9ee14bd66bf23bfdc7397d36bf47ee31a52dfeb25795593433d5ec808ee665","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2008-09-24T05:34:56Z","title_canon_sha256":"0439a0b2148b1470b4b3a196caf90969dc2691502e27b7c2dee214d38df37bd3"},"schema_version":"1.0","source":{"id":"0809.4086","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0809.4086","created_at":"2026-05-18T04:31:52Z"},{"alias_kind":"arxiv_version","alias_value":"0809.4086v2","created_at":"2026-05-18T04:31:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.4086","created_at":"2026-05-18T04:31:52Z"},{"alias_kind":"pith_short_12","alias_value":"SEQD7X76MUND","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"SEQD7X76MUND6PGC","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"SEQD7X76","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:26611da715d18661b9f26054153fd02ee3a08072ee061e4bfbe4dd3180e065bf","target":"graph","created_at":"2026-05-18T04:31:52Z","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":"The Baum-Welsh algorithm together with its derivatives and variations has been the main technique for learning Hidden Markov Models (HMM) from observational data. We present an HMM learning algorithm based on the non-negative matrix factorization (NMF) of higher order Markovian statistics that is structurally different from the Baum-Welsh and its associated approaches. The described algorithm supports estimation of the number of recurrent states of an HMM and iterates the non-negative matrix factorization (NMF) algorithm to improve the learned HMM parameters. Numerical examples are provided as","authors_text":"George Cybenko, Valentino Crespi","cross_cats":["cs.AI","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2008-09-24T05:34:56Z","title":"Learning Hidden Markov Models using Non-Negative Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0809.4086","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:2bc0c1f523c14ffc34b44a89e51981cfc550ad5a105340cc03738bb5ceb9523c","target":"record","created_at":"2026-05-18T04:31:52Z","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":"6e9ee14bd66bf23bfdc7397d36bf47ee31a52dfeb25795593433d5ec808ee665","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2008-09-24T05:34:56Z","title_canon_sha256":"0439a0b2148b1470b4b3a196caf90969dc2691502e27b7c2dee214d38df37bd3"},"schema_version":"1.0","source":{"id":"0809.4086","kind":"arxiv","version":2}},"canonical_sha256":"91203fdffe651a3f3cc20a4432a511b9a3f21f5a2165c11257c5454a578744a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91203fdffe651a3f3cc20a4432a511b9a3f21f5a2165c11257c5454a578744a1","first_computed_at":"2026-05-18T04:31:52.585841Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:31:52.585841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qpiT1bS84IOfXmou6mIgkdnsP92R85fLiIQMu44X2+lsJzPO+BbB/p/TjbwiYhN8gJiScarrwi6pwlPIBgzLAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:31:52.586260Z","signed_message":"canonical_sha256_bytes"},"source_id":"0809.4086","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2bc0c1f523c14ffc34b44a89e51981cfc550ad5a105340cc03738bb5ceb9523c","sha256:26611da715d18661b9f26054153fd02ee3a08072ee061e4bfbe4dd3180e065bf"],"state_sha256":"de0dbc6778ed8b892c000ca1eb7ff744c3d69378c06058bec668645e6ed07f0f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6QSfLhCnUN/981dXQVl1yucAXx4UIDADCJJ3bHGMGPQfziBbOpLn9S1qs6ORUZ2tQuh+Xm9leXcL6H0+hoWAAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T18:09:47.788661Z","bundle_sha256":"1d831d3d1f3b82ba77202d737a6df5042d59649017b87c6f8e49c62b2cd8e717"}}