{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:SX757RPXCA3JKIHFKW4OIGKNB6","short_pith_number":"pith:SX757RPX","canonical_record":{"source":{"id":"2202.12983","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2022-02-25T21:27:31Z","cross_cats_sorted":[],"title_canon_sha256":"dabd804d771df8fd01611f34ac1a50756174d66743aab3442d69811e5f5d1733","abstract_canon_sha256":"880acabd99353e6e2fc003a3d6c1abb37f1d62a67080e08f4d5d9f7e91daeb4e"},"schema_version":"1.0"},"canonical_sha256":"95ffdfc5f710369520e555b8e4194d0fa554409137393f2a4f5a3bae2de0ce08","source":{"kind":"arxiv","id":"2202.12983","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.12983","created_at":"2026-07-05T04:48:10Z"},{"alias_kind":"arxiv_version","alias_value":"2202.12983v1","created_at":"2026-07-05T04:48:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.12983","created_at":"2026-07-05T04:48:10Z"},{"alias_kind":"pith_short_12","alias_value":"SX757RPXCA3J","created_at":"2026-07-05T04:48:10Z"},{"alias_kind":"pith_short_16","alias_value":"SX757RPXCA3JKIHF","created_at":"2026-07-05T04:48:10Z"},{"alias_kind":"pith_short_8","alias_value":"SX757RPX","created_at":"2026-07-05T04:48:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:SX757RPXCA3JKIHFKW4OIGKNB6","target":"record","payload":{"canonical_record":{"source":{"id":"2202.12983","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2022-02-25T21:27:31Z","cross_cats_sorted":[],"title_canon_sha256":"dabd804d771df8fd01611f34ac1a50756174d66743aab3442d69811e5f5d1733","abstract_canon_sha256":"880acabd99353e6e2fc003a3d6c1abb37f1d62a67080e08f4d5d9f7e91daeb4e"},"schema_version":"1.0"},"canonical_sha256":"95ffdfc5f710369520e555b8e4194d0fa554409137393f2a4f5a3bae2de0ce08","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:48:10.666302Z","signature_b64":"mPu6JDvaYZsBPktERGNkLeb7TaahAnhV/emTnAK65MRMkISp5JNjDadoqDh6XfjqA4XY6OVmTGPMaEAjTwUIDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95ffdfc5f710369520e555b8e4194d0fa554409137393f2a4f5a3bae2de0ce08","last_reissued_at":"2026-07-05T04:48:10.665863Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:48:10.665863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2202.12983","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-07-05T04:48:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w0nkdhz69ln8bgshxJKacFWurA8cFnIHjySCYPv/5/UhiBC4W/DFxMyzWiP7FQh7df20mog5e+ymwJs0qDEpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T17:49:33.774138Z"},"content_sha256":"5d4dcc9b1c08d24849407d18b5d6849bb93424d5f812effe8373ebc916ed9c27","schema_version":"1.0","event_id":"sha256:5d4dcc9b1c08d24849407d18b5d6849bb93424d5f812effe8373ebc916ed9c27"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:SX757RPXCA3JKIHFKW4OIGKNB6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Large-Scale Dynamic Vehicle Routing Problems with Stochastic Requests","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexandre M. Florio, Jian Zhang, Kelin Luo, Tom Van Woensel","submitted_at":"2022-02-25T21:27:31Z","abstract_excerpt":"Dynamic vehicle routing problems (DVRPs) arise in several applications such as technician routing, meal delivery, and parcel shipping. We consider the DVRP with stochastic customer requests (DVRPSR), in which vehicles must be routed dynamically with the goal of maximizing the number of served requests. We model the DVRPSR as a multi-stage optimization problem, where the first-stage decision defines route plans for serving scheduled requests. Our main contributions are knapsack-based linear models to approximate accurately the expected reward-to-go, measured as the number of accepted requests, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.12983","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2202.12983/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:48:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gMCjoHoWSqCCLy6Od01txCjcSzZcDYQkkdcmEJiwndB3kR06OurNtBFwpRCuD/pi1iCYwEXZW+qMKuHZJ693DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T17:49:33.774796Z"},"content_sha256":"500232fd101814623cb5f44dec2ac1d8f6f3af086f77d3708349a4b185b30449","schema_version":"1.0","event_id":"sha256:500232fd101814623cb5f44dec2ac1d8f6f3af086f77d3708349a4b185b30449"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SX757RPXCA3JKIHFKW4OIGKNB6/bundle.json","state_url":"https://pith.science/pith/SX757RPXCA3JKIHFKW4OIGKNB6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SX757RPXCA3JKIHFKW4OIGKNB6/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-08-17T17:49:33Z","links":{"resolver":"https://pith.science/pith/SX757RPXCA3JKIHFKW4OIGKNB6","bundle":"https://pith.science/pith/SX757RPXCA3JKIHFKW4OIGKNB6/bundle.json","state":"https://pith.science/pith/SX757RPXCA3JKIHFKW4OIGKNB6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SX757RPXCA3JKIHFKW4OIGKNB6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:SX757RPXCA3JKIHFKW4OIGKNB6","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":"880acabd99353e6e2fc003a3d6c1abb37f1d62a67080e08f4d5d9f7e91daeb4e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2022-02-25T21:27:31Z","title_canon_sha256":"dabd804d771df8fd01611f34ac1a50756174d66743aab3442d69811e5f5d1733"},"schema_version":"1.0","source":{"id":"2202.12983","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.12983","created_at":"2026-07-05T04:48:10Z"},{"alias_kind":"arxiv_version","alias_value":"2202.12983v1","created_at":"2026-07-05T04:48:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.12983","created_at":"2026-07-05T04:48:10Z"},{"alias_kind":"pith_short_12","alias_value":"SX757RPXCA3J","created_at":"2026-07-05T04:48:10Z"},{"alias_kind":"pith_short_16","alias_value":"SX757RPXCA3JKIHF","created_at":"2026-07-05T04:48:10Z"},{"alias_kind":"pith_short_8","alias_value":"SX757RPX","created_at":"2026-07-05T04:48:10Z"}],"graph_snapshots":[{"event_id":"sha256:500232fd101814623cb5f44dec2ac1d8f6f3af086f77d3708349a4b185b30449","target":"graph","created_at":"2026-07-05T04:48:10Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2202.12983/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Dynamic vehicle routing problems (DVRPs) arise in several applications such as technician routing, meal delivery, and parcel shipping. We consider the DVRP with stochastic customer requests (DVRPSR), in which vehicles must be routed dynamically with the goal of maximizing the number of served requests. We model the DVRPSR as a multi-stage optimization problem, where the first-stage decision defines route plans for serving scheduled requests. Our main contributions are knapsack-based linear models to approximate accurately the expected reward-to-go, measured as the number of accepted requests, ","authors_text":"Alexandre M. Florio, Jian Zhang, Kelin Luo, Tom Van Woensel","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2022-02-25T21:27:31Z","title":"Solving Large-Scale Dynamic Vehicle Routing Problems with Stochastic Requests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.12983","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:5d4dcc9b1c08d24849407d18b5d6849bb93424d5f812effe8373ebc916ed9c27","target":"record","created_at":"2026-07-05T04:48:10Z","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":"880acabd99353e6e2fc003a3d6c1abb37f1d62a67080e08f4d5d9f7e91daeb4e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2022-02-25T21:27:31Z","title_canon_sha256":"dabd804d771df8fd01611f34ac1a50756174d66743aab3442d69811e5f5d1733"},"schema_version":"1.0","source":{"id":"2202.12983","kind":"arxiv","version":1}},"canonical_sha256":"95ffdfc5f710369520e555b8e4194d0fa554409137393f2a4f5a3bae2de0ce08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95ffdfc5f710369520e555b8e4194d0fa554409137393f2a4f5a3bae2de0ce08","first_computed_at":"2026-07-05T04:48:10.665863Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:48:10.665863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mPu6JDvaYZsBPktERGNkLeb7TaahAnhV/emTnAK65MRMkISp5JNjDadoqDh6XfjqA4XY6OVmTGPMaEAjTwUIDg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:48:10.666302Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.12983","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d4dcc9b1c08d24849407d18b5d6849bb93424d5f812effe8373ebc916ed9c27","sha256:500232fd101814623cb5f44dec2ac1d8f6f3af086f77d3708349a4b185b30449"],"state_sha256":"b1c4b641112a5d0ccff39edf87be6c9ebef4be7a65263f5d1227de1056594944"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3cydhG7d8nyQKaG/EuQ8ixlWwWuhf0SYkweECuh9C3zIrHXwUACMzQ39XlL8Ipn3gxMrOw7NHudz/vAIMBwiBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T17:49:33.778948Z","bundle_sha256":"7fabc097a2c548feb16de3630b7aaff4dbbab4026b34d41b12064528acb725f5"}}