{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JTDU4CAJCNGRPCWL3IV5IQPVYG","short_pith_number":"pith:JTDU4CAJ","canonical_record":{"source":{"id":"1404.6255","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-04-24T20:00:13Z","cross_cats_sorted":[],"title_canon_sha256":"90c0918cd869b9e588fa1b5143907e0afb3a29a0beeccb1581d76323d9cee009","abstract_canon_sha256":"f586d7b501259c96ece1950a9c4e4e7bd9563cc17bccb31953aa04afa29974ea"},"schema_version":"1.0"},"canonical_sha256":"4cc74e0809134d178acbda2bd441f5c18614d69e88ff3c41795a85141beeba9d","source":{"kind":"arxiv","id":"1404.6255","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6255","created_at":"2026-05-18T02:42:07Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6255v2","created_at":"2026-05-18T02:42:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6255","created_at":"2026-05-18T02:42:07Z"},{"alias_kind":"pith_short_12","alias_value":"JTDU4CAJCNGR","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JTDU4CAJCNGRPCWL","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JTDU4CAJ","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JTDU4CAJCNGRPCWL3IV5IQPVYG","target":"record","payload":{"canonical_record":{"source":{"id":"1404.6255","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-04-24T20:00:13Z","cross_cats_sorted":[],"title_canon_sha256":"90c0918cd869b9e588fa1b5143907e0afb3a29a0beeccb1581d76323d9cee009","abstract_canon_sha256":"f586d7b501259c96ece1950a9c4e4e7bd9563cc17bccb31953aa04afa29974ea"},"schema_version":"1.0"},"canonical_sha256":"4cc74e0809134d178acbda2bd441f5c18614d69e88ff3c41795a85141beeba9d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:07.904477Z","signature_b64":"2tpmCKh/ImyJAAe7i4sXYKDvbebemFmHyFQOUFnzev9CKPCAbWfBDBeWDsqQUDso531BC8ES3nTdMVicL1f/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cc74e0809134d178acbda2bd441f5c18614d69e88ff3c41795a85141beeba9d","last_reissued_at":"2026-05-18T02:42:07.904008Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:07.904008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.6255","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-18T02:42:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7DPfSjFdz7EGFI9wDYZ+cs7jSzfvCxOAlOHvXmbrLudX8YuekIDCZn1VNCMi8F+eKad3oieJoRRQjh2wUsYCAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:12:15.520377Z"},"content_sha256":"d4e332631cfb92dfed9a40b2f192c0f20d236b7a1b9cfe836d54c0a8742d1907","schema_version":"1.0","event_id":"sha256:d4e332631cfb92dfed9a40b2f192c0f20d236b7a1b9cfe836d54c0a8742d1907"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JTDU4CAJCNGRPCWL3IV5IQPVYG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Quantifying Complexity with Quantum Mechanics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel R. Terno, Jayne Thompson, Mile Gu, Ryan Tan, Vlatko Vedral","submitted_at":"2014-04-24T20:00:13Z","abstract_excerpt":"While we have intuitive notions of structure and complexity, the formalization of this intuition is non-trivial. The statistical complexity is a popular candidate. It is based on the idea that the complexity of a process can be quantified by the complexity of its simplest mathematical model - the model that requires the least past information for optimal future prediction. Here we review how such models, known as $\\epsilon$-machines can be further simplified through quantum logic, and explore the resulting consequences for understanding complexity. In particular, we propose a new measure of co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6255","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-18T02:42:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hiXhywl/br507Ct0xGJ3EEEQJGRipMpoVkeRUb0tLsiDG/vex84lWl/ACg24yyG5IJ8u4gSDq62yX/32eRmuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:12:15.521141Z"},"content_sha256":"0222e1583f37070901fcfd73efb2ad17f407675201ca71a1e89dd7f4a4edfe1c","schema_version":"1.0","event_id":"sha256:0222e1583f37070901fcfd73efb2ad17f407675201ca71a1e89dd7f4a4edfe1c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JTDU4CAJCNGRPCWL3IV5IQPVYG/bundle.json","state_url":"https://pith.science/pith/JTDU4CAJCNGRPCWL3IV5IQPVYG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JTDU4CAJCNGRPCWL3IV5IQPVYG/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-31T00:12:15Z","links":{"resolver":"https://pith.science/pith/JTDU4CAJCNGRPCWL3IV5IQPVYG","bundle":"https://pith.science/pith/JTDU4CAJCNGRPCWL3IV5IQPVYG/bundle.json","state":"https://pith.science/pith/JTDU4CAJCNGRPCWL3IV5IQPVYG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JTDU4CAJCNGRPCWL3IV5IQPVYG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JTDU4CAJCNGRPCWL3IV5IQPVYG","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":"f586d7b501259c96ece1950a9c4e4e7bd9563cc17bccb31953aa04afa29974ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-04-24T20:00:13Z","title_canon_sha256":"90c0918cd869b9e588fa1b5143907e0afb3a29a0beeccb1581d76323d9cee009"},"schema_version":"1.0","source":{"id":"1404.6255","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6255","created_at":"2026-05-18T02:42:07Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6255v2","created_at":"2026-05-18T02:42:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6255","created_at":"2026-05-18T02:42:07Z"},{"alias_kind":"pith_short_12","alias_value":"JTDU4CAJCNGR","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JTDU4CAJCNGRPCWL","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JTDU4CAJ","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:0222e1583f37070901fcfd73efb2ad17f407675201ca71a1e89dd7f4a4edfe1c","target":"graph","created_at":"2026-05-18T02:42:07Z","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":"While we have intuitive notions of structure and complexity, the formalization of this intuition is non-trivial. The statistical complexity is a popular candidate. It is based on the idea that the complexity of a process can be quantified by the complexity of its simplest mathematical model - the model that requires the least past information for optimal future prediction. Here we review how such models, known as $\\epsilon$-machines can be further simplified through quantum logic, and explore the resulting consequences for understanding complexity. In particular, we propose a new measure of co","authors_text":"Daniel R. Terno, Jayne Thompson, Mile Gu, Ryan Tan, Vlatko Vedral","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-04-24T20:00:13Z","title":"Towards Quantifying Complexity with Quantum Mechanics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6255","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:d4e332631cfb92dfed9a40b2f192c0f20d236b7a1b9cfe836d54c0a8742d1907","target":"record","created_at":"2026-05-18T02:42:07Z","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":"f586d7b501259c96ece1950a9c4e4e7bd9563cc17bccb31953aa04afa29974ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-04-24T20:00:13Z","title_canon_sha256":"90c0918cd869b9e588fa1b5143907e0afb3a29a0beeccb1581d76323d9cee009"},"schema_version":"1.0","source":{"id":"1404.6255","kind":"arxiv","version":2}},"canonical_sha256":"4cc74e0809134d178acbda2bd441f5c18614d69e88ff3c41795a85141beeba9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4cc74e0809134d178acbda2bd441f5c18614d69e88ff3c41795a85141beeba9d","first_computed_at":"2026-05-18T02:42:07.904008Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:07.904008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2tpmCKh/ImyJAAe7i4sXYKDvbebemFmHyFQOUFnzev9CKPCAbWfBDBeWDsqQUDso531BC8ES3nTdMVicL1f/AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:07.904477Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.6255","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4e332631cfb92dfed9a40b2f192c0f20d236b7a1b9cfe836d54c0a8742d1907","sha256:0222e1583f37070901fcfd73efb2ad17f407675201ca71a1e89dd7f4a4edfe1c"],"state_sha256":"90ff8d5790336d2923e6b8a47577e0c809d84b65f7690d206413e697ca1b144a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"orjQBesjz5jUjc28qCUKSqQ/zvyf0MgI3ibYKxnm4NmrJwawejXtVS2RngBqd9TV+/mWK0HZSA/lvxYzwTh5CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:12:15.525106Z","bundle_sha256":"e9c41092351ef2a09471ff010cd707ed676442e30e0edd77272495e542974bbe"}}