{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:B7RSOWI7ICPFNCLTDWI2J5RGVO","short_pith_number":"pith:B7RSOWI7","canonical_record":{"source":{"id":"1901.07032","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-21T18:45:29Z","cross_cats_sorted":[],"title_canon_sha256":"ca1ae8d3e8e79fdd2deb6f6770ed02c6501c860ae160c9866f54afa20a436073","abstract_canon_sha256":"7596a6fbd5ce988a398748e69effb0d92accaf8188970e1c3ed81bef065a48c1"},"schema_version":"1.0"},"canonical_sha256":"0fe327591f409e5689731d91a4f626ab97e55176add3d5782f1e65452fed6654","source":{"kind":"arxiv","id":"1901.07032","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07032","created_at":"2026-05-17T23:55:48Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07032v1","created_at":"2026-05-17T23:55:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07032","created_at":"2026-05-17T23:55:48Z"},{"alias_kind":"pith_short_12","alias_value":"B7RSOWI7ICPF","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"B7RSOWI7ICPFNCLT","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"B7RSOWI7","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:B7RSOWI7ICPFNCLTDWI2J5RGVO","target":"record","payload":{"canonical_record":{"source":{"id":"1901.07032","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-21T18:45:29Z","cross_cats_sorted":[],"title_canon_sha256":"ca1ae8d3e8e79fdd2deb6f6770ed02c6501c860ae160c9866f54afa20a436073","abstract_canon_sha256":"7596a6fbd5ce988a398748e69effb0d92accaf8188970e1c3ed81bef065a48c1"},"schema_version":"1.0"},"canonical_sha256":"0fe327591f409e5689731d91a4f626ab97e55176add3d5782f1e65452fed6654","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:48.335421Z","signature_b64":"sz+uSiWSNVu3G76PH7I7OcEMuvauyBHqJSfk9ReWGxh4AfUFEaQH37MW2unLkUHYqw61wX1MdtanwqHLbm7RBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fe327591f409e5689731d91a4f626ab97e55176add3d5782f1e65452fed6654","last_reissued_at":"2026-05-17T23:55:48.334776Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:48.334776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.07032","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-17T23:55:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lR7d/nv8by0SuGcdSS4e5mxJZbWKJ76L9ttpqWQ/S5IPHKM5q6pme5gvpI801mEyS8hYdImbVlDxAwwa4XTtCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:02:05.558698Z"},"content_sha256":"c18780286b241685a962b83e5c932e440be87d8461db2be62f2712476df1e24d","schema_version":"1.0","event_id":"sha256:c18780286b241685a962b83e5c932e440be87d8461db2be62f2712476df1e24d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:B7RSOWI7ICPFNCLTDWI2J5RGVO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A PTAS for Bounded-Capacity Vehicle Routing in Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aaron Schild, Amariah Becker, Philip N. Klein","submitted_at":"2019-01-21T18:45:29Z","abstract_excerpt":"The Capacitated Vehicle Routing problem is to find a minimum-cost set of tours that collectively cover clients in a graph, such that each tour starts and ends at a specified depot and is subject to a capacity bound on the number of clients it can serve. In this paper, we present a polynomial-time approximation scheme (PTAS) for instances in which the input graph is planar and the capacity is bounded. Previously, only a quasipolynomial-time approximation scheme was known for these instances. To obtain this result, we show how to embed planar graphs into bounded-treewidth graphs while preserving"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07032","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-17T23:55:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/CCo+pApbS+q1AlenS7K7PEXE+FSGuzv4IyA0wJ+jW5pB2CXY50agG3nmBRew5Ns7cZ2TFS6p7u8dils4esABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:02:05.559409Z"},"content_sha256":"90220ed6a3d5270ee66556ad2d25a1f4f41193427462085e56f4b65d54b4be8b","schema_version":"1.0","event_id":"sha256:90220ed6a3d5270ee66556ad2d25a1f4f41193427462085e56f4b65d54b4be8b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B7RSOWI7ICPFNCLTDWI2J5RGVO/bundle.json","state_url":"https://pith.science/pith/B7RSOWI7ICPFNCLTDWI2J5RGVO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B7RSOWI7ICPFNCLTDWI2J5RGVO/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-25T11:02:05Z","links":{"resolver":"https://pith.science/pith/B7RSOWI7ICPFNCLTDWI2J5RGVO","bundle":"https://pith.science/pith/B7RSOWI7ICPFNCLTDWI2J5RGVO/bundle.json","state":"https://pith.science/pith/B7RSOWI7ICPFNCLTDWI2J5RGVO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B7RSOWI7ICPFNCLTDWI2J5RGVO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:B7RSOWI7ICPFNCLTDWI2J5RGVO","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":"7596a6fbd5ce988a398748e69effb0d92accaf8188970e1c3ed81bef065a48c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-21T18:45:29Z","title_canon_sha256":"ca1ae8d3e8e79fdd2deb6f6770ed02c6501c860ae160c9866f54afa20a436073"},"schema_version":"1.0","source":{"id":"1901.07032","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07032","created_at":"2026-05-17T23:55:48Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07032v1","created_at":"2026-05-17T23:55:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07032","created_at":"2026-05-17T23:55:48Z"},{"alias_kind":"pith_short_12","alias_value":"B7RSOWI7ICPF","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"B7RSOWI7ICPFNCLT","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"B7RSOWI7","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:90220ed6a3d5270ee66556ad2d25a1f4f41193427462085e56f4b65d54b4be8b","target":"graph","created_at":"2026-05-17T23:55:48Z","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 Capacitated Vehicle Routing problem is to find a minimum-cost set of tours that collectively cover clients in a graph, such that each tour starts and ends at a specified depot and is subject to a capacity bound on the number of clients it can serve. In this paper, we present a polynomial-time approximation scheme (PTAS) for instances in which the input graph is planar and the capacity is bounded. Previously, only a quasipolynomial-time approximation scheme was known for these instances. To obtain this result, we show how to embed planar graphs into bounded-treewidth graphs while preserving","authors_text":"Aaron Schild, Amariah Becker, Philip N. Klein","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-21T18:45:29Z","title":"A PTAS for Bounded-Capacity Vehicle Routing in Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07032","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:c18780286b241685a962b83e5c932e440be87d8461db2be62f2712476df1e24d","target":"record","created_at":"2026-05-17T23:55:48Z","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":"7596a6fbd5ce988a398748e69effb0d92accaf8188970e1c3ed81bef065a48c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-21T18:45:29Z","title_canon_sha256":"ca1ae8d3e8e79fdd2deb6f6770ed02c6501c860ae160c9866f54afa20a436073"},"schema_version":"1.0","source":{"id":"1901.07032","kind":"arxiv","version":1}},"canonical_sha256":"0fe327591f409e5689731d91a4f626ab97e55176add3d5782f1e65452fed6654","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0fe327591f409e5689731d91a4f626ab97e55176add3d5782f1e65452fed6654","first_computed_at":"2026-05-17T23:55:48.334776Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:48.334776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sz+uSiWSNVu3G76PH7I7OcEMuvauyBHqJSfk9ReWGxh4AfUFEaQH37MW2unLkUHYqw61wX1MdtanwqHLbm7RBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:48.335421Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.07032","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c18780286b241685a962b83e5c932e440be87d8461db2be62f2712476df1e24d","sha256:90220ed6a3d5270ee66556ad2d25a1f4f41193427462085e56f4b65d54b4be8b"],"state_sha256":"fa4610b38716c595e57c34526f0704b289090e835c4199873b08596e5ff1984a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rXyuadq4ffNATWSL1vqUEF92yyt6of4+Xlrtjo6DwqiA5ypcPuu0g74kVKEdwEKJ9iZzGu/QLcyf1Rly/zhqCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T11:02:05.563038Z","bundle_sha256":"b94f4b11fd3b06fa196c19ec4675b30f6d8d0739573676fba58b7ddf2227c503"}}