{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ZGZM3PQY5QF7MXRGLIJGG3KE2D","short_pith_number":"pith:ZGZM3PQY","canonical_record":{"source":{"id":"1107.2559","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-07-13T14:29:18Z","cross_cats_sorted":[],"title_canon_sha256":"80c305499b5453ca0a6d3ba4fb1909872748f568277c7bb526ec9347746b46d3","abstract_canon_sha256":"d3d522f1428624135d550c17efbbcab566a19e77d6b4a21e6510dc8a3734e355"},"schema_version":"1.0"},"canonical_sha256":"c9b2cdbe18ec0bf65e265a12636d44d0ced36d51832d8ff562f10e3c1fac7525","source":{"kind":"arxiv","id":"1107.2559","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2559","created_at":"2026-05-18T02:27:49Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2559v2","created_at":"2026-05-18T02:27:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2559","created_at":"2026-05-18T02:27:49Z"},{"alias_kind":"pith_short_12","alias_value":"ZGZM3PQY5QF7","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZGZM3PQY5QF7MXRG","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZGZM3PQY","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ZGZM3PQY5QF7MXRGLIJGG3KE2D","target":"record","payload":{"canonical_record":{"source":{"id":"1107.2559","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-07-13T14:29:18Z","cross_cats_sorted":[],"title_canon_sha256":"80c305499b5453ca0a6d3ba4fb1909872748f568277c7bb526ec9347746b46d3","abstract_canon_sha256":"d3d522f1428624135d550c17efbbcab566a19e77d6b4a21e6510dc8a3734e355"},"schema_version":"1.0"},"canonical_sha256":"c9b2cdbe18ec0bf65e265a12636d44d0ced36d51832d8ff562f10e3c1fac7525","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:49.850883Z","signature_b64":"QBF8ieg+MObBEVcC/R+ws0+y2CoBEzHG1Vfy9+KNTZ1iePkZTpeDW7hrdaqXxymGF3ZQHiKEXazV4kNJG2zmBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9b2cdbe18ec0bf65e265a12636d44d0ced36d51832d8ff562f10e3c1fac7525","last_reissued_at":"2026-05-18T02:27:49.850375Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:49.850375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.2559","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:27:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XJ3nB7qda6M8tN9PENJFCIMJv4Kw+aRKz+VQip7ShV1MFVxZafch2/WSR2wrVU1KRLJ2AYqWGs3O5RiVm7P/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:19:23.212973Z"},"content_sha256":"9a843216078bce40cf58688186c436855411def055dd6f20a4272ec478eef66d","schema_version":"1.0","event_id":"sha256:9a843216078bce40cf58688186c436855411def055dd6f20a4272ec478eef66d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ZGZM3PQY5QF7MXRGLIJGG3KE2D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Elad Verbin, Jeff M. Phillips, Qin Zhang","submitted_at":"2011-07-13T14:29:18Z","abstract_excerpt":"In this paper we prove lower bounds on randomized multiparty communication complexity, both in the \\emph{blackboard model} (where each message is written on a blackboard for all players to see) and (mainly) in the \\emph{message-passing model}, where messages are sent player-to-player. We introduce a new technique for proving such bounds, called \\emph{symmetrization}, which is natural, intuitive, and often easy to use.\n  For example, for the problem where each of $k$ players gets a bit-vector of length $n$, and the goal is to compute the coordinate-wise XOR of these vectors, we prove a tight lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2559","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:27:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SQ+MP4FJv5a6TrmlryPVnDikt1u71EupjYbofya+hXUMrN9GIW54YOQEM6v7UwDVBBCD+hEbnG/mfIpmYKimDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:19:23.213328Z"},"content_sha256":"d5d704bf48182956cb46b90135829a7afd275ef26e523a8e1596a5f7f09c299b","schema_version":"1.0","event_id":"sha256:d5d704bf48182956cb46b90135829a7afd275ef26e523a8e1596a5f7f09c299b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZGZM3PQY5QF7MXRGLIJGG3KE2D/bundle.json","state_url":"https://pith.science/pith/ZGZM3PQY5QF7MXRGLIJGG3KE2D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZGZM3PQY5QF7MXRGLIJGG3KE2D/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:19:23Z","links":{"resolver":"https://pith.science/pith/ZGZM3PQY5QF7MXRGLIJGG3KE2D","bundle":"https://pith.science/pith/ZGZM3PQY5QF7MXRGLIJGG3KE2D/bundle.json","state":"https://pith.science/pith/ZGZM3PQY5QF7MXRGLIJGG3KE2D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZGZM3PQY5QF7MXRGLIJGG3KE2D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ZGZM3PQY5QF7MXRGLIJGG3KE2D","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":"d3d522f1428624135d550c17efbbcab566a19e77d6b4a21e6510dc8a3734e355","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-07-13T14:29:18Z","title_canon_sha256":"80c305499b5453ca0a6d3ba4fb1909872748f568277c7bb526ec9347746b46d3"},"schema_version":"1.0","source":{"id":"1107.2559","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2559","created_at":"2026-05-18T02:27:49Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2559v2","created_at":"2026-05-18T02:27:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2559","created_at":"2026-05-18T02:27:49Z"},{"alias_kind":"pith_short_12","alias_value":"ZGZM3PQY5QF7","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZGZM3PQY5QF7MXRG","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZGZM3PQY","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:d5d704bf48182956cb46b90135829a7afd275ef26e523a8e1596a5f7f09c299b","target":"graph","created_at":"2026-05-18T02:27:49Z","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":"In this paper we prove lower bounds on randomized multiparty communication complexity, both in the \\emph{blackboard model} (where each message is written on a blackboard for all players to see) and (mainly) in the \\emph{message-passing model}, where messages are sent player-to-player. We introduce a new technique for proving such bounds, called \\emph{symmetrization}, which is natural, intuitive, and often easy to use.\n  For example, for the problem where each of $k$ players gets a bit-vector of length $n$, and the goal is to compute the coordinate-wise XOR of these vectors, we prove a tight lo","authors_text":"Elad Verbin, Jeff M. Phillips, Qin Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-07-13T14:29:18Z","title":"Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2559","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:9a843216078bce40cf58688186c436855411def055dd6f20a4272ec478eef66d","target":"record","created_at":"2026-05-18T02:27:49Z","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":"d3d522f1428624135d550c17efbbcab566a19e77d6b4a21e6510dc8a3734e355","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-07-13T14:29:18Z","title_canon_sha256":"80c305499b5453ca0a6d3ba4fb1909872748f568277c7bb526ec9347746b46d3"},"schema_version":"1.0","source":{"id":"1107.2559","kind":"arxiv","version":2}},"canonical_sha256":"c9b2cdbe18ec0bf65e265a12636d44d0ced36d51832d8ff562f10e3c1fac7525","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9b2cdbe18ec0bf65e265a12636d44d0ced36d51832d8ff562f10e3c1fac7525","first_computed_at":"2026-05-18T02:27:49.850375Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:49.850375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QBF8ieg+MObBEVcC/R+ws0+y2CoBEzHG1Vfy9+KNTZ1iePkZTpeDW7hrdaqXxymGF3ZQHiKEXazV4kNJG2zmBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:49.850883Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.2559","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a843216078bce40cf58688186c436855411def055dd6f20a4272ec478eef66d","sha256:d5d704bf48182956cb46b90135829a7afd275ef26e523a8e1596a5f7f09c299b"],"state_sha256":"dd22d89ae038e6895692f0c970f8fb407a552c95ae5d847aec730000a1d5b315"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U+4bJzc+Gh58s8k0S5qaYonPhP5Q5x5r8CpRYEIbz+wIuCj+12rrpB9uNL3Zg2irsaTlDzuocgxtCIApoiiaCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:19:23.215204Z","bundle_sha256":"1dbaa2958030a55e1e48f8979c5678d8a6ff2c156fc406f93a7a8fed19e736ad"}}