{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:AJ6SMGUXSLRR7GEXFYLMJGTWBF","short_pith_number":"pith:AJ6SMGUX","canonical_record":{"source":{"id":"1401.5170","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-21T04:04:01Z","cross_cats_sorted":[],"title_canon_sha256":"a307b6fa3535c63308d818dc623307f7095646958ac9db72dbcab571d3c1288c","abstract_canon_sha256":"b5827ce260ae57fba33b0a6e481c165bc0259de96b0fd6d4aceb4a649cad28d5"},"schema_version":"1.0"},"canonical_sha256":"027d261a9792e31f98972e16c49a76097be1f18648b7caf47fe91ee2223d33d9","source":{"kind":"arxiv","id":"1401.5170","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:AJ6SMGUXSLRR7GEXFYLMJGTWBF","target":"record","payload":{"canonical_record":{"source":{"id":"1401.5170","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-21T04:04:01Z","cross_cats_sorted":[],"title_canon_sha256":"a307b6fa3535c63308d818dc623307f7095646958ac9db72dbcab571d3c1288c","abstract_canon_sha256":"b5827ce260ae57fba33b0a6e481c165bc0259de96b0fd6d4aceb4a649cad28d5"},"schema_version":"1.0"},"canonical_sha256":"027d261a9792e31f98972e16c49a76097be1f18648b7caf47fe91ee2223d33d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:34:45.011155Z","signature_b64":"2GqsgOeU0R4TNKOWz+uIYLdGrsKnBkKWdFRtmwWqE3ciQTBU1eIA4pRwcZs8pjeUDHHfEAVJHA/ppNThTZDrCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"027d261a9792e31f98972e16c49a76097be1f18648b7caf47fe91ee2223d33d9","last_reissued_at":"2026-05-18T02:34:45.010790Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:34:45.010790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.5170","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:34:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sZ41XIpxVyWIokpY1L1k0F8Y93eRvBfhjVdfBLUscQgMWNVAroVvtBXgBXas9cALSAvsGjjpXDs6PdoWy9LFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:44:36.122514Z"},"content_sha256":"4ef0d20a3665e5f9885dedcd4aac950ff5531c858b7e46a4694596dbe54538bf","schema_version":"1.0","event_id":"sha256:4ef0d20a3665e5f9885dedcd4aac950ff5531c858b7e46a4694596dbe54538bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:AJ6SMGUXSLRR7GEXFYLMJGTWBF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Eigenvalue, Quadratic Programming, and Semidefinite Programming Bounds for a Cut Minimization Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hao Sun, Henry Wolkowicz, Ningchuan Wang, Ting Kei Pong","submitted_at":"2014-01-21T04:04:01Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5170","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:34:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Soucbimo0pvH5ulkJfROx68+Hymz02TDm2Mc98w5tmNnpWbvzpoxq+oYGPxEnBwyVRPIMKiKd84dbF6OVG5IDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:44:36.123154Z"},"content_sha256":"2519f18f2ec1287e3921c784f3fb2b1469e234d42965050f3fd4dd3c4dcd418f","schema_version":"1.0","event_id":"sha256:2519f18f2ec1287e3921c784f3fb2b1469e234d42965050f3fd4dd3c4dcd418f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AJ6SMGUXSLRR7GEXFYLMJGTWBF/bundle.json","state_url":"https://pith.science/pith/AJ6SMGUXSLRR7GEXFYLMJGTWBF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AJ6SMGUXSLRR7GEXFYLMJGTWBF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T09:44:36Z","links":{"resolver":"https://pith.science/pith/AJ6SMGUXSLRR7GEXFYLMJGTWBF","bundle":"https://pith.science/pith/AJ6SMGUXSLRR7GEXFYLMJGTWBF/bundle.json","state":"https://pith.science/pith/AJ6SMGUXSLRR7GEXFYLMJGTWBF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AJ6SMGUXSLRR7GEXFYLMJGTWBF/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SoCEMotU36uN4IJhZ3jZylnul654k77nyIEQyuKsH5LXtAcSn5vZoa0Tl9QQ/9sIa0VJxqoNO/4z6Imro3B8AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:44:36.126951Z","bundle_sha256":"39fc6d2ecd938fd3f8430d571ec4ba8d49502f6a1b39f51889fc124dd4c29d22"}}