{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZHFFTIOFLOKV6EUTAA2NNXPTJ6","short_pith_number":"pith:ZHFFTIOF","schema_version":"1.0","canonical_sha256":"c9ca59a1c55b955f12930034d6ddf34fbbd3deb93a08861fa0f2c590a58f0638","source":{"kind":"arxiv","id":"1703.03021","version":2},"attestation_state":"computed","paper":{"title":"A dichotomy theorem for nonuniform CSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andrei A. Bulatov","submitted_at":"2017-03-08T20:14:27Z","abstract_excerpt":"In this paper we prove the Dichotomy Conjecture on the complexity of nonuniform constraint satisfaction problems posed by Feder and Vardi."},"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":"1703.03021","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-03-08T20:14:27Z","cross_cats_sorted":[],"title_canon_sha256":"eecd63f630287a11b7077cfae6f3f28a548161a36805638cd858d01e370d85aa","abstract_canon_sha256":"ddf3e0fc0c88d736ead089338c53e39c99fc5533bf631d5e7c8b2bdfb03abdc9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:55.110584Z","signature_b64":"2RqO19vCCfcBaYR5NbLuzIY8+s869UlVFPDCV6XkPR6INTqndpm9yso2958GTlcvvI8/g90eJPgXGK7EgWMUDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9ca59a1c55b955f12930034d6ddf34fbbd3deb93a08861fa0f2c590a58f0638","last_reissued_at":"2026-05-18T00:46:55.109855Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:55.109855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A dichotomy theorem for nonuniform CSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andrei A. Bulatov","submitted_at":"2017-03-08T20:14:27Z","abstract_excerpt":"In this paper we prove the Dichotomy Conjecture on the complexity of nonuniform constraint satisfaction problems posed by Feder and Vardi."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03021","kind":"arxiv","version":2},"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":"1703.03021","created_at":"2026-05-18T00:46:55.109975+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.03021v2","created_at":"2026-05-18T00:46:55.109975+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03021","created_at":"2026-05-18T00:46:55.109975+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZHFFTIOFLOKV","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZHFFTIOFLOKV6EUT","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZHFFTIOF","created_at":"2026-05-18T12:31:59.375834+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.06335","citing_title":"Toward a Uniform Algorithm and Uniform Reduction for Constraint Problems","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05161","citing_title":"SMB algebras II: On the Constraint Satisfaction Problem over Semilattices of Mal'cev Blocks","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZHFFTIOFLOKV6EUTAA2NNXPTJ6","json":"https://pith.science/pith/ZHFFTIOFLOKV6EUTAA2NNXPTJ6.json","graph_json":"https://pith.science/api/pith-number/ZHFFTIOFLOKV6EUTAA2NNXPTJ6/graph.json","events_json":"https://pith.science/api/pith-number/ZHFFTIOFLOKV6EUTAA2NNXPTJ6/events.json","paper":"https://pith.science/paper/ZHFFTIOF"},"agent_actions":{"view_html":"https://pith.science/pith/ZHFFTIOFLOKV6EUTAA2NNXPTJ6","download_json":"https://pith.science/pith/ZHFFTIOFLOKV6EUTAA2NNXPTJ6.json","view_paper":"https://pith.science/paper/ZHFFTIOF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.03021&json=true","fetch_graph":"https://pith.science/api/pith-number/ZHFFTIOFLOKV6EUTAA2NNXPTJ6/graph.json","fetch_events":"https://pith.science/api/pith-number/ZHFFTIOFLOKV6EUTAA2NNXPTJ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZHFFTIOFLOKV6EUTAA2NNXPTJ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZHFFTIOFLOKV6EUTAA2NNXPTJ6/action/storage_attestation","attest_author":"https://pith.science/pith/ZHFFTIOFLOKV6EUTAA2NNXPTJ6/action/author_attestation","sign_citation":"https://pith.science/pith/ZHFFTIOFLOKV6EUTAA2NNXPTJ6/action/citation_signature","submit_replication":"https://pith.science/pith/ZHFFTIOFLOKV6EUTAA2NNXPTJ6/action/replication_record"}},"created_at":"2026-05-18T00:46:55.109975+00:00","updated_at":"2026-05-18T00:46:55.109975+00:00"}