{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:J4UOAGJ2F5UMISMI3T6QQDHREU","short_pith_number":"pith:J4UOAGJ2","schema_version":"1.0","canonical_sha256":"4f28e0193a2f68c44988dcfd080cf1251128a006f194ed35d818390637140585","source":{"kind":"arxiv","id":"2606.29725","version":1},"attestation_state":"computed","paper":{"title":"Optimizing Nursing Care Taxi Dispatch Leveraging Integer Linear Programming Solvers and Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Akihito Hiromori, Hamada Rizk, Hirozumi Yamaguchi, Riku Nakao","submitted_at":"2026-06-29T03:05:58Z","abstract_excerpt":"In this paper, we formulate a new vehicle dispatch optimization problem, called Nursing Care Taxi Dispatch, as a variant of the Vehicle Routing Problem, considering constraints related to wheelchair use, user compatibility, pick-up and drop-off times, and vehicle limitations. Previous neural-based methods for Vehicle Routing Problems have typically addressed a few simple constraints, while our new problem involves multiple complex constraints, resulting in having fewer destinations to select. This complexity makes it more difficult to obtain solutions that allow all nodes to be visited with a "},"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":"2606.29725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-29T03:05:58Z","cross_cats_sorted":[],"title_canon_sha256":"992625d6d1881c0b3e68596c63e920da88e2165603908dc0e4a8be98e666f6d1","abstract_canon_sha256":"04967ac5b284d07584e3962c94827066303d77e827b5cf7e6ca4391238bd27c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T02:17:32.201951Z","signature_b64":"rJHmhnL96+4cdZ8bLikG58yeBKfYd7dc5x6HosfsJjgjV+/o0bsvqop1Jua1nKND+l3btc5H5HVGd57Zl6LHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f28e0193a2f68c44988dcfd080cf1251128a006f194ed35d818390637140585","last_reissued_at":"2026-06-30T02:17:32.200994Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T02:17:32.200994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Nursing Care Taxi Dispatch Leveraging Integer Linear Programming Solvers and Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Akihito Hiromori, Hamada Rizk, Hirozumi Yamaguchi, Riku Nakao","submitted_at":"2026-06-29T03:05:58Z","abstract_excerpt":"In this paper, we formulate a new vehicle dispatch optimization problem, called Nursing Care Taxi Dispatch, as a variant of the Vehicle Routing Problem, considering constraints related to wheelchair use, user compatibility, pick-up and drop-off times, and vehicle limitations. Previous neural-based methods for Vehicle Routing Problems have typically addressed a few simple constraints, while our new problem involves multiple complex constraints, resulting in having fewer destinations to select. This complexity makes it more difficult to obtain solutions that allow all nodes to be visited with a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.29725","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/2606.29725/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":"2606.29725","created_at":"2026-06-30T02:17:32.201297+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.29725v1","created_at":"2026-06-30T02:17:32.201297+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.29725","created_at":"2026-06-30T02:17:32.201297+00:00"},{"alias_kind":"pith_short_12","alias_value":"J4UOAGJ2F5UM","created_at":"2026-06-30T02:17:32.201297+00:00"},{"alias_kind":"pith_short_16","alias_value":"J4UOAGJ2F5UMISMI","created_at":"2026-06-30T02:17:32.201297+00:00"},{"alias_kind":"pith_short_8","alias_value":"J4UOAGJ2","created_at":"2026-06-30T02:17:32.201297+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/J4UOAGJ2F5UMISMI3T6QQDHREU","json":"https://pith.science/pith/J4UOAGJ2F5UMISMI3T6QQDHREU.json","graph_json":"https://pith.science/api/pith-number/J4UOAGJ2F5UMISMI3T6QQDHREU/graph.json","events_json":"https://pith.science/api/pith-number/J4UOAGJ2F5UMISMI3T6QQDHREU/events.json","paper":"https://pith.science/paper/J4UOAGJ2"},"agent_actions":{"view_html":"https://pith.science/pith/J4UOAGJ2F5UMISMI3T6QQDHREU","download_json":"https://pith.science/pith/J4UOAGJ2F5UMISMI3T6QQDHREU.json","view_paper":"https://pith.science/paper/J4UOAGJ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.29725&json=true","fetch_graph":"https://pith.science/api/pith-number/J4UOAGJ2F5UMISMI3T6QQDHREU/graph.json","fetch_events":"https://pith.science/api/pith-number/J4UOAGJ2F5UMISMI3T6QQDHREU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J4UOAGJ2F5UMISMI3T6QQDHREU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J4UOAGJ2F5UMISMI3T6QQDHREU/action/storage_attestation","attest_author":"https://pith.science/pith/J4UOAGJ2F5UMISMI3T6QQDHREU/action/author_attestation","sign_citation":"https://pith.science/pith/J4UOAGJ2F5UMISMI3T6QQDHREU/action/citation_signature","submit_replication":"https://pith.science/pith/J4UOAGJ2F5UMISMI3T6QQDHREU/action/replication_record"}},"created_at":"2026-06-30T02:17:32.201297+00:00","updated_at":"2026-06-30T02:17:32.201297+00:00"}