{
  "generated_at_utc": "2026-10-09T03:06:28.882705+00:00",
  "source_commit": "fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb",
  "files": [
    {
      "path": "research/prototypes/random-sat-stream-2026-10-09-v1/archived-source/plot_random_sat_2026_10_09.py",
      "bytes": 1752,
      "sha256": "65d03c732de61f4cf0b97ef074ee3a46e0f205ed52a2016d33ad513c4eceb670"
    },
    {
      "path": "research/prototypes/random-sat-stream-2026-10-09-v1/archived-source/publish_random_sat_2026_10_09.py",
      "bytes": 26712,
      "sha256": "a4fc1e3ac84dbce88dcb894711a4a2540fe10e7012ffab40a18ec2e076d159c7"
    },
    {
      "path": "research/prototypes/random-sat-stream-2026-10-09-v1/archived-source/random_sat_stream_audit.py",
      "bytes": 12599,
      "sha256": "88cd1912a4c6706f443e5e312de8646a86bd2c092d4e8a8c24a1860e9629e302"
    },
    {
      "path": "research/prototypes/random-sat-stream-2026-10-09-v1/archived-source/validate_random_sat_2026_10_09.py",
      "bytes": 9844,
      "sha256": "cdea76a5c52e97b66e28f8deaa62be1891d1bf53178ae4f704644a60c90970c5"
    },
    {
      "path": "research/prototypes/random-sat-stream-2026-10-09-v1/cli/input.json",
      "bytes": 862,
      "sha256": "3949f31d2580f5a7a2c4813c5dc4b6c62bc3112c9ba68c54a73f038c92d6e23d"
    },
    {
      "path": "research/prototypes/random-sat-stream-2026-10-09-v1/cli/report.json",
      "bytes": 4089,
      "sha256": "54db5407c684b3ecb3d2499ed8e131cc7af1c7c693b17982458b94aac44707d1"
    },
    {
      "path": "research/prototypes/random-sat-stream-2026-10-09-v1/coupon-censoring-control.png",
      "bytes": 131847,
      "sha256": "734fed878eec375c7a51dccdb205963abe19b290c55be4aff07685732317a263"
    },
    {
      "path": "research/prototypes/random-sat-stream-2026-10-09-v1/coupon-control.json",
      "bytes": 10113,
      "sha256": "3610cd1851fe97f517d33b3c2c8b7fc38fe866e8bb106bca486f9c87a2de7574"
    },
    {
      "path": "research/prototypes/random-sat-stream-2026-10-09-v1/duplicate-input.json",
      "bytes": 862,
      "sha256": "3949f31d2580f5a7a2c4813c5dc4b6c62bc3112c9ba68c54a73f038c92d6e23d"
    },
    {
      "path": "research/prototypes/random-sat-stream-2026-10-09-v1/duplicate-report.json",
      "bytes": 3915,
      "sha256": "9632f63ea2f1ea5f76cec63570376b5a0fc15e3017bfca78886f3b874ade7e83"
    },
    {
      "path": "research/prototypes/random-sat-stream-2026-10-09-v1/exact-runs.json",
      "bytes": 1615877,
      "sha256": "738de97f39a7ceed4f84a2be39ec446816cef77f3863bed1d140bd6de01d7d80"
    },
    {
      "path": "research/prototypes/random-sat-stream-2026-10-09-v1/rank-bijections.json",
      "bytes": 596,
      "sha256": "2d2c05cbde5744314e6b34febaacbd586655c69db6217f92e9e49ad0222cbf72"
    },
    {
      "path": "research/prototypes/random-sat-stream-2026-10-09-v1/report.md",
      "bytes": 12063,
      "sha256": "6ae976f2d2c14c797c78c2da71b376650208992220cb47e07eb2a8ff4ea8e30b"
    },
    {
      "path": "research/prototypes/random-sat-stream-2026-10-09-v1/solver-runs.json",
      "bytes": 2164025,
      "sha256": "7b741fd471afbea44d5527d412e6fbc5bd3bd1d61026b1443b782d54e038c646"
    },
    {
      "path": "research/prototypes/random-sat-stream-2026-10-09-v1/summary.json",
      "bytes": 16436,
      "sha256": "e9f2e0a62998155f0ecc3a2a074e9cb5ee721a7dbc553fbbea58316f188ea646"
    },
    {
      "path": "research/prototypes/random-sat-stream-2026-10-09-v1/tiny-budget-input.json",
      "bytes": 158,
      "sha256": "7f0b5773042c75f1bbd62783b0338722a78dd6b55b7742c83af517e71a176eda"
    },
    {
      "path": "research/prototypes/random-sat-stream-2026-10-09-v1/tiny-budget-report.json",
      "bytes": 1832,
      "sha256": "5c8e3d8ec6320f7c02a1fe06cf20ac54d715e0bfe485793cee4b0ca140aad890"
    },
    {
      "path": "research/prototypes/random-sat-stream-2026-10-09-v1/work-limit-report.json",
      "bytes": 1193,
      "sha256": "e8db0434caf97269af760fe9add0bb8837f6454a6525c0cdce181b88a6420a53"
    }
  ],
  "source_files": [
    {
      "path": "preprints/A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026/article.pdf",
      "bytes": 213536,
      "sha256": "5318fe3d0e3db4e4c22f79dc8b342ae38fc1ddd60172ba78a00ee612c1576365",
      "extent": "21-page PDF; visually inspected page 1.",
      "note": "Selected reading only; no full source proof, algorithm or Lean/kernel execution."
    },
    {
      "path": "preprints/A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026/README.md",
      "bytes": 679,
      "sha256": "808bcd231f64e5357e2fe966917c40fcc5eabeeb82a1f62edd7605049f87d878",
      "extent": "Complete collection README for this manuscript.",
      "note": "Selected reading only; no full source proof, algorithm or Lean/kernel execution."
    },
    {
      "path": "preprints/A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026/build/source/sections/introduction.tex",
      "bytes": 9948,
      "sha256": "d73291596da44658b40557d8623dab9af385a43cdc2ab8575651f505a03d50bb",
      "extent": "Complete introduction: proper clause law, fixed-k strict-side limits and Carenini priority.",
      "note": "Selected reading only; no full source proof, algorithm or Lean/kernel execution."
    },
    {
      "path": "lean/ComparatorChallenges/FixedClauseThreshold.lean",
      "bytes": 2103,
      "sha256": "1c7c2b8f17e74a725a859dcdd19f4ee4da35c38230dde825cb257e78ea18c39b",
      "extent": "Complete challenge interface and finite-cardinality definitions. No Lean/kernel run.",
      "note": "Selected reading only; no full source proof, algorithm or Lean/kernel execution."
    },
    {
      "path": "preprints/Variance-of-the-Random-k-SAT-Hitting-Time-September-27-2026/article.pdf",
      "bytes": 474205,
      "sha256": "9e47a7c16a835f9111435037d4103a0dd974111512c62c0f0e9c96ea14bc2d56",
      "extent": "37-page PDF; visually inspected page 1.",
      "note": "Selected reading only; no full source proof, algorithm or Lean/kernel execution."
    },
    {
      "path": "preprints/Variance-of-the-Random-k-SAT-Hitting-Time-September-27-2026/build/source/sections/introduction.tex",
      "bytes": 9955,
      "sha256": "dc63bb28e88b320d713cbfe8bedc453b5aa783fd9516cc7cbae15cdcd717a248",
      "extent": "Complete introduction: uncapped/clipped variance, older k=3 logarithmic bound, lower-cap condition and centering limitation.",
      "note": "Selected reading only; no full source proof, algorithm or Lean/kernel execution."
    },
    {
      "path": "preprints/Variance-of-the-Random-k-SAT-Hitting-Time-September-27-2026/build/source/sections/conventions.tex",
      "bytes": 6663,
      "sha256": "9d7d6588eff22e7f4979ff98d92efd2b0ef81fb4ccf4743867b8477c656703fd",
      "extent": "Complete conventions: first failure, last SAT, clipping endpoints and exact first-moment tail comparison.",
      "note": "Selected reading only; no full source proof, algorithm or Lean/kernel execution."
    },
    {
      "path": "lean/docs/235.md",
      "bytes": 2877,
      "sha256": "9358e46cd9f3104ceaf11000d5afe3eac26c48bebb7329f1a19fc5d3c55e987b",
      "extent": "Complete selected scope note; newer linear-3-SAT companion is not included in this formal scope.",
      "note": "Selected reading only; no full source proof, algorithm or Lean/kernel execution."
    },
    {
      "path": "lean/ComparatorChallenges/SATVariance.lean",
      "bytes": 2226,
      "sha256": "8f93bd2b1d89a67b7c19ed9e52d713820344eaa8db1e7d811ed63437bc5b6f3a",
      "extent": "Complete challenge interface, stream law, exceptional-infinity conversion, cap and variance statement; no proof/kernel execution.",
      "note": "Selected reading only; no full source proof, algorithm or Lean/kernel execution."
    },
    {
      "path": "lean/ComparatorChallenges/SATSharpness.lean",
      "bytes": 2742,
      "sha256": "ee5a15059201018a11142484b06e5475ff636df59b3f5a449fde9d60190f1593",
      "extent": "Complete lifetime/replacement sharpness interface; no proof/kernel execution.",
      "note": "Selected reading only; no full source proof, algorithm or Lean/kernel execution."
    },
    {
      "path": "preprints/Linear-Variance-of-the-Random-3-SAT-Hitting-Time-October-5-2026/linear-variance-of-the-random-3-sat-hitting-time.pdf",
      "bytes": 312878,
      "sha256": "01f912a6aaba76c36cb38913ae3d902329696e1e5502feed9b71903d42b8bc08",
      "extent": "10-page PDF; visually inspected page 1.",
      "note": "Selected reading only; no full source proof, algorithm or Lean/kernel execution."
    },
    {
      "path": "preprints/Linear-Variance-of-the-Random-3-SAT-Hitting-Time-October-5-2026/build/source/main.tex",
      "bytes": 27412,
      "sha256": "888db8d247151937a55c67a14f7b014bb9a6c812639680dd300ea5df94adfcf4",
      "extent": "Lines 1-240, including re-read 50-125: theorem, context, clause-root setup, killing inequality and bounded-potential setup. Remaining proof not reviewed.",
      "note": "Selected reading only; no full source proof, algorithm or Lean/kernel execution."
    },
    {
      "path": "preprints/Computing-the-Random-3-SAT-Threshold-September-27-2026/article.pdf",
      "bytes": 612468,
      "sha256": "be7bde6cd4e513e134ffa36b94506ddd9fd0c13fd9f740d2ebac8494d249c530",
      "extent": "48-page PDF; visually inspected page 1.",
      "note": "Selected reading only; no full source proof, algorithm or Lean/kernel execution."
    },
    {
      "path": "preprints/Computing-the-Random-3-SAT-Threshold-September-27-2026/build/sections/introduction.tex",
      "bytes": 5000,
      "sha256": "ce097bf0270147675456facc16237707e48a6cff8bd21fc1e5b51849600ae58c",
      "extent": "Complete introduction: computable threshold, no efficiency estimate, priority and fixed proper-3-SAT law.",
      "note": "Selected reading only; no full source proof, algorithm or Lean/kernel execution."
    },
    {
      "path": "preprints/Computing-the-Random-3-SAT-Threshold-September-27-2026/build/sections/certificates.tex",
      "bytes": 3309,
      "sha256": "0226b1df2971a22ef41bee317dba05e66d10fe04f55081b0f977cc04a7f13595",
      "extent": "Complete certificate search section: lower sequence, rational upper trials, strict negativity and dovetailing.",
      "note": "Selected reading only; no full source proof, algorithm or Lean/kernel execution."
    },
    {
      "path": "preprints/Computing-the-Random-3-SAT-Threshold-September-27-2026/build/sections/assembly.tex",
      "bytes": 3421,
      "sha256": "aaeed0fe92985d3d129cfcd441b9dcdd1a5e4a181bd74c2fdd33eb24d22fd738",
      "extent": "Complete assembly: 2^67 n^(-1/6) lower penalty, finite upper witnesses and no runtime estimate.",
      "note": "Selected reading only; no full source proof, algorithm or Lean/kernel execution."
    },
    {
      "path": "preprints/Computing-the-Random-3-SAT-Threshold-September-27-2026/build/sections/probability.tex",
      "bytes": 31713,
      "sha256": "2995ca7a500a40072f4401e7b613990bba904e3bc85884fffccd8a33a9b5d37c",
      "extent": "Lines 1-180 and 550-635: relaxed Poisson model, deletion moment setup, exhaustive finite integration and lower-certificate construction; intervening proof and later robustness argument not reviewed.",
      "note": "Selected reading only; no full source proof, algorithm or Lean/kernel execution."
    },
    {
      "path": "lean/ComparatorChallenges/SATComputability.lean",
      "bytes": 1577,
      "sha256": "0d9757c58aec5ba367553bcb5e5ec542bfe564191bc9c9c9a3bf402735556643",
      "extent": "Complete computability challenge interface; no source algorithm or proof/kernel execution.",
      "note": "Selected reading only; no full source proof, algorithm or Lean/kernel execution."
    }
  ],
  "scope": "Selected source reading and conventional finite stream evidence. Archived scripts are inert; source algorithms/proofs/kernels not executed."
}