{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MUH467CGRZC7PQDHAAATDZAVUG","short_pith_number":"pith:MUH467CG","schema_version":"1.0","canonical_sha256":"650fcf7c468e45f7c067000131e415a1988f43f7e32db7dd37f5bd954935e5db","source":{"kind":"arxiv","id":"1505.02405","version":1},"attestation_state":"computed","paper":{"title":"Exploiting Resolution-based Representations for MaxSAT Solving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"In\\^es Lynce, Miguel Neves, Mikol\\'a\\v{s} Janota, Ruben Martins, Vasco Manquinho","submitted_at":"2015-05-10T16:38:15Z","abstract_excerpt":"Most recent MaxSAT algorithms rely on a succession of calls to a SAT solver in order to find an optimal solution. In particular, several algorithms take advantage of the ability of SAT solvers to identify unsatisfiable subformulas. Usually, these MaxSAT algorithms perform better when small unsatisfiable subformulas are found early. However, this is not the case in many problem instances, since the whole formula is given to the SAT solver in each call. In this paper, we propose to partition the MaxSAT formula using a resolution-based graph representation. Partitions are then iteratively joined "},"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":"1505.02405","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-05-10T16:38:15Z","cross_cats_sorted":[],"title_canon_sha256":"5a226d7d4aa2b3ed02608f7b1aca985fbd207ab6e638bf0d3a99027121a3325c","abstract_canon_sha256":"a947a5ae5aea95232b2bc03550bea34b8459f32b032b0a43ddc6d07882d2c424"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:18.880936Z","signature_b64":"0plxl/0sDB3eCAt/QJ1XqqL79SBC41FuA+xXTe/BDthdznapSiPoA3LKyWqUt2nCbu/Dr/yiL/g5d8Ci6ozKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"650fcf7c468e45f7c067000131e415a1988f43f7e32db7dd37f5bd954935e5db","last_reissued_at":"2026-05-18T02:16:18.880416Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:18.880416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploiting Resolution-based Representations for MaxSAT Solving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"In\\^es Lynce, Miguel Neves, Mikol\\'a\\v{s} Janota, Ruben Martins, Vasco Manquinho","submitted_at":"2015-05-10T16:38:15Z","abstract_excerpt":"Most recent MaxSAT algorithms rely on a succession of calls to a SAT solver in order to find an optimal solution. In particular, several algorithms take advantage of the ability of SAT solvers to identify unsatisfiable subformulas. Usually, these MaxSAT algorithms perform better when small unsatisfiable subformulas are found early. However, this is not the case in many problem instances, since the whole formula is given to the SAT solver in each call. In this paper, we propose to partition the MaxSAT formula using a resolution-based graph representation. Partitions are then iteratively joined "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02405","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":""},"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":"1505.02405","created_at":"2026-05-18T02:16:18.880507+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.02405v1","created_at":"2026-05-18T02:16:18.880507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02405","created_at":"2026-05-18T02:16:18.880507+00:00"},{"alias_kind":"pith_short_12","alias_value":"MUH467CGRZC7","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MUH467CGRZC7PQDH","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MUH467CG","created_at":"2026-05-18T12:29:32.376354+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/MUH467CGRZC7PQDHAAATDZAVUG","json":"https://pith.science/pith/MUH467CGRZC7PQDHAAATDZAVUG.json","graph_json":"https://pith.science/api/pith-number/MUH467CGRZC7PQDHAAATDZAVUG/graph.json","events_json":"https://pith.science/api/pith-number/MUH467CGRZC7PQDHAAATDZAVUG/events.json","paper":"https://pith.science/paper/MUH467CG"},"agent_actions":{"view_html":"https://pith.science/pith/MUH467CGRZC7PQDHAAATDZAVUG","download_json":"https://pith.science/pith/MUH467CGRZC7PQDHAAATDZAVUG.json","view_paper":"https://pith.science/paper/MUH467CG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.02405&json=true","fetch_graph":"https://pith.science/api/pith-number/MUH467CGRZC7PQDHAAATDZAVUG/graph.json","fetch_events":"https://pith.science/api/pith-number/MUH467CGRZC7PQDHAAATDZAVUG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MUH467CGRZC7PQDHAAATDZAVUG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MUH467CGRZC7PQDHAAATDZAVUG/action/storage_attestation","attest_author":"https://pith.science/pith/MUH467CGRZC7PQDHAAATDZAVUG/action/author_attestation","sign_citation":"https://pith.science/pith/MUH467CGRZC7PQDHAAATDZAVUG/action/citation_signature","submit_replication":"https://pith.science/pith/MUH467CGRZC7PQDHAAATDZAVUG/action/replication_record"}},"created_at":"2026-05-18T02:16:18.880507+00:00","updated_at":"2026-05-18T02:16:18.880507+00:00"}