{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VRKAZOILHXGHR2O3CY3UDE4BX2","short_pith_number":"pith:VRKAZOIL","schema_version":"1.0","canonical_sha256":"ac540cb90b3dcc78e9db1637419381beae997b4cf90ddee28a7b701fc5389287","source":{"kind":"arxiv","id":"1708.00113","version":1},"attestation_state":"computed","paper":{"title":"Prediction and Generation of Binary Markov Processes: Can a Finite-State Fox Catch a Markov Mouse?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT","nlin.CD"],"primary_cat":"cond-mat.stat-mech","authors_text":"J. P. Crutchfield, J. R. Mahoney, J. Ruebeck, R. G. James","submitted_at":"2017-08-01T00:26:05Z","abstract_excerpt":"Understanding the generative mechanism of a natural system is a vital component of the scientific method. Here, we investigate one of the fundamental steps toward this goal by presenting the minimal generator of an arbitrary binary Markov process. This is a class of processes whose predictive model is well known. Surprisingly, the generative model requires three distinct topologies for different regions of parameter space. We show that a previously proposed generator for a particular set of binary Markov processes is, in fact, not minimal. Our results shed the first quantitative light on the r"},"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":"1708.00113","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2017-08-01T00:26:05Z","cross_cats_sorted":["cs.CC","cs.IT","math.IT","nlin.CD"],"title_canon_sha256":"3645c1e8ec51551399273178805f4f55368404960bf562492751fbc37e878304","abstract_canon_sha256":"0f5210d5deedc3593e1f2af63a2b66b9746afb74c833b1a036d9d9f2b1b8122f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:34.540277Z","signature_b64":"W6wvCt5GMYpzttxO8d+SLw5YWfYY7kc3tJtzbc1ipFiWvrUU+Wg8uIaDmYJW9pmkk3a2wx//LbhTHeI/KDZUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac540cb90b3dcc78e9db1637419381beae997b4cf90ddee28a7b701fc5389287","last_reissued_at":"2026-05-18T00:23:34.539663Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:34.539663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Prediction and Generation of Binary Markov Processes: Can a Finite-State Fox Catch a Markov Mouse?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT","nlin.CD"],"primary_cat":"cond-mat.stat-mech","authors_text":"J. P. Crutchfield, J. R. Mahoney, J. Ruebeck, R. G. James","submitted_at":"2017-08-01T00:26:05Z","abstract_excerpt":"Understanding the generative mechanism of a natural system is a vital component of the scientific method. Here, we investigate one of the fundamental steps toward this goal by presenting the minimal generator of an arbitrary binary Markov process. This is a class of processes whose predictive model is well known. Surprisingly, the generative model requires three distinct topologies for different regions of parameter space. We show that a previously proposed generator for a particular set of binary Markov processes is, in fact, not minimal. Our results shed the first quantitative light on the r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00113","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":"1708.00113","created_at":"2026-05-18T00:23:34.539744+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.00113v1","created_at":"2026-05-18T00:23:34.539744+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00113","created_at":"2026-05-18T00:23:34.539744+00:00"},{"alias_kind":"pith_short_12","alias_value":"VRKAZOILHXGH","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VRKAZOILHXGHR2O3","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VRKAZOIL","created_at":"2026-05-18T12:31:49.984773+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/VRKAZOILHXGHR2O3CY3UDE4BX2","json":"https://pith.science/pith/VRKAZOILHXGHR2O3CY3UDE4BX2.json","graph_json":"https://pith.science/api/pith-number/VRKAZOILHXGHR2O3CY3UDE4BX2/graph.json","events_json":"https://pith.science/api/pith-number/VRKAZOILHXGHR2O3CY3UDE4BX2/events.json","paper":"https://pith.science/paper/VRKAZOIL"},"agent_actions":{"view_html":"https://pith.science/pith/VRKAZOILHXGHR2O3CY3UDE4BX2","download_json":"https://pith.science/pith/VRKAZOILHXGHR2O3CY3UDE4BX2.json","view_paper":"https://pith.science/paper/VRKAZOIL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.00113&json=true","fetch_graph":"https://pith.science/api/pith-number/VRKAZOILHXGHR2O3CY3UDE4BX2/graph.json","fetch_events":"https://pith.science/api/pith-number/VRKAZOILHXGHR2O3CY3UDE4BX2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VRKAZOILHXGHR2O3CY3UDE4BX2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VRKAZOILHXGHR2O3CY3UDE4BX2/action/storage_attestation","attest_author":"https://pith.science/pith/VRKAZOILHXGHR2O3CY3UDE4BX2/action/author_attestation","sign_citation":"https://pith.science/pith/VRKAZOILHXGHR2O3CY3UDE4BX2/action/citation_signature","submit_replication":"https://pith.science/pith/VRKAZOILHXGHR2O3CY3UDE4BX2/action/replication_record"}},"created_at":"2026-05-18T00:23:34.539744+00:00","updated_at":"2026-05-18T00:23:34.539744+00:00"}