{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:OZJYV5SX7UC6VNOLBW7LRO4V5W","short_pith_number":"pith:OZJYV5SX","schema_version":"1.0","canonical_sha256":"76538af657fd05eab5cb0dbeb8bb95ed84221e2c3a486e7a34ba298e0b2693c1","source":{"kind":"arxiv","id":"2508.11540","version":1},"attestation_state":"computed","paper":{"title":"The Constraint Satisfaction Problem Over Multisorted Cores","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CC","authors_text":"Dejan Delic, John Marcoux","submitted_at":"2025-08-15T15:37:20Z","abstract_excerpt":"Constraint Satisfaction Problems (CSPs, for short) make up a class of problems with applications in many areas of computer science. The first classification of these problems was given by Schaeffer who showed that every CSP over the domain {0,1} is either in P or is NP-complete. More recently this was shown to hold for all CSPs over finite relational structures independently by Bulatov and Zhuk. Furthermore, they characterized the complexity based solely on the polymorphism algebra of the associated relational structure, building upon the deep connections between universal algebra and complexi"},"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":"2508.11540","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-08-15T15:37:20Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"f6e4a43917151289b521d0f140c36812c420ae28c552346fcf1711ff9095a870","abstract_canon_sha256":"4715f5af49d57b89d0596e62e3c8431d8d334733d3e7ca473ac369eed71d7700"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:54:35.075709Z","signature_b64":"wnB5TsusYAOpZTXy7qVqXDTUWPPSRuH6UhBKcRC4Lnr/Y/KJGTP+fy/WwEE/8N0zCdIUo09tGyRqHRpBn6orAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76538af657fd05eab5cb0dbeb8bb95ed84221e2c3a486e7a34ba298e0b2693c1","last_reissued_at":"2026-07-05T11:54:35.075266Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:54:35.075266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Constraint Satisfaction Problem Over Multisorted Cores","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CC","authors_text":"Dejan Delic, John Marcoux","submitted_at":"2025-08-15T15:37:20Z","abstract_excerpt":"Constraint Satisfaction Problems (CSPs, for short) make up a class of problems with applications in many areas of computer science. The first classification of these problems was given by Schaeffer who showed that every CSP over the domain {0,1} is either in P or is NP-complete. More recently this was shown to hold for all CSPs over finite relational structures independently by Bulatov and Zhuk. Furthermore, they characterized the complexity based solely on the polymorphism algebra of the associated relational structure, building upon the deep connections between universal algebra and complexi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.11540","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/2508.11540/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":"2508.11540","created_at":"2026-07-05T11:54:35.075323+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.11540v1","created_at":"2026-07-05T11:54:35.075323+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.11540","created_at":"2026-07-05T11:54:35.075323+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZJYV5SX7UC6","created_at":"2026-07-05T11:54:35.075323+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZJYV5SX7UC6VNOL","created_at":"2026-07-05T11:54:35.075323+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZJYV5SX","created_at":"2026-07-05T11:54:35.075323+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/OZJYV5SX7UC6VNOLBW7LRO4V5W","json":"https://pith.science/pith/OZJYV5SX7UC6VNOLBW7LRO4V5W.json","graph_json":"https://pith.science/api/pith-number/OZJYV5SX7UC6VNOLBW7LRO4V5W/graph.json","events_json":"https://pith.science/api/pith-number/OZJYV5SX7UC6VNOLBW7LRO4V5W/events.json","paper":"https://pith.science/paper/OZJYV5SX"},"agent_actions":{"view_html":"https://pith.science/pith/OZJYV5SX7UC6VNOLBW7LRO4V5W","download_json":"https://pith.science/pith/OZJYV5SX7UC6VNOLBW7LRO4V5W.json","view_paper":"https://pith.science/paper/OZJYV5SX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.11540&json=true","fetch_graph":"https://pith.science/api/pith-number/OZJYV5SX7UC6VNOLBW7LRO4V5W/graph.json","fetch_events":"https://pith.science/api/pith-number/OZJYV5SX7UC6VNOLBW7LRO4V5W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZJYV5SX7UC6VNOLBW7LRO4V5W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZJYV5SX7UC6VNOLBW7LRO4V5W/action/storage_attestation","attest_author":"https://pith.science/pith/OZJYV5SX7UC6VNOLBW7LRO4V5W/action/author_attestation","sign_citation":"https://pith.science/pith/OZJYV5SX7UC6VNOLBW7LRO4V5W/action/citation_signature","submit_replication":"https://pith.science/pith/OZJYV5SX7UC6VNOLBW7LRO4V5W/action/replication_record"}},"created_at":"2026-07-05T11:54:35.075323+00:00","updated_at":"2026-07-05T11:54:35.075323+00:00"}