{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:5WWNFDSGGR7GJPBZXBJ5EHHFZI","short_pith_number":"pith:5WWNFDSG","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"},"canonical_sha256":"edacd28e46347e64bc39b853d21ce5ca09bf1c184ef2757de147ff80552357b6","source":{"kind":"arxiv","id":"1010.0522","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0522","created_at":"2026-05-18T04:39:19Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0522v2","created_at":"2026-05-18T04:39:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0522","created_at":"2026-05-18T04:39:19Z"},{"alias_kind":"pith_short_12","alias_value":"5WWNFDSGGR7G","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5WWNFDSGGR7GJPBZ","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5WWNFDSG","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:5WWNFDSGGR7GJPBZXBJ5EHHFZI","target":"record","payload":{"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"},"canonical_sha256":"edacd28e46347e64bc39b853d21ce5ca09bf1c184ef2757de147ff80552357b6","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"},"source_kind":"arxiv","source_id":"1010.0522","source_version":2,"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:39:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QJAJIEvlkXNJXktagmI91xdtQMjXPYD519sr3Ko12R2CFxx3uXs4h+OMpbZqgQA7qfh3gQBs1I1F2YMr3lOTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:23:52.319655Z"},"content_sha256":"d27d1a8d02c0d514d0efaecd1683075e32bd1533d3ecdaee398f4f6674ff3144","schema_version":"1.0","event_id":"sha256:d27d1a8d02c0d514d0efaecd1683075e32bd1533d3ecdaee398f4f6674ff3144"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:5WWNFDSGGR7GJPBZXBJ5EHHFZI","target":"graph","payload":{"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"},"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:39:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cE5QGIL92B07s6FYbTVY+IpUiUo044DRLf+m9PNWa8T6oTWSMr48sglXWHzOI+D/253X6ADBlHSqfbU/rMJvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:23:52.320283Z"},"content_sha256":"1126aa116e4d664e43655c67851774c59b30d6eb197e26960b77b73d10003f97","schema_version":"1.0","event_id":"sha256:1126aa116e4d664e43655c67851774c59b30d6eb197e26960b77b73d10003f97"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5WWNFDSGGR7GJPBZXBJ5EHHFZI/bundle.json","state_url":"https://pith.science/pith/5WWNFDSGGR7GJPBZXBJ5EHHFZI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5WWNFDSGGR7GJPBZXBJ5EHHFZI/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-25T15:23:52Z","links":{"resolver":"https://pith.science/pith/5WWNFDSGGR7GJPBZXBJ5EHHFZI","bundle":"https://pith.science/pith/5WWNFDSGGR7GJPBZXBJ5EHHFZI/bundle.json","state":"https://pith.science/pith/5WWNFDSGGR7GJPBZXBJ5EHHFZI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5WWNFDSGGR7GJPBZXBJ5EHHFZI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:5WWNFDSGGR7GJPBZXBJ5EHHFZI","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":"6dc05dc672db2437a8ca5a870bb5bf797067f76fcf952ccf1570c23c09acc563","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-10-04T09:57:55Z","title_canon_sha256":"fc11672888fc6fcb9b3cf1f4f10f37a314f89f0980ea87bcac0542d030f7c672"},"schema_version":"1.0","source":{"id":"1010.0522","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0522","created_at":"2026-05-18T04:39:19Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0522v2","created_at":"2026-05-18T04:39:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0522","created_at":"2026-05-18T04:39:19Z"},{"alias_kind":"pith_short_12","alias_value":"5WWNFDSGGR7G","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5WWNFDSGGR7GJPBZ","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5WWNFDSG","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:1126aa116e4d664e43655c67851774c59b30d6eb197e26960b77b73d10003f97","target":"graph","created_at":"2026-05-18T04:39:19Z","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":"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","authors_text":"Rahul Jain","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-10-04T09:57:55Z","title":"Strong direct product conjecture holds for all relations in public coin randomized one-way communication complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0522","kind":"arxiv","version":2},"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:d27d1a8d02c0d514d0efaecd1683075e32bd1533d3ecdaee398f4f6674ff3144","target":"record","created_at":"2026-05-18T04:39:19Z","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":"6dc05dc672db2437a8ca5a870bb5bf797067f76fcf952ccf1570c23c09acc563","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-10-04T09:57:55Z","title_canon_sha256":"fc11672888fc6fcb9b3cf1f4f10f37a314f89f0980ea87bcac0542d030f7c672"},"schema_version":"1.0","source":{"id":"1010.0522","kind":"arxiv","version":2}},"canonical_sha256":"edacd28e46347e64bc39b853d21ce5ca09bf1c184ef2757de147ff80552357b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"edacd28e46347e64bc39b853d21ce5ca09bf1c184ef2757de147ff80552357b6","first_computed_at":"2026-05-18T04:39:19.274561Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:19.274561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ly2uh+LbKMcXD4Rw/ZxEAnof3G+HLe5Dt8KeBYVzXXrOI9bpmLmHY2jr078INfnqPS1hnGAw6h40usXBZ51oAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:19.275058Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.0522","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d27d1a8d02c0d514d0efaecd1683075e32bd1533d3ecdaee398f4f6674ff3144","sha256:1126aa116e4d664e43655c67851774c59b30d6eb197e26960b77b73d10003f97"],"state_sha256":"47a22511049ac0f02e069c260b4a0ace1dbf36dc9a76b72052177c45e7585eea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bCNsd7fN6YtUH/LRN4cCkKk37MifARpxz4/hXBQ8/t+Ic0bqgMmTDvVrnp6jQMOAFWL0PGD2GPzBbg39W13DAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:23:52.323836Z","bundle_sha256":"8f13c2b456e2bf3457fb01c19c4863a914461693acacce30bb8f2c893db0f027"}}