{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:36Z2AGG2H3EJR6V5LKMMOOGR7E","short_pith_number":"pith:36Z2AGG2","canonical_record":{"source":{"id":"1210.6893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-10-25T16:21:37Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"408557577d38eaa488b45b280041663b3cf22744cf8c0a360ff72ad500061ed8","abstract_canon_sha256":"64913b953c96b7f3fb129d5ecae1a85828d7abaa8e6ed6a10c21c772b6467daa"},"schema_version":"1.0"},"canonical_sha256":"dfb3a018da3ec898fabd5a98c738d1f903aebd766597a3794c5bf55099bf98c1","source":{"kind":"arxiv","id":"1210.6893","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6893","created_at":"2026-05-18T03:42:22Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6893v1","created_at":"2026-05-18T03:42:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6893","created_at":"2026-05-18T03:42:22Z"},{"alias_kind":"pith_short_12","alias_value":"36Z2AGG2H3EJ","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"36Z2AGG2H3EJR6V5","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"36Z2AGG2","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:36Z2AGG2H3EJR6V5LKMMOOGR7E","target":"record","payload":{"canonical_record":{"source":{"id":"1210.6893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-10-25T16:21:37Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"408557577d38eaa488b45b280041663b3cf22744cf8c0a360ff72ad500061ed8","abstract_canon_sha256":"64913b953c96b7f3fb129d5ecae1a85828d7abaa8e6ed6a10c21c772b6467daa"},"schema_version":"1.0"},"canonical_sha256":"dfb3a018da3ec898fabd5a98c738d1f903aebd766597a3794c5bf55099bf98c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:22.892217Z","signature_b64":"vT2jLsroQAuAGKXEyC57viV0SJ234YHn+dTDfg/nz0hn96KSqQlvZCnhrMTLs0P7GbTwhIEemuRYZJB+30IRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfb3a018da3ec898fabd5a98c738d1f903aebd766597a3794c5bf55099bf98c1","last_reissued_at":"2026-05-18T03:42:22.891565Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:22.891565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.6893","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-05-18T03:42:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SSOFsTCX2p3m9jAPlM6C7fiHfq8IhYa63bakR0At6DEWr7igcqWD3nj83QIR8GCNB4dqUApEdR2Q4s7OJFCVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:56:57.596399Z"},"content_sha256":"a66f963c393333965e9ad8a1ee9fe5b36888bb685d13ff3e7b384559df0cd405","schema_version":"1.0","event_id":"sha256:a66f963c393333965e9ad8a1ee9fe5b36888bb685d13ff3e7b384559df0cd405"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:36Z2AGG2H3EJR6V5LKMMOOGR7E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the complexity of the model checking problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Barnaby Martin, Florent Madelaine","submitted_at":"2012-10-25T16:21:37Z","abstract_excerpt":"The model checking problem for various fragments of first-order logic has attracted much attention over the last two decades: in particular, for the primitive positive and the positive Horn fragments, which are better known as the constraint satisfaction problem and the quantified constraint satisfaction problem, respectively. These two fragments are in fact the only ones for which there is currently no known complexity classification. All other syntactic fragments can be easily classified, either directly or using Schaefer's dichotomy theorems for SAT and QSAT, with the exception of the posit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6893","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":""},"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-05-18T03:42:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"slbzpG4AfD4+l44/J3RkMUiD1njlfRQLCJPLYaM0SMw4C8RCFY8N+PJO2WBfolvToFFoR/2djI5gPwLEdBjJAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:56:57.596744Z"},"content_sha256":"503bf9c9afa3bb4583ac81237393b8dabd0051d5f3fc2a3b9c134dc8582d350d","schema_version":"1.0","event_id":"sha256:503bf9c9afa3bb4583ac81237393b8dabd0051d5f3fc2a3b9c134dc8582d350d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/36Z2AGG2H3EJR6V5LKMMOOGR7E/bundle.json","state_url":"https://pith.science/pith/36Z2AGG2H3EJR6V5LKMMOOGR7E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/36Z2AGG2H3EJR6V5LKMMOOGR7E/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-06-05T10:56:57Z","links":{"resolver":"https://pith.science/pith/36Z2AGG2H3EJR6V5LKMMOOGR7E","bundle":"https://pith.science/pith/36Z2AGG2H3EJR6V5LKMMOOGR7E/bundle.json","state":"https://pith.science/pith/36Z2AGG2H3EJR6V5LKMMOOGR7E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/36Z2AGG2H3EJR6V5LKMMOOGR7E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:36Z2AGG2H3EJR6V5LKMMOOGR7E","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":"64913b953c96b7f3fb129d5ecae1a85828d7abaa8e6ed6a10c21c772b6467daa","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-10-25T16:21:37Z","title_canon_sha256":"408557577d38eaa488b45b280041663b3cf22744cf8c0a360ff72ad500061ed8"},"schema_version":"1.0","source":{"id":"1210.6893","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6893","created_at":"2026-05-18T03:42:22Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6893v1","created_at":"2026-05-18T03:42:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6893","created_at":"2026-05-18T03:42:22Z"},{"alias_kind":"pith_short_12","alias_value":"36Z2AGG2H3EJ","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"36Z2AGG2H3EJR6V5","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"36Z2AGG2","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:503bf9c9afa3bb4583ac81237393b8dabd0051d5f3fc2a3b9c134dc8582d350d","target":"graph","created_at":"2026-05-18T03:42:22Z","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"},"paper":{"abstract_excerpt":"The model checking problem for various fragments of first-order logic has attracted much attention over the last two decades: in particular, for the primitive positive and the positive Horn fragments, which are better known as the constraint satisfaction problem and the quantified constraint satisfaction problem, respectively. These two fragments are in fact the only ones for which there is currently no known complexity classification. All other syntactic fragments can be easily classified, either directly or using Schaefer's dichotomy theorems for SAT and QSAT, with the exception of the posit","authors_text":"Barnaby Martin, Florent Madelaine","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-10-25T16:21:37Z","title":"On the complexity of the model checking problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6893","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:a66f963c393333965e9ad8a1ee9fe5b36888bb685d13ff3e7b384559df0cd405","target":"record","created_at":"2026-05-18T03:42:22Z","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":"64913b953c96b7f3fb129d5ecae1a85828d7abaa8e6ed6a10c21c772b6467daa","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-10-25T16:21:37Z","title_canon_sha256":"408557577d38eaa488b45b280041663b3cf22744cf8c0a360ff72ad500061ed8"},"schema_version":"1.0","source":{"id":"1210.6893","kind":"arxiv","version":1}},"canonical_sha256":"dfb3a018da3ec898fabd5a98c738d1f903aebd766597a3794c5bf55099bf98c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dfb3a018da3ec898fabd5a98c738d1f903aebd766597a3794c5bf55099bf98c1","first_computed_at":"2026-05-18T03:42:22.891565Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:22.891565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vT2jLsroQAuAGKXEyC57viV0SJ234YHn+dTDfg/nz0hn96KSqQlvZCnhrMTLs0P7GbTwhIEemuRYZJB+30IRAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:22.892217Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.6893","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a66f963c393333965e9ad8a1ee9fe5b36888bb685d13ff3e7b384559df0cd405","sha256:503bf9c9afa3bb4583ac81237393b8dabd0051d5f3fc2a3b9c134dc8582d350d"],"state_sha256":"88e3d38b1fadb579af78c391dc3495252e6eebf291fcd457c3192c70d0250da5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F/XpyHh+CdEC7BUDhDmfaIWTecTNABXO0IL5ejJmFMhxiVOwV8YuNJGxdlVa14+5nOLSVTRuBNG2AWbsXo+lDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:56:57.598756Z","bundle_sha256":"d1344ea2a9930284b6f55911358169fd978fa83cc81fe67ebcc73385384e7279"}}