{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:XEIRDOWZM2JOAMWXCXG2HBH263","short_pith_number":"pith:XEIRDOWZ","schema_version":"1.0","canonical_sha256":"b91111bad96692e032d715cda384faf6f006b3892052223674b40cf4f33c6d0a","source":{"kind":"arxiv","id":"2010.08994","version":2},"attestation_state":"computed","paper":{"title":"Log-rank and lifting for AND-functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Alexander Knop, Sam McGuire, Shachar Lovett, Weiqiang Yuan","submitted_at":"2020-10-18T14:22:05Z","abstract_excerpt":"Let $f: \\{0,1\\}^n \\to \\{0, 1\\}$ be a boolean function, and let $f_\\land (x, y) = f(x \\land y)$ denote the AND-function of $f$, where $x \\land y$ denotes bit-wise AND. We study the deterministic communication complexity of $f_\\land$ and show that, up to a $\\log n$ factor, it is bounded by a polynomial in the logarithm of the real rank of the communication matrix of $f_\\land$. This comes within a $\\log n$ factor of establishing the log-rank conjecturefor AND-functions with no assumptions on $f$. Our result stands in contrast with previous results on special cases of the log-rank conjecture, whic"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2010.08994","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-10-18T14:22:05Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"324a2fcbc637bdd8ef7310059ad895a33689c5eb4b0cd79aa0dc93cd90a3e00a","abstract_canon_sha256":"5bd50434ff6395a7cf0c6366d1744c4fd19ccce06d152cf5cb6b52a24387618f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:45:20.548802Z","signature_b64":"R7/kjUZhZdgH9WgFhPvpZNu7sOxLpDOsJ51XQq68olrlj0Iy0K6t2uRjpqKGdxR9K2fPoEt5APv+PBO4xcsOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b91111bad96692e032d715cda384faf6f006b3892052223674b40cf4f33c6d0a","last_reissued_at":"2026-07-05T01:45:20.548396Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:45:20.548396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Log-rank and lifting for AND-functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Alexander Knop, Sam McGuire, Shachar Lovett, Weiqiang Yuan","submitted_at":"2020-10-18T14:22:05Z","abstract_excerpt":"Let $f: \\{0,1\\}^n \\to \\{0, 1\\}$ be a boolean function, and let $f_\\land (x, y) = f(x \\land y)$ denote the AND-function of $f$, where $x \\land y$ denotes bit-wise AND. We study the deterministic communication complexity of $f_\\land$ and show that, up to a $\\log n$ factor, it is bounded by a polynomial in the logarithm of the real rank of the communication matrix of $f_\\land$. This comes within a $\\log n$ factor of establishing the log-rank conjecturefor AND-functions with no assumptions on $f$. Our result stands in contrast with previous results on special cases of the log-rank conjecture, whic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.08994","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.08994/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2010.08994","created_at":"2026-07-05T01:45:20.548452+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.08994v2","created_at":"2026-07-05T01:45:20.548452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.08994","created_at":"2026-07-05T01:45:20.548452+00:00"},{"alias_kind":"pith_short_12","alias_value":"XEIRDOWZM2JO","created_at":"2026-07-05T01:45:20.548452+00:00"},{"alias_kind":"pith_short_16","alias_value":"XEIRDOWZM2JOAMWX","created_at":"2026-07-05T01:45:20.548452+00:00"},{"alias_kind":"pith_short_8","alias_value":"XEIRDOWZ","created_at":"2026-07-05T01:45:20.548452+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XEIRDOWZM2JOAMWXCXG2HBH263","json":"https://pith.science/pith/XEIRDOWZM2JOAMWXCXG2HBH263.json","graph_json":"https://pith.science/api/pith-number/XEIRDOWZM2JOAMWXCXG2HBH263/graph.json","events_json":"https://pith.science/api/pith-number/XEIRDOWZM2JOAMWXCXG2HBH263/events.json","paper":"https://pith.science/paper/XEIRDOWZ"},"agent_actions":{"view_html":"https://pith.science/pith/XEIRDOWZM2JOAMWXCXG2HBH263","download_json":"https://pith.science/pith/XEIRDOWZM2JOAMWXCXG2HBH263.json","view_paper":"https://pith.science/paper/XEIRDOWZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.08994&json=true","fetch_graph":"https://pith.science/api/pith-number/XEIRDOWZM2JOAMWXCXG2HBH263/graph.json","fetch_events":"https://pith.science/api/pith-number/XEIRDOWZM2JOAMWXCXG2HBH263/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XEIRDOWZM2JOAMWXCXG2HBH263/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XEIRDOWZM2JOAMWXCXG2HBH263/action/storage_attestation","attest_author":"https://pith.science/pith/XEIRDOWZM2JOAMWXCXG2HBH263/action/author_attestation","sign_citation":"https://pith.science/pith/XEIRDOWZM2JOAMWXCXG2HBH263/action/citation_signature","submit_replication":"https://pith.science/pith/XEIRDOWZM2JOAMWXCXG2HBH263/action/replication_record"}},"created_at":"2026-07-05T01:45:20.548452+00:00","updated_at":"2026-07-05T01:45:20.548452+00:00"}