{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VRKAZOILHXGHR2O3CY3UDE4BX2","short_pith_number":"pith:VRKAZOIL","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"},"canonical_sha256":"ac540cb90b3dcc78e9db1637419381beae997b4cf90ddee28a7b701fc5389287","source":{"kind":"arxiv","id":"1708.00113","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00113","created_at":"2026-05-18T00:23:34Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00113v1","created_at":"2026-05-18T00:23:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00113","created_at":"2026-05-18T00:23:34Z"},{"alias_kind":"pith_short_12","alias_value":"VRKAZOILHXGH","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VRKAZOILHXGHR2O3","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VRKAZOIL","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VRKAZOILHXGHR2O3CY3UDE4BX2","target":"record","payload":{"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"},"canonical_sha256":"ac540cb90b3dcc78e9db1637419381beae997b4cf90ddee28a7b701fc5389287","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"},"source_kind":"arxiv","source_id":"1708.00113","source_version":1,"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-18T00:23:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5qmB5XCP5qd3v3M91sdGy+M/49R0Msr8/VelhVNbggup9cnbFO4Ppg52xe4QrdfgkHZGZPzXJY1yBJac5oAXDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:15:14.458534Z"},"content_sha256":"2f88b9093b47ad5db1b03e2551dfe6bd5385f0fdfa125bade68e1abfc6b37660","schema_version":"1.0","event_id":"sha256:2f88b9093b47ad5db1b03e2551dfe6bd5385f0fdfa125bade68e1abfc6b37660"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VRKAZOILHXGHR2O3CY3UDE4BX2","target":"graph","payload":{"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"},"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-18T00:23:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zC+nnDGgNxtcSKmBapU0qEXGkWu9Oaqn26LMzEui6DCYnwYIuIjJ9Ize5r9Kl00tx70NbKU4Z+rFzK9tZcVjDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:15:14.459155Z"},"content_sha256":"bc113b623debb2527d9bfc097ad1ed561aaaf07401665e470a42e77380d526c8","schema_version":"1.0","event_id":"sha256:bc113b623debb2527d9bfc097ad1ed561aaaf07401665e470a42e77380d526c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VRKAZOILHXGHR2O3CY3UDE4BX2/bundle.json","state_url":"https://pith.science/pith/VRKAZOILHXGHR2O3CY3UDE4BX2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VRKAZOILHXGHR2O3CY3UDE4BX2/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-05-26T13:15:14Z","links":{"resolver":"https://pith.science/pith/VRKAZOILHXGHR2O3CY3UDE4BX2","bundle":"https://pith.science/pith/VRKAZOILHXGHR2O3CY3UDE4BX2/bundle.json","state":"https://pith.science/pith/VRKAZOILHXGHR2O3CY3UDE4BX2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VRKAZOILHXGHR2O3CY3UDE4BX2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VRKAZOILHXGHR2O3CY3UDE4BX2","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":"0f5210d5deedc3593e1f2af63a2b66b9746afb74c833b1a036d9d9f2b1b8122f","cross_cats_sorted":["cs.CC","cs.IT","math.IT","nlin.CD"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2017-08-01T00:26:05Z","title_canon_sha256":"3645c1e8ec51551399273178805f4f55368404960bf562492751fbc37e878304"},"schema_version":"1.0","source":{"id":"1708.00113","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00113","created_at":"2026-05-18T00:23:34Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00113v1","created_at":"2026-05-18T00:23:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00113","created_at":"2026-05-18T00:23:34Z"},{"alias_kind":"pith_short_12","alias_value":"VRKAZOILHXGH","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VRKAZOILHXGHR2O3","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VRKAZOIL","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:bc113b623debb2527d9bfc097ad1ed561aaaf07401665e470a42e77380d526c8","target":"graph","created_at":"2026-05-18T00:23:34Z","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":"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","authors_text":"J. P. Crutchfield, J. R. Mahoney, J. Ruebeck, R. G. James","cross_cats":["cs.CC","cs.IT","math.IT","nlin.CD"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2017-08-01T00:26:05Z","title":"Prediction and Generation of Binary Markov Processes: Can a Finite-State Fox Catch a Markov Mouse?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00113","kind":"arxiv","version":1},"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:2f88b9093b47ad5db1b03e2551dfe6bd5385f0fdfa125bade68e1abfc6b37660","target":"record","created_at":"2026-05-18T00:23:34Z","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":"0f5210d5deedc3593e1f2af63a2b66b9746afb74c833b1a036d9d9f2b1b8122f","cross_cats_sorted":["cs.CC","cs.IT","math.IT","nlin.CD"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2017-08-01T00:26:05Z","title_canon_sha256":"3645c1e8ec51551399273178805f4f55368404960bf562492751fbc37e878304"},"schema_version":"1.0","source":{"id":"1708.00113","kind":"arxiv","version":1}},"canonical_sha256":"ac540cb90b3dcc78e9db1637419381beae997b4cf90ddee28a7b701fc5389287","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac540cb90b3dcc78e9db1637419381beae997b4cf90ddee28a7b701fc5389287","first_computed_at":"2026-05-18T00:23:34.539663Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:34.539663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W6wvCt5GMYpzttxO8d+SLw5YWfYY7kc3tJtzbc1ipFiWvrUU+Wg8uIaDmYJW9pmkk3a2wx//LbhTHeI/KDZUAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:34.540277Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.00113","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f88b9093b47ad5db1b03e2551dfe6bd5385f0fdfa125bade68e1abfc6b37660","sha256:bc113b623debb2527d9bfc097ad1ed561aaaf07401665e470a42e77380d526c8"],"state_sha256":"0e34f711c11ae3e0ed2e68fa3258a396b05380bcea2bc2c20018f989cc2c2d51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZDzjT5S4FK/1K6OlfEN9ePM1Exci2tJDRXPauoXsYwPopsWKDVZGLVjnEu3BiTS+hKWC4Gp6r3F6ZX/Apzs6BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:15:14.463073Z","bundle_sha256":"57fc286a5dc4ac97b0f82bec981d22a2a5f52e47704db1970c1a807c6337f6c2"}}