{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:GJOAVL4FPHVRCWVVZVBWVTXKAP","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":"a883e21cae92f58d27a77802a9ba0010ad8d7bd31dc38482f8fe9805f89ec840","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-11-20T03:36:48Z","title_canon_sha256":"4261a8d8efd82da4e190c2ff20a35b8e6fac9890a85e8255978517ab31b5cf4f"},"schema_version":"1.0","source":{"id":"2411.13015","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.13015","created_at":"2026-07-05T11:21:38Z"},{"alias_kind":"arxiv_version","alias_value":"2411.13015v2","created_at":"2026-07-05T11:21:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.13015","created_at":"2026-07-05T11:21:38Z"},{"alias_kind":"pith_short_12","alias_value":"GJOAVL4FPHVR","created_at":"2026-07-05T11:21:38Z"},{"alias_kind":"pith_short_16","alias_value":"GJOAVL4FPHVRCWVV","created_at":"2026-07-05T11:21:38Z"},{"alias_kind":"pith_short_8","alias_value":"GJOAVL4F","created_at":"2026-07-05T11:21:38Z"}],"graph_snapshots":[{"event_id":"sha256:b3281e7decbb2ab7e4a3223a01ba95d56ed3a9d18d69d827662d98d8838af21d","target":"graph","created_at":"2026-07-05T11:21:38Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.13015/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For any $\\{0,1\\}$-valued function $f$, its \\emph{$n$-folded XOR} is the function $f^{\\oplus n}$ where $f^{\\oplus n}(X_1, \\ldots, X_n) = f(X_1) \\oplus \\cdots \\oplus f(X_n)$. Given a procedure for computing the function $f$, one can apply a ``naive\" approach to compute $f^{\\oplus n}$ by computing each $f(X_i)$ independently, followed by XORing the outputs. This approach uses $n$ times the resources required for computing $f$.\n  In this paper, we prove a strong XOR lemma for \\emph{information complexity} in the two-player randomized communication model: if computing $f$ with an error probability ","authors_text":"Huacheng Yu, Pachara Sawettamalya","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-11-20T03:36:48Z","title":"Strong XOR Lemma for Information Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.13015","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:6251a3df83a69315fe06e12c59a3d1977a246e2b9efd80f26a47135eab9e486e","target":"record","created_at":"2026-07-05T11:21:38Z","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":"a883e21cae92f58d27a77802a9ba0010ad8d7bd31dc38482f8fe9805f89ec840","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-11-20T03:36:48Z","title_canon_sha256":"4261a8d8efd82da4e190c2ff20a35b8e6fac9890a85e8255978517ab31b5cf4f"},"schema_version":"1.0","source":{"id":"2411.13015","kind":"arxiv","version":2}},"canonical_sha256":"325c0aaf8579eb115ab5cd436aceea03d86d95399283b25ce6259b2ee6eda995","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"325c0aaf8579eb115ab5cd436aceea03d86d95399283b25ce6259b2ee6eda995","first_computed_at":"2026-07-05T11:21:38.395807Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:21:38.395807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LX7bQ2hqU+SGeymRnyZSsSyfhideZ7wSPQV/N91WBH9b2ejzBMHX47I9fR0gTN5zhv1NyfG3eAB+fXYcUdMyBg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:21:38.396349Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.13015","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6251a3df83a69315fe06e12c59a3d1977a246e2b9efd80f26a47135eab9e486e","sha256:b3281e7decbb2ab7e4a3223a01ba95d56ed3a9d18d69d827662d98d8838af21d"],"state_sha256":"a0204360ebe97abfcd8411c182d25002eb15acc1fce27b9998abe5668d9a332b"}