{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:62FBP5KHWRTIVTVBVMZBQT2QQ2","short_pith_number":"pith:62FBP5KH","canonical_record":{"source":{"id":"1204.4596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-04-20T12:14:18Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"0706e3473a14ab347ee0707a6407b02423c3f166cc4bfdc44167c2db55b78eff","abstract_canon_sha256":"a2977996bbdd221af639b8acdc8610d5cc6272bfd0b1e3a64cc604cf2fd20b85"},"schema_version":"1.0"},"canonical_sha256":"f68a17f547b4668acea1ab32184f508694db9eeb77a837e246a6aeba82a6a68c","source":{"kind":"arxiv","id":"1204.4596","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4596","created_at":"2026-05-18T03:57:25Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4596v1","created_at":"2026-05-18T03:57:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4596","created_at":"2026-05-18T03:57:25Z"},{"alias_kind":"pith_short_12","alias_value":"62FBP5KHWRTI","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"62FBP5KHWRTIVTVB","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"62FBP5KH","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:62FBP5KHWRTIVTVBVMZBQT2QQ2","target":"record","payload":{"canonical_record":{"source":{"id":"1204.4596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-04-20T12:14:18Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"0706e3473a14ab347ee0707a6407b02423c3f166cc4bfdc44167c2db55b78eff","abstract_canon_sha256":"a2977996bbdd221af639b8acdc8610d5cc6272bfd0b1e3a64cc604cf2fd20b85"},"schema_version":"1.0"},"canonical_sha256":"f68a17f547b4668acea1ab32184f508694db9eeb77a837e246a6aeba82a6a68c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:25.998551Z","signature_b64":"cvXSej6BvI0kqaqCReeXkocQO5n3VGIrSxA312Q57JXH9V3f8KpA0797CZMUw9TxU3MKyz7JfIJcumM5oBJkCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f68a17f547b4668acea1ab32184f508694db9eeb77a837e246a6aeba82a6a68c","last_reissued_at":"2026-05-18T03:57:25.997717Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:25.997717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.4596","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-05-18T03:57:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4eW2GuQRMAqkRNQkMYQYDWHtDj+FyjcPcEiZ6fUCgy+qTbk5CXwwnEPKHncB8BeKP2wvgxdnaNIbhmYqwK1ZAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T19:10:57.390236Z"},"content_sha256":"700239b7aed8a2d84240864f3ba1ebdb704bf5f805f075fa86ed7a6d2be965d8","schema_version":"1.0","event_id":"sha256:700239b7aed8a2d84240864f3ba1ebdb704bf5f805f075fa86ed7a6d2be965d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:62FBP5KHWRTIVTVBVMZBQT2QQ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New bounds on the classical and quantum communication complexity of some graph properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Gabor Ivanyos, Hartmut Klauck, Miklos Santha, Ronald de Wolf, Troy Lee","submitted_at":"2012-04-20T12:14:18Z","abstract_excerpt":"We study the communication complexity of a number of graph properties where the edges of the graph $G$ are distributed between Alice and Bob (i.e., each receives some of the edges as input). Our main results are:\n  * An Omega(n) lower bound on the quantum communication complexity of deciding whether an n-vertex graph G is connected, nearly matching the trivial classical upper bound of O(n log n) bits of communication.\n  * A deterministic upper bound of O(n^{3/2}log n) bits for deciding if a bipartite graph contains a perfect matching, and a quantum lower bound of Omega(n) for this problem.\n  *"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4596","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":""},"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-18T03:57:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qilmr/GLE/gIhncgITD+1MGSNh7+JB4srEw6ijbsIiNw4ffTr081iQaN9QX7o1kf29XMkt9BI3CIsb08yNmrAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T19:10:57.390947Z"},"content_sha256":"93b9e34958af62d378149ed0e9c1e2d43f89c30e08111706e27e0e45dfa21e0d","schema_version":"1.0","event_id":"sha256:93b9e34958af62d378149ed0e9c1e2d43f89c30e08111706e27e0e45dfa21e0d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/62FBP5KHWRTIVTVBVMZBQT2QQ2/bundle.json","state_url":"https://pith.science/pith/62FBP5KHWRTIVTVBVMZBQT2QQ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/62FBP5KHWRTIVTVBVMZBQT2QQ2/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-07T19:10:57Z","links":{"resolver":"https://pith.science/pith/62FBP5KHWRTIVTVBVMZBQT2QQ2","bundle":"https://pith.science/pith/62FBP5KHWRTIVTVBVMZBQT2QQ2/bundle.json","state":"https://pith.science/pith/62FBP5KHWRTIVTVBVMZBQT2QQ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/62FBP5KHWRTIVTVBVMZBQT2QQ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:62FBP5KHWRTIVTVBVMZBQT2QQ2","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":"a2977996bbdd221af639b8acdc8610d5cc6272bfd0b1e3a64cc604cf2fd20b85","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-04-20T12:14:18Z","title_canon_sha256":"0706e3473a14ab347ee0707a6407b02423c3f166cc4bfdc44167c2db55b78eff"},"schema_version":"1.0","source":{"id":"1204.4596","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4596","created_at":"2026-05-18T03:57:25Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4596v1","created_at":"2026-05-18T03:57:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4596","created_at":"2026-05-18T03:57:25Z"},{"alias_kind":"pith_short_12","alias_value":"62FBP5KHWRTI","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"62FBP5KHWRTIVTVB","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"62FBP5KH","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:93b9e34958af62d378149ed0e9c1e2d43f89c30e08111706e27e0e45dfa21e0d","target":"graph","created_at":"2026-05-18T03:57: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 study the communication complexity of a number of graph properties where the edges of the graph $G$ are distributed between Alice and Bob (i.e., each receives some of the edges as input). Our main results are:\n  * An Omega(n) lower bound on the quantum communication complexity of deciding whether an n-vertex graph G is connected, nearly matching the trivial classical upper bound of O(n log n) bits of communication.\n  * A deterministic upper bound of O(n^{3/2}log n) bits for deciding if a bipartite graph contains a perfect matching, and a quantum lower bound of Omega(n) for this problem.\n  *","authors_text":"Gabor Ivanyos, Hartmut Klauck, Miklos Santha, Ronald de Wolf, Troy Lee","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-04-20T12:14:18Z","title":"New bounds on the classical and quantum communication complexity of some graph properties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4596","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:700239b7aed8a2d84240864f3ba1ebdb704bf5f805f075fa86ed7a6d2be965d8","target":"record","created_at":"2026-05-18T03:57: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":"a2977996bbdd221af639b8acdc8610d5cc6272bfd0b1e3a64cc604cf2fd20b85","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-04-20T12:14:18Z","title_canon_sha256":"0706e3473a14ab347ee0707a6407b02423c3f166cc4bfdc44167c2db55b78eff"},"schema_version":"1.0","source":{"id":"1204.4596","kind":"arxiv","version":1}},"canonical_sha256":"f68a17f547b4668acea1ab32184f508694db9eeb77a837e246a6aeba82a6a68c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f68a17f547b4668acea1ab32184f508694db9eeb77a837e246a6aeba82a6a68c","first_computed_at":"2026-05-18T03:57:25.997717Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:25.997717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cvXSej6BvI0kqaqCReeXkocQO5n3VGIrSxA312Q57JXH9V3f8KpA0797CZMUw9TxU3MKyz7JfIJcumM5oBJkCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:25.998551Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.4596","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:700239b7aed8a2d84240864f3ba1ebdb704bf5f805f075fa86ed7a6d2be965d8","sha256:93b9e34958af62d378149ed0e9c1e2d43f89c30e08111706e27e0e45dfa21e0d"],"state_sha256":"f000048b518e32e8ebbcadf9c63035a864f4e68636cdc049f20b28dde6fd676b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YwXV1DgDFR2Whn6L1+mCbow7PPgnC+I0wh3MZ12E2X9hpPiudZWUrGx3kig51F+ZrARKR+EjhX6G2LPwC4vXCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T19:10:57.395816Z","bundle_sha256":"98c0ce787a332a31d20740c0d3f0a48f0c8e8939f5cf9ccbf40c5c05dc479134"}}