{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:COXA2IAQMSCJQ4PU7PBFJUQ3GN","short_pith_number":"pith:COXA2IAQ","schema_version":"1.0","canonical_sha256":"13ae0d201064849871f4fbc254d21b33757ea9b47b105b56a7b35617e466ade5","source":{"kind":"arxiv","id":"1305.4696","version":1},"attestation_state":"computed","paper":{"title":"Tight Bounds for Set Disjointness in the Message Passing Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Faith Ellen, Mark Braverman, Rotem Oshman, Toniann Pitassi, Vinod Vaikuntanathan","submitted_at":"2013-05-21T03:02:02Z","abstract_excerpt":"In a multiparty message-passing model of communication, there are $k$ players. Each player has a private input, and they communicate by sending messages to one another over private channels. While this model has been used extensively in distributed computing and in multiparty computation, lower bounds on communication complexity in this model and related models have been somewhat scarce. In recent work \\cite{phillips12,woodruff12,woodruff13}, strong lower bounds of the form $\\Omega(n \\cdot k)$ were obtained for several functions in the message-passing model; however, a lower bound on the class"},"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":"1305.4696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-21T03:02:02Z","cross_cats_sorted":[],"title_canon_sha256":"2578728edcff6dbfbe9a6b41dfd21fb04553e3679c5c1873c6f560a0768f2c31","abstract_canon_sha256":"b2cadd4be318c67df899f34918ee7e18cbd2eabc0e1d5a7db113b09453f84147"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:15.450903Z","signature_b64":"emfDLHlk+D53lrSW7W2pcEgUpkOtj4JuEL25R3371hLAxkGmO97+8LINI6CxzQeTgMcZXr2c6mXDiHnk1Q+GCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13ae0d201064849871f4fbc254d21b33757ea9b47b105b56a7b35617e466ade5","last_reissued_at":"2026-05-18T03:25:15.450365Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:15.450365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Bounds for Set Disjointness in the Message Passing Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Faith Ellen, Mark Braverman, Rotem Oshman, Toniann Pitassi, Vinod Vaikuntanathan","submitted_at":"2013-05-21T03:02:02Z","abstract_excerpt":"In a multiparty message-passing model of communication, there are $k$ players. Each player has a private input, and they communicate by sending messages to one another over private channels. While this model has been used extensively in distributed computing and in multiparty computation, lower bounds on communication complexity in this model and related models have been somewhat scarce. In recent work \\cite{phillips12,woodruff12,woodruff13}, strong lower bounds of the form $\\Omega(n \\cdot k)$ were obtained for several functions in the message-passing model; however, a lower bound on the class"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4696","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":"1305.4696","created_at":"2026-05-18T03:25:15.450446+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.4696v1","created_at":"2026-05-18T03:25:15.450446+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4696","created_at":"2026-05-18T03:25:15.450446+00:00"},{"alias_kind":"pith_short_12","alias_value":"COXA2IAQMSCJ","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"COXA2IAQMSCJQ4PU","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"COXA2IAQ","created_at":"2026-05-18T12:27:40.988391+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/COXA2IAQMSCJQ4PU7PBFJUQ3GN","json":"https://pith.science/pith/COXA2IAQMSCJQ4PU7PBFJUQ3GN.json","graph_json":"https://pith.science/api/pith-number/COXA2IAQMSCJQ4PU7PBFJUQ3GN/graph.json","events_json":"https://pith.science/api/pith-number/COXA2IAQMSCJQ4PU7PBFJUQ3GN/events.json","paper":"https://pith.science/paper/COXA2IAQ"},"agent_actions":{"view_html":"https://pith.science/pith/COXA2IAQMSCJQ4PU7PBFJUQ3GN","download_json":"https://pith.science/pith/COXA2IAQMSCJQ4PU7PBFJUQ3GN.json","view_paper":"https://pith.science/paper/COXA2IAQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.4696&json=true","fetch_graph":"https://pith.science/api/pith-number/COXA2IAQMSCJQ4PU7PBFJUQ3GN/graph.json","fetch_events":"https://pith.science/api/pith-number/COXA2IAQMSCJQ4PU7PBFJUQ3GN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/COXA2IAQMSCJQ4PU7PBFJUQ3GN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/COXA2IAQMSCJQ4PU7PBFJUQ3GN/action/storage_attestation","attest_author":"https://pith.science/pith/COXA2IAQMSCJQ4PU7PBFJUQ3GN/action/author_attestation","sign_citation":"https://pith.science/pith/COXA2IAQMSCJQ4PU7PBFJUQ3GN/action/citation_signature","submit_replication":"https://pith.science/pith/COXA2IAQMSCJQ4PU7PBFJUQ3GN/action/replication_record"}},"created_at":"2026-05-18T03:25:15.450446+00:00","updated_at":"2026-05-18T03:25:15.450446+00:00"}