{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:R7LKF2CFFLK5RAEOND5IGLWS6E","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":"82e823d5b2ab6c0f8fc9f7d704b37e289e4a911b2beb27c5562a0ecd5edd1e91","cross_cats_sorted":["math.CO","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-11-12T12:15:48Z","title_canon_sha256":"2aa082e433eb0fd5e64ad2c30c365ad3d7c59813df23d1bd39c5efec3dfc6f2b"},"schema_version":"1.0","source":{"id":"1011.2894","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2894","created_at":"2026-05-18T02:07:32Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2894v5","created_at":"2026-05-18T02:07:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2894","created_at":"2026-05-18T02:07:32Z"},{"alias_kind":"pith_short_12","alias_value":"R7LKF2CFFLK5","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"R7LKF2CFFLK5RAEO","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"R7LKF2CF","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:3dfbc4904c702efb4639de192f5386dc48a9f60ac52c81cc64699d75ae4aa6b8","target":"graph","created_at":"2026-05-18T02:07:32Z","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":"Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem is either contained in one out of six classes and can be solved in polynomial time, or is NP-complete.\n  We present an analog of this dichotomy result for the propositional logic of graphs instead of Boolean logic. In this generalization of Schaefer's result, the input consists of a set W of variables and a conjunction \\Phi\\ of statements (\"constraints\") about these variables in the language of graphs, where each statement","authors_text":"Manuel Bodirsky, Michael Pinsker","cross_cats":["math.CO","math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-11-12T12:15:48Z","title":"Schaefer's theorem for graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2894","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:c6bd0008c287aaad3d27a9558128d571b5267f5c8f5e9b38df3914c8745abda6","target":"record","created_at":"2026-05-18T02:07:32Z","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":"82e823d5b2ab6c0f8fc9f7d704b37e289e4a911b2beb27c5562a0ecd5edd1e91","cross_cats_sorted":["math.CO","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-11-12T12:15:48Z","title_canon_sha256":"2aa082e433eb0fd5e64ad2c30c365ad3d7c59813df23d1bd39c5efec3dfc6f2b"},"schema_version":"1.0","source":{"id":"1011.2894","kind":"arxiv","version":5}},"canonical_sha256":"8fd6a2e8452ad5d8808e68fa832ed2f1319607f59025a26ec1a5eee2c0d71707","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8fd6a2e8452ad5d8808e68fa832ed2f1319607f59025a26ec1a5eee2c0d71707","first_computed_at":"2026-05-18T02:07:32.638701Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:07:32.638701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S8qhMQvV4FeoKMNKhUY3XAgaOxGBInZr2Ha5zX+aZ5hIfof8hkHEc0wMMaYjO3GVjOr9t8cz/XFMfYjJk0/YDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:07:32.639334Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.2894","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6bd0008c287aaad3d27a9558128d571b5267f5c8f5e9b38df3914c8745abda6","sha256:3dfbc4904c702efb4639de192f5386dc48a9f60ac52c81cc64699d75ae4aa6b8"],"state_sha256":"ce2b12f0348d9066325f8d65c6bc7fc9d910de1ba5d45d7b2ef79d975aa6e727"}