{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YQAK24MA376SAVPH2A2YXZBXCK","short_pith_number":"pith:YQAK24MA","schema_version":"1.0","canonical_sha256":"c400ad7180dffd2055e7d0358be437129408e542cce9eab83d380acd22c3af29","source":{"kind":"arxiv","id":"2606.02294","version":1},"attestation_state":"computed","paper":{"title":"Regularized Large Neighborhood Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Axel Parmentier, Germain Vivier-Ardisson, Laurent Demonet, Mathieu Blondel","submitted_at":"2026-06-01T14:16:18Z","abstract_excerpt":"Operations research practitioners typically tackle NP-hard combinatorial problems using large neighborhood search (LNS), a scalable heuristic that iteratively refines a current solution by locally re-optimizing subsets of its variables. In contrast, most existing approaches for integrating combinatorial optimization layers into neural networks still assume access to an exact global solution, which is computationally intractable. We bridge this gap by introducing regularized LNS (RLNS). By regularizing or perturbing local subproblems, we turn the LNS heuristic into an efficient MCMC sampler ove"},"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":"2606.02294","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-01T14:16:18Z","cross_cats_sorted":[],"title_canon_sha256":"7ec5983ccfe84012e1bbf5b440b185e610346ce5712e51ca6e4fa50ca669b79b","abstract_canon_sha256":"e1a59d82df72296b86ba4a482305d1c6694a0144ecd70df03192dcceb3a6fcd6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T03:04:55.244811Z","signature_b64":"iqBNHVpJfAXcijnmVkXffok5jZIYy6aJNLAPkbNqCKOGPM6Cb1uIlWXXT8LNbEdRCmBP8zqvDK7lA8AWbuO/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c400ad7180dffd2055e7d0358be437129408e542cce9eab83d380acd22c3af29","last_reissued_at":"2026-06-02T03:04:55.244473Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T03:04:55.244473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regularized Large Neighborhood Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Axel Parmentier, Germain Vivier-Ardisson, Laurent Demonet, Mathieu Blondel","submitted_at":"2026-06-01T14:16:18Z","abstract_excerpt":"Operations research practitioners typically tackle NP-hard combinatorial problems using large neighborhood search (LNS), a scalable heuristic that iteratively refines a current solution by locally re-optimizing subsets of its variables. In contrast, most existing approaches for integrating combinatorial optimization layers into neural networks still assume access to an exact global solution, which is computationally intractable. We bridge this gap by introducing regularized LNS (RLNS). By regularizing or perturbing local subproblems, we turn the LNS heuristic into an efficient MCMC sampler ove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02294","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/2606.02294/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":"2606.02294","created_at":"2026-06-02T03:04:55.244529+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.02294v1","created_at":"2026-06-02T03:04:55.244529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02294","created_at":"2026-06-02T03:04:55.244529+00:00"},{"alias_kind":"pith_short_12","alias_value":"YQAK24MA376S","created_at":"2026-06-02T03:04:55.244529+00:00"},{"alias_kind":"pith_short_16","alias_value":"YQAK24MA376SAVPH","created_at":"2026-06-02T03:04:55.244529+00:00"},{"alias_kind":"pith_short_8","alias_value":"YQAK24MA","created_at":"2026-06-02T03:04:55.244529+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/YQAK24MA376SAVPH2A2YXZBXCK","json":"https://pith.science/pith/YQAK24MA376SAVPH2A2YXZBXCK.json","graph_json":"https://pith.science/api/pith-number/YQAK24MA376SAVPH2A2YXZBXCK/graph.json","events_json":"https://pith.science/api/pith-number/YQAK24MA376SAVPH2A2YXZBXCK/events.json","paper":"https://pith.science/paper/YQAK24MA"},"agent_actions":{"view_html":"https://pith.science/pith/YQAK24MA376SAVPH2A2YXZBXCK","download_json":"https://pith.science/pith/YQAK24MA376SAVPH2A2YXZBXCK.json","view_paper":"https://pith.science/paper/YQAK24MA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.02294&json=true","fetch_graph":"https://pith.science/api/pith-number/YQAK24MA376SAVPH2A2YXZBXCK/graph.json","fetch_events":"https://pith.science/api/pith-number/YQAK24MA376SAVPH2A2YXZBXCK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YQAK24MA376SAVPH2A2YXZBXCK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YQAK24MA376SAVPH2A2YXZBXCK/action/storage_attestation","attest_author":"https://pith.science/pith/YQAK24MA376SAVPH2A2YXZBXCK/action/author_attestation","sign_citation":"https://pith.science/pith/YQAK24MA376SAVPH2A2YXZBXCK/action/citation_signature","submit_replication":"https://pith.science/pith/YQAK24MA376SAVPH2A2YXZBXCK/action/replication_record"}},"created_at":"2026-06-02T03:04:55.244529+00:00","updated_at":"2026-06-02T03:04:55.244529+00:00"}