{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2GKGONWCTQ3HQJC7CCGGAH74MB","short_pith_number":"pith:2GKGONWC","schema_version":"1.0","canonical_sha256":"d1946736c29c3678245f108c601ffc604753da4a92af8bd62ff4a2668929854f","source":{"kind":"arxiv","id":"1301.2474","version":3},"attestation_state":"computed","paper":{"title":"Clique versus Independent Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Aur\\'elie Lagoutte, Nicolas Bousquet, St\\'ephan Thomass\\'e","submitted_at":"2013-01-11T12:22:54Z","abstract_excerpt":"Yannakakis' Clique versus Independent Set problem (CL-IS) in communication complexity asks for the minimum number of cuts separating cliques from stable sets in a graph, called CS-separator. Yannakakis provides a quasi-polynomial CS-separator, i.e. of size $O(n^{\\log n})$, and addresses the problem of finding a polynomial CS-separator. This question is still open even for perfect graphs. We show that a polynomial CS-separator almost surely exists for random graphs. Besides, if H is a split graph (i.e. has a vertex-partition into a clique and a stable set) then there exists a constant $c_H$ for"},"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":"1301.2474","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-01-11T12:22:54Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0b22f3c3ddb660f7967315d92eebeb06321b3192c6a203073f91b9fe02ca04d7","abstract_canon_sha256":"a54e899c6d18557f2cd77cda5fcc83a8dc9e1ec02f6f1921ec7619ff506bf7c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:55.038098Z","signature_b64":"6zvoq7XzW6tvkktL9HysKgR0+Ki5UjDd2Vp+b3wxfIFyHGRZdupY+c8lXqLEAWSmL4iqapuhl+32RbWZ7GkFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1946736c29c3678245f108c601ffc604753da4a92af8bd62ff4a2668929854f","last_reissued_at":"2026-05-18T02:48:55.037608Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:55.037608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clique versus Independent Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Aur\\'elie Lagoutte, Nicolas Bousquet, St\\'ephan Thomass\\'e","submitted_at":"2013-01-11T12:22:54Z","abstract_excerpt":"Yannakakis' Clique versus Independent Set problem (CL-IS) in communication complexity asks for the minimum number of cuts separating cliques from stable sets in a graph, called CS-separator. Yannakakis provides a quasi-polynomial CS-separator, i.e. of size $O(n^{\\log n})$, and addresses the problem of finding a polynomial CS-separator. This question is still open even for perfect graphs. We show that a polynomial CS-separator almost surely exists for random graphs. Besides, if H is a split graph (i.e. has a vertex-partition into a clique and a stable set) then there exists a constant $c_H$ for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2474","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1301.2474","created_at":"2026-05-18T02:48:55.037677+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.2474v3","created_at":"2026-05-18T02:48:55.037677+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2474","created_at":"2026-05-18T02:48:55.037677+00:00"},{"alias_kind":"pith_short_12","alias_value":"2GKGONWCTQ3H","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"2GKGONWCTQ3HQJC7","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"2GKGONWC","created_at":"2026-05-18T12:27:30.460161+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/2GKGONWCTQ3HQJC7CCGGAH74MB","json":"https://pith.science/pith/2GKGONWCTQ3HQJC7CCGGAH74MB.json","graph_json":"https://pith.science/api/pith-number/2GKGONWCTQ3HQJC7CCGGAH74MB/graph.json","events_json":"https://pith.science/api/pith-number/2GKGONWCTQ3HQJC7CCGGAH74MB/events.json","paper":"https://pith.science/paper/2GKGONWC"},"agent_actions":{"view_html":"https://pith.science/pith/2GKGONWCTQ3HQJC7CCGGAH74MB","download_json":"https://pith.science/pith/2GKGONWCTQ3HQJC7CCGGAH74MB.json","view_paper":"https://pith.science/paper/2GKGONWC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.2474&json=true","fetch_graph":"https://pith.science/api/pith-number/2GKGONWCTQ3HQJC7CCGGAH74MB/graph.json","fetch_events":"https://pith.science/api/pith-number/2GKGONWCTQ3HQJC7CCGGAH74MB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2GKGONWCTQ3HQJC7CCGGAH74MB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2GKGONWCTQ3HQJC7CCGGAH74MB/action/storage_attestation","attest_author":"https://pith.science/pith/2GKGONWCTQ3HQJC7CCGGAH74MB/action/author_attestation","sign_citation":"https://pith.science/pith/2GKGONWCTQ3HQJC7CCGGAH74MB/action/citation_signature","submit_replication":"https://pith.science/pith/2GKGONWCTQ3HQJC7CCGGAH74MB/action/replication_record"}},"created_at":"2026-05-18T02:48:55.037677+00:00","updated_at":"2026-05-18T02:48:55.037677+00:00"}