{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:QAQQWCZ56UTTW7D4RPCT6XQA34","short_pith_number":"pith:QAQQWCZ5","schema_version":"1.0","canonical_sha256":"80210b0b3df5273b7c7c8bc53f5e00df0749d64eae76de6dd0a5da33a4511387","source":{"kind":"arxiv","id":"1103.1542","version":2},"attestation_state":"computed","paper":{"title":"The tractability of CSP classes defined by forbidden patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.AI","authors_text":"Andr\\'as Z. Salamon, David A. Cohen, Martin C. Cooper, P\\'aid\\'i Creed","submitted_at":"2011-03-08T14:43:17Z","abstract_excerpt":"The constraint satisfaction problem (CSP) is a general problem central to computer science and artificial intelligence. Although the CSP is NP-hard in general, considerable effort has been spent on identifying tractable subclasses. The main two approaches consider structural properties (restrictions on the hypergraph of constraint scopes) and relational properties (restrictions on the language of constraint relations). Recently, some authors have considered hybrid properties that restrict the constraint hypergraph and the relations simultaneously.\n  Our key contribution is the novel concept of"},"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":"1103.1542","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-03-08T14:43:17Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"242a7e74fb0842470515bf127e38d221160d6b33f9494680b13920cb352c8e71","abstract_canon_sha256":"08091278c2537f39776698edba8df908df694c18a223c6d48bf1c2bd563db14b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:10.250328Z","signature_b64":"ZXOTMzcKAl/LZIa4iljo4fszs1I7P9zfIngFE4ANweZcjhwP4RnFbggtQoVPVeejatAHj1CWq1/79xDwkQ/ECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80210b0b3df5273b7c7c8bc53f5e00df0749d64eae76de6dd0a5da33a4511387","last_reissued_at":"2026-05-18T02:48:10.249650Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:10.249650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The tractability of CSP classes defined by forbidden patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.AI","authors_text":"Andr\\'as Z. Salamon, David A. Cohen, Martin C. Cooper, P\\'aid\\'i Creed","submitted_at":"2011-03-08T14:43:17Z","abstract_excerpt":"The constraint satisfaction problem (CSP) is a general problem central to computer science and artificial intelligence. Although the CSP is NP-hard in general, considerable effort has been spent on identifying tractable subclasses. The main two approaches consider structural properties (restrictions on the hypergraph of constraint scopes) and relational properties (restrictions on the language of constraint relations). Recently, some authors have considered hybrid properties that restrict the constraint hypergraph and the relations simultaneously.\n  Our key contribution is the novel concept of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1542","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":"1103.1542","created_at":"2026-05-18T02:48:10.249757+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.1542v2","created_at":"2026-05-18T02:48:10.249757+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1542","created_at":"2026-05-18T02:48:10.249757+00:00"},{"alias_kind":"pith_short_12","alias_value":"QAQQWCZ56UTT","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"QAQQWCZ56UTTW7D4","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"QAQQWCZ5","created_at":"2026-05-18T12:26:39.201973+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/QAQQWCZ56UTTW7D4RPCT6XQA34","json":"https://pith.science/pith/QAQQWCZ56UTTW7D4RPCT6XQA34.json","graph_json":"https://pith.science/api/pith-number/QAQQWCZ56UTTW7D4RPCT6XQA34/graph.json","events_json":"https://pith.science/api/pith-number/QAQQWCZ56UTTW7D4RPCT6XQA34/events.json","paper":"https://pith.science/paper/QAQQWCZ5"},"agent_actions":{"view_html":"https://pith.science/pith/QAQQWCZ56UTTW7D4RPCT6XQA34","download_json":"https://pith.science/pith/QAQQWCZ56UTTW7D4RPCT6XQA34.json","view_paper":"https://pith.science/paper/QAQQWCZ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.1542&json=true","fetch_graph":"https://pith.science/api/pith-number/QAQQWCZ56UTTW7D4RPCT6XQA34/graph.json","fetch_events":"https://pith.science/api/pith-number/QAQQWCZ56UTTW7D4RPCT6XQA34/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QAQQWCZ56UTTW7D4RPCT6XQA34/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QAQQWCZ56UTTW7D4RPCT6XQA34/action/storage_attestation","attest_author":"https://pith.science/pith/QAQQWCZ56UTTW7D4RPCT6XQA34/action/author_attestation","sign_citation":"https://pith.science/pith/QAQQWCZ56UTTW7D4RPCT6XQA34/action/citation_signature","submit_replication":"https://pith.science/pith/QAQQWCZ56UTTW7D4RPCT6XQA34/action/replication_record"}},"created_at":"2026-05-18T02:48:10.249757+00:00","updated_at":"2026-05-18T02:48:10.249757+00:00"}