{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7AQ2XFC3GTRYFK2LM5DYKKLCJ2","short_pith_number":"pith:7AQ2XFC3","canonical_record":{"source":{"id":"1804.08791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-24T00:22:16Z","cross_cats_sorted":[],"title_canon_sha256":"e3b9046b556bc18867d25a47f78c35e3114d34b1cea5606c833bec2559fe6a5c","abstract_canon_sha256":"566f9932e8b0aa10786d88b4954b5f5eeebcf9959507d8d2f1103e7ea2a8df91"},"schema_version":"1.0"},"canonical_sha256":"f821ab945b34e382ab4b67478529624ea56ed34d59ee6b599f77b926aa9fb639","source":{"kind":"arxiv","id":"1804.08791","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08791","created_at":"2026-05-18T00:17:37Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08791v1","created_at":"2026-05-18T00:17:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08791","created_at":"2026-05-18T00:17:37Z"},{"alias_kind":"pith_short_12","alias_value":"7AQ2XFC3GTRY","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7AQ2XFC3GTRYFK2L","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7AQ2XFC3","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7AQ2XFC3GTRYFK2LM5DYKKLCJ2","target":"record","payload":{"canonical_record":{"source":{"id":"1804.08791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-24T00:22:16Z","cross_cats_sorted":[],"title_canon_sha256":"e3b9046b556bc18867d25a47f78c35e3114d34b1cea5606c833bec2559fe6a5c","abstract_canon_sha256":"566f9932e8b0aa10786d88b4954b5f5eeebcf9959507d8d2f1103e7ea2a8df91"},"schema_version":"1.0"},"canonical_sha256":"f821ab945b34e382ab4b67478529624ea56ed34d59ee6b599f77b926aa9fb639","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:37.332214Z","signature_b64":"oDJ9Q2cdWxzWZiLEznQOKc/66k3TGrxji4N4+gjXbgyHBsSSIetpEfXUCcTLe+Xa+oIN5FirS9j2CfkdOB5rDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f821ab945b34e382ab4b67478529624ea56ed34d59ee6b599f77b926aa9fb639","last_reissued_at":"2026-05-18T00:17:37.331505Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:37.331505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.08791","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-18T00:17:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KXph+vATtPm1Abl/j5KOyfSAQgPG7bWUdk9VZ/zkROd1K68dxWni68gcCRtknumyilRu3Mh2oZ+cEy31JK0EDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T23:29:41.280014Z"},"content_sha256":"e4f13dc32253306c53db65bcb95589f5e7caeaf3de8ba480ab8d3ec42bafb6d6","schema_version":"1.0","event_id":"sha256:e4f13dc32253306c53db65bcb95589f5e7caeaf3de8ba480ab8d3ec42bafb6d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7AQ2XFC3GTRYFK2LM5DYKKLCJ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Tight 4/3 Approximation for Capacitated Vehicle Routing in Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amariah Becker","submitted_at":"2018-04-24T00:22:16Z","abstract_excerpt":"Given a set of clients with demands, the Capacitated Vehicle Routing problem is to find a set of tours that collectively cover all client demand, such that the capacity of each vehicle is not exceeded and such that the sum of the tour lengths is minimized. In this paper, we provide a 4/3-approximation algorithm for Capacitated Vehicle Routing on trees, improving over the previous best-known approximation ratio of $(\\sqrt{41}-1)/4$ by Asano et al., while using the same lower bound. Asano et al. show that there exist instances whose optimal cost is 4/3 times this lower bound. Notably, our 4/3 ap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08791","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-18T00:17:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aJkk7S2QxiI70beCnepYUG2o4v/Y+dRLhnzMkXVF3RBXFavFtNo18ri/Z4q4WVpDLQ42XbiVjIjbRSSfkTtMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T23:29:41.280387Z"},"content_sha256":"b369db672d66be1802a19735504e5cf3f93d4fa10fa9745cc2c3ffb2c92d6202","schema_version":"1.0","event_id":"sha256:b369db672d66be1802a19735504e5cf3f93d4fa10fa9745cc2c3ffb2c92d6202"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7AQ2XFC3GTRYFK2LM5DYKKLCJ2/bundle.json","state_url":"https://pith.science/pith/7AQ2XFC3GTRYFK2LM5DYKKLCJ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7AQ2XFC3GTRYFK2LM5DYKKLCJ2/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-24T23:29:41Z","links":{"resolver":"https://pith.science/pith/7AQ2XFC3GTRYFK2LM5DYKKLCJ2","bundle":"https://pith.science/pith/7AQ2XFC3GTRYFK2LM5DYKKLCJ2/bundle.json","state":"https://pith.science/pith/7AQ2XFC3GTRYFK2LM5DYKKLCJ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7AQ2XFC3GTRYFK2LM5DYKKLCJ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7AQ2XFC3GTRYFK2LM5DYKKLCJ2","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":"566f9932e8b0aa10786d88b4954b5f5eeebcf9959507d8d2f1103e7ea2a8df91","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-24T00:22:16Z","title_canon_sha256":"e3b9046b556bc18867d25a47f78c35e3114d34b1cea5606c833bec2559fe6a5c"},"schema_version":"1.0","source":{"id":"1804.08791","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08791","created_at":"2026-05-18T00:17:37Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08791v1","created_at":"2026-05-18T00:17:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08791","created_at":"2026-05-18T00:17:37Z"},{"alias_kind":"pith_short_12","alias_value":"7AQ2XFC3GTRY","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7AQ2XFC3GTRYFK2L","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7AQ2XFC3","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:b369db672d66be1802a19735504e5cf3f93d4fa10fa9745cc2c3ffb2c92d6202","target":"graph","created_at":"2026-05-18T00:17:37Z","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 a set of clients with demands, the Capacitated Vehicle Routing problem is to find a set of tours that collectively cover all client demand, such that the capacity of each vehicle is not exceeded and such that the sum of the tour lengths is minimized. In this paper, we provide a 4/3-approximation algorithm for Capacitated Vehicle Routing on trees, improving over the previous best-known approximation ratio of $(\\sqrt{41}-1)/4$ by Asano et al., while using the same lower bound. Asano et al. show that there exist instances whose optimal cost is 4/3 times this lower bound. Notably, our 4/3 ap","authors_text":"Amariah Becker","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-24T00:22:16Z","title":"A Tight 4/3 Approximation for Capacitated Vehicle Routing in Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08791","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:e4f13dc32253306c53db65bcb95589f5e7caeaf3de8ba480ab8d3ec42bafb6d6","target":"record","created_at":"2026-05-18T00:17:37Z","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":"566f9932e8b0aa10786d88b4954b5f5eeebcf9959507d8d2f1103e7ea2a8df91","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-24T00:22:16Z","title_canon_sha256":"e3b9046b556bc18867d25a47f78c35e3114d34b1cea5606c833bec2559fe6a5c"},"schema_version":"1.0","source":{"id":"1804.08791","kind":"arxiv","version":1}},"canonical_sha256":"f821ab945b34e382ab4b67478529624ea56ed34d59ee6b599f77b926aa9fb639","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f821ab945b34e382ab4b67478529624ea56ed34d59ee6b599f77b926aa9fb639","first_computed_at":"2026-05-18T00:17:37.331505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:37.331505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oDJ9Q2cdWxzWZiLEznQOKc/66k3TGrxji4N4+gjXbgyHBsSSIetpEfXUCcTLe+Xa+oIN5FirS9j2CfkdOB5rDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:37.332214Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.08791","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4f13dc32253306c53db65bcb95589f5e7caeaf3de8ba480ab8d3ec42bafb6d6","sha256:b369db672d66be1802a19735504e5cf3f93d4fa10fa9745cc2c3ffb2c92d6202"],"state_sha256":"9e7e019f1c9fd707598d0b4120add2892c9c004538f73c8a3acfef91185f5bc4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"prAaZCQI3iUUXT7NgTYhWTUAx4urlMJG3j84RRdVioen/Fi6eUorheXW4t7yhbLnVAhsMpEctCObxXE1lqDHDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T23:29:41.282590Z","bundle_sha256":"957106b7f194590f6b76755ecb020bce1bac843abce8b0ed8b6fd6fdcf6fb81a"}}