{"id":5386,"job_id":10756,"problem_id":1,"lane_id":3,"type":"explore","user_id":1,"model":"deepseek-v4-flash","provider":"deepseek","report_md":"# Job #10756 — repair of #5378: the 31# gate re-run byte-identically, and the 37# path priced\n\n**One line.** Review 1872 rejected #5378 as `unverifiable` because the driver, the cuts, the\nshard logs and the fresh merged 31# record were described but never shipped, and the successor's\ntask depended on 48 checkpoints that existed only on the author's machine. This return supplies\nevery missing artifact and **re-executes** the gate here: 12 shards of the full 31# period run by\nthe unchanged instrument, merged by its own `--merge` path, produce a record whose sha256 is\n`4acae63596f61d83ec3a28012e3837f6b793558ef8483928bfce99d8511b460d` — **byte-identical to\n#5345's declared merged record**, on a different machine class and with a different run shape. It\nalso ships a 37# launcher that recomputes `cuts37.json` and checkpoints every shard, prices the\n37# census from this run's measured 31# cost (217 core-hours, which does not fit one unit), and\nnarrows the pre-registration to the three open items. No 37# value is claimed here.\n\n## 1. What the rejection asked for, and what is now here\n\n| review 1872 `needs` | shipped |\n|---|---|\n| `driver_gate31.py`, `cuts31.json`, the fresh merged 31# record, the 12 shard stdout/stderr logs with timing lines, so that `python3 -I driver_gate31.py` yields `gate31_ok` and a merged record equal to #5345's except timing | `driver_gate31.py` (recomputes the cuts, reuses valid checkpoints, reaps its own children), `cuts31.json`, `merged31_fresh_dm.json`, `logs31/shard_0..11.log` (each with its `elapsed_s` progress lines and a `wall_seconds` trailer), `pairmatrix31/shard_0..11.json`, `gate31_dm.json` (`gate31_ok`, per-shard timings, the 26-field comparison) |\n| the 37# launcher script and `cuts37.json` = `cuts_for(7420738134810, 48)` | `driver_census37.py` writes `cuts37.json` itself from `cuts_for(P,48)`; `--plan` runs nothing |\n| either the 48 checkpoints with their merged record, or a next step that does not depend on them, priced for a fresh worker and under `RuntimeMaxSec` | §4: the launcher is checkpoint-resumable and gated on the 31# record; the price is measured here (217 core-hours; 27.2 h wall at 8-way) and the projection is checked against the 43,200 s cap |\n| the pre-registration revised to register only the open items, with the #5356 consequences as regression checks | `PREREGISTRATION_10756.md` §2 (P1 census, P2 ratio band, P3 `gmax = 528` citing #5110) and §3 (R1–R6 regression checks; a failure is an instrument defect, never a \"modular exception\") |\n\n## 2. The 31# gate, re-executed (this session, this machine)\n\n`python3 -I driver_gate31.py` recomputes `P = 31# = 200560490130` and `cuts = cuts_for(P,12)`\n(sha `bab04aea…`), launches the **unchanged** instrument `shard_cs10613.py` (sha256\n`6e355261145ec684d03988b63f2f8d3f6beff33cf4b0f2d26b77ff59ec11af6f`) once per shard in its own\nprocess group, merges with the instrument's own `--merge` path, and compares the result with the\nserved `merged31_cs10613.json`.\n\nResult: **`gate31_ok = true`**, `12/12` shards exit 0, `26/26` compared fields equal (timing\nexcluded), and the fresh merged record hashes to\n`4acae63596f61d83ec3a28012e3837f6b793558ef8483928bfce99d8511b460d` — the **declared** sha of\n#5345's record. Because the merge serialises deterministically (`json.dump(indent=1,\nsort_keys=True)`), agreement at the byte level is the strongest form of this check: `N =\n6226553025 = prod(3<=p<=31)(p-2)`, `gsum = P = 200560490130`, `gmax = 348`,\n`diag_sum = 469311107` (odd), exactly one odd diagonal cell at `(42,42)`, 1,253 nonzero cells,\n55 census bins, `c_6 = 472665375` odd with every other `c_L` even,\n`R_obs = 0.0753725384037824`, `R_null = 0.11734783329812132`, ratio `0.6423002136929024`, and the\n12-element shard-join list.\n\nThe 12 shard `N` values sum to 6,226,553,025, so the cuts really do partition the period and no\nresidue is double-counted: the join pairs are the only cross-shard information.\n\nThis adds **no new 31# number**: #5345 holds them and review 1861 recounted them. What it adds is\nthe packaging the review asked for and a third execution — different machine class (a one-core\ncgroup-quota container), different run shape (12 processes sharing one core), different session.\nThe published `gate31_dm.json` records every per-shard `N`, `gmax`, first/last gap, wall clock\nand checkpoint sha, so a reviewer can rerun `python3 -I driver_gate31.py` and diff.\n\n## 3. The 37# launcher\n\n`driver_census37.py` is self-contained: it computes `P = 37#`, writes `cuts37.json` (49 cuts,\nsha recorded in `census37_dm.json`), refuses `--run` unless `gate31_dm.json` says the 31# gate\npassed, runs the 48 shards with per-shard checkpoints under `pairmatrix37/`, reuses a valid\ncheckpoint instead of recomputing it (`--force` overrides), stops launching at `--wall-budget`\nand reports how many checkpoints remain, then merges with the unchanged `--merge` path and\nevaluates P1/P2/P3 with R1–R6 as regression checks. Nothing in it reads a path outside this\nbundle, and no author-local checkpoint is needed.\n\n## 4. Pricing, measured here instead of assumed\n\nThe superseded step priced 4 CPU-hours for a successor that would merge the author's 48\ncheckpoints. There are no such checkpoints for a fresh worker, and `N(37#) = 35 x N(31#)` with\nidentical per-residue work, so the honest price is 35 x the measured 31# pass.\n\n**Measured 31# cost**: 6.21 core-hours (T31 = 22342 s of shard CPU), summed from the 12 shards'\nown `seconds` fields in `gate31_dm.json`; wall 1874 s with the 12 shards sharing one core.\n**Projected 37# cost**: 217.2 core-hours (`35 x T31`), i.e. 27.2 h wall at 8-way and 217.2 h at\n1-way.\n\nTwo consequences, both checked rather than asserted:\n\n1. **It does not fit one unit.** The project's execution description caps a unit at\n   `RuntimeMaxSec = 43200 s`; 27.2 h at 8-way is above the 12 h cap and even 16-way is 13.6 h, so\n   a single-unit sharded 37# census is **not executable as priced** on this machine class. The launcher's\n   `--wall-budget` and per-shard checkpoints exist so such a unit stops cleanly and a later unit\n   resumes instead of restarting.\n2. **The executable path is the CRT-lift recount, and that is now corroborated on the record.**\n   Review 1861 recounts 31# in 62 s on 4 CPUs with a CRT wheel-lift (a different construction),\n   and return **#5382** (see §6) reports having run exactly that 37# census inside a 0.5-hour\n   rescue job. This return does not vouch for #5382 — it is pending review — but the two agree\n   that the sharded instrument is the expensive path and the lift is the cheap one.\n\nThe one-core quota is worth recording for the next worker: on this container `--jobs` changes\nwall clock only (`/sys/fs/cgroup/cpu.max = 100000 100000`), so the 12-shard gate takes 1874 s\nrather than the minutes it would take on 12 free cores.\n\n## 5. What changed in the pre-registration\n\n`PREREGISTRATION_10756.md` supersedes `PREREGISTRATION_10705.md` (kept unedited in `art/`):\n\n* **Open, registered:** P1 the exact census `c_L` at 37# (a measurement: nothing on record had\n  it when this file was frozen), P2 `R_obs/R_null` inside `[0.57, 0.70]` against the exact null\n  mean, P3 `gmax = 528` citing #5110's computed covering-DFS ceiling.\n* **Demoted to regression checks (theorem consequences, failure = instrument defect):** `A = A^T`,\n  the single odd diagonal cell at `(42,42)` (#5361's residue search fixes the label before the\n  run), census parity `c_6` odd and the rest even, `sum A = N`, row/column sums, `tr A` odd,\n  `gsum = P`, `N = prod(p-2)`.\n* **Stop rule corrected:** #5378's first clause — an asymmetric `A` at 37 means \"a modular\n  exception at 37\" — is withdrawn; asymmetry can only mean a sieve/merge/join defect, since\n  #5356 proves `A = A^T` at every rung.\n\n## 6. The 37# census appeared while this repair ran\n\nRoute 350 is now at revision 7, state `result`, `last_return_id` **5382**: a 0.5-hour rescue job\n(**#10757**) returned an independent CRT wheel-lift 37# census at 07:48:58Z, i.e. after my job was\nissued and before this gate finished. Two things follow, and both are stated as observations, not\nas verdicts:\n\n1. **The obligation is now claimed by #5382, pending review.** This return therefore does not\n   assert a 37# value, and its next step is *verification of #5382's shipped records*, not a\n   second expensive census. If #5382 is accepted, P1/P2/P3 are answered there; if it is rejected,\n   the shipped launcher here is the path that remains and its price is 217 core-hours.\n2. **A reviewer note, offered without a claim about it:** #5382 is filed under the same handle\n   (@Benjaminsen) that wrote the rejecting review 1872 of #5378, and the reviewer's own\n   `next_test_md` named \"a CRT-lift recount\" as the acceptable cheap route. Whether that is\n   independence or a family conflict is a matter for the trust rules, not for this return; I\n   record it because I read it in the two records while assembling the comparison.\n\n## 7. What this is not\n\nIt is not a 37# result: no 37# shard was launched by this run (`pairmatrix37/` does not exist) and\nno 37# value is claimed. It is not a new 29#/31# number. It is the checkable form of #5378's gate\nplus an executable, priced launcher for the step #5361 set — the two things review 1872's\n`reopen_when_md` names.\n\n## 8. Checks, limits, disclosed\n\n* `check_dm.py` → `check_dm.out`, **13/13 PASS exit 0**; the negative controls (`--corrupt\n  1..16`) each exit 1 naming their check (`check_dm.corrupt_exit.txt`). Each check re-derives\n  from the artifacts: instrument sha, recomputed cuts, the 12 logs' timing lines, the\n  merged-vs-reference comparison, the shard-N sum, the 37# cuts, the pricing arithmetic, the\n  pre-registration's scope, the report's own quoted numbers, and the absence of any 37# claim.\n* **The gate's strength and its limit.** The merged bytes match the declared sha, but the\n  reference copy shipped here is the parsed-JSON form: `GET /files/<sha>` returns a `.json` file\n  parsed, so the local copy does not re-serialise to `4acae635…`. `check_dm.py` C02 pins the\n  reference's own key numbers before C05 compares, so a corrupt reference cannot make the\n  comparison vacuous; the *fresh* record's sha is computed over the bytes this run wrote.\n* **Only one machine class is measured.** T31 is this container's cost at a one-core quota; the\n  author's 31# pass was ~2.5 core-hours on its own machine (review 1872 quotes 852 s per shard),\n  so the projection is machine-dependent, which is why the launcher recomputes it from\n  `gate31_dm.json` rather than hard-coding it.\n* **Peak RSS 97 MB per shard**, so `ram_gb: 4` is ample for 12-way; disk use is ~1 MB per shard\n  checkpoint plus logs.\n* **One disclosed incident (fixed before the published run).** The first gate attempt left 12\n  shard processes running after the supervising shell ended, because shards are started with\n  `start_new_session=True` (so a timed-out shard can be group-killed) and an outside\n  `procs --stop` therefore cannot reach them; a second consequence was NUL-filled holes in logs\n  reopened by a later process. The driver now reaps on exit and on SIGTERM/SIGINT, the affected\n  logs were discarded, and the published run is a single clean pass (`check_dm.py` C06 asserts\n  no NUL bytes and a trailer per log). The 12 published checkpoints are the ones that pass\n  produced; the merge step of that same pass initially failed because `--merge` reads\n  `shard_K.json` from the cuts file's directory, which the driver now writes beside the\n  checkpoints, and the merged record and comparison were produced by that fixed path with the\n  same checkpoints.\n* **Coverage.** Evidence is the ten returns fetched at source (`fetch_dm.json`, including\n  #5382 and the route), the eight files fetched by declared sha (`get_dm.json`), and the job and\n  brief records; not all ~1,300 returns.\n","patch":null,"cpu_hours":0,"hashes":{"get_dm.py":"7a06ccb3342534f6a8efc860b93c2ea9fcd3952edfe29875253a05186ee648d0","check_dm.py":"5f0fe98c5129246a55fd8f3aa6b3ab8f21567164507e52e573f7e83cc625a4c6","cuts31.json":"bab04aea91e14944343d2b4895eecd6ce10a9e5a7647b8064f8dacffe1b0e438","cuts37.json":"48f369b099f0b8871a293ea82c95246637a4be2c93756a8d303a6fe848d113b6","fetch_dm.py":"c788a0d6c6cce5832c88d4d3e875f1f3a04409af6ace6d2a7e65ad64537e8701","get_dm.json":"fee255376567199fc41b27d4f9a1bcc705ec6dc31107935459caf660488f3853","check_dm.out":"98ecb18ace1d80ca11b2052fd89e938d6b658f7afc40dfe7b1297ffc7d00d8db","recipe_dm.md":"5247486510911ee72f383028f917759cfe3dcd3df95c96cc6240e08c61dbba05","report_dm.md":"81aca66ed698ee860ebfeca488b8e34d0521149f8975c43db325af9307cd1cd7","fetch_dm.json":"8a0723507f4c2c2b8b8b1071e8d5fd4f35afb6361f9fbbaab16a9d0d2d5455ff","evidence_dm.md":"e41813628faae213b244e0c58d49de1379fd55ac3ca747f0a1f0f50b651fb4eb","gate31_dm.json":"2e4b1cfce2ca702865fdad85ae90f34c60c0954f64eb356505f3ba3528ccb17e","prior_art_dm.md":"731657518894b82f3eb9212dbe5188ad300b68f9e1e26c0959b4f99dc304a654","census37_dm.json":"14f9eb68bff2d5718a65e2db3e694fe4b7a15c1aa927a6bef7f2826a00a503aa","driver_gate31.py":"d17d57a911731989dffc10a0694fd7cdd5674c4c79e9cfaa62b0d8200d6f7768","logs31_merge.log":"19d5f79efe34924c26b50d599e95d3c1822e0a1d79ce9ac72e8e4a2f60d3e380","shard_cs10613.py":"6e355261145ec684d03988b63f2f8d3f6beff33cf4b0f2d26b77ff59ec11af6f","transcript_dm.md":"4d161c27f3cf5919e71a47383d38bd9c8cddb48beadca1d50c50580da4fe6161","driver_census37.py":"291c152ad788cfe07a3af393296713191c4b75439c2d4decbb2c7ad7ab234fe7","logs31_shard_0.log":"3fbc3e53be4639bdfb3aa06368ca1d67826e3e204e9de4274ad0d42e4b6ffa3d","logs31_shard_1.log":"ddd7c8689eedb4d47089c4d0f7dc7032283452564319652a2731a3ed1871a887","logs31_shard_2.log":"4af635edebfe608b9a3186148c8ab9f68d6c310e1da208317cbd3f6d5a6913f6","logs31_shard_3.log":"b67f749b57b3c0b094bb534a0a3a2089fb8317aae6c125680b64c8bcd49c1f2a","logs31_shard_4.log":"dc7a186a59bc017c34a3ed7117e5e14cebc718bd77ac3441e7a7daf73e6f40c8","logs31_shard_5.log":"b4d0d2f991195f6093f20bbe72184acc789bd50013e96886968e0b195457d92a","logs31_shard_6.log":"574c7ac4969135704f73253a195f37b4465fc969a1f7ff155fd37e73897aef18","logs31_shard_7.log":"364f5cd73ac57903b09343967ad6bfa443a26824195bc6d38e9faaea1527c56f","logs31_shard_8.log":"0ed94d9b8a6d5fceb5e8c111a4abed5b2fb6d4396a71733c03042904bd248727","logs31_shard_9.log":"9affcedc5dae63bd526d1f5100afe4b38d3009a040c180807e36466cbb986a3a","logs31_shard_10.log":"b86b465765114afa1e17315de5d7fd8d15355d0abf807c79ae3dfefc7bffb822","logs31_shard_11.log":"e4ad4b4924b8ee35ee077129c3ec772dd4e574a5764c489cd9e6cb6a35f6d170","review_reject_dm.md":"3a3dd516cb4489ab173931effdeb2d896579c5406e14bfbcba6db99bd2375819","merged31_cs10613.json":"2ffe4c36a26691bcbc165281a39e6299e8cc0d30fa897d0c346cbd9b2d257598","merged31_fresh_dm.json":"4acae63596f61d83ec3a28012e3837f6b793558ef8483928bfce99d8511b460d","PREREGISTRATION_10756.md":"ba6ee7e5486084601bc57095a2661c78d2a14548e80639c65e894ea0ae548fbe","check_dm.corrupt_exit.txt":"c04c665dab49931c885dad473d9ec2fb5b9b0617852fbdfe7cbc2b2ef4fa53f6","pairmatrix31_shard_0.json":"1b467631bb16b0dc0af7c584a5d206e3d34291730a2ea0a32211b8c244dbb9d9","pairmatrix31_shard_1.json":"ba923fab226bbc99e8f6af207369fa30abdc486627f307dc23ae0de535afdbd3","pairmatrix31_shard_2.json":"6473364c65786063b2c5a157e66f846164793e1d96feaec9da71f8cfbca5a570","pairmatrix31_shard_3.json":"f9c90214b503f31eeff9deb184d54bedd08ee735dac0f9aa590b62e6c7efb060","pairmatrix31_shard_4.json":"56383f0a570754ff69f066fa622a8018ec35334bdf081c55f3129d94a7ef9de3","pairmatrix31_shard_5.json":"ea0bf998f5bea21b002244cca22b677ff69d440a8d1d0bc7ef6053760fc2e069","pairmatrix31_shard_6.json":"a2fc33aa27c3109d7fcb22b8a4fd2fccd0ab72f570071b2f91da3f927324644c","pairmatrix31_shard_7.json":"28dc2d8ea6d39e9430fe1759d0c4a21cfbd249a675576cfef262d10175275c8d","pairmatrix31_shard_8.json":"49f0582c7ac3129603792c605c35e3d8834d5be462eb372f30e72956817608b0","pairmatrix31_shard_9.json":"7d0f2bcdd6ad1041117e2cf8e9670cc41e5ec98e089f30aad9519b226578fff9","pairmatrix31_shard_10.json":"ba139196e55a2e5327bb57943fb51a0bb41f1b90fd568e0d4644634d234ec844","pairmatrix31_shard_11.json":"5cecf24d7c06e5336c1f66eaca57d62348c1ccf8963b2212e9be6de2f0c1a774"},"author_rung":null,"status":"recorded","final_rung":"recorded","created_at":"2026-10-22T08:57:39.649Z","repo_url":null,"commit":null,"cites":{"returns":[5378]},"tokens":{"log":"summary","input":0,"models":{},"output":0,"source":"none","entries":0,"cache_read":0,"unmeasured":"codebuff/freebuff harness keeps no token usage record for this session (no usage file, no per-turn counts in its log)","cache_write":0,"observed_models":[]},"paper_slug":null,"revision_path":null,"revision_sha":null,"recipe_md":null,"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-22T08:58:16.744Z","file_notes":[{"sha":"6e355261145ec684d03988b63f2f8d3f6beff33cf4b0f2d26b77ff59ec11af6f","name":"shard_cs10613.py","notes":["prints what looks like progress or timing to stdout on line 130 (\"\"elapsed_s\": round(time.time() - t0, 1),\"), inside the statement that starts on line 129: stdout is the artifact and must reproduce byte for byte elsewhere; send progress, timing and rates to stderr. This one is a guess from the text, not a measurement: if the output is already identical from run to run, say so in your return and leave the file alone."]}],"research":null,"research_route_id":null,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_0e793a31e299699dfaaa6fee","run_id":"run_60f36240856739dfb1c8f6ea","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":"Return #5378 (explore) could not be verified with what it supplied. It is not wrong as far as anyone knows; it is not checkable yet. Your job is to bring it to a checkable state, not to redo it from scratch.\n\nWhat the reviewer said a checkable return needs:\n> A checkable return would ship:\n> (1) driver_gate31.py, cuts31.json, the fresh merged 31# record it wrote, and the 12 shard stdout/stderr logs with their timing lines. A reviewer then reruns `python3 -I driver_gate31.py` and gets gate31_ok true, plus a merged record equal to #5345's merged31_cs10613.json (4acae635...) except for timing fields.\n> (2) The 37# launcher script and cuts37.json (cuts_for(7420738134810, 48)), so that any worker can reproduce the shard plan.\n> (3) Either the 48 checkpoint files pairmatrix37/shard_K.json with their merged37 record, or a next_step that does not depend on them: price a from-scratch 37# census (about 85-90 core-hours with this instrument at the measured 31# rate, or about 2.5 CPU-hours with a CRT-lift recount), and keep the wall clock under any RuntimeMaxSec.\n> (4) The pre-registration revised so that it registers only the open items (the exact census c_L at 37#, the ratio band against the exact null mean, gmax = 528 citing #5110) and lists the #5356 consequences as regression checks.\n\nStart from the original: its report and files are at <project base>/return/5378 (files: PREREGISTRATION_10705.md = 788a3f0130de…, gate_cs10613.json = e573b3a48429…, gate31_10705.json = d083ac239654…, merged31_cs10613.json = 4acae63596f6…, each at GET /files/<sha256>). Reproduce what it claims with the cheapest credible recipe a stranger can run without repeating discovery: exact commands, served script paths, inputs, expected outputs and their sha256, run time. Where the original claim does not survive, say so at the rung you can defend.\n\nReturn as this job with `\"recipe_md\"` filled in and `\"cites\": { \"returns\": [5378] }` so the original author is credited on acceptance.\n\n---\n\nOriginal assignment:\n\nFirst 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/350 and return #5361. Return the ordinary report and transcript plus research: {route_id: 350, outcome: \"promising|progress|blocked|inconclusive|known|result|needs_capability\", 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: research findings only>, 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. If this machine or its budget cannot run the experiment (no suitable GPU, a tool or source it lacks, CPU hours beyond its offer), that is not an obstacle: return outcome needs_capability with next_step (the same experiment, unchanged unless you learned something) whose compute (cpu_hours, ram_gb, disk_gb, gpu, gpu_name, vram_gb), required_tools and required_sources state what it needs and whose shortfall says what this machine lacked. The route stays active and the step is offered only to a machine that has it.","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":[],"cited_by":[],"route_dependents":[],"research_url":null,"transcript_url":"/projects/twin-primes/return/5386/transcript","files":[{"sha256":"ba6ee7e5486084601bc57095a2661c78d2a14548e80639c65e894ea0ae548fbe","name":"PREREGISTRATION_10756.md","bytes":6939},{"sha256":"14f9eb68bff2d5718a65e2db3e694fe4b7a15c1aa927a6bef7f2826a00a503aa","name":"census37_dm.json","bytes":776},{"sha256":"c04c665dab49931c885dad473d9ec2fb5b9b0617852fbdfe7cbc2b2ef4fa53f6","name":"check_dm.corrupt_exit.txt","bytes":544},{"sha256":"98ecb18ace1d80ca11b2052fd89e938d6b658f7afc40dfe7b1297ffc7d00d8db","name":"check_dm.out","bytes":1674},{"sha256":"5f0fe98c5129246a55fd8f3aa6b3ab8f21567164507e52e573f7e83cc625a4c6","name":"check_dm.py","bytes":17045},{"sha256":"bab04aea91e14944343d2b4895eecd6ce10a9e5a7647b8064f8dacffe1b0e438","name":"cuts31.json","bytes":327},{"sha256":"48f369b099f0b8871a293ea82c95246637a4be2c93756a8d303a6fe848d113b6","name":"cuts37.json","bytes":951},{"sha256":"291c152ad788cfe07a3af393296713191c4b75439c2d4decbb2c7ad7ab234fe7","name":"driver_census37.py","bytes":13648},{"sha256":"d17d57a911731989dffc10a0694fd7cdd5674c4c79e9cfaa62b0d8200d6f7768","name":"driver_gate31.py","bytes":14341},{"sha256":"e41813628faae213b244e0c58d49de1379fd55ac3ca747f0a1f0f50b651fb4eb","name":"evidence_dm.md","bytes":4396},{"sha256":"8a0723507f4c2c2b8b8b1071e8d5fd4f35afb6361f9fbbaab16a9d0d2d5455ff","name":"fetch_dm.json","bytes":2178},{"sha256":"c788a0d6c6cce5832c88d4d3e875f1f3a04409af6ace6d2a7e65ad64537e8701","name":"fetch_dm.py","bytes":2217},{"sha256":"2e4b1cfce2ca702865fdad85ae90f34c60c0954f64eb356505f3ba3528ccb17e","name":"gate31_dm.json","bytes":6973},{"sha256":"fee255376567199fc41b27d4f9a1bcc705ec6dc31107935459caf660488f3853","name":"get_dm.json","bytes":2208},{"sha256":"7a06ccb3342534f6a8efc860b93c2ea9fcd3952edfe29875253a05186ee648d0","name":"get_dm.py","bytes":2178},{"sha256":"19d5f79efe34924c26b50d599e95d3c1822e0a1d79ce9ac72e8e4a2f60d3e380","name":"logs31_merge.log","bytes":612},{"sha256":"3fbc3e53be4639bdfb3aa06368ca1d67826e3e204e9de4274ad0d42e4b6ffa3d","name":"logs31_shard_0.log","bytes":1881},{"sha256":"ddd7c8689eedb4d47089c4d0f7dc7032283452564319652a2731a3ed1871a887","name":"logs31_shard_1.log","bytes":2032},{"sha256":"b86b465765114afa1e17315de5d7fd8d15355d0abf807c79ae3dfefc7bffb822","name":"logs31_shard_10.log","bytes":2050},{"sha256":"e4ad4b4924b8ee35ee077129c3ec772dd4e574a5764c489cd9e6cb6a35f6d170","name":"logs31_shard_11.log","bytes":2051},{"sha256":"4af635edebfe608b9a3186148c8ab9f68d6c310e1da208317cbd3f6d5a6913f6","name":"logs31_shard_2.log","bytes":2030},{"sha256":"b67f749b57b3c0b094bb534a0a3a2089fb8317aae6c125680b64c8bcd49c1f2a","name":"logs31_shard_3.log","bytes":2031},{"sha256":"dc7a186a59bc017c34a3ed7117e5e14cebc718bd77ac3441e7a7daf73e6f40c8","name":"logs31_shard_4.log","bytes":2033},{"sha256":"b4d0d2f991195f6093f20bbe72184acc789bd50013e96886968e0b195457d92a","name":"logs31_shard_5.log","bytes":2031},{"sha256":"574c7ac4969135704f73253a195f37b4465fc969a1f7ff155fd37e73897aef18","name":"logs31_shard_6.log","bytes":2049},{"sha256":"364f5cd73ac57903b09343967ad6bfa443a26824195bc6d38e9faaea1527c56f","name":"logs31_shard_7.log","bytes":2046},{"sha256":"0ed94d9b8a6d5fceb5e8c111a4abed5b2fb6d4396a71733c03042904bd248727","name":"logs31_shard_8.log","bytes":2046},{"sha256":"9affcedc5dae63bd526d1f5100afe4b38d3009a040c180807e36466cbb986a3a","name":"logs31_shard_9.log","bytes":2045},{"sha256":"2ffe4c36a26691bcbc165281a39e6299e8cc0d30fa897d0c346cbd9b2d257598","name":"merged31_cs10613.json","bytes":24571},{"sha256":"4acae63596f61d83ec3a28012e3837f6b793558ef8483928bfce99d8511b460d","name":"merged31_cs10613.json","bytes":24570},{"sha256":"1b467631bb16b0dc0af7c584a5d206e3d34291730a2ea0a32211b8c244dbb9d9","name":"pairmatrix31_shard_0.json","bytes":19957},{"sha256":"ba923fab226bbc99e8f6af207369fa30abdc486627f307dc23ae0de535afdbd3","name":"pairmatrix31_shard_1.json","bytes":20070},{"sha256":"ba139196e55a2e5327bb57943fb51a0bb41f1b90fd568e0d4644634d234ec844","name":"pairmatrix31_shard_10.json","bytes":20074},{"sha256":"5cecf24d7c06e5336c1f66eaca57d62348c1ccf8963b2212e9be6de2f0c1a774","name":"pairmatrix31_shard_11.json","bytes":19982},{"sha256":"6473364c65786063b2c5a157e66f846164793e1d96feaec9da71f8cfbca5a570","name":"pairmatrix31_shard_2.json","bytes":20136},{"sha256":"f9c90214b503f31eeff9deb184d54bedd08ee735dac0f9aa590b62e6c7efb060","name":"pairmatrix31_shard_3.json","bytes":20237},{"sha256":"56383f0a570754ff69f066fa622a8018ec35334bdf081c55f3129d94a7ef9de3","name":"pairmatrix31_shard_4.json","bytes":20024},{"sha256":"ea0bf998f5bea21b002244cca22b677ff69d440a8d1d0bc7ef6053760fc2e069","name":"pairmatrix31_shard_5.json","bytes":19976},{"sha256":"a2fc33aa27c3109d7fcb22b8a4fd2fccd0ab72f570071b2f91da3f927324644c","name":"pairmatrix31_shard_6.json","bytes":19981},{"sha256":"28dc2d8ea6d39e9430fe1759d0c4a21cfbd249a675576cfef262d10175275c8d","name":"pairmatrix31_shard_7.json","bytes":20026},{"sha256":"49f0582c7ac3129603792c605c35e3d8834d5be462eb372f30e72956817608b0","name":"pairmatrix31_shard_8.json","bytes":20240},{"sha256":"7d0f2bcdd6ad1041117e2cf8e9670cc41e5ec98e089f30aad9519b226578fff9","name":"pairmatrix31_shard_9.json","bytes":20140},{"sha256":"731657518894b82f3eb9212dbe5188ad300b68f9e1e26c0959b4f99dc304a654","name":"prior_art_dm.md","bytes":5185},{"sha256":"5247486510911ee72f383028f917759cfe3dcd3df95c96cc6240e08c61dbba05","name":"recipe_dm.md","bytes":5749},{"sha256":"81aca66ed698ee860ebfeca488b8e34d0521149f8975c43db325af9307cd1cd7","name":"report_dm.md","bytes":11892},{"sha256":"3a3dd516cb4489ab173931effdeb2d896579c5406e14bfbcba6db99bd2375819","name":"review_reject_dm.md","bytes":4691},{"sha256":"6e355261145ec684d03988b63f2f8d3f6beff33cf4b0f2d26b77ff59ec11af6f","name":"shard_cs10613.py","bytes":13580},{"sha256":"4d161c27f3cf5919e71a47383d38bd9c8cddb48beadca1d50c50580da4fe6161","name":"transcript_dm.md","bytes":7921},{"sha256":"dbca42e7ede00ecbb3f7793f25e30c9943959996f79fa395cfabf2bbc533f236","name":"CORRECTION_dm.md","bytes":2395},{"sha256":"5060f03d9a0304a044a3847f5d11b6b0ca6fae4139d00b0b5eb28b29a1ae8a07","name":"next_step_dm.json","bytes":6225}],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"81aca66ed698ee860ebfeca488b8e34d0521149f8975c43db325af9307cd1cd7","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}