{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:KGDTXKZ2KCL6FRJOSNYFFLU535","short_pith_number":"pith:KGDTXKZ2","schema_version":"1.0","canonical_sha256":"51873bab3a5097e2c52e937052ae9ddf6abc76420037c2a990f269b6e8d556af","source":{"kind":"arxiv","id":"2608.02533","version":1},"attestation_state":"computed","paper":{"title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","cs.LG"],"primary_cat":"cs.CC","authors_text":"Chirag Pabbaraju","submitted_at":"2026-08-03T17:26:54Z","abstract_excerpt":"We construct unambiguous DNFs having width $O(n)$ but $0$-certificate complexity $\\Omega(n^2)$. By utilizing the special structure of these DNFs, we prove a lifting theorem with a constant-sized gadget that lifts the DNF to a communication problem, while losslessly translating the separation in certificate complexity to a separation in communication complexity. This leads to an optimal refutation of the Alon-Saks-Seymour conjecture, as well as an optimal communication lower bound for the Clique versus Independent Set problem, improving the previous results of Balodis, Ben-David, G\\\"{o}\\\"{o}s, "},"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":"2608.02533","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-08-03T17:26:54Z","cross_cats_sorted":["cs.DM","cs.LG"],"title_canon_sha256":"524b8ab364fb9ac16b1cbab6d705f815cddbac6f4a3b8b03cbdffb5f025207ba","abstract_canon_sha256":"565e02e1fd87cee14866118395ca2d1655a867f86a1eaf62ad630c2aa1cb0eb8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T02:44:03.439487Z","signature_b64":"HcNAor/wcKvesoOHspC3EOeFYZJprFkoJdq/TKB9XUjcKUlEGv13SNcRKfg5TwXjUTjMySLMhKXoxhknT/x1Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51873bab3a5097e2c52e937052ae9ddf6abc76420037c2a990f269b6e8d556af","last_reissued_at":"2026-08-04T02:44:03.437218Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T02:44:03.437218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","cs.LG"],"primary_cat":"cs.CC","authors_text":"Chirag Pabbaraju","submitted_at":"2026-08-03T17:26:54Z","abstract_excerpt":"We construct unambiguous DNFs having width $O(n)$ but $0$-certificate complexity $\\Omega(n^2)$. By utilizing the special structure of these DNFs, we prove a lifting theorem with a constant-sized gadget that lifts the DNF to a communication problem, while losslessly translating the separation in certificate complexity to a separation in communication complexity. This leads to an optimal refutation of the Alon-Saks-Seymour conjecture, as well as an optimal communication lower bound for the Clique versus Independent Set problem, improving the previous results of Balodis, Ben-David, G\\\"{o}\\\"{o}s, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.02533","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/2608.02533/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":"2608.02533","created_at":"2026-08-04T02:44:03.439511+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.02533v1","created_at":"2026-08-04T02:44:03.439511+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.02533","created_at":"2026-08-04T02:44:03.439511+00:00"},{"alias_kind":"pith_short_12","alias_value":"KGDTXKZ2KCL6","created_at":"2026-08-04T02:44:03.439511+00:00"},{"alias_kind":"pith_short_16","alias_value":"KGDTXKZ2KCL6FRJO","created_at":"2026-08-04T02:44:03.439511+00:00"},{"alias_kind":"pith_short_8","alias_value":"KGDTXKZ2","created_at":"2026-08-04T02:44:03.439511+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/KGDTXKZ2KCL6FRJOSNYFFLU535","json":"https://pith.science/pith/KGDTXKZ2KCL6FRJOSNYFFLU535.json","graph_json":"https://pith.science/api/pith-number/KGDTXKZ2KCL6FRJOSNYFFLU535/graph.json","events_json":"https://pith.science/api/pith-number/KGDTXKZ2KCL6FRJOSNYFFLU535/events.json","paper":"https://pith.science/paper/KGDTXKZ2"},"agent_actions":{"view_html":"https://pith.science/pith/KGDTXKZ2KCL6FRJOSNYFFLU535","download_json":"https://pith.science/pith/KGDTXKZ2KCL6FRJOSNYFFLU535.json","view_paper":"https://pith.science/paper/KGDTXKZ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.02533&json=true","fetch_graph":"https://pith.science/api/pith-number/KGDTXKZ2KCL6FRJOSNYFFLU535/graph.json","fetch_events":"https://pith.science/api/pith-number/KGDTXKZ2KCL6FRJOSNYFFLU535/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KGDTXKZ2KCL6FRJOSNYFFLU535/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KGDTXKZ2KCL6FRJOSNYFFLU535/action/storage_attestation","attest_author":"https://pith.science/pith/KGDTXKZ2KCL6FRJOSNYFFLU535/action/author_attestation","sign_citation":"https://pith.science/pith/KGDTXKZ2KCL6FRJOSNYFFLU535/action/citation_signature","submit_replication":"https://pith.science/pith/KGDTXKZ2KCL6FRJOSNYFFLU535/action/replication_record"}},"created_at":"2026-08-04T02:44:03.439511+00:00","updated_at":"2026-08-04T02:44:03.439511+00:00"}