{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KI4RDOCA5DTNJUWGL5A6J5SC7E","short_pith_number":"pith:KI4RDOCA","canonical_record":{"source":{"id":"1501.01300","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-12-20T22:09:26Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"289c8cd04bbd04883bd88792f8d458494b206fa750cefd1e5095915ea817a490","abstract_canon_sha256":"a3937856ade761e636cfa267fcc8ab03ed1cc437c6f5a96ccd047a9eedb9973e"},"schema_version":"1.0"},"canonical_sha256":"523911b840e8e6d4d2c65f41e4f642f92b1ae31b62dd6dade155de57b2971ed8","source":{"kind":"arxiv","id":"1501.01300","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01300","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01300v2","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01300","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"pith_short_12","alias_value":"KI4RDOCA5DTN","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KI4RDOCA5DTNJUWG","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KI4RDOCA","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KI4RDOCA5DTNJUWGL5A6J5SC7E","target":"record","payload":{"canonical_record":{"source":{"id":"1501.01300","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-12-20T22:09:26Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"289c8cd04bbd04883bd88792f8d458494b206fa750cefd1e5095915ea817a490","abstract_canon_sha256":"a3937856ade761e636cfa267fcc8ab03ed1cc437c6f5a96ccd047a9eedb9973e"},"schema_version":"1.0"},"canonical_sha256":"523911b840e8e6d4d2c65f41e4f642f92b1ae31b62dd6dade155de57b2971ed8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:02.142710Z","signature_b64":"f/d3mkICj5WeKvUNCTr66TEW/71CbYcu5WvcuUKzX4W8Hx1RhwsqAhAbwtf7W5cWzt7haQPy+8+Jmn9Y3jWrAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"523911b840e8e6d4d2c65f41e4f642f92b1ae31b62dd6dade155de57b2971ed8","last_reissued_at":"2026-05-18T00:50:02.142086Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:02.142086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.01300","source_version":2,"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:50:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iTg2AqaUTNtUCrBc0wABFOk5tH1u7g2AFFIrmdHaqGHhet4OlAsqRHSl9Q4wTq/cgW3E5k/BYkayE+Ze+BV2Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T04:18:08.368032Z"},"content_sha256":"c3d5e2a3a9071bbc238f1e0209cae44b7136bbf8f7cc0ebc4d009ef30430fdc1","schema_version":"1.0","event_id":"sha256:c3d5e2a3a9071bbc238f1e0209cae44b7136bbf8f7cc0ebc4d009ef30430fdc1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KI4RDOCA5DTNJUWGL5A6J5SC7E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum Probabilistic Finite State Learning Problem on Finite Data Sets: Complexity, Solution and Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"cs.FL","authors_text":"Christopher Griffin, Elisabeth Paulson","submitted_at":"2014-12-20T22:09:26Z","abstract_excerpt":"In this paper, we study the problem of determining a minimum state probabilistic finite state machine capable of generating statistically identical symbol sequences to samples provided. This problem is qualitatively similar to the classical Hidden Markov Model problem and has been studied from a practical point of view in several works beginning with the work presented in: Shalizi, C.R., Shalizi, K.L., Crutchfield, J.P. (2002) \\textit{An algorithm for pattern discovery in time series.} Technical Report 02-10-060, Santa Fe Institute. arxiv.org/abs/cs.LG/0210025. We show that the underlying prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01300","kind":"arxiv","version":2},"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:50:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mHG3Y/OWpqYHjtp4LP0APtVUa6bRwKhy/UZfvnzdjyBef+5Ueq5Ep6+jWxlMYiiNbSnWW/AnKY4sg8ebxUCmBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T04:18:08.368392Z"},"content_sha256":"75290034a2ce73133e606ad5128f010c632094327351b9f02c8c81a4a578cc97","schema_version":"1.0","event_id":"sha256:75290034a2ce73133e606ad5128f010c632094327351b9f02c8c81a4a578cc97"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KI4RDOCA5DTNJUWGL5A6J5SC7E/bundle.json","state_url":"https://pith.science/pith/KI4RDOCA5DTNJUWGL5A6J5SC7E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KI4RDOCA5DTNJUWGL5A6J5SC7E/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-06-28T04:18:08Z","links":{"resolver":"https://pith.science/pith/KI4RDOCA5DTNJUWGL5A6J5SC7E","bundle":"https://pith.science/pith/KI4RDOCA5DTNJUWGL5A6J5SC7E/bundle.json","state":"https://pith.science/pith/KI4RDOCA5DTNJUWGL5A6J5SC7E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KI4RDOCA5DTNJUWGL5A6J5SC7E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KI4RDOCA5DTNJUWGL5A6J5SC7E","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":"a3937856ade761e636cfa267fcc8ab03ed1cc437c6f5a96ccd047a9eedb9973e","cross_cats_sorted":["cs.DS","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-12-20T22:09:26Z","title_canon_sha256":"289c8cd04bbd04883bd88792f8d458494b206fa750cefd1e5095915ea817a490"},"schema_version":"1.0","source":{"id":"1501.01300","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01300","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01300v2","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01300","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"pith_short_12","alias_value":"KI4RDOCA5DTN","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KI4RDOCA5DTNJUWG","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KI4RDOCA","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:75290034a2ce73133e606ad5128f010c632094327351b9f02c8c81a4a578cc97","target":"graph","created_at":"2026-05-18T00:50:02Z","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":"In this paper, we study the problem of determining a minimum state probabilistic finite state machine capable of generating statistically identical symbol sequences to samples provided. This problem is qualitatively similar to the classical Hidden Markov Model problem and has been studied from a practical point of view in several works beginning with the work presented in: Shalizi, C.R., Shalizi, K.L., Crutchfield, J.P. (2002) \\textit{An algorithm for pattern discovery in time series.} Technical Report 02-10-060, Santa Fe Institute. arxiv.org/abs/cs.LG/0210025. We show that the underlying prob","authors_text":"Christopher Griffin, Elisabeth Paulson","cross_cats":["cs.DS","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-12-20T22:09:26Z","title":"Minimum Probabilistic Finite State Learning Problem on Finite Data Sets: Complexity, Solution and Approximations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01300","kind":"arxiv","version":2},"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:c3d5e2a3a9071bbc238f1e0209cae44b7136bbf8f7cc0ebc4d009ef30430fdc1","target":"record","created_at":"2026-05-18T00:50:02Z","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":"a3937856ade761e636cfa267fcc8ab03ed1cc437c6f5a96ccd047a9eedb9973e","cross_cats_sorted":["cs.DS","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-12-20T22:09:26Z","title_canon_sha256":"289c8cd04bbd04883bd88792f8d458494b206fa750cefd1e5095915ea817a490"},"schema_version":"1.0","source":{"id":"1501.01300","kind":"arxiv","version":2}},"canonical_sha256":"523911b840e8e6d4d2c65f41e4f642f92b1ae31b62dd6dade155de57b2971ed8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"523911b840e8e6d4d2c65f41e4f642f92b1ae31b62dd6dade155de57b2971ed8","first_computed_at":"2026-05-18T00:50:02.142086Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:02.142086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f/d3mkICj5WeKvUNCTr66TEW/71CbYcu5WvcuUKzX4W8Hx1RhwsqAhAbwtf7W5cWzt7haQPy+8+Jmn9Y3jWrAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:02.142710Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.01300","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3d5e2a3a9071bbc238f1e0209cae44b7136bbf8f7cc0ebc4d009ef30430fdc1","sha256:75290034a2ce73133e606ad5128f010c632094327351b9f02c8c81a4a578cc97"],"state_sha256":"4bb2383aa2517842b54b682ffaab8615f87f127fb3ed550d9630ecfec9bc44af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"edgY0bt0jVWydbDrW0fOxSL1Y3e9eqhhCG+KQ0vk5W9pIcDJoQBY2PdR41GbP+ZOcrgkVe7p+SmLzt6iYUAwBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T04:18:08.370286Z","bundle_sha256":"1423a61097f51d93ca8c57c97aebd9a850e6f3055332f25056a62a0c6fb3cfdc"}}