{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:5WOA7YLDK7WQATUTWBIDYL2ICR","short_pith_number":"pith:5WOA7YLD","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"},"canonical_sha256":"ed9c0fe16357ed004e93b0503c2f48145b1622a8c34c1d78e1a269bccc635561","source":{"kind":"arxiv","id":"0707.2562","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:5WOA7YLDK7WQATUTWBIDYL2ICR","target":"record","payload":{"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"},"canonical_sha256":"ed9c0fe16357ed004e93b0503c2f48145b1622a8c34c1d78e1a269bccc635561","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"},"source_kind":"arxiv","source_id":"0707.2562","source_version":2,"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-18T01:37:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kXp7QBQoh0J7ghnY0iocIzdYpx0tCIKUCJROmB2y3jC2lFMFkD1gII+taO30YkcjTCCFzOLRDc5I+h1YWgAbBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:16:52.624259Z"},"content_sha256":"6101a2ac5da18d8e204154c07557fd71d2cda6b58011251f082e1af26d56c497","schema_version":"1.0","event_id":"sha256:6101a2ac5da18d8e204154c07557fd71d2cda6b58011251f082e1af26d56c497"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:5WOA7YLDK7WQATUTWBIDYL2ICR","target":"graph","payload":{"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"},"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-18T01:37:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/1D3ZDZN/CfwpDiDyV5Flc1juE6fhhMonp2SP/Wsy5qfISGHMI5mplTtHbRto5Q/Bws4HusCQ3My7NxNJZGvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:16:52.625018Z"},"content_sha256":"e0b5b34719aa60d890e4a4aae60c0945dc51c4954bfa6a6baef34726af256783","schema_version":"1.0","event_id":"sha256:e0b5b34719aa60d890e4a4aae60c0945dc51c4954bfa6a6baef34726af256783"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5WOA7YLDK7WQATUTWBIDYL2ICR/bundle.json","state_url":"https://pith.science/pith/5WOA7YLDK7WQATUTWBIDYL2ICR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5WOA7YLDK7WQATUTWBIDYL2ICR/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-11T17:16:52Z","links":{"resolver":"https://pith.science/pith/5WOA7YLDK7WQATUTWBIDYL2ICR","bundle":"https://pith.science/pith/5WOA7YLDK7WQATUTWBIDYL2ICR/bundle.json","state":"https://pith.science/pith/5WOA7YLDK7WQATUTWBIDYL2ICR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5WOA7YLDK7WQATUTWBIDYL2ICR/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d3Q18+mHUuFb+foMxuDEHZye2gMHxZcz0o5Tn2tS/IoujdPm4FhjXlKcCtbi/sTBhKXe29MSHLLom255Qw/aBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T17:16:52.628707Z","bundle_sha256":"293c2d9206f8fb89d4811a915cd5818e431decc9c7cfa43146208fffa3bd6f97"}}