{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ZTN3K2VSFMYHLEHO263Y6NDDKO","short_pith_number":"pith:ZTN3K2VS","canonical_record":{"source":{"id":"1201.1666","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-08T23:31:01Z","cross_cats_sorted":[],"title_canon_sha256":"7b0d937950eeb68636fee2b5427b03dea903da95eecbcb51a7db6c5e273a1b90","abstract_canon_sha256":"56cb12cc34ed5870ac5bccba88a1f9a078a7cd6785c2ab01cfc26fcaa0aac2e3"},"schema_version":"1.0"},"canonical_sha256":"ccdbb56ab22b307590eed7b78f346353813cfc828109329d7d8cff3911af4ab5","source":{"kind":"arxiv","id":"1201.1666","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.1666","created_at":"2026-05-18T04:05:02Z"},{"alias_kind":"arxiv_version","alias_value":"1201.1666v1","created_at":"2026-05-18T04:05:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1666","created_at":"2026-05-18T04:05:02Z"},{"alias_kind":"pith_short_12","alias_value":"ZTN3K2VSFMYH","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZTN3K2VSFMYHLEHO","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZTN3K2VS","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ZTN3K2VSFMYHLEHO263Y6NDDKO","target":"record","payload":{"canonical_record":{"source":{"id":"1201.1666","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-08T23:31:01Z","cross_cats_sorted":[],"title_canon_sha256":"7b0d937950eeb68636fee2b5427b03dea903da95eecbcb51a7db6c5e273a1b90","abstract_canon_sha256":"56cb12cc34ed5870ac5bccba88a1f9a078a7cd6785c2ab01cfc26fcaa0aac2e3"},"schema_version":"1.0"},"canonical_sha256":"ccdbb56ab22b307590eed7b78f346353813cfc828109329d7d8cff3911af4ab5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:02.862370Z","signature_b64":"AKX0g2Mt1cp3UEnydVIAvteSx0lIPsGbVkyHRg27cdlVaJ8OgNxhO3JaBSNhiV6fJWYsDZvhnSMl9p9RsRuMDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccdbb56ab22b307590eed7b78f346353813cfc828109329d7d8cff3911af4ab5","last_reissued_at":"2026-05-18T04:05:02.861817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:02.861817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.1666","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-18T04:05:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4X5ec7M7R7WKaKWqpS8QXx0vm1wnhHS1BZ/WLhPHhS7UBswBvpwH67eG1+e6khbziBOc4prRZWh6YxI3N5BNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T23:06:59.825661Z"},"content_sha256":"af23574fdf48951198bf6810442fc9238d25631b3ef8475d5eb5d6de0dff1ee5","schema_version":"1.0","event_id":"sha256:af23574fdf48951198bf6810442fc9238d25631b3ef8475d5eb5d6de0dff1ee5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ZTN3K2VSFMYHLEHO263Y6NDDKO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A direct product theorem for bounded-round public-coin randomized communication complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Attila Pereszlenyi, Penghui Yao, Rahul Jain","submitted_at":"2012-01-08T23:31:01Z","abstract_excerpt":"In this paper, we show a direct product theorm in the model of two-party bounded-round public-coin randomized communication complexity. For a relation f subset of X times Y times Z (X,Y,Z are finite sets), let R^{(t), pub}_e (f) denote the two-party t-message public-coin communication complexity of f with worst case error e. We show that for any relation f and positive integer k: R^{(t), pub}_{1 - 2^{-Omega(k/t^2)}}(f^k) = Omega(k/t (R^{(t), pub}_{1/3}(f) - O(t^2))) . In particular, it implies a strong direct product theorem for the two-party constant-message public-coin randomized communicati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1666","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-18T04:05:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d1zS6hbJncktSmGYliGNJYPJDK5pnxQwjjJzWgzgKdQ4N9MDtcJVSNvmr3K1D+CQgMU3VGbhcdkDA4GFmU9JAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T23:06:59.826308Z"},"content_sha256":"2e7b55ef09aba4c8d640d68b964f258fff88ae12b9307db775257b259d75563e","schema_version":"1.0","event_id":"sha256:2e7b55ef09aba4c8d640d68b964f258fff88ae12b9307db775257b259d75563e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZTN3K2VSFMYHLEHO263Y6NDDKO/bundle.json","state_url":"https://pith.science/pith/ZTN3K2VSFMYHLEHO263Y6NDDKO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZTN3K2VSFMYHLEHO263Y6NDDKO/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-05-22T23:06:59Z","links":{"resolver":"https://pith.science/pith/ZTN3K2VSFMYHLEHO263Y6NDDKO","bundle":"https://pith.science/pith/ZTN3K2VSFMYHLEHO263Y6NDDKO/bundle.json","state":"https://pith.science/pith/ZTN3K2VSFMYHLEHO263Y6NDDKO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZTN3K2VSFMYHLEHO263Y6NDDKO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ZTN3K2VSFMYHLEHO263Y6NDDKO","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":"56cb12cc34ed5870ac5bccba88a1f9a078a7cd6785c2ab01cfc26fcaa0aac2e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-08T23:31:01Z","title_canon_sha256":"7b0d937950eeb68636fee2b5427b03dea903da95eecbcb51a7db6c5e273a1b90"},"schema_version":"1.0","source":{"id":"1201.1666","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.1666","created_at":"2026-05-18T04:05:02Z"},{"alias_kind":"arxiv_version","alias_value":"1201.1666v1","created_at":"2026-05-18T04:05:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1666","created_at":"2026-05-18T04:05:02Z"},{"alias_kind":"pith_short_12","alias_value":"ZTN3K2VSFMYH","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZTN3K2VSFMYHLEHO","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZTN3K2VS","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:2e7b55ef09aba4c8d640d68b964f258fff88ae12b9307db775257b259d75563e","target":"graph","created_at":"2026-05-18T04:05:02Z","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 show a direct product theorm in the model of two-party bounded-round public-coin randomized communication complexity. For a relation f subset of X times Y times Z (X,Y,Z are finite sets), let R^{(t), pub}_e (f) denote the two-party t-message public-coin communication complexity of f with worst case error e. We show that for any relation f and positive integer k: R^{(t), pub}_{1 - 2^{-Omega(k/t^2)}}(f^k) = Omega(k/t (R^{(t), pub}_{1/3}(f) - O(t^2))) . In particular, it implies a strong direct product theorem for the two-party constant-message public-coin randomized communicati","authors_text":"Attila Pereszlenyi, Penghui Yao, Rahul Jain","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-08T23:31:01Z","title":"A direct product theorem for bounded-round public-coin randomized communication complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1666","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:af23574fdf48951198bf6810442fc9238d25631b3ef8475d5eb5d6de0dff1ee5","target":"record","created_at":"2026-05-18T04:05:02Z","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":"56cb12cc34ed5870ac5bccba88a1f9a078a7cd6785c2ab01cfc26fcaa0aac2e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-08T23:31:01Z","title_canon_sha256":"7b0d937950eeb68636fee2b5427b03dea903da95eecbcb51a7db6c5e273a1b90"},"schema_version":"1.0","source":{"id":"1201.1666","kind":"arxiv","version":1}},"canonical_sha256":"ccdbb56ab22b307590eed7b78f346353813cfc828109329d7d8cff3911af4ab5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ccdbb56ab22b307590eed7b78f346353813cfc828109329d7d8cff3911af4ab5","first_computed_at":"2026-05-18T04:05:02.861817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:02.861817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AKX0g2Mt1cp3UEnydVIAvteSx0lIPsGbVkyHRg27cdlVaJ8OgNxhO3JaBSNhiV6fJWYsDZvhnSMl9p9RsRuMDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:02.862370Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.1666","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af23574fdf48951198bf6810442fc9238d25631b3ef8475d5eb5d6de0dff1ee5","sha256:2e7b55ef09aba4c8d640d68b964f258fff88ae12b9307db775257b259d75563e"],"state_sha256":"16ef252eafca012ece194ac97a395e5d72a47ba408dff5d3c034014f55a67648"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6lbsWKTbTvPcQnPLZZw2zQhpoOVpa7VvKR+dDvEWL1YbFMFIh1ZcWiYfzf5vDf1INjrTgZA9JTM760W77L41DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T23:06:59.830033Z","bundle_sha256":"4908d430b096f76c51e3d4db9d9311cd2423f04da1a3099d7b075973011be4a1"}}