{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6XGGADES4UVVC4O26FPZJOPUND","short_pith_number":"pith:6XGGADES","schema_version":"1.0","canonical_sha256":"f5cc600c92e52b5171daf15f94b9f468ea188d46a9f7c4aec2d46176d8a9d2d9","source":{"kind":"arxiv","id":"2407.21729","version":1},"attestation_state":"computed","paper":{"title":"ParLS-PBO: A Parallel Local Search Solver for Pseudo Boolean Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Hao Hu, Peng Lin, Shaowei Cai, Zhihan Chen","submitted_at":"2024-07-31T16:30:04Z","abstract_excerpt":"As a broadly applied technique in numerous optimization problems, recently, local search has been employed to solve Pseudo-Boolean Optimization (PBO) problem. A representative local search solver for PBO is LSPBO. In this paper, firstly, we improve LSPBO by a dynamic scoring mechanism, which dynamically strikes a balance between score on hard constraints and score on the objective function.\n  Moreover, on top of this improved LSPBO , we develop the first parallel local search PBO solver. The main idea is to share good solutions among different threads to guide the search, by maintaining a pool"},"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":"2407.21729","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-07-31T16:30:04Z","cross_cats_sorted":[],"title_canon_sha256":"8882d481d81a2a4cad4dcbd22188b0e1807cb073bd8e3cb6b84debcc3b79f59d","abstract_canon_sha256":"16d1192b952ed852bd8dce63f5fb1d8b975829ed1013e0491d5d743519854a51"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:50:42.937100Z","signature_b64":"lVH7Jbpe5b1FDb2BHgy3WfQ5IbB/+F0659BZ4JdRiCk2Kw1TleNXGp4F27IBJN9/R0ciCc+EgbVnC1xtZCnKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5cc600c92e52b5171daf15f94b9f468ea188d46a9f7c4aec2d46176d8a9d2d9","last_reissued_at":"2026-07-05T08:50:42.936635Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:50:42.936635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ParLS-PBO: A Parallel Local Search Solver for Pseudo Boolean Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Hao Hu, Peng Lin, Shaowei Cai, Zhihan Chen","submitted_at":"2024-07-31T16:30:04Z","abstract_excerpt":"As a broadly applied technique in numerous optimization problems, recently, local search has been employed to solve Pseudo-Boolean Optimization (PBO) problem. A representative local search solver for PBO is LSPBO. In this paper, firstly, we improve LSPBO by a dynamic scoring mechanism, which dynamically strikes a balance between score on hard constraints and score on the objective function.\n  Moreover, on top of this improved LSPBO , we develop the first parallel local search PBO solver. The main idea is to share good solutions among different threads to guide the search, by maintaining a pool"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.21729","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/2407.21729/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":"2407.21729","created_at":"2026-07-05T08:50:42.936692+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.21729v1","created_at":"2026-07-05T08:50:42.936692+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.21729","created_at":"2026-07-05T08:50:42.936692+00:00"},{"alias_kind":"pith_short_12","alias_value":"6XGGADES4UVV","created_at":"2026-07-05T08:50:42.936692+00:00"},{"alias_kind":"pith_short_16","alias_value":"6XGGADES4UVVC4O2","created_at":"2026-07-05T08:50:42.936692+00:00"},{"alias_kind":"pith_short_8","alias_value":"6XGGADES","created_at":"2026-07-05T08:50:42.936692+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.04007","citing_title":"AutoPBO: LLM-powered Optimization for Local Search PBO Solvers","ref_index":2024,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6XGGADES4UVVC4O26FPZJOPUND","json":"https://pith.science/pith/6XGGADES4UVVC4O26FPZJOPUND.json","graph_json":"https://pith.science/api/pith-number/6XGGADES4UVVC4O26FPZJOPUND/graph.json","events_json":"https://pith.science/api/pith-number/6XGGADES4UVVC4O26FPZJOPUND/events.json","paper":"https://pith.science/paper/6XGGADES"},"agent_actions":{"view_html":"https://pith.science/pith/6XGGADES4UVVC4O26FPZJOPUND","download_json":"https://pith.science/pith/6XGGADES4UVVC4O26FPZJOPUND.json","view_paper":"https://pith.science/paper/6XGGADES","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.21729&json=true","fetch_graph":"https://pith.science/api/pith-number/6XGGADES4UVVC4O26FPZJOPUND/graph.json","fetch_events":"https://pith.science/api/pith-number/6XGGADES4UVVC4O26FPZJOPUND/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6XGGADES4UVVC4O26FPZJOPUND/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6XGGADES4UVVC4O26FPZJOPUND/action/storage_attestation","attest_author":"https://pith.science/pith/6XGGADES4UVVC4O26FPZJOPUND/action/author_attestation","sign_citation":"https://pith.science/pith/6XGGADES4UVVC4O26FPZJOPUND/action/citation_signature","submit_replication":"https://pith.science/pith/6XGGADES4UVVC4O26FPZJOPUND/action/replication_record"}},"created_at":"2026-07-05T08:50:42.936692+00:00","updated_at":"2026-07-05T08:50:42.936692+00:00"}