{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:63GATVFQXUEKKN2TYMJ42PINI4","short_pith_number":"pith:63GATVFQ","schema_version":"1.0","canonical_sha256":"f6cc09d4b0bd08a53753c313cd3d0d472dfb77af233d8c4198018661ad080a59","source":{"kind":"arxiv","id":"2503.03137","version":3},"attestation_state":"computed","paper":{"title":"Learning to Reduce Search Space for Generalizable Neural Routing Solver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"cs.AI","authors_text":"Changliang Zhou, Qingfu Zhang, Xi Lin, Zhenkun Wang","submitted_at":"2025-03-05T03:25:09Z","abstract_excerpt":"Constructive neural combinatorial optimization (NCO) offers a promising paradigm for solving vehicle routing problems (VRPs) by directly learning to construct approximate optimal solutions, thereby reducing reliance on expert knowledge for algorithm design. However, scaling these methods to handle large-scale instances remains challenging due to high computational complexity. While recent dynamic search space reduction (SSR) methods can improve inference efficiency through geometric distance-based pruning, they often struggle on complex instances with non-uniform distributions or when optimal "},"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":"2503.03137","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-03-05T03:25:09Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"f2412d057d85c524cc4344c80cb76a1070ef75bc1a08213b817b08545c549d91","abstract_canon_sha256":"3108ab9ebbbfb767144ce1961b04b46f747b945c5a4b5f6a264e1d90f874c3bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T03:05:03.339624Z","signature_b64":"BxKt5n0xxCVcufi4AE7OxB/x2kYCIsCUR8qVFP5z/qZjAgN1gLny1UUoZLGKd6Njq3QM42nTpH69iO9fP+b7Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6cc09d4b0bd08a53753c313cd3d0d472dfb77af233d8c4198018661ad080a59","last_reissued_at":"2026-06-02T03:05:03.339110Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T03:05:03.339110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Reduce Search Space for Generalizable Neural Routing Solver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"cs.AI","authors_text":"Changliang Zhou, Qingfu Zhang, Xi Lin, Zhenkun Wang","submitted_at":"2025-03-05T03:25:09Z","abstract_excerpt":"Constructive neural combinatorial optimization (NCO) offers a promising paradigm for solving vehicle routing problems (VRPs) by directly learning to construct approximate optimal solutions, thereby reducing reliance on expert knowledge for algorithm design. However, scaling these methods to handle large-scale instances remains challenging due to high computational complexity. While recent dynamic search space reduction (SSR) methods can improve inference efficiency through geometric distance-based pruning, they often struggle on complex instances with non-uniform distributions or when optimal "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.03137","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/2503.03137/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":"2503.03137","created_at":"2026-06-02T03:05:03.339164+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.03137v3","created_at":"2026-06-02T03:05:03.339164+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.03137","created_at":"2026-06-02T03:05:03.339164+00:00"},{"alias_kind":"pith_short_12","alias_value":"63GATVFQXUEK","created_at":"2026-06-02T03:05:03.339164+00:00"},{"alias_kind":"pith_short_16","alias_value":"63GATVFQXUEKKN2T","created_at":"2026-06-02T03:05:03.339164+00:00"},{"alias_kind":"pith_short_8","alias_value":"63GATVFQ","created_at":"2026-06-02T03:05:03.339164+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2601.22509","citing_title":"Keep Rehearsing and Refining: Lifelong Learning Vehicle Routing under Continually Drifting Tasks","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"2605.10122","citing_title":"Rethinking Constraint Awareness for Efficient State Embedding of Neural Routing Solver","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/63GATVFQXUEKKN2TYMJ42PINI4","json":"https://pith.science/pith/63GATVFQXUEKKN2TYMJ42PINI4.json","graph_json":"https://pith.science/api/pith-number/63GATVFQXUEKKN2TYMJ42PINI4/graph.json","events_json":"https://pith.science/api/pith-number/63GATVFQXUEKKN2TYMJ42PINI4/events.json","paper":"https://pith.science/paper/63GATVFQ"},"agent_actions":{"view_html":"https://pith.science/pith/63GATVFQXUEKKN2TYMJ42PINI4","download_json":"https://pith.science/pith/63GATVFQXUEKKN2TYMJ42PINI4.json","view_paper":"https://pith.science/paper/63GATVFQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.03137&json=true","fetch_graph":"https://pith.science/api/pith-number/63GATVFQXUEKKN2TYMJ42PINI4/graph.json","fetch_events":"https://pith.science/api/pith-number/63GATVFQXUEKKN2TYMJ42PINI4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/63GATVFQXUEKKN2TYMJ42PINI4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/63GATVFQXUEKKN2TYMJ42PINI4/action/storage_attestation","attest_author":"https://pith.science/pith/63GATVFQXUEKKN2TYMJ42PINI4/action/author_attestation","sign_citation":"https://pith.science/pith/63GATVFQXUEKKN2TYMJ42PINI4/action/citation_signature","submit_replication":"https://pith.science/pith/63GATVFQXUEKKN2TYMJ42PINI4/action/replication_record"}},"created_at":"2026-06-02T03:05:03.339164+00:00","updated_at":"2026-06-02T03:05:03.339164+00:00"}