{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MHT5KTNJMJBT2JWZOOXETHJLI5","short_pith_number":"pith:MHT5KTNJ","canonical_record":{"source":{"id":"1311.4821","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-19T18:13:32Z","cross_cats_sorted":["cs.DM","cs.DS","math.CO","math.PR"],"title_canon_sha256":"82dab30ec6f39addee891a9bfd19148bff1b1e27f73ab1da45f17ae407e3d7ef","abstract_canon_sha256":"a48b6ccb85b086b08f909024080890aeeb5a1c89e8171f4b18146156321dbba4"},"schema_version":"1.0"},"canonical_sha256":"61e7d54da962433d26d973ae499d2b475ced74762ec437ae647aad1f9d18f0d7","source":{"kind":"arxiv","id":"1311.4821","version":8},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4821","created_at":"2026-05-18T00:21:55Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4821v8","created_at":"2026-05-18T00:21:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4821","created_at":"2026-05-18T00:21:55Z"},{"alias_kind":"pith_short_12","alias_value":"MHT5KTNJMJBT","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MHT5KTNJMJBT2JWZ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MHT5KTNJ","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MHT5KTNJMJBT2JWZOOXETHJLI5","target":"record","payload":{"canonical_record":{"source":{"id":"1311.4821","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-19T18:13:32Z","cross_cats_sorted":["cs.DM","cs.DS","math.CO","math.PR"],"title_canon_sha256":"82dab30ec6f39addee891a9bfd19148bff1b1e27f73ab1da45f17ae407e3d7ef","abstract_canon_sha256":"a48b6ccb85b086b08f909024080890aeeb5a1c89e8171f4b18146156321dbba4"},"schema_version":"1.0"},"canonical_sha256":"61e7d54da962433d26d973ae499d2b475ced74762ec437ae647aad1f9d18f0d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:55.339268Z","signature_b64":"pDlZx4wxS9wTH8fJIdxyXmYpVx0R0vLklOSyUbEsUL6hxIrhXU/YRDDmzSurt+MHY6qXZN4Drmuq3A3AOIxGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61e7d54da962433d26d973ae499d2b475ced74762ec437ae647aad1f9d18f0d7","last_reissued_at":"2026-05-18T00:21:55.338565Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:55.338565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.4821","source_version":8,"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:21:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rBNyCmvlBKTFTCj2VNy+PWu7rQTgYxFC2M/ijXcwU8YxjQamWk/xVlAH0jbXXN+YaFL+k/3ugsnT9ai2ZWbzBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:18:26.616526Z"},"content_sha256":"89da5a78b2dbecb08e10b5f1a28dc7a235ece247c776c910bcd31264624a809f","schema_version":"1.0","event_id":"sha256:89da5a78b2dbecb08e10b5f1a28dc7a235ece247c776c910bcd31264624a809f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MHT5KTNJMJBT2JWZOOXETHJLI5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of Random Satisfiability Problems with Planted Solutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.CO","math.PR"],"primary_cat":"cs.CC","authors_text":"Santosh Vempala, Vitaly Feldman, Will Perkins","submitted_at":"2013-11-19T18:13:32Z","abstract_excerpt":"The problem of identifying a planted assignment given a random $k$-SAT formula consistent with the assignment exhibits a large algorithmic gap: while the planted solution becomes unique and can be identified given a formula with $O(n\\log n)$ clauses, there are distributions over clauses for which the best known efficient algorithms require $n^{k/2}$ clauses. We propose and study a unified model for planted $k$-SAT, which captures well-known special cases. An instance is described by a planted assignment $\\sigma$ and a distribution on clauses with $k$ literals. We define its distribution comple"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4821","kind":"arxiv","version":8},"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:21:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YMU2mgmZv98LAcAujG+gjVclYzu1O3R0F3TaXY6NgRc8TThYJsK2LMKeurcrNexYv0a5dFE0bw6ijFeaKsEHAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:18:26.617148Z"},"content_sha256":"89fdaeba0108b2490f78f66937dfa6b6dffdc25017d561af4ebd6d89eec82a60","schema_version":"1.0","event_id":"sha256:89fdaeba0108b2490f78f66937dfa6b6dffdc25017d561af4ebd6d89eec82a60"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MHT5KTNJMJBT2JWZOOXETHJLI5/bundle.json","state_url":"https://pith.science/pith/MHT5KTNJMJBT2JWZOOXETHJLI5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MHT5KTNJMJBT2JWZOOXETHJLI5/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-27T11:18:26Z","links":{"resolver":"https://pith.science/pith/MHT5KTNJMJBT2JWZOOXETHJLI5","bundle":"https://pith.science/pith/MHT5KTNJMJBT2JWZOOXETHJLI5/bundle.json","state":"https://pith.science/pith/MHT5KTNJMJBT2JWZOOXETHJLI5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MHT5KTNJMJBT2JWZOOXETHJLI5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MHT5KTNJMJBT2JWZOOXETHJLI5","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":"a48b6ccb85b086b08f909024080890aeeb5a1c89e8171f4b18146156321dbba4","cross_cats_sorted":["cs.DM","cs.DS","math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-19T18:13:32Z","title_canon_sha256":"82dab30ec6f39addee891a9bfd19148bff1b1e27f73ab1da45f17ae407e3d7ef"},"schema_version":"1.0","source":{"id":"1311.4821","kind":"arxiv","version":8}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4821","created_at":"2026-05-18T00:21:55Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4821v8","created_at":"2026-05-18T00:21:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4821","created_at":"2026-05-18T00:21:55Z"},{"alias_kind":"pith_short_12","alias_value":"MHT5KTNJMJBT","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MHT5KTNJMJBT2JWZ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MHT5KTNJ","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:89fdaeba0108b2490f78f66937dfa6b6dffdc25017d561af4ebd6d89eec82a60","target":"graph","created_at":"2026-05-18T00:21:55Z","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":"The problem of identifying a planted assignment given a random $k$-SAT formula consistent with the assignment exhibits a large algorithmic gap: while the planted solution becomes unique and can be identified given a formula with $O(n\\log n)$ clauses, there are distributions over clauses for which the best known efficient algorithms require $n^{k/2}$ clauses. We propose and study a unified model for planted $k$-SAT, which captures well-known special cases. An instance is described by a planted assignment $\\sigma$ and a distribution on clauses with $k$ literals. We define its distribution comple","authors_text":"Santosh Vempala, Vitaly Feldman, Will Perkins","cross_cats":["cs.DM","cs.DS","math.CO","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-19T18:13:32Z","title":"On the Complexity of Random Satisfiability Problems with Planted Solutions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4821","kind":"arxiv","version":8},"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:89da5a78b2dbecb08e10b5f1a28dc7a235ece247c776c910bcd31264624a809f","target":"record","created_at":"2026-05-18T00:21:55Z","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":"a48b6ccb85b086b08f909024080890aeeb5a1c89e8171f4b18146156321dbba4","cross_cats_sorted":["cs.DM","cs.DS","math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-19T18:13:32Z","title_canon_sha256":"82dab30ec6f39addee891a9bfd19148bff1b1e27f73ab1da45f17ae407e3d7ef"},"schema_version":"1.0","source":{"id":"1311.4821","kind":"arxiv","version":8}},"canonical_sha256":"61e7d54da962433d26d973ae499d2b475ced74762ec437ae647aad1f9d18f0d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61e7d54da962433d26d973ae499d2b475ced74762ec437ae647aad1f9d18f0d7","first_computed_at":"2026-05-18T00:21:55.338565Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:55.338565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pDlZx4wxS9wTH8fJIdxyXmYpVx0R0vLklOSyUbEsUL6hxIrhXU/YRDDmzSurt+MHY6qXZN4Drmuq3A3AOIxGCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:55.339268Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.4821","source_kind":"arxiv","source_version":8}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89da5a78b2dbecb08e10b5f1a28dc7a235ece247c776c910bcd31264624a809f","sha256:89fdaeba0108b2490f78f66937dfa6b6dffdc25017d561af4ebd6d89eec82a60"],"state_sha256":"53bf512f8782c5352cfcbbb1e33d86316ccd25e6197a1f7ef68196d2c81b999f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"slaNJuCASMu9/VjpVbjwyV4Ir959CgfbP/598AV35qyamERITcmFgnHW2QaShsmfbadHl+qDFof2QCOlE6AmDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:18:26.620909Z","bundle_sha256":"479e4247540349eed7982f338062187ca3814fb5f5f5437761bc1108d740fadc"}}