{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PKAV6WYGDKF7Q3K4REYALOS2DG","short_pith_number":"pith:PKAV6WYG","schema_version":"1.0","canonical_sha256":"7a815f5b061a8bf86d5c893005ba5a198fe8746984bb11c906a4ee4ec13ad5f3","source":{"kind":"arxiv","id":"1806.03220","version":2},"attestation_state":"computed","paper":{"title":"A Scenario Decomposition Algorithm for Strategic Time Window Assignment Vehicle Routing Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Akang Wang, Anirudh Subramanyam, Chrysanthos E. Gounaris","submitted_at":"2018-06-08T15:29:32Z","abstract_excerpt":"We study the strategic decision-making problem of assigning time windows to customers in the context of vehicle routing applications that are affected by operational uncertainty. This problem, known as the Time Window Assignment Vehicle Routing Problem, can be viewed as a two-stage stochastic optimization problem, where time window assignments constitute first-stage decisions, vehicle routes adhering to the assigned time windows constitute second-stage decisions, and the objective is to minimize the expected routing costs. We prove that a sampled deterministic equivalent of this stochastic mod"},"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":"1806.03220","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2018-06-08T15:29:32Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a2dbf18678ffae89c45d7db72eb8a56d014dfcaf9437b5f6c57e95629765a0d6","abstract_canon_sha256":"d5589bc546322aefab90b33d6ecde568b5569f3282f9096408a60608630785c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:41.251516Z","signature_b64":"n3V3K9IJyrPro5XjHH//Me5S+A2JxfUo+rxk9zd52tes4zRPaLxE3KDVGTTAcUB6zLGnuAlqLbQ0I931Ysu6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a815f5b061a8bf86d5c893005ba5a198fe8746984bb11c906a4ee4ec13ad5f3","last_reissued_at":"2026-05-18T00:03:41.251085Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:41.251085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Scenario Decomposition Algorithm for Strategic Time Window Assignment Vehicle Routing Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Akang Wang, Anirudh Subramanyam, Chrysanthos E. Gounaris","submitted_at":"2018-06-08T15:29:32Z","abstract_excerpt":"We study the strategic decision-making problem of assigning time windows to customers in the context of vehicle routing applications that are affected by operational uncertainty. This problem, known as the Time Window Assignment Vehicle Routing Problem, can be viewed as a two-stage stochastic optimization problem, where time window assignments constitute first-stage decisions, vehicle routes adhering to the assigned time windows constitute second-stage decisions, and the objective is to minimize the expected routing costs. We prove that a sampled deterministic equivalent of this stochastic mod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03220","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":"1806.03220","created_at":"2026-05-18T00:03:41.251155+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.03220v2","created_at":"2026-05-18T00:03:41.251155+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03220","created_at":"2026-05-18T00:03:41.251155+00:00"},{"alias_kind":"pith_short_12","alias_value":"PKAV6WYGDKF7","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"PKAV6WYGDKF7Q3K4","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"PKAV6WYG","created_at":"2026-05-18T12:32:46.962924+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/PKAV6WYGDKF7Q3K4REYALOS2DG","json":"https://pith.science/pith/PKAV6WYGDKF7Q3K4REYALOS2DG.json","graph_json":"https://pith.science/api/pith-number/PKAV6WYGDKF7Q3K4REYALOS2DG/graph.json","events_json":"https://pith.science/api/pith-number/PKAV6WYGDKF7Q3K4REYALOS2DG/events.json","paper":"https://pith.science/paper/PKAV6WYG"},"agent_actions":{"view_html":"https://pith.science/pith/PKAV6WYGDKF7Q3K4REYALOS2DG","download_json":"https://pith.science/pith/PKAV6WYGDKF7Q3K4REYALOS2DG.json","view_paper":"https://pith.science/paper/PKAV6WYG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.03220&json=true","fetch_graph":"https://pith.science/api/pith-number/PKAV6WYGDKF7Q3K4REYALOS2DG/graph.json","fetch_events":"https://pith.science/api/pith-number/PKAV6WYGDKF7Q3K4REYALOS2DG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PKAV6WYGDKF7Q3K4REYALOS2DG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PKAV6WYGDKF7Q3K4REYALOS2DG/action/storage_attestation","attest_author":"https://pith.science/pith/PKAV6WYGDKF7Q3K4REYALOS2DG/action/author_attestation","sign_citation":"https://pith.science/pith/PKAV6WYGDKF7Q3K4REYALOS2DG/action/citation_signature","submit_replication":"https://pith.science/pith/PKAV6WYGDKF7Q3K4REYALOS2DG/action/replication_record"}},"created_at":"2026-05-18T00:03:41.251155+00:00","updated_at":"2026-05-18T00:03:41.251155+00:00"}