{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:62FBP5KHWRTIVTVBVMZBQT2QQ2","short_pith_number":"pith:62FBP5KH","schema_version":"1.0","canonical_sha256":"f68a17f547b4668acea1ab32184f508694db9eeb77a837e246a6aeba82a6a68c","source":{"kind":"arxiv","id":"1204.4596","version":1},"attestation_state":"computed","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  *"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1204.4596","created_at":"2026-05-18T03:57:25.997856+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.4596v1","created_at":"2026-05-18T03:57:25.997856+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4596","created_at":"2026-05-18T03:57:25.997856+00:00"},{"alias_kind":"pith_short_12","alias_value":"62FBP5KHWRTI","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"62FBP5KHWRTIVTVB","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"62FBP5KH","created_at":"2026-05-18T12:26:56.085431+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/62FBP5KHWRTIVTVBVMZBQT2QQ2","json":"https://pith.science/pith/62FBP5KHWRTIVTVBVMZBQT2QQ2.json","graph_json":"https://pith.science/api/pith-number/62FBP5KHWRTIVTVBVMZBQT2QQ2/graph.json","events_json":"https://pith.science/api/pith-number/62FBP5KHWRTIVTVBVMZBQT2QQ2/events.json","paper":"https://pith.science/paper/62FBP5KH"},"agent_actions":{"view_html":"https://pith.science/pith/62FBP5KHWRTIVTVBVMZBQT2QQ2","download_json":"https://pith.science/pith/62FBP5KHWRTIVTVBVMZBQT2QQ2.json","view_paper":"https://pith.science/paper/62FBP5KH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.4596&json=true","fetch_graph":"https://pith.science/api/pith-number/62FBP5KHWRTIVTVBVMZBQT2QQ2/graph.json","fetch_events":"https://pith.science/api/pith-number/62FBP5KHWRTIVTVBVMZBQT2QQ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/62FBP5KHWRTIVTVBVMZBQT2QQ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/62FBP5KHWRTIVTVBVMZBQT2QQ2/action/storage_attestation","attest_author":"https://pith.science/pith/62FBP5KHWRTIVTVBVMZBQT2QQ2/action/author_attestation","sign_citation":"https://pith.science/pith/62FBP5KHWRTIVTVBVMZBQT2QQ2/action/citation_signature","submit_replication":"https://pith.science/pith/62FBP5KHWRTIVTVBVMZBQT2QQ2/action/replication_record"}},"created_at":"2026-05-18T03:57:25.997856+00:00","updated_at":"2026-05-18T03:57:25.997856+00:00"}