{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CIPOBT5XSPTQW7YYC4EJY45GNK","short_pith_number":"pith:CIPOBT5X","canonical_record":{"source":{"id":"1505.04352","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-05-17T04:57:33Z","cross_cats_sorted":[],"title_canon_sha256":"4c82d817b3b4bb9b0ad1172f74a51428350f31681a5fae896e594ececb13479d","abstract_canon_sha256":"0e79cbab962419c119697631064e8f9cd7d74abd254729e115373c475e9eec47"},"schema_version":"1.0"},"canonical_sha256":"121ee0cfb793e70b7f1817089c73a66a9204cfc0a852ea0afd7e7d38773728e4","source":{"kind":"arxiv","id":"1505.04352","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04352","created_at":"2026-05-18T00:20:22Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04352v3","created_at":"2026-05-18T00:20:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04352","created_at":"2026-05-18T00:20:22Z"},{"alias_kind":"pith_short_12","alias_value":"CIPOBT5XSPTQ","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CIPOBT5XSPTQW7YY","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CIPOBT5X","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CIPOBT5XSPTQW7YYC4EJY45GNK","target":"record","payload":{"canonical_record":{"source":{"id":"1505.04352","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-05-17T04:57:33Z","cross_cats_sorted":[],"title_canon_sha256":"4c82d817b3b4bb9b0ad1172f74a51428350f31681a5fae896e594ececb13479d","abstract_canon_sha256":"0e79cbab962419c119697631064e8f9cd7d74abd254729e115373c475e9eec47"},"schema_version":"1.0"},"canonical_sha256":"121ee0cfb793e70b7f1817089c73a66a9204cfc0a852ea0afd7e7d38773728e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:22.599922Z","signature_b64":"XQK0m6XhGN0B59opUOD6r8zjSw0wGvMoGBULUuOaAfXLS9aY9jfhhI+Ec7dnOFob4szSqjt+xVweQ/1IRRlfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"121ee0cfb793e70b7f1817089c73a66a9204cfc0a852ea0afd7e7d38773728e4","last_reissued_at":"2026-05-18T00:20:22.599367Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:22.599367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.04352","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:20:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iUCjz2Z1FwBIuz9ddrj6+6gEITiM/1+SQcncdwUSyg51NT98ncZYvROSAP61gc3ErQyESYtr/AtTjgwnEx1bCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:18:52.411085Z"},"content_sha256":"a1f7c30b877c55570aefca852be805f6287f439811119b237c09466bd82fe093","schema_version":"1.0","event_id":"sha256:a1f7c30b877c55570aefca852be805f6287f439811119b237c09466bd82fe093"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CIPOBT5XSPTQW7YYC4EJY45GNK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Coding Theorem for Bipartite Unitaries in Distributed Quantum Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Akihito Soeda, Eyuri Wakakuwa, Mio Murao","submitted_at":"2015-05-17T04:57:33Z","abstract_excerpt":"We analyze implementations of bipartite unitaries by means of local operations and classical communication (LOCC) assisted by shared entanglement. We employ concepts and techniques developed in quantum Shannon theory to study an asymptotic scenario, in which two distant parties perform the same bipartite unitary on infinitely many pairs of inputs. We analyze minimum cost of entanglement and classical communication per copy. For two-round LOCC protocols, we derive a single-letter formula for the minimum cost of entanglement and classical communication, under an additional requirement that the e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04352","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:20:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AhOWWP/IaZ/nETKS6i2e6xYAKl42NCuS9bWLI6m9yTB/xNiODECnvF+WI5nh8uXblRW1pMuDOfW4rzQhbravBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:18:52.411733Z"},"content_sha256":"6db7e39e4918d926c3dc77053a2c54b0499ea956cc78c4118fed0187e1d6d1c9","schema_version":"1.0","event_id":"sha256:6db7e39e4918d926c3dc77053a2c54b0499ea956cc78c4118fed0187e1d6d1c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CIPOBT5XSPTQW7YYC4EJY45GNK/bundle.json","state_url":"https://pith.science/pith/CIPOBT5XSPTQW7YYC4EJY45GNK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CIPOBT5XSPTQW7YYC4EJY45GNK/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-30T10:18:52Z","links":{"resolver":"https://pith.science/pith/CIPOBT5XSPTQW7YYC4EJY45GNK","bundle":"https://pith.science/pith/CIPOBT5XSPTQW7YYC4EJY45GNK/bundle.json","state":"https://pith.science/pith/CIPOBT5XSPTQW7YYC4EJY45GNK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CIPOBT5XSPTQW7YYC4EJY45GNK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CIPOBT5XSPTQW7YYC4EJY45GNK","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":"0e79cbab962419c119697631064e8f9cd7d74abd254729e115373c475e9eec47","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-05-17T04:57:33Z","title_canon_sha256":"4c82d817b3b4bb9b0ad1172f74a51428350f31681a5fae896e594ececb13479d"},"schema_version":"1.0","source":{"id":"1505.04352","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04352","created_at":"2026-05-18T00:20:22Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04352v3","created_at":"2026-05-18T00:20:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04352","created_at":"2026-05-18T00:20:22Z"},{"alias_kind":"pith_short_12","alias_value":"CIPOBT5XSPTQ","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CIPOBT5XSPTQW7YY","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CIPOBT5X","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:6db7e39e4918d926c3dc77053a2c54b0499ea956cc78c4118fed0187e1d6d1c9","target":"graph","created_at":"2026-05-18T00:20:22Z","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 analyze implementations of bipartite unitaries by means of local operations and classical communication (LOCC) assisted by shared entanglement. We employ concepts and techniques developed in quantum Shannon theory to study an asymptotic scenario, in which two distant parties perform the same bipartite unitary on infinitely many pairs of inputs. We analyze minimum cost of entanglement and classical communication per copy. For two-round LOCC protocols, we derive a single-letter formula for the minimum cost of entanglement and classical communication, under an additional requirement that the e","authors_text":"Akihito Soeda, Eyuri Wakakuwa, Mio Murao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-05-17T04:57:33Z","title":"A Coding Theorem for Bipartite Unitaries in Distributed Quantum Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04352","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:a1f7c30b877c55570aefca852be805f6287f439811119b237c09466bd82fe093","target":"record","created_at":"2026-05-18T00:20:22Z","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":"0e79cbab962419c119697631064e8f9cd7d74abd254729e115373c475e9eec47","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-05-17T04:57:33Z","title_canon_sha256":"4c82d817b3b4bb9b0ad1172f74a51428350f31681a5fae896e594ececb13479d"},"schema_version":"1.0","source":{"id":"1505.04352","kind":"arxiv","version":3}},"canonical_sha256":"121ee0cfb793e70b7f1817089c73a66a9204cfc0a852ea0afd7e7d38773728e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"121ee0cfb793e70b7f1817089c73a66a9204cfc0a852ea0afd7e7d38773728e4","first_computed_at":"2026-05-18T00:20:22.599367Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:22.599367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XQK0m6XhGN0B59opUOD6r8zjSw0wGvMoGBULUuOaAfXLS9aY9jfhhI+Ec7dnOFob4szSqjt+xVweQ/1IRRlfCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:22.599922Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.04352","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1f7c30b877c55570aefca852be805f6287f439811119b237c09466bd82fe093","sha256:6db7e39e4918d926c3dc77053a2c54b0499ea956cc78c4118fed0187e1d6d1c9"],"state_sha256":"365335564dfb668a299bb6cf0eb4faae1450502629e89672ecbea08f13353d2a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CaBTX0TzJSDA5PDFE4UNAUVJxdop9ehh1jtIJtkFSbb86sgMjkRo7xj01qGvH8FA0+m0CRfAK9b5RcdbkhUkAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:18:52.415466Z","bundle_sha256":"d188f1d0c20528e7ce32a37269487674046c2b9d72fb48eb497cf9c3ba04a541"}}