{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BPODG3EWHEEK3K6VORXFHF6A3N","short_pith_number":"pith:BPODG3EW","canonical_record":{"source":{"id":"1310.3991","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-10-15T10:27:21Z","cross_cats_sorted":[],"title_canon_sha256":"ba046d02167efaf4cd7e7d1601061db224d18084585d8ce1c2a2c29dfde2125e","abstract_canon_sha256":"af3192ce766db81a5e8687fda73c52d4d7c272d2b93999c9f5a31db19c9841b1"},"schema_version":"1.0"},"canonical_sha256":"0bdc336c963908adabd5746e5397c0db6a085df1a267de7dffb7848db348612d","source":{"kind":"arxiv","id":"1310.3991","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.3991","created_at":"2026-05-18T02:47:23Z"},{"alias_kind":"arxiv_version","alias_value":"1310.3991v3","created_at":"2026-05-18T02:47:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3991","created_at":"2026-05-18T02:47:23Z"},{"alias_kind":"pith_short_12","alias_value":"BPODG3EWHEEK","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BPODG3EWHEEK3K6V","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BPODG3EW","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BPODG3EWHEEK3K6VORXFHF6A3N","target":"record","payload":{"canonical_record":{"source":{"id":"1310.3991","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-10-15T10:27:21Z","cross_cats_sorted":[],"title_canon_sha256":"ba046d02167efaf4cd7e7d1601061db224d18084585d8ce1c2a2c29dfde2125e","abstract_canon_sha256":"af3192ce766db81a5e8687fda73c52d4d7c272d2b93999c9f5a31db19c9841b1"},"schema_version":"1.0"},"canonical_sha256":"0bdc336c963908adabd5746e5397c0db6a085df1a267de7dffb7848db348612d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:23.146367Z","signature_b64":"V/omq83O3H2ifPte7M0nRTWGVrA5TYK23DYRzvfWjhwOcbSraeElyheLh7XjDWcFQVVecuL6NUXAbQdyTUL3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0bdc336c963908adabd5746e5397c0db6a085df1a267de7dffb7848db348612d","last_reissued_at":"2026-05-18T02:47:23.145783Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:23.145783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.3991","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-18T02:47:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YpV5wLAEd1yyejSEeVRY8Uaq3t77RsX2YJ8O0H4lfNPAKghpk/XCK1lkRXHM/WMPyFvxlVKY92ZAXrCGfNuxCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:17:00.542227Z"},"content_sha256":"0717f7943ed4ec0926ac478f45124f132305d890fcae054b5502e9bf22ba4a11","schema_version":"1.0","event_id":"sha256:0717f7943ed4ec0926ac478f45124f132305d890fcae054b5502e9bf22ba4a11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BPODG3EWHEEK3K6VORXFHF6A3N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotic Compressibility of Entanglement and Classical Communication in Distributed Quantum Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Eyuri Wakakuwa, Mio Murao","submitted_at":"2013-10-15T10:27:21Z","abstract_excerpt":"We consider implementations of a bipartite unitary on many pairs of unknown input states by local operation and classical communication assisted by shared entanglement. We investigate to what extent the entanglement cost and the classical communication cost can be compressed by allowing nonzero but vanishing error in the asymptotic limit of infinite pairs. We show that a lower bound on the minimal entanglement cost, the forward classical communication cost, and the backward classical communication cost per pair is given by the Schmidt strength of the unitary. We also prove that an upper bound "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3991","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-18T02:47:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VogAD34LQSLAAmjTJUDqD2KPGKQqvUz91PIKO40DLL/hFtPpwGQsPUoFwy+NAIgvi0dQ/i5B17qc8N/9L2EYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:17:00.542596Z"},"content_sha256":"f0d23192d92cad3d3059744bd17f00f78c477df5c215618ff4a84234139f78e7","schema_version":"1.0","event_id":"sha256:f0d23192d92cad3d3059744bd17f00f78c477df5c215618ff4a84234139f78e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BPODG3EWHEEK3K6VORXFHF6A3N/bundle.json","state_url":"https://pith.science/pith/BPODG3EWHEEK3K6VORXFHF6A3N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BPODG3EWHEEK3K6VORXFHF6A3N/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-12T09:17:00Z","links":{"resolver":"https://pith.science/pith/BPODG3EWHEEK3K6VORXFHF6A3N","bundle":"https://pith.science/pith/BPODG3EWHEEK3K6VORXFHF6A3N/bundle.json","state":"https://pith.science/pith/BPODG3EWHEEK3K6VORXFHF6A3N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BPODG3EWHEEK3K6VORXFHF6A3N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BPODG3EWHEEK3K6VORXFHF6A3N","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":"af3192ce766db81a5e8687fda73c52d4d7c272d2b93999c9f5a31db19c9841b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-10-15T10:27:21Z","title_canon_sha256":"ba046d02167efaf4cd7e7d1601061db224d18084585d8ce1c2a2c29dfde2125e"},"schema_version":"1.0","source":{"id":"1310.3991","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.3991","created_at":"2026-05-18T02:47:23Z"},{"alias_kind":"arxiv_version","alias_value":"1310.3991v3","created_at":"2026-05-18T02:47:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3991","created_at":"2026-05-18T02:47:23Z"},{"alias_kind":"pith_short_12","alias_value":"BPODG3EWHEEK","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BPODG3EWHEEK3K6V","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BPODG3EW","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:f0d23192d92cad3d3059744bd17f00f78c477df5c215618ff4a84234139f78e7","target":"graph","created_at":"2026-05-18T02:47:23Z","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 consider implementations of a bipartite unitary on many pairs of unknown input states by local operation and classical communication assisted by shared entanglement. We investigate to what extent the entanglement cost and the classical communication cost can be compressed by allowing nonzero but vanishing error in the asymptotic limit of infinite pairs. We show that a lower bound on the minimal entanglement cost, the forward classical communication cost, and the backward classical communication cost per pair is given by the Schmidt strength of the unitary. We also prove that an upper bound ","authors_text":"Eyuri Wakakuwa, Mio Murao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-10-15T10:27:21Z","title":"Asymptotic Compressibility of Entanglement and Classical Communication in Distributed Quantum Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3991","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:0717f7943ed4ec0926ac478f45124f132305d890fcae054b5502e9bf22ba4a11","target":"record","created_at":"2026-05-18T02:47:23Z","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":"af3192ce766db81a5e8687fda73c52d4d7c272d2b93999c9f5a31db19c9841b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-10-15T10:27:21Z","title_canon_sha256":"ba046d02167efaf4cd7e7d1601061db224d18084585d8ce1c2a2c29dfde2125e"},"schema_version":"1.0","source":{"id":"1310.3991","kind":"arxiv","version":3}},"canonical_sha256":"0bdc336c963908adabd5746e5397c0db6a085df1a267de7dffb7848db348612d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0bdc336c963908adabd5746e5397c0db6a085df1a267de7dffb7848db348612d","first_computed_at":"2026-05-18T02:47:23.145783Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:23.145783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V/omq83O3H2ifPte7M0nRTWGVrA5TYK23DYRzvfWjhwOcbSraeElyheLh7XjDWcFQVVecuL6NUXAbQdyTUL3Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:23.146367Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.3991","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0717f7943ed4ec0926ac478f45124f132305d890fcae054b5502e9bf22ba4a11","sha256:f0d23192d92cad3d3059744bd17f00f78c477df5c215618ff4a84234139f78e7"],"state_sha256":"1711ba9b3aa28c99caf6bf7717e4087246164644b608c92a64ba1b6beeb36695"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NR1MPvl/kgIQ3jtWVrH39HEgIcS7pfGqw7Lyf3vxQ2qYZ7aYYA3nZJDzJIhoXXtlcxXKLjrDdhHnGAxs6p15CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T09:17:00.544530Z","bundle_sha256":"8a5042ec9722a40596733cb900aea89fd847efb00354afd747c503b7b9f00267"}}