{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:CNWPZEFLB2XDFQELLYN43YCRFW","short_pith_number":"pith:CNWPZEFL","canonical_record":{"source":{"id":"2411.04777","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-07T15:16:36Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"e5e78bb28980f5b2ecf824b1338f0b3628b8539a3bd56fd05027ad7b4784a799","abstract_canon_sha256":"442b1a8bb146db96a2da1c830d09442e9a49d91a199f6c406e28d3c0a4d8d836"},"schema_version":"1.0"},"canonical_sha256":"136cfc90ab0eae32c08b5e1bcde0512d9cc6fe4fac7b4f790d1cb2ed0234fedb","source":{"kind":"arxiv","id":"2411.04777","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.04777","created_at":"2026-07-05T09:32:33Z"},{"alias_kind":"arxiv_version","alias_value":"2411.04777v1","created_at":"2026-07-05T09:32:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.04777","created_at":"2026-07-05T09:32:33Z"},{"alias_kind":"pith_short_12","alias_value":"CNWPZEFLB2XD","created_at":"2026-07-05T09:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"CNWPZEFLB2XDFQEL","created_at":"2026-07-05T09:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"CNWPZEFL","created_at":"2026-07-05T09:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:CNWPZEFLB2XDFQELLYN43YCRFW","target":"record","payload":{"canonical_record":{"source":{"id":"2411.04777","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-07T15:16:36Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"e5e78bb28980f5b2ecf824b1338f0b3628b8539a3bd56fd05027ad7b4784a799","abstract_canon_sha256":"442b1a8bb146db96a2da1c830d09442e9a49d91a199f6c406e28d3c0a4d8d836"},"schema_version":"1.0"},"canonical_sha256":"136cfc90ab0eae32c08b5e1bcde0512d9cc6fe4fac7b4f790d1cb2ed0234fedb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:32:33.738703Z","signature_b64":"lgMbuVnhOmyuupv+hdMpv0lOYF503TabSbJl2mYbFmNmnl+FeR81hL21ZnVkMqmG4DkmFG/OCrEX6UKRHEMTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"136cfc90ab0eae32c08b5e1bcde0512d9cc6fe4fac7b4f790d1cb2ed0234fedb","last_reissued_at":"2026-07-05T09:32:33.738170Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:32:33.738170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.04777","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:32:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OitHOvdV4NUwQe5mZI7EA0QIOgn4PwT/RWBrqc/YnzS60OtYR1sXhrR0NCI+dua9fLM2heJ0noyuRODirOLuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T11:40:54.777083Z"},"content_sha256":"7e6e25c177191483dac365a7067089da3e1240598ffab00f5b039969dc00113f","schema_version":"1.0","event_id":"sha256:7e6e25c177191483dac365a7067089da3e1240598ffab00f5b039969dc00113f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:CNWPZEFLB2XDFQELLYN43YCRFW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learn to Solve Vehicle Routing Problems ASAP: A Neural Optimization Approach for Time-Constrained Vehicle Routing Problems with Finite Vehicle Fleet","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"cs.LG","authors_text":"Carina Kehrt, Elija Deineko","submitted_at":"2024-11-07T15:16:36Z","abstract_excerpt":"Finding a feasible and prompt solution to the Vehicle Routing Problem (VRP) is a prerequisite for efficient freight transportation, seamless logistics, and sustainable mobility. Traditional optimization methods reach their limits when confronted with the real-world complexity of VRPs, which involve numerous constraints and objectives. Recently, the ability of generative Artificial Intelligence (AI) to solve combinatorial tasks, known as Neural Combinatorial Optimization (NCO), demonstrated promising results, offering new perspectives. In this study, we propose an NCO approach to solve a time-c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.04777","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/2411.04777/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:32:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uBDvtxJdkUFZHzwCDrA7T0CaN+zSytV1GfskDoNpIh3nb4kw6OUGACMNKMrLegiEs+V6X2MYMtoktNhduBElDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T11:40:54.777429Z"},"content_sha256":"3d5c7cd2c086e671db66dbd72e781fef4e5fac4b41c933d301bba0c9b3b33124","schema_version":"1.0","event_id":"sha256:3d5c7cd2c086e671db66dbd72e781fef4e5fac4b41c933d301bba0c9b3b33124"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CNWPZEFLB2XDFQELLYN43YCRFW/bundle.json","state_url":"https://pith.science/pith/CNWPZEFLB2XDFQELLYN43YCRFW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CNWPZEFLB2XDFQELLYN43YCRFW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-20T11:40:54Z","links":{"resolver":"https://pith.science/pith/CNWPZEFLB2XDFQELLYN43YCRFW","bundle":"https://pith.science/pith/CNWPZEFLB2XDFQELLYN43YCRFW/bundle.json","state":"https://pith.science/pith/CNWPZEFLB2XDFQELLYN43YCRFW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CNWPZEFLB2XDFQELLYN43YCRFW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:CNWPZEFLB2XDFQELLYN43YCRFW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"442b1a8bb146db96a2da1c830d09442e9a49d91a199f6c406e28d3c0a4d8d836","cross_cats_sorted":["cs.ET"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-07T15:16:36Z","title_canon_sha256":"e5e78bb28980f5b2ecf824b1338f0b3628b8539a3bd56fd05027ad7b4784a799"},"schema_version":"1.0","source":{"id":"2411.04777","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.04777","created_at":"2026-07-05T09:32:33Z"},{"alias_kind":"arxiv_version","alias_value":"2411.04777v1","created_at":"2026-07-05T09:32:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.04777","created_at":"2026-07-05T09:32:33Z"},{"alias_kind":"pith_short_12","alias_value":"CNWPZEFLB2XD","created_at":"2026-07-05T09:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"CNWPZEFLB2XDFQEL","created_at":"2026-07-05T09:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"CNWPZEFL","created_at":"2026-07-05T09:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:3d5c7cd2c086e671db66dbd72e781fef4e5fac4b41c933d301bba0c9b3b33124","target":"graph","created_at":"2026-07-05T09:32:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.04777/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Finding a feasible and prompt solution to the Vehicle Routing Problem (VRP) is a prerequisite for efficient freight transportation, seamless logistics, and sustainable mobility. Traditional optimization methods reach their limits when confronted with the real-world complexity of VRPs, which involve numerous constraints and objectives. Recently, the ability of generative Artificial Intelligence (AI) to solve combinatorial tasks, known as Neural Combinatorial Optimization (NCO), demonstrated promising results, offering new perspectives. In this study, we propose an NCO approach to solve a time-c","authors_text":"Carina Kehrt, Elija Deineko","cross_cats":["cs.ET"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-07T15:16:36Z","title":"Learn to Solve Vehicle Routing Problems ASAP: A Neural Optimization Approach for Time-Constrained Vehicle Routing Problems with Finite Vehicle Fleet"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.04777","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7e6e25c177191483dac365a7067089da3e1240598ffab00f5b039969dc00113f","target":"record","created_at":"2026-07-05T09:32:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"442b1a8bb146db96a2da1c830d09442e9a49d91a199f6c406e28d3c0a4d8d836","cross_cats_sorted":["cs.ET"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-07T15:16:36Z","title_canon_sha256":"e5e78bb28980f5b2ecf824b1338f0b3628b8539a3bd56fd05027ad7b4784a799"},"schema_version":"1.0","source":{"id":"2411.04777","kind":"arxiv","version":1}},"canonical_sha256":"136cfc90ab0eae32c08b5e1bcde0512d9cc6fe4fac7b4f790d1cb2ed0234fedb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"136cfc90ab0eae32c08b5e1bcde0512d9cc6fe4fac7b4f790d1cb2ed0234fedb","first_computed_at":"2026-07-05T09:32:33.738170Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:32:33.738170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lgMbuVnhOmyuupv+hdMpv0lOYF503TabSbJl2mYbFmNmnl+FeR81hL21ZnVkMqmG4DkmFG/OCrEX6UKRHEMTAg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:32:33.738703Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.04777","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e6e25c177191483dac365a7067089da3e1240598ffab00f5b039969dc00113f","sha256:3d5c7cd2c086e671db66dbd72e781fef4e5fac4b41c933d301bba0c9b3b33124"],"state_sha256":"b4713d19edb41beed03f348ca2e40ad93a7c16d1c8f905f2a3a064d18d79a58f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fKCzuYTPXkEMwYST6s57l52fPliwMcRa75Ns0g+OxGZbFqAIIsMZDIztmY2iS8eGFwPYXT/vnZWFJRbHr7pDCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T11:40:54.781056Z","bundle_sha256":"44757b38cb3580c559018b281d8f5809cde488180b8f570a99d500ea6f9ae13b"}}