{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AMEHXDMVR2K54FAO23L3OLNAJG","short_pith_number":"pith:AMEHXDMV","canonical_record":{"source":{"id":"1801.03588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-10T23:45:13Z","cross_cats_sorted":[],"title_canon_sha256":"95ebf5ed9360cd75a3d4c8f9410f1022ed208a68bf8c0a5ff37c92e394a09571","abstract_canon_sha256":"f0ae51cc72ad62590aba6df4869944e818597f269cca729ad436dfa06a82cbaa"},"schema_version":"1.0"},"canonical_sha256":"03087b8d958e95de140ed6d7b72da049b52df20a0df44ef623c59f3c58198248","source":{"kind":"arxiv","id":"1801.03588","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.03588","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"arxiv_version","alias_value":"1801.03588v1","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03588","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"pith_short_12","alias_value":"AMEHXDMVR2K5","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AMEHXDMVR2K54FAO","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AMEHXDMV","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AMEHXDMVR2K54FAO23L3OLNAJG","target":"record","payload":{"canonical_record":{"source":{"id":"1801.03588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-10T23:45:13Z","cross_cats_sorted":[],"title_canon_sha256":"95ebf5ed9360cd75a3d4c8f9410f1022ed208a68bf8c0a5ff37c92e394a09571","abstract_canon_sha256":"f0ae51cc72ad62590aba6df4869944e818597f269cca729ad436dfa06a82cbaa"},"schema_version":"1.0"},"canonical_sha256":"03087b8d958e95de140ed6d7b72da049b52df20a0df44ef623c59f3c58198248","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:13.880556Z","signature_b64":"9w0hzT9lyvfj4T6C45SI26P+nUons0HK1I+V81h8KiBZOAJIKlSXAMmtYn5v++dbozBwh0yMuiSC/ee+BwHlBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03087b8d958e95de140ed6d7b72da049b52df20a0df44ef623c59f3c58198248","last_reissued_at":"2026-05-18T00:26:13.880002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:13.880002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.03588","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:26:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GXCEuAjJrwmvKEf+3Rp2RfL3TL0JQVqUugAyUIYTVO+4W+h2mrG+poNw2yc2gYTptFnyxu0ygr/ni50otR+uDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:55:11.346574Z"},"content_sha256":"44a9683f0c3cb80b9886b48f9db194c0161ece3fb2d7c1305e3e48bffcd94f64","schema_version":"1.0","event_id":"sha256:44a9683f0c3cb80b9886b48f9db194c0161ece3fb2d7c1305e3e48bffcd94f64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AMEHXDMVR2K54FAO23L3OLNAJG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic search for CNF satisfying assignments in almost polynomial time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Li-Yang Tan, Rocco A. Servedio","submitted_at":"2018-01-10T23:45:13Z","abstract_excerpt":"We consider the fundamental derandomization problem of deterministically finding a satisfying assignment to a CNF formula that has many satisfying assignments. We give a deterministic algorithm which, given an $n$-variable $\\mathrm{poly}(n)$-clause CNF formula $F$ that has at least $\\varepsilon 2^n$ satisfying assignments, runs in time \\[ n^{\\tilde{O}(\\log\\log n)^2} \\] for $\\varepsilon \\ge 1/\\mathrm{polylog}(n)$ and outputs a satisfying assignment of $F$. Prior to our work the fastest known algorithm for this problem was simply to enumerate over all seeds of a pseudorandom generator for CNFs; "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03588","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:26:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jQcGmROaj4U3W8FykcIXY+LJH2GnD8WlmLFV52/cN0+vDCDLLlRXGK/h7DkRCOSkXsrBKJfE4Bs7rFat6EbiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:55:11.346930Z"},"content_sha256":"945022d0d005c601586cdf01832ed515d9dc6ee58dd9c759b3eca0e417dff366","schema_version":"1.0","event_id":"sha256:945022d0d005c601586cdf01832ed515d9dc6ee58dd9c759b3eca0e417dff366"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AMEHXDMVR2K54FAO23L3OLNAJG/bundle.json","state_url":"https://pith.science/pith/AMEHXDMVR2K54FAO23L3OLNAJG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AMEHXDMVR2K54FAO23L3OLNAJG/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-28T01:55:11Z","links":{"resolver":"https://pith.science/pith/AMEHXDMVR2K54FAO23L3OLNAJG","bundle":"https://pith.science/pith/AMEHXDMVR2K54FAO23L3OLNAJG/bundle.json","state":"https://pith.science/pith/AMEHXDMVR2K54FAO23L3OLNAJG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AMEHXDMVR2K54FAO23L3OLNAJG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AMEHXDMVR2K54FAO23L3OLNAJG","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":"f0ae51cc72ad62590aba6df4869944e818597f269cca729ad436dfa06a82cbaa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-10T23:45:13Z","title_canon_sha256":"95ebf5ed9360cd75a3d4c8f9410f1022ed208a68bf8c0a5ff37c92e394a09571"},"schema_version":"1.0","source":{"id":"1801.03588","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.03588","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"arxiv_version","alias_value":"1801.03588v1","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03588","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"pith_short_12","alias_value":"AMEHXDMVR2K5","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AMEHXDMVR2K54FAO","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AMEHXDMV","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:945022d0d005c601586cdf01832ed515d9dc6ee58dd9c759b3eca0e417dff366","target":"graph","created_at":"2026-05-18T00:26:13Z","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 consider the fundamental derandomization problem of deterministically finding a satisfying assignment to a CNF formula that has many satisfying assignments. We give a deterministic algorithm which, given an $n$-variable $\\mathrm{poly}(n)$-clause CNF formula $F$ that has at least $\\varepsilon 2^n$ satisfying assignments, runs in time \\[ n^{\\tilde{O}(\\log\\log n)^2} \\] for $\\varepsilon \\ge 1/\\mathrm{polylog}(n)$ and outputs a satisfying assignment of $F$. Prior to our work the fastest known algorithm for this problem was simply to enumerate over all seeds of a pseudorandom generator for CNFs; ","authors_text":"Li-Yang Tan, Rocco A. Servedio","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-10T23:45:13Z","title":"Deterministic search for CNF satisfying assignments in almost polynomial time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03588","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:44a9683f0c3cb80b9886b48f9db194c0161ece3fb2d7c1305e3e48bffcd94f64","target":"record","created_at":"2026-05-18T00:26:13Z","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":"f0ae51cc72ad62590aba6df4869944e818597f269cca729ad436dfa06a82cbaa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-10T23:45:13Z","title_canon_sha256":"95ebf5ed9360cd75a3d4c8f9410f1022ed208a68bf8c0a5ff37c92e394a09571"},"schema_version":"1.0","source":{"id":"1801.03588","kind":"arxiv","version":1}},"canonical_sha256":"03087b8d958e95de140ed6d7b72da049b52df20a0df44ef623c59f3c58198248","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03087b8d958e95de140ed6d7b72da049b52df20a0df44ef623c59f3c58198248","first_computed_at":"2026-05-18T00:26:13.880002Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:13.880002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9w0hzT9lyvfj4T6C45SI26P+nUons0HK1I+V81h8KiBZOAJIKlSXAMmtYn5v++dbozBwh0yMuiSC/ee+BwHlBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:13.880556Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.03588","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44a9683f0c3cb80b9886b48f9db194c0161ece3fb2d7c1305e3e48bffcd94f64","sha256:945022d0d005c601586cdf01832ed515d9dc6ee58dd9c759b3eca0e417dff366"],"state_sha256":"9561a668522ff49a6357e998721ea5e501a1b4fde05cfed0058690d808c283b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wwglUzfZBp8S/ZiLz+Cg9/ABOZ68Q97BkovExvkgjB/bWj2g4IezLuQWUnolji3DYrDJ7J4/uJk8os48xyE6DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T01:55:11.349409Z","bundle_sha256":"18469d85029361e6a2b10535f43a759db5be246f6ed9d8e67252bb5cba9f0405"}}