{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4DMU4CWG25TGRVFJFUPVVNH2KV","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":"c6a9c01aa11248e945c02f85be9f5f1d3a62b04aa8876a3e54cfd6cfb0523210","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-11T02:58:22Z","title_canon_sha256":"6bd756502df000e13fdd69342def3cc2ab1800420f596c234eff37837f701f5c"},"schema_version":"1.0","source":{"id":"1312.3024","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3024","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3024v1","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3024","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"pith_short_12","alias_value":"4DMU4CWG25TG","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"4DMU4CWG25TGRVFJ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"4DMU4CWG","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:e33d9654ada8f0b874b6b12695fce3762c09a22017aecd898895c0da832d6277","target":"graph","created_at":"2026-05-18T03:05:00Z","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":"We present an approximation scheme for minimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. This framework includes well known graph problems such as Minimum graph bisection, Edge expansion, Sparsest Cut, and Small Set expansion, as well as the Unique Games problem. These problems are notorious for the existence of huge gaps between the known algorithmic results and NP-hardness results. Our algorithm is based on rounding semidefinite programs from the Lasserre hierarchy, and the analysis uses bounds for low-rank","authors_text":"Ali Kemal Sinop, Venkatesan Guruswami","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-11T02:58:22Z","title":"Rounding Lasserre SDPs using column selection and spectrum-based approximation schemes for graph partitioning and Quadratic IPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3024","kind":"arxiv","version":1},"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:fdf47c270c40a743248dc29c03924abd4ac766e7192374d125464d4c2b006f31","target":"record","created_at":"2026-05-18T03:05:00Z","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":"c6a9c01aa11248e945c02f85be9f5f1d3a62b04aa8876a3e54cfd6cfb0523210","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-11T02:58:22Z","title_canon_sha256":"6bd756502df000e13fdd69342def3cc2ab1800420f596c234eff37837f701f5c"},"schema_version":"1.0","source":{"id":"1312.3024","kind":"arxiv","version":1}},"canonical_sha256":"e0d94e0ac6d76668d4a92d1f5ab4fa55407ec2a9cf5cc9a162d9955f9b97072e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0d94e0ac6d76668d4a92d1f5ab4fa55407ec2a9cf5cc9a162d9955f9b97072e","first_computed_at":"2026-05-18T03:05:00.748801Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:00.748801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WrFIwknciHU47gcs/oaiw7EMiReUKRi/GIfHd5iHI4Jdr49KHT9c5rPMIEyREMUQN0QoK/E4T+DeHbXxg0j3Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:00.749235Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.3024","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fdf47c270c40a743248dc29c03924abd4ac766e7192374d125464d4c2b006f31","sha256:e33d9654ada8f0b874b6b12695fce3762c09a22017aecd898895c0da832d6277"],"state_sha256":"5e7904480e7b71305c82f1cefed2c201d1cdb3c52336bfa32739e53f507ce86f"}