{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2GKGONWCTQ3HQJC7CCGGAH74MB","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":"a54e899c6d18557f2cd77cda5fcc83a8dc9e1ec02f6f1921ec7619ff506bf7c1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-01-11T12:22:54Z","title_canon_sha256":"0b22f3c3ddb660f7967315d92eebeb06321b3192c6a203073f91b9fe02ca04d7"},"schema_version":"1.0","source":{"id":"1301.2474","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2474","created_at":"2026-05-18T02:48:55Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2474v3","created_at":"2026-05-18T02:48:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2474","created_at":"2026-05-18T02:48:55Z"},{"alias_kind":"pith_short_12","alias_value":"2GKGONWCTQ3H","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"2GKGONWCTQ3HQJC7","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"2GKGONWC","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:46dee203f6a14ad8a4617ffdef80bf7bd864c6b69378a73694285ea1a2f7b13e","target":"graph","created_at":"2026-05-18T02:48:55Z","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":"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","authors_text":"Aur\\'elie Lagoutte, Nicolas Bousquet, St\\'ephan Thomass\\'e","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-01-11T12:22:54Z","title":"Clique versus Independent Set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2474","kind":"arxiv","version":3},"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:c67ef01b0102fa8cc5a55d61aea270125415c63206f82fd0d3687568b0735ba0","target":"record","created_at":"2026-05-18T02:48:55Z","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":"a54e899c6d18557f2cd77cda5fcc83a8dc9e1ec02f6f1921ec7619ff506bf7c1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-01-11T12:22:54Z","title_canon_sha256":"0b22f3c3ddb660f7967315d92eebeb06321b3192c6a203073f91b9fe02ca04d7"},"schema_version":"1.0","source":{"id":"1301.2474","kind":"arxiv","version":3}},"canonical_sha256":"d1946736c29c3678245f108c601ffc604753da4a92af8bd62ff4a2668929854f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1946736c29c3678245f108c601ffc604753da4a92af8bd62ff4a2668929854f","first_computed_at":"2026-05-18T02:48:55.037608Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:55.037608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6zvoq7XzW6tvkktL9HysKgR0+Ki5UjDd2Vp+b3wxfIFyHGRZdupY+c8lXqLEAWSmL4iqapuhl+32RbWZ7GkFBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:55.038098Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.2474","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c67ef01b0102fa8cc5a55d61aea270125415c63206f82fd0d3687568b0735ba0","sha256:46dee203f6a14ad8a4617ffdef80bf7bd864c6b69378a73694285ea1a2f7b13e"],"state_sha256":"65808058ce06f21dede2ade43a575e1f4991c8fe690afe44083a4d699d329fbb"}