{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:Y6LCGHXHZCYMPCSS765OJ43JPR","short_pith_number":"pith:Y6LCGHXH","canonical_record":{"source":{"id":"2509.23413","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-09-27T17:11:09Z","cross_cats_sorted":[],"title_canon_sha256":"704321fcc71fb9467e13a86b150a07aeaa60159df9140d353ee6a3763fe3ae65","abstract_canon_sha256":"e1b6ee0f61185a9c3f7a1153b4195b295263d817c6de0a0349b9bc3521f66432"},"schema_version":"1.0"},"canonical_sha256":"c796231ee7c8b0c78a52ffbae4f3697c42c5e2ee217a4d30a1ad0044bb75de82","source":{"kind":"arxiv","id":"2509.23413","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.23413","created_at":"2026-05-26T02:05:02Z"},{"alias_kind":"arxiv_version","alias_value":"2509.23413v2","created_at":"2026-05-26T02:05:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.23413","created_at":"2026-05-26T02:05:02Z"},{"alias_kind":"pith_short_12","alias_value":"Y6LCGHXHZCYM","created_at":"2026-05-26T02:05:02Z"},{"alias_kind":"pith_short_16","alias_value":"Y6LCGHXHZCYMPCSS","created_at":"2026-05-26T02:05:02Z"},{"alias_kind":"pith_short_8","alias_value":"Y6LCGHXH","created_at":"2026-05-26T02:05:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:Y6LCGHXHZCYMPCSS765OJ43JPR","target":"record","payload":{"canonical_record":{"source":{"id":"2509.23413","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-09-27T17:11:09Z","cross_cats_sorted":[],"title_canon_sha256":"704321fcc71fb9467e13a86b150a07aeaa60159df9140d353ee6a3763fe3ae65","abstract_canon_sha256":"e1b6ee0f61185a9c3f7a1153b4195b295263d817c6de0a0349b9bc3521f66432"},"schema_version":"1.0"},"canonical_sha256":"c796231ee7c8b0c78a52ffbae4f3697c42c5e2ee217a4d30a1ad0044bb75de82","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:05:02.459691Z","signature_b64":"IPqDOgyRNDLOupKDNi1vGG1WfTHAOHEsug2mXDAIh1a78LYc2ZfXOeUbHwpnqFpz6I44+iXjiedL8TG75E4OAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c796231ee7c8b0c78a52ffbae4f3697c42c5e2ee217a4d30a1ad0044bb75de82","last_reissued_at":"2026-05-26T02:05:02.458951Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:05:02.458951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.23413","source_version":2,"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-05-26T02:05:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4nM7I/SLxtOzwgzGCAGtyWZU/1EBesshhpu/0S38+FBUbDk8055TDzuuEzIvo0+m8I+6PvMu4BNtPUQC79G7Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T08:07:10.795548Z"},"content_sha256":"f70aadbcfbd61cd260050ddf23688136e9045c4cbf53590c1b33134c09407ed8","schema_version":"1.0","event_id":"sha256:f70aadbcfbd61cd260050ddf23688136e9045c4cbf53590c1b33134c09407ed8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:Y6LCGHXHZCYMPCSS765OJ43JPR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"URS: A Unified Neural Routing Solver for Cross-Problem Zero-Shot Generalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Canhong Yu, Changliang Zhou, Qingfu Zhang, Shunyu Yao, Xi Lin, Yu Zhou, Zhenkun Wang","submitted_at":"2025-09-27T17:11:09Z","abstract_excerpt":"Multi-task neural routing solvers have emerged as a promising paradigm for their ability to solve multiple vehicle routing problems (VRPs) using a single model. However, existing neural solvers typically rely on predefined problem constraints or require per-problem fine-tuning, which substantially limits their zero-shot generalization ability to unseen VRP variants. To address this critical bottleneck, we propose URS, a unified neural routing solver that achieves zero-shot generalization across a wide range of unseen VRPs with a single model. We propose a unified data representation (UDR) that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.23413","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/2509.23413/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-05-26T02:05:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1112zjmg04ALrPy2jZ5ty6ARVf9hpNLU8G2rAvSxIZG4SJmhS8ILa+BguZ5j4v8SmdBhxGyPK4FdGHQx96XLDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T08:07:10.796392Z"},"content_sha256":"9e30afd9c46fd4066ebec86961dea0381e32fc0bee573e3866e065b8493fbe03","schema_version":"1.0","event_id":"sha256:9e30afd9c46fd4066ebec86961dea0381e32fc0bee573e3866e065b8493fbe03"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y6LCGHXHZCYMPCSS765OJ43JPR/bundle.json","state_url":"https://pith.science/pith/Y6LCGHXHZCYMPCSS765OJ43JPR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y6LCGHXHZCYMPCSS765OJ43JPR/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-06-10T08:07:10Z","links":{"resolver":"https://pith.science/pith/Y6LCGHXHZCYMPCSS765OJ43JPR","bundle":"https://pith.science/pith/Y6LCGHXHZCYMPCSS765OJ43JPR/bundle.json","state":"https://pith.science/pith/Y6LCGHXHZCYMPCSS765OJ43JPR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y6LCGHXHZCYMPCSS765OJ43JPR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:Y6LCGHXHZCYMPCSS765OJ43JPR","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":"e1b6ee0f61185a9c3f7a1153b4195b295263d817c6de0a0349b9bc3521f66432","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-09-27T17:11:09Z","title_canon_sha256":"704321fcc71fb9467e13a86b150a07aeaa60159df9140d353ee6a3763fe3ae65"},"schema_version":"1.0","source":{"id":"2509.23413","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.23413","created_at":"2026-05-26T02:05:02Z"},{"alias_kind":"arxiv_version","alias_value":"2509.23413v2","created_at":"2026-05-26T02:05:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.23413","created_at":"2026-05-26T02:05:02Z"},{"alias_kind":"pith_short_12","alias_value":"Y6LCGHXHZCYM","created_at":"2026-05-26T02:05:02Z"},{"alias_kind":"pith_short_16","alias_value":"Y6LCGHXHZCYMPCSS","created_at":"2026-05-26T02:05:02Z"},{"alias_kind":"pith_short_8","alias_value":"Y6LCGHXH","created_at":"2026-05-26T02:05:02Z"}],"graph_snapshots":[{"event_id":"sha256:9e30afd9c46fd4066ebec86961dea0381e32fc0bee573e3866e065b8493fbe03","target":"graph","created_at":"2026-05-26T02:05:02Z","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/2509.23413/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-task neural routing solvers have emerged as a promising paradigm for their ability to solve multiple vehicle routing problems (VRPs) using a single model. However, existing neural solvers typically rely on predefined problem constraints or require per-problem fine-tuning, which substantially limits their zero-shot generalization ability to unseen VRP variants. To address this critical bottleneck, we propose URS, a unified neural routing solver that achieves zero-shot generalization across a wide range of unseen VRPs with a single model. We propose a unified data representation (UDR) that","authors_text":"Canhong Yu, Changliang Zhou, Qingfu Zhang, Shunyu Yao, Xi Lin, Yu Zhou, Zhenkun Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-09-27T17:11:09Z","title":"URS: A Unified Neural Routing Solver for Cross-Problem Zero-Shot Generalization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.23413","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:f70aadbcfbd61cd260050ddf23688136e9045c4cbf53590c1b33134c09407ed8","target":"record","created_at":"2026-05-26T02:05:02Z","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":"e1b6ee0f61185a9c3f7a1153b4195b295263d817c6de0a0349b9bc3521f66432","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-09-27T17:11:09Z","title_canon_sha256":"704321fcc71fb9467e13a86b150a07aeaa60159df9140d353ee6a3763fe3ae65"},"schema_version":"1.0","source":{"id":"2509.23413","kind":"arxiv","version":2}},"canonical_sha256":"c796231ee7c8b0c78a52ffbae4f3697c42c5e2ee217a4d30a1ad0044bb75de82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c796231ee7c8b0c78a52ffbae4f3697c42c5e2ee217a4d30a1ad0044bb75de82","first_computed_at":"2026-05-26T02:05:02.458951Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T02:05:02.458951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IPqDOgyRNDLOupKDNi1vGG1WfTHAOHEsug2mXDAIh1a78LYc2ZfXOeUbHwpnqFpz6I44+iXjiedL8TG75E4OAA==","signature_status":"signed_v1","signed_at":"2026-05-26T02:05:02.459691Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.23413","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f70aadbcfbd61cd260050ddf23688136e9045c4cbf53590c1b33134c09407ed8","sha256:9e30afd9c46fd4066ebec86961dea0381e32fc0bee573e3866e065b8493fbe03"],"state_sha256":"f6c13d7d569de952504942c0e23d555effdb5471dd2fa91398bb1f9fe244ec63"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ai61gdtmkHoGLmaDHR0Q4gYmXIZYf9Z9Hc73oH7HH2B9n22iPLkX7o+6o17G2879ub7MEogiZzAIv5sgie8sCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T08:07:10.800678Z","bundle_sha256":"a7684307dceb43be4037eafc2a55352c9a7f2412da95a5d3335416d01b3aab78"}}