{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:FP5CS2GP6ECRWTQWVWHI7CPZO6","short_pith_number":"pith:FP5CS2GP","schema_version":"1.0","canonical_sha256":"2bfa2968cff1051b4e16ad8e8f89f977acb30bbc1470e0209f27a2ba0595da90","source":{"kind":"arxiv","id":"2310.14157","version":4},"attestation_state":"computed","paper":{"title":"Genetic Algorithms with Neural Cost Predictor for Solving Hierarchical Vehicle Routing Problems","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Abhay Sobhanan, Changhyun Kwon, Jinkyoo Park, Junyoung Park","submitted_at":"2023-10-22T02:46:37Z","abstract_excerpt":"When vehicle routing decisions are intertwined with higher-level decisions, the resulting optimization problems pose significant challenges for computation. Examples are the multi-depot vehicle routing problem (MDVRP), where customers are assigned to depots before delivery, and the capacitated location routing problem (CLRP), where the locations of depots should be determined first. A simple and straightforward approach for such hierarchical problems would be to separate the higher-level decisions from the complicated vehicle routing decisions. For each higher-level decision candidate, we may "},"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":"2310.14157","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.NE","submitted_at":"2023-10-22T02:46:37Z","cross_cats_sorted":[],"title_canon_sha256":"a25a25f4f5d9f26745917068255db40bc1da6c50094fb86a7110a90001bb09b2","abstract_canon_sha256":"321c3175236572b2291c03d2e49a645747064580f8fa0011a32b07f8e82ac1ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:04:07.881530Z","signature_b64":"i9Zx0OPmLP54Td7PNxmfZzRf3IWyMhb7jiPo4eWv4Z695/9BAoU4dirs2n+Bra4FfkOm0Um4AMuC1QDQGZ47AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bfa2968cff1051b4e16ad8e8f89f977acb30bbc1470e0209f27a2ba0595da90","last_reissued_at":"2026-07-05T09:04:07.881068Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:04:07.881068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Genetic Algorithms with Neural Cost Predictor for Solving Hierarchical Vehicle Routing Problems","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Abhay Sobhanan, Changhyun Kwon, Jinkyoo Park, Junyoung Park","submitted_at":"2023-10-22T02:46:37Z","abstract_excerpt":"When vehicle routing decisions are intertwined with higher-level decisions, the resulting optimization problems pose significant challenges for computation. Examples are the multi-depot vehicle routing problem (MDVRP), where customers are assigned to depots before delivery, and the capacitated location routing problem (CLRP), where the locations of depots should be determined first. A simple and straightforward approach for such hierarchical problems would be to separate the higher-level decisions from the complicated vehicle routing decisions. For each higher-level decision candidate, we may "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.14157","kind":"arxiv","version":4},"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/2310.14157/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":"2310.14157","created_at":"2026-07-05T09:04:07.881123+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.14157v4","created_at":"2026-07-05T09:04:07.881123+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.14157","created_at":"2026-07-05T09:04:07.881123+00:00"},{"alias_kind":"pith_short_12","alias_value":"FP5CS2GP6ECR","created_at":"2026-07-05T09:04:07.881123+00:00"},{"alias_kind":"pith_short_16","alias_value":"FP5CS2GP6ECRWTQW","created_at":"2026-07-05T09:04:07.881123+00:00"},{"alias_kind":"pith_short_8","alias_value":"FP5CS2GP","created_at":"2026-07-05T09:04:07.881123+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/FP5CS2GP6ECRWTQWVWHI7CPZO6","json":"https://pith.science/pith/FP5CS2GP6ECRWTQWVWHI7CPZO6.json","graph_json":"https://pith.science/api/pith-number/FP5CS2GP6ECRWTQWVWHI7CPZO6/graph.json","events_json":"https://pith.science/api/pith-number/FP5CS2GP6ECRWTQWVWHI7CPZO6/events.json","paper":"https://pith.science/paper/FP5CS2GP"},"agent_actions":{"view_html":"https://pith.science/pith/FP5CS2GP6ECRWTQWVWHI7CPZO6","download_json":"https://pith.science/pith/FP5CS2GP6ECRWTQWVWHI7CPZO6.json","view_paper":"https://pith.science/paper/FP5CS2GP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.14157&json=true","fetch_graph":"https://pith.science/api/pith-number/FP5CS2GP6ECRWTQWVWHI7CPZO6/graph.json","fetch_events":"https://pith.science/api/pith-number/FP5CS2GP6ECRWTQWVWHI7CPZO6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FP5CS2GP6ECRWTQWVWHI7CPZO6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FP5CS2GP6ECRWTQWVWHI7CPZO6/action/storage_attestation","attest_author":"https://pith.science/pith/FP5CS2GP6ECRWTQWVWHI7CPZO6/action/author_attestation","sign_citation":"https://pith.science/pith/FP5CS2GP6ECRWTQWVWHI7CPZO6/action/citation_signature","submit_replication":"https://pith.science/pith/FP5CS2GP6ECRWTQWVWHI7CPZO6/action/replication_record"}},"created_at":"2026-07-05T09:04:07.881123+00:00","updated_at":"2026-07-05T09:04:07.881123+00:00"}