{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:AJ6SMGUXSLRR7GEXFYLMJGTWBF","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":"b5827ce260ae57fba33b0a6e481c165bc0259de96b0fd6d4aceb4a649cad28d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-21T04:04:01Z","title_canon_sha256":"a307b6fa3535c63308d818dc623307f7095646958ac9db72dbcab571d3c1288c"},"schema_version":"1.0","source":{"id":"1401.5170","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5170","created_at":"2026-05-18T02:34:45Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5170v2","created_at":"2026-05-18T02:34:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5170","created_at":"2026-05-18T02:34:45Z"},{"alias_kind":"pith_short_12","alias_value":"AJ6SMGUXSLRR","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AJ6SMGUXSLRR7GEX","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AJ6SMGUX","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:2519f18f2ec1287e3921c784f3fb2b1469e234d42965050f3fd4dd3c4dcd418f","target":"graph","created_at":"2026-05-18T02:34:45Z","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 consider the problem of partitioning the node set of a graph into $k$ sets of given sizes in order to \\emph{minimize the cut} obtained using (removing) the $k$-th set. If the resulting cut has value $0$, then we have obtained a vertex separator. This problem is closely related to the graph partitioning problem. In fact, the model we use is the same as that for the graph partitioning problem except for a different \\emph{quadratic} objective function. We look at known and new bounds obtained from various relaxations for this NP-hard problem. This includes: the standard eigenvalue bound, proje","authors_text":"Hao Sun, Henry Wolkowicz, Ningchuan Wang, Ting Kei Pong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-21T04:04:01Z","title":"Eigenvalue, Quadratic Programming, and Semidefinite Programming Bounds for a Cut Minimization Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5170","kind":"arxiv","version":2},"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:4ef0d20a3665e5f9885dedcd4aac950ff5531c858b7e46a4694596dbe54538bf","target":"record","created_at":"2026-05-18T02:34:45Z","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":"b5827ce260ae57fba33b0a6e481c165bc0259de96b0fd6d4aceb4a649cad28d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-21T04:04:01Z","title_canon_sha256":"a307b6fa3535c63308d818dc623307f7095646958ac9db72dbcab571d3c1288c"},"schema_version":"1.0","source":{"id":"1401.5170","kind":"arxiv","version":2}},"canonical_sha256":"027d261a9792e31f98972e16c49a76097be1f18648b7caf47fe91ee2223d33d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"027d261a9792e31f98972e16c49a76097be1f18648b7caf47fe91ee2223d33d9","first_computed_at":"2026-05-18T02:34:45.010790Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:34:45.010790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2GqsgOeU0R4TNKOWz+uIYLdGrsKnBkKWdFRtmwWqE3ciQTBU1eIA4pRwcZs8pjeUDHHfEAVJHA/ppNThTZDrCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:34:45.011155Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.5170","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ef0d20a3665e5f9885dedcd4aac950ff5531c858b7e46a4694596dbe54538bf","sha256:2519f18f2ec1287e3921c784f3fb2b1469e234d42965050f3fd4dd3c4dcd418f"],"state_sha256":"eb69d95dcd6c07adf25268edc3eba324dcf4ad2052073508d1337dc998680d8a"}