{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RZSMZQ5LAQHMAQVQMARF42IOA5","short_pith_number":"pith:RZSMZQ5L","schema_version":"1.0","canonical_sha256":"8e64ccc3ab040ec042b060225e690e075ba12c9c32c8eb0f524f46a1a1a451a1","source":{"kind":"arxiv","id":"2508.16171","version":1},"attestation_state":"computed","paper":{"title":"SPL-LNS: Sampling-Enhanced Large Neighborhood Search for Solving Integer Linear Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Shengyu Feng, Yiming Yang, Zhiqing Sun","submitted_at":"2025-08-22T07:49:33Z","abstract_excerpt":"Large Neighborhood Search (LNS) is a common heuristic in combinatorial optimization that iteratively searches over a large neighborhood of the current solution for a better one. Recently, neural network-based LNS solvers have achieved great success in solving Integer Linear Programs (ILPs) by learning to greedily predict the locally optimal solution for the next neighborhood proposal. However, this greedy approach raises two key concerns: (1) to what extent this greedy proposal suffers from local optima, and (2) how can we effectively improve its sample efficiency in the long run. To address t"},"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":"2508.16171","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-22T07:49:33Z","cross_cats_sorted":[],"title_canon_sha256":"0b189920179227d26fa63ecc5ee88e779e1aa6b13533fdbd168bb81cc9f5135d","abstract_canon_sha256":"71d1d14875b243bdd7f5553396536347c65a79df2313c013d064c1f5db1206df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:57:43.452110Z","signature_b64":"sZeCzMQRTUPzEQwPA19P3TPZJDICjL8PekaU57g8KrYmZOJOVnGGbB+B2k1badr2DTsj/AZZWsT8cSJhnSGrCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e64ccc3ab040ec042b060225e690e075ba12c9c32c8eb0f524f46a1a1a451a1","last_reissued_at":"2026-07-05T11:57:43.451643Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:57:43.451643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SPL-LNS: Sampling-Enhanced Large Neighborhood Search for Solving Integer Linear Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Shengyu Feng, Yiming Yang, Zhiqing Sun","submitted_at":"2025-08-22T07:49:33Z","abstract_excerpt":"Large Neighborhood Search (LNS) is a common heuristic in combinatorial optimization that iteratively searches over a large neighborhood of the current solution for a better one. Recently, neural network-based LNS solvers have achieved great success in solving Integer Linear Programs (ILPs) by learning to greedily predict the locally optimal solution for the next neighborhood proposal. However, this greedy approach raises two key concerns: (1) to what extent this greedy proposal suffers from local optima, and (2) how can we effectively improve its sample efficiency in the long run. To address t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.16171","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/2508.16171/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":"2508.16171","created_at":"2026-07-05T11:57:43.451699+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.16171v1","created_at":"2026-07-05T11:57:43.451699+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.16171","created_at":"2026-07-05T11:57:43.451699+00:00"},{"alias_kind":"pith_short_12","alias_value":"RZSMZQ5LAQHM","created_at":"2026-07-05T11:57:43.451699+00:00"},{"alias_kind":"pith_short_16","alias_value":"RZSMZQ5LAQHMAQVQ","created_at":"2026-07-05T11:57:43.451699+00:00"},{"alias_kind":"pith_short_8","alias_value":"RZSMZQ5L","created_at":"2026-07-05T11:57:43.451699+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/RZSMZQ5LAQHMAQVQMARF42IOA5","json":"https://pith.science/pith/RZSMZQ5LAQHMAQVQMARF42IOA5.json","graph_json":"https://pith.science/api/pith-number/RZSMZQ5LAQHMAQVQMARF42IOA5/graph.json","events_json":"https://pith.science/api/pith-number/RZSMZQ5LAQHMAQVQMARF42IOA5/events.json","paper":"https://pith.science/paper/RZSMZQ5L"},"agent_actions":{"view_html":"https://pith.science/pith/RZSMZQ5LAQHMAQVQMARF42IOA5","download_json":"https://pith.science/pith/RZSMZQ5LAQHMAQVQMARF42IOA5.json","view_paper":"https://pith.science/paper/RZSMZQ5L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.16171&json=true","fetch_graph":"https://pith.science/api/pith-number/RZSMZQ5LAQHMAQVQMARF42IOA5/graph.json","fetch_events":"https://pith.science/api/pith-number/RZSMZQ5LAQHMAQVQMARF42IOA5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RZSMZQ5LAQHMAQVQMARF42IOA5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RZSMZQ5LAQHMAQVQMARF42IOA5/action/storage_attestation","attest_author":"https://pith.science/pith/RZSMZQ5LAQHMAQVQMARF42IOA5/action/author_attestation","sign_citation":"https://pith.science/pith/RZSMZQ5LAQHMAQVQMARF42IOA5/action/citation_signature","submit_replication":"https://pith.science/pith/RZSMZQ5LAQHMAQVQMARF42IOA5/action/replication_record"}},"created_at":"2026-07-05T11:57:43.451699+00:00","updated_at":"2026-07-05T11:57:43.451699+00:00"}