{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:2PCEMVYK3K4OVQIMM7E6MFQ7ZC","short_pith_number":"pith:2PCEMVYK","canonical_record":{"source":{"id":"1304.1217","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-04-04T00:20:31Z","cross_cats_sorted":[],"title_canon_sha256":"d84baf4336f283aaa4214e2c4db068bad1c34df01702197eed9dfd3e6bf310ea","abstract_canon_sha256":"93415ecad75c133f099238a15271f1166cf8e6841be50cbed70e553e2254313f"},"schema_version":"1.0"},"canonical_sha256":"d3c446570adab8eac10c67c9e6161fc89bc3eb95b0f07450588b66fd69a24a27","source":{"kind":"arxiv","id":"1304.1217","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1217","created_at":"2026-05-18T03:29:04Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1217v1","created_at":"2026-05-18T03:29:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1217","created_at":"2026-05-18T03:29:04Z"},{"alias_kind":"pith_short_12","alias_value":"2PCEMVYK3K4O","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2PCEMVYK3K4OVQIM","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2PCEMVYK","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:2PCEMVYK3K4OVQIMM7E6MFQ7ZC","target":"record","payload":{"canonical_record":{"source":{"id":"1304.1217","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-04-04T00:20:31Z","cross_cats_sorted":[],"title_canon_sha256":"d84baf4336f283aaa4214e2c4db068bad1c34df01702197eed9dfd3e6bf310ea","abstract_canon_sha256":"93415ecad75c133f099238a15271f1166cf8e6841be50cbed70e553e2254313f"},"schema_version":"1.0"},"canonical_sha256":"d3c446570adab8eac10c67c9e6161fc89bc3eb95b0f07450588b66fd69a24a27","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:04.226687Z","signature_b64":"Jwbq+5ZdH76YDblqQT9qO/CucWSPZzT0IMLFN9aUczVkSnPRbgzwjoH90SM2nGlZ7JGp7iKV1Ymk4wLMhYGzBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3c446570adab8eac10c67c9e6161fc89bc3eb95b0f07450588b66fd69a24a27","last_reissued_at":"2026-05-18T03:29:04.226192Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:04.226192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.1217","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:29:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oXOzhkVDcGyM3zgIA5YZTV5RvoNVubLFmr3tUpdBlRn5gLBK1vXN0CAeamZ6Q/yL7SUCPr6LBnuQmZfLIBaKAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:41:51.375302Z"},"content_sha256":"183738c498e5a26ece1c7a23be5131f839c0f8f4d35a2ca11045f82085ae22f0","schema_version":"1.0","event_id":"sha256:183738c498e5a26ece1c7a23be5131f839c0f8f4d35a2ca11045f82085ae22f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:2PCEMVYK3K4OVQIMM7E6MFQ7ZC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the communication complexity of sparse set disjointness and exists-equal problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Gabor Tardos, Mert Saglam","submitted_at":"2013-04-04T00:20:31Z","abstract_excerpt":"In this paper we study the two player randomized communication complexity of the sparse set disjointness and the exists-equal problems and give matching lower and upper bounds (up to constant factors) for any number of rounds for both of these problems. In the sparse set disjointness problem, each player receives a k-subset of [m] and the goal is to determine whether the sets intersect. For this problem, we give a protocol that communicates a total of O(k\\log^{(r)}k) bits over r rounds and errs with very small probability. Here we can take r=\\log^{*}k to obtain a O(k) total communication \\log^"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1217","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:29:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4uBtLW9FdAzYdBbkMdEkz1ITXNg16JA1KojZFyJrfhjFMP5NkUXA2rh5l1jSWulq3UM8eMOY+4WGxHrrnVUtDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:41:51.375667Z"},"content_sha256":"22eab0eac8058f3e57ce8ff546a0113e7098393d5cdfee6dd27703dcf2a6bc6a","schema_version":"1.0","event_id":"sha256:22eab0eac8058f3e57ce8ff546a0113e7098393d5cdfee6dd27703dcf2a6bc6a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2PCEMVYK3K4OVQIMM7E6MFQ7ZC/bundle.json","state_url":"https://pith.science/pith/2PCEMVYK3K4OVQIMM7E6MFQ7ZC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2PCEMVYK3K4OVQIMM7E6MFQ7ZC/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-04T21:41:51Z","links":{"resolver":"https://pith.science/pith/2PCEMVYK3K4OVQIMM7E6MFQ7ZC","bundle":"https://pith.science/pith/2PCEMVYK3K4OVQIMM7E6MFQ7ZC/bundle.json","state":"https://pith.science/pith/2PCEMVYK3K4OVQIMM7E6MFQ7ZC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2PCEMVYK3K4OVQIMM7E6MFQ7ZC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2PCEMVYK3K4OVQIMM7E6MFQ7ZC","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":"93415ecad75c133f099238a15271f1166cf8e6841be50cbed70e553e2254313f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-04-04T00:20:31Z","title_canon_sha256":"d84baf4336f283aaa4214e2c4db068bad1c34df01702197eed9dfd3e6bf310ea"},"schema_version":"1.0","source":{"id":"1304.1217","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1217","created_at":"2026-05-18T03:29:04Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1217v1","created_at":"2026-05-18T03:29:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1217","created_at":"2026-05-18T03:29:04Z"},{"alias_kind":"pith_short_12","alias_value":"2PCEMVYK3K4O","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2PCEMVYK3K4OVQIM","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2PCEMVYK","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:22eab0eac8058f3e57ce8ff546a0113e7098393d5cdfee6dd27703dcf2a6bc6a","target":"graph","created_at":"2026-05-18T03:29:04Z","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 study the two player randomized communication complexity of the sparse set disjointness and the exists-equal problems and give matching lower and upper bounds (up to constant factors) for any number of rounds for both of these problems. In the sparse set disjointness problem, each player receives a k-subset of [m] and the goal is to determine whether the sets intersect. For this problem, we give a protocol that communicates a total of O(k\\log^{(r)}k) bits over r rounds and errs with very small probability. Here we can take r=\\log^{*}k to obtain a O(k) total communication \\log^","authors_text":"Gabor Tardos, Mert Saglam","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-04-04T00:20:31Z","title":"On the communication complexity of sparse set disjointness and exists-equal problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1217","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:183738c498e5a26ece1c7a23be5131f839c0f8f4d35a2ca11045f82085ae22f0","target":"record","created_at":"2026-05-18T03:29:04Z","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":"93415ecad75c133f099238a15271f1166cf8e6841be50cbed70e553e2254313f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-04-04T00:20:31Z","title_canon_sha256":"d84baf4336f283aaa4214e2c4db068bad1c34df01702197eed9dfd3e6bf310ea"},"schema_version":"1.0","source":{"id":"1304.1217","kind":"arxiv","version":1}},"canonical_sha256":"d3c446570adab8eac10c67c9e6161fc89bc3eb95b0f07450588b66fd69a24a27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3c446570adab8eac10c67c9e6161fc89bc3eb95b0f07450588b66fd69a24a27","first_computed_at":"2026-05-18T03:29:04.226192Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:04.226192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jwbq+5ZdH76YDblqQT9qO/CucWSPZzT0IMLFN9aUczVkSnPRbgzwjoH90SM2nGlZ7JGp7iKV1Ymk4wLMhYGzBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:04.226687Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.1217","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:183738c498e5a26ece1c7a23be5131f839c0f8f4d35a2ca11045f82085ae22f0","sha256:22eab0eac8058f3e57ce8ff546a0113e7098393d5cdfee6dd27703dcf2a6bc6a"],"state_sha256":"d8f6110efb9a2583fe53e7969a09a1904b35b0f55f913c9884fcebb9bc88c87d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TWrn5c9gzK8szkzTJ26rKQ89Xam0TvVku6zmc+IALKk8eTR0E53zPMMZ0/QgeIn4izObFmnf/om1MTGqWRpACw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T21:41:51.377556Z","bundle_sha256":"09024fe2996064780c209df4231f51040929f4aa35cae9fc4dc2d7eed22ae8d5"}}