{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:I6WD5G5G37QGACVAGDZZXACE3A","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":"757dc06db9535218e488339e070c91d89c72c09458774e7c0483b566257a902e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-02-27T21:14:14Z","title_canon_sha256":"9c06c6ea4afd81c4dcdec410a4441c6a63637f25653002f5c737fd7cf4a7b0ca"},"schema_version":"1.0","source":{"id":"1202.6071","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.6071","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"arxiv_version","alias_value":"1202.6071v3","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6071","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"pith_short_12","alias_value":"I6WD5G5G37QG","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"I6WD5G5G37QGACVA","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"I6WD5G5G","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:3a0da18f0ee5ba5eb51ee137cb2ec64ee2cc3cef4fd57a332f38e3c8020281a2","target":"graph","created_at":"2026-05-18T02:21:17Z","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":"Partitioning the vertices of a graph into two roughly equal parts while minimizing the number of edges crossing the cut is a fundamental problem (called Balanced Separator) that arises in many settings. For this problem, and variants such as the Uniform Sparsest Cut problem where the goal is to minimize the fraction of pairs on opposite sides of the cut that are connected by an edge, there are large gaps between the known approximation algorithms and non-approximability results. While no constant factor approximation algorithms are known, even APX-hardness is not known either.\n  In this work w","authors_text":"Ali Kemal Sinop, Venkatesan Guruswami, Yuan Zhou","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-02-27T21:14:14Z","title":"Constant Factor Lasserre Integrality Gaps for Graph Partitioning Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6071","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:7aa6a80288006de3cf047bd4a037125ad0965fcf85e325fff87df6bdc70b96bb","target":"record","created_at":"2026-05-18T02:21:17Z","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":"757dc06db9535218e488339e070c91d89c72c09458774e7c0483b566257a902e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-02-27T21:14:14Z","title_canon_sha256":"9c06c6ea4afd81c4dcdec410a4441c6a63637f25653002f5c737fd7cf4a7b0ca"},"schema_version":"1.0","source":{"id":"1202.6071","kind":"arxiv","version":3}},"canonical_sha256":"47ac3e9ba6dfe0600aa030f39b8044d80de1640dee043a6de33d7ad091a71a21","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47ac3e9ba6dfe0600aa030f39b8044d80de1640dee043a6de33d7ad091a71a21","first_computed_at":"2026-05-18T02:21:17.512839Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:17.512839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VSdHiR0sZgdOhHzhoUhMquGJcLHrV6Trpa1Ea31x9NPRjqJZxYVgcI6gy8x86xcYhN0jTnSzK/1AifNrdo72Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:17.513542Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.6071","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7aa6a80288006de3cf047bd4a037125ad0965fcf85e325fff87df6bdc70b96bb","sha256:3a0da18f0ee5ba5eb51ee137cb2ec64ee2cc3cef4fd57a332f38e3c8020281a2"],"state_sha256":"27ececa67b465c3c7784e3ab6656accf4618a8019d71c59877a34a289b1563db"}