{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KRCSOUDBXQVB35HD2ATD7PSOLZ","short_pith_number":"pith:KRCSOUDB","schema_version":"1.0","canonical_sha256":"5445275061bc2a1df4e3d0263fbe4e5e639b9dda7aa7657776e8bcd97eb7a2f5","source":{"kind":"arxiv","id":"2405.01906","version":2},"attestation_state":"computed","paper":{"title":"Instance-Conditioned Adaptation for Large-scale Generalization of 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, Mingxuan Yuan, Qingfu Zhang, Xialiang Tong, Xi Lin, Zhenkun Wang","submitted_at":"2024-05-03T08:00:19Z","abstract_excerpt":"The neural combinatorial optimization (NCO) method has shown great potential for solving routing problems of intelligent transportation systems without requiring expert knowledge. However, existing constructive NCO methods still struggle to solve large-scale instances, which significantly limits their application prospects. To address these crucial shortcomings, this work proposes a novel Instance-Conditioned Adaptation Model (ICAM) for better large-scale generalization of neural routing solvers. In particular, we design a simple yet efficient instance-conditioned adaptation function to signif"},"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":"2405.01906","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-05-03T08:00:19Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"885a187658b3bf37c7ea7b37bec8fdb8e8a310b922ff6bcf46fc5f14a8e8f17e","abstract_canon_sha256":"00e85be6df56b929af21388f0b4e050e823b010202a2ed03fe74b6d21f67b970"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:04:58.521782Z","signature_b64":"YPziVqRaFYhLtwCrRwFwpcHvrwUN0Q7ePq0YWs3rHh95iZ+YlatrCngHo8hYbeYmKKpQ9CwfjEoI86/rjFHJBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5445275061bc2a1df4e3d0263fbe4e5e639b9dda7aa7657776e8bcd97eb7a2f5","last_reissued_at":"2026-05-26T02:04:58.521191Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:04:58.521191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Instance-Conditioned Adaptation for Large-scale Generalization of 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, Mingxuan Yuan, Qingfu Zhang, Xialiang Tong, Xi Lin, Zhenkun Wang","submitted_at":"2024-05-03T08:00:19Z","abstract_excerpt":"The neural combinatorial optimization (NCO) method has shown great potential for solving routing problems of intelligent transportation systems without requiring expert knowledge. However, existing constructive NCO methods still struggle to solve large-scale instances, which significantly limits their application prospects. To address these crucial shortcomings, this work proposes a novel Instance-Conditioned Adaptation Model (ICAM) for better large-scale generalization of neural routing solvers. In particular, we design a simple yet efficient instance-conditioned adaptation function to signif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.01906","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/2405.01906/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":"2405.01906","created_at":"2026-05-26T02:04:58.521279+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.01906v2","created_at":"2026-05-26T02:04:58.521279+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.01906","created_at":"2026-05-26T02:04:58.521279+00:00"},{"alias_kind":"pith_short_12","alias_value":"KRCSOUDBXQVB","created_at":"2026-05-26T02:04:58.521279+00:00"},{"alias_kind":"pith_short_16","alias_value":"KRCSOUDBXQVB35HD","created_at":"2026-05-26T02:04:58.521279+00:00"},{"alias_kind":"pith_short_8","alias_value":"KRCSOUDB","created_at":"2026-05-26T02:04:58.521279+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.02136","citing_title":"Edge-aware Decoding for Neural Asymmetric Routing","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KRCSOUDBXQVB35HD2ATD7PSOLZ","json":"https://pith.science/pith/KRCSOUDBXQVB35HD2ATD7PSOLZ.json","graph_json":"https://pith.science/api/pith-number/KRCSOUDBXQVB35HD2ATD7PSOLZ/graph.json","events_json":"https://pith.science/api/pith-number/KRCSOUDBXQVB35HD2ATD7PSOLZ/events.json","paper":"https://pith.science/paper/KRCSOUDB"},"agent_actions":{"view_html":"https://pith.science/pith/KRCSOUDBXQVB35HD2ATD7PSOLZ","download_json":"https://pith.science/pith/KRCSOUDBXQVB35HD2ATD7PSOLZ.json","view_paper":"https://pith.science/paper/KRCSOUDB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.01906&json=true","fetch_graph":"https://pith.science/api/pith-number/KRCSOUDBXQVB35HD2ATD7PSOLZ/graph.json","fetch_events":"https://pith.science/api/pith-number/KRCSOUDBXQVB35HD2ATD7PSOLZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KRCSOUDBXQVB35HD2ATD7PSOLZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KRCSOUDBXQVB35HD2ATD7PSOLZ/action/storage_attestation","attest_author":"https://pith.science/pith/KRCSOUDBXQVB35HD2ATD7PSOLZ/action/author_attestation","sign_citation":"https://pith.science/pith/KRCSOUDBXQVB35HD2ATD7PSOLZ/action/citation_signature","submit_replication":"https://pith.science/pith/KRCSOUDBXQVB35HD2ATD7PSOLZ/action/replication_record"}},"created_at":"2026-05-26T02:04:58.521279+00:00","updated_at":"2026-05-26T02:04:58.521279+00:00"}