{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:35PLBM2JSCNBFP6R6JRLYM3MTJ","short_pith_number":"pith:35PLBM2J","schema_version":"1.0","canonical_sha256":"df5eb0b349909a12bfd1f262bc336c9a4109a67d6698f56fb37ef367cbb51492","source":{"kind":"arxiv","id":"2203.16712","version":1},"attestation_state":"computed","paper":{"title":"An algebraic approach to Borel CSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Riley Thornton","submitted_at":"2022-03-30T23:25:28Z","abstract_excerpt":"We adapt tools from the algebraic approach to constraint satisfaction problems to answer descriptive set theoretic questions about Borel CSPs. We show that if a structure $\\mathcal D$ does not have a Taylor polymorphism, then the corresponding Borel CSP is $\\mathbf{\\Sigma}^1_2$-complete. In particular, by the CSP Dichotomy Theorem, if $\\operatorname{CSP}(\\mathcal D)$ is $\\mathrm{NP}$-complete, then the Borel version, $\\operatorname{csp}_B(\\mathcal D)$, is $\\mathbf{\\Sigma}^1_2$-complete (assuming $\\mathrm{P}\\not=\\mathrm{NP}$). We also have partial converses, such as a descriptive analogue of th"},"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":"2203.16712","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2022-03-30T23:25:28Z","cross_cats_sorted":[],"title_canon_sha256":"05be8a13287eb5b7cc627ee96b837a5649793f448b4d23233868f0bff19d257f","abstract_canon_sha256":"db4a8b4b259fc0079591807e3a25855ebd56f0ecae715368f002efd0257560e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:10:15.322515Z","signature_b64":"wPfEGshMipmlXYlxpyMT/4GvnAkhf0qGEhBep15moD1/ua6wfY1RHYcB7uZJbxHqaZULJtDftSy8eqTUXBe8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df5eb0b349909a12bfd1f262bc336c9a4109a67d6698f56fb37ef367cbb51492","last_reissued_at":"2026-07-05T04:10:15.322121Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:10:15.322121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An algebraic approach to Borel CSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Riley Thornton","submitted_at":"2022-03-30T23:25:28Z","abstract_excerpt":"We adapt tools from the algebraic approach to constraint satisfaction problems to answer descriptive set theoretic questions about Borel CSPs. We show that if a structure $\\mathcal D$ does not have a Taylor polymorphism, then the corresponding Borel CSP is $\\mathbf{\\Sigma}^1_2$-complete. In particular, by the CSP Dichotomy Theorem, if $\\operatorname{CSP}(\\mathcal D)$ is $\\mathrm{NP}$-complete, then the Borel version, $\\operatorname{csp}_B(\\mathcal D)$, is $\\mathbf{\\Sigma}^1_2$-complete (assuming $\\mathrm{P}\\not=\\mathrm{NP}$). We also have partial converses, such as a descriptive analogue of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.16712","kind":"arxiv","version":1},"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/2203.16712/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":"2203.16712","created_at":"2026-07-05T04:10:15.322177+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.16712v1","created_at":"2026-07-05T04:10:15.322177+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.16712","created_at":"2026-07-05T04:10:15.322177+00:00"},{"alias_kind":"pith_short_12","alias_value":"35PLBM2JSCNB","created_at":"2026-07-05T04:10:15.322177+00:00"},{"alias_kind":"pith_short_16","alias_value":"35PLBM2JSCNBFP6R","created_at":"2026-07-05T04:10:15.322177+00:00"},{"alias_kind":"pith_short_8","alias_value":"35PLBM2J","created_at":"2026-07-05T04:10:15.322177+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.05228","citing_title":"No Countable Basis for Borel Directed Graphs of Dichromatic Number at Least Three","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/35PLBM2JSCNBFP6R6JRLYM3MTJ","json":"https://pith.science/pith/35PLBM2JSCNBFP6R6JRLYM3MTJ.json","graph_json":"https://pith.science/api/pith-number/35PLBM2JSCNBFP6R6JRLYM3MTJ/graph.json","events_json":"https://pith.science/api/pith-number/35PLBM2JSCNBFP6R6JRLYM3MTJ/events.json","paper":"https://pith.science/paper/35PLBM2J"},"agent_actions":{"view_html":"https://pith.science/pith/35PLBM2JSCNBFP6R6JRLYM3MTJ","download_json":"https://pith.science/pith/35PLBM2JSCNBFP6R6JRLYM3MTJ.json","view_paper":"https://pith.science/paper/35PLBM2J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.16712&json=true","fetch_graph":"https://pith.science/api/pith-number/35PLBM2JSCNBFP6R6JRLYM3MTJ/graph.json","fetch_events":"https://pith.science/api/pith-number/35PLBM2JSCNBFP6R6JRLYM3MTJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/35PLBM2JSCNBFP6R6JRLYM3MTJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/35PLBM2JSCNBFP6R6JRLYM3MTJ/action/storage_attestation","attest_author":"https://pith.science/pith/35PLBM2JSCNBFP6R6JRLYM3MTJ/action/author_attestation","sign_citation":"https://pith.science/pith/35PLBM2JSCNBFP6R6JRLYM3MTJ/action/citation_signature","submit_replication":"https://pith.science/pith/35PLBM2JSCNBFP6R6JRLYM3MTJ/action/replication_record"}},"created_at":"2026-07-05T04:10:15.322177+00:00","updated_at":"2026-07-05T04:10:15.322177+00:00"}