{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4KH7NEJANHVIAIMAFR7FFSMC2X","short_pith_number":"pith:4KH7NEJA","schema_version":"1.0","canonical_sha256":"e28ff6912069ea8021802c7e52c982d5fbba188de49a2b6edd3a6d4287202c77","source":{"kind":"arxiv","id":"1704.01914","version":11},"attestation_state":"computed","paper":{"title":"A Proof of the CSP Dichotomy Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Dmitriy Zhuk","submitted_at":"2017-04-06T16:27:29Z","abstract_excerpt":"Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. The standard way to parameterize interesting subclasses of the constraint satisfaction problem is via finite constraint languages. The main problem is to classify those subclasses that are solvable in polynomial time and those that are NP-complete. It was conjectured that if a constraint language has a weak near unanimity polymorphism then the corresponding constra"},"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":"1704.01914","kind":"arxiv","version":11},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-04-06T16:27:29Z","cross_cats_sorted":[],"title_canon_sha256":"8675f48d2444fb65b3661ee96091548b7a1d1ff5acfc9d78e5f54ace886a7138","abstract_canon_sha256":"a9355bf56b2f255366dd449d8ed73bbac47548303ed2ecf8337006b45b17d3e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:39:40.019668Z","signature_b64":"O7wNtSrP9i2sL3WKOSNj0XWzo+e3Q9KcM/ZYGoO0JQ7TXpqhkI79aG/94QfMjRHdZvjlj5D7Qg5o091DeTHBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e28ff6912069ea8021802c7e52c982d5fbba188de49a2b6edd3a6d4287202c77","last_reissued_at":"2026-07-05T01:39:40.019293Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:39:40.019293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Proof of the CSP Dichotomy Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Dmitriy Zhuk","submitted_at":"2017-04-06T16:27:29Z","abstract_excerpt":"Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. The standard way to parameterize interesting subclasses of the constraint satisfaction problem is via finite constraint languages. The main problem is to classify those subclasses that are solvable in polynomial time and those that are NP-complete. It was conjectured that if a constraint language has a weak near unanimity polymorphism then the corresponding constra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01914","kind":"arxiv","version":11},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1704.01914/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1704.01914","created_at":"2026-07-05T01:39:40.019359+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.01914v11","created_at":"2026-07-05T01:39:40.019359+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01914","created_at":"2026-07-05T01:39:40.019359+00:00"},{"alias_kind":"pith_short_12","alias_value":"4KH7NEJANHVI","created_at":"2026-07-05T01:39:40.019359+00:00"},{"alias_kind":"pith_short_16","alias_value":"4KH7NEJANHVIAIMA","created_at":"2026-07-05T01:39:40.019359+00:00"},{"alias_kind":"pith_short_8","alias_value":"4KH7NEJA","created_at":"2026-07-05T01:39:40.019359+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24711","citing_title":"Almost Symmetric Linear Arc Monadic Datalog and Transitive Tournaments","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2606.03930","citing_title":"Primitive Positive Constructions Among Finite Permutation Groups","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2407.04924","citing_title":"Symmetric Linear Arc Monadic Datalog and Gadget Reductions","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2602.00778","citing_title":"The complexity of finding coset-generating polymorphisms and the promise metaproblem","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2602.14243","citing_title":"Graph Homomorphisms and Universal Algebra","ref_index":109,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4KH7NEJANHVIAIMAFR7FFSMC2X","json":"https://pith.science/pith/4KH7NEJANHVIAIMAFR7FFSMC2X.json","graph_json":"https://pith.science/api/pith-number/4KH7NEJANHVIAIMAFR7FFSMC2X/graph.json","events_json":"https://pith.science/api/pith-number/4KH7NEJANHVIAIMAFR7FFSMC2X/events.json","paper":"https://pith.science/paper/4KH7NEJA"},"agent_actions":{"view_html":"https://pith.science/pith/4KH7NEJANHVIAIMAFR7FFSMC2X","download_json":"https://pith.science/pith/4KH7NEJANHVIAIMAFR7FFSMC2X.json","view_paper":"https://pith.science/paper/4KH7NEJA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.01914&json=true","fetch_graph":"https://pith.science/api/pith-number/4KH7NEJANHVIAIMAFR7FFSMC2X/graph.json","fetch_events":"https://pith.science/api/pith-number/4KH7NEJANHVIAIMAFR7FFSMC2X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4KH7NEJANHVIAIMAFR7FFSMC2X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4KH7NEJANHVIAIMAFR7FFSMC2X/action/storage_attestation","attest_author":"https://pith.science/pith/4KH7NEJANHVIAIMAFR7FFSMC2X/action/author_attestation","sign_citation":"https://pith.science/pith/4KH7NEJANHVIAIMAFR7FFSMC2X/action/citation_signature","submit_replication":"https://pith.science/pith/4KH7NEJANHVIAIMAFR7FFSMC2X/action/replication_record"}},"created_at":"2026-07-05T01:39:40.019359+00:00","updated_at":"2026-07-05T01:39:40.019359+00:00"}