{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DWUSRQJ6U36XMXOMBZJHSXNWVM","short_pith_number":"pith:DWUSRQJ6","canonical_record":{"source":{"id":"1610.07685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2016-10-24T23:54:05Z","cross_cats_sorted":["cs.CC","cs.IT","math.IT","nlin.CD"],"title_canon_sha256":"0d85e868a9a1642187588e0ebc73f7a9163987d29c9c5d45f72e310b3af53099","abstract_canon_sha256":"62559bd20532630acad28d1322ff397657e15053e8e9fe55bd928ed0e2f0049d"},"schema_version":"1.0"},"canonical_sha256":"1da928c13ea6fd765dcc0e52795db6ab1eabf5905d839d225f855b9499e36413","source":{"kind":"arxiv","id":"1610.07685","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07685","created_at":"2026-05-18T00:47:09Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07685v1","created_at":"2026-05-18T00:47:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07685","created_at":"2026-05-18T00:47:09Z"},{"alias_kind":"pith_short_12","alias_value":"DWUSRQJ6U36X","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DWUSRQJ6U36XMXOM","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DWUSRQJ6","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DWUSRQJ6U36XMXOMBZJHSXNWVM","target":"record","payload":{"canonical_record":{"source":{"id":"1610.07685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2016-10-24T23:54:05Z","cross_cats_sorted":["cs.CC","cs.IT","math.IT","nlin.CD"],"title_canon_sha256":"0d85e868a9a1642187588e0ebc73f7a9163987d29c9c5d45f72e310b3af53099","abstract_canon_sha256":"62559bd20532630acad28d1322ff397657e15053e8e9fe55bd928ed0e2f0049d"},"schema_version":"1.0"},"canonical_sha256":"1da928c13ea6fd765dcc0e52795db6ab1eabf5905d839d225f855b9499e36413","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:09.453549Z","signature_b64":"FIBkhbJ8Ih2Z1qy+UWIst2X0McXhIFgoQKdpDEprWSp0ws/XEu902XGz0Rr4jcXFASOGye7yQRhvuX1CHcqOBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1da928c13ea6fd765dcc0e52795db6ab1eabf5905d839d225f855b9499e36413","last_reissued_at":"2026-05-18T00:47:09.452929Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:09.452929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.07685","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:47:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HOcZF4L3DWO6bbDzdsnOVWrhMgk378qFvFgcKM9pr52PbJrfD5bm2nk1WckkjCOtgy38lAR3KBLA5f1RYViNAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:17:46.028035Z"},"content_sha256":"908395f3f431c9299e90ac238e3d99788fc45ce60badc758ba7b0ad469d5e0a6","schema_version":"1.0","event_id":"sha256:908395f3f431c9299e90ac238e3d99788fc45ce60badc758ba7b0ad469d5e0a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DWUSRQJ6U36XMXOMBZJHSXNWVM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Markov Memory for Generating Rare Events","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":"C. Aghamohammadi, J. P. Crutchfield","submitted_at":"2016-10-24T23:54:05Z","abstract_excerpt":"We classify the rare events of structured, memoryful stochastic processes and use this to analyze sequential and parallel generators for these events. Given a stochastic process, we introduce a method to construct a new process whose typical realizations are a given process' rare events. This leads to an expression for the minimum memory required to generate rare events. We then show that the recently discovered classical-quantum ambiguity of simplicity also occurs when comparing the structure of process fluctuations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07685","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:47:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hao/WD7VFceYiY+n25fGqvh6wfb0qBFgMCAl53j9JYRl9UjebXoqQPDzx1ogezDKABbR2cvVPXm00PWUM8ygCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:17:46.028727Z"},"content_sha256":"96c936aa5f37ac661f031b7dd996b7b143aa29b8eec93177f027e4cda695493d","schema_version":"1.0","event_id":"sha256:96c936aa5f37ac661f031b7dd996b7b143aa29b8eec93177f027e4cda695493d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DWUSRQJ6U36XMXOMBZJHSXNWVM/bundle.json","state_url":"https://pith.science/pith/DWUSRQJ6U36XMXOMBZJHSXNWVM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DWUSRQJ6U36XMXOMBZJHSXNWVM/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-26T20:17:46Z","links":{"resolver":"https://pith.science/pith/DWUSRQJ6U36XMXOMBZJHSXNWVM","bundle":"https://pith.science/pith/DWUSRQJ6U36XMXOMBZJHSXNWVM/bundle.json","state":"https://pith.science/pith/DWUSRQJ6U36XMXOMBZJHSXNWVM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DWUSRQJ6U36XMXOMBZJHSXNWVM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DWUSRQJ6U36XMXOMBZJHSXNWVM","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":"62559bd20532630acad28d1322ff397657e15053e8e9fe55bd928ed0e2f0049d","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":"2016-10-24T23:54:05Z","title_canon_sha256":"0d85e868a9a1642187588e0ebc73f7a9163987d29c9c5d45f72e310b3af53099"},"schema_version":"1.0","source":{"id":"1610.07685","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07685","created_at":"2026-05-18T00:47:09Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07685v1","created_at":"2026-05-18T00:47:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07685","created_at":"2026-05-18T00:47:09Z"},{"alias_kind":"pith_short_12","alias_value":"DWUSRQJ6U36X","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DWUSRQJ6U36XMXOM","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DWUSRQJ6","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:96c936aa5f37ac661f031b7dd996b7b143aa29b8eec93177f027e4cda695493d","target":"graph","created_at":"2026-05-18T00:47:09Z","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":"We classify the rare events of structured, memoryful stochastic processes and use this to analyze sequential and parallel generators for these events. Given a stochastic process, we introduce a method to construct a new process whose typical realizations are a given process' rare events. This leads to an expression for the minimum memory required to generate rare events. We then show that the recently discovered classical-quantum ambiguity of simplicity also occurs when comparing the structure of process fluctuations.","authors_text":"C. Aghamohammadi, J. P. Crutchfield","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":"2016-10-24T23:54:05Z","title":"The Markov Memory for Generating Rare Events"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07685","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:908395f3f431c9299e90ac238e3d99788fc45ce60badc758ba7b0ad469d5e0a6","target":"record","created_at":"2026-05-18T00:47:09Z","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":"62559bd20532630acad28d1322ff397657e15053e8e9fe55bd928ed0e2f0049d","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":"2016-10-24T23:54:05Z","title_canon_sha256":"0d85e868a9a1642187588e0ebc73f7a9163987d29c9c5d45f72e310b3af53099"},"schema_version":"1.0","source":{"id":"1610.07685","kind":"arxiv","version":1}},"canonical_sha256":"1da928c13ea6fd765dcc0e52795db6ab1eabf5905d839d225f855b9499e36413","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1da928c13ea6fd765dcc0e52795db6ab1eabf5905d839d225f855b9499e36413","first_computed_at":"2026-05-18T00:47:09.452929Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:09.452929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FIBkhbJ8Ih2Z1qy+UWIst2X0McXhIFgoQKdpDEprWSp0ws/XEu902XGz0Rr4jcXFASOGye7yQRhvuX1CHcqOBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:09.453549Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.07685","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:908395f3f431c9299e90ac238e3d99788fc45ce60badc758ba7b0ad469d5e0a6","sha256:96c936aa5f37ac661f031b7dd996b7b143aa29b8eec93177f027e4cda695493d"],"state_sha256":"aa10e7a53010f7e6995bd44fdca26b350f0997c211d798be568dfa4cae8272a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jV/SW+6dHKzlxHZ3Ud1nEq2Z8sH6ZIgw6XOBtn7wzSzdSds8ULhAw+MIIX1sXZ+Ul4K9C6tXZRimPKlztjXVCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:17:46.032179Z","bundle_sha256":"903a9ee904898b65b5fb7c2cb35a06c888e422df647f7850137d559d20901a31"}}