{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QJCOMQMOCIRFCNWKDS6MQTB5E4","short_pith_number":"pith:QJCOMQMO","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"},"canonical_sha256":"8244e6418e12225136ca1cbcc84c3d2731066e027b7aefbc28e79f3ceeb0977e","source":{"kind":"arxiv","id":"1103.0985","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0985","created_at":"2026-05-18T04:27:17Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0985v1","created_at":"2026-05-18T04:27:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0985","created_at":"2026-05-18T04:27:17Z"},{"alias_kind":"pith_short_12","alias_value":"QJCOMQMOCIRF","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QJCOMQMOCIRFCNWK","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QJCOMQMO","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QJCOMQMOCIRFCNWKDS6MQTB5E4","target":"record","payload":{"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"},"canonical_sha256":"8244e6418e12225136ca1cbcc84c3d2731066e027b7aefbc28e79f3ceeb0977e","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"},"source_kind":"arxiv","source_id":"1103.0985","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-18T04:27:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l9zet5iTC3pEpRti7T9+qv5oWLlVCDv2zRa8maIYLUMCj/b5NUhly2HPWsqV9Ln1twEg8n3kEtYz084j/7ejAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:52:50.808782Z"},"content_sha256":"e774fcd0949942f21c291305cfc8badc0bf659a4380152fc5e1f89bc89df5dce","schema_version":"1.0","event_id":"sha256:e774fcd0949942f21c291305cfc8badc0bf659a4380152fc5e1f89bc89df5dce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QJCOMQMOCIRFCNWKDS6MQTB5E4","target":"graph","payload":{"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"},"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-18T04:27:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zDU8RF7/vEjKMG/lhNm64SH7BZneqp6ONB9JOcNZ1rNKHYzLyiOB/2nxdm3E/CKmmuxKtGTC2De+0vNDqxAQAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:52:50.809126Z"},"content_sha256":"97a6597166fa8ca0581224cbe477d09341fe151dee5b770efe2c75c315ebaa56","schema_version":"1.0","event_id":"sha256:97a6597166fa8ca0581224cbe477d09341fe151dee5b770efe2c75c315ebaa56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QJCOMQMOCIRFCNWKDS6MQTB5E4/bundle.json","state_url":"https://pith.science/pith/QJCOMQMOCIRFCNWKDS6MQTB5E4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QJCOMQMOCIRFCNWKDS6MQTB5E4/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-06-03T09:52:50Z","links":{"resolver":"https://pith.science/pith/QJCOMQMOCIRFCNWKDS6MQTB5E4","bundle":"https://pith.science/pith/QJCOMQMOCIRFCNWKDS6MQTB5E4/bundle.json","state":"https://pith.science/pith/QJCOMQMOCIRFCNWKDS6MQTB5E4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QJCOMQMOCIRFCNWKDS6MQTB5E4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QJCOMQMOCIRFCNWKDS6MQTB5E4","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":"9e409c1afb0cfb68ababb0182c2368aa2baefbc20d6346d1eb644c67d56fb684","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-04T21:15:44Z","title_canon_sha256":"0e06d65c833574357c102b8015463c9280019bd93c42df2eb50e0524538ad4e0"},"schema_version":"1.0","source":{"id":"1103.0985","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0985","created_at":"2026-05-18T04:27:17Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0985v1","created_at":"2026-05-18T04:27:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0985","created_at":"2026-05-18T04:27:17Z"},{"alias_kind":"pith_short_12","alias_value":"QJCOMQMOCIRF","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QJCOMQMOCIRFCNWK","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QJCOMQMO","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:97a6597166fa8ca0581224cbe477d09341fe151dee5b770efe2c75c315ebaa56","target":"graph","created_at":"2026-05-18T04:27:17Z","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 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","authors_text":"Inge Li Goertz, Viswanath Nagarajan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-04T21:15:44Z","title":"Locating Depots for Capacitated Vehicle Routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0985","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:e774fcd0949942f21c291305cfc8badc0bf659a4380152fc5e1f89bc89df5dce","target":"record","created_at":"2026-05-18T04:27:17Z","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":"9e409c1afb0cfb68ababb0182c2368aa2baefbc20d6346d1eb644c67d56fb684","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-04T21:15:44Z","title_canon_sha256":"0e06d65c833574357c102b8015463c9280019bd93c42df2eb50e0524538ad4e0"},"schema_version":"1.0","source":{"id":"1103.0985","kind":"arxiv","version":1}},"canonical_sha256":"8244e6418e12225136ca1cbcc84c3d2731066e027b7aefbc28e79f3ceeb0977e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8244e6418e12225136ca1cbcc84c3d2731066e027b7aefbc28e79f3ceeb0977e","first_computed_at":"2026-05-18T04:27:17.354660Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:17.354660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xCyuawkZJctX0kGcL3wImwnm8d5LIdKeiY/gnfumF1MF7Tug0o74tnN/yj4kpC+wQVDGQnZKLsA3svhq5kKyBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:17.355755Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.0985","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e774fcd0949942f21c291305cfc8badc0bf659a4380152fc5e1f89bc89df5dce","sha256:97a6597166fa8ca0581224cbe477d09341fe151dee5b770efe2c75c315ebaa56"],"state_sha256":"20aaf9e6671b7311b7bc1e2da2559f6a82eeeb09cf24f2845d7c0669f709f761"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y171O3C8ehGIalUZi3bOs+s+kt3Qj1NIUM4FMSklXpRPaH4LixmoazdJE6yuGH5sWBUGKOctcNfkZL3FjgxODQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T09:52:50.811265Z","bundle_sha256":"bd5b452729c0cba05d02a14573e969def22981b4a51f990ab103771515d1bf4b"}}