{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3JXYC4RY4PUZ745KQLEMJRVA4C","short_pith_number":"pith:3JXYC4RY","schema_version":"1.0","canonical_sha256":"da6f817238e3e99ff3aa82c8c4c6a0e097816590fd56d0512a939e2f360d59da","source":{"kind":"arxiv","id":"1810.06081","version":1},"attestation_state":"computed","paper":{"title":"Super Strong ETH is False for Random $k$-SAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Nikhil Vyas","submitted_at":"2018-10-14T19:12:39Z","abstract_excerpt":"It has been hypothesized that $k$-SAT is hard to solve for randomly chosen instances near the \"critical threshold\", where the clause-to-variable ratio is $2^k \\ln 2-\\theta(1)$. Feige's hypothesis for $k$-SAT says that for all sufficiently large clause-to-variable ratios, random $k$-SAT cannot be refuted in polynomial time. It has also been hypothesized that the worst-case $k$-SAT problem cannot be solved in $2^{n(1-\\omega_k(1)/k)}$ time, as multiple known algorithmic paradigms (backtracking, local search and the polynomial method) only yield an $2^{n(1-1/O(k))}$ time algorithm. This hypothesis"},"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":"1810.06081","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-14T19:12:39Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"64abace9b0ab38a12240e67d32cdcd28e604f94b36c0b156861f5497b1265d42","abstract_canon_sha256":"a1b364ccb0e1fcb427ea2b060748ee32669f170a16334b73063b085f098e2c60"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:21.468589Z","signature_b64":"7uNqKXqR5VIw2BG/Xnc1zigqLB51jYUApdX9joyxebc0TN5DRnyDfEXc+qmXmK5zjwRG+Z9M+RLRxvv5yATqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da6f817238e3e99ff3aa82c8c4c6a0e097816590fd56d0512a939e2f360d59da","last_reissued_at":"2026-05-18T00:03:21.468053Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:21.468053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Super Strong ETH is False for Random $k$-SAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Nikhil Vyas","submitted_at":"2018-10-14T19:12:39Z","abstract_excerpt":"It has been hypothesized that $k$-SAT is hard to solve for randomly chosen instances near the \"critical threshold\", where the clause-to-variable ratio is $2^k \\ln 2-\\theta(1)$. Feige's hypothesis for $k$-SAT says that for all sufficiently large clause-to-variable ratios, random $k$-SAT cannot be refuted in polynomial time. It has also been hypothesized that the worst-case $k$-SAT problem cannot be solved in $2^{n(1-\\omega_k(1)/k)}$ time, as multiple known algorithmic paradigms (backtracking, local search and the polynomial method) only yield an $2^{n(1-1/O(k))}$ time algorithm. This hypothesis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06081","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.06081","created_at":"2026-05-18T00:03:21.468124+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.06081v1","created_at":"2026-05-18T00:03:21.468124+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06081","created_at":"2026-05-18T00:03:21.468124+00:00"},{"alias_kind":"pith_short_12","alias_value":"3JXYC4RY4PUZ","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"3JXYC4RY4PUZ745K","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"3JXYC4RY","created_at":"2026-05-18T12:32:02.567920+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/3JXYC4RY4PUZ745KQLEMJRVA4C","json":"https://pith.science/pith/3JXYC4RY4PUZ745KQLEMJRVA4C.json","graph_json":"https://pith.science/api/pith-number/3JXYC4RY4PUZ745KQLEMJRVA4C/graph.json","events_json":"https://pith.science/api/pith-number/3JXYC4RY4PUZ745KQLEMJRVA4C/events.json","paper":"https://pith.science/paper/3JXYC4RY"},"agent_actions":{"view_html":"https://pith.science/pith/3JXYC4RY4PUZ745KQLEMJRVA4C","download_json":"https://pith.science/pith/3JXYC4RY4PUZ745KQLEMJRVA4C.json","view_paper":"https://pith.science/paper/3JXYC4RY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.06081&json=true","fetch_graph":"https://pith.science/api/pith-number/3JXYC4RY4PUZ745KQLEMJRVA4C/graph.json","fetch_events":"https://pith.science/api/pith-number/3JXYC4RY4PUZ745KQLEMJRVA4C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3JXYC4RY4PUZ745KQLEMJRVA4C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3JXYC4RY4PUZ745KQLEMJRVA4C/action/storage_attestation","attest_author":"https://pith.science/pith/3JXYC4RY4PUZ745KQLEMJRVA4C/action/author_attestation","sign_citation":"https://pith.science/pith/3JXYC4RY4PUZ745KQLEMJRVA4C/action/citation_signature","submit_replication":"https://pith.science/pith/3JXYC4RY4PUZ745KQLEMJRVA4C/action/replication_record"}},"created_at":"2026-05-18T00:03:21.468124+00:00","updated_at":"2026-05-18T00:03:21.468124+00:00"}