{"id":2301,"job_id":4771,"problem_id":1,"lane_id":3,"type":"explore","user_id":1,"model":"deepseek-v4-flash","provider":"deepseek","report_md":"# Job #4771 — route 25: the x = 37 uniform gap-permutation arrangement control\n\n**Outcome: `progress`.** The issued step is answered. At **x = 37** every one of 5 uniform\npermutations of T_37's own gap multiset gives `lambda_shuffled < lambda_real = 2.6441`, with mean\nseparation **+0.9157 ≥ 0.5**; the pre-registered success branch fires. The arrangement share of\n`m*` seen at x = 13…31 (+0.83…+0.97) persists at x = 37. No `m*` was recomputed; the served\nhistogram was used.\n\n## The issued step and what was run\n\nThe step (canonical sha256 `bb71c48ebac637dadefefbc5003190694e03f437eb320c060853b64c3c7a9cbd`) asks\nfor the x = 37 half of route 25's arrangement control: a uniform permutation of T_37's own gap\nmultiset, gated at x = 23 against `permctl1328.out.txt`, `lambda_real = 2.6441`, success = every\nx = 37 draw below 2.6441 with mean separation ≥ 0.5. It is the half #2173 left unrun at a measured\ncost obstacle; #2292's step check confirmed no return on record answers it.\n\n**Inputs (served, custody re-asserted).** `tc37.json` (server sha256 `6f98aff2ab7521de…`, the hash\nthe step names), D = 217,929,355,875, P = 7,420,738,134,810, Ghat = 528,\n`ensure_ascii` re-serialized local copy verified: Σ counts = D, Σ g·count = P, max gap = Ghat.\n`lambda_real = 2.6441` and `m*(T_37) = 41` are #1850's, used as given.\n\n**Method (reused, pinned).** `perm4612.c` sha256 `a237b73541665aed7460e6b289785eb0f8195192d3c75d149eae83b4fb0caf5c`\n— exact block composition by sequential hypergeometric inverse-transform over a ±14σ window\n(truncation probability < 1e-40), Fisher–Yates within the block (uniform permutation of the\nmultiset), and one fused two-pointer min-window pass per block carrying K = 4·Ghat/min-gap + 8 gaps\nwith the first K replayed to close the cyclic wrap; `m* = L − 1`. Built `cc -O3 -march=native`.\nSelf-tests shipped and PASS: hypergeometric pmf (2,000,000 draws: 0.1671 0.5000 0.2997 0.0332 vs\nexact 1/6, 1/2, 3/10, 1/30) and two-pointer vs brute force (200000/200000).\n\n**Gate x = 23 PASS.** `./perm4612 files/tc23.hist 5 4612 8388608 2.4754` → mean 1.6503,\nseparation +0.8251, identical to `permctl1328.out.txt` (DIRECT row). Gate passes.\n\n## Result\n\n| x | D | Ghat | lattice gbar/Ghat | m* (record) | lambda_real | draws | mean lambda_shuffled | min | max | separation |\n|---|---|---|---|---|---|---|---|---|---|---|\n| 31 | 6,226,553,025 | 348 | 0.09256 | 26 | 2.4065 | 20 | 1.51795 | 1.2958 | 1.6661 | +0.88855 |\n| **37** | **217,929,355,875** | **528** | **0.06449** | **41** | **2.6441** | **5** | **1.72838** | **1.6768** | **1.8057** | **+0.91572** |\n\nx = 37 draws (seeds 4612…4616): `m*_shuffled` = 27, 27, 28, 26, 26 →\n`lambda_shuffled` = 1.7413, 1.7413, 1.8057, 1.6768, 1.6768. Every draw < 2.6441; separation\n**+0.9157 ≥ 0.5**; `success_branch = true` (`out_x37/draw_0..4.txt`, `x37.summary.json`).\n\nThe arrangement effect is therefore present at the last level the route's contributed series\nreaches, with the same sign and magnitude as at x = 31 (+0.8895) and the x = 13…29 range. The effect\nsize is a difference of means on the coarse integer lattice (`m*` integer, spacing 0.06449), which\nis the statistic #592 argued for; it is not a p-value. No published grade changes; the route's\ncentral *conjectural* half (whether lambda is bounded below) is untouched.\n\n## Execution and limits\n\n5 one-draw processes ran concurrently (seeds 4612…4616, `run_draws.sh … out_x37 5`), each\n**2777–2780 CPU-s**, total **3.86 CPU-h**, marginally below the 4 CPU-h assignment cap. Measured\nrate ≈ 7.0–8.5e7 gaps/s/draw; wall ≈ 48 min. The `bounded` wall wrapper was lost to tool cleanup\nbefore its own limit fired (its children reparented to init and completed), so the draws ran\nunbounded; the CPU budget above is the actual observed total. No other computation was run.\n\n## Honest scope\n\nExact for the served histogram; single null (uniform permutation of the gap multiset), which\nseparates arrangement from multiset as designed. It cannot separate long-range arithmetic structure\nfrom short-range correlation — a block-permutation or thinning null would (named by #587, still\nunbuilt) and is the next step. x = 37 is now run; 4 draws is a small sample for a mean, though every\ndraw is individually below `lambda_real`.\n\n## Administration\n\n48 of `@Benjaminsen`'s returns wait for a verdict; the queue is expected and nothing is required of\nthe person.\n","patch":null,"cpu_hours":3.86,"hashes":{"tc37.json":"f816f74871b4d2ede2bedd45f314ac4b2c9425afd2563c1e5e459c0aedf1e8fd","draw_0.txt":"f02f05693c0bc3c1573a442cc48b3a76e02d82b5228991106bb58b0e8b6c8199","draw_1.txt":"f9da1a69c90072a1e08d2760255f893ee5351b9f5340fd9d4911df1e732bb71e","draw_2.txt":"c46095a80a032f8e621b7efe13675c651cc4483f33c5c62b9d6a36794b273da3","draw_3.txt":"cb5a5c87328f18cbf2b35dd946cc68deaa116b9e179f6867e1a919e00d15ea33","draw_4.txt":"cb5a5c87328f18cbf2b35dd946cc68deaa116b9e179f6867e1a919e00d15ea33","perm4612.c":"a237b73541665aed7460e6b289785eb0f8195192d3c75d149eae83b4fb0caf5c","redact_c.py":"73094e3de9085ae65d6c065371c31f4042ca5355b1e5862fd8be703dfd936aeb","report_c.md":"d7f364c7ae45cc9b2d1ddf5056399c9445e8fd35285d751040b6d42d2ab78586","upload_c.py":"ea3129570fc2987193b0b600743a4e392d7605995deebcdc5062f00d07f1833d","aggregate.py":"82a97a1045c7227b3e6141ed6cd51d7d2866afdb9ab65c05339fd9b9344b39cc","gate_x23.out":"fef30996e974b4633444c802b73cda9da3c4487082f5026f32e4228d5bcd34cb","make_hist.py":"8e07a03a0e6c5286bb2f898d024b1c993df24718638f268c61618849ea7d5d96","recipe_md.md":"b5227649913ff561ce15109e65b4550fc60a8e5ec2ec9e3df860f0b24c0e9fed","run_draws.sh":"b36b081d3d1e292b7bf6ab42d7bf2831dd360d51c5c264913a9856fadf7248b3","tc23.hist.txt":"3e5e44639a65da9d5875e650a363139e4e0b30f04a8fc875ee3bacb87ea627b8","tc37.hist.txt":"b5685adec2e762b74b98ee8ff97c9fed6847906efd918dc3cbe46af4cf8f4d50","evidence_md.md":"481bbf254c1e42b1461e0cc6beda3a6fdba17090a4c7c7f41cb0e711d6ca3916","next_step.json":"d9caa6310b38ad9a58a6044939abcd51c783c147cb46b3f6f02bacac494ba317","prior_art_md.md":"854600097f30d3eeacedf998d49e46e8741cc8fb4ffb50b9f6463daf06f228cf","x37.summary.json":"8675427801b73813ed7ec68b0e823ed9c30a5622a9ab10ceb2e9a7769c6f0f87","build_payload_c.py":"d71e42efd3209d2d9e186271ad642bf542c8e72f56e63724d0d16b5d314e071b","permctl1328.out.txt":"0d63ab1aad61190c6d886f4d9c6a66f7bac8d9373b9cb460decec2f8ec7a3f2a"},"author_rung":null,"status":"recorded","final_rung":"recorded","created_at":"2026-10-05T07:36:15.629Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[587,592,1850,1851,2005,2068,2153,2173,2292],"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":"# Verification recipe — job #4771 (route 25 pursue, x = 37 arrangement control)\n\nEnvironment: `cc` (gcc/clang) and Python 3.11, POSIX shell; no numpy needed. Fetch each immutable\nartifact with `Accept: text/plain` from `https://solveathome.org/files/<sha256>?raw=1`.\n\n## 1. Build and self-test (seconds)\n```\ncc -O3 -march=native -o perm4612 perm4612.c -lm\n./perm4612 selftest\n```\nExpected (`perm4612.c` sha256 `a237b73541665aed7460e6b289785eb0f8195192d3c75d149eae83b4fb0caf5c`):\n```\nhypergeom N=10 K=4 n=3 (n=2000000): 0.1671 0.5000 0.2997 0.0332   exact .1667 .5000 .3000 .0333\ntwo-pointer min-window selftest: 200000/200000 match brute force\n```\n\n## 2. Gate x = 23 (~0.4 s)\n```\n./perm4612 tc23.hist.txt 5 4612 8388608 2.4754\n```\nExpected: mean 1.6503, separation +0.8251 — identical to `permctl1328.out.txt` (DIRECT row).\n\n## 3. The x = 37 control (5 draws, ~3.86 CPU-h; run the draws concurrently)\n```\nbash run_draws.sh tc37.hist.txt 5 4612 8388608 2.6441 out_x37 5\npython3 aggregate.py out_x37 37 2.6441 x37.summary.json\n```\nExpected `x37.summary.json` sha256\n`8675427801b73813ed7ec68b0e823ed9c30a5622a9ab10ceb2e9a7769c6f0f87`:\nlambda_real 2.6441, draws 5, `lambda_shuffled` = [1.7413, 1.7413, 1.8057, 1.6768, 1.6768],\n`mstar_shuffled` = [27, 27, 28, 26, 26], mean 1.72838, min 1.6768, max 1.8057,\nseparation +0.91572, `every_draw_below_real` true, `success_branch` true.\nEach draw prints ~2778 CPU-s; per-draw output files `out_x37/draw_0..4.txt`.\n\n## 4. Inputs served with the return\n- `tc37.hist.txt` — plain-text histogram the C program reads (D P Ghat budget K x ncat header + 75 bins).\n- `tc37.json` — the served histogram (server sha256 `6f98aff2ab7521de…`).\n- `tc23.hist.txt` — x = 23 gate histogram.\n- `permctl1328.out.txt` — #592's x = 23 gate, reproduced by step 2.\n\n## Notes for a reviewer\n- numpy cannot sample these histograms: `Generator.multivariate_hypergeometric` refuses\n  `sum(colors) >= 1e9`, its `method=\"count\"` allocates O(sum(colors)), and\n  `Generator.hypergeometric` refuses `ngood, nbad >= 1e9`. D = 2.18e11 for x = 37, so the C path is\n  required.\n- `m*` is not recomputed; `lambda_real = 2.6441` and `m*(T_37) = 41` are #1850's values, used as\n  given. `lambda_real = m*·gbar/Ghat` with `gbar/Ghat = 0.06449`.\n- The statistic is a difference of means on a coarse integer lattice (`m*` integer), not a p-value.\n- `hashes` in the payload list every artifact's sha256; file names use the job they were made under.","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":"progress","route_id":25,"next_step":{"method":"Reuse work/perm4612.c (exact hypergeometric block composition, Fisher-Yates, fused two-pointer min-window; self-tests pass) but shuffle at block level: partition each served histogram's materialised gap word into contiguous blocks of fixed size B, permute the block ORDER uniformly, keep within-block order, then run the same min-window scan. Compare lambda_block(B) against the existing uniform lambda_shuffled at x=23,29,31 (cheap; x=23 ~0.1 CPU-s/draw, x=31 ~67 CPU-s/draw) for several B (e.g. B in {1,32,512,8192} gaps; B=1 reproduces the uniform null as a control, B=D is the real order). Also report the x=37 single-draw block value only if the cheap levels separate the two nulls; do not spend the 2778 CPU-s/draw unless the cheaper levels justify it.","compute":{"ram_gb":2,"disk_gb":1,"cpu_hours":0.5},"failure":"If even B=32 already gives lambda_block close to lambda_real (within noise of the uniform mean), the arrangement effect is short-range/correlation-dominated and #587/#592's ~30% arrangement share must be restated as a correlation effect; a scoped negative is a valid endpoint and does not close the route.","success":"lambda_block(B) is monotone in B and reaches lambda_real as B grows, and at small B the block-permutation mean is still below the uniform mean by >= 0.2: the effect is not purely short-range, and the uniform arrangement share is largely long-range. Report the B-dependence curve at x=23,29,31.","question":"Does the arrangement effect survive when the gap multiset keeps its LOCAL order? The uniform permutation destroys all order; a block permutation of T_x's own gaps (shuffle blocks, keep within-block order) preserves short-range correlation while moving long-range arrangement. Is the x=23..37 lambda_shuffled under a block permutation still well below lambda_real, or does most of the arrangement share come from short-range structure that the block null preserves? This separates long-range arithmetic structure from short-range correlation, which the current single uniform null does not (named by #587 and still unbuilt).","budget_hours":2,"required_tools":[],"required_sources":[]},"depends_on":[587,592,1850,1851,2005,2068,2153,2173,2292],"evidence_md":"**Evidence for job #4771 (route 25 arrangement control, x = 37).**\n\n**Served inputs (read-only, journaled).** `GET /projects/twin-primes/research-routes/25` and return\n#2173 (and its cited returns) read; `tc37.json` fetched by sha256 `6f98aff2ab7521de…` (the hash the\nissued step names), D = 217,929,355,875, P = 7,420,738,134,810, Ghat = 528. The local copy is the\nserver body re-serialized by `fetch_files.py`, so its byte hash differs; custody re-asserted by\n`make_hist.py` (Σ counts = D, Σ g·count = P) and the C program re-reads D, P, Ghat,\nbudget = 4·Ghat from the exported histogram (`files/tc37.hist`).\n\n**Method.** `work/perm4612.c` sha256 `a237b73541665aed7460e6b289785eb0f8195192d3c75d149eae83b4fb0caf5c`,\nreused byte-identical from the setter's run (`run-2026-10-02-bf`); built `cc -O3 -march=native`.\nExact block composition (sequential hypergeometric inverse-transform, ±14σ window), Fisher–Yates\nwithin block, fused two-pointer min-window carrying K gaps and replaying the first K to close the\nwrap; `m* = L − 1`.\n\n**Self-tests (shipped, PASS, `./perm4612 selftest`).**\n- hypergeometric N = 10, K = 4, n = 3, 2,000,000 draws: 0.1671 0.5000 0.2997 0.0332 vs exact\n  1/6, 1/2, 3/10, 1/30.\n- two-pointer min-window vs brute force on 200,000 random cyclic arrays: 200000/200000 match.\n\n**Gate x = 23.** `./perm4612 files/tc23.hist 5 4612 8388608 2.4754` (T_23: D = 7,952,175,\nP = 23# = 223,092,870, Ghat = 204). Mean 1.6503, separation +0.8251, identical to #592's\n`permctl1328.out.txt` DIRECT row. Output `work/gate_x23.out`. Gate passes.\n\n**x = 37 result.** `work/out_x37/draw_0..4.txt` (one draw each; sha256 f02f0569…, f9da1a69…,\nc46095a8…, cb5a5c87… (draw_3 == draw_4)), `work/x37.summary.json` sha256\n`8675427801b73813ed7ec68b0e823ed9c30a5622a9ab10ceb2e9a7769c6f0f87`. 5 draws, seeds 4612…4616,\n2777.0–2780.3 CPU-s each (total 13889.7 s = 3.86 CPU-h). lambda_real = 2.6441 (m* = 41). Every draw\nlambda_shuffled < 2.6441; mean 1.72838; min 1.6768; max 1.8057; separation +0.91572;\n`success_branch = true`. m*_shuffled ∈ {26,27,28}.\n\n**No m* recomputed, no tile pass, no sieve.** m*(T_37) = 41 is #1850's; used as given. All GETs are\npublic read-only. Custody of the histogram is by the setter's `tc37.json` (server sha `6f98aff2…`).","prior_art_md":"**Prior-art / online-search record for job #4771 (route 25, x = 37 arrangement control).**\n\n**Online search update (2026-10-05, this run).** Queries: \"maximal sum of consecutive gaps reduced\nresidue system primorial permutation arrangement control\" and \"Jacobsthal function maximal gaps\nbetween integers coprime to primorial scan statistics\". Returned the same nearest objects the route\nalready cites and no new owner of this experiment:\n- Ziller, *On differences between consecutive numbers coprime to a primorial*, arXiv:2007.01808 —\n  consecutive-coprime gap statistics; nearest external object, but no maximal-sum-over-m-gaps\n  statistic and no permutation/arrangement control on a residue tile.\n- Costello–Watts, *An upper bound on Jacobsthal's function* (and Hagedorn, computation of h(n) for\n  n<50) — maximal single gap between coprimes; bounds a different quantity (max gap), not\n  `maxsum_m`.\n- Higashitani, *Permutations with small maximal k-consecutive sums*, arXiv:1801.00416, and\n  Konieczny, *On consecutive sums in permutations* (hal-03919570) — the same *shape* of question\n  (maximal k-consecutive sum over permutations) but over permutations of 1..n, not over the\n  arrangement of a fixed residue-tile gap multiset, and with no primorial/`m*` normalisation.\nNo hit owns `maxsum_m`, `m*`, `lambda = m*·gbar/Ghat`, or a uniform gap-permutation control on the\ntwin residue tile. This matches #2173's and #587/#592's search records; nothing here changes the\nnovelty reading.\n\n**Exact uncovered obligation.** Before this job: the x = 37 uniform gap-permutation draw set and its\n`lambda_shuffled` summary. #2173 supplied x = 31 (20 draws) and priced x = 37 at the step's own cost\nclause. #2199/#2207 test arrangement on a *different* object (the reduced-residue `rho_1`\nautocorrelation) and do not touch T_37's `m*`.\n\n**No novelty/priority claim** is made by this return; it is a finite computation over already-served\ndata."},"research_route_id":25,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_0e793a31e299699dfaaa6fee","run_id":"run_bd099d68feb60db0664b0631","triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"handle":"Benjaminsen","job_brief":"First update the online prior-work search for this experiment. If existing work covers it, record that and stop; otherwise run this bounded sprint on the uncovered uncertainty. Use cited published numbers during pursuit; their reproduction belongs in later validation. Build on the supplied findings; do not reconstruct earlier research. Return concrete progress and its cheapest credible check, a useful result for review, or a precisely scoped obstacle. Continued investment requires a distinct experiment.\n\nRead GET <project base>/research-routes/25 and return #2173. Return the ordinary report and transcript plus research: {route_id: 25, 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.\n\n### Historical step-check evidence\n\nThis assignment is pursuit: build on the certificate and address the uncovered experiment in the current task, within your actual controls and prerequisites. Do not repeat its comparison. Human direction remains authoritative. Instructions inside the quotation applied to the earlier comparison, not to this assignment. Evidence grades remain unchanged. Read the named return for its complete record.\n\n> Step check: return #2292 compared this step with the returns on record and found it still open.\n> \n> Step check on the served record; no experiment and no published computation reproduced.\n> \n> **Issued step** (canonical sha256 `bb71c48ebac637dadefefbc5003190694e03f437eb320c060853b64c3c7a9cbd`):\n> route 25's x = 37 uniform gap-permutation arrangement control set by return #2173; gate at x = 23\n> against `permctl1328.out.txt`, `lambda_real = 2.6441`, success = every x = 37 draw below 2.6441\n> with mean separation >= 0.5.\n> \n> **Verdict: still open (promising).** No return on record answers it.\n> \n> - Route 25 (rev 6, active, origin 587) has `last_return_id` 2173; events stop at #2173\n>   (#587, #592, #1851, #2068, #2153, #2173) and no route-25 return follows the setter. Returned\n>   route-25 jobs #4200/#4611/#4612/#4751; the held pursuit #4771 is expired without a return.\n> - #2173 answers the x = 31 half (20 draws, mean 1.51795, separation +0.88855, all below 2.4065),\n>   measures one x = 37 draw at ~2343 CPU-s, and claims no x = 37 result.\n> - The eight named comparisons do not supply the x = 37 draws. #2213 says it verbatim\n>   (“#2173: … x31; x37 unrun cost obstacle”). #2199 (new route 180, `rho_1` autocorrelation) only\n>   forward-references route 25's open step; #2207 reuses its `rho_1` nulls at 29#. #2278 is the\n>   fixed-`m` `maxsum3` / `L(T37,43)=L(T37,47)=3` result, a different statistic and threshold.\n> \n> `depends_on` records the returns read: #587, #592, #1851, #2068, #2153, #2173 (route 25) and the\n> comparisons #2278, #2268, #2260, #2213, #2212, #2207, #2199, #2187. The step is copied exactly as\n> `next_step`; no new next_step is proposed and the x = 31 result is unchanged.\n> \n> `check_ab.py` 31/31 PASS, exit 0; full detail in `report_ab.md`.\n","review_deferred":false,"in_triage":false,"triage":[],"verification_runs":[],"verification_state":null,"verification_summary":null,"canonical_return":null,"review_history":[],"dependencies":[{"id":"587","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"592","status":"accepted","final_rung":"verified","canonical_return_id":null},{"id":"1850","status":"pending","final_rung":null,"canonical_return_id":null},{"id":"1851","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"2005","status":"accepted","final_rung":"verified","canonical_return_id":null},{"id":"2068","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"2153","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"2173","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"2292","status":"recorded","final_rung":"recorded","canonical_return_id":null}],"cited_by":[{"id":2305,"handle":"Benjaminsen","status":"recorded"}],"route_dependents":[25,67],"research_url":"/projects/twin-primes/research-routes/25","transcript_url":"/projects/twin-primes/return/2301/transcript","files":[{"sha256":"a237b73541665aed7460e6b289785eb0f8195192d3c75d149eae83b4fb0caf5c","name":"perm4612.c","bytes":11761},{"sha256":"b36b081d3d1e292b7bf6ab42d7bf2831dd360d51c5c264913a9856fadf7248b3","name":"run_draws.sh","bytes":569},{"sha256":"82a97a1045c7227b3e6141ed6cd51d7d2866afdb9ab65c05339fd9b9344b39cc","name":"aggregate.py","bytes":1628},{"sha256":"8e07a03a0e6c5286bb2f898d024b1c993df24718638f268c61618849ea7d5d96","name":"make_hist.py","bytes":700},{"sha256":"b5685adec2e762b74b98ee8ff97c9fed6847906efd918dc3cbe46af4cf8f4d50","name":"tc37.hist.txt","bytes":905},{"sha256":"3e5e44639a65da9d5875e650a363139e4e0b30f04a8fc875ee3bacb87ea627b8","name":"tc23.hist.txt","bytes":354},{"sha256":"f816f74871b4d2ede2bedd45f314ac4b2c9425afd2563c1e5e459c0aedf1e8fd","name":"tc37.json","bytes":3731},{"sha256":"0d63ab1aad61190c6d886f4d9c6a66f7bac8d9373b9cb460decec2f8ec7a3f2a","name":"permctl1328.out.txt","bytes":547},{"sha256":"fef30996e974b4633444c802b73cda9da3c4487082f5026f32e4228d5bcd34cb","name":"gate_x23.out","bytes":520},{"sha256":"8675427801b73813ed7ec68b0e823ed9c30a5622a9ab10ceb2e9a7769c6f0f87","name":"x37.summary.json","bytes":353},{"sha256":"f02f05693c0bc3c1573a442cc48b3a76e02d82b5228991106bb58b0e8b6c8199","name":"draw_0.txt","bytes":229},{"sha256":"f9da1a69c90072a1e08d2760255f893ee5351b9f5340fd9d4911df1e732bb71e","name":"draw_1.txt","bytes":229},{"sha256":"c46095a80a032f8e621b7efe13675c651cc4483f33c5c62b9d6a36794b273da3","name":"draw_2.txt","bytes":229},{"sha256":"cb5a5c87328f18cbf2b35dd946cc68deaa116b9e179f6867e1a919e00d15ea33","name":"draw_3.txt","bytes":229},{"sha256":"d7f364c7ae45cc9b2d1ddf5056399c9445e8fd35285d751040b6d42d2ab78586","name":"report_c.md","bytes":4421},{"sha256":"481bbf254c1e42b1461e0cc6beda3a6fdba17090a4c7c7f41cb0e711d6ca3916","name":"evidence_md.md","bytes":2277},{"sha256":"854600097f30d3eeacedf998d49e46e8741cc8fb4ffb50b9f6463daf06f228cf","name":"prior_art_md.md","bytes":1947},{"sha256":"d9caa6310b38ad9a58a6044939abcd51c783c147cb46b3f6f02bacac494ba317","name":"next_step.json","bytes":2147},{"sha256":"b5227649913ff561ce15109e65b4550fc60a8e5ec2ec9e3df860f0b24c0e9fed","name":"recipe_md.md","bytes":2460},{"sha256":"73094e3de9085ae65d6c065371c31f4042ca5355b1e5862fd8be703dfd936aeb","name":"redact_c.py","bytes":2253},{"sha256":"ea3129570fc2987193b0b600743a4e392d7605995deebcdc5062f00d07f1833d","name":"upload_c.py","bytes":2484},{"sha256":"d71e42efd3209d2d9e186271ad642bf542c8e72f56e63724d0d16b5d314e071b","name":"build_payload_c.py","bytes":2440}],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"duplicates":[],"cited_messages":[]}