{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:V6OGFC6WXSYYTIWJLUCSFECNM2","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":"26299464589d3eff0b58397a23d4ec21d0dde22ef6d59a7c2265d7edbe678858","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-23T17:33:35Z","title_canon_sha256":"f23ecd6dd2cb531db096c380dafb2415c1be01197a47e8a6d0fbe8cb7f7d7507"},"schema_version":"1.0","source":{"id":"1311.6024","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6024","created_at":"2026-05-18T03:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6024v1","created_at":"2026-05-18T03:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6024","created_at":"2026-05-18T03:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"V6OGFC6WXSYY","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"V6OGFC6WXSYYTIWJ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"V6OGFC6W","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:bb322f1512f593b6e9d54de15bae22fe8f2cff899d03c11bf781889e515cb10d","target":"graph","created_at":"2026-05-18T03:06:20Z","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":"We consider vehicle-routing problems (VRPs) that incorporate the notion of {\\em regret} of a client, which is a measure of the waiting time of a client relative to its shortest-path distance from the depot. Formally, we consider both the additive and multiplicative versions of, what we call, the {\\em regret-bounded vehicle routing problem} (RVRP). In these problems, we are given an undirected complete graph $G=(\\{r\\}\\cup V,E)$ on $n$ nodes with a distinguished root (depot) node $r$, edge costs $\\{c_{uv}\\}$ that form a metric, and a regret bound $R$. Given a path $P$ rooted at $r$ and a node $v","authors_text":"Chaitanya Swamy, Zachary Friggstad","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-23T17:33:35Z","title":"Approximation Algorithms for Regret-Bounded Vehicle Routing and Applications to Distance-Constrained Vehicle Routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6024","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:9999526a64eeac498f91ee4dfae2a3ff7c5e08fa11812a8d2a32ca32141b7fe8","target":"record","created_at":"2026-05-18T03:06:20Z","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":"26299464589d3eff0b58397a23d4ec21d0dde22ef6d59a7c2265d7edbe678858","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-23T17:33:35Z","title_canon_sha256":"f23ecd6dd2cb531db096c380dafb2415c1be01197a47e8a6d0fbe8cb7f7d7507"},"schema_version":"1.0","source":{"id":"1311.6024","kind":"arxiv","version":1}},"canonical_sha256":"af9c628bd6bcb189a2c95d0522904d669eb3fb90e5f6c74b682456e86ec94509","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af9c628bd6bcb189a2c95d0522904d669eb3fb90e5f6c74b682456e86ec94509","first_computed_at":"2026-05-18T03:06:20.821832Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:20.821832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uGLa6m1sQxmuQU+h5T0eM8tbfZar8CtT2cLbDl9TLTyvWhlg2zPYv0OOATs/p59EjTC+vk5g/O9aCSVlKxecDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:20.822333Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.6024","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9999526a64eeac498f91ee4dfae2a3ff7c5e08fa11812a8d2a32ca32141b7fe8","sha256:bb322f1512f593b6e9d54de15bae22fe8f2cff899d03c11bf781889e515cb10d"],"state_sha256":"af31d52293099373172ca7384f345c21a1b07ca55b53089d8fde2c391860a527"}