{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:SGWCBUMRO2ZNTE6BB5TYPF3RJR","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":"0537959b50e4506e4c7b287c2b2daefbb7b634f61da96b9b8e77ec60bddce720","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-05-27T15:33:16Z","title_canon_sha256":"d7400d832d4e2d6b4c495ebfbb95687ebc0b9fac3ad61b14ddebf9ff9a71f0b3"},"schema_version":"1.0","source":{"id":"2405.17272","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.17272","created_at":"2026-07-05T08:28:10Z"},{"alias_kind":"arxiv_version","alias_value":"2405.17272v2","created_at":"2026-07-05T08:28:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.17272","created_at":"2026-07-05T08:28:10Z"},{"alias_kind":"pith_short_12","alias_value":"SGWCBUMRO2ZN","created_at":"2026-07-05T08:28:10Z"},{"alias_kind":"pith_short_16","alias_value":"SGWCBUMRO2ZNTE6B","created_at":"2026-07-05T08:28:10Z"},{"alias_kind":"pith_short_8","alias_value":"SGWCBUMR","created_at":"2026-07-05T08:28:10Z"}],"graph_snapshots":[{"event_id":"sha256:319a3f669e31f18c9635787961fd29a43e81971864b7b8ed42884fd09152d0db","target":"graph","created_at":"2026-07-05T08:28:10Z","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/2405.17272/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The min-max vehicle routing problem (min-max VRP) traverses all given customers by assigning several routes and aims to minimize the length of the longest route. Recently, reinforcement learning (RL)-based sequential planning methods have exhibited advantages in solving efficiency and optimality. However, these methods fail to exploit the problem-specific properties in learning representations, resulting in less effective features for decoding optimal routes. This paper considers the sequential planning process of min-max VRPs as two coupled optimization tasks: customer partition for different","authors_text":"Ke Tang, Mingxuan Yuan, Shunyu Yao, Xialiang Tong, Zhenkun Wang, Zhi Zheng","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-05-27T15:33:16Z","title":"DPN: Decoupling Partition and Navigation for Neural Solvers of Min-max Vehicle Routing Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.17272","kind":"arxiv","version":2},"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:14df5485e52f523220639f29b848bdbce13600e6141f37b53bd056bdf455f9cd","target":"record","created_at":"2026-07-05T08:28:10Z","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":"0537959b50e4506e4c7b287c2b2daefbb7b634f61da96b9b8e77ec60bddce720","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-05-27T15:33:16Z","title_canon_sha256":"d7400d832d4e2d6b4c495ebfbb95687ebc0b9fac3ad61b14ddebf9ff9a71f0b3"},"schema_version":"1.0","source":{"id":"2405.17272","kind":"arxiv","version":2}},"canonical_sha256":"91ac20d19176b2d993c10f678797714c7e9b578df7c502e6f4dc9bb4bc3866fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91ac20d19176b2d993c10f678797714c7e9b578df7c502e6f4dc9bb4bc3866fb","first_computed_at":"2026-07-05T08:28:10.434268Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:28:10.434268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pXSAamab71p0wHTRh6JgU3TBB0x+Adb3Ry4kVVVpAHRltRSsWydrcIabcYHcTeYkRlDD81HbC8ZRTiNgRACOBw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:28:10.434718Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.17272","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14df5485e52f523220639f29b848bdbce13600e6141f37b53bd056bdf455f9cd","sha256:319a3f669e31f18c9635787961fd29a43e81971864b7b8ed42884fd09152d0db"],"state_sha256":"45799ac36a14d60b44ee1f67fb802ea94884f3672bc4f4a2bce0df2c43f6ccc2"}