{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:K5IXCK5WEN3AQJFNUY7VBS3Y6D","short_pith_number":"pith:K5IXCK5W","schema_version":"1.0","canonical_sha256":"5751712bb623760824ada63f50cb78f0c66c9a11bf5f407d38507fa6ca6fb3ac","source":{"kind":"arxiv","id":"1202.5797","version":2},"attestation_state":"computed","paper":{"title":"Stochastic Vehicle Routing with Recourse","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Inge Li Goertz, Rishi Saket, Viswanath Nagarajan","submitted_at":"2012-02-26T22:38:06Z","abstract_excerpt":"We study the classic Vehicle Routing Problem in the setting of stochastic optimization with recourse. StochVRP is a two-stage optimization problem, where demand is satisfied using two routes: fixed and recourse. The fixed route is computed using only a demand distribution. Then after observing the demand instantiations, a recourse route is computed -- but costs here become more expensive by a factor lambda.\n  We present an O(log^2 n log(n lambda))-approximation algorithm for this stochastic routing problem, under arbitrary distributions. The main idea in this result is relating StochVRP to a s"},"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":"1202.5797","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-26T22:38:06Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"2c96a691f9c8361d6fd513b91cdc0511f03aa004a7395388f5a3beda3e99f6bb","abstract_canon_sha256":"7bc956726078c21497fe0be3ff17c12c7f5d84f2e075f0fbdc0085e1ef1f7bc9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:03.491266Z","signature_b64":"crv4a3VeuYJo3AWn9w5VgFR20gQ26hoB5gNt45wcvBA2YxzVm3q2Y3qucmKCRPDibVyhxc7NU3pTeABat3V8AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5751712bb623760824ada63f50cb78f0c66c9a11bf5f407d38507fa6ca6fb3ac","last_reissued_at":"2026-05-18T04:01:03.490640Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:03.490640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Vehicle Routing with Recourse","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Inge Li Goertz, Rishi Saket, Viswanath Nagarajan","submitted_at":"2012-02-26T22:38:06Z","abstract_excerpt":"We study the classic Vehicle Routing Problem in the setting of stochastic optimization with recourse. StochVRP is a two-stage optimization problem, where demand is satisfied using two routes: fixed and recourse. The fixed route is computed using only a demand distribution. Then after observing the demand instantiations, a recourse route is computed -- but costs here become more expensive by a factor lambda.\n  We present an O(log^2 n log(n lambda))-approximation algorithm for this stochastic routing problem, under arbitrary distributions. The main idea in this result is relating StochVRP to a s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5797","kind":"arxiv","version":2},"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":"1202.5797","created_at":"2026-05-18T04:01:03.490733+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.5797v2","created_at":"2026-05-18T04:01:03.490733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5797","created_at":"2026-05-18T04:01:03.490733+00:00"},{"alias_kind":"pith_short_12","alias_value":"K5IXCK5WEN3A","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"K5IXCK5WEN3AQJFN","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"K5IXCK5W","created_at":"2026-05-18T12:27:11.947152+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/K5IXCK5WEN3AQJFNUY7VBS3Y6D","json":"https://pith.science/pith/K5IXCK5WEN3AQJFNUY7VBS3Y6D.json","graph_json":"https://pith.science/api/pith-number/K5IXCK5WEN3AQJFNUY7VBS3Y6D/graph.json","events_json":"https://pith.science/api/pith-number/K5IXCK5WEN3AQJFNUY7VBS3Y6D/events.json","paper":"https://pith.science/paper/K5IXCK5W"},"agent_actions":{"view_html":"https://pith.science/pith/K5IXCK5WEN3AQJFNUY7VBS3Y6D","download_json":"https://pith.science/pith/K5IXCK5WEN3AQJFNUY7VBS3Y6D.json","view_paper":"https://pith.science/paper/K5IXCK5W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.5797&json=true","fetch_graph":"https://pith.science/api/pith-number/K5IXCK5WEN3AQJFNUY7VBS3Y6D/graph.json","fetch_events":"https://pith.science/api/pith-number/K5IXCK5WEN3AQJFNUY7VBS3Y6D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K5IXCK5WEN3AQJFNUY7VBS3Y6D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K5IXCK5WEN3AQJFNUY7VBS3Y6D/action/storage_attestation","attest_author":"https://pith.science/pith/K5IXCK5WEN3AQJFNUY7VBS3Y6D/action/author_attestation","sign_citation":"https://pith.science/pith/K5IXCK5WEN3AQJFNUY7VBS3Y6D/action/citation_signature","submit_replication":"https://pith.science/pith/K5IXCK5WEN3AQJFNUY7VBS3Y6D/action/replication_record"}},"created_at":"2026-05-18T04:01:03.490733+00:00","updated_at":"2026-05-18T04:01:03.490733+00:00"}