{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2JSZ54BVRNYJPT6SHFE22G7QOS","short_pith_number":"pith:2JSZ54BV","schema_version":"1.0","canonical_sha256":"d2659ef0358b7097cfd23949ad1bf074b2ff7a87cfb2b4f4b72e14a97d8183e3","source":{"kind":"arxiv","id":"1802.08540","version":1},"attestation_state":"computed","paper":{"title":"Optimal Stochastic Delivery Planning in Full-Truckload and Less-Than-Truckload Delivery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Dusit Niyato, Ping Wang, Rakpong Kaewpuang, Siwei Jiang, Suttinee Sawadsitang","submitted_at":"2018-02-04T08:45:19Z","abstract_excerpt":"With an increasing demand from emerging logistics businesses, Vehicle Routing Problem with Private fleet and common Carrier (VRPPC) has been introduced to manage package delivery services from a supplier to customers. However, almost all of existing studies focus on the deterministic problem that assumes all parameters are known perfectly at the time when the planning and routing decisions are made. In reality, some parameters are random and unknown. Therefore, in this paper, we consider VRPPC with hard time windows and random demand, called Optimal Delivery Planning (ODP). The proposed ODP ai"},"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":"1802.08540","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-04T08:45:19Z","cross_cats_sorted":[],"title_canon_sha256":"fabe72b71b7a40bd03d6947f2946ae1c0f757c3dbea2b19b557ef867e98c1c6c","abstract_canon_sha256":"8c18ede37b28bcd83ebb551c54da7a8f06ef19e99a330777bdc29bfffb7017b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:41.242776Z","signature_b64":"PnIumsoccDG5CfHxN6LYjBrCLSfjkHyKZKV4LCS9zZzlQ/MRpXPiikcUKql+GHm/kXWnu76bLDptNYw06GabCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2659ef0358b7097cfd23949ad1bf074b2ff7a87cfb2b4f4b72e14a97d8183e3","last_reissued_at":"2026-05-18T00:22:41.242152Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:41.242152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Stochastic Delivery Planning in Full-Truckload and Less-Than-Truckload Delivery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Dusit Niyato, Ping Wang, Rakpong Kaewpuang, Siwei Jiang, Suttinee Sawadsitang","submitted_at":"2018-02-04T08:45:19Z","abstract_excerpt":"With an increasing demand from emerging logistics businesses, Vehicle Routing Problem with Private fleet and common Carrier (VRPPC) has been introduced to manage package delivery services from a supplier to customers. However, almost all of existing studies focus on the deterministic problem that assumes all parameters are known perfectly at the time when the planning and routing decisions are made. In reality, some parameters are random and unknown. Therefore, in this paper, we consider VRPPC with hard time windows and random demand, called Optimal Delivery Planning (ODP). The proposed ODP ai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08540","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.08540","created_at":"2026-05-18T00:22:41.242240+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.08540v1","created_at":"2026-05-18T00:22:41.242240+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08540","created_at":"2026-05-18T00:22:41.242240+00:00"},{"alias_kind":"pith_short_12","alias_value":"2JSZ54BVRNYJ","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2JSZ54BVRNYJPT6S","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2JSZ54BV","created_at":"2026-05-18T12:32:02.567920+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/2JSZ54BVRNYJPT6SHFE22G7QOS","json":"https://pith.science/pith/2JSZ54BVRNYJPT6SHFE22G7QOS.json","graph_json":"https://pith.science/api/pith-number/2JSZ54BVRNYJPT6SHFE22G7QOS/graph.json","events_json":"https://pith.science/api/pith-number/2JSZ54BVRNYJPT6SHFE22G7QOS/events.json","paper":"https://pith.science/paper/2JSZ54BV"},"agent_actions":{"view_html":"https://pith.science/pith/2JSZ54BVRNYJPT6SHFE22G7QOS","download_json":"https://pith.science/pith/2JSZ54BVRNYJPT6SHFE22G7QOS.json","view_paper":"https://pith.science/paper/2JSZ54BV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.08540&json=true","fetch_graph":"https://pith.science/api/pith-number/2JSZ54BVRNYJPT6SHFE22G7QOS/graph.json","fetch_events":"https://pith.science/api/pith-number/2JSZ54BVRNYJPT6SHFE22G7QOS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2JSZ54BVRNYJPT6SHFE22G7QOS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2JSZ54BVRNYJPT6SHFE22G7QOS/action/storage_attestation","attest_author":"https://pith.science/pith/2JSZ54BVRNYJPT6SHFE22G7QOS/action/author_attestation","sign_citation":"https://pith.science/pith/2JSZ54BVRNYJPT6SHFE22G7QOS/action/citation_signature","submit_replication":"https://pith.science/pith/2JSZ54BVRNYJPT6SHFE22G7QOS/action/replication_record"}},"created_at":"2026-05-18T00:22:41.242240+00:00","updated_at":"2026-05-18T00:22:41.242240+00:00"}