{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:DVEO4JYDVZKT4EXAE3TL2FGYYD","short_pith_number":"pith:DVEO4JYD","schema_version":"1.0","canonical_sha256":"1d48ee2703ae553e12e026e6bd14d8c0d8e905c0b8d21ce676b9eb2b110a4844","source":{"kind":"arxiv","id":"1209.0263","version":3},"attestation_state":"computed","paper":{"title":"A strong direct product theorem in terms of the smooth rectangle bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Penghui Yao, Rahul Jain","submitted_at":"2012-09-03T08:02:29Z","abstract_excerpt":"A strong direct product theorem states that, in order to solve k instances of a problem, if we provide less than k times the resource required to compute one instance, then the probability of overall success is exponentially small in k. In this paper, we consider the model of two-way public-coin communication complexity and show a strong direct product theorem for all relations in terms of the smooth rectangle bound, introduced by Jain and Klauck as a generic lower bound method in this model. Our result therefore uniformly implies a strong direct product theorem for all relations for which an "},"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":"1209.0263","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-09-03T08:02:29Z","cross_cats_sorted":[],"title_canon_sha256":"056b767f94f5ba83075a6ab18323fca902d41a05ae67e7cf5e5001a1c7105159","abstract_canon_sha256":"dff943be3acf0769d5d9839bb56b95d4cfafb15629e823ba93725d1bede6dc1d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:13.918270Z","signature_b64":"f6rUmtGj2SkHXqww2C1kn1ja9o7n8+m2o2h83uI8AAJsfY2ioFaL1EnwTRxRmCvgHXz/Cv7rE604/XDRYVlZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d48ee2703ae553e12e026e6bd14d8c0d8e905c0b8d21ce676b9eb2b110a4844","last_reissued_at":"2026-05-18T03:33:13.917621Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:13.917621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A strong direct product theorem in terms of the smooth rectangle bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Penghui Yao, Rahul Jain","submitted_at":"2012-09-03T08:02:29Z","abstract_excerpt":"A strong direct product theorem states that, in order to solve k instances of a problem, if we provide less than k times the resource required to compute one instance, then the probability of overall success is exponentially small in k. In this paper, we consider the model of two-way public-coin communication complexity and show a strong direct product theorem for all relations in terms of the smooth rectangle bound, introduced by Jain and Klauck as a generic lower bound method in this model. Our result therefore uniformly implies a strong direct product theorem for all relations for which an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0263","kind":"arxiv","version":3},"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":"1209.0263","created_at":"2026-05-18T03:33:13.917720+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.0263v3","created_at":"2026-05-18T03:33:13.917720+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0263","created_at":"2026-05-18T03:33:13.917720+00:00"},{"alias_kind":"pith_short_12","alias_value":"DVEO4JYDVZKT","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"DVEO4JYDVZKT4EXA","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"DVEO4JYD","created_at":"2026-05-18T12:27:04.183437+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/DVEO4JYDVZKT4EXAE3TL2FGYYD","json":"https://pith.science/pith/DVEO4JYDVZKT4EXAE3TL2FGYYD.json","graph_json":"https://pith.science/api/pith-number/DVEO4JYDVZKT4EXAE3TL2FGYYD/graph.json","events_json":"https://pith.science/api/pith-number/DVEO4JYDVZKT4EXAE3TL2FGYYD/events.json","paper":"https://pith.science/paper/DVEO4JYD"},"agent_actions":{"view_html":"https://pith.science/pith/DVEO4JYDVZKT4EXAE3TL2FGYYD","download_json":"https://pith.science/pith/DVEO4JYDVZKT4EXAE3TL2FGYYD.json","view_paper":"https://pith.science/paper/DVEO4JYD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.0263&json=true","fetch_graph":"https://pith.science/api/pith-number/DVEO4JYDVZKT4EXAE3TL2FGYYD/graph.json","fetch_events":"https://pith.science/api/pith-number/DVEO4JYDVZKT4EXAE3TL2FGYYD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DVEO4JYDVZKT4EXAE3TL2FGYYD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DVEO4JYDVZKT4EXAE3TL2FGYYD/action/storage_attestation","attest_author":"https://pith.science/pith/DVEO4JYDVZKT4EXAE3TL2FGYYD/action/author_attestation","sign_citation":"https://pith.science/pith/DVEO4JYDVZKT4EXAE3TL2FGYYD/action/citation_signature","submit_replication":"https://pith.science/pith/DVEO4JYDVZKT4EXAE3TL2FGYYD/action/replication_record"}},"created_at":"2026-05-18T03:33:13.917720+00:00","updated_at":"2026-05-18T03:33:13.917720+00:00"}