{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:SLMWUFWC2RRJAEJK27OHFORVVF","short_pith_number":"pith:SLMWUFWC","schema_version":"1.0","canonical_sha256":"92d96a16c2d46290112ad7dc72ba35a953c63920549e59a8778fbe926a78d291","source":{"kind":"arxiv","id":"2201.05544","version":2},"attestation_state":"computed","paper":{"title":"BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Chu-Min Li, Felip Manya, Jianrong Zhou, Jiongzhi Zheng, Kun He, Yan Jin","submitted_at":"2022-01-14T16:32:39Z","abstract_excerpt":"We address Partial MaxSAT (PMS) and Weighted PMS (WPMS), two practical generalizations of the MaxSAT problem, and propose a local search algorithm for these problems, called BandMaxSAT, that applies a multi-armed bandit model to guide the search direction. The bandit in our method is associated with all the soft clauses in the input (W)PMS instance. Each arm corresponds to a soft clause. The bandit model can help BandMaxSAT to select a good direction to escape from local optima by selecting a soft clause to be satisfied in the current step, that is, selecting an arm to be pulled. We further pr"},"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":"2201.05544","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-01-14T16:32:39Z","cross_cats_sorted":[],"title_canon_sha256":"4b35faf7ba7088db3c435bd73a54ef394e0fac1e431b263a7353df08f3754fea","abstract_canon_sha256":"9ddbfcf87e10aac921f56f1d3a161c8b05da60937818d51182c3c5ccc1f42ab7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:32:14.173386Z","signature_b64":"I7RzhRE9KeHY5zIxEPYa/fdiqQAtOqYDOYtwkhWY+GkbdL9CizuWrJB+kymcHoqYdEDys1g2Nkubl/EYAwOnDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92d96a16c2d46290112ad7dc72ba35a953c63920549e59a8778fbe926a78d291","last_reissued_at":"2026-07-05T04:32:14.172966Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:32:14.172966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Chu-Min Li, Felip Manya, Jianrong Zhou, Jiongzhi Zheng, Kun He, Yan Jin","submitted_at":"2022-01-14T16:32:39Z","abstract_excerpt":"We address Partial MaxSAT (PMS) and Weighted PMS (WPMS), two practical generalizations of the MaxSAT problem, and propose a local search algorithm for these problems, called BandMaxSAT, that applies a multi-armed bandit model to guide the search direction. The bandit in our method is associated with all the soft clauses in the input (W)PMS instance. Each arm corresponds to a soft clause. The bandit model can help BandMaxSAT to select a good direction to escape from local optima by selecting a soft clause to be satisfied in the current step, that is, selecting an arm to be pulled. We further pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.05544","kind":"arxiv","version":2},"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/2201.05544/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":"2201.05544","created_at":"2026-07-05T04:32:14.173022+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.05544v2","created_at":"2026-07-05T04:32:14.173022+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.05544","created_at":"2026-07-05T04:32:14.173022+00:00"},{"alias_kind":"pith_short_12","alias_value":"SLMWUFWC2RRJ","created_at":"2026-07-05T04:32:14.173022+00:00"},{"alias_kind":"pith_short_16","alias_value":"SLMWUFWC2RRJAEJK","created_at":"2026-07-05T04:32:14.173022+00:00"},{"alias_kind":"pith_short_8","alias_value":"SLMWUFWC","created_at":"2026-07-05T04:32:14.173022+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.14382","citing_title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","ref_index":49,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SLMWUFWC2RRJAEJK27OHFORVVF","json":"https://pith.science/pith/SLMWUFWC2RRJAEJK27OHFORVVF.json","graph_json":"https://pith.science/api/pith-number/SLMWUFWC2RRJAEJK27OHFORVVF/graph.json","events_json":"https://pith.science/api/pith-number/SLMWUFWC2RRJAEJK27OHFORVVF/events.json","paper":"https://pith.science/paper/SLMWUFWC"},"agent_actions":{"view_html":"https://pith.science/pith/SLMWUFWC2RRJAEJK27OHFORVVF","download_json":"https://pith.science/pith/SLMWUFWC2RRJAEJK27OHFORVVF.json","view_paper":"https://pith.science/paper/SLMWUFWC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.05544&json=true","fetch_graph":"https://pith.science/api/pith-number/SLMWUFWC2RRJAEJK27OHFORVVF/graph.json","fetch_events":"https://pith.science/api/pith-number/SLMWUFWC2RRJAEJK27OHFORVVF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SLMWUFWC2RRJAEJK27OHFORVVF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SLMWUFWC2RRJAEJK27OHFORVVF/action/storage_attestation","attest_author":"https://pith.science/pith/SLMWUFWC2RRJAEJK27OHFORVVF/action/author_attestation","sign_citation":"https://pith.science/pith/SLMWUFWC2RRJAEJK27OHFORVVF/action/citation_signature","submit_replication":"https://pith.science/pith/SLMWUFWC2RRJAEJK27OHFORVVF/action/replication_record"}},"created_at":"2026-07-05T04:32:14.173022+00:00","updated_at":"2026-07-05T04:32:14.173022+00:00"}