{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LRWYSZFCK4JH7MFQUP7UXODEQB","short_pith_number":"pith:LRWYSZFC","schema_version":"1.0","canonical_sha256":"5c6d8964a257127fb0b0a3ff4bb864805ff62c209369dff2f2da455605c1bc50","source":{"kind":"arxiv","id":"1807.04308","version":2},"attestation_state":"computed","paper":{"title":"A Framework for Vehicle Routing Approximation Schemes in Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alice Paul, Amariah Becker","submitted_at":"2018-07-11T18:14:33Z","abstract_excerpt":"We develop a general framework for designing polynomial-time approximation schemes (PTASs) for various vehicle routing problems in trees. In these problems, the goal is to optimally route a fleet of vehicles, originating at a depot, to serve a set of clients, subject to various constraints. For example, in Minimum Makespan Vehicle Routing, the number of vehicles is fixed, and the objective is to minimize the longest distance traveled by a single vehicle. Our main insight is that we can often greatly restrict the set of potential solutions without adding too much to the optimal solution cost. T"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1807.04308","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-11T18:14:33Z","cross_cats_sorted":[],"title_canon_sha256":"e6b75c91c25ed4c5d4f970a337acafcc035b7f89f221cf5aec539dc44cea7de4","abstract_canon_sha256":"3425ef0d143547234eb36777559bfb9f26c388f4c0c4ee341a4e22928f453831"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:41.542044Z","signature_b64":"a0WmjmApHPUDhZ0I4DvMS5nwiI2CEdyQrJ4iGdtVtBRLXFkoibictYUcsFuJrFloTlIRTJDQnem+OmrfLh0uAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c6d8964a257127fb0b0a3ff4bb864805ff62c209369dff2f2da455605c1bc50","last_reissued_at":"2026-05-17T23:52:41.541377Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:41.541377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Framework for Vehicle Routing Approximation Schemes in Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alice Paul, Amariah Becker","submitted_at":"2018-07-11T18:14:33Z","abstract_excerpt":"We develop a general framework for designing polynomial-time approximation schemes (PTASs) for various vehicle routing problems in trees. In these problems, the goal is to optimally route a fleet of vehicles, originating at a depot, to serve a set of clients, subject to various constraints. For example, in Minimum Makespan Vehicle Routing, the number of vehicles is fixed, and the objective is to minimize the longest distance traveled by a single vehicle. Our main insight is that we can often greatly restrict the set of potential solutions without adding too much to the optimal solution cost. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04308","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.04308","created_at":"2026-05-17T23:52:41.541488+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.04308v2","created_at":"2026-05-17T23:52:41.541488+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04308","created_at":"2026-05-17T23:52:41.541488+00:00"},{"alias_kind":"pith_short_12","alias_value":"LRWYSZFCK4JH","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LRWYSZFCK4JH7MFQ","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LRWYSZFC","created_at":"2026-05-18T12:32:37.024351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LRWYSZFCK4JH7MFQUP7UXODEQB","json":"https://pith.science/pith/LRWYSZFCK4JH7MFQUP7UXODEQB.json","graph_json":"https://pith.science/api/pith-number/LRWYSZFCK4JH7MFQUP7UXODEQB/graph.json","events_json":"https://pith.science/api/pith-number/LRWYSZFCK4JH7MFQUP7UXODEQB/events.json","paper":"https://pith.science/paper/LRWYSZFC"},"agent_actions":{"view_html":"https://pith.science/pith/LRWYSZFCK4JH7MFQUP7UXODEQB","download_json":"https://pith.science/pith/LRWYSZFCK4JH7MFQUP7UXODEQB.json","view_paper":"https://pith.science/paper/LRWYSZFC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.04308&json=true","fetch_graph":"https://pith.science/api/pith-number/LRWYSZFCK4JH7MFQUP7UXODEQB/graph.json","fetch_events":"https://pith.science/api/pith-number/LRWYSZFCK4JH7MFQUP7UXODEQB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LRWYSZFCK4JH7MFQUP7UXODEQB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LRWYSZFCK4JH7MFQUP7UXODEQB/action/storage_attestation","attest_author":"https://pith.science/pith/LRWYSZFCK4JH7MFQUP7UXODEQB/action/author_attestation","sign_citation":"https://pith.science/pith/LRWYSZFCK4JH7MFQUP7UXODEQB/action/citation_signature","submit_replication":"https://pith.science/pith/LRWYSZFCK4JH7MFQUP7UXODEQB/action/replication_record"}},"created_at":"2026-05-17T23:52:41.541488+00:00","updated_at":"2026-05-17T23:52:41.541488+00:00"}