{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3XEQMXIZGFSEANSXDLH5EL7YIW","short_pith_number":"pith:3XEQMXIZ","canonical_record":{"source":{"id":"1404.7520","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-04-29T20:36:55Z","cross_cats_sorted":[],"title_canon_sha256":"9bb55e601f0c381c174e4e33d01dcab4805e6e4a0038b0e6e389c117f5e9f840","abstract_canon_sha256":"a4d130317249e6e0a545009571cd60fc7b4ba08f14095a82f7e3f259d9cb8195"},"schema_version":"1.0"},"canonical_sha256":"ddc9065d1931644036571acfd22ff845a0ae2cf6c819baa5a4941c79a581e738","source":{"kind":"arxiv","id":"1404.7520","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.7520","created_at":"2026-05-18T02:39:25Z"},{"alias_kind":"arxiv_version","alias_value":"1404.7520v1","created_at":"2026-05-18T02:39:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.7520","created_at":"2026-05-18T02:39:25Z"},{"alias_kind":"pith_short_12","alias_value":"3XEQMXIZGFSE","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3XEQMXIZGFSEANSX","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3XEQMXIZ","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3XEQMXIZGFSEANSXDLH5EL7YIW","target":"record","payload":{"canonical_record":{"source":{"id":"1404.7520","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-04-29T20:36:55Z","cross_cats_sorted":[],"title_canon_sha256":"9bb55e601f0c381c174e4e33d01dcab4805e6e4a0038b0e6e389c117f5e9f840","abstract_canon_sha256":"a4d130317249e6e0a545009571cd60fc7b4ba08f14095a82f7e3f259d9cb8195"},"schema_version":"1.0"},"canonical_sha256":"ddc9065d1931644036571acfd22ff845a0ae2cf6c819baa5a4941c79a581e738","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:25.477030Z","signature_b64":"KjYlqOsBJjeIs2sf2sGAZn/SEeI78pZ7wYIOxVCwQhM0Jp+Kd7MqdgB80n8iDYQDJwNxBRt3bMi2NDFEMbZXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ddc9065d1931644036571acfd22ff845a0ae2cf6c819baa5a4941c79a581e738","last_reissued_at":"2026-05-18T02:39:25.476619Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:25.476619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.7520","source_version":1,"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:39:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K8r7Di+ZRXFldco7fkFLGnptcNnNcvQ6p5FhFFUt5dSNs2AjJ6zdnaAIWVSJcGpo347nK2iKsQK2GmPtK/iTBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:36:09.749823Z"},"content_sha256":"115565b50e8fd10a5001ae56e349f8a87d405561e0595a2e4864245632cce5b4","schema_version":"1.0","event_id":"sha256:115565b50e8fd10a5001ae56e349f8a87d405561e0595a2e4864245632cce5b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3XEQMXIZGFSEANSXDLH5EL7YIW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Measurement Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Subhash Kak","submitted_at":"2014-04-29T20:36:55Z","abstract_excerpt":"This paper explores the problem of quantum measurement complexity. In computability theory, the complexity of a problem is determined by how long it takes an effective algorithm to solve it. This complexity may be compared to the difficulty for a hypothetical oracle machine, the output of which may be verified by a computable function but cannot be simulated on a physical machine. We define a quantum oracle machine for measurements as one that can determine the state by examining a single copy. The complexity of measurement for a realizable machine will then be respect to the number of copies "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.7520","kind":"arxiv","version":1},"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:39:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8itabpy5eLd3r7iLy39lC55KZ6vWpdIHYOqsD172ey+piapsGGHj4vukwE6/3fKdLpGQMyEgRCpghzRzqz+7BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:36:09.750166Z"},"content_sha256":"ce2d8579c2f5a67a55771a5509fbdb749f62fb01d6902428f415a034959e28e9","schema_version":"1.0","event_id":"sha256:ce2d8579c2f5a67a55771a5509fbdb749f62fb01d6902428f415a034959e28e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3XEQMXIZGFSEANSXDLH5EL7YIW/bundle.json","state_url":"https://pith.science/pith/3XEQMXIZGFSEANSXDLH5EL7YIW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3XEQMXIZGFSEANSXDLH5EL7YIW/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-01T07:36:09Z","links":{"resolver":"https://pith.science/pith/3XEQMXIZGFSEANSXDLH5EL7YIW","bundle":"https://pith.science/pith/3XEQMXIZGFSEANSXDLH5EL7YIW/bundle.json","state":"https://pith.science/pith/3XEQMXIZGFSEANSXDLH5EL7YIW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3XEQMXIZGFSEANSXDLH5EL7YIW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3XEQMXIZGFSEANSXDLH5EL7YIW","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":"a4d130317249e6e0a545009571cd60fc7b4ba08f14095a82f7e3f259d9cb8195","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-04-29T20:36:55Z","title_canon_sha256":"9bb55e601f0c381c174e4e33d01dcab4805e6e4a0038b0e6e389c117f5e9f840"},"schema_version":"1.0","source":{"id":"1404.7520","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.7520","created_at":"2026-05-18T02:39:25Z"},{"alias_kind":"arxiv_version","alias_value":"1404.7520v1","created_at":"2026-05-18T02:39:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.7520","created_at":"2026-05-18T02:39:25Z"},{"alias_kind":"pith_short_12","alias_value":"3XEQMXIZGFSE","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3XEQMXIZGFSEANSX","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3XEQMXIZ","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:ce2d8579c2f5a67a55771a5509fbdb749f62fb01d6902428f415a034959e28e9","target":"graph","created_at":"2026-05-18T02:39:25Z","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":"This paper explores the problem of quantum measurement complexity. In computability theory, the complexity of a problem is determined by how long it takes an effective algorithm to solve it. This complexity may be compared to the difficulty for a hypothetical oracle machine, the output of which may be verified by a computable function but cannot be simulated on a physical machine. We define a quantum oracle machine for measurements as one that can determine the state by examining a single copy. The complexity of measurement for a realizable machine will then be respect to the number of copies ","authors_text":"Subhash Kak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-04-29T20:36:55Z","title":"Quantum Measurement Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.7520","kind":"arxiv","version":1},"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:115565b50e8fd10a5001ae56e349f8a87d405561e0595a2e4864245632cce5b4","target":"record","created_at":"2026-05-18T02:39:25Z","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":"a4d130317249e6e0a545009571cd60fc7b4ba08f14095a82f7e3f259d9cb8195","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-04-29T20:36:55Z","title_canon_sha256":"9bb55e601f0c381c174e4e33d01dcab4805e6e4a0038b0e6e389c117f5e9f840"},"schema_version":"1.0","source":{"id":"1404.7520","kind":"arxiv","version":1}},"canonical_sha256":"ddc9065d1931644036571acfd22ff845a0ae2cf6c819baa5a4941c79a581e738","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ddc9065d1931644036571acfd22ff845a0ae2cf6c819baa5a4941c79a581e738","first_computed_at":"2026-05-18T02:39:25.476619Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:25.476619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KjYlqOsBJjeIs2sf2sGAZn/SEeI78pZ7wYIOxVCwQhM0Jp+Kd7MqdgB80n8iDYQDJwNxBRt3bMi2NDFEMbZXAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:25.477030Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.7520","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:115565b50e8fd10a5001ae56e349f8a87d405561e0595a2e4864245632cce5b4","sha256:ce2d8579c2f5a67a55771a5509fbdb749f62fb01d6902428f415a034959e28e9"],"state_sha256":"f5863bd65d692b2601512fdd839860f540b83d7d0f0979ecde6645b4da3e69f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AOH5bjO1RHXLRR+U/bd1zS1Chz80jjmeIZqtwM4Yg8WQNaGRIbuujYVktKV87PVp5J6pXSmRtJCisiXZgi1VCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T07:36:09.752175Z","bundle_sha256":"6fa62b147de6bef890fb52dd3688364228a8b20e6fb7b2b95749e9c1e2ffdb8a"}}