{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2003:FUKOMVTDHBPD2FF2MAQSTDR6N5","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":"c8ced757f26c939118b630bf5374381ee96ed58246a89819f9b3e3dc6b20fd56","cross_cats_sorted":["cond-mat.stat-mech","cs.DM","math.PR"],"license":"","primary_cat":"cs.CC","submitted_at":"2003-05-14T01:30:10Z","title_canon_sha256":"f23a8eaa5cdce2974e49ed929338bd4937769f34e5512802d45bc797ae57927b"},"schema_version":"1.0","source":{"id":"cs/0305009","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0305009","created_at":"2026-07-04T14:24:31Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0305009v2","created_at":"2026-07-04T14:24:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0305009","created_at":"2026-07-04T14:24:31Z"},{"alias_kind":"pith_short_12","alias_value":"FUKOMVTDHBPD","created_at":"2026-07-04T14:24:31Z"},{"alias_kind":"pith_short_16","alias_value":"FUKOMVTDHBPD2FF2","created_at":"2026-07-04T14:24:31Z"},{"alias_kind":"pith_short_8","alias_value":"FUKOMVTD","created_at":"2026-07-04T14:24:31Z"}],"graph_snapshots":[{"event_id":"sha256:37a989e7e8a0c8d4d5d9401ad6b4895a06e2041b08dd9eab8358adc22b09456d","target":"graph","created_at":"2026-07-04T14:24:31Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0305009/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let F be a random k-SAT formula on n variables, formed by selecting uniformly and independently m = rn out of all possible k-clauses. It is well-known that if r>2^k ln 2, then the formula F is unsatisfiable with probability that tends to 1 as n tends to infinity. We prove that there exists a sequence t_k = O(k) such that if r < 2^k ln 2 - t_k, then the formula F is satisfiable with probability that tends to 1 as n tends to infinity.\n  Our technique yields an explicit lower bound for the random k-SAT threshold for every k. For k>3 this improves upon all previously known lower bounds. For exampl","authors_text":"Dimitris Achlioptas, Yuval Peres","cross_cats":["cond-mat.stat-mech","cs.DM","math.PR"],"headline":"","license":"","primary_cat":"cs.CC","submitted_at":"2003-05-14T01:30:10Z","title":"The Threshold for Random k-SAT is 2^k ln2 - O(k)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0305009","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:981c50fc96ff0bf14e5902f988d517f594361c43d55d6fb8ac5973b727fd5b86","target":"record","created_at":"2026-07-04T14:24:31Z","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":"c8ced757f26c939118b630bf5374381ee96ed58246a89819f9b3e3dc6b20fd56","cross_cats_sorted":["cond-mat.stat-mech","cs.DM","math.PR"],"license":"","primary_cat":"cs.CC","submitted_at":"2003-05-14T01:30:10Z","title_canon_sha256":"f23a8eaa5cdce2974e49ed929338bd4937769f34e5512802d45bc797ae57927b"},"schema_version":"1.0","source":{"id":"cs/0305009","kind":"arxiv","version":2}},"canonical_sha256":"2d14e65663385e3d14ba6021298e3e6f59b2fc875b2d130619bfdec774dadd47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d14e65663385e3d14ba6021298e3e6f59b2fc875b2d130619bfdec774dadd47","first_computed_at":"2026-07-04T14:24:31.868532Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:24:31.868532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bDAyqwbDBOJsPwjmD+hfLqWySLAoPKuxACL0PS5dSesZgd80ZQyRY/DSobIL9TuxfKkCkHlzptwjQUVTe4zNAg==","signature_status":"signed_v1","signed_at":"2026-07-04T14:24:31.868956Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0305009","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:981c50fc96ff0bf14e5902f988d517f594361c43d55d6fb8ac5973b727fd5b86","sha256:37a989e7e8a0c8d4d5d9401ad6b4895a06e2041b08dd9eab8358adc22b09456d"],"state_sha256":"4ea5f9457cbbc94015bb0a08f36d12b86c3b48cc2071ead8168ca903199ec3d2"}