{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:YVTWMFBE4EKFQNFWICAZ5DTVO4","short_pith_number":"pith:YVTWMFBE","schema_version":"1.0","canonical_sha256":"c567661424e1145834b640819e8e7577177d79853d19c8c81a3490f7b4ea2aef","source":{"kind":"arxiv","id":"math/0606591","version":2},"attestation_state":"computed","paper":{"title":"Approximation of stationary processes by Hidden Markov Models","license":"","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"Angela Grassi, Lorenzo Finesso, Peter Spreij","submitted_at":"2006-06-23T11:20:43Z","abstract_excerpt":"We aim at the construction of a Hidden Markov Model (HMM) of assigned complexity (number of states of the underlying Markov chain) which best approximates, in Kullback-Leibler divergence rate, a given stationary process. We establish, under mild conditions, the existence of the divergence rate between a stationary process and an HMM. Since in general there is no analytic expression available for this divergence rate, we approximate it with a properly defined, and easily computable, divergence between Hankel matrices, which we use as our approximation criterion. We propose a three-step algorith"},"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":"math/0606591","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.OC","submitted_at":"2006-06-23T11:20:43Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"8dd87b0549ba79490ef38ce9f5b77732493f2aee4c05042517bde5d90a684624","abstract_canon_sha256":"9b69928774d75614d4cb10e3c3a88c8645bb960d2ed8622af0903d98283a0a62"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:26.325242Z","signature_b64":"4+/7DJfw7PEeJx5iFsGjVhhwiy6GiRnB4lrKtWEKz33F4V7ncK92mYyIAsYKktCBrXJ7HKNOqdEp8BA+WHbQDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c567661424e1145834b640819e8e7577177d79853d19c8c81a3490f7b4ea2aef","last_reissued_at":"2026-05-18T02:48:26.324743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:26.324743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation of stationary processes by Hidden Markov Models","license":"","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"Angela Grassi, Lorenzo Finesso, Peter Spreij","submitted_at":"2006-06-23T11:20:43Z","abstract_excerpt":"We aim at the construction of a Hidden Markov Model (HMM) of assigned complexity (number of states of the underlying Markov chain) which best approximates, in Kullback-Leibler divergence rate, a given stationary process. We establish, under mild conditions, the existence of the divergence rate between a stationary process and an HMM. Since in general there is no analytic expression available for this divergence rate, we approximate it with a properly defined, and easily computable, divergence between Hankel matrices, which we use as our approximation criterion. We propose a three-step algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0606591","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"math/0606591","created_at":"2026-05-18T02:48:26.324819+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0606591v2","created_at":"2026-05-18T02:48:26.324819+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0606591","created_at":"2026-05-18T02:48:26.324819+00:00"},{"alias_kind":"pith_short_12","alias_value":"YVTWMFBE4EKF","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"YVTWMFBE4EKFQNFW","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"YVTWMFBE","created_at":"2026-05-18T12:25:54.717736+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/YVTWMFBE4EKFQNFWICAZ5DTVO4","json":"https://pith.science/pith/YVTWMFBE4EKFQNFWICAZ5DTVO4.json","graph_json":"https://pith.science/api/pith-number/YVTWMFBE4EKFQNFWICAZ5DTVO4/graph.json","events_json":"https://pith.science/api/pith-number/YVTWMFBE4EKFQNFWICAZ5DTVO4/events.json","paper":"https://pith.science/paper/YVTWMFBE"},"agent_actions":{"view_html":"https://pith.science/pith/YVTWMFBE4EKFQNFWICAZ5DTVO4","download_json":"https://pith.science/pith/YVTWMFBE4EKFQNFWICAZ5DTVO4.json","view_paper":"https://pith.science/paper/YVTWMFBE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0606591&json=true","fetch_graph":"https://pith.science/api/pith-number/YVTWMFBE4EKFQNFWICAZ5DTVO4/graph.json","fetch_events":"https://pith.science/api/pith-number/YVTWMFBE4EKFQNFWICAZ5DTVO4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YVTWMFBE4EKFQNFWICAZ5DTVO4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YVTWMFBE4EKFQNFWICAZ5DTVO4/action/storage_attestation","attest_author":"https://pith.science/pith/YVTWMFBE4EKFQNFWICAZ5DTVO4/action/author_attestation","sign_citation":"https://pith.science/pith/YVTWMFBE4EKFQNFWICAZ5DTVO4/action/citation_signature","submit_replication":"https://pith.science/pith/YVTWMFBE4EKFQNFWICAZ5DTVO4/action/replication_record"}},"created_at":"2026-05-18T02:48:26.324819+00:00","updated_at":"2026-05-18T02:48:26.324819+00:00"}