{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LZVPOBDGXQV73E3AF76QSHPBFR","short_pith_number":"pith:LZVPOBDG","canonical_record":{"source":{"id":"2607.07396","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-07-08T13:32:29Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"018d071987cc31b06b8198e99675c1b23907696809b5ae17cdf2a2ba7d047868","abstract_canon_sha256":"02a3c16cfeef7c55a77fe0e4311d20d50836200b8f621c17a05984e0f9807ed3"},"schema_version":"1.0"},"canonical_sha256":"5e6af70466bc2bfd93602ffd091de12c7e0169f49afb4f135a0eb2c7a3654749","source":{"kind":"arxiv","id":"2607.07396","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.07396","created_at":"2026-07-09T01:20:23Z"},{"alias_kind":"arxiv_version","alias_value":"2607.07396v1","created_at":"2026-07-09T01:20:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07396","created_at":"2026-07-09T01:20:23Z"},{"alias_kind":"pith_short_12","alias_value":"LZVPOBDGXQV7","created_at":"2026-07-09T01:20:23Z"},{"alias_kind":"pith_short_16","alias_value":"LZVPOBDGXQV73E3A","created_at":"2026-07-09T01:20:23Z"},{"alias_kind":"pith_short_8","alias_value":"LZVPOBDG","created_at":"2026-07-09T01:20:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LZVPOBDGXQV73E3AF76QSHPBFR","target":"record","payload":{"canonical_record":{"source":{"id":"2607.07396","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-07-08T13:32:29Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"018d071987cc31b06b8198e99675c1b23907696809b5ae17cdf2a2ba7d047868","abstract_canon_sha256":"02a3c16cfeef7c55a77fe0e4311d20d50836200b8f621c17a05984e0f9807ed3"},"schema_version":"1.0"},"canonical_sha256":"5e6af70466bc2bfd93602ffd091de12c7e0169f49afb4f135a0eb2c7a3654749","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-09T01:20:23.841244Z","signature_b64":"O7DfyZC2sgpy2VegevnaErpVQJxCkrXkukj3gDO8WAt6KFLBpwz8Xwvkes+0WSzvF/yvxQOsLqbk12F3M0oDAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e6af70466bc2bfd93602ffd091de12c7e0169f49afb4f135a0eb2c7a3654749","last_reissued_at":"2026-07-09T01:20:23.840795Z","signature_status":"signed_v1","first_computed_at":"2026-07-09T01:20:23.840795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.07396","source_version":1,"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-07-09T01:20:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JiN3M+AIDA2+0hQkAEj1tfn1MUN5JqpQ0xVI0aOGjXw8MV3zZ78JeNZwJ8JUdIHb+gAsmZeDnraf9ghTGoOJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T19:46:27.892252Z"},"content_sha256":"9cfc5a9dcefc0cc93930daa8b6ca0909a0e46ff082ad910d63faa1d6f036a061","schema_version":"1.0","event_id":"sha256:9cfc5a9dcefc0cc93930daa8b6ca0909a0e46ff082ad910d63faa1d6f036a061"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LZVPOBDGXQV73E3AF76QSHPBFR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gap-Majority Lemmas in Communication Complexity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Huacheng Yu, Pachara Sawettamalya","submitted_at":"2026-07-08T13:32:29Z","abstract_excerpt":"We prove an information-theoretically optimal \\emph{gap-majority lemma} in the two-player randomized communication model. For a base function $f: \\mathcal{X} \\to \\{\\pm 1\\}$, its $n$-fold \\emph{gap-majority composition}, denoted $\\mathsf{GapMAJ} \\circ f^n$, takes $n$ inputs $(X_1, \\ldots, X_n)$ and distinguishes whether $f^{+n}(X_1,\\ldots,X_n) := f(X_1) + \\ldots + f(X_n)$ is at least $0.01\\sqrt{n}$ or at most $-0.01\\sqrt{n}$. We show that if computing $f$ with success probability $0.501$ requires $I$ bits of information, then computing $\\mathsf{GapMAJ} \\circ f^n$ with success probability $0.99$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07396","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.07396/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-09T01:20:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gj5nyiLk/yWAJDBIhff3oys1dBGnPJDohL3I3Ga6oxzOeEjOKA/EjpDFZI5vmNOBOCsebgaFVEAH0AnI4GoEAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T19:46:27.892753Z"},"content_sha256":"311684599153861aa6d28a069d0cd01e64aba28d0227debb009c6a8fd53a147f","schema_version":"1.0","event_id":"sha256:311684599153861aa6d28a069d0cd01e64aba28d0227debb009c6a8fd53a147f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LZVPOBDGXQV73E3AF76QSHPBFR/bundle.json","state_url":"https://pith.science/pith/LZVPOBDGXQV73E3AF76QSHPBFR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LZVPOBDGXQV73E3AF76QSHPBFR/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-08-05T19:46:27Z","links":{"resolver":"https://pith.science/pith/LZVPOBDGXQV73E3AF76QSHPBFR","bundle":"https://pith.science/pith/LZVPOBDGXQV73E3AF76QSHPBFR/bundle.json","state":"https://pith.science/pith/LZVPOBDGXQV73E3AF76QSHPBFR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LZVPOBDGXQV73E3AF76QSHPBFR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LZVPOBDGXQV73E3AF76QSHPBFR","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":"02a3c16cfeef7c55a77fe0e4311d20d50836200b8f621c17a05984e0f9807ed3","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-07-08T13:32:29Z","title_canon_sha256":"018d071987cc31b06b8198e99675c1b23907696809b5ae17cdf2a2ba7d047868"},"schema_version":"1.0","source":{"id":"2607.07396","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.07396","created_at":"2026-07-09T01:20:23Z"},{"alias_kind":"arxiv_version","alias_value":"2607.07396v1","created_at":"2026-07-09T01:20:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07396","created_at":"2026-07-09T01:20:23Z"},{"alias_kind":"pith_short_12","alias_value":"LZVPOBDGXQV7","created_at":"2026-07-09T01:20:23Z"},{"alias_kind":"pith_short_16","alias_value":"LZVPOBDGXQV73E3A","created_at":"2026-07-09T01:20:23Z"},{"alias_kind":"pith_short_8","alias_value":"LZVPOBDG","created_at":"2026-07-09T01:20:23Z"}],"graph_snapshots":[{"event_id":"sha256:311684599153861aa6d28a069d0cd01e64aba28d0227debb009c6a8fd53a147f","target":"graph","created_at":"2026-07-09T01:20:23Z","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/2607.07396/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove an information-theoretically optimal \\emph{gap-majority lemma} in the two-player randomized communication model. For a base function $f: \\mathcal{X} \\to \\{\\pm 1\\}$, its $n$-fold \\emph{gap-majority composition}, denoted $\\mathsf{GapMAJ} \\circ f^n$, takes $n$ inputs $(X_1, \\ldots, X_n)$ and distinguishes whether $f^{+n}(X_1,\\ldots,X_n) := f(X_1) + \\ldots + f(X_n)$ is at least $0.01\\sqrt{n}$ or at most $-0.01\\sqrt{n}$. We show that if computing $f$ with success probability $0.501$ requires $I$ bits of information, then computing $\\mathsf{GapMAJ} \\circ f^n$ with success probability $0.99$","authors_text":"Huacheng Yu, Pachara Sawettamalya","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07396","kind":"arxiv","version":1},"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:9cfc5a9dcefc0cc93930daa8b6ca0909a0e46ff082ad910d63faa1d6f036a061","target":"record","created_at":"2026-07-09T01:20:23Z","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":"02a3c16cfeef7c55a77fe0e4311d20d50836200b8f621c17a05984e0f9807ed3","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-07-08T13:32:29Z","title_canon_sha256":"018d071987cc31b06b8198e99675c1b23907696809b5ae17cdf2a2ba7d047868"},"schema_version":"1.0","source":{"id":"2607.07396","kind":"arxiv","version":1}},"canonical_sha256":"5e6af70466bc2bfd93602ffd091de12c7e0169f49afb4f135a0eb2c7a3654749","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e6af70466bc2bfd93602ffd091de12c7e0169f49afb4f135a0eb2c7a3654749","first_computed_at":"2026-07-09T01:20:23.840795Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-09T01:20:23.840795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O7DfyZC2sgpy2VegevnaErpVQJxCkrXkukj3gDO8WAt6KFLBpwz8Xwvkes+0WSzvF/yvxQOsLqbk12F3M0oDAQ==","signature_status":"signed_v1","signed_at":"2026-07-09T01:20:23.841244Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.07396","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9cfc5a9dcefc0cc93930daa8b6ca0909a0e46ff082ad910d63faa1d6f036a061","sha256:311684599153861aa6d28a069d0cd01e64aba28d0227debb009c6a8fd53a147f"],"state_sha256":"b092ca8f9ae62151a4db4cefcff2f57d3c1e1d357200d9ad75c9db9dca5ca3b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gyPwFiMgQHxwfddtn8Y7rKFxMNriXSYNEesORAsJtTYoDd/ZTtY5yMDCQv55y2i4fdWUilI6LuQIbCNOhBE/AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T19:46:27.896753Z","bundle_sha256":"6903ca25a6d4098a01aabf148bab86bd62482456ead850ec19a4f656f302edb9"}}