{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GVG4E6DN5L3QI5KEP6D36WEQX3","short_pith_number":"pith:GVG4E6DN","canonical_record":{"source":{"id":"1504.08008","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-29T20:16:31Z","cross_cats_sorted":[],"title_canon_sha256":"da93cfeaeda09dc1ad41cf8ce717f38153a35c2b8da61fa70d89691f22df3f82","abstract_canon_sha256":"9f74ee67680068347b410263c227f90353d2c11386615df8376459590803c222"},"schema_version":"1.0"},"canonical_sha256":"354dc2786deaf70475447f87bf5890bee63169edd2b18eabadedbb129716ad1d","source":{"kind":"arxiv","id":"1504.08008","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.08008","created_at":"2026-05-18T02:17:23Z"},{"alias_kind":"arxiv_version","alias_value":"1504.08008v1","created_at":"2026-05-18T02:17:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.08008","created_at":"2026-05-18T02:17:23Z"},{"alias_kind":"pith_short_12","alias_value":"GVG4E6DN5L3Q","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GVG4E6DN5L3QI5KE","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GVG4E6DN","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GVG4E6DN5L3QI5KEP6D36WEQX3","target":"record","payload":{"canonical_record":{"source":{"id":"1504.08008","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-29T20:16:31Z","cross_cats_sorted":[],"title_canon_sha256":"da93cfeaeda09dc1ad41cf8ce717f38153a35c2b8da61fa70d89691f22df3f82","abstract_canon_sha256":"9f74ee67680068347b410263c227f90353d2c11386615df8376459590803c222"},"schema_version":"1.0"},"canonical_sha256":"354dc2786deaf70475447f87bf5890bee63169edd2b18eabadedbb129716ad1d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:23.579238Z","signature_b64":"Hk9msxgT9IMHQCe9+UIdUpv3H1sKlm+Pib17u+hsSPbfzPaw6iD9jv1FJqRZD7D6w3dX11luJyEsDAnz0w1fDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"354dc2786deaf70475447f87bf5890bee63169edd2b18eabadedbb129716ad1d","last_reissued_at":"2026-05-18T02:17:23.578657Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:23.578657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.08008","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-18T02:17:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qDyyYrRdBRRSYwcobbt8MGHOIMw0arfxn+g5iq9ii9kCvPGO5jdZ0bS2qM9Jk9/77qkfAxllRpcwbyQeuZISCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:51:52.182207Z"},"content_sha256":"09dcd1ce7fcc9a285f0fb8f325ceabb0e0d34a8e8bee82f8b6d5e6774d93d298","schema_version":"1.0","event_id":"sha256:09dcd1ce7fcc9a285f0fb8f325ceabb0e0d34a8e8bee82f8b6d5e6774d93d298"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GVG4E6DN5L3QI5KEP6D36WEQX3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kyle Fox, Philip N. Klein, Shay Mozes","submitted_at":"2015-04-29T20:16:31Z","abstract_excerpt":"Given an undirected graph with edge costs and node weights, the minimum bisection problem asks for a partition of the nodes into two parts of equal weight such that the sum of edge costs between the parts is minimized. We give a polynomial time bicriteria approximation scheme for bisection on planar graphs.\n  Specifically, let $W$ be the total weight of all nodes in a planar graph $G$. For any constant $\\varepsilon > 0$, our algorithm outputs a bipartition of the nodes such that each part weighs at most $W/2 + \\varepsilon$ and the total cost of edges crossing the partition is at most $(1+\\vare"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.08008","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-18T02:17:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s+UlgJx4LZc9woZJn4i40senCHWuLV25gG2Yyrj6VWTc5pIYtnjKeeLZrWTqQq/KQ8ogzs/jlDMQy0UWqRvJCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:51:52.182558Z"},"content_sha256":"3d0150c1f252ce470c053a45d4edba145e1e276768ab923eae8ab52b3eabfd86","schema_version":"1.0","event_id":"sha256:3d0150c1f252ce470c053a45d4edba145e1e276768ab923eae8ab52b3eabfd86"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GVG4E6DN5L3QI5KEP6D36WEQX3/bundle.json","state_url":"https://pith.science/pith/GVG4E6DN5L3QI5KEP6D36WEQX3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GVG4E6DN5L3QI5KEP6D36WEQX3/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-01T08:51:52Z","links":{"resolver":"https://pith.science/pith/GVG4E6DN5L3QI5KEP6D36WEQX3","bundle":"https://pith.science/pith/GVG4E6DN5L3QI5KEP6D36WEQX3/bundle.json","state":"https://pith.science/pith/GVG4E6DN5L3QI5KEP6D36WEQX3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GVG4E6DN5L3QI5KEP6D36WEQX3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GVG4E6DN5L3QI5KEP6D36WEQX3","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":"9f74ee67680068347b410263c227f90353d2c11386615df8376459590803c222","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-29T20:16:31Z","title_canon_sha256":"da93cfeaeda09dc1ad41cf8ce717f38153a35c2b8da61fa70d89691f22df3f82"},"schema_version":"1.0","source":{"id":"1504.08008","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.08008","created_at":"2026-05-18T02:17:23Z"},{"alias_kind":"arxiv_version","alias_value":"1504.08008v1","created_at":"2026-05-18T02:17:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.08008","created_at":"2026-05-18T02:17:23Z"},{"alias_kind":"pith_short_12","alias_value":"GVG4E6DN5L3Q","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GVG4E6DN5L3QI5KE","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GVG4E6DN","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:3d0150c1f252ce470c053a45d4edba145e1e276768ab923eae8ab52b3eabfd86","target":"graph","created_at":"2026-05-18T02:17:23Z","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":"Given an undirected graph with edge costs and node weights, the minimum bisection problem asks for a partition of the nodes into two parts of equal weight such that the sum of edge costs between the parts is minimized. We give a polynomial time bicriteria approximation scheme for bisection on planar graphs.\n  Specifically, let $W$ be the total weight of all nodes in a planar graph $G$. For any constant $\\varepsilon > 0$, our algorithm outputs a bipartition of the nodes such that each part weighs at most $W/2 + \\varepsilon$ and the total cost of edges crossing the partition is at most $(1+\\vare","authors_text":"Kyle Fox, Philip N. Klein, Shay Mozes","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-29T20:16:31Z","title":"A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.08008","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:09dcd1ce7fcc9a285f0fb8f325ceabb0e0d34a8e8bee82f8b6d5e6774d93d298","target":"record","created_at":"2026-05-18T02:17:23Z","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":"9f74ee67680068347b410263c227f90353d2c11386615df8376459590803c222","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-29T20:16:31Z","title_canon_sha256":"da93cfeaeda09dc1ad41cf8ce717f38153a35c2b8da61fa70d89691f22df3f82"},"schema_version":"1.0","source":{"id":"1504.08008","kind":"arxiv","version":1}},"canonical_sha256":"354dc2786deaf70475447f87bf5890bee63169edd2b18eabadedbb129716ad1d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"354dc2786deaf70475447f87bf5890bee63169edd2b18eabadedbb129716ad1d","first_computed_at":"2026-05-18T02:17:23.578657Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:23.578657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hk9msxgT9IMHQCe9+UIdUpv3H1sKlm+Pib17u+hsSPbfzPaw6iD9jv1FJqRZD7D6w3dX11luJyEsDAnz0w1fDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:23.579238Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.08008","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09dcd1ce7fcc9a285f0fb8f325ceabb0e0d34a8e8bee82f8b6d5e6774d93d298","sha256:3d0150c1f252ce470c053a45d4edba145e1e276768ab923eae8ab52b3eabfd86"],"state_sha256":"373f16b3fb438dc9deeab4ffb94f45a79c22210a73fa5238cabf1f283c96afd2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ck49GhBKhaM9KtnPn7GNwZeA8n9mkaE3j5jd/t3IgLSBeLYmhJD/gTu2j0/YgPWlazhHQZwIhQh9LBAKqQV3Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T08:51:52.184356Z","bundle_sha256":"b5201abd344f7fa19b20910986afa62947fc63cebcc5014e6e46245d0539c87a"}}