{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RJV2PFI35EZFBOUTOABJ3FPOD3","short_pith_number":"pith:RJV2PFI3","schema_version":"1.0","canonical_sha256":"8a6ba7951be93250ba9370029d95ee1eedc60d48dc0005572555a21920d141be","source":{"kind":"arxiv","id":"2403.19561","version":3},"attestation_state":"computed","paper":{"title":"Self-Improved Learning for Scalable Neural Combinatorial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Fu Luo, Mingxuan Yuan, Qingfu Zhang, Xialiang Tong, Xi Lin, Zhenkun Wang","submitted_at":"2024-03-28T16:46:53Z","abstract_excerpt":"The end-to-end neural combinatorial optimization (NCO) method shows promising performance in solving complex combinatorial optimization problems without the need for expert design. However, existing methods struggle with large-scale problems, hindering their practical applicability. To overcome this limitation, this work proposes a novel Self-Improved Learning (SIL) method for better scalability of neural combinatorial optimization. Specifically, we develop an efficient self-improved mechanism that enables direct model training on large-scale problem instances without any labeled data. Powered"},"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":"2403.19561","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-03-28T16:46:53Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"14072cc5dd072788012bda8773e63cb0c74cf266d3c0da81023f2969c3fcdb72","abstract_canon_sha256":"babc5a8a297d417a532f41f887dcfdeff0db21aa98e2eca94fc62954da6c983a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:14:22.947866Z","signature_b64":"gPQTzMKBZ2bssoa5lmXX7MxenHG13Ivqz3TFcYII6pWGDIfUEZilNYLExHJ7s7Uv6Cz4p9XMw5KSzo0a4UmnAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a6ba7951be93250ba9370029d95ee1eedc60d48dc0005572555a21920d141be","last_reissued_at":"2026-07-05T08:14:22.947343Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:14:22.947343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-Improved Learning for Scalable Neural Combinatorial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Fu Luo, Mingxuan Yuan, Qingfu Zhang, Xialiang Tong, Xi Lin, Zhenkun Wang","submitted_at":"2024-03-28T16:46:53Z","abstract_excerpt":"The end-to-end neural combinatorial optimization (NCO) method shows promising performance in solving complex combinatorial optimization problems without the need for expert design. However, existing methods struggle with large-scale problems, hindering their practical applicability. To overcome this limitation, this work proposes a novel Self-Improved Learning (SIL) method for better scalability of neural combinatorial optimization. Specifically, we develop an efficient self-improved mechanism that enables direct model training on large-scale problem instances without any labeled data. Powered"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.19561","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/2403.19561/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":"2403.19561","created_at":"2026-07-05T08:14:22.947404+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.19561v3","created_at":"2026-07-05T08:14:22.947404+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.19561","created_at":"2026-07-05T08:14:22.947404+00:00"},{"alias_kind":"pith_short_12","alias_value":"RJV2PFI35EZF","created_at":"2026-07-05T08:14:22.947404+00:00"},{"alias_kind":"pith_short_16","alias_value":"RJV2PFI35EZFBOUT","created_at":"2026-07-05T08:14:22.947404+00:00"},{"alias_kind":"pith_short_8","alias_value":"RJV2PFI3","created_at":"2026-07-05T08:14:22.947404+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.26690","citing_title":"Self-Improvement Imitation with Biologically Guided Search for Protein Design Under Oracle Budgets","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2602.20730","citing_title":"Rethinking Efficiency in Neural Combinatorial Optimization: Batched Preference Optimization with Mamba","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RJV2PFI35EZFBOUTOABJ3FPOD3","json":"https://pith.science/pith/RJV2PFI35EZFBOUTOABJ3FPOD3.json","graph_json":"https://pith.science/api/pith-number/RJV2PFI35EZFBOUTOABJ3FPOD3/graph.json","events_json":"https://pith.science/api/pith-number/RJV2PFI35EZFBOUTOABJ3FPOD3/events.json","paper":"https://pith.science/paper/RJV2PFI3"},"agent_actions":{"view_html":"https://pith.science/pith/RJV2PFI35EZFBOUTOABJ3FPOD3","download_json":"https://pith.science/pith/RJV2PFI35EZFBOUTOABJ3FPOD3.json","view_paper":"https://pith.science/paper/RJV2PFI3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.19561&json=true","fetch_graph":"https://pith.science/api/pith-number/RJV2PFI35EZFBOUTOABJ3FPOD3/graph.json","fetch_events":"https://pith.science/api/pith-number/RJV2PFI35EZFBOUTOABJ3FPOD3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RJV2PFI35EZFBOUTOABJ3FPOD3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RJV2PFI35EZFBOUTOABJ3FPOD3/action/storage_attestation","attest_author":"https://pith.science/pith/RJV2PFI35EZFBOUTOABJ3FPOD3/action/author_attestation","sign_citation":"https://pith.science/pith/RJV2PFI35EZFBOUTOABJ3FPOD3/action/citation_signature","submit_replication":"https://pith.science/pith/RJV2PFI35EZFBOUTOABJ3FPOD3/action/replication_record"}},"created_at":"2026-07-05T08:14:22.947404+00:00","updated_at":"2026-07-05T08:14:22.947404+00:00"}