{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:5WOA7YLDK7WQATUTWBIDYL2ICR","short_pith_number":"pith:5WOA7YLD","schema_version":"1.0","canonical_sha256":"ed9c0fe16357ed004e93b0503c2f48145b1622a8c34c1d78e1a269bccc635561","source":{"kind":"arxiv","id":"0707.2562","version":2},"attestation_state":"computed","paper":{"title":"A Characterisation of First-Order Constraint Satisfaction Problems","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Benoit Larose, Claude Tardif, Cynthia Loten","submitted_at":"2007-07-17T16:23:45Z","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"},"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":"0707.2562","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2007-07-17T16:23:45Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"1a0ace96246539b597be838ffa1840bb5ace304b8f8e8cd60d31d1affe395a8f","abstract_canon_sha256":"147371782d3e4cf809cbfd6e804b14520643ba0adec1f44d50fc04bd68b36617"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:42.692698Z","signature_b64":"COIMNj8CZdJiTiv9SlVIh4chzouCjBjLPgE54zHN8TEfcuYP05GAT1kAnHyqBc9Vd2IOyYgwYeq6lzfEO101DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed9c0fe16357ed004e93b0503c2f48145b1622a8c34c1d78e1a269bccc635561","last_reissued_at":"2026-05-18T01:37:42.691993Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:42.691993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Characterisation of First-Order Constraint Satisfaction Problems","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Benoit Larose, Claude Tardif, Cynthia Loten","submitted_at":"2007-07-17T16:23:45Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0707.2562","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0707.2562","created_at":"2026-05-18T01:37:42.692109+00:00"},{"alias_kind":"arxiv_version","alias_value":"0707.2562v2","created_at":"2026-05-18T01:37:42.692109+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0707.2562","created_at":"2026-05-18T01:37:42.692109+00:00"},{"alias_kind":"pith_short_12","alias_value":"5WOA7YLDK7WQ","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"5WOA7YLDK7WQATUT","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"5WOA7YLD","created_at":"2026-05-18T12:25:55.427421+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/5WOA7YLDK7WQATUTWBIDYL2ICR","json":"https://pith.science/pith/5WOA7YLDK7WQATUTWBIDYL2ICR.json","graph_json":"https://pith.science/api/pith-number/5WOA7YLDK7WQATUTWBIDYL2ICR/graph.json","events_json":"https://pith.science/api/pith-number/5WOA7YLDK7WQATUTWBIDYL2ICR/events.json","paper":"https://pith.science/paper/5WOA7YLD"},"agent_actions":{"view_html":"https://pith.science/pith/5WOA7YLDK7WQATUTWBIDYL2ICR","download_json":"https://pith.science/pith/5WOA7YLDK7WQATUTWBIDYL2ICR.json","view_paper":"https://pith.science/paper/5WOA7YLD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0707.2562&json=true","fetch_graph":"https://pith.science/api/pith-number/5WOA7YLDK7WQATUTWBIDYL2ICR/graph.json","fetch_events":"https://pith.science/api/pith-number/5WOA7YLDK7WQATUTWBIDYL2ICR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5WOA7YLDK7WQATUTWBIDYL2ICR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5WOA7YLDK7WQATUTWBIDYL2ICR/action/storage_attestation","attest_author":"https://pith.science/pith/5WOA7YLDK7WQATUTWBIDYL2ICR/action/author_attestation","sign_citation":"https://pith.science/pith/5WOA7YLDK7WQATUTWBIDYL2ICR/action/citation_signature","submit_replication":"https://pith.science/pith/5WOA7YLDK7WQATUTWBIDYL2ICR/action/replication_record"}},"created_at":"2026-05-18T01:37:42.692109+00:00","updated_at":"2026-05-18T01:37:42.692109+00:00"}