{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:5WWNFDSGGR7GJPBZXBJ5EHHFZI","short_pith_number":"pith:5WWNFDSG","schema_version":"1.0","canonical_sha256":"edacd28e46347e64bc39b853d21ce5ca09bf1c184ef2757de147ff80552357b6","source":{"kind":"arxiv","id":"1010.0522","version":2},"attestation_state":"computed","paper":{"title":"Strong direct product conjecture holds for all relations in public coin randomized one-way communication complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Rahul Jain","submitted_at":"2010-10-04T09:57:55Z","abstract_excerpt":"Let f subset of X x Y x Z be a relation. Let the public coin one-way communication complexity of f, with worst case error 1/3, be denoted R^{1,pub}_{1/3}(f). We show that if for computing f^k (k independent copies of f), o(k R^{1,pub}_{1/3}(f)) communication is provided, then the success is exponentially small in k. This settles the strong direct product conjecture for all relations in public coin one-way communication complexity.\n  We show a new tight characterization of public coin one-way communication complexity which strengthens on the tight characterization shown in [J., Klauck, Nayak 08"},"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":"1010.0522","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-10-04T09:57:55Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"fc11672888fc6fcb9b3cf1f4f10f37a314f89f0980ea87bcac0542d030f7c672","abstract_canon_sha256":"6dc05dc672db2437a8ca5a870bb5bf797067f76fcf952ccf1570c23c09acc563"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:19.275058Z","signature_b64":"Ly2uh+LbKMcXD4Rw/ZxEAnof3G+HLe5Dt8KeBYVzXXrOI9bpmLmHY2jr078INfnqPS1hnGAw6h40usXBZ51oAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edacd28e46347e64bc39b853d21ce5ca09bf1c184ef2757de147ff80552357b6","last_reissued_at":"2026-05-18T04:39:19.274561Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:19.274561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong direct product conjecture holds for all relations in public coin randomized one-way communication complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Rahul Jain","submitted_at":"2010-10-04T09:57:55Z","abstract_excerpt":"Let f subset of X x Y x Z be a relation. Let the public coin one-way communication complexity of f, with worst case error 1/3, be denoted R^{1,pub}_{1/3}(f). We show that if for computing f^k (k independent copies of f), o(k R^{1,pub}_{1/3}(f)) communication is provided, then the success is exponentially small in k. This settles the strong direct product conjecture for all relations in public coin one-way communication complexity.\n  We show a new tight characterization of public coin one-way communication complexity which strengthens on the tight characterization shown in [J., Klauck, Nayak 08"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0522","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1010.0522","created_at":"2026-05-18T04:39:19.274629+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.0522v2","created_at":"2026-05-18T04:39:19.274629+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0522","created_at":"2026-05-18T04:39:19.274629+00:00"},{"alias_kind":"pith_short_12","alias_value":"5WWNFDSGGR7G","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"5WWNFDSGGR7GJPBZ","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"5WWNFDSG","created_at":"2026-05-18T12:26:04.259169+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/5WWNFDSGGR7GJPBZXBJ5EHHFZI","json":"https://pith.science/pith/5WWNFDSGGR7GJPBZXBJ5EHHFZI.json","graph_json":"https://pith.science/api/pith-number/5WWNFDSGGR7GJPBZXBJ5EHHFZI/graph.json","events_json":"https://pith.science/api/pith-number/5WWNFDSGGR7GJPBZXBJ5EHHFZI/events.json","paper":"https://pith.science/paper/5WWNFDSG"},"agent_actions":{"view_html":"https://pith.science/pith/5WWNFDSGGR7GJPBZXBJ5EHHFZI","download_json":"https://pith.science/pith/5WWNFDSGGR7GJPBZXBJ5EHHFZI.json","view_paper":"https://pith.science/paper/5WWNFDSG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.0522&json=true","fetch_graph":"https://pith.science/api/pith-number/5WWNFDSGGR7GJPBZXBJ5EHHFZI/graph.json","fetch_events":"https://pith.science/api/pith-number/5WWNFDSGGR7GJPBZXBJ5EHHFZI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5WWNFDSGGR7GJPBZXBJ5EHHFZI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5WWNFDSGGR7GJPBZXBJ5EHHFZI/action/storage_attestation","attest_author":"https://pith.science/pith/5WWNFDSGGR7GJPBZXBJ5EHHFZI/action/author_attestation","sign_citation":"https://pith.science/pith/5WWNFDSGGR7GJPBZXBJ5EHHFZI/action/citation_signature","submit_replication":"https://pith.science/pith/5WWNFDSGGR7GJPBZXBJ5EHHFZI/action/replication_record"}},"created_at":"2026-05-18T04:39:19.274629+00:00","updated_at":"2026-05-18T04:39:19.274629+00:00"}