{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:K556I3V2FVM7PLYBZYVBGMSMC2","short_pith_number":"pith:K556I3V2","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"},"canonical_sha256":"577be46eba2d59f7af01ce2a13324c16bdf92b03a990b79a342014b6bcaa7daf","source":{"kind":"arxiv","id":"1706.05902","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05902","created_at":"2026-05-18T00:42:08Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05902v1","created_at":"2026-05-18T00:42:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05902","created_at":"2026-05-18T00:42:08Z"},{"alias_kind":"pith_short_12","alias_value":"K556I3V2FVM7","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"K556I3V2FVM7PLYB","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"K556I3V2","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:K556I3V2FVM7PLYBZYVBGMSMC2","target":"record","payload":{"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"},"canonical_sha256":"577be46eba2d59f7af01ce2a13324c16bdf92b03a990b79a342014b6bcaa7daf","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"},"source_kind":"arxiv","source_id":"1706.05902","source_version":1,"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-18T00:42:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+aOUqpMe3TcKBHa0DlnhIh9rA5TSMWF3hvzYbPLronu/bH+zbFJxwKRWZUHTUmK+Iog0JLAWPs9rHRTyXtxcCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:06:36.366104Z"},"content_sha256":"bcb426ad2b88c7aba1d037daa0a59275375e62505ab46c8c453e60a51d6a8676","schema_version":"1.0","event_id":"sha256:bcb426ad2b88c7aba1d037daa0a59275375e62505ab46c8c453e60a51d6a8676"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:K556I3V2FVM7PLYBZYVBGMSMC2","target":"graph","payload":{"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"},"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-18T00:42:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IFVg8GhBozs1sqzRC0/5w3hGMAt9U11lGvTaGeDcAm9F7SFC4Oz9/RouiPQT1AXHq1DDx6yJX5cBBFrSVSEJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:06:36.366481Z"},"content_sha256":"6f49e9cf2fcd4b34f560e118279c55f730c36378792e28b1f6499a299b036d6b","schema_version":"1.0","event_id":"sha256:6f49e9cf2fcd4b34f560e118279c55f730c36378792e28b1f6499a299b036d6b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K556I3V2FVM7PLYBZYVBGMSMC2/bundle.json","state_url":"https://pith.science/pith/K556I3V2FVM7PLYBZYVBGMSMC2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K556I3V2FVM7PLYBZYVBGMSMC2/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-30T23:06:36Z","links":{"resolver":"https://pith.science/pith/K556I3V2FVM7PLYBZYVBGMSMC2","bundle":"https://pith.science/pith/K556I3V2FVM7PLYBZYVBGMSMC2/bundle.json","state":"https://pith.science/pith/K556I3V2FVM7PLYBZYVBGMSMC2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K556I3V2FVM7PLYBZYVBGMSMC2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:K556I3V2FVM7PLYBZYVBGMSMC2","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":"9b398e05b8284ec220a361625bd78c0d98d4475f32dd7ff6118e0c6f6eb6a9c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-19T12:26:49Z","title_canon_sha256":"ed2b8c475da86d1abd5a4ea7e320518c8d82b287ca0c004b74ca41b42aea8c33"},"schema_version":"1.0","source":{"id":"1706.05902","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05902","created_at":"2026-05-18T00:42:08Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05902v1","created_at":"2026-05-18T00:42:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05902","created_at":"2026-05-18T00:42:08Z"},{"alias_kind":"pith_short_12","alias_value":"K556I3V2FVM7","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"K556I3V2FVM7PLYB","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"K556I3V2","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:6f49e9cf2fcd4b34f560e118279c55f730c36378792e28b1f6499a299b036d6b","target":"graph","created_at":"2026-05-18T00:42:08Z","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":"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.","authors_text":"Biman Roy, Peter Jonsson, Victor Lagerkvist","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-19T12:26:49Z","title":"Time Complexity of Constraint Satisfaction via Universal Algebra"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05902","kind":"arxiv","version":1},"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:bcb426ad2b88c7aba1d037daa0a59275375e62505ab46c8c453e60a51d6a8676","target":"record","created_at":"2026-05-18T00:42:08Z","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":"9b398e05b8284ec220a361625bd78c0d98d4475f32dd7ff6118e0c6f6eb6a9c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-19T12:26:49Z","title_canon_sha256":"ed2b8c475da86d1abd5a4ea7e320518c8d82b287ca0c004b74ca41b42aea8c33"},"schema_version":"1.0","source":{"id":"1706.05902","kind":"arxiv","version":1}},"canonical_sha256":"577be46eba2d59f7af01ce2a13324c16bdf92b03a990b79a342014b6bcaa7daf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"577be46eba2d59f7af01ce2a13324c16bdf92b03a990b79a342014b6bcaa7daf","first_computed_at":"2026-05-18T00:42:08.583037Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:08.583037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EzPsyeO9gNeW8uDH2PyGO4Lnpq85TCSxTLMG5xKF6rIBGWauGPdDN4bLQHhgr/vRJ5jATnI7704BB4c2nG+zAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:08.583650Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.05902","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bcb426ad2b88c7aba1d037daa0a59275375e62505ab46c8c453e60a51d6a8676","sha256:6f49e9cf2fcd4b34f560e118279c55f730c36378792e28b1f6499a299b036d6b"],"state_sha256":"284847455b725527530f417de48573e00a822e1b0b335c9b884da0cccae3b794"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TK8D1TkL97sTOkszQO/BJG8VbAfgNTN+DLBs/cQWBX1A3mfBt7HITWSpSaHkCqXAtL/Sv+WqRPOhy7/BKIM2Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:06:36.368670Z","bundle_sha256":"75eaee666715eee23157b1faa23c1dd27bec7378827be703080904acc78bee30"}}