{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:5WOA7YLDK7WQATUTWBIDYL2ICR","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":"147371782d3e4cf809cbfd6e804b14520643ba0adec1f44d50fc04bd68b36617","cross_cats_sorted":["cs.CC"],"license":"","primary_cat":"cs.LO","submitted_at":"2007-07-17T16:23:45Z","title_canon_sha256":"1a0ace96246539b597be838ffa1840bb5ace304b8f8e8cd60d31d1affe395a8f"},"schema_version":"1.0","source":{"id":"0707.2562","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0707.2562","created_at":"2026-05-18T01:37:42Z"},{"alias_kind":"arxiv_version","alias_value":"0707.2562v2","created_at":"2026-05-18T01:37:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0707.2562","created_at":"2026-05-18T01:37:42Z"},{"alias_kind":"pith_short_12","alias_value":"5WOA7YLDK7WQ","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"5WOA7YLDK7WQATUT","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"5WOA7YLD","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:e0b5b34719aa60d890e4a4aae60c0945dc51c4954bfa6a6baef34726af256783","target":"graph","created_at":"2026-05-18T01:37:42Z","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":"We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show that it is decidable to determine whether a constraint satisfaction problem is first-order definable: we show the general problem to be NP-complete, and give a polynomial-time algorithm in the case of cores. A slight modification of this algorithm provides, for first-order definable CSP's, a simple poly-time algorithm to produce a solution when one exists. As an application of our algebraic characterisation of first order CSP's, w","authors_text":"Benoit Larose, Claude Tardif, Cynthia Loten","cross_cats":["cs.CC"],"headline":"","license":"","primary_cat":"cs.LO","submitted_at":"2007-07-17T16:23:45Z","title":"A Characterisation of First-Order Constraint Satisfaction Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0707.2562","kind":"arxiv","version":2},"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:6101a2ac5da18d8e204154c07557fd71d2cda6b58011251f082e1af26d56c497","target":"record","created_at":"2026-05-18T01:37:42Z","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":"147371782d3e4cf809cbfd6e804b14520643ba0adec1f44d50fc04bd68b36617","cross_cats_sorted":["cs.CC"],"license":"","primary_cat":"cs.LO","submitted_at":"2007-07-17T16:23:45Z","title_canon_sha256":"1a0ace96246539b597be838ffa1840bb5ace304b8f8e8cd60d31d1affe395a8f"},"schema_version":"1.0","source":{"id":"0707.2562","kind":"arxiv","version":2}},"canonical_sha256":"ed9c0fe16357ed004e93b0503c2f48145b1622a8c34c1d78e1a269bccc635561","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed9c0fe16357ed004e93b0503c2f48145b1622a8c34c1d78e1a269bccc635561","first_computed_at":"2026-05-18T01:37:42.691993Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:42.691993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"COIMNj8CZdJiTiv9SlVIh4chzouCjBjLPgE54zHN8TEfcuYP05GAT1kAnHyqBc9Vd2IOyYgwYeq6lzfEO101DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:42.692698Z","signed_message":"canonical_sha256_bytes"},"source_id":"0707.2562","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6101a2ac5da18d8e204154c07557fd71d2cda6b58011251f082e1af26d56c497","sha256:e0b5b34719aa60d890e4a4aae60c0945dc51c4954bfa6a6baef34726af256783"],"state_sha256":"bfe35b155720faaa2c542bf318e1dd5993a45efa2203cb7ac54384a619ea4401"}