{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:QCPCZWP7TWQTWIY2ZY5DMZQIXR","short_pith_number":"pith:QCPCZWP7","schema_version":"1.0","canonical_sha256":"809e2cd9ff9da13b231ace3a366608bc711b691501d839486665ca5ea4789028","source":{"kind":"arxiv","id":"2304.11444","version":2},"attestation_state":"computed","paper":{"title":"Recomputing Solutions to Perturbed Multi-Commodity Pickup and Delivery Vehicle Routing Problems using Monte Carlo Tree Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MA","cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Mithun Goutham, Stephanie Stockar","submitted_at":"2023-04-22T16:54:30Z","abstract_excerpt":"The Multi-Commodity Pickup and Delivery Vehicle Routing Problem aims to optimize the pickup and delivery of multiple unique commodities using a fleet of several agents with limited payload capacities. This paper addresses the challenge of quickly recomputing the solution to this NP-hard problem when there are unexpected perturbations to the nominal task definitions, likely to occur under real-world operating conditions. The proposed method first decomposes the nominal problem by constructing a search tree using Monte Carlo Tree Search for task assignment, and uses a rapid heuristic for routing"},"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":"2304.11444","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2023-04-22T16:54:30Z","cross_cats_sorted":["cs.MA","cs.SY","math.OC"],"title_canon_sha256":"84a1850f62d0c89918d360b6d5a6dea6eb783239d66d1c8179549027f95fc9db","abstract_canon_sha256":"4a2dbc025ca088b5515bd8ba23342149bca31b2f4e8174f6e6bdcf6bd30833fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:49:24.331524Z","signature_b64":"0xUo2GPBE5oh/Ho38BZNr4CBfEyLOJtsueXbDcIP4kT0P9ppgtcCvowMsm83rPQRNiAOlInxaKDNr/9gxm3jBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"809e2cd9ff9da13b231ace3a366608bc711b691501d839486665ca5ea4789028","last_reissued_at":"2026-07-05T08:49:24.331068Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:49:24.331068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recomputing Solutions to Perturbed Multi-Commodity Pickup and Delivery Vehicle Routing Problems using Monte Carlo Tree Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MA","cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Mithun Goutham, Stephanie Stockar","submitted_at":"2023-04-22T16:54:30Z","abstract_excerpt":"The Multi-Commodity Pickup and Delivery Vehicle Routing Problem aims to optimize the pickup and delivery of multiple unique commodities using a fleet of several agents with limited payload capacities. This paper addresses the challenge of quickly recomputing the solution to this NP-hard problem when there are unexpected perturbations to the nominal task definitions, likely to occur under real-world operating conditions. The proposed method first decomposes the nominal problem by constructing a search tree using Monte Carlo Tree Search for task assignment, and uses a rapid heuristic for routing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.11444","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2304.11444/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2304.11444","created_at":"2026-07-05T08:49:24.331124+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.11444v2","created_at":"2026-07-05T08:49:24.331124+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.11444","created_at":"2026-07-05T08:49:24.331124+00:00"},{"alias_kind":"pith_short_12","alias_value":"QCPCZWP7TWQT","created_at":"2026-07-05T08:49:24.331124+00:00"},{"alias_kind":"pith_short_16","alias_value":"QCPCZWP7TWQTWIY2","created_at":"2026-07-05T08:49:24.331124+00:00"},{"alias_kind":"pith_short_8","alias_value":"QCPCZWP7","created_at":"2026-07-05T08:49:24.331124+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/QCPCZWP7TWQTWIY2ZY5DMZQIXR","json":"https://pith.science/pith/QCPCZWP7TWQTWIY2ZY5DMZQIXR.json","graph_json":"https://pith.science/api/pith-number/QCPCZWP7TWQTWIY2ZY5DMZQIXR/graph.json","events_json":"https://pith.science/api/pith-number/QCPCZWP7TWQTWIY2ZY5DMZQIXR/events.json","paper":"https://pith.science/paper/QCPCZWP7"},"agent_actions":{"view_html":"https://pith.science/pith/QCPCZWP7TWQTWIY2ZY5DMZQIXR","download_json":"https://pith.science/pith/QCPCZWP7TWQTWIY2ZY5DMZQIXR.json","view_paper":"https://pith.science/paper/QCPCZWP7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.11444&json=true","fetch_graph":"https://pith.science/api/pith-number/QCPCZWP7TWQTWIY2ZY5DMZQIXR/graph.json","fetch_events":"https://pith.science/api/pith-number/QCPCZWP7TWQTWIY2ZY5DMZQIXR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QCPCZWP7TWQTWIY2ZY5DMZQIXR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QCPCZWP7TWQTWIY2ZY5DMZQIXR/action/storage_attestation","attest_author":"https://pith.science/pith/QCPCZWP7TWQTWIY2ZY5DMZQIXR/action/author_attestation","sign_citation":"https://pith.science/pith/QCPCZWP7TWQTWIY2ZY5DMZQIXR/action/citation_signature","submit_replication":"https://pith.science/pith/QCPCZWP7TWQTWIY2ZY5DMZQIXR/action/replication_record"}},"created_at":"2026-07-05T08:49:24.331124+00:00","updated_at":"2026-07-05T08:49:24.331124+00:00"}