{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:DOFE23HYOWTZTL6MJDKOL5YHEB","short_pith_number":"pith:DOFE23HY","schema_version":"1.0","canonical_sha256":"1b8a4d6cf875a799afcc48d4e5f70720798a7168c29d41a84974203e26a2b352","source":{"kind":"arxiv","id":"0907.4573","version":4},"attestation_state":"computed","paper":{"title":"Solving MAX-r-SAT Above a Tight Lower Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Anders Yeo, Eun Jung Kim, Gregory Gutin, Noga Alon, Stefan Szeider","submitted_at":"2009-07-27T09:10:25Z","abstract_excerpt":"We present an exact algorithm that decides, for every fixed $r \\geq 2$ in time $O(m) + 2^{O(k^2)}$ whether a given multiset of $m$ clauses of size $r$ admits a truth assignment that satisfies at least $((2^r-1)m+k)/2^r$ clauses. Thus \\textsc{Max-$r$-Sat} is fixed-parameter tractable when parameterized by the number of satisfied clauses above the tight lower bound $(1-2^{-r})m$. This solves an open problem of Mahajan et al. (J. Comput. System Sci., 75, 2009).\n  Our algorithm is based on a polynomial-time data reduction procedure that reduces a problem instance to an equivalent algebraically rep"},"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":"0907.4573","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-07-27T09:10:25Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"887f364a97683af4d1fba12de9bff751fbb70b8b950f2d1414d5f31ed61dfc56","abstract_canon_sha256":"c2a3278bea6cee595cbafb7aba329b0b2b92fcae5c36d213c5fc068ed7324010"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:04.817386Z","signature_b64":"NkAF+AXU6B9z923mD71kLHat+/bbCPB3+1/k3hJN7PRZmj9vQ3MfDZuMW1IwnbiIG1pdYh8OxuG8e8vUtXY8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b8a4d6cf875a799afcc48d4e5f70720798a7168c29d41a84974203e26a2b352","last_reissued_at":"2026-05-18T04:15:04.816517Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:04.816517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving MAX-r-SAT Above a Tight Lower Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Anders Yeo, Eun Jung Kim, Gregory Gutin, Noga Alon, Stefan Szeider","submitted_at":"2009-07-27T09:10:25Z","abstract_excerpt":"We present an exact algorithm that decides, for every fixed $r \\geq 2$ in time $O(m) + 2^{O(k^2)}$ whether a given multiset of $m$ clauses of size $r$ admits a truth assignment that satisfies at least $((2^r-1)m+k)/2^r$ clauses. Thus \\textsc{Max-$r$-Sat} is fixed-parameter tractable when parameterized by the number of satisfied clauses above the tight lower bound $(1-2^{-r})m$. This solves an open problem of Mahajan et al. (J. Comput. System Sci., 75, 2009).\n  Our algorithm is based on a polynomial-time data reduction procedure that reduces a problem instance to an equivalent algebraically rep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.4573","kind":"arxiv","version":4},"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":"0907.4573","created_at":"2026-05-18T04:15:04.816657+00:00"},{"alias_kind":"arxiv_version","alias_value":"0907.4573v4","created_at":"2026-05-18T04:15:04.816657+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.4573","created_at":"2026-05-18T04:15:04.816657+00:00"},{"alias_kind":"pith_short_12","alias_value":"DOFE23HYOWTZ","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"DOFE23HYOWTZTL6M","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"DOFE23HY","created_at":"2026-05-18T12:25:59.703012+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/DOFE23HYOWTZTL6MJDKOL5YHEB","json":"https://pith.science/pith/DOFE23HYOWTZTL6MJDKOL5YHEB.json","graph_json":"https://pith.science/api/pith-number/DOFE23HYOWTZTL6MJDKOL5YHEB/graph.json","events_json":"https://pith.science/api/pith-number/DOFE23HYOWTZTL6MJDKOL5YHEB/events.json","paper":"https://pith.science/paper/DOFE23HY"},"agent_actions":{"view_html":"https://pith.science/pith/DOFE23HYOWTZTL6MJDKOL5YHEB","download_json":"https://pith.science/pith/DOFE23HYOWTZTL6MJDKOL5YHEB.json","view_paper":"https://pith.science/paper/DOFE23HY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0907.4573&json=true","fetch_graph":"https://pith.science/api/pith-number/DOFE23HYOWTZTL6MJDKOL5YHEB/graph.json","fetch_events":"https://pith.science/api/pith-number/DOFE23HYOWTZTL6MJDKOL5YHEB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DOFE23HYOWTZTL6MJDKOL5YHEB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DOFE23HYOWTZTL6MJDKOL5YHEB/action/storage_attestation","attest_author":"https://pith.science/pith/DOFE23HYOWTZTL6MJDKOL5YHEB/action/author_attestation","sign_citation":"https://pith.science/pith/DOFE23HYOWTZTL6MJDKOL5YHEB/action/citation_signature","submit_replication":"https://pith.science/pith/DOFE23HYOWTZTL6MJDKOL5YHEB/action/replication_record"}},"created_at":"2026-05-18T04:15:04.816657+00:00","updated_at":"2026-05-18T04:15:04.816657+00:00"}