{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:K5IXCK5WEN3AQJFNUY7VBS3Y6D","short_pith_number":"pith:K5IXCK5W","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"},"canonical_sha256":"5751712bb623760824ada63f50cb78f0c66c9a11bf5f407d38507fa6ca6fb3ac","source":{"kind":"arxiv","id":"1202.5797","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5797","created_at":"2026-05-18T04:01:03Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5797v2","created_at":"2026-05-18T04:01:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5797","created_at":"2026-05-18T04:01:03Z"},{"alias_kind":"pith_short_12","alias_value":"K5IXCK5WEN3A","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"K5IXCK5WEN3AQJFN","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"K5IXCK5W","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:K5IXCK5WEN3AQJFNUY7VBS3Y6D","target":"record","payload":{"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"},"canonical_sha256":"5751712bb623760824ada63f50cb78f0c66c9a11bf5f407d38507fa6ca6fb3ac","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"},"source_kind":"arxiv","source_id":"1202.5797","source_version":2,"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:01:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EtmJDN5e1p09sr14GlxLrABrKd1QqCrP7oXdSnjx3ioD2jbKLOXz1qHokstRnelXZQe63lYR10xad3J/8dFoDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:37:22.834874Z"},"content_sha256":"ef1392ebf010d755bffa3965ae7f6350e1753f4e73c39398191cf2e7591509e2","schema_version":"1.0","event_id":"sha256:ef1392ebf010d755bffa3965ae7f6350e1753f4e73c39398191cf2e7591509e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:K5IXCK5WEN3AQJFNUY7VBS3Y6D","target":"graph","payload":{"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"},"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:01:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vYn50XMJkzcu3/zE8FaB53uqthtfT9McC3WPptXTrWH9qy9RQxncCjS9ViQWCk5jFWk0uR1H9cx7lIUXPqwOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:37:22.835411Z"},"content_sha256":"c99cad55b04ee27829401e4f422acc5025e8f34248319fcef79b9b220c291b64","schema_version":"1.0","event_id":"sha256:c99cad55b04ee27829401e4f422acc5025e8f34248319fcef79b9b220c291b64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K5IXCK5WEN3AQJFNUY7VBS3Y6D/bundle.json","state_url":"https://pith.science/pith/K5IXCK5WEN3AQJFNUY7VBS3Y6D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K5IXCK5WEN3AQJFNUY7VBS3Y6D/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-05-26T21:37:22Z","links":{"resolver":"https://pith.science/pith/K5IXCK5WEN3AQJFNUY7VBS3Y6D","bundle":"https://pith.science/pith/K5IXCK5WEN3AQJFNUY7VBS3Y6D/bundle.json","state":"https://pith.science/pith/K5IXCK5WEN3AQJFNUY7VBS3Y6D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K5IXCK5WEN3AQJFNUY7VBS3Y6D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:K5IXCK5WEN3AQJFNUY7VBS3Y6D","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":"7bc956726078c21497fe0be3ff17c12c7f5d84f2e075f0fbdc0085e1ef1f7bc9","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-26T22:38:06Z","title_canon_sha256":"2c96a691f9c8361d6fd513b91cdc0511f03aa004a7395388f5a3beda3e99f6bb"},"schema_version":"1.0","source":{"id":"1202.5797","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5797","created_at":"2026-05-18T04:01:03Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5797v2","created_at":"2026-05-18T04:01:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5797","created_at":"2026-05-18T04:01:03Z"},{"alias_kind":"pith_short_12","alias_value":"K5IXCK5WEN3A","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"K5IXCK5WEN3AQJFN","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"K5IXCK5W","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:c99cad55b04ee27829401e4f422acc5025e8f34248319fcef79b9b220c291b64","target":"graph","created_at":"2026-05-18T04:01:03Z","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 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","authors_text":"Inge Li Goertz, Rishi Saket, Viswanath Nagarajan","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-26T22:38:06Z","title":"Stochastic Vehicle Routing with Recourse"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5797","kind":"arxiv","version":2},"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:ef1392ebf010d755bffa3965ae7f6350e1753f4e73c39398191cf2e7591509e2","target":"record","created_at":"2026-05-18T04:01:03Z","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":"7bc956726078c21497fe0be3ff17c12c7f5d84f2e075f0fbdc0085e1ef1f7bc9","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-26T22:38:06Z","title_canon_sha256":"2c96a691f9c8361d6fd513b91cdc0511f03aa004a7395388f5a3beda3e99f6bb"},"schema_version":"1.0","source":{"id":"1202.5797","kind":"arxiv","version":2}},"canonical_sha256":"5751712bb623760824ada63f50cb78f0c66c9a11bf5f407d38507fa6ca6fb3ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5751712bb623760824ada63f50cb78f0c66c9a11bf5f407d38507fa6ca6fb3ac","first_computed_at":"2026-05-18T04:01:03.490640Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:03.490640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"crv4a3VeuYJo3AWn9w5VgFR20gQ26hoB5gNt45wcvBA2YxzVm3q2Y3qucmKCRPDibVyhxc7NU3pTeABat3V8AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:03.491266Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.5797","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef1392ebf010d755bffa3965ae7f6350e1753f4e73c39398191cf2e7591509e2","sha256:c99cad55b04ee27829401e4f422acc5025e8f34248319fcef79b9b220c291b64"],"state_sha256":"73ee0552d67bd51475ea11b2f49cec5d8cb151604367dcaf9b7e2a65f3bcddbb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iUCur1ZVUMg50SqYWBleREqcKNAxDwboezhKmLE+u2UtxmmxpxvLAXNPGr4Wb/w7bWq+2nZZw4KBuM9cDGO0DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:37:22.838553Z","bundle_sha256":"73ec2b90184d28691fcd6545174d538b2d3fa11f0efe991ed83f0191a0d5da48"}}