{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:N4RACOEEVDJQYXHQ3TVXBPYQOK","short_pith_number":"pith:N4RACOEE","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"},"canonical_sha256":"6f22013884a8d30c5cf0dceb70bf1072895b20d91d99b21f844c346ad3b88cdb","source":{"kind":"arxiv","id":"1404.0753","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0753","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0753v2","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0753","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"pith_short_12","alias_value":"N4RACOEEVDJQ","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"N4RACOEEVDJQYXHQ","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"N4RACOEE","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:N4RACOEEVDJQYXHQ3TVXBPYQOK","target":"record","payload":{"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"},"canonical_sha256":"6f22013884a8d30c5cf0dceb70bf1072895b20d91d99b21f844c346ad3b88cdb","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"},"source_kind":"arxiv","source_id":"1404.0753","source_version":2,"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:30:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eBKwTKd8Xvb1OIJd7uDNq1gLuccs3cOJqf6p6BFQYbndVxcFy0/HLKXx5ro0aERGg5bIsXUTiceTtuxWHZ5FBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T18:39:45.040371Z"},"content_sha256":"ab0e647f5db77b11342bb546978e52cf6232f0505cab5de8244a074348a6991c","schema_version":"1.0","event_id":"sha256:ab0e647f5db77b11342bb546978e52cf6232f0505cab5de8244a074348a6991c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:N4RACOEEVDJQYXHQ3TVXBPYQOK","target":"graph","payload":{"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"},"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:30:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dCfo3szKfw3qNygKUYsonWNuFuSJ/quweVWJuUO616xqR2XC1u2aSfnlHrKFN446K22yoVYt7gbm00qMminPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T18:39:45.040724Z"},"content_sha256":"4a847f6a4238d25237bc826700f25e9339920431178294e45923886b9b4ddbce","schema_version":"1.0","event_id":"sha256:4a847f6a4238d25237bc826700f25e9339920431178294e45923886b9b4ddbce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N4RACOEEVDJQYXHQ3TVXBPYQOK/bundle.json","state_url":"https://pith.science/pith/N4RACOEEVDJQYXHQ3TVXBPYQOK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N4RACOEEVDJQYXHQ3TVXBPYQOK/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-06-23T18:39:45Z","links":{"resolver":"https://pith.science/pith/N4RACOEEVDJQYXHQ3TVXBPYQOK","bundle":"https://pith.science/pith/N4RACOEEVDJQYXHQ3TVXBPYQOK/bundle.json","state":"https://pith.science/pith/N4RACOEEVDJQYXHQ3TVXBPYQOK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N4RACOEEVDJQYXHQ3TVXBPYQOK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:N4RACOEEVDJQYXHQ3TVXBPYQOK","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":"d73880aa07e2c42dcaf9704cbb8c1231ac250ec835f4b3eade0dee37abe01ba3","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-03T03:19:51Z","title_canon_sha256":"c5c3a4860fb4871196980b3b5fd999d10afafbe2ec1f56f58edd399bf5c55103"},"schema_version":"1.0","source":{"id":"1404.0753","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0753","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0753v2","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0753","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"pith_short_12","alias_value":"N4RACOEEVDJQ","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"N4RACOEEVDJQYXHQ","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"N4RACOEE","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:4a847f6a4238d25237bc826700f25e9339920431178294e45923886b9b4ddbce","target":"graph","created_at":"2026-05-18T00:30:22Z","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":"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","authors_text":"Gregory B. Sorkin, Serge Gaspers","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-03T03:19:51Z","title":"Separate, Measure and Conquer: Faster Algorithms for Max 2-CSP and Counting Dominating Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0753","kind":"arxiv","version":2},"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:ab0e647f5db77b11342bb546978e52cf6232f0505cab5de8244a074348a6991c","target":"record","created_at":"2026-05-18T00:30:22Z","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":"d73880aa07e2c42dcaf9704cbb8c1231ac250ec835f4b3eade0dee37abe01ba3","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-03T03:19:51Z","title_canon_sha256":"c5c3a4860fb4871196980b3b5fd999d10afafbe2ec1f56f58edd399bf5c55103"},"schema_version":"1.0","source":{"id":"1404.0753","kind":"arxiv","version":2}},"canonical_sha256":"6f22013884a8d30c5cf0dceb70bf1072895b20d91d99b21f844c346ad3b88cdb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f22013884a8d30c5cf0dceb70bf1072895b20d91d99b21f844c346ad3b88cdb","first_computed_at":"2026-05-18T00:30:22.877349Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:22.877349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9iTSq+IQ5MigczEcrMGIy7bYUdQnkrZ3DAoVfDQLSAO0qnEvMmXzDAiokKW/rFk6reO+i31nWLIZM+Ib5cJQAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:22.877907Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.0753","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab0e647f5db77b11342bb546978e52cf6232f0505cab5de8244a074348a6991c","sha256:4a847f6a4238d25237bc826700f25e9339920431178294e45923886b9b4ddbce"],"state_sha256":"9c82147c7eb22b4d32546480a01ee2856e442b99a3aa17db6822b2135549594e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LjgM7hPEr7blkG+O5t0U10Nv/ymfDyoj09xhgphqDEDFjUL4Ur1JYtEYIdOT8RVDrDkND4oIyXh01Yvj+Bi2DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T18:39:45.042673Z","bundle_sha256":"184094eb0c741ff4b29f3cf65d05ec5c58c60f2a72b7c24cc819c17a29b4786f"}}