{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6APW4PDHLLN7FWOCQMYQVA4VHX","short_pith_number":"pith:6APW4PDH","schema_version":"1.0","canonical_sha256":"f01f6e3c675adbf2d9c283310a83953dd980728165ae84c8ea165fc2a067feb7","source":{"kind":"arxiv","id":"2406.06652","version":3},"attestation_state":"computed","paper":{"title":"Improving Generalization of Neural Vehicle Routing Problem Solvers Through the Lens of Model Architecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Boyang Li, Di Wang, Liupu Wang, Wei Du, Xuan Wu, You Zhou, Yubin Xiao, Yuesong Wu","submitted_at":"2024-06-10T09:03:17Z","abstract_excerpt":"Neural models produce promising results when solving Vehicle Routing Problems (VRPs), but often fall short in generalization. Recent attempts to enhance model generalization often incur unnecessarily large training cost or cannot be directly applied to other models solving different VRP variants. To address these issues, we take a novel perspective on model architecture in this study. Specifically, we propose a plug-and-play Entropy-based Scaling Factor (ESF) and a Distribution-Specific (DS) decoder to enhance the size and distribution generalization, respectively. ESF adjusts the attention we"},"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":"2406.06652","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-10T09:03:17Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"9c6e211508101d5285a60920ef6fdf041f42c07ed96a7eeb4e0e8e87373592cf","abstract_canon_sha256":"dbdcc80f3837fb919448e661d7d87ee27491aeb211b5f9bdcd938d8b047a753d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:33:34.522260Z","signature_b64":"xsslM+9qt/EKcGw7Cvll/IUeGi3iLdzT2wU+6gm954OfKZX9qslgI1VGdO3CgYk6NgwSQ12oscN+Dbd9jDmQCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f01f6e3c675adbf2d9c283310a83953dd980728165ae84c8ea165fc2a067feb7","last_reissued_at":"2026-07-05T10:33:34.521466Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:33:34.521466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving Generalization of Neural Vehicle Routing Problem Solvers Through the Lens of Model Architecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Boyang Li, Di Wang, Liupu Wang, Wei Du, Xuan Wu, You Zhou, Yubin Xiao, Yuesong Wu","submitted_at":"2024-06-10T09:03:17Z","abstract_excerpt":"Neural models produce promising results when solving Vehicle Routing Problems (VRPs), but often fall short in generalization. Recent attempts to enhance model generalization often incur unnecessarily large training cost or cannot be directly applied to other models solving different VRP variants. To address these issues, we take a novel perspective on model architecture in this study. Specifically, we propose a plug-and-play Entropy-based Scaling Factor (ESF) and a Distribution-Specific (DS) decoder to enhance the size and distribution generalization, respectively. ESF adjusts the attention we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.06652","kind":"arxiv","version":3},"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/2406.06652/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":"2406.06652","created_at":"2026-07-05T10:33:34.521527+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.06652v3","created_at":"2026-07-05T10:33:34.521527+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.06652","created_at":"2026-07-05T10:33:34.521527+00:00"},{"alias_kind":"pith_short_12","alias_value":"6APW4PDHLLN7","created_at":"2026-07-05T10:33:34.521527+00:00"},{"alias_kind":"pith_short_16","alias_value":"6APW4PDHLLN7FWOC","created_at":"2026-07-05T10:33:34.521527+00:00"},{"alias_kind":"pith_short_8","alias_value":"6APW4PDH","created_at":"2026-07-05T10:33:34.521527+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.13767","citing_title":"An Efficient Diffusion-based Non-Autoregressive Solver for Traveling Salesman Problem","ref_index":54,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6APW4PDHLLN7FWOCQMYQVA4VHX","json":"https://pith.science/pith/6APW4PDHLLN7FWOCQMYQVA4VHX.json","graph_json":"https://pith.science/api/pith-number/6APW4PDHLLN7FWOCQMYQVA4VHX/graph.json","events_json":"https://pith.science/api/pith-number/6APW4PDHLLN7FWOCQMYQVA4VHX/events.json","paper":"https://pith.science/paper/6APW4PDH"},"agent_actions":{"view_html":"https://pith.science/pith/6APW4PDHLLN7FWOCQMYQVA4VHX","download_json":"https://pith.science/pith/6APW4PDHLLN7FWOCQMYQVA4VHX.json","view_paper":"https://pith.science/paper/6APW4PDH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.06652&json=true","fetch_graph":"https://pith.science/api/pith-number/6APW4PDHLLN7FWOCQMYQVA4VHX/graph.json","fetch_events":"https://pith.science/api/pith-number/6APW4PDHLLN7FWOCQMYQVA4VHX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6APW4PDHLLN7FWOCQMYQVA4VHX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6APW4PDHLLN7FWOCQMYQVA4VHX/action/storage_attestation","attest_author":"https://pith.science/pith/6APW4PDHLLN7FWOCQMYQVA4VHX/action/author_attestation","sign_citation":"https://pith.science/pith/6APW4PDHLLN7FWOCQMYQVA4VHX/action/citation_signature","submit_replication":"https://pith.science/pith/6APW4PDHLLN7FWOCQMYQVA4VHX/action/replication_record"}},"created_at":"2026-07-05T10:33:34.521527+00:00","updated_at":"2026-07-05T10:33:34.521527+00:00"}