{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VY7RLHV6RSBI6DK37NS7FANBU3","short_pith_number":"pith:VY7RLHV6","canonical_record":{"source":{"id":"1512.03257","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-12-10T14:05:13Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"81c5481570aa688f48f4dfa32ea3af66a202aae764631ac5162df886ef3abf63","abstract_canon_sha256":"df4a26b0f33b94bc33156bd84dceac8061b836b0c1dc2d158a151d069489abf6"},"schema_version":"1.0"},"canonical_sha256":"ae3f159ebe8c828f0d5bfb65f281a1a6e6940f9a4431c055a146bf413a4e1a3f","source":{"kind":"arxiv","id":"1512.03257","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.03257","created_at":"2026-05-18T01:16:44Z"},{"alias_kind":"arxiv_version","alias_value":"1512.03257v2","created_at":"2026-05-18T01:16:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03257","created_at":"2026-05-18T01:16:44Z"},{"alias_kind":"pith_short_12","alias_value":"VY7RLHV6RSBI","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VY7RLHV6RSBI6DK3","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VY7RLHV6","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VY7RLHV6RSBI6DK37NS7FANBU3","target":"record","payload":{"canonical_record":{"source":{"id":"1512.03257","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-12-10T14:05:13Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"81c5481570aa688f48f4dfa32ea3af66a202aae764631ac5162df886ef3abf63","abstract_canon_sha256":"df4a26b0f33b94bc33156bd84dceac8061b836b0c1dc2d158a151d069489abf6"},"schema_version":"1.0"},"canonical_sha256":"ae3f159ebe8c828f0d5bfb65f281a1a6e6940f9a4431c055a146bf413a4e1a3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:44.784330Z","signature_b64":"NVJx4rdcsztSitq+G0cLh/8i8q23alsFEUEXYikiuVUTi034o+IlTmOaFJy23vAA7L+okHgnTve2UpG0KD9ZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae3f159ebe8c828f0d5bfb65f281a1a6e6940f9a4431c055a146bf413a4e1a3f","last_reissued_at":"2026-05-18T01:16:44.783716Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:44.783716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.03257","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-18T01:16:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8nZmkJmCEOb+rJdLAAoZhEIbai9cm1SRQvljl18rQmTyQi8xZgtvGtPc0QQjCNovOfQ0G2adwEntvjqoYlT1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:10:04.941398Z"},"content_sha256":"d4dcc7cc32e34b8564dd925d47c5f2a46952fd5e5306d9fa04ef32dbff0a93cb","schema_version":"1.0","event_id":"sha256:d4dcc7cc32e34b8564dd925d47c5f2a46952fd5e5306d9fa04ef32dbff0a93cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VY7RLHV6RSBI6DK37NS7FANBU3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simple algorithm for computing the communication complexity of quantum communication processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC"],"primary_cat":"quant-ph","authors_text":"A. Hansen, A. Montina, S. Wolf","submitted_at":"2015-12-10T14:05:13Z","abstract_excerpt":"A two-party quantum communication process with classical inputs and outcomes can be simulated by replacing the quantum channel with a classical one. The minimal amount of classical communication required to reproduce the statistics of the quantum process is called its communication complexity. In the case of many instances simulated in parallel, the minimal communication cost per instance is called the asymptotic communication complexity. Previously, we reduced the computation of the asymptotic communication complexity to a convex minimization problem. In most cases, the objective function doe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03257","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-18T01:16:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2x/X6BTJEElgSJUHId/JWAL3kbzbbiYqj42E7iKjHL1OSrIktclktMIFNa9kustQ8+ik8zKaEDsMrTU0h8ycDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:10:04.941753Z"},"content_sha256":"cc0c345ce3518373aae53b5e302d2fefb532e213d91126a66ef7890078dbeb27","schema_version":"1.0","event_id":"sha256:cc0c345ce3518373aae53b5e302d2fefb532e213d91126a66ef7890078dbeb27"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VY7RLHV6RSBI6DK37NS7FANBU3/bundle.json","state_url":"https://pith.science/pith/VY7RLHV6RSBI6DK37NS7FANBU3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VY7RLHV6RSBI6DK37NS7FANBU3/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-03T07:10:04Z","links":{"resolver":"https://pith.science/pith/VY7RLHV6RSBI6DK37NS7FANBU3","bundle":"https://pith.science/pith/VY7RLHV6RSBI6DK37NS7FANBU3/bundle.json","state":"https://pith.science/pith/VY7RLHV6RSBI6DK37NS7FANBU3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VY7RLHV6RSBI6DK37NS7FANBU3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VY7RLHV6RSBI6DK37NS7FANBU3","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":"df4a26b0f33b94bc33156bd84dceac8061b836b0c1dc2d158a151d069489abf6","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-12-10T14:05:13Z","title_canon_sha256":"81c5481570aa688f48f4dfa32ea3af66a202aae764631ac5162df886ef3abf63"},"schema_version":"1.0","source":{"id":"1512.03257","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.03257","created_at":"2026-05-18T01:16:44Z"},{"alias_kind":"arxiv_version","alias_value":"1512.03257v2","created_at":"2026-05-18T01:16:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03257","created_at":"2026-05-18T01:16:44Z"},{"alias_kind":"pith_short_12","alias_value":"VY7RLHV6RSBI","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VY7RLHV6RSBI6DK3","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VY7RLHV6","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:cc0c345ce3518373aae53b5e302d2fefb532e213d91126a66ef7890078dbeb27","target":"graph","created_at":"2026-05-18T01:16:44Z","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":"A two-party quantum communication process with classical inputs and outcomes can be simulated by replacing the quantum channel with a classical one. The minimal amount of classical communication required to reproduce the statistics of the quantum process is called its communication complexity. In the case of many instances simulated in parallel, the minimal communication cost per instance is called the asymptotic communication complexity. Previously, we reduced the computation of the asymptotic communication complexity to a convex minimization problem. In most cases, the objective function doe","authors_text":"A. Hansen, A. Montina, S. Wolf","cross_cats":["cs.IT","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-12-10T14:05:13Z","title":"Simple algorithm for computing the communication complexity of quantum communication processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03257","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:d4dcc7cc32e34b8564dd925d47c5f2a46952fd5e5306d9fa04ef32dbff0a93cb","target":"record","created_at":"2026-05-18T01:16:44Z","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":"df4a26b0f33b94bc33156bd84dceac8061b836b0c1dc2d158a151d069489abf6","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-12-10T14:05:13Z","title_canon_sha256":"81c5481570aa688f48f4dfa32ea3af66a202aae764631ac5162df886ef3abf63"},"schema_version":"1.0","source":{"id":"1512.03257","kind":"arxiv","version":2}},"canonical_sha256":"ae3f159ebe8c828f0d5bfb65f281a1a6e6940f9a4431c055a146bf413a4e1a3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae3f159ebe8c828f0d5bfb65f281a1a6e6940f9a4431c055a146bf413a4e1a3f","first_computed_at":"2026-05-18T01:16:44.783716Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:44.783716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NVJx4rdcsztSitq+G0cLh/8i8q23alsFEUEXYikiuVUTi034o+IlTmOaFJy23vAA7L+okHgnTve2UpG0KD9ZBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:44.784330Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.03257","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4dcc7cc32e34b8564dd925d47c5f2a46952fd5e5306d9fa04ef32dbff0a93cb","sha256:cc0c345ce3518373aae53b5e302d2fefb532e213d91126a66ef7890078dbeb27"],"state_sha256":"9d9712678dc7f728f6ca16bbbff3df1736eb2db4c758434645c2d2b0c40a81a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tRNyGS9FTSRITGCjS9v9ackMwVLyCOGXpHD6nKu5DsgusJUsWg3hC9+Q9Sy6DqjNfO83FBWOgHPBocHAYr4hCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:10:04.943715Z","bundle_sha256":"23777ff503dda5ac1f8972932bd18570d59c0159c0ce4a73d0a34a08d8977477"}}