{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:R7LKF2CFFLK5RAEOND5IGLWS6E","short_pith_number":"pith:R7LKF2CF","schema_version":"1.0","canonical_sha256":"8fd6a2e8452ad5d8808e68fa832ed2f1319607f59025a26ec1a5eee2c0d71707","source":{"kind":"arxiv","id":"1011.2894","version":5},"attestation_state":"computed","paper":{"title":"Schaefer's theorem for graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.LO"],"primary_cat":"cs.CC","authors_text":"Manuel Bodirsky, Michael Pinsker","submitted_at":"2010-11-12T12:15:48Z","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"},"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":"1011.2894","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-11-12T12:15:48Z","cross_cats_sorted":["math.CO","math.LO"],"title_canon_sha256":"2aa082e433eb0fd5e64ad2c30c365ad3d7c59813df23d1bd39c5efec3dfc6f2b","abstract_canon_sha256":"82e823d5b2ab6c0f8fc9f7d704b37e289e4a911b2beb27c5562a0ecd5edd1e91"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:07:32.639334Z","signature_b64":"S8qhMQvV4FeoKMNKhUY3XAgaOxGBInZr2Ha5zX+aZ5hIfof8hkHEc0wMMaYjO3GVjOr9t8cz/XFMfYjJk0/YDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fd6a2e8452ad5d8808e68fa832ed2f1319607f59025a26ec1a5eee2c0d71707","last_reissued_at":"2026-05-18T02:07:32.638701Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:07:32.638701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Schaefer's theorem for graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.LO"],"primary_cat":"cs.CC","authors_text":"Manuel Bodirsky, Michael Pinsker","submitted_at":"2010-11-12T12:15:48Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2894","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1011.2894","created_at":"2026-05-18T02:07:32.638809+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.2894v5","created_at":"2026-05-18T02:07:32.638809+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2894","created_at":"2026-05-18T02:07:32.638809+00:00"},{"alias_kind":"pith_short_12","alias_value":"R7LKF2CFFLK5","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"R7LKF2CFFLK5RAEO","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"R7LKF2CF","created_at":"2026-05-18T12:26:13.927090+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/R7LKF2CFFLK5RAEOND5IGLWS6E","json":"https://pith.science/pith/R7LKF2CFFLK5RAEOND5IGLWS6E.json","graph_json":"https://pith.science/api/pith-number/R7LKF2CFFLK5RAEOND5IGLWS6E/graph.json","events_json":"https://pith.science/api/pith-number/R7LKF2CFFLK5RAEOND5IGLWS6E/events.json","paper":"https://pith.science/paper/R7LKF2CF"},"agent_actions":{"view_html":"https://pith.science/pith/R7LKF2CFFLK5RAEOND5IGLWS6E","download_json":"https://pith.science/pith/R7LKF2CFFLK5RAEOND5IGLWS6E.json","view_paper":"https://pith.science/paper/R7LKF2CF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.2894&json=true","fetch_graph":"https://pith.science/api/pith-number/R7LKF2CFFLK5RAEOND5IGLWS6E/graph.json","fetch_events":"https://pith.science/api/pith-number/R7LKF2CFFLK5RAEOND5IGLWS6E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R7LKF2CFFLK5RAEOND5IGLWS6E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R7LKF2CFFLK5RAEOND5IGLWS6E/action/storage_attestation","attest_author":"https://pith.science/pith/R7LKF2CFFLK5RAEOND5IGLWS6E/action/author_attestation","sign_citation":"https://pith.science/pith/R7LKF2CFFLK5RAEOND5IGLWS6E/action/citation_signature","submit_replication":"https://pith.science/pith/R7LKF2CFFLK5RAEOND5IGLWS6E/action/replication_record"}},"created_at":"2026-05-18T02:07:32.638809+00:00","updated_at":"2026-05-18T02:07:32.638809+00:00"}