{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JTDU4CAJCNGRPCWL3IV5IQPVYG","short_pith_number":"pith:JTDU4CAJ","schema_version":"1.0","canonical_sha256":"4cc74e0809134d178acbda2bd441f5c18614d69e88ff3c41795a85141beeba9d","source":{"kind":"arxiv","id":"1404.6255","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1404.6255","created_at":"2026-05-18T02:42:07.904075+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.6255v2","created_at":"2026-05-18T02:42:07.904075+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6255","created_at":"2026-05-18T02:42:07.904075+00:00"},{"alias_kind":"pith_short_12","alias_value":"JTDU4CAJCNGR","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"JTDU4CAJCNGRPCWL","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"JTDU4CAJ","created_at":"2026-05-18T12:28:35.611951+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JTDU4CAJCNGRPCWL3IV5IQPVYG","json":"https://pith.science/pith/JTDU4CAJCNGRPCWL3IV5IQPVYG.json","graph_json":"https://pith.science/api/pith-number/JTDU4CAJCNGRPCWL3IV5IQPVYG/graph.json","events_json":"https://pith.science/api/pith-number/JTDU4CAJCNGRPCWL3IV5IQPVYG/events.json","paper":"https://pith.science/paper/JTDU4CAJ"},"agent_actions":{"view_html":"https://pith.science/pith/JTDU4CAJCNGRPCWL3IV5IQPVYG","download_json":"https://pith.science/pith/JTDU4CAJCNGRPCWL3IV5IQPVYG.json","view_paper":"https://pith.science/paper/JTDU4CAJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.6255&json=true","fetch_graph":"https://pith.science/api/pith-number/JTDU4CAJCNGRPCWL3IV5IQPVYG/graph.json","fetch_events":"https://pith.science/api/pith-number/JTDU4CAJCNGRPCWL3IV5IQPVYG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JTDU4CAJCNGRPCWL3IV5IQPVYG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JTDU4CAJCNGRPCWL3IV5IQPVYG/action/storage_attestation","attest_author":"https://pith.science/pith/JTDU4CAJCNGRPCWL3IV5IQPVYG/action/author_attestation","sign_citation":"https://pith.science/pith/JTDU4CAJCNGRPCWL3IV5IQPVYG/action/citation_signature","submit_replication":"https://pith.science/pith/JTDU4CAJCNGRPCWL3IV5IQPVYG/action/replication_record"}},"created_at":"2026-05-18T02:42:07.904075+00:00","updated_at":"2026-05-18T02:42:07.904075+00:00"}