{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:DOFE23HYOWTZTL6MJDKOL5YHEB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c2a3278bea6cee595cbafb7aba329b0b2b92fcae5c36d213c5fc068ed7324010","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-07-27T09:10:25Z","title_canon_sha256":"887f364a97683af4d1fba12de9bff751fbb70b8b950f2d1414d5f31ed61dfc56"},"schema_version":"1.0","source":{"id":"0907.4573","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0907.4573","created_at":"2026-05-18T04:15:04Z"},{"alias_kind":"arxiv_version","alias_value":"0907.4573v4","created_at":"2026-05-18T04:15:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.4573","created_at":"2026-05-18T04:15:04Z"},{"alias_kind":"pith_short_12","alias_value":"DOFE23HYOWTZ","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"DOFE23HYOWTZTL6M","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"DOFE23HY","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:e44876ba75f3cdb893302c403ac8c26743b5c22fc2f059dd12654ea0b07209b8","target":"graph","created_at":"2026-05-18T04:15:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Anders Yeo, Eun Jung Kim, Gregory Gutin, Noga Alon, Stefan Szeider","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-07-27T09:10:25Z","title":"Solving MAX-r-SAT Above a Tight Lower Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.4573","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3e2940c9a0eec3a969e74ddef36b25197e8473038b37b7811db32265b791a909","target":"record","created_at":"2026-05-18T04:15:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c2a3278bea6cee595cbafb7aba329b0b2b92fcae5c36d213c5fc068ed7324010","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-07-27T09:10:25Z","title_canon_sha256":"887f364a97683af4d1fba12de9bff751fbb70b8b950f2d1414d5f31ed61dfc56"},"schema_version":"1.0","source":{"id":"0907.4573","kind":"arxiv","version":4}},"canonical_sha256":"1b8a4d6cf875a799afcc48d4e5f70720798a7168c29d41a84974203e26a2b352","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b8a4d6cf875a799afcc48d4e5f70720798a7168c29d41a84974203e26a2b352","first_computed_at":"2026-05-18T04:15:04.816517Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:15:04.816517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NkAF+AXU6B9z923mD71kLHat+/bbCPB3+1/k3hJN7PRZmj9vQ3MfDZuMW1IwnbiIG1pdYh8OxuG8e8vUtXY8BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:15:04.817386Z","signed_message":"canonical_sha256_bytes"},"source_id":"0907.4573","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e2940c9a0eec3a969e74ddef36b25197e8473038b37b7811db32265b791a909","sha256:e44876ba75f3cdb893302c403ac8c26743b5c22fc2f059dd12654ea0b07209b8"],"state_sha256":"056110e2a3b18ca2d9143014485d6d0e68089cee9d46f3904a6966f6ea97a5dd"}