{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3JXYC4RY4PUZ745KQLEMJRVA4C","short_pith_number":"pith:3JXYC4RY","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"},"canonical_sha256":"da6f817238e3e99ff3aa82c8c4c6a0e097816590fd56d0512a939e2f360d59da","source":{"kind":"arxiv","id":"1810.06081","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06081","created_at":"2026-05-18T00:03:21Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06081v1","created_at":"2026-05-18T00:03:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06081","created_at":"2026-05-18T00:03:21Z"},{"alias_kind":"pith_short_12","alias_value":"3JXYC4RY4PUZ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3JXYC4RY4PUZ745K","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3JXYC4RY","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3JXYC4RY4PUZ745KQLEMJRVA4C","target":"record","payload":{"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"},"canonical_sha256":"da6f817238e3e99ff3aa82c8c4c6a0e097816590fd56d0512a939e2f360d59da","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"},"source_kind":"arxiv","source_id":"1810.06081","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:03:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/w1qdMh1YlDVN5E9hXnJngVAWcurZYxkTotrkOoRnxRLURasm9Q2bv2pRtZa31VLHliaOXD8swzjHp759ycmDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T18:18:34.380669Z"},"content_sha256":"d784ec815cc8b16cefb2f9bf22d2c26cd0e7c6463972c16b48da1a7882b68f76","schema_version":"1.0","event_id":"sha256:d784ec815cc8b16cefb2f9bf22d2c26cd0e7c6463972c16b48da1a7882b68f76"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3JXYC4RY4PUZ745KQLEMJRVA4C","target":"graph","payload":{"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"},"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:03:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gm1ceN7ibjY+IU+6D+e4nku2cs4rRulTrWusm0kML8LDse6lr3jAUOGtTX1YQ2cP25cmb8xwi2ooYmsOZEI2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T18:18:34.381004Z"},"content_sha256":"308ec93ec8982c1c15f1c18f6744a469fa72cd6b0ba661ad684f50583f081b4a","schema_version":"1.0","event_id":"sha256:308ec93ec8982c1c15f1c18f6744a469fa72cd6b0ba661ad684f50583f081b4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3JXYC4RY4PUZ745KQLEMJRVA4C/bundle.json","state_url":"https://pith.science/pith/3JXYC4RY4PUZ745KQLEMJRVA4C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3JXYC4RY4PUZ745KQLEMJRVA4C/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-07-04T18:18:34Z","links":{"resolver":"https://pith.science/pith/3JXYC4RY4PUZ745KQLEMJRVA4C","bundle":"https://pith.science/pith/3JXYC4RY4PUZ745KQLEMJRVA4C/bundle.json","state":"https://pith.science/pith/3JXYC4RY4PUZ745KQLEMJRVA4C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3JXYC4RY4PUZ745KQLEMJRVA4C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3JXYC4RY4PUZ745KQLEMJRVA4C","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":"a1b364ccb0e1fcb427ea2b060748ee32669f170a16334b73063b085f098e2c60","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-14T19:12:39Z","title_canon_sha256":"64abace9b0ab38a12240e67d32cdcd28e604f94b36c0b156861f5497b1265d42"},"schema_version":"1.0","source":{"id":"1810.06081","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06081","created_at":"2026-05-18T00:03:21Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06081v1","created_at":"2026-05-18T00:03:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06081","created_at":"2026-05-18T00:03:21Z"},{"alias_kind":"pith_short_12","alias_value":"3JXYC4RY4PUZ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3JXYC4RY4PUZ745K","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3JXYC4RY","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:308ec93ec8982c1c15f1c18f6744a469fa72cd6b0ba661ad684f50583f081b4a","target":"graph","created_at":"2026-05-18T00:03:21Z","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":"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","authors_text":"Nikhil Vyas","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-14T19:12:39Z","title":"Super Strong ETH is False for Random $k$-SAT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06081","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:d784ec815cc8b16cefb2f9bf22d2c26cd0e7c6463972c16b48da1a7882b68f76","target":"record","created_at":"2026-05-18T00:03:21Z","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":"a1b364ccb0e1fcb427ea2b060748ee32669f170a16334b73063b085f098e2c60","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-14T19:12:39Z","title_canon_sha256":"64abace9b0ab38a12240e67d32cdcd28e604f94b36c0b156861f5497b1265d42"},"schema_version":"1.0","source":{"id":"1810.06081","kind":"arxiv","version":1}},"canonical_sha256":"da6f817238e3e99ff3aa82c8c4c6a0e097816590fd56d0512a939e2f360d59da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da6f817238e3e99ff3aa82c8c4c6a0e097816590fd56d0512a939e2f360d59da","first_computed_at":"2026-05-18T00:03:21.468053Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:21.468053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7uNqKXqR5VIw2BG/Xnc1zigqLB51jYUApdX9joyxebc0TN5DRnyDfEXc+qmXmK5zjwRG+Z9M+RLRxvv5yATqAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:21.468589Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.06081","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d784ec815cc8b16cefb2f9bf22d2c26cd0e7c6463972c16b48da1a7882b68f76","sha256:308ec93ec8982c1c15f1c18f6744a469fa72cd6b0ba661ad684f50583f081b4a"],"state_sha256":"0c04cecafc3424dc0babbc6132a5453007e7953913e6f601aca53fa552bbe557"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MIAWrM9NBMmCnrteHXUfKj1d2bjo0UcPMooFXEZgPRD7jYandtI77r/Y/1AHdO4MNWt2HlUZVB8supgWfVUcBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T18:18:34.382913Z","bundle_sha256":"3a198d493da479c7bd519f3d0603b57c66b7ffa7c8c304cad10ce6a93d16deb1"}}