{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:AOQ72VOKBDUDZHYXVYS75QOCHW","short_pith_number":"pith:AOQ72VOK","canonical_record":{"source":{"id":"1111.5884","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-11-25T02:55:00Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"41cd510c2b07a5b2f7c1eba3a3fcc72d392359923fe69d6dc6ee60541e960ab8","abstract_canon_sha256":"c14823bab08bfa9b9d1c3a8895891eabd0f2efcb3128e74c399d42d09863bee1"},"schema_version":"1.0"},"canonical_sha256":"03a1fd55ca08e83c9f17ae25fec1c23db0bac33258ff53f620206eb3c9f408c7","source":{"kind":"arxiv","id":"1111.5884","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.5884","created_at":"2026-05-18T04:07:42Z"},{"alias_kind":"arxiv_version","alias_value":"1111.5884v1","created_at":"2026-05-18T04:07:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5884","created_at":"2026-05-18T04:07:42Z"},{"alias_kind":"pith_short_12","alias_value":"AOQ72VOKBDUD","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AOQ72VOKBDUDZHYX","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AOQ72VOK","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:AOQ72VOKBDUDZHYXVYS75QOCHW","target":"record","payload":{"canonical_record":{"source":{"id":"1111.5884","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-11-25T02:55:00Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"41cd510c2b07a5b2f7c1eba3a3fcc72d392359923fe69d6dc6ee60541e960ab8","abstract_canon_sha256":"c14823bab08bfa9b9d1c3a8895891eabd0f2efcb3128e74c399d42d09863bee1"},"schema_version":"1.0"},"canonical_sha256":"03a1fd55ca08e83c9f17ae25fec1c23db0bac33258ff53f620206eb3c9f408c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:42.040168Z","signature_b64":"URNZ4LNDJhPPeh/O+JeanD0Cna8XpBMXVWlFwy/swFbMuK5xzUedGFa3U5kQgE+pgyhYNyuvdSQIlT2USHiHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03a1fd55ca08e83c9f17ae25fec1c23db0bac33258ff53f620206eb3c9f408c7","last_reissued_at":"2026-05-18T04:07:42.039666Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:42.039666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.5884","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-05-18T04:07:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eP9Zawx1tHY8RCzDVTDHoxqrh86WY3TbZg271DWyc41xXUK/EMnNYUMi9THVmh5axb3nRnLd/pK87DASznVaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:40:52.712805Z"},"content_sha256":"5d96e75ba3fce28459aabb71f5516f786a59f87a05bd9c6e6e82d7f862c9988a","schema_version":"1.0","event_id":"sha256:5d96e75ba3fce28459aabb71f5516f786a59f87a05bd9c6e6e82d7f862c9988a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:AOQ72VOKBDUDZHYXVYS75QOCHW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An additive combinatorics approach to the log-rank conjecture in communication complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Eli Ben-Sasson, Noga Zewi, Shachar Lovett","submitted_at":"2011-11-25T02:55:00Z","abstract_excerpt":"For a $\\{0,1\\}$-valued matrix $M$ let $\\rm{CC}(M)$ denote the deterministic communication complexity of the boolean function associated with $M$. The log-rank conjecture of Lov\\'{a}sz and Saks [FOCS 1988] states that $\\rm{CC}(M) \\leq \\log^c(\\rm{rank}(M))$ for some absolute constant $c$ where $\\rm{rank}(M)$ denotes the rank of $M$ over the field of real numbers. We show that $\\rm{CC}(M)\\leq c \\cdot \\rm{rank}(M)/\\log \\rm{rank}(M)$ for some absolute constant $c$, assuming a well-known conjecture from additive combinatorics known as the Polynomial Freiman-Ruzsa (PFR) conjecture.\n  Our proof is bas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5884","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":""},"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:07:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a/GobL27Jz9QvawdYcWjgvjDvWuG1lKjej69ikjnKyDURnV7C+9XIUeO4zTga67jOqJDku4PccFM8pBCYEYrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:40:52.713163Z"},"content_sha256":"41d87cd0a9369d4d45b3f848fa312cb7675893db4bc95200e0b5cfc817711ae6","schema_version":"1.0","event_id":"sha256:41d87cd0a9369d4d45b3f848fa312cb7675893db4bc95200e0b5cfc817711ae6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AOQ72VOKBDUDZHYXVYS75QOCHW/bundle.json","state_url":"https://pith.science/pith/AOQ72VOKBDUDZHYXVYS75QOCHW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AOQ72VOKBDUDZHYXVYS75QOCHW/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-06-10T22:40:52Z","links":{"resolver":"https://pith.science/pith/AOQ72VOKBDUDZHYXVYS75QOCHW","bundle":"https://pith.science/pith/AOQ72VOKBDUDZHYXVYS75QOCHW/bundle.json","state":"https://pith.science/pith/AOQ72VOKBDUDZHYXVYS75QOCHW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AOQ72VOKBDUDZHYXVYS75QOCHW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:AOQ72VOKBDUDZHYXVYS75QOCHW","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":"c14823bab08bfa9b9d1c3a8895891eabd0f2efcb3128e74c399d42d09863bee1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-11-25T02:55:00Z","title_canon_sha256":"41cd510c2b07a5b2f7c1eba3a3fcc72d392359923fe69d6dc6ee60541e960ab8"},"schema_version":"1.0","source":{"id":"1111.5884","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.5884","created_at":"2026-05-18T04:07:42Z"},{"alias_kind":"arxiv_version","alias_value":"1111.5884v1","created_at":"2026-05-18T04:07:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5884","created_at":"2026-05-18T04:07:42Z"},{"alias_kind":"pith_short_12","alias_value":"AOQ72VOKBDUD","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AOQ72VOKBDUDZHYX","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AOQ72VOK","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:41d87cd0a9369d4d45b3f848fa312cb7675893db4bc95200e0b5cfc817711ae6","target":"graph","created_at":"2026-05-18T04:07:42Z","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":"For a $\\{0,1\\}$-valued matrix $M$ let $\\rm{CC}(M)$ denote the deterministic communication complexity of the boolean function associated with $M$. The log-rank conjecture of Lov\\'{a}sz and Saks [FOCS 1988] states that $\\rm{CC}(M) \\leq \\log^c(\\rm{rank}(M))$ for some absolute constant $c$ where $\\rm{rank}(M)$ denotes the rank of $M$ over the field of real numbers. We show that $\\rm{CC}(M)\\leq c \\cdot \\rm{rank}(M)/\\log \\rm{rank}(M)$ for some absolute constant $c$, assuming a well-known conjecture from additive combinatorics known as the Polynomial Freiman-Ruzsa (PFR) conjecture.\n  Our proof is bas","authors_text":"Eli Ben-Sasson, Noga Zewi, Shachar Lovett","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-11-25T02:55:00Z","title":"An additive combinatorics approach to the log-rank conjecture in communication complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5884","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:5d96e75ba3fce28459aabb71f5516f786a59f87a05bd9c6e6e82d7f862c9988a","target":"record","created_at":"2026-05-18T04:07:42Z","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":"c14823bab08bfa9b9d1c3a8895891eabd0f2efcb3128e74c399d42d09863bee1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-11-25T02:55:00Z","title_canon_sha256":"41cd510c2b07a5b2f7c1eba3a3fcc72d392359923fe69d6dc6ee60541e960ab8"},"schema_version":"1.0","source":{"id":"1111.5884","kind":"arxiv","version":1}},"canonical_sha256":"03a1fd55ca08e83c9f17ae25fec1c23db0bac33258ff53f620206eb3c9f408c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03a1fd55ca08e83c9f17ae25fec1c23db0bac33258ff53f620206eb3c9f408c7","first_computed_at":"2026-05-18T04:07:42.039666Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:07:42.039666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"URNZ4LNDJhPPeh/O+JeanD0Cna8XpBMXVWlFwy/swFbMuK5xzUedGFa3U5kQgE+pgyhYNyuvdSQIlT2USHiHCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:07:42.040168Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.5884","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d96e75ba3fce28459aabb71f5516f786a59f87a05bd9c6e6e82d7f862c9988a","sha256:41d87cd0a9369d4d45b3f848fa312cb7675893db4bc95200e0b5cfc817711ae6"],"state_sha256":"662bc7245a36b998f640c0c6db909aaccab21317d09b2eeb62a31db6aa63dc60"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RRZA9m020uYvKSEwP1BjQ9eOm0Mb9LGn93EngsQVczkv+r6qgZG9jFkSdz4/MJmHeJdQHTFZytbOUnirSXjpCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T22:40:52.715241Z","bundle_sha256":"5ca3363bf346b8e6183a7c38c406f201bf5d9b243e406c6cc887a3bd77706bdb"}}