{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:K556I3V2FVM7PLYBZYVBGMSMC2","short_pith_number":"pith:K556I3V2","schema_version":"1.0","canonical_sha256":"577be46eba2d59f7af01ce2a13324c16bdf92b03a990b79a342014b6bcaa7daf","source":{"kind":"arxiv","id":"1706.05902","version":1},"attestation_state":"computed","paper":{"title":"Time Complexity of Constraint Satisfaction via Universal Algebra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Biman Roy, Peter Jonsson, Victor Lagerkvist","submitted_at":"2017-06-19T12:26:49Z","abstract_excerpt":"The exponential-time hypothesis (ETH) states that 3-SAT is not solvable in subexponential time, i.e. not solvable in O(c^n) time for arbitrary c > 1, where n denotes the number of variables. Problems like k-SAT can be viewed as special cases of the constraint satisfaction problem (CSP), which is the problem of determining whether a set of constraints is satisfiable. In this paper we study thef worst-case time complexity of NP-complete CSPs. Our main interest is in the CSP problem parameterized by a constraint language Gamma (CSP(Gamma)), and how the choice of Gamma affects the time complexity."},"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":"1706.05902","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-19T12:26:49Z","cross_cats_sorted":[],"title_canon_sha256":"ed2b8c475da86d1abd5a4ea7e320518c8d82b287ca0c004b74ca41b42aea8c33","abstract_canon_sha256":"9b398e05b8284ec220a361625bd78c0d98d4475f32dd7ff6118e0c6f6eb6a9c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:08.583650Z","signature_b64":"EzPsyeO9gNeW8uDH2PyGO4Lnpq85TCSxTLMG5xKF6rIBGWauGPdDN4bLQHhgr/vRJ5jATnI7704BB4c2nG+zAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"577be46eba2d59f7af01ce2a13324c16bdf92b03a990b79a342014b6bcaa7daf","last_reissued_at":"2026-05-18T00:42:08.583037Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:08.583037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time Complexity of Constraint Satisfaction via Universal Algebra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Biman Roy, Peter Jonsson, Victor Lagerkvist","submitted_at":"2017-06-19T12:26:49Z","abstract_excerpt":"The exponential-time hypothesis (ETH) states that 3-SAT is not solvable in subexponential time, i.e. not solvable in O(c^n) time for arbitrary c > 1, where n denotes the number of variables. Problems like k-SAT can be viewed as special cases of the constraint satisfaction problem (CSP), which is the problem of determining whether a set of constraints is satisfiable. In this paper we study thef worst-case time complexity of NP-complete CSPs. Our main interest is in the CSP problem parameterized by a constraint language Gamma (CSP(Gamma)), and how the choice of Gamma affects the time complexity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05902","kind":"arxiv","version":1},"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":"1706.05902","created_at":"2026-05-18T00:42:08.583124+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.05902v1","created_at":"2026-05-18T00:42:08.583124+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05902","created_at":"2026-05-18T00:42:08.583124+00:00"},{"alias_kind":"pith_short_12","alias_value":"K556I3V2FVM7","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"K556I3V2FVM7PLYB","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"K556I3V2","created_at":"2026-05-18T12:31:24.725408+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/K556I3V2FVM7PLYBZYVBGMSMC2","json":"https://pith.science/pith/K556I3V2FVM7PLYBZYVBGMSMC2.json","graph_json":"https://pith.science/api/pith-number/K556I3V2FVM7PLYBZYVBGMSMC2/graph.json","events_json":"https://pith.science/api/pith-number/K556I3V2FVM7PLYBZYVBGMSMC2/events.json","paper":"https://pith.science/paper/K556I3V2"},"agent_actions":{"view_html":"https://pith.science/pith/K556I3V2FVM7PLYBZYVBGMSMC2","download_json":"https://pith.science/pith/K556I3V2FVM7PLYBZYVBGMSMC2.json","view_paper":"https://pith.science/paper/K556I3V2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.05902&json=true","fetch_graph":"https://pith.science/api/pith-number/K556I3V2FVM7PLYBZYVBGMSMC2/graph.json","fetch_events":"https://pith.science/api/pith-number/K556I3V2FVM7PLYBZYVBGMSMC2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K556I3V2FVM7PLYBZYVBGMSMC2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K556I3V2FVM7PLYBZYVBGMSMC2/action/storage_attestation","attest_author":"https://pith.science/pith/K556I3V2FVM7PLYBZYVBGMSMC2/action/author_attestation","sign_citation":"https://pith.science/pith/K556I3V2FVM7PLYBZYVBGMSMC2/action/citation_signature","submit_replication":"https://pith.science/pith/K556I3V2FVM7PLYBZYVBGMSMC2/action/replication_record"}},"created_at":"2026-05-18T00:42:08.583124+00:00","updated_at":"2026-05-18T00:42:08.583124+00:00"}