{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SCR4YOMY6FLEFN2DB2UYN3JMZV","short_pith_number":"pith:SCR4YOMY","canonical_record":{"source":{"id":"1708.03197","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2017-08-10T13:09:03Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"9b5e8133d2197fb950006dd644e2891554866f35e3131126f4838add9614ace7","abstract_canon_sha256":"e32b7919d2cd2f3c60e94e739c08372070042e32a1c2a0f9930218a6d91e399c"},"schema_version":"1.0"},"canonical_sha256":"90a3cc3998f15642b7430ea986ed2ccd5139afe681d3289ef0e44d58ac662643","source":{"kind":"arxiv","id":"1708.03197","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.03197","created_at":"2026-05-18T00:19:08Z"},{"alias_kind":"arxiv_version","alias_value":"1708.03197v3","created_at":"2026-05-18T00:19:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03197","created_at":"2026-05-18T00:19:08Z"},{"alias_kind":"pith_short_12","alias_value":"SCR4YOMY6FLE","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SCR4YOMY6FLEFN2D","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SCR4YOMY","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SCR4YOMY6FLEFN2DB2UYN3JMZV","target":"record","payload":{"canonical_record":{"source":{"id":"1708.03197","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2017-08-10T13:09:03Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"9b5e8133d2197fb950006dd644e2891554866f35e3131126f4838add9614ace7","abstract_canon_sha256":"e32b7919d2cd2f3c60e94e739c08372070042e32a1c2a0f9930218a6d91e399c"},"schema_version":"1.0"},"canonical_sha256":"90a3cc3998f15642b7430ea986ed2ccd5139afe681d3289ef0e44d58ac662643","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:08.807518Z","signature_b64":"591WCyurBeZ4uKMn6E8TI/4ZVBIBCTfiS5nghV9ayAKbeMyVQFgp5FLp689nH+Z3q7J42CXynKuwUoGvT6BvAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90a3cc3998f15642b7430ea986ed2ccd5139afe681d3289ef0e44d58ac662643","last_reissued_at":"2026-05-18T00:19:08.806806Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:08.806806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.03197","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-18T00:19:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b4MB83rhLvxxSG+ebZebXAUumQ+edq1vOM77MwU5Mj48G7sC43DKMvYl51CzZAfDp2QmXwjsqZ5VIXD7sM02DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:45:59.879208Z"},"content_sha256":"5c3affc38d1167ee785b1ab7409a225b85cf2f710ae57346e8ab76e2614d87ef","schema_version":"1.0","event_id":"sha256:5c3affc38d1167ee785b1ab7409a225b85cf2f710ae57346e8ab76e2614d87ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SCR4YOMY6FLEFN2DB2UYN3JMZV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some comments on computational mechanics, complexity measures, and all that","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"physics.data-an","authors_text":"Peter Grassberger","submitted_at":"2017-08-10T13:09:03Z","abstract_excerpt":"We comment on some conceptual and and technical problems related to computational mechanics, point out some errors in several papers, and straighten out some wrong priority claims. We present explicitly the correct algorithm for constructing a minimal unifilar hidden Markov model (\"$\\epsilon$-machine\") from a list of forbidden words and (exact) word probabilities in a stationary stochastic process, and we comment on inference when these probabilities are only approximately known. In particular we propose minimization of forecasting complexity as an alternative basis for statistical inference o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03197","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-18T00:19:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nK1YOluVqNvY2rB6nfKL9n149WTg9f6ACHMmgrhBw5tXYw3uUmd2DrBEopEHaMO4HHHg8NbyG3xwg9W20pbhAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:45:59.879870Z"},"content_sha256":"27c3a49f2688efcfa9fa63f2156a70ec7f6f1995fdeda4d8573e192c6c5dcb73","schema_version":"1.0","event_id":"sha256:27c3a49f2688efcfa9fa63f2156a70ec7f6f1995fdeda4d8573e192c6c5dcb73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SCR4YOMY6FLEFN2DB2UYN3JMZV/bundle.json","state_url":"https://pith.science/pith/SCR4YOMY6FLEFN2DB2UYN3JMZV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SCR4YOMY6FLEFN2DB2UYN3JMZV/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-26T22:45:59Z","links":{"resolver":"https://pith.science/pith/SCR4YOMY6FLEFN2DB2UYN3JMZV","bundle":"https://pith.science/pith/SCR4YOMY6FLEFN2DB2UYN3JMZV/bundle.json","state":"https://pith.science/pith/SCR4YOMY6FLEFN2DB2UYN3JMZV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SCR4YOMY6FLEFN2DB2UYN3JMZV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SCR4YOMY6FLEFN2DB2UYN3JMZV","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":"e32b7919d2cd2f3c60e94e739c08372070042e32a1c2a0f9930218a6d91e399c","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2017-08-10T13:09:03Z","title_canon_sha256":"9b5e8133d2197fb950006dd644e2891554866f35e3131126f4838add9614ace7"},"schema_version":"1.0","source":{"id":"1708.03197","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.03197","created_at":"2026-05-18T00:19:08Z"},{"alias_kind":"arxiv_version","alias_value":"1708.03197v3","created_at":"2026-05-18T00:19:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03197","created_at":"2026-05-18T00:19:08Z"},{"alias_kind":"pith_short_12","alias_value":"SCR4YOMY6FLE","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SCR4YOMY6FLEFN2D","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SCR4YOMY","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:27c3a49f2688efcfa9fa63f2156a70ec7f6f1995fdeda4d8573e192c6c5dcb73","target":"graph","created_at":"2026-05-18T00:19:08Z","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 comment on some conceptual and and technical problems related to computational mechanics, point out some errors in several papers, and straighten out some wrong priority claims. We present explicitly the correct algorithm for constructing a minimal unifilar hidden Markov model (\"$\\epsilon$-machine\") from a list of forbidden words and (exact) word probabilities in a stationary stochastic process, and we comment on inference when these probabilities are only approximately known. In particular we propose minimization of forecasting complexity as an alternative basis for statistical inference o","authors_text":"Peter Grassberger","cross_cats":["cond-mat.stat-mech"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2017-08-10T13:09:03Z","title":"Some comments on computational mechanics, complexity measures, and all that"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03197","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:5c3affc38d1167ee785b1ab7409a225b85cf2f710ae57346e8ab76e2614d87ef","target":"record","created_at":"2026-05-18T00:19:08Z","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":"e32b7919d2cd2f3c60e94e739c08372070042e32a1c2a0f9930218a6d91e399c","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2017-08-10T13:09:03Z","title_canon_sha256":"9b5e8133d2197fb950006dd644e2891554866f35e3131126f4838add9614ace7"},"schema_version":"1.0","source":{"id":"1708.03197","kind":"arxiv","version":3}},"canonical_sha256":"90a3cc3998f15642b7430ea986ed2ccd5139afe681d3289ef0e44d58ac662643","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90a3cc3998f15642b7430ea986ed2ccd5139afe681d3289ef0e44d58ac662643","first_computed_at":"2026-05-18T00:19:08.806806Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:08.806806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"591WCyurBeZ4uKMn6E8TI/4ZVBIBCTfiS5nghV9ayAKbeMyVQFgp5FLp689nH+Z3q7J42CXynKuwUoGvT6BvAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:08.807518Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.03197","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c3affc38d1167ee785b1ab7409a225b85cf2f710ae57346e8ab76e2614d87ef","sha256:27c3a49f2688efcfa9fa63f2156a70ec7f6f1995fdeda4d8573e192c6c5dcb73"],"state_sha256":"15efbd8cf27af209f6cb996bac2829d9967862669635f0e6b31d7ffc753721ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lEVUCccPvpJHC7VLC2+X7KOj8Uwyi29YCfFJC7wHhg+p5s3ywbXptH7RPIqW+0TyIk3xzfLhfYCF5XLje0QrAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:45:59.882841Z","bundle_sha256":"74019bb7e3e5244d10c2614ef6a62ba09255327b9e5a3375658cfc61a75e6c59"}}