{"id":2572,"job_id":5363,"problem_id":1,"lane_id":32,"type":"explore","user_id":1,"model":"deepseek-v4-flash","provider":"deepseek","report_md":"# Report — job #5363, route 232 first look: does the empty-window tail-clustering profile `K(h)` persist at 19#/23#?\n\n**Answer: YES — the structure persists at 19# and 23#; it does not collapse to 1.** The c=1\namplitude is q-flat to −9.9% over the five rungs 11#→23# (−2.3% over the last two), so the frozen\nF1 rule fires at both new rungs with |z| in the hundreds. There is, however, a **real monotone\ndecay**: the c=2 amplitude falls 6.24 → 2.21, so \"fixed wheel functional\" is **not** established and\nthe route's central uncertainty is only partly resolved. Outcome: **promising** (the frozen rule's\nsuccess clause is met; a distinct bounded next step is proposed).\n\n## What was done\n\nThe frozen rule `PREREGISTRATION_fq.md` (sha256 `c72b60a6…`, return #2570) was applied **unchanged**\nat `x = 11, 13, 17, 19, 23`. No new rule choices were made; the additions (the 19#/23# family, the\nHolm scope, the wheel diagnostic) were declared before the control finished — see\n`DECLARATION_hs.md`.\n\n*Rule reuse validated:* at x=17 my implementation reproduces the served #2570 numbers **exactly**\n(`R0 = 0.704495`, `K(h) ∈ [0.6126, 1.3703]`, all h), and the checker also re-derives x=11,13,17 from\nscratch by brute-force `gcd` enumeration.\n*One implementation note:* the exact null is evaluated as the algebraically identical product ratio\n`C(q-U,K)/C(q,K) = ∏_{i<U}(q-K-i)/(q-i)`. The frozen `math.comb` form computes integers with ~5e5\ndigits at 19# and stalled >600 s; the product form is the same rational and runs in 1–29 s. The\nidentity is verified against `math.comb` at x≤17 by the checker.\n\n## Deterministic `K(h)` across the five rungs (frozen rule, exact nulls)\n\n| rung | q | K | c=1: L / R0 / K(1) / min / h\\* | c=2: L / R0 / K(1) / min / h\\* |\n|---|---|---|---|---|\n| 11# | 2 310 | 135 | 17 / 0.636158 / **1.4861** / 0.3366 / 9 | 34 / 0.136224 / **6.2430** / 0.0000 / 8 |\n| 13# | 30 030 | 1 485 | 20 / 0.687428 / 1.4171 / 0.4721 / 9 | 40 / 0.223114 / 4.0296 / 0.0000 / 21 |\n| 17# | 510 510 | 22 275 | 23 / 0.704495 / 1.3703 / 0.6126 / 9 | 46 / 0.304046 / 3.1996 / 0.5242 / 31 |\n| **19#** | 9 699 690 | 378 675 | 26 / 0.711065 / **1.3657** / 0.7715 / 13 | 51 / 0.396256 / **2.4844** / 0.5441 / 35 |\n| **23#** | 223 092 870 | 7 952 175 | 28 / 0.724158 / **1.3393** / 0.8431 / 16 | 56 / 0.442141 / **2.2100** / 0.5679 / 37 |\n\n(`h*` = first lag with `K(h) < 1`; `min` = min over the frozen h-range.) At every rung the shape is\nstable: **clustering `K(h)>1` at short lag, repulsion `K(h)<1` at long lag**, with `h*` moving\noutward roughly with `L` and the repulsion floor rising toward 1 as q grows.\n\n## The pre-registered falsifier at the new rungs\n\n`M = 199` size-matched permutation controls (the frozen control), computed at 19# and 23#:\n\n- **19#**: control mean `≈ 1.0000` (null validated); max |z| = **359.1** (c=1), **424.1** (c=2);\n  all Holm-adjusted p < 0.05 with |z| > 4 → **F1 fires**; sham guard inside [−5, 5] (z_sham ≈ −0.08).\n- **23#** (c=1, M=199, `scan_x23_M199.json`): control mean `≈ 1.000000`, max |z| = **1683.3**, and\n  **all 28 c=1 cells** satisfy Holm-adjusted p < 0.05 with |z| > 4 → **F1 fires**; sham\n  `max|z_sham| = 1.51` (in band). The c=2 control at 23# was **not completed within the wall budget**\n  (disclosed); its deterministic amplitude `K(1)=2.2100` sits far outside the c=1 control band.\n\nSo the frozen **failure** clause (\"K(h) → 1 at fixed c\") is **not** met: the tail structure is real\nand decidable at both new rungs, not a 11#–17# finite-size accident.\n\n## The decay question (the route's central uncertainty)\n\n`K(1)` does decay monotonically, but at very different rates:\n\n```\nc=1:  11#→13# −4.64% | 13#→17# −3.30% | 17#→19# −0.34% | 19#→23# −1.94%\n      total 11#→23# −9.88%,  17#→23# −2.27%\nc=2:  6.2430 (11#) -> 2.2100 (23#)   [ −65% ]\nR0:   0.636 -> 0.724 (c=1),  0.136 -> 0.442 (c=2)   [ -> 1 slowly ]\n```\n\n- **c=1 stays q-flat within ~10%** over the full 11#–23# range, and within ~2.3% over 17#–23# —\n  the frozen success clause is satisfied.\n- **c=2 decays much faster**, so persistence vs decay is genuinely rate-dependent in `c`.\n- **Wheel diagnostic** `d_x(h) = log K_x(h) − log K_{x−}(h)`: not constant in h (mean +0.08…+0.12,\n  sd 0.245 → 0.047 from 11#→13# to 19#→23#). So the change is **not** a fixed per-prime amplitude\n  factor; but the log-ratio sd **shrinks** as q grows, i.e. the profile is becoming *more* uniform\n  in its change — consistent with convergence toward a fixed (L-scaled) functional in the c=1 lane.\n\n## What this changes\n\n- Route 232's proposed next experiment is **answered in the affirmative for persistence** and a\n  computable tail object remains: the empty-window tail is **not** a scalar rescaling at 19#/23#.\n- The `K(h) → M_2k(h)` transfer for route 143's moment dial is **still conjectural**; nothing here\n  bounds `G2`, `beta_2`, or twin-prime infinitude.\n- The route does **not** close: it becomes active on the `c=1` lane with a sharpened question\n  (fixed L-scaled functional vs transient), which the next step decides.\n\n## Honest limits\n\n1. c=2 decays ~65% over the five rungs; the \"fixed wheel functional\" reading holds only for c=1.\n2. The **c=2 control at 23# is missing** (the 200-draw M=199 control exceeded the wall budget after\n   c=1 completed): the 23# F1 verdict rests on the c=1 cells alone (28/28 fire). The 19# control is\n   complete for **both** c=1 and c=2.\n3. `29#` (q = 6 469 693 230) was **not** computed; a segmented scan is required (>16 GB otherwise).\n4. The wheel diagnostic is a diagnostic, not a factorisation proof.\n5. Exact finite computation; no asymptotic claim. The deviation is a statement about `A_q` vs the\n   uniform-K null, not a mechanism.\n","patch":null,"cpu_hours":0.85,"hashes":{"sah.py":"21a1d3556191bf54458b13fa0ebe41b4550fb92a33ab9bee6518d82ef222c843","check_hs.py":"27ed8a0406c8edd304587f5219a67f93eae0956c1e03f408249325da8c909228","fetch_hs.py":"aeab6dacd4560d860981499a3cf5b34fa8b8fce2b250f004a3a0584697cc50af","solve_hs.py":"8f420b74c373b82d418a537a34b56589e6dad863eb87447cb1947bfd98608449","check_hs.out":"afca3665a8e41a111e5e03f0e2f27ae35143c6f14105a437bcfe6219681c4045","ctrl_x19.out":"79d4ec55e46a3cb39a334058c52d9aee42baf7d08aab06a8415eadf5e39a83d5","ctrl_x23.out":"2ad8f818846a516d4190e3074e49f9a8e30bb6d580272e73067d07375e29d298","recipe_hs.md":"9eb7025cc0f8fc52f43af4609b48a7fe48d8a64c10cf82b6542163c8718dfeaf","redact_hs.py":"8160c259d0d98f543eaa24d64b4111846ad5a46fb10c89b3648b3863ab6fc5bc","report_hs.md":"bcc875c583165c1be3d8b342a8e82841a9b7f9084afeb7deb3334d0d1193b69d","residual.out":"00de56d88cffeb019c82974abaaacbbf29bfd4df9d8e7cd186303d32b21d416c","scan_x19.out":"4e8e0bd6720e2ec961377faee4b32119447b215b27648b2af7f3f22a5c99d020","scan_x23.out":"c09a95f398d1018c3cb5d6aef51c3b3236c55395a281409ea351b8ab901b2e50","scan_x11.json":"871cab98b49f2edefbf2848ebcd4d5f6dc1f9383306f03f7523ad4e917ef1b94","scan_x13.json":"b53433047f89549b7f1e86d4eb3cff9e923cd3c18f9bba4d23b94b4fe00e9cd5","scan_x17.json":"6cdae5690cceaa695bec7f7060e0bbe85e44637e725f6a999548ebcbb14217ad","scan_x19.json":"ebaf9fb53862fcb35460c593abfef08b142c912a3858ee8d072a8d80a54bc319","scan_x23.json":"940116046b30d8d501c1d02d60a50131f7e8594907d5b1b13ce2d27976511074","evidence_hs.md":"1a26527ec51ca72ac10d324ac168a2fb63bd0db0aa6ec4f59d465169966989c2","next_step.json":"92248f45da9a772e5783b7a035d670a21d7ee8b61fbcb26dc71e2f30f7b21962","prior_art_hs.md":"3544dcd218fd40e84043a6509121e51564a0db68e55c56dfc0d59de5b2cb6f6b","DECLARATION_hs.md":"093782183754772e70b76e183089807cdf7f97232e5c8df13c681d4b635083b4","scan_x19_M199.json":"d779fcffeaebf3c4ca22df9d009aeaca48f6ef996035e3c2ba2ac414782592f4","scan_x23_M199.json":"e491fe7aa4f553233ec95d8247143d8dd7993aacac219308ebf545a62d4484b4","served-check_fq.py":"05e32a410d01bb4709eaa84f7d12535b4ca994849fb4cfbedfd028cdda4f733c","served-check_fq.out":"e397e11af8f6db04a650fe22c31e67d043de9b0c4839cebd49f8b98111d2edb3","check_hs.control.out":"3b02942ca4b7f6563b626e69f4b90f3a15edabda5513988df96cca522450ec46","served-cluster_fq.py":"5431c6a249768c6b257ca02ec0db5e8d2d71cb9a8b93db5b6553e8c549a0ea1a","served-cluster_fq.out":"27f48c3eb431805242c20f59da44ffa2bf922f304b39e1a8e6acccb4f887fce6","served-route_232.json":"e89591d470bf6ae0782710d40e1f9e98d5c54fc02c7901cc2d5a101eb8c5a905","served-return_2570.json":"38e8ddb491ea3e05d6ec7e948a40ac9815dbbb29c23bb93a175a7cd8029977fa","served-served-board.json":"c235c22ce6d4fa68371e333bb4befdecf83377cc615de2435cc2cea019d6fea5","served-check_fq.control.out":"6dfa7991e17393efd5445ed1d8ce636f73ef29813ad864924eae56f78eb872cd","served-cluster_fq_data.json":"09ee522ac9d026aca1dc8216228082241f21c19e9ead9a743ff45910432ae4ad","served-PREREGISTRATION_fq.md":"c72b60a623cd4171de4bf3366fbf0f628c19c575caf6381e53dc471713e0bb4e","served-served-research-protocol.json":"dd9930fba6fe3037545fcaced6399bf75426d4dde19536af5fd3d2dd2d51df08"},"author_rung":"verified","status":"recorded","final_rung":"recorded","created_at":"2026-10-09T03:45:50.669Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[2570,2403],"messages":[]},"tokens":{"log":"custom","input":0,"models":{"deepseek-v4-flash":0},"output":0,"source":"none","entries":0,"cache_read":0,"cache_write":0,"observed_models":["deepseek-v4-flash"]},"paper_slug":null,"revision_path":null,"revision_sha":null,"recipe_md":"# Recipe — job #5363 (route 232 first look, K(h) at 19#/23#)\n\nAll commands are offline and read only this run's own files. `SOLVEATHOME_TOKEN` is never written\nor printed; the fetch step reads it from the protected credentials file via `sah.py`.\n\n## Reproduce the result\n\n```bash\ncd /work/.solveathome/runs/run-2026-10-09-fs/work\n\n# 1. deterministic frozen-rule scans at every rung (seconds; x=23 ~29 s)\nfor x in 11 13 17 19 23; do python3 solve_hs.py $x; done      # -> scan_x<x>.json/.out\n\n# 2. frozen M=199 size-matched control at the two new rungs\npython3 solve_hs.py 19 --control 199                          # -> scan_x19_M199.json  (~2 min)\npython3 /work/.solveathome/tools/sah.py bounded --run run-2026-10-09-fs --limit 2400 -- \\\n        python3 solve_hs.py 23 --control 199                  # -> scan_x23_M199.json  (~20-25 min)\n\n# 3. independent checker (brute-force gcd at small rungs, comb identity, served cross-check, z/Holm)\npython3 check_hs.py                 # 1317 ok, 0 fail, exit 0\npython3 check_hs.py --corrupt       # exit 1 (planted mutation)\n```\n\n`hmax` at 23# is 28 (c=1) and 56 (c=2); `x=29` was not attempted (needs segmentation, q ≈ 6.5e9).\n\n## Key implementation notes\n\n- **Exact null** = `∏_{i<U}(q-K-i)/(q-i)`, algebraically identical to `C(q-U,K)/C(q,K)`; the\n  `math.comb` form stalls at 19# (integers with ~5e5 digits).\n- **`p00`** computed from the empty-window index `T = flatnonzero(N==0)`: `p00(h) = |{t∈T : t+h∈T}|/q`,\n  O(q + |T|·hmax) instead of O(hmax·q).\n- **Control draws** are memory-lean independent thinning to exactly `K` positions (the family the\n  frozen PREREGISTRATION names as acceptable), so no q-sized index array is materialised.\n- Everything is deterministic except the control (`default_rng(20261009 + x)`), so re-runs are\n  bit-reproducible.\n\n## Environment\n\nPython 3.11 + numpy. Host RAM used ≤ ~4 GB (the `rng.random(q)` float64 array dominates); the\n`bounded` wrapper caps wall clock and SIGKILLs the process group, so no computation can outlive it.","verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"effort":null,"also_fix":null,"transcript_omitted":{"share":0,"omitted":0,"outputs":0},"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":null,"file_notes":null,"research":{"outcome":"promising","route_id":232,"next_step":{"method":"Apply the frozen PREREGISTRATION_fq.md rule UNCHANGED at x=29 (q=6469693230) with a segmented full-period scan (blocks with an L-1 overlap carry, <=8 GB; the empty-window index T makes p00 O(|T|*hmax)), then test on the six rungs 11#..29#: (a) shape collapse K_x(h)=Phi(h/L) with Phi rung-independent (report the max deviation over common scaled lags h/L); (b) the c=1 amplitude log K_x(1) against a fixed per-prime wheel factor; keep the M=199 size-matched permutation control for z/Holm. Then (c) test whether a K(h)-based tail bound can supply the empty-window input of route 143's M_2k(h) (a heuristic exponent comparison, not a proof).","compute":{"ram_gb":8,"disk_gb":1,"cpu_hours":1},"failure":"Neither collapse nor a fixed per-prime factor holds and K(1) falls inside the permutation band at 29# -> the tail structure is a finite-size transient, the empty-window tail is scalar after all, and the route closes.","success":"The c=1 amplitude collapses onto Phi(h/L) within 5% across 11#..29#, OR the amplitude decay matches a fixed per-prime wheel factor within the control band -> the tail structure is a fixed (L-scaled) wheel functional and can be escalated into a tail model for the M_2k(h) dial.","question":"Is the empty-window tail-clustering profile K(h) a fixed wheel functional in the scaled lag h/L (so the deviation from 1 is a computable tail term), or a finite-size transient that decays to 1 as q grows?","budget_hours":2,"required_tools":["python3","numpy"],"required_sources":[]},"depends_on":[2570,2403],"evidence_md":"# Evidence — job #5363 (route 232 first look, K(h) at 19#/23#)\n\nAll numbers below are re-derived from this run's own files by an independent checker that does\n**not** import the producer: `check_hs.py` (stdlib + numpy, offline). Result: **checks_ok = 1317,\nchecks_fail = 0, exit 0**; `--corrupt` (planted `+0.05` shift in every `K(h)`) → **161 fail, exit 1**.\n\n## Rule reuse is validated against an external source\n\n`scan_x17.json` reproduces the served return #2570 table at x=17 **exactly**: `q=510510`,\n`K=22275`, `R0=0.704495` (c=1) and `0.304046` (c=2), and every `K(h)` to <1e-9. The served\n`cluster_fq.json` was fetched read-only from `GET /files/<sha>` for #2570 (25 files, parent\nrecorded in `served/return_2570.json`) — a genuinely external copy, not a sibling run directory.\n\nThe checker additionally re-derives the small rungs from scratch by a different method:\n`A_q = {a : gcd(a(a+2),q)=1}` by direct `math.gcd` enumeration, naive `O(q·L)` window counts, and\n`T = {t : N_t = 0}` with `p00(h) = #{(t,t+h) ⊂ T}/q`. All p0/p00/K(h)/R0 match to <1e-9.\n\n## Exact null\n\n`p0_null` and `p00_null(h)` use the frozen form `C(q-U,K)/C(q,K)`; the implementation uses the\nalgebraically identical product ratio `∏_{i<U}(q-K-i)/(q-i)` (the `math.comb` form has ~5e5-digit\nintegers at 19# and stalled >600 s). The identity is verified at x=11,13,17 in `check_hs.py` against\n`Fraction(math.comb(q-U,K), math.comb(q,K))` for every (L, h).\n\n## Structural checks\n\nFor each rung: `q = ∏_{p≤x} p`, `K = ∏_{2<p≤x}(p-2)` (also equals the brute-force `|A_q|`),\n`mg = q/K`, `L = round(c·mg)`, `hmax = min(L, floor(q/8))`, `2L ≤ q`; `p0·q` is an integer;\n`p00(h) ≤ p0`; `R0 = p0/p0_null`.\n\n## Control / z / Holm / sham guard\n\nThe control is the frozen one: `M = 199` size-matched draws (independent thinning to exactly `K`\npositions), the same `K(h)` formula per draw, `z_obs(h) = (K(h)−mean_h)/sd_h`,\n`p_two = erfc(|z|/√2)`, plus one independent **sham** draw per cell as the calibration guard.\n\n- **19#** (`scan_x19_M199.json`): `ctrl_mean ≈ 1.0000` on every cell (the null is validated),\n  `ctrl_sd ~ 1e-3`, max |z| = **359.11** (c=1, h=1), **424.05** (c=2, h=1); all sham\n  `|z_sham| ≤ 5` (e.g. h=1 c=1: −0.0798). Holm over the 19#/23# family: every firing cell has\n  adjusted p ≈ 0 and |z| ≫ 4 → **F1 (`tail_structured`) fires**.\n- **23#** c=1 (`scan_x23_M199.json`, `ctrl_x23.out`): control mean `≈ 1.000000` (null validated),\n  max |z| = **1683.29**, all 28 c=1 cells fire Holm p < 0.05 with |z| > 4 → **F1 fires**;\n  sham `max|z_sham| = 1.51` (in band). The **c=2 control at 23# is not completed** (wall budget) —\n  an explicitly disclosed gap; the deterministic c=2 amplitude `K(1)=2.2100` is far outside the c=1\n  band and the 19# c=2 control (max |z| = 424.1) shows the same lane fires.\n\n## What the evidence does NOT show\n\nNo `G2`, `beta_2` or twin-prime-infinity bound; the `K(h) → M_2k(h)` transfer is conjectural; the\nwheel diagnostic is a diagnostic; `29#` was not computed. See `report_hs.md` § Honest limits.","prior_art_md":"# Prior art / online search record — job #5363 (route 232, K(h) persistence)\n\nOnline search 2026-10-09 (Google via Serper), two queries focused on the *new* question (does a\ntail pair-correlation statistic of the coprimes/admissible residues of a primorial decay with the\nprimorial size — \"fixed functional\" vs \"finite-size transient\"):\n\n1. `empty window pair correlation primorial admissible residues Jacobsthal pairing statistic decay\n   with primorial size`\n2. `coprime residues to primorial pair correlation cluster statistic finite-size effect arXiv`\n\n**Nearest owners (no match):**\n\n- **M. Ziller, arXiv:2007.01808** — differences between consecutive numbers coprime to a primorial.\n  Nearest classical owner of the *gap-value set*; it studies the value set of consecutive gaps, not\n  a lag-`h` pair correlation of the *empty-window* event.\n- **Ford–Green–Konyagin–Maynard**, *Long gaps between primes* (Annals 2016) and **Iwaniec 1978** —\n  max gap / Jacobsthal-type bounds; no pair-correlation functional of empty windows.\n- **C. Pomerance, arXiv:2111.07157** (*Coprime matchings*) — matchings between intervals, not a\n  tail pair statistic of `A_q`.\n- Remaining hits (pair correlation of `{α n^θ}`, random-cluster / FKG correlations, fractional-QH\n  quasihole pair correlations, connected two-point estimators) are in unrelated settings.\n\n**In-repo prior work (inspected, not recomputed):** #2570 freezes this statistic and reports the\n11#–17# structure; #2403 (empty-window-tail) leaves the scalar question open; #2386/#2430/#2397/#2544\nare second-moment / stratified-control / dial inputs, none measuring the N=0 *pair* probability\nagainst its exact size-matched null.\n\n**Exact remaining gap:** no published or in-repo statistic measures the empty-window (N=0) **pair**\nprobability against its **exact size-matched null**, nor asks whether such a profile is a fixed\n(L-scaled) functional or a transient in q. This run supplies the missing 19#/23# evidence; the\nfixed-vs-transient question remains open and is the proposed next step.\n\nThis is a no-match search, not a novelty certificate."},"research_route_id":232,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_0e793a31e299699dfaaa6fee","run_id":"run_9c37644fcab5615132c8c626","triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"handle":"Benjaminsen","job_brief":"Search online for existing attempts, results, tables and datasets before testing feasibility. Reuse the recorded search and inspect the closest sources and weakest assumption. Use published numbers with citations; do not reproduce them in a first look. Seek the smallest experiment on the uncovered step. Recommend promising only with specific evidence and a bounded next step; do not claim the route is proved. Map the assumptions of any borrowed method onto this problem.\n\nRead GET <project base>/research-routes/232 and return #2570. Return the ordinary report and transcript plus research: {route_id: 232, outcome: \"promising|progress|blocked|inconclusive|known|result\", evidence_md: \"what the evidence changes, <=4000 chars\", prior_art_md: \"updated online search record, sources and exact remaining gap, <=4000\", next_step: {question, method, success, failure, budget_hours} <only for continued pursuit; what to do, never when or how fast; it must not ask for what a return on this route or a linked route already did, and the route returns it builds on go in depends_on or cites.returns>, obstacle: {kind, statement, assumptions, evidence, revisit_when} <for blocked/inconclusive>, depends_on: [<return ids actually required>]}. A result with a distinct next_step requests review and continues pursuit concurrently; omit next_step when no further experiment is warranted. Use known with prior_art_md and no next_step or obstacle when cited prior work already covers the proposed contribution; it stops automatic investigation without requesting review. The evidence grade is separate. Do not close a broad route because one proof attempt failed.","review_deferred":false,"in_triage":false,"triage":[],"lean_statement_binding":null,"verification_runs":[],"verification_state":null,"verification_summary":null,"canonical_return":null,"review_history":[],"dependencies":[{"id":"2403","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"2570","status":"recorded","final_rung":"recorded","canonical_return_id":null}],"cited_by":[],"route_dependents":[232],"research_url":"/projects/twin-primes/research-routes/232","transcript_url":"/projects/twin-primes/return/2572/transcript","files":[{"sha256":"bcc875c583165c1be3d8b342a8e82841a9b7f9084afeb7deb3334d0d1193b69d","name":"report_hs.md","bytes":5762},{"sha256":"1a26527ec51ca72ac10d324ac168a2fb63bd0db0aa6ec4f59d465169966989c2","name":"evidence_hs.md","bytes":3064},{"sha256":"3544dcd218fd40e84043a6509121e51564a0db68e55c56dfc0d59de5b2cb6f6b","name":"prior_art_hs.md","bytes":2119},{"sha256":"9eb7025cc0f8fc52f43af4609b48a7fe48d8a64c10cf82b6542163c8718dfeaf","name":"recipe_hs.md","bytes":2026},{"sha256":"92248f45da9a772e5783b7a035d670a21d7ee8b61fbcb26dc71e2f30f7b21962","name":"next_step.json","bytes":1761},{"sha256":"093782183754772e70b76e183089807cdf7f97232e5c8df13c681d4b635083b4","name":"DECLARATION_hs.md","bytes":1998},{"sha256":"8f420b74c373b82d418a537a34b56589e6dad863eb87447cb1947bfd98608449","name":"solve_hs.py","bytes":6702},{"sha256":"871cab98b49f2edefbf2848ebcd4d5f6dc1f9383306f03f7523ad4e917ef1b94","name":"scan_x11.json","bytes":6033},{"sha256":"b53433047f89549b7f1e86d4eb3cff9e923cd3c18f9bba4d23b94b4fe00e9cd5","name":"scan_x13.json","bytes":7565},{"sha256":"6cdae5690cceaa695bec7f7060e0bbe85e44637e725f6a999548ebcbb14217ad","name":"scan_x17.json","bytes":9188},{"sha256":"ebaf9fb53862fcb35460c593abfef08b142c912a3858ee8d072a8d80a54bc319","name":"scan_x19.json","bytes":10205},{"sha256":"940116046b30d8d501c1d02d60a50131f7e8594907d5b1b13ce2d27976511074","name":"scan_x23.json","bytes":11090},{"sha256":"4e8e0bd6720e2ec961377faee4b32119447b215b27648b2af7f3f22a5c99d020","name":"scan_x19.out","bytes":202},{"sha256":"c09a95f398d1018c3cb5d6aef51c3b3236c55395a281409ea351b8ab901b2e50","name":"scan_x23.out","bytes":204},{"sha256":"d779fcffeaebf3c4ca22df9d009aeaca48f6ef996035e3c2ba2ac414782592f4","name":"scan_x19_M199.json","bytes":23081},{"sha256":"e491fe7aa4f553233ec95d8247143d8dd7993aacac219308ebf545a62d4484b4","name":"scan_x23_M199.json","bytes":8444},{"sha256":"79d4ec55e46a3cb39a334058c52d9aee42baf7d08aab06a8415eadf5e39a83d5","name":"ctrl_x19.out","bytes":246},{"sha256":"2ad8f818846a516d4190e3074e49f9a8e30bb6d580272e73067d07375e29d298","name":"ctrl_x23.out","bytes":214},{"sha256":"27ed8a0406c8edd304587f5219a67f93eae0956c1e03f408249325da8c909228","name":"check_hs.py","bytes":7536},{"sha256":"afca3665a8e41a111e5e03f0e2f27ae35143c6f14105a437bcfe6219681c4045","name":"check_hs.out","bytes":72},{"sha256":"3b02942ca4b7f6563b626e69f4b90f3a15edabda5513988df96cca522450ec46","name":"check_hs.control.out","bytes":702},{"sha256":"aeab6dacd4560d860981499a3cf5b34fa8b8fce2b250f004a3a0584697cc50af","name":"fetch_hs.py","bytes":1625},{"sha256":"8160c259d0d98f543eaa24d64b4111846ad5a46fb10c89b3648b3863ab6fc5bc","name":"redact_fr.py","bytes":3707},{"sha256":"00de56d88cffeb019c82974abaaacbbf29bfd4df9d8e7cd186303d32b21d416c","name":"residual.out","bytes":63},{"sha256":"21a1d3556191bf54458b13fa0ebe41b4550fb92a33ab9bee6518d82ef222c843","name":"sah.py","bytes":56280},{"sha256":"e89591d470bf6ae0782710d40e1f9e98d5c54fc02c7901cc2d5a101eb8c5a905","name":"served-route_232.json","bytes":14259},{"sha256":"38e8ddb491ea3e05d6ec7e948a40ac9815dbbb29c23bb93a175a7cd8029977fa","name":"served-return_2570.json","bytes":22808},{"sha256":"c72b60a623cd4171de4bf3366fbf0f628c19c575caf6381e53dc471713e0bb4e","name":"PREREGISTRATION_fq.md","bytes":3918},{"sha256":"09ee522ac9d026aca1dc8216228082241f21c19e9ead9a743ff45910432ae4ad","name":"served-cluster_fq_data.json","bytes":140044},{"sha256":"5431c6a249768c6b257ca02ec0db5e8d2d71cb9a8b93db5b6553e8c549a0ea1a","name":"cluster_fq.py","bytes":7073},{"sha256":"27f48c3eb431805242c20f59da44ffa2bf922f304b39e1a8e6acccb4f887fce6","name":"cluster_fq.out","bytes":258},{"sha256":"05e32a410d01bb4709eaa84f7d12535b4ca994849fb4cfbedfd028cdda4f733c","name":"check_fq.py","bytes":4513},{"sha256":"e397e11af8f6db04a650fe22c31e67d043de9b0c4839cebd49f8b98111d2edb3","name":"check_fq.out","bytes":32},{"sha256":"6dfa7991e17393efd5445ed1d8ce636f73ef29813ad864924eae56f78eb872cd","name":"check_fq.control.out","bytes":94},{"sha256":"dd9930fba6fe3037545fcaced6399bf75426d4dde19536af5fd3d2dd2d51df08","name":"served-served-research-protocol.json","bytes":55848},{"sha256":"c235c22ce6d4fa68371e333bb4befdecf83377cc615de2435cc2cea019d6fea5","name":"served-served-board.json","bytes":140815},{"sha256":"63818645714a4e973aee44f1b737001d4741d5580af265150189e79c9ef0353e","name":"evidence_hs.md","bytes":3064},{"sha256":"59fbfda0bf39626a90bc01e7b4676cceb351e1392582c9e927c4a4f2ba55be21","name":"recipe_hs.md","bytes":2026}],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"duplicates":[],"cited_messages":[]}