{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OZXZ2HIPD7L3UVS4ANJAXAU3MM","short_pith_number":"pith:OZXZ2HIP","schema_version":"1.0","canonical_sha256":"766f9d1d0f1fd7ba565c03520b829b633f7c2ef5a5573ca5d01ae22b1958daca","source":{"kind":"arxiv","id":"1201.0856","version":10},"attestation_state":"computed","paper":{"title":"Complexity Classification in Infinite-Domain Constraint Satisfaction","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.DM","cs.LO","math.LO"],"primary_cat":"cs.CC","authors_text":"Manuel Bodirsky","submitted_at":"2012-01-04T09:39:46Z","abstract_excerpt":"A constraint satisfaction problem (CSP) is a computational problem where the input consists of a finite set of variables and a finite set of constraints, and where the task is to decide whether there exists a satisfying assignment of values to the variables. Depending on the type of constraints that we allow in the input, a CSP might be tractable, or computationally hard. In recent years, general criteria have been discovered that imply that a CSP is polynomial-time tractable, or that it is NP-hard. Finite-domain CSPs have become a major common research focus of graph theory, artificial intell"},"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":"1201.0856","kind":"arxiv","version":10},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2012-01-04T09:39:46Z","cross_cats_sorted":["cs.AI","cs.DM","cs.LO","math.LO"],"title_canon_sha256":"f392ee5cf65f034c66eed42f25befdac14c9fe52a43c8900c7082700ec6e82ec","abstract_canon_sha256":"cccd6d263d2685028acc9f605706efce635a6c91ecd59c77d42819e561186663"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:07.172001Z","signature_b64":"p4NnapyuubQlno97WiYJijQrLxR9mjf9L8KYmJJpUcz/CTiUzz2aDPRZrr+GTCnCFzbCYC8cqSys5p/umyuNAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"766f9d1d0f1fd7ba565c03520b829b633f7c2ef5a5573ca5d01ae22b1958daca","last_reissued_at":"2026-05-17T23:48:07.171582Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:07.171582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity Classification in Infinite-Domain Constraint Satisfaction","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.DM","cs.LO","math.LO"],"primary_cat":"cs.CC","authors_text":"Manuel Bodirsky","submitted_at":"2012-01-04T09:39:46Z","abstract_excerpt":"A constraint satisfaction problem (CSP) is a computational problem where the input consists of a finite set of variables and a finite set of constraints, and where the task is to decide whether there exists a satisfying assignment of values to the variables. Depending on the type of constraints that we allow in the input, a CSP might be tractable, or computationally hard. In recent years, general criteria have been discovered that imply that a CSP is polynomial-time tractable, or that it is NP-hard. Finite-domain CSPs have become a major common research focus of graph theory, artificial intell"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0856","kind":"arxiv","version":10},"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":"1201.0856","created_at":"2026-05-17T23:48:07.171649+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.0856v10","created_at":"2026-05-17T23:48:07.171649+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0856","created_at":"2026-05-17T23:48:07.171649+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZXZ2HIPD7L3","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZXZ2HIPD7L3UVS4","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZXZ2HIP","created_at":"2026-05-18T12:27:18.751474+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.03346","citing_title":"Provable Accuracy Collapse in Embedding-Based Representations under Dimensionality Mismatch","ref_index":93,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17461","citing_title":"Optimal Phylogenetic Reconstruction from Sampled Quartets","ref_index":93,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OZXZ2HIPD7L3UVS4ANJAXAU3MM","json":"https://pith.science/pith/OZXZ2HIPD7L3UVS4ANJAXAU3MM.json","graph_json":"https://pith.science/api/pith-number/OZXZ2HIPD7L3UVS4ANJAXAU3MM/graph.json","events_json":"https://pith.science/api/pith-number/OZXZ2HIPD7L3UVS4ANJAXAU3MM/events.json","paper":"https://pith.science/paper/OZXZ2HIP"},"agent_actions":{"view_html":"https://pith.science/pith/OZXZ2HIPD7L3UVS4ANJAXAU3MM","download_json":"https://pith.science/pith/OZXZ2HIPD7L3UVS4ANJAXAU3MM.json","view_paper":"https://pith.science/paper/OZXZ2HIP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.0856&json=true","fetch_graph":"https://pith.science/api/pith-number/OZXZ2HIPD7L3UVS4ANJAXAU3MM/graph.json","fetch_events":"https://pith.science/api/pith-number/OZXZ2HIPD7L3UVS4ANJAXAU3MM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZXZ2HIPD7L3UVS4ANJAXAU3MM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZXZ2HIPD7L3UVS4ANJAXAU3MM/action/storage_attestation","attest_author":"https://pith.science/pith/OZXZ2HIPD7L3UVS4ANJAXAU3MM/action/author_attestation","sign_citation":"https://pith.science/pith/OZXZ2HIPD7L3UVS4ANJAXAU3MM/action/citation_signature","submit_replication":"https://pith.science/pith/OZXZ2HIPD7L3UVS4ANJAXAU3MM/action/replication_record"}},"created_at":"2026-05-17T23:48:07.171649+00:00","updated_at":"2026-05-17T23:48:07.171649+00:00"}