{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:UYWCQUBJ3UMBWDARJDOU5UABSH","short_pith_number":"pith:UYWCQUBJ","canonical_record":{"source":{"id":"1311.5930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-22T23:45:24Z","cross_cats_sorted":[],"title_canon_sha256":"ca920768a7c40b2c58cbe8b960a29c09582471a184c6757e634e602f91aa69c9","abstract_canon_sha256":"12216455e56f762582f08db6feeaf03e1bb6be63a89665f8e0be094f8ddff44a"},"schema_version":"1.0"},"canonical_sha256":"a62c285029dd181b0c1148dd4ed00191ca4b91b8da7dc74679038695b6a80eca","source":{"kind":"arxiv","id":"1311.5930","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.5930","created_at":"2026-05-18T03:06:21Z"},{"alias_kind":"arxiv_version","alias_value":"1311.5930v1","created_at":"2026-05-18T03:06:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5930","created_at":"2026-05-18T03:06:21Z"},{"alias_kind":"pith_short_12","alias_value":"UYWCQUBJ3UMB","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UYWCQUBJ3UMBWDAR","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UYWCQUBJ","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:UYWCQUBJ3UMBWDARJDOU5UABSH","target":"record","payload":{"canonical_record":{"source":{"id":"1311.5930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-22T23:45:24Z","cross_cats_sorted":[],"title_canon_sha256":"ca920768a7c40b2c58cbe8b960a29c09582471a184c6757e634e602f91aa69c9","abstract_canon_sha256":"12216455e56f762582f08db6feeaf03e1bb6be63a89665f8e0be094f8ddff44a"},"schema_version":"1.0"},"canonical_sha256":"a62c285029dd181b0c1148dd4ed00191ca4b91b8da7dc74679038695b6a80eca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:21.056832Z","signature_b64":"6ZcEo5AeEYkNKPRNh3l0BTpBbobAk23MkVEzAcG+mBdCWuM+Iyh35NsRPUB4FCw9JbBzmUrrq8Sz/ADfG7trBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a62c285029dd181b0c1148dd4ed00191ca4b91b8da7dc74679038695b6a80eca","last_reissued_at":"2026-05-18T03:06:21.055786Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:21.055786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.5930","source_version":1,"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-18T03:06:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CKTviEL8oWQK+ILvhPT789K2JcF8bSMEQCrDsJzRZqDRvqbBePOF19qz94sTFZa/ryX8/c1UR+ZtQnE6tr9UBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:44:12.792010Z"},"content_sha256":"fe406ff67120e2128b1799c248120e4c77bffafb4923f81f047a900d505fb17f","schema_version":"1.0","event_id":"sha256:fe406ff67120e2128b1799c248120e4c77bffafb4923f81f047a900d505fb17f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:UYWCQUBJ3UMBWDARJDOU5UABSH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Continuous Refinement Strategy for the Multilevel Computation of Vertex Separators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ilya Safro, James Hungerford, William Hager","submitted_at":"2013-11-22T23:45:24Z","abstract_excerpt":"The Vertex Separator Problem (VSP) on a graph is the problem of finding the smallest collection of vertices whose removal separates the graph into two disjoint subsets of roughly equal size. Recently, Hager and Hungerford [1] developed a continuous bilinear programming formulation of the VSP. In this paper, we reinforce the bilinear programming approach with a multilevel scheme for learning the structure of the graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5930","kind":"arxiv","version":1},"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-18T03:06:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uW1fJvlgs2ZkxqzSScGz1oUqmR2SFBEbJvUAYw8uYSuaQILMEgbMMV1+xxgvi4kfvoQqaw6lN6mX3s3PfXvhDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:44:12.792371Z"},"content_sha256":"4fbf1d4cfecb40f0e10c9f1e31f405cae7efc98d08a14f042243adb919724321","schema_version":"1.0","event_id":"sha256:4fbf1d4cfecb40f0e10c9f1e31f405cae7efc98d08a14f042243adb919724321"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UYWCQUBJ3UMBWDARJDOU5UABSH/bundle.json","state_url":"https://pith.science/pith/UYWCQUBJ3UMBWDARJDOU5UABSH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UYWCQUBJ3UMBWDARJDOU5UABSH/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-06-25T08:44:12Z","links":{"resolver":"https://pith.science/pith/UYWCQUBJ3UMBWDARJDOU5UABSH","bundle":"https://pith.science/pith/UYWCQUBJ3UMBWDARJDOU5UABSH/bundle.json","state":"https://pith.science/pith/UYWCQUBJ3UMBWDARJDOU5UABSH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UYWCQUBJ3UMBWDARJDOU5UABSH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:UYWCQUBJ3UMBWDARJDOU5UABSH","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":"12216455e56f762582f08db6feeaf03e1bb6be63a89665f8e0be094f8ddff44a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-22T23:45:24Z","title_canon_sha256":"ca920768a7c40b2c58cbe8b960a29c09582471a184c6757e634e602f91aa69c9"},"schema_version":"1.0","source":{"id":"1311.5930","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.5930","created_at":"2026-05-18T03:06:21Z"},{"alias_kind":"arxiv_version","alias_value":"1311.5930v1","created_at":"2026-05-18T03:06:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5930","created_at":"2026-05-18T03:06:21Z"},{"alias_kind":"pith_short_12","alias_value":"UYWCQUBJ3UMB","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UYWCQUBJ3UMBWDAR","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UYWCQUBJ","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:4fbf1d4cfecb40f0e10c9f1e31f405cae7efc98d08a14f042243adb919724321","target":"graph","created_at":"2026-05-18T03:06:21Z","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 (VSP) on a graph is the problem of finding the smallest collection of vertices whose removal separates the graph into two disjoint subsets of roughly equal size. Recently, Hager and Hungerford [1] developed a continuous bilinear programming formulation of the VSP. In this paper, we reinforce the bilinear programming approach with a multilevel scheme for learning the structure of the graph.","authors_text":"Ilya Safro, James Hungerford, William Hager","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-22T23:45:24Z","title":"A Continuous Refinement Strategy for the Multilevel Computation of Vertex Separators"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5930","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:fe406ff67120e2128b1799c248120e4c77bffafb4923f81f047a900d505fb17f","target":"record","created_at":"2026-05-18T03:06:21Z","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":"12216455e56f762582f08db6feeaf03e1bb6be63a89665f8e0be094f8ddff44a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-22T23:45:24Z","title_canon_sha256":"ca920768a7c40b2c58cbe8b960a29c09582471a184c6757e634e602f91aa69c9"},"schema_version":"1.0","source":{"id":"1311.5930","kind":"arxiv","version":1}},"canonical_sha256":"a62c285029dd181b0c1148dd4ed00191ca4b91b8da7dc74679038695b6a80eca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a62c285029dd181b0c1148dd4ed00191ca4b91b8da7dc74679038695b6a80eca","first_computed_at":"2026-05-18T03:06:21.055786Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:21.055786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6ZcEo5AeEYkNKPRNh3l0BTpBbobAk23MkVEzAcG+mBdCWuM+Iyh35NsRPUB4FCw9JbBzmUrrq8Sz/ADfG7trBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:21.056832Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.5930","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe406ff67120e2128b1799c248120e4c77bffafb4923f81f047a900d505fb17f","sha256:4fbf1d4cfecb40f0e10c9f1e31f405cae7efc98d08a14f042243adb919724321"],"state_sha256":"3afadb7cf8b3be7db56dcc45acefb8b4c08f31b8451db672b7e16d263d34a640"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lg+fJLEvQrDfG++vJ+N8knZrn4uhOlO8hdqXT0FxnvRAPj031gdQcVWfQ3ocr0S1eB6TT5+pXswHteo80rTMCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T08:44:12.794272Z","bundle_sha256":"7368b62ff3f159b002e29498e274a3876670401c116e9311258e1a85b27d07cf"}}