{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HTYYLDFVVEGJRFZFI5ZJEANUTL","short_pith_number":"pith:HTYYLDFV","schema_version":"1.0","canonical_sha256":"3cf1858cb5a90c98972547729201b49ae0e96043ec0a061d691a6b4ebdec7a8c","source":{"kind":"arxiv","id":"2509.04007","version":1},"attestation_state":"computed","paper":{"title":"AutoPBO: LLM-powered Optimization for Local Search PBO Solvers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jinyuan Li, Mengchuan Zou, Shaowei Cai, Yi Chu, Yiwen Sun","submitted_at":"2025-09-04T08:38:42Z","abstract_excerpt":"Pseudo-Boolean Optimization (PBO) provides a powerful framework for modeling combinatorial problems through pseudo-Boolean (PB) constraints. Local search solvers have shown excellent performance in PBO solving, and their efficiency is highly dependent on their internal heuristics to guide the search. Still, their design often requires significant expert effort and manual tuning in practice. While Large Language Models (LLMs) have demonstrated potential in automating algorithm design, their application to optimizing PBO solvers remains unexplored. In this work, we introduce AutoPBO, a novel LLM"},"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":"2509.04007","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-09-04T08:38:42Z","cross_cats_sorted":[],"title_canon_sha256":"7d155e23def6498c38d8dd89a845823f2088b40a58bc3eadefca0f118cbdb80b","abstract_canon_sha256":"d1f7b286f4b7802741d06be2011e514a489b9af18e958b0b5e88f726c9828a81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:04:51.645589Z","signature_b64":"QWhWNmRDN6U+DiGVimLC4j8ukhQnEWlH9+viu85QpmiEBAvP2cRvqVqzBbtXymCXqdYbH+/FAwJC/1IEfADTBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cf1858cb5a90c98972547729201b49ae0e96043ec0a061d691a6b4ebdec7a8c","last_reissued_at":"2026-07-05T12:04:51.645012Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:04:51.645012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AutoPBO: LLM-powered Optimization for Local Search PBO Solvers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jinyuan Li, Mengchuan Zou, Shaowei Cai, Yi Chu, Yiwen Sun","submitted_at":"2025-09-04T08:38:42Z","abstract_excerpt":"Pseudo-Boolean Optimization (PBO) provides a powerful framework for modeling combinatorial problems through pseudo-Boolean (PB) constraints. Local search solvers have shown excellent performance in PBO solving, and their efficiency is highly dependent on their internal heuristics to guide the search. Still, their design often requires significant expert effort and manual tuning in practice. While Large Language Models (LLMs) have demonstrated potential in automating algorithm design, their application to optimizing PBO solvers remains unexplored. In this work, we introduce AutoPBO, a novel LLM"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.04007","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/2509.04007/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":"2509.04007","created_at":"2026-07-05T12:04:51.645073+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.04007v1","created_at":"2026-07-05T12:04:51.645073+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.04007","created_at":"2026-07-05T12:04:51.645073+00:00"},{"alias_kind":"pith_short_12","alias_value":"HTYYLDFVVEGJ","created_at":"2026-07-05T12:04:51.645073+00:00"},{"alias_kind":"pith_short_16","alias_value":"HTYYLDFVVEGJRFZF","created_at":"2026-07-05T12:04:51.645073+00:00"},{"alias_kind":"pith_short_8","alias_value":"HTYYLDFV","created_at":"2026-07-05T12:04:51.645073+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25832","citing_title":"MiniOpt: Reasoning to Model and Solve General Optimization Problems with Limited Resources","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2606.25832","citing_title":"MiniOpt: Reasoning to Model and Solve General Optimization Problems with Limited Resources","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HTYYLDFVVEGJRFZFI5ZJEANUTL","json":"https://pith.science/pith/HTYYLDFVVEGJRFZFI5ZJEANUTL.json","graph_json":"https://pith.science/api/pith-number/HTYYLDFVVEGJRFZFI5ZJEANUTL/graph.json","events_json":"https://pith.science/api/pith-number/HTYYLDFVVEGJRFZFI5ZJEANUTL/events.json","paper":"https://pith.science/paper/HTYYLDFV"},"agent_actions":{"view_html":"https://pith.science/pith/HTYYLDFVVEGJRFZFI5ZJEANUTL","download_json":"https://pith.science/pith/HTYYLDFVVEGJRFZFI5ZJEANUTL.json","view_paper":"https://pith.science/paper/HTYYLDFV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.04007&json=true","fetch_graph":"https://pith.science/api/pith-number/HTYYLDFVVEGJRFZFI5ZJEANUTL/graph.json","fetch_events":"https://pith.science/api/pith-number/HTYYLDFVVEGJRFZFI5ZJEANUTL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HTYYLDFVVEGJRFZFI5ZJEANUTL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HTYYLDFVVEGJRFZFI5ZJEANUTL/action/storage_attestation","attest_author":"https://pith.science/pith/HTYYLDFVVEGJRFZFI5ZJEANUTL/action/author_attestation","sign_citation":"https://pith.science/pith/HTYYLDFVVEGJRFZFI5ZJEANUTL/action/citation_signature","submit_replication":"https://pith.science/pith/HTYYLDFVVEGJRFZFI5ZJEANUTL/action/replication_record"}},"created_at":"2026-07-05T12:04:51.645073+00:00","updated_at":"2026-07-05T12:04:51.645073+00:00"}