{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:NMZ2XQVT7YEKPL2CY5JTSFI4NA","short_pith_number":"pith:NMZ2XQVT","schema_version":"1.0","canonical_sha256":"6b33abc2b3fe08a7af42c75339151c682483dd506d61221b6b697e402b95978a","source":{"kind":"arxiv","id":"1112.1099","version":2},"attestation_state":"computed","paper":{"title":"CSP for binary conservative relational structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kazda","submitted_at":"2011-12-05T21:32:40Z","abstract_excerpt":"We prove that whenever A is a 3-conservative relational structure with only binary and unary relations then the algebra of polymorphisms of A either has no Taylor operation (i.e. CSP(A) is NP-complete), or generates a congruence meet semidistributive variety (i.e. CSP(A) has bounded width)."},"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":"1112.1099","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-05T21:32:40Z","cross_cats_sorted":[],"title_canon_sha256":"6e03d42b647bcca1a89c96bb9be7bdd4a3c7d857c8f9fc5cb34bbbbc2a011beb","abstract_canon_sha256":"6c8c8aa69ad4d70678ee2977a5214562f8bfb5fa426c4133f031ad582df80cc7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:03.175543Z","signature_b64":"ts5eKd/y/GfNR9eriOx3bJntyEbTdnhqv/Y4BAH48Dl+3NeYLC+LK+TMhbto8tP6otgHL42CJWquJqAgsbh5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b33abc2b3fe08a7af42c75339151c682483dd506d61221b6b697e402b95978a","last_reissued_at":"2026-05-18T01:21:03.174925Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:03.174925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CSP for binary conservative relational structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kazda","submitted_at":"2011-12-05T21:32:40Z","abstract_excerpt":"We prove that whenever A is a 3-conservative relational structure with only binary and unary relations then the algebra of polymorphisms of A either has no Taylor operation (i.e. CSP(A) is NP-complete), or generates a congruence meet semidistributive variety (i.e. CSP(A) has bounded width)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1099","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":"1112.1099","created_at":"2026-05-18T01:21:03.175033+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.1099v2","created_at":"2026-05-18T01:21:03.175033+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1099","created_at":"2026-05-18T01:21:03.175033+00:00"},{"alias_kind":"pith_short_12","alias_value":"NMZ2XQVT7YEK","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"NMZ2XQVT7YEKPL2C","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"NMZ2XQVT","created_at":"2026-05-18T12:26:37.096874+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/NMZ2XQVT7YEKPL2CY5JTSFI4NA","json":"https://pith.science/pith/NMZ2XQVT7YEKPL2CY5JTSFI4NA.json","graph_json":"https://pith.science/api/pith-number/NMZ2XQVT7YEKPL2CY5JTSFI4NA/graph.json","events_json":"https://pith.science/api/pith-number/NMZ2XQVT7YEKPL2CY5JTSFI4NA/events.json","paper":"https://pith.science/paper/NMZ2XQVT"},"agent_actions":{"view_html":"https://pith.science/pith/NMZ2XQVT7YEKPL2CY5JTSFI4NA","download_json":"https://pith.science/pith/NMZ2XQVT7YEKPL2CY5JTSFI4NA.json","view_paper":"https://pith.science/paper/NMZ2XQVT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.1099&json=true","fetch_graph":"https://pith.science/api/pith-number/NMZ2XQVT7YEKPL2CY5JTSFI4NA/graph.json","fetch_events":"https://pith.science/api/pith-number/NMZ2XQVT7YEKPL2CY5JTSFI4NA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NMZ2XQVT7YEKPL2CY5JTSFI4NA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NMZ2XQVT7YEKPL2CY5JTSFI4NA/action/storage_attestation","attest_author":"https://pith.science/pith/NMZ2XQVT7YEKPL2CY5JTSFI4NA/action/author_attestation","sign_citation":"https://pith.science/pith/NMZ2XQVT7YEKPL2CY5JTSFI4NA/action/citation_signature","submit_replication":"https://pith.science/pith/NMZ2XQVT7YEKPL2CY5JTSFI4NA/action/replication_record"}},"created_at":"2026-05-18T01:21:03.175033+00:00","updated_at":"2026-05-18T01:21:03.175033+00:00"}