{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2002:BRWAM2C3TPQB45AE67WF3DNMPB","short_pith_number":"pith:BRWAM2C3","canonical_record":{"source":{"id":"quant-ph/0204093","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2002-04-17T19:37:15Z","cross_cats_sorted":[],"title_canon_sha256":"d60b94d591d6e3f0d59d414051a1ed9de1d958487a88cb30004ec17ff688a1f6","abstract_canon_sha256":"15bf02b969e996927388745a5f45dc1b3e95f86a5cafdd33ea3c9620f8c2d718"},"schema_version":"1.0"},"canonical_sha256":"0c6c06685b9be01e7404f7ec5d8dac786e50b740bf66c0b490de6b281830dacd","source":{"kind":"arxiv","id":"quant-ph/0204093","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0204093","created_at":"2026-07-04T14:45:55Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0204093v1","created_at":"2026-07-04T14:45:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0204093","created_at":"2026-07-04T14:45:55Z"},{"alias_kind":"pith_short_12","alias_value":"BRWAM2C3TPQB","created_at":"2026-07-04T14:45:55Z"},{"alias_kind":"pith_short_16","alias_value":"BRWAM2C3TPQB45AE","created_at":"2026-07-04T14:45:55Z"},{"alias_kind":"pith_short_8","alias_value":"BRWAM2C3","created_at":"2026-07-04T14:45:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2002:BRWAM2C3TPQB45AE67WF3DNMPB","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0204093","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2002-04-17T19:37:15Z","cross_cats_sorted":[],"title_canon_sha256":"d60b94d591d6e3f0d59d414051a1ed9de1d958487a88cb30004ec17ff688a1f6","abstract_canon_sha256":"15bf02b969e996927388745a5f45dc1b3e95f86a5cafdd33ea3c9620f8c2d718"},"schema_version":"1.0"},"canonical_sha256":"0c6c06685b9be01e7404f7ec5d8dac786e50b740bf66c0b490de6b281830dacd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:45:55.530141Z","signature_b64":"4XTeHE8/CmP+aH1sW1h5M20jJE7FDWtd9ecWzr70sfvbdMnjBSLaXZDSN9llupAtP7MsNbuFBUY8au6hfxwSCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c6c06685b9be01e7404f7ec5d8dac786e50b740bf66c0b490de6b281830dacd","last_reissued_at":"2026-07-04T14:45:55.529782Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:45:55.529782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0204093","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-07-04T14:45:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vmlFJmJnq/djaYpdD7kGhjmHfD/BBXg5wDLqG8w095vUDCl9n34IPM3ibH3cdh0uuzDKxfVS/7fWGsDtpojaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:57:51.632304Z"},"content_sha256":"18822653ea7780d2c431ec6ad6dbd64e7e938ef8ec404a71ac37ff7a7acdda34","schema_version":"1.0","event_id":"sha256:18822653ea7780d2c431ec6ad6dbd64e7e938ef8ec404a71ac37ff7a7acdda34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2002:BRWAM2C3TPQB45AE67WF3DNMPB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Renyi-entropic bounds on quantum communication","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Patrick Hayden, Wim van Dam","submitted_at":"2002-04-17T19:37:15Z","abstract_excerpt":"In this article we establish new bounds on the quantum communication complexity of distributed problems. Specifically, we consider the amount of communication that is required to transform a bipartite state into another, typically more entangled, state. We obtain lower bounds in this setting by studying the Renyi entropy of the marginal density matrices of the distributed system.\n  The communication bounds on quantum state transformations also imply lower bounds for the model of communication complexity where the task consists of the the distributed evaluation of a function f(x,y). Our approac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0204093","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0204093/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T14:45:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"on3QCzctzcupgEOgHWEDuzjjS7BSW6PtNiX7htdBbGC/GbMwXCa/QX+8plpd69W40Rva5bH0e40MFFJy9wsmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:57:51.632797Z"},"content_sha256":"a62ed449abb009aa8d8f9e6fdcf5ad37a564fd0c2345d9772dbf6657a81b2803","schema_version":"1.0","event_id":"sha256:a62ed449abb009aa8d8f9e6fdcf5ad37a564fd0c2345d9772dbf6657a81b2803"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BRWAM2C3TPQB45AE67WF3DNMPB/bundle.json","state_url":"https://pith.science/pith/BRWAM2C3TPQB45AE67WF3DNMPB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BRWAM2C3TPQB45AE67WF3DNMPB/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-08-08T19:57:51Z","links":{"resolver":"https://pith.science/pith/BRWAM2C3TPQB45AE67WF3DNMPB","bundle":"https://pith.science/pith/BRWAM2C3TPQB45AE67WF3DNMPB/bundle.json","state":"https://pith.science/pith/BRWAM2C3TPQB45AE67WF3DNMPB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BRWAM2C3TPQB45AE67WF3DNMPB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2002:BRWAM2C3TPQB45AE67WF3DNMPB","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":"15bf02b969e996927388745a5f45dc1b3e95f86a5cafdd33ea3c9620f8c2d718","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2002-04-17T19:37:15Z","title_canon_sha256":"d60b94d591d6e3f0d59d414051a1ed9de1d958487a88cb30004ec17ff688a1f6"},"schema_version":"1.0","source":{"id":"quant-ph/0204093","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0204093","created_at":"2026-07-04T14:45:55Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0204093v1","created_at":"2026-07-04T14:45:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0204093","created_at":"2026-07-04T14:45:55Z"},{"alias_kind":"pith_short_12","alias_value":"BRWAM2C3TPQB","created_at":"2026-07-04T14:45:55Z"},{"alias_kind":"pith_short_16","alias_value":"BRWAM2C3TPQB45AE","created_at":"2026-07-04T14:45:55Z"},{"alias_kind":"pith_short_8","alias_value":"BRWAM2C3","created_at":"2026-07-04T14:45:55Z"}],"graph_snapshots":[{"event_id":"sha256:a62ed449abb009aa8d8f9e6fdcf5ad37a564fd0c2345d9772dbf6657a81b2803","target":"graph","created_at":"2026-07-04T14:45:55Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/quant-ph/0204093/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this article we establish new bounds on the quantum communication complexity of distributed problems. Specifically, we consider the amount of communication that is required to transform a bipartite state into another, typically more entangled, state. We obtain lower bounds in this setting by studying the Renyi entropy of the marginal density matrices of the distributed system.\n  The communication bounds on quantum state transformations also imply lower bounds for the model of communication complexity where the task consists of the the distributed evaluation of a function f(x,y). Our approac","authors_text":"Patrick Hayden, Wim van Dam","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2002-04-17T19:37:15Z","title":"Renyi-entropic bounds on quantum communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0204093","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:18822653ea7780d2c431ec6ad6dbd64e7e938ef8ec404a71ac37ff7a7acdda34","target":"record","created_at":"2026-07-04T14:45:55Z","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":"15bf02b969e996927388745a5f45dc1b3e95f86a5cafdd33ea3c9620f8c2d718","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2002-04-17T19:37:15Z","title_canon_sha256":"d60b94d591d6e3f0d59d414051a1ed9de1d958487a88cb30004ec17ff688a1f6"},"schema_version":"1.0","source":{"id":"quant-ph/0204093","kind":"arxiv","version":1}},"canonical_sha256":"0c6c06685b9be01e7404f7ec5d8dac786e50b740bf66c0b490de6b281830dacd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c6c06685b9be01e7404f7ec5d8dac786e50b740bf66c0b490de6b281830dacd","first_computed_at":"2026-07-04T14:45:55.529782Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:45:55.529782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4XTeHE8/CmP+aH1sW1h5M20jJE7FDWtd9ecWzr70sfvbdMnjBSLaXZDSN9llupAtP7MsNbuFBUY8au6hfxwSCw==","signature_status":"signed_v1","signed_at":"2026-07-04T14:45:55.530141Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0204093","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18822653ea7780d2c431ec6ad6dbd64e7e938ef8ec404a71ac37ff7a7acdda34","sha256:a62ed449abb009aa8d8f9e6fdcf5ad37a564fd0c2345d9772dbf6657a81b2803"],"state_sha256":"64d3bac61a353114e280154162b4245163a87680f616c76363bc690a684cf4ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"54J9ueN9Bi6FspP90AoGRgEOpDmQ/fBcAt5jvXYqbO6Z9UtBqzey/Eaa770XMwgVGkaTWJfOKUX/ujUH4OCsBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T19:57:51.635997Z","bundle_sha256":"fe9441be543802dc751ce0b6fca0acfd37d1b534a4f3ae866117b43088fcb159"}}