{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:F2QN45SZFL3O2U6HWHD7Q73DLN","short_pith_number":"pith:F2QN45SZ","schema_version":"1.0","canonical_sha256":"2ea0de76592af6ed53c7b1c7f87f635b6ce16e70ca2344ebff947947cc06af4b","source":{"kind":"arxiv","id":"1503.02920","version":1},"attestation_state":"computed","paper":{"title":"Dealing With 4-Variables by Resolution: An Improved MaxSAT Algorithm","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chao Xu, Jianer Chen","submitted_at":"2015-03-10T14:21:23Z","abstract_excerpt":"We study techniques for solving the Maximum Satisfiability problem (MaxSAT). Our focus is on variables of degree 4. We identify cases for degree-4 variables and show how the resolution principle and the kernelization techniques can be nicely integrated to achieve more efficient algorithms for the MaxSAT problem. As a result, we present an algorithm of time $O^*(1.3248^k)$ for the MaxSAT problem, improving the previous best upper bound $O^*(1.358^k)$ by Ivan Bliznets and Alexander."},"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":"1503.02920","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2015-03-10T14:21:23Z","cross_cats_sorted":[],"title_canon_sha256":"79db0ca0bfdfc7fb826238676a1eb588c466d2652d8437550b1a1903751ba6b8","abstract_canon_sha256":"85a1bbdc20174ad9784193b6dec3daa52bb7352c10b57d29b873a4339866df41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:12.752466Z","signature_b64":"v5HPQTccLdUlUQfNWMRnPg75BTZ0bMvTIJ3QuveV6geFsDqZAPOpORKRerF2H5QYz+ZP4jnp8z36tl/IJ1DAAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ea0de76592af6ed53c7b1c7f87f635b6ce16e70ca2344ebff947947cc06af4b","last_reissued_at":"2026-05-18T02:25:12.751966Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:12.751966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dealing With 4-Variables by Resolution: An Improved MaxSAT Algorithm","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chao Xu, Jianer Chen","submitted_at":"2015-03-10T14:21:23Z","abstract_excerpt":"We study techniques for solving the Maximum Satisfiability problem (MaxSAT). Our focus is on variables of degree 4. We identify cases for degree-4 variables and show how the resolution principle and the kernelization techniques can be nicely integrated to achieve more efficient algorithms for the MaxSAT problem. As a result, we present an algorithm of time $O^*(1.3248^k)$ for the MaxSAT problem, improving the previous best upper bound $O^*(1.358^k)$ by Ivan Bliznets and Alexander."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02920","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":"1503.02920","created_at":"2026-05-18T02:25:12.752044+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.02920v1","created_at":"2026-05-18T02:25:12.752044+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02920","created_at":"2026-05-18T02:25:12.752044+00:00"},{"alias_kind":"pith_short_12","alias_value":"F2QN45SZFL3O","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"F2QN45SZFL3O2U6H","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"F2QN45SZ","created_at":"2026-05-18T12:29:19.899920+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/F2QN45SZFL3O2U6HWHD7Q73DLN","json":"https://pith.science/pith/F2QN45SZFL3O2U6HWHD7Q73DLN.json","graph_json":"https://pith.science/api/pith-number/F2QN45SZFL3O2U6HWHD7Q73DLN/graph.json","events_json":"https://pith.science/api/pith-number/F2QN45SZFL3O2U6HWHD7Q73DLN/events.json","paper":"https://pith.science/paper/F2QN45SZ"},"agent_actions":{"view_html":"https://pith.science/pith/F2QN45SZFL3O2U6HWHD7Q73DLN","download_json":"https://pith.science/pith/F2QN45SZFL3O2U6HWHD7Q73DLN.json","view_paper":"https://pith.science/paper/F2QN45SZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.02920&json=true","fetch_graph":"https://pith.science/api/pith-number/F2QN45SZFL3O2U6HWHD7Q73DLN/graph.json","fetch_events":"https://pith.science/api/pith-number/F2QN45SZFL3O2U6HWHD7Q73DLN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F2QN45SZFL3O2U6HWHD7Q73DLN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F2QN45SZFL3O2U6HWHD7Q73DLN/action/storage_attestation","attest_author":"https://pith.science/pith/F2QN45SZFL3O2U6HWHD7Q73DLN/action/author_attestation","sign_citation":"https://pith.science/pith/F2QN45SZFL3O2U6HWHD7Q73DLN/action/citation_signature","submit_replication":"https://pith.science/pith/F2QN45SZFL3O2U6HWHD7Q73DLN/action/replication_record"}},"created_at":"2026-05-18T02:25:12.752044+00:00","updated_at":"2026-05-18T02:25:12.752044+00:00"}