{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:QJCOMQMOCIRFCNWKDS6MQTB5E4","short_pith_number":"pith:QJCOMQMO","schema_version":"1.0","canonical_sha256":"8244e6418e12225136ca1cbcc84c3d2731066e027b7aefbc28e79f3ceeb0977e","source":{"kind":"arxiv","id":"1103.0985","version":1},"attestation_state":"computed","paper":{"title":"Locating Depots for Capacitated Vehicle Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Inge Li Goertz, Viswanath Nagarajan","submitted_at":"2011-03-04T21:15:44Z","abstract_excerpt":"We study a location-routing problem in the context of capacitated vehicle routing. The input is a set of demand locations in a metric space and a fleet of k vehicles each of capacity Q. The objective is to locate k depots, one for each vehicle, and compute routes for the vehicles so that all demands are satisfied and the total cost is minimized. Our main result is a constant-factor approximation algorithm for this problem. To achieve this result, we reduce to the k-median-forest problem, which generalizes both k-median and minimum spanning tree, and which might be of independent interest. We g"},"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":"1103.0985","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-04T21:15:44Z","cross_cats_sorted":[],"title_canon_sha256":"0e06d65c833574357c102b8015463c9280019bd93c42df2eb50e0524538ad4e0","abstract_canon_sha256":"9e409c1afb0cfb68ababb0182c2368aa2baefbc20d6346d1eb644c67d56fb684"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:17.355755Z","signature_b64":"xCyuawkZJctX0kGcL3wImwnm8d5LIdKeiY/gnfumF1MF7Tug0o74tnN/yj4kpC+wQVDGQnZKLsA3svhq5kKyBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8244e6418e12225136ca1cbcc84c3d2731066e027b7aefbc28e79f3ceeb0977e","last_reissued_at":"2026-05-18T04:27:17.354660Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:17.354660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Locating Depots for Capacitated Vehicle Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Inge Li Goertz, Viswanath Nagarajan","submitted_at":"2011-03-04T21:15:44Z","abstract_excerpt":"We study a location-routing problem in the context of capacitated vehicle routing. The input is a set of demand locations in a metric space and a fleet of k vehicles each of capacity Q. The objective is to locate k depots, one for each vehicle, and compute routes for the vehicles so that all demands are satisfied and the total cost is minimized. Our main result is a constant-factor approximation algorithm for this problem. To achieve this result, we reduce to the k-median-forest problem, which generalizes both k-median and minimum spanning tree, and which might be of independent interest. We g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0985","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":"1103.0985","created_at":"2026-05-18T04:27:17.355084+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.0985v1","created_at":"2026-05-18T04:27:17.355084+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0985","created_at":"2026-05-18T04:27:17.355084+00:00"},{"alias_kind":"pith_short_12","alias_value":"QJCOMQMOCIRF","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"QJCOMQMOCIRFCNWK","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"QJCOMQMO","created_at":"2026-05-18T12:26:39.201973+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/QJCOMQMOCIRFCNWKDS6MQTB5E4","json":"https://pith.science/pith/QJCOMQMOCIRFCNWKDS6MQTB5E4.json","graph_json":"https://pith.science/api/pith-number/QJCOMQMOCIRFCNWKDS6MQTB5E4/graph.json","events_json":"https://pith.science/api/pith-number/QJCOMQMOCIRFCNWKDS6MQTB5E4/events.json","paper":"https://pith.science/paper/QJCOMQMO"},"agent_actions":{"view_html":"https://pith.science/pith/QJCOMQMOCIRFCNWKDS6MQTB5E4","download_json":"https://pith.science/pith/QJCOMQMOCIRFCNWKDS6MQTB5E4.json","view_paper":"https://pith.science/paper/QJCOMQMO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.0985&json=true","fetch_graph":"https://pith.science/api/pith-number/QJCOMQMOCIRFCNWKDS6MQTB5E4/graph.json","fetch_events":"https://pith.science/api/pith-number/QJCOMQMOCIRFCNWKDS6MQTB5E4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QJCOMQMOCIRFCNWKDS6MQTB5E4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QJCOMQMOCIRFCNWKDS6MQTB5E4/action/storage_attestation","attest_author":"https://pith.science/pith/QJCOMQMOCIRFCNWKDS6MQTB5E4/action/author_attestation","sign_citation":"https://pith.science/pith/QJCOMQMOCIRFCNWKDS6MQTB5E4/action/citation_signature","submit_replication":"https://pith.science/pith/QJCOMQMOCIRFCNWKDS6MQTB5E4/action/replication_record"}},"created_at":"2026-05-18T04:27:17.355084+00:00","updated_at":"2026-05-18T04:27:17.355084+00:00"}