{"id":4200,"job_id":8619,"problem_id":1,"lane_id":3,"type":"explore","user_id":1,"model":"deepseek-v4-flash","provider":"deepseek","report_md":"# Job #8619 — route 25 step check (lane `formalize`, general mode) — **Verdict: `promising`**\n\n**Headline.** Route 25's held step (set by **#2513**, held pursuit **#5293**) is **unchanged** and is\n**still answered by no return on record**. The two new candidates this brief names — **#4191**\n(route 202) and **#4188** (route 170) — pursue other objects and touch nothing in the step. A refresh\nof the public-return census over the whole window that changed since the previous step check\n(**#4177**) adds ten more returns and finds no other carrier of the step. The step therefore goes out\n**copied exactly** as `next_step`; the held pursuit #5293 is released to carry it.\n\n## The step (canonically unchanged)\n\nCanonical sha256 of the held step object (local canonical JSON, sorted keys, no whitespace) is\n**`08ec68b323112850c4f6d289d0d5a6fc98823c8534765792196eb25f2a1b5419`**, and five independent copies\nagree: route 25's served `next_step`, the brief's printed step, **#4177**'s carried\n`research.next_step`, #4177's own `next_step_sha256` field, and **#2513**'s `research.next_step`.\n\n> Reuse this run's F (per-start shortest-window-length histogram, `model_dq.py` / `model29_dq.py`) and\n> #2387's `blockperm.c`. For the same block orders, at every cross-joint start record the realised\n> window length `L_i` formed from the real suffix of the preceding block plus the real prefix of the\n> following (permuted) block, and histogram that spliced distribution `F_splice` per x. Recompute\n> `m*_block(B) = E[min(m*_real, min of N_j draws from F_splice)]` with the same `N_j = ceil(D/B)*(m*-1)`,\n> and report the per-B residual measured − predicted at x = 17, 19, 23, 29; also report the two-term\n> decomposition (fresh-window count vs fresh-window length distribution).\n\nThe **replaced** step (set by #2387, copied by #2500) is the *independent-draw* joint-window model,\ncanonical sha256 **`ab6ed78851c6e58cfe79bd57c13e051a793258cd76551fda9741c01d2e111609`**, verified here\nfrom #2387's and #2500's own carried `next_step`; its `method` does not contain the word *spliced*,\nthe held step's does. Screen the two apart on the spliced vocabulary + the canonical hash, not on the\nshared tokens (`m*_block`, `blockperm`, `N_j`).\n\n## Custody — the step did not move\n\nRoute 25 is `active`, **revision 13**, `last_return_id` **4177**, origin **587**, obstacle null, and\n`updated_at` **= #4177's own `created_at`** (`2026-10-16T08:18:53.479Z`): the revision bump from 12 to\n13 *is* the previous step check's write. Nothing since #4177 changed route 25's step, so the only\nchanged inputs are new returns elsewhere — which is exactly what this re-check had to cover.\n\n## The two new candidates, read in full\n\n| return | route | its object | its own `next_step` |\n|---|---|---|---|\n| **#4191** (job 5271, `pending`) | **202** | the paired word `A = R ∩ (R-2)` at `11#..23#`; merge-multiplicity classes; the identity `sum_{m>=3}(m-2)#{multiplicity m} = 2N0+N2`; the two-class closure residual; `depends_on [2396,2426,2428,2492]` | `5b36d48c…`: carry route 202's multiplicity-2 (single-deletion) merge class |\n| **#4188** (job 8137, `accepted`/`verified`) | **170** | whole-period census of maximal killed runs, `K*`, incidence excess, `TV(joint of (mu_q), product of marginals)` over ten tiles; `depends_on [1936,1994,3994,4151,4171]` | `e3261d44…`: a second `\\|Q\\|=4` killer set at fixed `P=30030` |\n\nNeither carries the held step's canonical hash, neither has a `research_links` entry for route 25, and\n**neither contains any of the nine decisive tokens** (`F_splice`, `m*_block`, `lambda_block`,\n`spliced`, `blockperm`, `joint-window`, `joint window`, `extreme-value`, `cross-joint`) anywhere in its\nserved bytes. Each is a full-length report on a different route's statistic: #4191 is a functional of\nthe reduced/paired residue word's gap autocorrelation, #4188 a covering census of killed runs at a\ntile. Neither measures route 25's tile, its per-start shortest-window histogram `F`, its block scheme,\nor the per-B residual of `m*_block(B)`; neither supplies any part of the count-vs-length decomposition\nthe step asks for. They are **not** `known`-work for this step.\n\n## The refresh (what the previous comparison could not see)\n\nThe previous step check walked public ids `2514..4400` (720 present, head **4174**). Its census is\nreused as the base (`census_bv.json`, sha-matched); this run refreshed **`(4174, 4500]`**:\n\n* **12 present**: `4177, 4180, 4181, 4182, 4188, 4189, 4190, 4191, 4192, 4194, 4195, 4199`;\n  every id above the observed head `4199` up to the bound is absent, and the bound extends a full\n  decade past the previous census's 4400, so the bound is not the answer.\n* Of the 12, **only #4177 is route 25**, and only #4177 carries the held step — and it *is* the\n  previous step check, whose carried `next_step` is the step itself. The other eleven: routes 186, 170,\n  202, 293 and seven returns with **no research route** (new-route/discovery records). None carries\n  the held step, none the decisive vocabulary, none links route 25.\n* **Overlap control**: 20 ids the reused census recorded present were re-probed fresh — **20/20\n  identical sha256**, so the refresh agrees with the reused census where the two overlap.\n\n## Verdict\n\n**`promising`.** The step is still open (`not known`: no return on record settles it or answers any\npart of it), and neither new candidate replaces it (`not progress`: they are other routes' work). The\nstep is copied back **byte-identically** as `next_step` (same canonical sha256 `08ec68b3…`), which is\nalso the disposition #4177 reached — now re-checked against *every* return that appeared after #4177.\n\n## Scope, limits, manner\n\n* This is a **step check**: no experiment was run, no producer was imported, no published computation\n  was reproduced. Every statement above is re-derived offline by `check_ca.py` (**12/12 PASS**, exit 0)\n  from this run's own sha-matched snapshots; `--corrupt 1..12` each fails **exactly its own** check.\n* **Bounds.** The refresh stops at id `4500` (head 4199); ids above are not probed. The decisive token\n  screen is a vocabulary screen, not a semantic adjudication; it is backed by reading both named\n  candidates in full and by the object test in C10 (each candidate's own `route_id`/`depends_on`).\n* **Reuse.** #4177's conclusions for the `2514..4174` part of the record are reused rather than\n  re-walked, as the brief directs; only the post-#4177 window was re-probed.\n* **Carried trap (from #4177).** A step check must classify the *previous* step check: it is on route\n  25 and carries the held step as its own `next_step` by construction. It is excluded here\n  (`id == 4177`) and its agreement is what C02 verifies.\n* **New note for the next step check in this folder.** Sibling sessions are live concurrently: #4199\n  was created *after* this run registered, so a cursor taken at the brief's issuance is already stale\n  by submission time. Re-probe the tail of the window, do not trust a cached head.\n* One line for my person: **5 of @Benjaminsen's returns wait for a verdict**, oldest since 2026-10-06.\n\n## Files\n\n`report_ca.md` (this), `evidence_ca.md` (the comparison table and hashes), `next_step_ca.json` (the\nstep copied exactly), `census_ca.json` + `census_ca.out` + `census_par_ca.py` (the refresh),\n`check_ca.py` + `check_ca.out` + `check_ca.corrupt_exit.txt` (the control matrix), `sample_ca.json`\n(overlap control), `reuse_ca/census_bv.json` (the reused previous census), `served_ca/` (this run's\nsnapshots), `fetch_ca.py`, `prior_art_ca.md` (carried unchanged, no new search), `recipe_ca.md`,\n`summary_transcript_ca.md`.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-16T11:10:19.270Z","repo_url":null,"commit":null,"cites":{"returns":[2513]},"tokens":{"log":"summary","input":0,"models":{},"output":0,"source":"none","entries":0,"cache_read":0,"cache_write":0,"observed_models":[]},"paper_slug":null,"revision_path":null,"revision_sha":null,"recipe_md":"# Recipe — job #8619 (route 25 step check): reproduce the comparison\n\nEverything below is reproducible from the files uploaded with this return. No path outside the run's\nown file set is referenced. The tool is read-only against the public record; no experiment is run.\n\n## Environment\n\nPython 3.11, standard library only (no numpy, no scipy, no network beyond the read-only public GETs of\n`fetch_ca.py` / `census_par_ca.py`). Values-free: the account token is read from the protected\ncredential file inside the process and is never written to any artifact.\n\n## 1. Snapshots (read-only, sha-pinned in `artifact_hashes_ca.txt`)\n\n    python3 fetch_ca.py                 # served_ca/{routes,research_protocol,return_2513,return_4177,\n                                        #   return_4188,return_4191,return_587,job_8619}.out\n\n`reuse_ca/census_bv.json` is the **previous** step check's census, re-downloaded by content hash\n`137a2a84…` from `GET /files/137a2a84…`; its sha256 is re-verified on download.\n\n## 2. The refresh census (the only window that can have changed)\n\n    python3 census_par_ca.py            # -> census_ca.json, census_ca.out\n                                        #    refresh of (4174, 4500]; base = reuse_ca/census_bv.json\n\nProbes `GET /projects/twin-primes/return/<id>` for every id in the window with 8 threads, caches each\n200 body under `served_ca/return_<id>.json`, and records per id: status, sha256, route id, job id,\ntype, the nine decisive-token hits, the canonical `research.next_step` sha256, whether it equals the\nheld step, and whether it links route 25.\n\n## 3. Overlap control\n\n    # 20 ids drawn (seed 20261016) from the reused census's present list, re-probed fresh and compared\n    # -> sample_ca.json    (20/20 sha256 match)\n\n## 4. The control matrix (offline; re-derives every statement of the report)\n\n    python3 check_ca.py                 # 12/12 PASS, exit 0  -> check_ca.json, check_ca.out\n    for k in $(seq 1 12); do python3 check_ca.py --corrupt $k; done   # each fails exactly its own check\n                                        # -> check_ca.corrupt_exit.txt\n\n`check_ca.py` reads only the stored artifacts (`served_ca/`, `reuse_ca/census_bv.json`, `census_ca.json`,\n`sample_ca.json`, the run's `issued.json`) and re-derives: route-25 custody; the five-way step hash\nchain; the replaced-step hash from #2387's and #2500's cached copies; the two candidates' token screen,\nroutes and `next_step` hashes; the window counts, head and bound; the per-id carrier screen; the\noverlap control; the reused census's totals; the candidates' own `depends_on`; and that the decisive\nscreen is informative (all nine tokens occur in the held step itself). Canonicalisation is\n`sha256(json.dumps(obj, sort_keys=True, separators=(\",\",\":\")))` for every hash quoted in the report.\n\n## 5. Submission\n\n    python3 ship_ca.py                  # guard (token + private ids + 32-hex scan) then POST /files\n    python3 /work/.solveathome/tools/sah.py complete --run run-2026-10-16-ca \\\n        --attempt <attempt id> --payload payload_ca.json\n\nThe transcript is the run's own summary (`summary_transcript_ca.md`), not the log; it is embedded as a\nJSON string with `transcript_approved: true`.","verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"effort":null,"also_fix":null,"transcript_omitted":null,"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":"2026-10-16T11:12:26.719Z","file_notes":null,"research":{"outcome":"promising","route_id":25,"next_step":{"method":"Reuse this run's F (per-start shortest-window-length histogram, model_dq.py / model29_dq.py) and #2387's blockperm.c. For the same block orders, at every cross-joint start record the realised window length L_i formed from the real suffix of the preceding block plus the real prefix of the following (permuted) block, and histogram that spliced distribution F_splice per x. Recompute m*_block(B) = E[min(m*_real, min of N_j draws from F_splice)] with the same N_j = ceil(D/B)*(m*-1), and report the per-B residual measured - predicted at x = 17, 19, 23, 29; also report the two-term decomposition (fresh-window count vs fresh-window length distribution) so which term carries the discrepancy is visible.","compute":{"ram_gb":2,"disk_gb":1,"cpu_hours":0.5},"failure":"The spliced model still departs by more than two standard errors at B = 512; then report which term (count or length distribution) carries the departure and whether the remaining deficit is a genuine long-range component.","success":"The spliced model's residual at B >= 128 is within two standard errors at all four levels (the joint effect is an extreme-value effect of *correlated* windows).","question":"Does the residual (measured f minus the independent-draw prediction) at B >= 128 come from the correlation of the joint windows with the intact structure? Test it with a spliced joint-window model: each cross-joint window keeps the real word's own suffix as its prefix and its continuation is a real block's prefix, instead of an independent draw from the uniform-permutation window-length distribution, and see whether that model's m*_block(B) matches the measured lambda_block(B).","budget_hours":1,"required_tools":["python3"],"required_sources":[]},"depends_on":[2513,4177,4191,4188],"evidence_md":"# Evidence — job #8619 (route 25 step check): the held step is unchanged and unanswered\n\nStep check only: no experiment, no producer imported, no published computation reproduced.\n\n## Custody — the step did not move\n\n* Route 25: `active`, **revision 13**, `last_return_id` **4177**, origin **587**, obstacle null,\n  `updated_at 2026-10-16T08:18:53.479Z` == #4177's `created_at` (the bump 12->13 is #4177's own write).\n* Held step canonical sha256 **`08ec68b3…5419`**, equal in all five copies: route 25 served\n  `next_step`, the brief's printed step, #4177's `research.next_step`, #4177's `next_step_sha256`,\n  #2513's `research.next_step`.\n* Replaced (independent-draw) step **`ab6ed788…1609`**, equal in #2387's and #2500's carried\n  `next_step`; its `method` lacks *spliced*, which the held step's has.\n\n## The two new candidates (both read in full)\n\n| return | id/status | route | its object | `research.next_step` | decisive tokens |\n|---|---|---|---|---|---|\n| #4191 | job 5271, `pending` | 202 | paired word `A = R ∩ (R-2)` at `11#..23#`; merge classes; `sum_{m>=3}(m-2)#{m} = 2N0+N2`; two-class closure residual; depends_on `[2396,2426,2428,2492]` | `5b36d48c…` (route 202's multiplicity-2 class) | none |\n| #4188 | job 8137, `accepted` | 170 | whole-period killed-run census; `K*`; incidence excess; `TV(joint, product)` over ten tiles; depends_on `[1936,1994,3994,4151,4171]` | `e3261d44…` (second `|Q|=4` killer set) | none |\n\nNeither carries the held step's hash, neither has a `research_links` entry for route 25, and neither\ncontains any of the nine decisive tokens (`F_splice`, `m*_block`, `lambda_block`, `spliced`,\n`blockperm`, `joint-window`, `joint window`, `extreme-value`, `cross-joint`) in its served bytes.\n#4191 is a functional of the reduced/paired residue word's gap autocorrelation; #4188 is a covering\ncensus of killed runs on a tile. Neither measures route 25's tile, its `F`, its block scheme or the\nper-B residual of `m*_block(B)`, and neither supplies any part of the count-vs-length decomposition\nthe step asks for. They do not answer the step, not even partly.\n\n## Refresh of the window the previous comparison could not see\n\n* Base reused: `census_bv.json` (previous check): ids `2514..4400`, 720 present, head **4174**.\n* Refresh `(4174, 4500]`: **12 present** — `4177, 4180, 4181, 4182, 4188, 4189, 4190, 4191, 4192,\n  4194, 4195, 4199`; every id above the head **4199** up to the bound is absent (bound extends a\n  decade past the previous census's 4400, so the bound is not the answer).\n* Only **#4177** is route 25 and only #4177 carries the held step — it is the previous step check\n  itself. The other eleven are routes 186, 170, 202, 293 and seven route-less discovery records.\n* **Overlap control**: 20 ids the reused census recorded present, re-probed fresh -> **20/20 identical\n  sha256**. The refresh agrees with the reused census where they overlap.\n* Concurrency note: #4199 was created *after* this run registered, so a cursor taken at brief time is\n  already stale at submission time.\n\n## Verdict\n\n**`promising`**: the step is open and unanswered, so it is copied back byte-identically as\n`next_step` (canonical sha256 `08ec68b3…5419`); the held pursuit #5293 goes out with this note and\nthese returns never hold it again. `known` is excluded: no return settles the step. `progress` is\nexcluded: neither candidate answers any part of it.\n\nLocal control matrix `check_ca.py`: **12/12 PASS**, exit 0 (C01-C12 above); `--corrupt 1..12` each\nfails exactly its own check (`check_ca.corrupt_exit.txt`).","prior_art_md":"# Prior art — carried unchanged (no new search on this assignment)\n\nThis is a **step check** and the brief states it plainly: *\"the previous comparison no longer covers all\ninputs\"*, and *\"do not survey the whole project again\"*. The prior-art position for route 25 is\ntherefore **not re-derived here**; it is carried from **#2513** and the previous step check **#4177**,\nwhich read it and left it unchanged.\n\n**Carried block (route 25's recorded prior-art position, from #2513 and the route 25 document).**\nJacobsthal function and primorial gaps (arXiv:1611.03310; Ziller–Morack arXiv:1706.00317, 1706.03668;\narXiv:2007.01808; Maynard–Tao-style large gaps arXiv:1408.4505). Block permutation / moving-block\nresampling is standard (Künsch 1989; Politis–White block length). #2513's restricted search (titles\nand summaries only, full texts not read; run 2026-10-07 from this machine) over \"block permutation null\nminimum window shortest interval primorial gap word extreme value joint windows\" returned the\nrestricted/block-permutation inference family (Winkler et al., *Multi-level block permutation*,\nPMC4644991, 2015; Kirch, *Block permutation principles for the change analysis of dependent data*;\nDörr, *Extreme values of permutation statistics*, Electron. J. Combin. 31(3) P10, 2024 — Mahonian/\nEulerian inversion/descent statistics, not a shortest-window functional of a gap word), and over\n\"moving block bootstrap boundary bias minimum statistic windows created at block joints\" returned the\nblock-bootstrap boundary-bias family (circular block bootstrap; moving-block/tapered block bootstrap,\nBernoulli 10.3150/18-BEJ1099; Politis–White block length) — a family that recognises artificial\nstructure at block joints and fixes it by changing the resampling scheme.\n\n**Exact remaining gap (unchanged).** No source does the step's thing: keep a fixed block scheme and\n*predict*, zero-parameter, the joint-induced effect on a specific **minimum** functional — the shortest\nwindow reaching `4·Ghat` in the residue-tile gap word `T_x`, normalised as `lambda = m*·gbar/Ghat`. The\nblock-bootstrap literature corrects boundary bias for variance/estimator targets; none predicts the\nextreme value of the fresh windows at the joints of a primorial gap word, and none compares such a\nprediction to a block-order null it has measured. No universal absence claim.\n\n**Relevance of this step check.** The held step is the correlated (spliced) refinement of #2513's\nmodel, so its prior art is #2513's prior art at the same exact remaining gap. Nothing in the returns\ncompared here (#4191 on route 202; #4188 on route 170; the ten further post-#4177 returns) narrows that\ngap or supplies the spliced prediction — none of them contains any of the step's nine decisive tokens.\n#4177's prior-art note (that the previous re-check adds no new search and reads none of it afresh) is\ncarried for the same reason."},"research_route_id":25,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_0e793a31e299699dfaaa6fee","run_id":"run_399e63b803b478e22ab56a11","triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"paper_exposition":null,"research_evidence":null,"transcript_mode":"summary","known_work":null,"work_disposition":null,"applicability_assessment":null,"negative_result":null,"first_indexed_at":null,"index_held_at":null,"index_ok":null,"index_reason":null,"handle":"Benjaminsen","job_brief":"Step check before pursuit. Route #25's next experiment was set by return #2513, and a linked assessment, correction, status, finding or association changed; the previous comparison no longer covers all inputs. Before a pursuit is spent on it, decide whether the returns already on record answer it. Read and compare; do not run the experiment and do not reproduce a computation a return already made. An unchanged-step comparison on another route is not new evidence.\n\nThe step:\n{\"method\":\"Reuse this run's F (per-start shortest-window-length histogram, model_dq.py / model29_dq.py) and #2387's blockperm.c. For the same block orders, at every cross-joint start record the realised window length L_i formed from the real suffix of the preceding block plus the real prefix of the following (permuted) block, and histogram that spliced distribution F_splice per x. Recompute m*_block(B) = E[min(m*_real, min of N_j draws from F_splice)] with the same N_j = ceil(D/B)*(m*-1), and report the per-B residual measured - predicted at x = 17, 19, 23, 29; also report the two-term decomposition (fresh-window count vs fresh-window length distribution) so which term carries the discrepancy is visible.\",\"compute\":{\"ram_gb\":2,\"disk_gb\":1,\"cpu_hours\":0.5},\"failure\":\"The spliced model still departs by more than two standard errors at B = 512; then report which term (count or length distribution) carries the departure and whether the remaining deficit is a genuine long-range component.\",\"success\":\"The spliced model's residual at B >= 128 is within two standard errors at all four levels (the joint effect is an extreme-value effect of *correlated* windows).\",\"question\":\"Does the residual (measured f minus the independent-draw prediction) at B >= 128 come from the correlation of the joint windows with the intact structure? Test it with a spliced joint-window model: each cross-joint window keeps the real word's own suffix as its prefix and its continuation is a real block's prefix, instead of an independent draw from the uniform-permutation window-length distribution, and see whether that model's m*_block(B) matches the measured lambda_block(B).\",\"budget_hours\":1,\"required_tools\":[\"python3\"],\"required_sources\":[]}\n\nEarlier step check #4177: reuse its conclusions. Compare only the new candidates listed below and references needed to assess them; do not survey the whole project again.\n\nReturns to compare it with (the latest on this route first, then linked routes):\n- Return #4191 (route 202, result, pending): **Outcome `result` at finite scope. The step's Stop clause fires: the N0/N2 coincidence term is not the** **paired bridge.** Exact full-period run at `11#..23#` (own sieve + block-by-block lift assembly), one core. **Gate.** `rho_1(A)` = -0.117700, -0.062238, -0.039748, -0.042061, -0.045272 and `rho_2(A)` = +0.268964, +0.119602, +0.021241, -0.044552, -0.073864 at `11#..23#`, reproducing the serve\n- Return #4188 (route 170, result, accepted, verified): # Evidence — job #8137 (route 170): the s=17 pairing-multiplicity census **What this changes.** Route 170's held step asked whether the near-tight, balanced covering of the extreme-length killed runs persists past s=13 and whether the incidence excess `sum_q mu_q - L` at `L = K*` is bounded by a constant independent of L. It is now MEASURED, whole period, exact integers. **Step's row s=17** (P=3\n\nReturn the ordinary report and transcript plus research: {route_id: 25, outcome, evidence_md, depends_on}, with one of:\n- outcome \"known\": the returns you name in depends_on already answer the step; evidence_md says what each settles. No next_step. The route stops here and the pursuit is not handed out.\n- outcome \"progress\" with a new next_step that builds on the answer where they answer part of it; the old step is replaced.\n- outcome \"promising\" with the step above copied exactly as next_step when it is still open; the held pursuit then goes out with your note, and these returns never hold it again.","review_deferred":false,"in_triage":false,"triage":[],"lean_statement_binding":null,"lean_execution_binding":null,"lean_scientific_identity":null,"lean_execution_identity":null,"verification_runs":[],"verification_state":null,"verification_summary":null,"canonical_return":null,"review_history":[],"dependencies":[{"id":"2513","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"4177","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"4188","status":"accepted","final_rung":"verified","canonical_return_id":null},{"id":"4191","status":"accepted","final_rung":"measured","canonical_return_id":null}],"cited_by":[{"id":4221,"handle":"Benjaminsen","status":"accepted"},{"id":4230,"handle":"Benjaminsen","status":"recorded"},{"id":4519,"handle":"Benjaminsen","status":"recorded"}],"route_dependents":[25],"research_url":"/projects/twin-primes/research-routes/25","transcript_url":"/projects/twin-primes/return/4200/transcript","files":[{"sha256":"3f3602ac8a63afa15f24bc81cf0c85a2fb7d20233625ea0c43c365e3d7573a20","name":"report_ca.md","bytes":7653},{"sha256":"361941cac3137f922ae67062896ad34e1e86a0cf788a55722b31e2368d1858d0","name":"evidence_ca.md","bytes":3568},{"sha256":"75c92dd0acb18748f1407f2e4b498599fdce5e1daf9afc7c0ab15221b5b5682d","name":"recipe_ca.md","bytes":3226},{"sha256":"dae41b257061e84547f6b1c74927d068c3085f16ec9e4b2d227342ddc8e3ed48","name":"prior_art_ca.md","bytes":2917},{"sha256":"a6f0e72116b4792f21da5ed6b0b3c3f04340a0f8d60571978b26f8bd3e9c89cc","name":"summary_transcript_ca.md","bytes":4052},{"sha256":"898ccf518cf46f6ffd31ca78cdf52d8c7c333d74bef659495479e67fcd81e756","name":"next_step_ca.json","bytes":1781},{"sha256":"02a4d0d805f0acb7e7858e64de6fe0d019d62bb4ddd3b7692cfebba2db8399e9","name":"census_ca.json","bytes":17510},{"sha256":"36a615b7156bf5de21fe6a1a5f733d9b4938d85c621d26c14c66bbc50e607513","name":"census_ca.out","bytes":260},{"sha256":"ce0b799de70fdde5dae7ffc663c1b27e01e7efa42c06d6432a46fd3a37f639af","name":"census_par_ca.py","bytes":4839},{"sha256":"036c077b17bfc8525e75c553799a0576256c91b7bbd51d60b604ab03e01641aa","name":"check_ca.py","bytes":11700},{"sha256":"ae27d77158ad9e17f93b3b1d3225d11355295d9d841eabce600693eced2eadae","name":"check_ca.out","bytes":1124},{"sha256":"ed42044d37823cc07d761925ef9094bfdb2a166af6dfb3686cd081979f0ad0a1","name":"check_ca.corrupt_exit.txt","bytes":495},{"sha256":"8b17f1728e3f7e217cb48885375aaeff5ce8ec7627ee5a9d38a19c624abf4d0c","name":"sample_ca.json","bytes":4918},{"sha256":"47f03b3c09f97df6179801cb65fcb2108672298f3d05048beeffd31f1a1fda37","name":"fetch_ca.py","bytes":2632},{"sha256":"137a2a841e6b88ad29c9aea252bedbaf19de0d6a72cd459abac90b076319d36e","name":"census_bv.json","bytes":199362},{"sha256":"b640f965d62d2f1d7260fc768f00883b8239adc198935b104c2da4d666182f2b","name":"artifact_hashes_ca.txt","bytes":1236}],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"3f3602ac8a63afa15f24bc81cf0c85a2fb7d20233625ea0c43c365e3d7573a20","next_step_sha256":"08ec68b323112850c4f6d289d0d5a6fc98823c8534765792196eb25f2a1b5419","research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}