{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:YSGZ2RFBWNQGXQWSBX3JVWYOW6","short_pith_number":"pith:YSGZ2RFB","schema_version":"1.0","canonical_sha256":"c48d9d44a1b3606bc2d20df69adb0eb79580d54396f6637464f2fcc0ac2922fd","source":{"kind":"arxiv","id":"2310.07985","version":2},"attestation_state":"computed","paper":{"title":"Neural Combinatorial Optimization with Heavy Decoder: Toward Large Scale Generalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","math.OC"],"primary_cat":"cs.LG","authors_text":"Fei Liu, Fu Luo, Qingfu Zhang, Xi Lin, Zhenkun Wang","submitted_at":"2023-10-12T02:18:50Z","abstract_excerpt":"Neural combinatorial optimization (NCO) is a promising learning-based approach for solving challenging combinatorial optimization problems without specialized algorithm design by experts. However, most constructive NCO methods cannot solve problems with large-scale instance sizes, which significantly diminishes their usefulness for real-world applications. In this work, we propose a novel Light Encoder and Heavy Decoder (LEHD) model with a strong generalization ability to address this critical issue. The LEHD model can learn to dynamically capture the relationships between all available nodes "},"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":"2310.07985","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-12T02:18:50Z","cross_cats_sorted":["cs.NE","math.OC"],"title_canon_sha256":"c86ef5057160c102c22e8910dc0953b3927bdc39320d262d8a473a2c64fa36e1","abstract_canon_sha256":"8d9adfced1e95f65278921d7efcf87d37fa7c81ab4b497fa5d1bb2efe467c6bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:33:20.757280Z","signature_b64":"rC1IPl/Qs5o5BY7UJ5dqfnhcnxLuAoJZ7JPDeX2AAjXW/SeNxksmMxk9Cin4gh1TDwNTOgyoQ5w4T9m4gsu2CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c48d9d44a1b3606bc2d20df69adb0eb79580d54396f6637464f2fcc0ac2922fd","last_reissued_at":"2026-07-05T07:33:20.756834Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:33:20.756834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Combinatorial Optimization with Heavy Decoder: Toward Large Scale Generalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","math.OC"],"primary_cat":"cs.LG","authors_text":"Fei Liu, Fu Luo, Qingfu Zhang, Xi Lin, Zhenkun Wang","submitted_at":"2023-10-12T02:18:50Z","abstract_excerpt":"Neural combinatorial optimization (NCO) is a promising learning-based approach for solving challenging combinatorial optimization problems without specialized algorithm design by experts. However, most constructive NCO methods cannot solve problems with large-scale instance sizes, which significantly diminishes their usefulness for real-world applications. In this work, we propose a novel Light Encoder and Heavy Decoder (LEHD) model with a strong generalization ability to address this critical issue. The LEHD model can learn to dynamically capture the relationships between all available nodes "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.07985","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/2310.07985/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":"2310.07985","created_at":"2026-07-05T07:33:20.756896+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.07985v2","created_at":"2026-07-05T07:33:20.756896+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.07985","created_at":"2026-07-05T07:33:20.756896+00:00"},{"alias_kind":"pith_short_12","alias_value":"YSGZ2RFBWNQG","created_at":"2026-07-05T07:33:20.756896+00:00"},{"alias_kind":"pith_short_16","alias_value":"YSGZ2RFBWNQGXQWS","created_at":"2026-07-05T07:33:20.756896+00:00"},{"alias_kind":"pith_short_8","alias_value":"YSGZ2RFB","created_at":"2026-07-05T07:33:20.756896+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YSGZ2RFBWNQGXQWSBX3JVWYOW6","json":"https://pith.science/pith/YSGZ2RFBWNQGXQWSBX3JVWYOW6.json","graph_json":"https://pith.science/api/pith-number/YSGZ2RFBWNQGXQWSBX3JVWYOW6/graph.json","events_json":"https://pith.science/api/pith-number/YSGZ2RFBWNQGXQWSBX3JVWYOW6/events.json","paper":"https://pith.science/paper/YSGZ2RFB"},"agent_actions":{"view_html":"https://pith.science/pith/YSGZ2RFBWNQGXQWSBX3JVWYOW6","download_json":"https://pith.science/pith/YSGZ2RFBWNQGXQWSBX3JVWYOW6.json","view_paper":"https://pith.science/paper/YSGZ2RFB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.07985&json=true","fetch_graph":"https://pith.science/api/pith-number/YSGZ2RFBWNQGXQWSBX3JVWYOW6/graph.json","fetch_events":"https://pith.science/api/pith-number/YSGZ2RFBWNQGXQWSBX3JVWYOW6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YSGZ2RFBWNQGXQWSBX3JVWYOW6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YSGZ2RFBWNQGXQWSBX3JVWYOW6/action/storage_attestation","attest_author":"https://pith.science/pith/YSGZ2RFBWNQGXQWSBX3JVWYOW6/action/author_attestation","sign_citation":"https://pith.science/pith/YSGZ2RFBWNQGXQWSBX3JVWYOW6/action/citation_signature","submit_replication":"https://pith.science/pith/YSGZ2RFBWNQGXQWSBX3JVWYOW6/action/replication_record"}},"created_at":"2026-07-05T07:33:20.756896+00:00","updated_at":"2026-07-05T07:33:20.756896+00:00"}