{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:OZJYV5SX7UC6VNOLBW7LRO4V5W","short_pith_number":"pith:OZJYV5SX","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"},"canonical_sha256":"76538af657fd05eab5cb0dbeb8bb95ed84221e2c3a486e7a34ba298e0b2693c1","source":{"kind":"arxiv","id":"2508.11540","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.11540","created_at":"2026-07-05T11:54:35Z"},{"alias_kind":"arxiv_version","alias_value":"2508.11540v1","created_at":"2026-07-05T11:54:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.11540","created_at":"2026-07-05T11:54:35Z"},{"alias_kind":"pith_short_12","alias_value":"OZJYV5SX7UC6","created_at":"2026-07-05T11:54:35Z"},{"alias_kind":"pith_short_16","alias_value":"OZJYV5SX7UC6VNOL","created_at":"2026-07-05T11:54:35Z"},{"alias_kind":"pith_short_8","alias_value":"OZJYV5SX","created_at":"2026-07-05T11:54:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:OZJYV5SX7UC6VNOLBW7LRO4V5W","target":"record","payload":{"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"},"canonical_sha256":"76538af657fd05eab5cb0dbeb8bb95ed84221e2c3a486e7a34ba298e0b2693c1","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"},"source_kind":"arxiv","source_id":"2508.11540","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:54:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AWSNGLdN7O9DQqIUn7M0iZZ51XeNSKFQLErg5Tmj1XpjpVTsuQo8rinPbcNyR2C8ejm5MJB4bPaKr8JxP1t/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T03:05:51.592738Z"},"content_sha256":"87b23355edbab3e164dada75e3d0d1bcc1a18e8ba5c67f6f32c9f00cced5252e","schema_version":"1.0","event_id":"sha256:87b23355edbab3e164dada75e3d0d1bcc1a18e8ba5c67f6f32c9f00cced5252e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:OZJYV5SX7UC6VNOLBW7LRO4V5W","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:54:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k4qAZq1c3EFQ7XtXUp/PfCfDQNkNg5mL+pRJl2ja5M8YHkZIRxj9R5grvpiOcJgn3CwL2/ptoSNOb++9G/mgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T03:05:51.593203Z"},"content_sha256":"8bc3598c3158aae32d7fb4f94fc5df845e6157ed1fc7dcb75ed8ba744fe28216","schema_version":"1.0","event_id":"sha256:8bc3598c3158aae32d7fb4f94fc5df845e6157ed1fc7dcb75ed8ba744fe28216"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OZJYV5SX7UC6VNOLBW7LRO4V5W/bundle.json","state_url":"https://pith.science/pith/OZJYV5SX7UC6VNOLBW7LRO4V5W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OZJYV5SX7UC6VNOLBW7LRO4V5W/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-05T03:05:51Z","links":{"resolver":"https://pith.science/pith/OZJYV5SX7UC6VNOLBW7LRO4V5W","bundle":"https://pith.science/pith/OZJYV5SX7UC6VNOLBW7LRO4V5W/bundle.json","state":"https://pith.science/pith/OZJYV5SX7UC6VNOLBW7LRO4V5W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OZJYV5SX7UC6VNOLBW7LRO4V5W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:OZJYV5SX7UC6VNOLBW7LRO4V5W","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4715f5af49d57b89d0596e62e3c8431d8d334733d3e7ca473ac369eed71d7700","cross_cats_sorted":["cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-08-15T15:37:20Z","title_canon_sha256":"f6e4a43917151289b521d0f140c36812c420ae28c552346fcf1711ff9095a870"},"schema_version":"1.0","source":{"id":"2508.11540","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.11540","created_at":"2026-07-05T11:54:35Z"},{"alias_kind":"arxiv_version","alias_value":"2508.11540v1","created_at":"2026-07-05T11:54:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.11540","created_at":"2026-07-05T11:54:35Z"},{"alias_kind":"pith_short_12","alias_value":"OZJYV5SX7UC6","created_at":"2026-07-05T11:54:35Z"},{"alias_kind":"pith_short_16","alias_value":"OZJYV5SX7UC6VNOL","created_at":"2026-07-05T11:54:35Z"},{"alias_kind":"pith_short_8","alias_value":"OZJYV5SX","created_at":"2026-07-05T11:54:35Z"}],"graph_snapshots":[{"event_id":"sha256:8bc3598c3158aae32d7fb4f94fc5df845e6157ed1fc7dcb75ed8ba744fe28216","target":"graph","created_at":"2026-07-05T11:54:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2508.11540/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Dejan Delic, John Marcoux","cross_cats":["cs.LO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-08-15T15:37:20Z","title":"The Constraint Satisfaction Problem Over Multisorted Cores"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.11540","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:87b23355edbab3e164dada75e3d0d1bcc1a18e8ba5c67f6f32c9f00cced5252e","target":"record","created_at":"2026-07-05T11:54:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4715f5af49d57b89d0596e62e3c8431d8d334733d3e7ca473ac369eed71d7700","cross_cats_sorted":["cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-08-15T15:37:20Z","title_canon_sha256":"f6e4a43917151289b521d0f140c36812c420ae28c552346fcf1711ff9095a870"},"schema_version":"1.0","source":{"id":"2508.11540","kind":"arxiv","version":1}},"canonical_sha256":"76538af657fd05eab5cb0dbeb8bb95ed84221e2c3a486e7a34ba298e0b2693c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76538af657fd05eab5cb0dbeb8bb95ed84221e2c3a486e7a34ba298e0b2693c1","first_computed_at":"2026-07-05T11:54:35.075266Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:54:35.075266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wnB5TsusYAOpZTXy7qVqXDTUWPPSRuH6UhBKcRC4Lnr/Y/KJGTP+fy/WwEE/8N0zCdIUo09tGyRqHRpBn6orAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:54:35.075709Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.11540","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87b23355edbab3e164dada75e3d0d1bcc1a18e8ba5c67f6f32c9f00cced5252e","sha256:8bc3598c3158aae32d7fb4f94fc5df845e6157ed1fc7dcb75ed8ba744fe28216"],"state_sha256":"af66dd6476460d685d9ec32011a4d1669ec5ed493e440364899782f4b69817ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pmmo2SpcBRF0dY+LapJkgao1cYMv0mdjb6LdzzifKQMu2KXk7ROLH1593EF99IPIxdl7uF+juvfzLLISk46ECA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T03:05:51.597856Z","bundle_sha256":"cd7155e786f229395643baef280f0545ce7583cfe3124225639f88b39b4ef153"}}