{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:DVEO4JYDVZKT4EXAE3TL2FGYYD","short_pith_number":"pith:DVEO4JYD","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"},"canonical_sha256":"1d48ee2703ae553e12e026e6bd14d8c0d8e905c0b8d21ce676b9eb2b110a4844","source":{"kind":"arxiv","id":"1209.0263","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0263","created_at":"2026-05-18T03:33:13Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0263v3","created_at":"2026-05-18T03:33:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0263","created_at":"2026-05-18T03:33:13Z"},{"alias_kind":"pith_short_12","alias_value":"DVEO4JYDVZKT","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DVEO4JYDVZKT4EXA","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DVEO4JYD","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:DVEO4JYDVZKT4EXAE3TL2FGYYD","target":"record","payload":{"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"},"canonical_sha256":"1d48ee2703ae553e12e026e6bd14d8c0d8e905c0b8d21ce676b9eb2b110a4844","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"},"source_kind":"arxiv","source_id":"1209.0263","source_version":3,"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:33:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KHByylt2fXKh6JEAIf8LCKRsCbNj+A6U7jLzbSubmVkPIAMfgp/oT/dZd3RpZBDBNcK3pdSQXKaMsohlXcP3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T01:27:44.087652Z"},"content_sha256":"32504045ee8f86fbde05f0e48176783e89807a68716feb7b480e936dd40fc8b5","schema_version":"1.0","event_id":"sha256:32504045ee8f86fbde05f0e48176783e89807a68716feb7b480e936dd40fc8b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:DVEO4JYDVZKT4EXAE3TL2FGYYD","target":"graph","payload":{"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"},"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:33:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AyT41+zgQP1/09VbFWNblwROKqxmSNTDS4AdKFp5FlkhtyxC5yF9e2GGOdUvBvzxiHgmcN7B3AfWUjkcsdCIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T01:27:44.088097Z"},"content_sha256":"0858ff1e26ac1dfa0d48a6a1441f1385be60379fa56a25258fa297838d0ef8c9","schema_version":"1.0","event_id":"sha256:0858ff1e26ac1dfa0d48a6a1441f1385be60379fa56a25258fa297838d0ef8c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DVEO4JYDVZKT4EXAE3TL2FGYYD/bundle.json","state_url":"https://pith.science/pith/DVEO4JYDVZKT4EXAE3TL2FGYYD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DVEO4JYDVZKT4EXAE3TL2FGYYD/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-22T01:27:44Z","links":{"resolver":"https://pith.science/pith/DVEO4JYDVZKT4EXAE3TL2FGYYD","bundle":"https://pith.science/pith/DVEO4JYDVZKT4EXAE3TL2FGYYD/bundle.json","state":"https://pith.science/pith/DVEO4JYDVZKT4EXAE3TL2FGYYD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DVEO4JYDVZKT4EXAE3TL2FGYYD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:DVEO4JYDVZKT4EXAE3TL2FGYYD","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":"dff943be3acf0769d5d9839bb56b95d4cfafb15629e823ba93725d1bede6dc1d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-09-03T08:02:29Z","title_canon_sha256":"056b767f94f5ba83075a6ab18323fca902d41a05ae67e7cf5e5001a1c7105159"},"schema_version":"1.0","source":{"id":"1209.0263","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0263","created_at":"2026-05-18T03:33:13Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0263v3","created_at":"2026-05-18T03:33:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0263","created_at":"2026-05-18T03:33:13Z"},{"alias_kind":"pith_short_12","alias_value":"DVEO4JYDVZKT","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DVEO4JYDVZKT4EXA","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DVEO4JYD","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:0858ff1e26ac1dfa0d48a6a1441f1385be60379fa56a25258fa297838d0ef8c9","target":"graph","created_at":"2026-05-18T03:33:13Z","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":"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 ","authors_text":"Penghui Yao, Rahul Jain","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-09-03T08:02:29Z","title":"A strong direct product theorem in terms of the smooth rectangle bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0263","kind":"arxiv","version":3},"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:32504045ee8f86fbde05f0e48176783e89807a68716feb7b480e936dd40fc8b5","target":"record","created_at":"2026-05-18T03:33:13Z","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":"dff943be3acf0769d5d9839bb56b95d4cfafb15629e823ba93725d1bede6dc1d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-09-03T08:02:29Z","title_canon_sha256":"056b767f94f5ba83075a6ab18323fca902d41a05ae67e7cf5e5001a1c7105159"},"schema_version":"1.0","source":{"id":"1209.0263","kind":"arxiv","version":3}},"canonical_sha256":"1d48ee2703ae553e12e026e6bd14d8c0d8e905c0b8d21ce676b9eb2b110a4844","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d48ee2703ae553e12e026e6bd14d8c0d8e905c0b8d21ce676b9eb2b110a4844","first_computed_at":"2026-05-18T03:33:13.917621Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:13.917621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f6rUmtGj2SkHXqww2C1kn1ja9o7n8+m2o2h83uI8AAJsfY2ioFaL1EnwTRxRmCvgHXz/Cv7rE604/XDRYVlZBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:13.918270Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.0263","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32504045ee8f86fbde05f0e48176783e89807a68716feb7b480e936dd40fc8b5","sha256:0858ff1e26ac1dfa0d48a6a1441f1385be60379fa56a25258fa297838d0ef8c9"],"state_sha256":"46893afd3358c408a42602e32a73678aceb106e4fd55b4b9438136ea31fe841c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"adzjCoJvuQxF2Oru1MAKPKtKsXuRgyW0o0i3wq3FPBwi3nljXDTB4R3QwIyTaJsh5EPTgh9tvUyzAm1wwpySDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T01:27:44.091408Z","bundle_sha256":"fc9b2c18cc8ae2adc12f68419a36b5ac286b925dbc46042d6d87e1abf98601ff"}}