{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:YSSHVLJME7PCDIAAAIDSKJZZ23","short_pith_number":"pith:YSSHVLJM","canonical_record":{"source":{"id":"1004.0526","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-04-04T18:46:00Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6b561a24b34623713a58c98195c5c93e91ced39d0220c0e0bcd768cc90be98e5","abstract_canon_sha256":"52fdbfd3376dbc40ef4ca7c4e2c5604e46297d789a6cb3d81484997dc2f6d061"},"schema_version":"1.0"},"canonical_sha256":"c4a47aad2c27de21a0000207252739d6ce5ee76a361d7fb38c54cf19a1f58596","source":{"kind":"arxiv","id":"1004.0526","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.0526","created_at":"2026-05-18T02:08:14Z"},{"alias_kind":"arxiv_version","alias_value":"1004.0526v5","created_at":"2026-05-18T02:08:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.0526","created_at":"2026-05-18T02:08:14Z"},{"alias_kind":"pith_short_12","alias_value":"YSSHVLJME7PC","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"YSSHVLJME7PCDIAA","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"YSSHVLJM","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:YSSHVLJME7PCDIAAAIDSKJZZ23","target":"record","payload":{"canonical_record":{"source":{"id":"1004.0526","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-04-04T18:46:00Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6b561a24b34623713a58c98195c5c93e91ced39d0220c0e0bcd768cc90be98e5","abstract_canon_sha256":"52fdbfd3376dbc40ef4ca7c4e2c5604e46297d789a6cb3d81484997dc2f6d061"},"schema_version":"1.0"},"canonical_sha256":"c4a47aad2c27de21a0000207252739d6ce5ee76a361d7fb38c54cf19a1f58596","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:08:14.530172Z","signature_b64":"w6+jUrO8NfimKQTZQ0KqZq50+V+K09OZH87i7tpd8cnhZXNAPX5h1lcFKq/w4SRgd2p4aix8+jhqylxj5ZdWAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4a47aad2c27de21a0000207252739d6ce5ee76a361d7fb38c54cf19a1f58596","last_reissued_at":"2026-05-18T02:08:14.529650Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:08:14.529650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1004.0526","source_version":5,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:08:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nAyER9EWiF+QlkYBFnyUER6sYGnIHYgCm3w2FJIyONf0yiL6gxItKqx9GjhBH2gCM3meO3gcvZIxWAzfsBJMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:20:37.868211Z"},"content_sha256":"6143aa3f08f7e52ff0732e7e75eda86daf83f55dde4aa0442f7f770d5e9d4baa","schema_version":"1.0","event_id":"sha256:6143aa3f08f7e52ff0732e7e75eda86daf83f55dde4aa0442f7f770d5e9d4baa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:YSSHVLJME7PCDIAAAIDSKJZZ23","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and its Algorithmic Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"A. Yeo, G. Gutin, M. Jones, R. Crowston","submitted_at":"2010-04-04T18:46:00Z","abstract_excerpt":"A pair of unit clauses is called conflicting if it is of the form $(x)$, $(\\bar{x})$. A CNF formula is unit-conflict free (UCF) if it contains no pair of conflicting unit clauses. Lieberherr and Specker (J. ACM 28, 1981) showed that for each UCF CNF formula with $m$ clauses we can simultaneously satisfy at least $\\pp m$ clauses, where $\\pp =(\\sqrt{5}-1)/2$. We improve the Lieberherr-Specker bound by showing that for each UCF CNF formula $F$ with $m$ clauses we can find, in polynomial time, a subformula $F'$ with $m'$ clauses such that we can simultaneously satisfy at least $\\pp m+(1-\\pp)m'+(2-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.0526","kind":"arxiv","version":5},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:08:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fVw9PJ+YoeGDiHBmLSD6JO6JH4tNrL6xvvFwSthmA7sueVuTVq2uohQBwE6d3Gys59xas6HAvHPZkZXQcxJbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:20:37.868574Z"},"content_sha256":"0a089eb8a4e3edb47a57368c7f271e9c2b1f03b89e7d8497c4f97a22d6a910a2","schema_version":"1.0","event_id":"sha256:0a089eb8a4e3edb47a57368c7f271e9c2b1f03b89e7d8497c4f97a22d6a910a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YSSHVLJME7PCDIAAAIDSKJZZ23/bundle.json","state_url":"https://pith.science/pith/YSSHVLJME7PCDIAAAIDSKJZZ23/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YSSHVLJME7PCDIAAAIDSKJZZ23/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T09:20:37Z","links":{"resolver":"https://pith.science/pith/YSSHVLJME7PCDIAAAIDSKJZZ23","bundle":"https://pith.science/pith/YSSHVLJME7PCDIAAAIDSKJZZ23/bundle.json","state":"https://pith.science/pith/YSSHVLJME7PCDIAAAIDSKJZZ23/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YSSHVLJME7PCDIAAAIDSKJZZ23/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:YSSHVLJME7PCDIAAAIDSKJZZ23","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":"52fdbfd3376dbc40ef4ca7c4e2c5604e46297d789a6cb3d81484997dc2f6d061","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-04-04T18:46:00Z","title_canon_sha256":"6b561a24b34623713a58c98195c5c93e91ced39d0220c0e0bcd768cc90be98e5"},"schema_version":"1.0","source":{"id":"1004.0526","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.0526","created_at":"2026-05-18T02:08:14Z"},{"alias_kind":"arxiv_version","alias_value":"1004.0526v5","created_at":"2026-05-18T02:08:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.0526","created_at":"2026-05-18T02:08:14Z"},{"alias_kind":"pith_short_12","alias_value":"YSSHVLJME7PC","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"YSSHVLJME7PCDIAA","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"YSSHVLJM","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:0a089eb8a4e3edb47a57368c7f271e9c2b1f03b89e7d8497c4f97a22d6a910a2","target":"graph","created_at":"2026-05-18T02:08:14Z","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":"A pair of unit clauses is called conflicting if it is of the form $(x)$, $(\\bar{x})$. A CNF formula is unit-conflict free (UCF) if it contains no pair of conflicting unit clauses. Lieberherr and Specker (J. ACM 28, 1981) showed that for each UCF CNF formula with $m$ clauses we can simultaneously satisfy at least $\\pp m$ clauses, where $\\pp =(\\sqrt{5}-1)/2$. We improve the Lieberherr-Specker bound by showing that for each UCF CNF formula $F$ with $m$ clauses we can find, in polynomial time, a subformula $F'$ with $m'$ clauses such that we can simultaneously satisfy at least $\\pp m+(1-\\pp)m'+(2-","authors_text":"A. Yeo, G. Gutin, M. Jones, R. Crowston","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-04-04T18:46:00Z","title":"A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and its Algorithmic Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.0526","kind":"arxiv","version":5},"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:6143aa3f08f7e52ff0732e7e75eda86daf83f55dde4aa0442f7f770d5e9d4baa","target":"record","created_at":"2026-05-18T02:08:14Z","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":"52fdbfd3376dbc40ef4ca7c4e2c5604e46297d789a6cb3d81484997dc2f6d061","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-04-04T18:46:00Z","title_canon_sha256":"6b561a24b34623713a58c98195c5c93e91ced39d0220c0e0bcd768cc90be98e5"},"schema_version":"1.0","source":{"id":"1004.0526","kind":"arxiv","version":5}},"canonical_sha256":"c4a47aad2c27de21a0000207252739d6ce5ee76a361d7fb38c54cf19a1f58596","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4a47aad2c27de21a0000207252739d6ce5ee76a361d7fb38c54cf19a1f58596","first_computed_at":"2026-05-18T02:08:14.529650Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:08:14.529650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w6+jUrO8NfimKQTZQ0KqZq50+V+K09OZH87i7tpd8cnhZXNAPX5h1lcFKq/w4SRgd2p4aix8+jhqylxj5ZdWAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:08:14.530172Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.0526","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6143aa3f08f7e52ff0732e7e75eda86daf83f55dde4aa0442f7f770d5e9d4baa","sha256:0a089eb8a4e3edb47a57368c7f271e9c2b1f03b89e7d8497c4f97a22d6a910a2"],"state_sha256":"6f923013faf818098a4cba7a1f9211264dff2335f0bffefad5151bdd779dbc37"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fVcAxMCtoEvA7Pt6YnpyXtL21FgehveceEg7YqkHXG6pB7HoCpfwlxJ19LCvTDtZ4Qs+uIJvpwOuJB33/x1SDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:20:37.870616Z","bundle_sha256":"e69c51134d071a588b0593918bb9105c6d0e7663ee129de6c9efa80d3d2a0faa"}}