{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:3EI533D32HNCD752ZHY4GIYR5A","short_pith_number":"pith:3EI533D3","schema_version":"1.0","canonical_sha256":"d911ddec7bd1da21ffbac9f1c32311e8270d652bc1cd83299caebc4c6c821578","source":{"kind":"arxiv","id":"1012.1850","version":1},"attestation_state":"computed","paper":{"title":"Capacitated Vehicle Routing with Non-Uniform Speeds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Inge Li Gortz, Marco Molinaro, R. Ravi, Viswanath Nagarajan","submitted_at":"2010-12-08T20:55:06Z","abstract_excerpt":"The capacitated vehicle routing problem (CVRP) involves distributing (identical) items from a depot to a set of demand locations, using a single capacitated vehicle. We study a generalization of this problem to the setting of multiple vehicles having non-uniform speeds (that we call Heterogenous CVRP), and present a constant-factor approximation algorithm.\n  The technical heart of our result lies in achieving a constant approximation to the following TSP variant (called Heterogenous TSP). Given a metric denoting distances between vertices, a depot r containing k vehicles with possibly differen"},"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":"1012.1850","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-08T20:55:06Z","cross_cats_sorted":[],"title_canon_sha256":"384796d695bf7046a38dd6c30710893536d40aa6f21bcc74e6c52c229230921b","abstract_canon_sha256":"da3c94110b814e6beaa41b6480775f12ec601e917487ab941cf35f0ebda83e81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:51.159700Z","signature_b64":"lwrlYtKolr5bft5smQ129cmE+iAqG81tC2jPwMJN1915xKZ7UZI7NBIvDgBGy3KdpGI0CE+mT0nEqAEccvBSAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d911ddec7bd1da21ffbac9f1c32311e8270d652bc1cd83299caebc4c6c821578","last_reissued_at":"2026-05-18T04:33:51.159138Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:51.159138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacitated Vehicle Routing with Non-Uniform Speeds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Inge Li Gortz, Marco Molinaro, R. Ravi, Viswanath Nagarajan","submitted_at":"2010-12-08T20:55:06Z","abstract_excerpt":"The capacitated vehicle routing problem (CVRP) involves distributing (identical) items from a depot to a set of demand locations, using a single capacitated vehicle. We study a generalization of this problem to the setting of multiple vehicles having non-uniform speeds (that we call Heterogenous CVRP), and present a constant-factor approximation algorithm.\n  The technical heart of our result lies in achieving a constant approximation to the following TSP variant (called Heterogenous TSP). Given a metric denoting distances between vertices, a depot r containing k vehicles with possibly differen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.1850","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1012.1850","created_at":"2026-05-18T04:33:51.159196+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.1850v1","created_at":"2026-05-18T04:33:51.159196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.1850","created_at":"2026-05-18T04:33:51.159196+00:00"},{"alias_kind":"pith_short_12","alias_value":"3EI533D32HNC","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"3EI533D32HNCD752","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"3EI533D3","created_at":"2026-05-18T12:26:03.138858+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/3EI533D32HNCD752ZHY4GIYR5A","json":"https://pith.science/pith/3EI533D32HNCD752ZHY4GIYR5A.json","graph_json":"https://pith.science/api/pith-number/3EI533D32HNCD752ZHY4GIYR5A/graph.json","events_json":"https://pith.science/api/pith-number/3EI533D32HNCD752ZHY4GIYR5A/events.json","paper":"https://pith.science/paper/3EI533D3"},"agent_actions":{"view_html":"https://pith.science/pith/3EI533D32HNCD752ZHY4GIYR5A","download_json":"https://pith.science/pith/3EI533D32HNCD752ZHY4GIYR5A.json","view_paper":"https://pith.science/paper/3EI533D3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.1850&json=true","fetch_graph":"https://pith.science/api/pith-number/3EI533D32HNCD752ZHY4GIYR5A/graph.json","fetch_events":"https://pith.science/api/pith-number/3EI533D32HNCD752ZHY4GIYR5A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3EI533D32HNCD752ZHY4GIYR5A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3EI533D32HNCD752ZHY4GIYR5A/action/storage_attestation","attest_author":"https://pith.science/pith/3EI533D32HNCD752ZHY4GIYR5A/action/author_attestation","sign_citation":"https://pith.science/pith/3EI533D32HNCD752ZHY4GIYR5A/action/citation_signature","submit_replication":"https://pith.science/pith/3EI533D32HNCD752ZHY4GIYR5A/action/replication_record"}},"created_at":"2026-05-18T04:33:51.159196+00:00","updated_at":"2026-05-18T04:33:51.159196+00:00"}