{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:LC7QOWMWETS4DMTDGXWH4U3VBH","short_pith_number":"pith:LC7QOWMW","schema_version":"1.0","canonical_sha256":"58bf07599624e5c1b26335ec7e537509de278574bcf6131da3ad83113926c3da","source":{"kind":"arxiv","id":"2607.05169","version":1},"attestation_state":"computed","paper":{"title":"Ising-Machine-Assisted Large Neighborhood Search with Flexibly Tunable Subproblem Size","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"Koshiro Fujimoto, Masashi Yamashita, Shu Tanaka","submitted_at":"2026-07-06T14:49:30Z","abstract_excerpt":"Ising machines are heuristic solvers for combinatorial optimization, but their solution quality can degrade when large-scale constrained problems are solved directly. Ising-machine-assisted large neighborhood search (LNS) instead repeatedly updates a feasible current solution by solving smaller subproblems. An existing feasibility-preserving method for the vehicle routing problem (VRP) re-optimizes the entire routes of selected vehicles and thus cannot adjust the subproblem size finely. We propose LNS-VT, which introduces the number of consecutive steps re-optimized per vehicle as a parameter "},"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":"2607.05169","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2026-07-06T14:49:30Z","cross_cats_sorted":[],"title_canon_sha256":"c56dc3b9b33c24f862ef3f67e6429c85b8ec14c18bfbb08b2d32e90b16f154d8","abstract_canon_sha256":"4d50e6fb47532e56d42b5a2df8543186c213a281783194ac028b1bcc285f5fc3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T03:19:18.532634Z","signature_b64":"/uAMXe6DV0Gnar2fqPNuQOnv9xQTVoWmCMMs2Hd1N63LOOnyzl2c86RPdbwfh7BrmwAvfYzde2ZN2areh1juCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58bf07599624e5c1b26335ec7e537509de278574bcf6131da3ad83113926c3da","last_reissued_at":"2026-07-07T03:19:18.532212Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T03:19:18.532212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ising-Machine-Assisted Large Neighborhood Search with Flexibly Tunable Subproblem Size","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"Koshiro Fujimoto, Masashi Yamashita, Shu Tanaka","submitted_at":"2026-07-06T14:49:30Z","abstract_excerpt":"Ising machines are heuristic solvers for combinatorial optimization, but their solution quality can degrade when large-scale constrained problems are solved directly. Ising-machine-assisted large neighborhood search (LNS) instead repeatedly updates a feasible current solution by solving smaller subproblems. An existing feasibility-preserving method for the vehicle routing problem (VRP) re-optimizes the entire routes of selected vehicles and thus cannot adjust the subproblem size finely. We propose LNS-VT, which introduces the number of consecutive steps re-optimized per vehicle as a parameter "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.05169","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/2607.05169/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":"2607.05169","created_at":"2026-07-07T03:19:18.532269+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.05169v1","created_at":"2026-07-07T03:19:18.532269+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.05169","created_at":"2026-07-07T03:19:18.532269+00:00"},{"alias_kind":"pith_short_12","alias_value":"LC7QOWMWETS4","created_at":"2026-07-07T03:19:18.532269+00:00"},{"alias_kind":"pith_short_16","alias_value":"LC7QOWMWETS4DMTD","created_at":"2026-07-07T03:19:18.532269+00:00"},{"alias_kind":"pith_short_8","alias_value":"LC7QOWMW","created_at":"2026-07-07T03:19:18.532269+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/LC7QOWMWETS4DMTDGXWH4U3VBH","json":"https://pith.science/pith/LC7QOWMWETS4DMTDGXWH4U3VBH.json","graph_json":"https://pith.science/api/pith-number/LC7QOWMWETS4DMTDGXWH4U3VBH/graph.json","events_json":"https://pith.science/api/pith-number/LC7QOWMWETS4DMTDGXWH4U3VBH/events.json","paper":"https://pith.science/paper/LC7QOWMW"},"agent_actions":{"view_html":"https://pith.science/pith/LC7QOWMWETS4DMTDGXWH4U3VBH","download_json":"https://pith.science/pith/LC7QOWMWETS4DMTDGXWH4U3VBH.json","view_paper":"https://pith.science/paper/LC7QOWMW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.05169&json=true","fetch_graph":"https://pith.science/api/pith-number/LC7QOWMWETS4DMTDGXWH4U3VBH/graph.json","fetch_events":"https://pith.science/api/pith-number/LC7QOWMWETS4DMTDGXWH4U3VBH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LC7QOWMWETS4DMTDGXWH4U3VBH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LC7QOWMWETS4DMTDGXWH4U3VBH/action/storage_attestation","attest_author":"https://pith.science/pith/LC7QOWMWETS4DMTDGXWH4U3VBH/action/author_attestation","sign_citation":"https://pith.science/pith/LC7QOWMWETS4DMTDGXWH4U3VBH/action/citation_signature","submit_replication":"https://pith.science/pith/LC7QOWMWETS4DMTDGXWH4U3VBH/action/replication_record"}},"created_at":"2026-07-07T03:19:18.532269+00:00","updated_at":"2026-07-07T03:19:18.532269+00:00"}