{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:TNRHWHHVBQ6TKNQKZHAMW4FA2I","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":"aa04fe1c7e5e6df0b4b4dd4d01e9e164c54478e5448106898d0263b7070321e5","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-04-14T16:13:43Z","title_canon_sha256":"d1cbba6326fbfe02ec3fcc9434b506046d70bbf9578a08f782bb94e53e1b20e0"},"schema_version":"1.0","source":{"id":"1104.2818","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2818","created_at":"2026-05-18T03:39:42Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2818v3","created_at":"2026-05-18T03:39:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2818","created_at":"2026-05-18T03:39:42Z"},{"alias_kind":"pith_short_12","alias_value":"TNRHWHHVBQ6T","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TNRHWHHVBQ6TKNQK","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TNRHWHHV","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:36df1b40f33e7fca97bd0c231afea48732d5976a102496edee93b25ceda9bf60","target":"graph","created_at":"2026-05-18T03:39:42Z","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":"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","authors_text":"Anders Yeo, Dominik Scheder, Gregory Gutin, Mark Jones","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-04-14T16:13:43Z","title":"A New Bound for 3-Satisfiable MaxSat and its Algorithmic Application"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2818","kind":"arxiv","version":3},"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:99e976db73e420a122a7f8b8b2633f71957db147fcde017fec550d132ad23123","target":"record","created_at":"2026-05-18T03:39:42Z","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":"aa04fe1c7e5e6df0b4b4dd4d01e9e164c54478e5448106898d0263b7070321e5","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-04-14T16:13:43Z","title_canon_sha256":"d1cbba6326fbfe02ec3fcc9434b506046d70bbf9578a08f782bb94e53e1b20e0"},"schema_version":"1.0","source":{"id":"1104.2818","kind":"arxiv","version":3}},"canonical_sha256":"9b627b1cf50c3d35360ac9c0cb70a0d2035361da206f2601090a444eaf218c32","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b627b1cf50c3d35360ac9c0cb70a0d2035361da206f2601090a444eaf218c32","first_computed_at":"2026-05-18T03:39:42.054337Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:39:42.054337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RAJ7BkJr1tzE99Ge92GYZjygxmzL9h01oQL1H6FOSgN6QQ0E3qW1aiyXvQW3dNCO9Bn4gGDAIu6KrFQalgcLAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:39:42.055073Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.2818","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99e976db73e420a122a7f8b8b2633f71957db147fcde017fec550d132ad23123","sha256:36df1b40f33e7fca97bd0c231afea48732d5976a102496edee93b25ceda9bf60"],"state_sha256":"b3faa6926e75560409f3be8e94c9d8c9bbf35e83a178300314ffbfa189fdee54"}