{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:PP37OLKSNMBGBO2NBNJZYJHWO7","short_pith_number":"pith:PP37OLKS","schema_version":"1.0","canonical_sha256":"7bf7f72d526b0260bb4d0b539c24f677f35530ed370fb39a970987cad771aa55","source":{"kind":"arxiv","id":"2002.08539","version":1},"attestation_state":"computed","paper":{"title":"Learn to Design the Heuristics for Vehicle Routing Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Ganzhong Luo, Lei Gao, Mingxiang Chen, Nuoyi Zhu, Qichang Chen, Zhixin Liu","submitted_at":"2020-02-20T02:39:02Z","abstract_excerpt":"This paper presents an approach to learn the local-search heuristics that iteratively improves the solution of Vehicle Routing Problem (VRP). A local-search heuristics is composed of a destroy operator that destructs a candidate solution, and a following repair operator that rebuilds the destructed one into a new one. The proposed neural network, as trained through actor-critic framework, consists of an encoder in form of a modified version of Graph Attention Network where node embeddings and edge embeddings are integrated, and a GRU-based decoder rendering a pair of destroy and repair operato"},"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":"2002.08539","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2020-02-20T02:39:02Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4e1d3fcb269ea95fceacf1cd050dba1a6f7377e692de76c7b169a38ba73fec60","abstract_canon_sha256":"a46f02cd3e33e7fb7e9023fb39cd3a5d9ae0cf8ea81938dd437c1ee955bfddd8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:42:35.927983Z","signature_b64":"xBpVSsNdo6JayavE3lY4q8dHw8k3kGIMj4go7YqP6QNQKorsmnBIzg61Lq5a55YTjOTSIwlAhznbCenYmjAFCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bf7f72d526b0260bb4d0b539c24f677f35530ed370fb39a970987cad771aa55","last_reissued_at":"2026-07-05T00:42:35.927578Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:42:35.927578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learn to Design the Heuristics for Vehicle Routing Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Ganzhong Luo, Lei Gao, Mingxiang Chen, Nuoyi Zhu, Qichang Chen, Zhixin Liu","submitted_at":"2020-02-20T02:39:02Z","abstract_excerpt":"This paper presents an approach to learn the local-search heuristics that iteratively improves the solution of Vehicle Routing Problem (VRP). A local-search heuristics is composed of a destroy operator that destructs a candidate solution, and a following repair operator that rebuilds the destructed one into a new one. The proposed neural network, as trained through actor-critic framework, consists of an encoder in form of a modified version of Graph Attention Network where node embeddings and edge embeddings are integrated, and a GRU-based decoder rendering a pair of destroy and repair operato"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.08539","kind":"arxiv","version":1},"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/2002.08539/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":"2002.08539","created_at":"2026-07-05T00:42:35.927636+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.08539v1","created_at":"2026-07-05T00:42:35.927636+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.08539","created_at":"2026-07-05T00:42:35.927636+00:00"},{"alias_kind":"pith_short_12","alias_value":"PP37OLKSNMBG","created_at":"2026-07-05T00:42:35.927636+00:00"},{"alias_kind":"pith_short_16","alias_value":"PP37OLKSNMBGBO2N","created_at":"2026-07-05T00:42:35.927636+00:00"},{"alias_kind":"pith_short_8","alias_value":"PP37OLKS","created_at":"2026-07-05T00:42:35.927636+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.03300","citing_title":"LRM-1B: Towards Large Routing Model","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PP37OLKSNMBGBO2NBNJZYJHWO7","json":"https://pith.science/pith/PP37OLKSNMBGBO2NBNJZYJHWO7.json","graph_json":"https://pith.science/api/pith-number/PP37OLKSNMBGBO2NBNJZYJHWO7/graph.json","events_json":"https://pith.science/api/pith-number/PP37OLKSNMBGBO2NBNJZYJHWO7/events.json","paper":"https://pith.science/paper/PP37OLKS"},"agent_actions":{"view_html":"https://pith.science/pith/PP37OLKSNMBGBO2NBNJZYJHWO7","download_json":"https://pith.science/pith/PP37OLKSNMBGBO2NBNJZYJHWO7.json","view_paper":"https://pith.science/paper/PP37OLKS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.08539&json=true","fetch_graph":"https://pith.science/api/pith-number/PP37OLKSNMBGBO2NBNJZYJHWO7/graph.json","fetch_events":"https://pith.science/api/pith-number/PP37OLKSNMBGBO2NBNJZYJHWO7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PP37OLKSNMBGBO2NBNJZYJHWO7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PP37OLKSNMBGBO2NBNJZYJHWO7/action/storage_attestation","attest_author":"https://pith.science/pith/PP37OLKSNMBGBO2NBNJZYJHWO7/action/author_attestation","sign_citation":"https://pith.science/pith/PP37OLKSNMBGBO2NBNJZYJHWO7/action/citation_signature","submit_replication":"https://pith.science/pith/PP37OLKSNMBGBO2NBNJZYJHWO7/action/replication_record"}},"created_at":"2026-07-05T00:42:35.927636+00:00","updated_at":"2026-07-05T00:42:35.927636+00:00"}