{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:N4RACOEEVDJQYXHQ3TVXBPYQOK","short_pith_number":"pith:N4RACOEE","schema_version":"1.0","canonical_sha256":"6f22013884a8d30c5cf0dceb70bf1072895b20d91d99b21f844c346ad3b88cdb","source":{"kind":"arxiv","id":"1404.0753","version":2},"attestation_state":"computed","paper":{"title":"Separate, Measure and Conquer: Faster Algorithms for Max 2-CSP and Counting Dominating Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Gregory B. Sorkin, Serge Gaspers","submitted_at":"2014-04-03T03:19:51Z","abstract_excerpt":"We show a method resulting in the improvement of several polynomial-space, exponential-time algorithms.\n  An instance of the problem Max (r,2)-CSP, or simply Max 2-CSP, is parametrized by the domain size r (often 2), the number of variables n (vertices in the constraint graph G), and the number of constraints m (edges in G). When G is cubic, and omitting sub-exponential terms here for clarity, we give an algorithm running in time r^((1/5)n) = r^((2/15)m); the previous best was r^((1/4)n) = r^((1/6)m). By known results, this improvement for the cubic case results in an algorithm running in time"},"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":"1404.0753","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-03T03:19:51Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"c5c3a4860fb4871196980b3b5fd999d10afafbe2ec1f56f58edd399bf5c55103","abstract_canon_sha256":"d73880aa07e2c42dcaf9704cbb8c1231ac250ec835f4b3eade0dee37abe01ba3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:22.877907Z","signature_b64":"9iTSq+IQ5MigczEcrMGIy7bYUdQnkrZ3DAoVfDQLSAO0qnEvMmXzDAiokKW/rFk6reO+i31nWLIZM+Ib5cJQAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f22013884a8d30c5cf0dceb70bf1072895b20d91d99b21f844c346ad3b88cdb","last_reissued_at":"2026-05-18T00:30:22.877349Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:22.877349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Separate, Measure and Conquer: Faster Algorithms for Max 2-CSP and Counting Dominating Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Gregory B. Sorkin, Serge Gaspers","submitted_at":"2014-04-03T03:19:51Z","abstract_excerpt":"We show a method resulting in the improvement of several polynomial-space, exponential-time algorithms.\n  An instance of the problem Max (r,2)-CSP, or simply Max 2-CSP, is parametrized by the domain size r (often 2), the number of variables n (vertices in the constraint graph G), and the number of constraints m (edges in G). When G is cubic, and omitting sub-exponential terms here for clarity, we give an algorithm running in time r^((1/5)n) = r^((2/15)m); the previous best was r^((1/4)n) = r^((1/6)m). By known results, this improvement for the cubic case results in an algorithm running in time"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0753","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":"1404.0753","created_at":"2026-05-18T00:30:22.877450+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.0753v2","created_at":"2026-05-18T00:30:22.877450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0753","created_at":"2026-05-18T00:30:22.877450+00:00"},{"alias_kind":"pith_short_12","alias_value":"N4RACOEEVDJQ","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"N4RACOEEVDJQYXHQ","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"N4RACOEE","created_at":"2026-05-18T12:28:41.024544+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/N4RACOEEVDJQYXHQ3TVXBPYQOK","json":"https://pith.science/pith/N4RACOEEVDJQYXHQ3TVXBPYQOK.json","graph_json":"https://pith.science/api/pith-number/N4RACOEEVDJQYXHQ3TVXBPYQOK/graph.json","events_json":"https://pith.science/api/pith-number/N4RACOEEVDJQYXHQ3TVXBPYQOK/events.json","paper":"https://pith.science/paper/N4RACOEE"},"agent_actions":{"view_html":"https://pith.science/pith/N4RACOEEVDJQYXHQ3TVXBPYQOK","download_json":"https://pith.science/pith/N4RACOEEVDJQYXHQ3TVXBPYQOK.json","view_paper":"https://pith.science/paper/N4RACOEE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.0753&json=true","fetch_graph":"https://pith.science/api/pith-number/N4RACOEEVDJQYXHQ3TVXBPYQOK/graph.json","fetch_events":"https://pith.science/api/pith-number/N4RACOEEVDJQYXHQ3TVXBPYQOK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N4RACOEEVDJQYXHQ3TVXBPYQOK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N4RACOEEVDJQYXHQ3TVXBPYQOK/action/storage_attestation","attest_author":"https://pith.science/pith/N4RACOEEVDJQYXHQ3TVXBPYQOK/action/author_attestation","sign_citation":"https://pith.science/pith/N4RACOEEVDJQYXHQ3TVXBPYQOK/action/citation_signature","submit_replication":"https://pith.science/pith/N4RACOEEVDJQYXHQ3TVXBPYQOK/action/replication_record"}},"created_at":"2026-05-18T00:30:22.877450+00:00","updated_at":"2026-05-18T00:30:22.877450+00:00"}