{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:EVULERC7W6L4F22CSWNJ2333KU","short_pith_number":"pith:EVULERC7","canonical_record":{"source":{"id":"1011.0036","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-10-30T00:15:14Z","cross_cats_sorted":["math.CO","math.DS","math.ST","nlin.CD","stat.TH"],"title_canon_sha256":"834ba6eb8028e4aa82ca6e4628b38c75fec6dd5c39bc3f9bf54e58fc8720f8f2","abstract_canon_sha256":"d0c25e76494c8d1e1f93a334c6177a7c85a724dfc7ef046bd190ec941a100151"},"schema_version":"1.0"},"canonical_sha256":"2568b2445fb797c2eb42959a9d6f7b5537f60c390df497eecd373e389869fcc9","source":{"kind":"arxiv","id":"1011.0036","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.0036","created_at":"2026-05-18T03:38:24Z"},{"alias_kind":"arxiv_version","alias_value":"1011.0036v3","created_at":"2026-05-18T03:38:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0036","created_at":"2026-05-18T03:38:24Z"},{"alias_kind":"pith_short_12","alias_value":"EVULERC7W6L4","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"EVULERC7W6L4F22C","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"EVULERC7","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:EVULERC7W6L4F22CSWNJ2333KU","target":"record","payload":{"canonical_record":{"source":{"id":"1011.0036","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-10-30T00:15:14Z","cross_cats_sorted":["math.CO","math.DS","math.ST","nlin.CD","stat.TH"],"title_canon_sha256":"834ba6eb8028e4aa82ca6e4628b38c75fec6dd5c39bc3f9bf54e58fc8720f8f2","abstract_canon_sha256":"d0c25e76494c8d1e1f93a334c6177a7c85a724dfc7ef046bd190ec941a100151"},"schema_version":"1.0"},"canonical_sha256":"2568b2445fb797c2eb42959a9d6f7b5537f60c390df497eecd373e389869fcc9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:24.033200Z","signature_b64":"HDcmB4vlqempN092zyvoyG5aLgMM71A2og46sWYrnmitOMGkGDdz9LBICCKrg9ISmhHFKVibjUVl8rztt6OrAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2568b2445fb797c2eb42959a9d6f7b5537f60c390df497eecd373e389869fcc9","last_reissued_at":"2026-05-18T03:38:24.032755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:24.032755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.0036","source_version":3,"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-18T03:38:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B/mWSTUZaDGJouc5X4ehqJGNGruAmgVVOayHfx0a4Hqpq+1izGn/qBvADVoUfEbT/MZsln4+XZ79gt8Dc5snAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:30:13.720434Z"},"content_sha256":"9213dcf38f361d4498fbae7137df141d8a073e4f26f9f96d14ab7c52cc9f829a","schema_version":"1.0","event_id":"sha256:9213dcf38f361d4498fbae7137df141d8a073e4f26f9f96d14ab7c52cc9f829a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:EVULERC7W6L4F22CSWNJ2333KU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enumerating Finitary Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.DS","math.ST","nlin.CD","stat.TH"],"primary_cat":"cs.FL","authors_text":"B. D. Johnson, C. J. Ellison, C. S. McTague, J. P. Crutchfield","submitted_at":"2010-10-30T00:15:14Z","abstract_excerpt":"We show how to efficiently enumerate a class of finite-memory stochastic processes using the causal representation of epsilon-machines. We characterize epsilon-machines in the language of automata theory and adapt a recent algorithm for generating accessible deterministic finite automata, pruning this over-large class down to that of epsilon-machines. As an application, we exactly enumerate topological epsilon-machines up to eight states and six-letter alphabets."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0036","kind":"arxiv","version":3},"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-18T03:38:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hFAPXlsMxr1DgFF6jKe4G1XRgV2Qk0pyJw7G89u03DDADgVmFlI5hwLdvX7MAtd2+Ygo0j2bWZ1JuNB4QdRcCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:30:13.721173Z"},"content_sha256":"6b76d4cf8d3c44dbd38dcd702908dff3a3f8fff5ff829658fcb60a1b11652e0e","schema_version":"1.0","event_id":"sha256:6b76d4cf8d3c44dbd38dcd702908dff3a3f8fff5ff829658fcb60a1b11652e0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EVULERC7W6L4F22CSWNJ2333KU/bundle.json","state_url":"https://pith.science/pith/EVULERC7W6L4F22CSWNJ2333KU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EVULERC7W6L4F22CSWNJ2333KU/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-26T16:30:13Z","links":{"resolver":"https://pith.science/pith/EVULERC7W6L4F22CSWNJ2333KU","bundle":"https://pith.science/pith/EVULERC7W6L4F22CSWNJ2333KU/bundle.json","state":"https://pith.science/pith/EVULERC7W6L4F22CSWNJ2333KU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EVULERC7W6L4F22CSWNJ2333KU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:EVULERC7W6L4F22CSWNJ2333KU","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":"d0c25e76494c8d1e1f93a334c6177a7c85a724dfc7ef046bd190ec941a100151","cross_cats_sorted":["math.CO","math.DS","math.ST","nlin.CD","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-10-30T00:15:14Z","title_canon_sha256":"834ba6eb8028e4aa82ca6e4628b38c75fec6dd5c39bc3f9bf54e58fc8720f8f2"},"schema_version":"1.0","source":{"id":"1011.0036","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.0036","created_at":"2026-05-18T03:38:24Z"},{"alias_kind":"arxiv_version","alias_value":"1011.0036v3","created_at":"2026-05-18T03:38:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0036","created_at":"2026-05-18T03:38:24Z"},{"alias_kind":"pith_short_12","alias_value":"EVULERC7W6L4","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"EVULERC7W6L4F22C","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"EVULERC7","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:6b76d4cf8d3c44dbd38dcd702908dff3a3f8fff5ff829658fcb60a1b11652e0e","target":"graph","created_at":"2026-05-18T03:38:24Z","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 show how to efficiently enumerate a class of finite-memory stochastic processes using the causal representation of epsilon-machines. We characterize epsilon-machines in the language of automata theory and adapt a recent algorithm for generating accessible deterministic finite automata, pruning this over-large class down to that of epsilon-machines. As an application, we exactly enumerate topological epsilon-machines up to eight states and six-letter alphabets.","authors_text":"B. D. Johnson, C. J. Ellison, C. S. McTague, J. P. Crutchfield","cross_cats":["math.CO","math.DS","math.ST","nlin.CD","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-10-30T00:15:14Z","title":"Enumerating Finitary Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0036","kind":"arxiv","version":3},"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:9213dcf38f361d4498fbae7137df141d8a073e4f26f9f96d14ab7c52cc9f829a","target":"record","created_at":"2026-05-18T03:38:24Z","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":"d0c25e76494c8d1e1f93a334c6177a7c85a724dfc7ef046bd190ec941a100151","cross_cats_sorted":["math.CO","math.DS","math.ST","nlin.CD","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-10-30T00:15:14Z","title_canon_sha256":"834ba6eb8028e4aa82ca6e4628b38c75fec6dd5c39bc3f9bf54e58fc8720f8f2"},"schema_version":"1.0","source":{"id":"1011.0036","kind":"arxiv","version":3}},"canonical_sha256":"2568b2445fb797c2eb42959a9d6f7b5537f60c390df497eecd373e389869fcc9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2568b2445fb797c2eb42959a9d6f7b5537f60c390df497eecd373e389869fcc9","first_computed_at":"2026-05-18T03:38:24.032755Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:24.032755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HDcmB4vlqempN092zyvoyG5aLgMM71A2og46sWYrnmitOMGkGDdz9LBICCKrg9ISmhHFKVibjUVl8rztt6OrAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:24.033200Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.0036","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9213dcf38f361d4498fbae7137df141d8a073e4f26f9f96d14ab7c52cc9f829a","sha256:6b76d4cf8d3c44dbd38dcd702908dff3a3f8fff5ff829658fcb60a1b11652e0e"],"state_sha256":"68e258603d010d1021bacfc328bd6625084e9a15aa565a288da100cd5c266396"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V97ZSm/L+UmD2xuBiR95cvBPxyO5+O6RUSVYDLXP2gLUGXptcTrIcnZEgKJqISvaNFkBZiyCqiWU7LWG8bz2CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:30:13.724914Z","bundle_sha256":"0cc322882be6cf8fa131214551c499672af70c9614c39a155b101961e69e09ce"}}