{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4UCKU6O5R2AI6324GQLWSFDWWH","short_pith_number":"pith:4UCKU6O5","canonical_record":{"source":{"id":"1402.6299","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-02-25T20:15:17Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e48e92af687a8c80a2e65e8faa11cdc5f87d0a7758f5cc381460acdaf37b595f","abstract_canon_sha256":"61370bcbf136d07d38726e02f759c6e408c0353881f6a43d2645e0746a58532e"},"schema_version":"1.0"},"canonical_sha256":"e504aa79dd8e808f6f5c3417691476b1d41e69ae52159e94306203edf9a19bbb","source":{"kind":"arxiv","id":"1402.6299","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6299","created_at":"2026-05-18T02:33:25Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6299v2","created_at":"2026-05-18T02:33:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6299","created_at":"2026-05-18T02:33:25Z"},{"alias_kind":"pith_short_12","alias_value":"4UCKU6O5R2AI","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4UCKU6O5R2AI6324","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4UCKU6O5","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4UCKU6O5R2AI6324GQLWSFDWWH","target":"record","payload":{"canonical_record":{"source":{"id":"1402.6299","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-02-25T20:15:17Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e48e92af687a8c80a2e65e8faa11cdc5f87d0a7758f5cc381460acdaf37b595f","abstract_canon_sha256":"61370bcbf136d07d38726e02f759c6e408c0353881f6a43d2645e0746a58532e"},"schema_version":"1.0"},"canonical_sha256":"e504aa79dd8e808f6f5c3417691476b1d41e69ae52159e94306203edf9a19bbb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:33:25.456324Z","signature_b64":"wPNWNVdilamedtU+zkNfabPOXBD3ajbcWSL0Xq9vMUBpPOoU8J+krq1//+fyLer6z6LRy1K8q/ndIvZIcPNMBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e504aa79dd8e808f6f5c3417691476b1d41e69ae52159e94306203edf9a19bbb","last_reissued_at":"2026-05-18T02:33:25.455709Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:33:25.455709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.6299","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:33:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gmGl+Iu2N/VdtVEJ7wLfhI/VYxuuigj8NlCtmSKqHCBeTHTNw0W7amsBZrZcuZ5iMEneKuK/uSeaGr3u37arAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T20:01:52.228022Z"},"content_sha256":"ac5441c1a05dc4051499dc4a4c9743153e88863983140ab8dfbdce41d2832804","schema_version":"1.0","event_id":"sha256:ac5441c1a05dc4051499dc4a4c9743153e88863983140ab8dfbdce41d2832804"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4UCKU6O5R2AI6324GQLWSFDWWH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Necessary and sufficient optimality conditions for classical simulations of quantum communication processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Alberto Montina, Stefan Wolf","submitted_at":"2014-02-25T20:15:17Z","abstract_excerpt":"We consider the process consisting of preparation, transmission through a quantum channel, and subsequent measurement of quantum states. The communication complexity of the channel is the minimal amount of classical communication required for classically simulating it. Recently, we reduced the computation of this quantity to a convex minimization problem with linear constraints. Every solution of the constraints provides an upper bound on the communication complexity. In this paper, we derive the dual maximization problem of the original one. The feasible points of the dual constraints, which "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6299","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:33:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M/vdXUy+E1WMhwh8qIf7HZlJCNiwLRN67uvhfSHOnX+DEsS8BU8Ur7gw7tR49qNw9sMwR2dHXBPn3M3l7pXvBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T20:01:52.228379Z"},"content_sha256":"de92c5d17190dfbc0af93044ee38e8f1763217e35b3affe341a36a4b9db4fdb7","schema_version":"1.0","event_id":"sha256:de92c5d17190dfbc0af93044ee38e8f1763217e35b3affe341a36a4b9db4fdb7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4UCKU6O5R2AI6324GQLWSFDWWH/bundle.json","state_url":"https://pith.science/pith/4UCKU6O5R2AI6324GQLWSFDWWH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4UCKU6O5R2AI6324GQLWSFDWWH/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-22T20:01:52Z","links":{"resolver":"https://pith.science/pith/4UCKU6O5R2AI6324GQLWSFDWWH","bundle":"https://pith.science/pith/4UCKU6O5R2AI6324GQLWSFDWWH/bundle.json","state":"https://pith.science/pith/4UCKU6O5R2AI6324GQLWSFDWWH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4UCKU6O5R2AI6324GQLWSFDWWH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4UCKU6O5R2AI6324GQLWSFDWWH","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":"61370bcbf136d07d38726e02f759c6e408c0353881f6a43d2645e0746a58532e","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-02-25T20:15:17Z","title_canon_sha256":"e48e92af687a8c80a2e65e8faa11cdc5f87d0a7758f5cc381460acdaf37b595f"},"schema_version":"1.0","source":{"id":"1402.6299","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6299","created_at":"2026-05-18T02:33:25Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6299v2","created_at":"2026-05-18T02:33:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6299","created_at":"2026-05-18T02:33:25Z"},{"alias_kind":"pith_short_12","alias_value":"4UCKU6O5R2AI","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4UCKU6O5R2AI6324","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4UCKU6O5","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:de92c5d17190dfbc0af93044ee38e8f1763217e35b3affe341a36a4b9db4fdb7","target":"graph","created_at":"2026-05-18T02:33: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":"We consider the process consisting of preparation, transmission through a quantum channel, and subsequent measurement of quantum states. The communication complexity of the channel is the minimal amount of classical communication required for classically simulating it. Recently, we reduced the computation of this quantity to a convex minimization problem with linear constraints. Every solution of the constraints provides an upper bound on the communication complexity. In this paper, we derive the dual maximization problem of the original one. The feasible points of the dual constraints, which ","authors_text":"Alberto Montina, Stefan Wolf","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-02-25T20:15:17Z","title":"Necessary and sufficient optimality conditions for classical simulations of quantum communication processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6299","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:ac5441c1a05dc4051499dc4a4c9743153e88863983140ab8dfbdce41d2832804","target":"record","created_at":"2026-05-18T02:33: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":"61370bcbf136d07d38726e02f759c6e408c0353881f6a43d2645e0746a58532e","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-02-25T20:15:17Z","title_canon_sha256":"e48e92af687a8c80a2e65e8faa11cdc5f87d0a7758f5cc381460acdaf37b595f"},"schema_version":"1.0","source":{"id":"1402.6299","kind":"arxiv","version":2}},"canonical_sha256":"e504aa79dd8e808f6f5c3417691476b1d41e69ae52159e94306203edf9a19bbb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e504aa79dd8e808f6f5c3417691476b1d41e69ae52159e94306203edf9a19bbb","first_computed_at":"2026-05-18T02:33:25.455709Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:33:25.455709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wPNWNVdilamedtU+zkNfabPOXBD3ajbcWSL0Xq9vMUBpPOoU8J+krq1//+fyLer6z6LRy1K8q/ndIvZIcPNMBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:33:25.456324Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.6299","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac5441c1a05dc4051499dc4a4c9743153e88863983140ab8dfbdce41d2832804","sha256:de92c5d17190dfbc0af93044ee38e8f1763217e35b3affe341a36a4b9db4fdb7"],"state_sha256":"2cf5b55fd8c83a47716a501853504644455821bce2ee63e0f3d54c9b4588215b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zV3x1dnFYriUgvdB1bKI923IxS2goKMDvIt77OkU6vDwEjn6PVOwyIXxldKYBoZox2YRTR8CXWud0WWBxZV4CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T20:01:52.230336Z","bundle_sha256":"9a00a436ec47299f5dd46d94a8c33772eaf61d074cdac560b5a0a32b11536ce2"}}