{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OZXZ2HIPD7L3UVS4ANJAXAU3MM","short_pith_number":"pith:OZXZ2HIP","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"},"canonical_sha256":"766f9d1d0f1fd7ba565c03520b829b633f7c2ef5a5573ca5d01ae22b1958daca","source":{"kind":"arxiv","id":"1201.0856","version":10},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0856","created_at":"2026-05-17T23:48:07Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0856v10","created_at":"2026-05-17T23:48:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0856","created_at":"2026-05-17T23:48:07Z"},{"alias_kind":"pith_short_12","alias_value":"OZXZ2HIPD7L3","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"OZXZ2HIPD7L3UVS4","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"OZXZ2HIP","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OZXZ2HIPD7L3UVS4ANJAXAU3MM","target":"record","payload":{"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"},"canonical_sha256":"766f9d1d0f1fd7ba565c03520b829b633f7c2ef5a5573ca5d01ae22b1958daca","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"},"source_kind":"arxiv","source_id":"1201.0856","source_version":10,"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-17T23:48:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VHwy4Og0ylUFg848Z39vmOZz4IC0xDNCquIQTlcGdPmFv8cBm9e6bJsbJDCHAEzd2cXSkZvJM3t7La5UMst1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:33:18.956031Z"},"content_sha256":"0051b294d93ad7a31664bd48597b943940748f143053e3a9f07fdcdff94042d2","schema_version":"1.0","event_id":"sha256:0051b294d93ad7a31664bd48597b943940748f143053e3a9f07fdcdff94042d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OZXZ2HIPD7L3UVS4ANJAXAU3MM","target":"graph","payload":{"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"},"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-17T23:48:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7XskYurvZlEHzbzzd6b7VP/X7WRyLx3tk9i1e3bDSvQ/8jp7gJUoYtC3HJb4uV1SFUEEufXITAe94Z/UerPqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:33:18.956639Z"},"content_sha256":"1818fe218e944b824157739ae86e9db3bcb8227d60fdd0edcff678042eb70170","schema_version":"1.0","event_id":"sha256:1818fe218e944b824157739ae86e9db3bcb8227d60fdd0edcff678042eb70170"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OZXZ2HIPD7L3UVS4ANJAXAU3MM/bundle.json","state_url":"https://pith.science/pith/OZXZ2HIPD7L3UVS4ANJAXAU3MM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OZXZ2HIPD7L3UVS4ANJAXAU3MM/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-05-26T10:33:18Z","links":{"resolver":"https://pith.science/pith/OZXZ2HIPD7L3UVS4ANJAXAU3MM","bundle":"https://pith.science/pith/OZXZ2HIPD7L3UVS4ANJAXAU3MM/bundle.json","state":"https://pith.science/pith/OZXZ2HIPD7L3UVS4ANJAXAU3MM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OZXZ2HIPD7L3UVS4ANJAXAU3MM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OZXZ2HIPD7L3UVS4ANJAXAU3MM","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":"cccd6d263d2685028acc9f605706efce635a6c91ecd59c77d42819e561186663","cross_cats_sorted":["cs.AI","cs.DM","cs.LO","math.LO"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2012-01-04T09:39:46Z","title_canon_sha256":"f392ee5cf65f034c66eed42f25befdac14c9fe52a43c8900c7082700ec6e82ec"},"schema_version":"1.0","source":{"id":"1201.0856","kind":"arxiv","version":10}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0856","created_at":"2026-05-17T23:48:07Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0856v10","created_at":"2026-05-17T23:48:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0856","created_at":"2026-05-17T23:48:07Z"},{"alias_kind":"pith_short_12","alias_value":"OZXZ2HIPD7L3","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"OZXZ2HIPD7L3UVS4","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"OZXZ2HIP","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:1818fe218e944b824157739ae86e9db3bcb8227d60fdd0edcff678042eb70170","target":"graph","created_at":"2026-05-17T23:48:07Z","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":"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","authors_text":"Manuel Bodirsky","cross_cats":["cs.AI","cs.DM","cs.LO","math.LO"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2012-01-04T09:39:46Z","title":"Complexity Classification in Infinite-Domain Constraint Satisfaction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0856","kind":"arxiv","version":10},"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:0051b294d93ad7a31664bd48597b943940748f143053e3a9f07fdcdff94042d2","target":"record","created_at":"2026-05-17T23:48:07Z","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":"cccd6d263d2685028acc9f605706efce635a6c91ecd59c77d42819e561186663","cross_cats_sorted":["cs.AI","cs.DM","cs.LO","math.LO"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2012-01-04T09:39:46Z","title_canon_sha256":"f392ee5cf65f034c66eed42f25befdac14c9fe52a43c8900c7082700ec6e82ec"},"schema_version":"1.0","source":{"id":"1201.0856","kind":"arxiv","version":10}},"canonical_sha256":"766f9d1d0f1fd7ba565c03520b829b633f7c2ef5a5573ca5d01ae22b1958daca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"766f9d1d0f1fd7ba565c03520b829b633f7c2ef5a5573ca5d01ae22b1958daca","first_computed_at":"2026-05-17T23:48:07.171582Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:07.171582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p4NnapyuubQlno97WiYJijQrLxR9mjf9L8KYmJJpUcz/CTiUzz2aDPRZrr+GTCnCFzbCYC8cqSys5p/umyuNAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:07.172001Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.0856","source_kind":"arxiv","source_version":10}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0051b294d93ad7a31664bd48597b943940748f143053e3a9f07fdcdff94042d2","sha256:1818fe218e944b824157739ae86e9db3bcb8227d60fdd0edcff678042eb70170"],"state_sha256":"c503d1616f5b5c6fdc81aac898af911b52db4107f7408b671fff2f39235cd4b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5YRqjPKS/rq4R2uaNL2ZXXlgxCPNCkCqgDrY2jL262TZcVKyb5pPAghHs3eVgf30ZhRwSTqDUe1HCKXdvMDEAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:33:18.960503Z","bundle_sha256":"edd55e04642b073d2bdbce7c39bdf691c58cd199969454d5642ba1dfe08a7416"}}