{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TDFOUMX64FHOX4QPEPIBBSIPPP","short_pith_number":"pith:TDFOUMX6","schema_version":"1.0","canonical_sha256":"98caea32fee14eebf20f23d010c90f7bc708632226f6b53521fb9039714ffba8","source":{"kind":"arxiv","id":"2508.06736","version":1},"attestation_state":"computed","paper":{"title":"ParBalans: Parallel Multi-Armed Bandits-based Adaptive Large Neighborhood Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Alican Yilmaz, Bistra Dilkina, Junyang Cai, Serdar Kadioglu","submitted_at":"2025-08-08T22:30:19Z","abstract_excerpt":"Solving Mixed-Integer Programming (MIP) problems often requires substantial computational resources due to their combinatorial nature. Parallelization has emerged as a critical strategy to accelerate solution times and enhance scalability to tackle large, complex instances. This paper investigates the parallelization capabilities of Balans, a recently proposed multi-armed bandits-based adaptive large neighborhood search for MIPs. While Balans's modular architecture inherently supports parallel exploration of diverse parameter configurations, this potential has not been thoroughly examined. To "},"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.06736","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-08-08T22:30:19Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"883b4ac6b7c2a6cbf9b7273594ac83051e80043480da20e3706d7d772e8ed90c","abstract_canon_sha256":"e852bdf75f2cd647f47b5761ed90692128ac9f2c8bf8d39f597717cb2af8695e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:51:05.796133Z","signature_b64":"OTE3vlCZ+hyY080y51akCQnu7LLgMD2Ga7XPemWYR6DpZU/1Sl2/hcdYqSJsSCjxTpqjJgQUy2kVDVazdxctAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98caea32fee14eebf20f23d010c90f7bc708632226f6b53521fb9039714ffba8","last_reissued_at":"2026-07-05T11:51:05.795640Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:51:05.795640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ParBalans: Parallel Multi-Armed Bandits-based Adaptive Large Neighborhood Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Alican Yilmaz, Bistra Dilkina, Junyang Cai, Serdar Kadioglu","submitted_at":"2025-08-08T22:30:19Z","abstract_excerpt":"Solving Mixed-Integer Programming (MIP) problems often requires substantial computational resources due to their combinatorial nature. Parallelization has emerged as a critical strategy to accelerate solution times and enhance scalability to tackle large, complex instances. This paper investigates the parallelization capabilities of Balans, a recently proposed multi-armed bandits-based adaptive large neighborhood search for MIPs. While Balans's modular architecture inherently supports parallel exploration of diverse parameter configurations, this potential has not been thoroughly examined. To "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.06736","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.06736/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.06736","created_at":"2026-07-05T11:51:05.795710+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.06736v1","created_at":"2026-07-05T11:51:05.795710+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.06736","created_at":"2026-07-05T11:51:05.795710+00:00"},{"alias_kind":"pith_short_12","alias_value":"TDFOUMX64FHO","created_at":"2026-07-05T11:51:05.795710+00:00"},{"alias_kind":"pith_short_16","alias_value":"TDFOUMX64FHOX4QP","created_at":"2026-07-05T11:51:05.795710+00:00"},{"alias_kind":"pith_short_8","alias_value":"TDFOUMX6","created_at":"2026-07-05T11:51:05.795710+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.06729","citing_title":"Large Language Models for Oral History Understanding with Text Classification and Sentiment Analysis","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TDFOUMX64FHOX4QPEPIBBSIPPP","json":"https://pith.science/pith/TDFOUMX64FHOX4QPEPIBBSIPPP.json","graph_json":"https://pith.science/api/pith-number/TDFOUMX64FHOX4QPEPIBBSIPPP/graph.json","events_json":"https://pith.science/api/pith-number/TDFOUMX64FHOX4QPEPIBBSIPPP/events.json","paper":"https://pith.science/paper/TDFOUMX6"},"agent_actions":{"view_html":"https://pith.science/pith/TDFOUMX64FHOX4QPEPIBBSIPPP","download_json":"https://pith.science/pith/TDFOUMX64FHOX4QPEPIBBSIPPP.json","view_paper":"https://pith.science/paper/TDFOUMX6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.06736&json=true","fetch_graph":"https://pith.science/api/pith-number/TDFOUMX64FHOX4QPEPIBBSIPPP/graph.json","fetch_events":"https://pith.science/api/pith-number/TDFOUMX64FHOX4QPEPIBBSIPPP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TDFOUMX64FHOX4QPEPIBBSIPPP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TDFOUMX64FHOX4QPEPIBBSIPPP/action/storage_attestation","attest_author":"https://pith.science/pith/TDFOUMX64FHOX4QPEPIBBSIPPP/action/author_attestation","sign_citation":"https://pith.science/pith/TDFOUMX64FHOX4QPEPIBBSIPPP/action/citation_signature","submit_replication":"https://pith.science/pith/TDFOUMX64FHOX4QPEPIBBSIPPP/action/replication_record"}},"created_at":"2026-07-05T11:51:05.795710+00:00","updated_at":"2026-07-05T11:51:05.795710+00:00"}