{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:I6NQ754KT3B7XN6NK7IRRKBZIL","short_pith_number":"pith:I6NQ754K","canonical_record":{"source":{"id":"1410.4885","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-17T23:07:50Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"ae5ca38b629230744576407aa1eb3a2d95111619f84bf307c6a4055743936a94","abstract_canon_sha256":"1cef9195424e79abd60fec395e1fec185b844aa307bcc50de4893d4c9ec949bb"},"schema_version":"1.0"},"canonical_sha256":"479b0ff78a9ec3fbb7cd57d118a83942fbf973d88e150ede7f0b60577187869d","source":{"kind":"arxiv","id":"1410.4885","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4885","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4885v2","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4885","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"pith_short_12","alias_value":"I6NQ754KT3B7","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I6NQ754KT3B7XN6N","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I6NQ754K","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:I6NQ754KT3B7XN6NK7IRRKBZIL","target":"record","payload":{"canonical_record":{"source":{"id":"1410.4885","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-17T23:07:50Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"ae5ca38b629230744576407aa1eb3a2d95111619f84bf307c6a4055743936a94","abstract_canon_sha256":"1cef9195424e79abd60fec395e1fec185b844aa307bcc50de4893d4c9ec949bb"},"schema_version":"1.0"},"canonical_sha256":"479b0ff78a9ec3fbb7cd57d118a83942fbf973d88e150ede7f0b60577187869d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:00.376973Z","signature_b64":"mDDcESZoC8pEb8shRfF3iMoPdtsh1u9I9ezAM91Qsj2Pzt7J5uiQLU75QWQ8PplG5t3TJxlr+L50i4oCTaXsBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"479b0ff78a9ec3fbb7cd57d118a83942fbf973d88e150ede7f0b60577187869d","last_reissued_at":"2026-05-18T01:11:00.376399Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:00.376399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.4885","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-18T01:11:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r+pL/2J8sBaEnJPcJIvUUwkMQCQ5eBeL4anviHnzWIjgtkvHedaQW3v1gBaajag/EADl15Ef/4e1AfKFhKO9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:43:20.185662Z"},"content_sha256":"bbbfa9e55d197660f6025c257e997a53825d0b4d5c507319e52085e65738ac0a","schema_version":"1.0","event_id":"sha256:bbbfa9e55d197660f6025c257e997a53825d0b4d5c507319e52085e65738ac0a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:I6NQ754KT3B7XN6NK7IRRKBZIL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Multilevel Bilinear Programming Algorithm For the Vertex Separator Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Ilya Safro, James T. Hungerford, William W. Hager","submitted_at":"2014-10-17T23:07:50Z","abstract_excerpt":"The Vertex Separator Problem for a graph is to find the smallest collection of vertices whose removal breaks the graph into two disconnected subsets that satisfy specified size constraints. In the paper 10.1016/j.ejor.2014.05.042, the Vertex Separator Problem was formulated as a continuous (non-concave/non-convex) bilinear quadratic program. In this paper, we develop a more general continuous bilinear program which incorporates vertex weights, and which applies to the coarse graphs that are generated in a multilevel compression of the original Vertex Separator Problem. A Mountain Climbing Algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4885","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-18T01:11:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dWfLCpBz5gjGhPsD+oY9RjRtDhSCq57N5+NgKghaQTtdbAoBkgKHCbOB0bCckQGEeFm1dSaJvkIZKeoD7EvNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:43:20.186302Z"},"content_sha256":"adc746ddba9f37e5075ff37b5d211ff31b82a9b536de51b03e30ccef8e78a926","schema_version":"1.0","event_id":"sha256:adc746ddba9f37e5075ff37b5d211ff31b82a9b536de51b03e30ccef8e78a926"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I6NQ754KT3B7XN6NK7IRRKBZIL/bundle.json","state_url":"https://pith.science/pith/I6NQ754KT3B7XN6NK7IRRKBZIL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I6NQ754KT3B7XN6NK7IRRKBZIL/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-30T08:43:20Z","links":{"resolver":"https://pith.science/pith/I6NQ754KT3B7XN6NK7IRRKBZIL","bundle":"https://pith.science/pith/I6NQ754KT3B7XN6NK7IRRKBZIL/bundle.json","state":"https://pith.science/pith/I6NQ754KT3B7XN6NK7IRRKBZIL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I6NQ754KT3B7XN6NK7IRRKBZIL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:I6NQ754KT3B7XN6NK7IRRKBZIL","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":"1cef9195424e79abd60fec395e1fec185b844aa307bcc50de4893d4c9ec949bb","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-17T23:07:50Z","title_canon_sha256":"ae5ca38b629230744576407aa1eb3a2d95111619f84bf307c6a4055743936a94"},"schema_version":"1.0","source":{"id":"1410.4885","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4885","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4885v2","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4885","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"pith_short_12","alias_value":"I6NQ754KT3B7","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I6NQ754KT3B7XN6N","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I6NQ754K","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:adc746ddba9f37e5075ff37b5d211ff31b82a9b536de51b03e30ccef8e78a926","target":"graph","created_at":"2026-05-18T01:11: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":"The Vertex Separator Problem for a graph is to find the smallest collection of vertices whose removal breaks the graph into two disconnected subsets that satisfy specified size constraints. In the paper 10.1016/j.ejor.2014.05.042, the Vertex Separator Problem was formulated as a continuous (non-concave/non-convex) bilinear quadratic program. In this paper, we develop a more general continuous bilinear program which incorporates vertex weights, and which applies to the coarse graphs that are generated in a multilevel compression of the original Vertex Separator Problem. A Mountain Climbing Algo","authors_text":"Ilya Safro, James T. Hungerford, William W. Hager","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-17T23:07:50Z","title":"A Multilevel Bilinear Programming Algorithm For the Vertex Separator Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4885","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:bbbfa9e55d197660f6025c257e997a53825d0b4d5c507319e52085e65738ac0a","target":"record","created_at":"2026-05-18T01:11: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":"1cef9195424e79abd60fec395e1fec185b844aa307bcc50de4893d4c9ec949bb","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-17T23:07:50Z","title_canon_sha256":"ae5ca38b629230744576407aa1eb3a2d95111619f84bf307c6a4055743936a94"},"schema_version":"1.0","source":{"id":"1410.4885","kind":"arxiv","version":2}},"canonical_sha256":"479b0ff78a9ec3fbb7cd57d118a83942fbf973d88e150ede7f0b60577187869d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"479b0ff78a9ec3fbb7cd57d118a83942fbf973d88e150ede7f0b60577187869d","first_computed_at":"2026-05-18T01:11:00.376399Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:00.376399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mDDcESZoC8pEb8shRfF3iMoPdtsh1u9I9ezAM91Qsj2Pzt7J5uiQLU75QWQ8PplG5t3TJxlr+L50i4oCTaXsBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:00.376973Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.4885","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbbfa9e55d197660f6025c257e997a53825d0b4d5c507319e52085e65738ac0a","sha256:adc746ddba9f37e5075ff37b5d211ff31b82a9b536de51b03e30ccef8e78a926"],"state_sha256":"d1f01534cdffb813396a9f1f046ebb401ea906cf94a4d578fc6beb24098485c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M8lD6AecTQCqMt/y+j+qidzVzWRel+To1c87/6l1ay7nlFt5zBaoPMZWVU4sW0GLt+cKHbAsly4NVL+W7ZJRAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:43:20.189491Z","bundle_sha256":"1028cc022cbeb66e4bef476ce3f098ce9fa83e1ddca2d086708dd937627112c2"}}