{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:TNRHWHHVBQ6TKNQKZHAMW4FA2I","short_pith_number":"pith:TNRHWHHV","schema_version":"1.0","canonical_sha256":"9b627b1cf50c3d35360ac9c0cb70a0d2035361da206f2601090a444eaf218c32","source":{"kind":"arxiv","id":"1104.2818","version":3},"attestation_state":"computed","paper":{"title":"A New Bound for 3-Satisfiable MaxSat and its Algorithmic Application","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.DM","authors_text":"Anders Yeo, Dominik Scheder, Gregory Gutin, Mark Jones","submitted_at":"2011-04-14T16:13:43Z","abstract_excerpt":"Let F be a CNF formula with n variables and m clauses. F is 3-satisfiable if for any 3 clauses in F, there is a truth assignment which satisfies all of them. Lieberherr and Specker (1982) and, later, Yannakakis (1994) proved that in each 3-satisfiable CNF formula at least 2/3 of its clauses can be satisfied by a truth assignment. We improve this result by showing that every 3-satisfiable CNF formula F contains a subset of variables U, such that some truth assignment $\\tau$ will satisfy at least $2m/3+ m_U/3+\\rho n'$ clauses, where m is the number of clauses of F, m_U is the number of clauses o"},"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":"1104.2818","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-04-14T16:13:43Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"d1cbba6326fbfe02ec3fcc9434b506046d70bbf9578a08f782bb94e53e1b20e0","abstract_canon_sha256":"aa04fe1c7e5e6df0b4b4dd4d01e9e164c54478e5448106898d0263b7070321e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:42.055073Z","signature_b64":"RAJ7BkJr1tzE99Ge92GYZjygxmzL9h01oQL1H6FOSgN6QQ0E3qW1aiyXvQW3dNCO9Bn4gGDAIu6KrFQalgcLAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b627b1cf50c3d35360ac9c0cb70a0d2035361da206f2601090a444eaf218c32","last_reissued_at":"2026-05-18T03:39:42.054337Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:42.054337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Bound for 3-Satisfiable MaxSat and its Algorithmic Application","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.DM","authors_text":"Anders Yeo, Dominik Scheder, Gregory Gutin, Mark Jones","submitted_at":"2011-04-14T16:13:43Z","abstract_excerpt":"Let F be a CNF formula with n variables and m clauses. F is 3-satisfiable if for any 3 clauses in F, there is a truth assignment which satisfies all of them. Lieberherr and Specker (1982) and, later, Yannakakis (1994) proved that in each 3-satisfiable CNF formula at least 2/3 of its clauses can be satisfied by a truth assignment. We improve this result by showing that every 3-satisfiable CNF formula F contains a subset of variables U, such that some truth assignment $\\tau$ will satisfy at least $2m/3+ m_U/3+\\rho n'$ clauses, where m is the number of clauses of F, m_U is the number of clauses o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2818","kind":"arxiv","version":3},"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":"1104.2818","created_at":"2026-05-18T03:39:42.054441+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.2818v3","created_at":"2026-05-18T03:39:42.054441+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2818","created_at":"2026-05-18T03:39:42.054441+00:00"},{"alias_kind":"pith_short_12","alias_value":"TNRHWHHVBQ6T","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"TNRHWHHVBQ6TKNQK","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"TNRHWHHV","created_at":"2026-05-18T12:26:42.757692+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/TNRHWHHVBQ6TKNQKZHAMW4FA2I","json":"https://pith.science/pith/TNRHWHHVBQ6TKNQKZHAMW4FA2I.json","graph_json":"https://pith.science/api/pith-number/TNRHWHHVBQ6TKNQKZHAMW4FA2I/graph.json","events_json":"https://pith.science/api/pith-number/TNRHWHHVBQ6TKNQKZHAMW4FA2I/events.json","paper":"https://pith.science/paper/TNRHWHHV"},"agent_actions":{"view_html":"https://pith.science/pith/TNRHWHHVBQ6TKNQKZHAMW4FA2I","download_json":"https://pith.science/pith/TNRHWHHVBQ6TKNQKZHAMW4FA2I.json","view_paper":"https://pith.science/paper/TNRHWHHV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.2818&json=true","fetch_graph":"https://pith.science/api/pith-number/TNRHWHHVBQ6TKNQKZHAMW4FA2I/graph.json","fetch_events":"https://pith.science/api/pith-number/TNRHWHHVBQ6TKNQKZHAMW4FA2I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TNRHWHHVBQ6TKNQKZHAMW4FA2I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TNRHWHHVBQ6TKNQKZHAMW4FA2I/action/storage_attestation","attest_author":"https://pith.science/pith/TNRHWHHVBQ6TKNQKZHAMW4FA2I/action/author_attestation","sign_citation":"https://pith.science/pith/TNRHWHHVBQ6TKNQKZHAMW4FA2I/action/citation_signature","submit_replication":"https://pith.science/pith/TNRHWHHVBQ6TKNQKZHAMW4FA2I/action/replication_record"}},"created_at":"2026-05-18T03:39:42.054441+00:00","updated_at":"2026-05-18T03:39:42.054441+00:00"}