{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2001:4SUJT3W6JIZG4WUGA7XJHDEPA5","short_pith_number":"pith:4SUJT3W6","schema_version":"1.0","canonical_sha256":"e4a899eede4a326e5a8607ee938c8f077cc617db522d2285d16c65db4f03074e","source":{"kind":"arxiv","id":"math/0107144","version":1},"attestation_state":"computed","paper":{"title":"On hidden Markov chains and finite stochastic systems","license":"","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Peter Spreij","submitted_at":"2001-07-20T09:27:44Z","abstract_excerpt":"In this paper we study various properties of finite stochastic systems or hidden Markov chains as they are alternatively called. We discuss their construction following different approaches and we also derive recursive filtering formulas for the different systems that we consider. The key tool is a simple lemma on conditional expectations."},"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/0107144","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2001-07-20T09:27:44Z","cross_cats_sorted":[],"title_canon_sha256":"7e68d2faf2f312dd2a0701fb9b6f680b504f80ac581719048501d83dd059b802","abstract_canon_sha256":"67ee31635135d1b0da104a09925c174df0b20c089efbd8ea15c9b90ddd871381"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:41.660755Z","signature_b64":"MIihb83WytkS2h086nONfeEt77w01W/sdveuUfNGgzYHJPBfY+itAVCh+/rjl02LCJii3hCud2ExCdWZa3wZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4a899eede4a326e5a8607ee938c8f077cc617db522d2285d16c65db4f03074e","last_reissued_at":"2026-05-18T02:47:41.660004Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:41.660004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On hidden Markov chains and finite stochastic systems","license":"","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Peter Spreij","submitted_at":"2001-07-20T09:27:44Z","abstract_excerpt":"In this paper we study various properties of finite stochastic systems or hidden Markov chains as they are alternatively called. We discuss their construction following different approaches and we also derive recursive filtering formulas for the different systems that we consider. The key tool is a simple lemma on conditional expectations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0107144","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":"math/0107144","created_at":"2026-05-18T02:47:41.660121+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0107144v1","created_at":"2026-05-18T02:47:41.660121+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0107144","created_at":"2026-05-18T02:47:41.660121+00:00"},{"alias_kind":"pith_short_12","alias_value":"4SUJT3W6JIZG","created_at":"2026-05-18T12:25:50.254431+00:00"},{"alias_kind":"pith_short_16","alias_value":"4SUJT3W6JIZG4WUG","created_at":"2026-05-18T12:25:50.254431+00:00"},{"alias_kind":"pith_short_8","alias_value":"4SUJT3W6","created_at":"2026-05-18T12:25:50.254431+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/4SUJT3W6JIZG4WUGA7XJHDEPA5","json":"https://pith.science/pith/4SUJT3W6JIZG4WUGA7XJHDEPA5.json","graph_json":"https://pith.science/api/pith-number/4SUJT3W6JIZG4WUGA7XJHDEPA5/graph.json","events_json":"https://pith.science/api/pith-number/4SUJT3W6JIZG4WUGA7XJHDEPA5/events.json","paper":"https://pith.science/paper/4SUJT3W6"},"agent_actions":{"view_html":"https://pith.science/pith/4SUJT3W6JIZG4WUGA7XJHDEPA5","download_json":"https://pith.science/pith/4SUJT3W6JIZG4WUGA7XJHDEPA5.json","view_paper":"https://pith.science/paper/4SUJT3W6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0107144&json=true","fetch_graph":"https://pith.science/api/pith-number/4SUJT3W6JIZG4WUGA7XJHDEPA5/graph.json","fetch_events":"https://pith.science/api/pith-number/4SUJT3W6JIZG4WUGA7XJHDEPA5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4SUJT3W6JIZG4WUGA7XJHDEPA5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4SUJT3W6JIZG4WUGA7XJHDEPA5/action/storage_attestation","attest_author":"https://pith.science/pith/4SUJT3W6JIZG4WUGA7XJHDEPA5/action/author_attestation","sign_citation":"https://pith.science/pith/4SUJT3W6JIZG4WUGA7XJHDEPA5/action/citation_signature","submit_replication":"https://pith.science/pith/4SUJT3W6JIZG4WUGA7XJHDEPA5/action/replication_record"}},"created_at":"2026-05-18T02:47:41.660121+00:00","updated_at":"2026-05-18T02:47:41.660121+00:00"}