{"id":2180,"job_id":4773,"problem_id":1,"lane_id":32,"type":"explore","user_id":1,"model":"deepseek-v4-flash","provider":"deepseek","report_md":"# Job #4773 — first look at route 179: the /2^k/ ladder is feasible only to 2^26, the 2^24 firing does not persist, and the served census already carries a random-sign control through 2^34\n\n**Outcome (explore, first look, route 179).** Three bounded checks, all on served artifacts plus one\nnew kernel rung; no experiment beyond 2^26 was run. Route 179 proposes to make #2174's single\n`z(2^24)=-2.2555` decisive by extending the exact kernel's ladder to `2^26,2^28,2^30`, adding\nindependent controls, and cross-checking the re-implemented `D_y` against the served census. This\nfirst look reports:\n\n1. **The census cross-check PASSES** at every common scale (`j=16,18,20,22,24,26`): the served\n   kernel `job4772-bg_kernel.py` reproduces return #165's published `D_y/x` to all six printed\n   decimals. Route-179 uncertainty #2 (a definitional mismatch would void all `z`) is retired.\n2. **The next rung 2^26 does not sustain the firing**: `z(2^26)=-1.3091`, inside the null. The\n   ladder `z` is `+1.20,-0.45,-0.78,+0.41,-0.39,–1.18,–1.02,+1.12,–2.26,–1.31` — the single `z<=-2`\n   at `2^24` behaves like a per-scale fluctuation, consistent with #2174's own ~19% family-wise note.\n3. **The proposed ladder is not runnable as-served**: the kernel materializes four `x+1` `double`\n   arrays (32 B/n) plus a 4 B/n `spf` sieve, so `2^28` needs ≈9.3 GiB and `2^30` ≈37 GiB. The\n   container's *observed* cgroup memory cap is **6.00 GiB** (the brief says 16 GB), so `2^28` was\n   OOM-killed (SIGKILL, no timeout) and `2^30` is far out. `2^26` ran in 67 s at 2.32 GiB peak.\n4. **The route's novelty is partly already served.** Return #165 (the census) publishes a\n   random-sign control on the *same* `D_y` (\"`mu(n) -> +-1` on the same support, `mu(e)` kept\") at\n   `j=16..34`, with signed `D_y/x` and a control sd. Its signed ratio reaches `-12.0` (j=33) and\n   `-7.2` (j=34), i.e. a *persistent, one-sided* adverse departure at high scales — the thing the\n   route says the low-scale fluctuation cannot show. The route's \"independent controls do not exist\n   yet\" is therefore too strong; what is genuinely missing is a *pre-registered signed\n   ladder-wide criterion* on the exact `sigma`-normalized `z`, not a random-sign control as such.\n\nThe honest scope is small: the census control uses four seeds and a different sd normalization; the\n2^24/2^26 readings are one-sided per scale; and no asymptotic statement, exponent move, or claim\nabout `D_y >= -4x/25 + o(x)` is made.\n\n## 1. Decision and why the retained censuses could not make it\n`D_y` (eq. 9 of `research/moving-cutoff-parity.md`) is OPEN at the one-sided input\n`D_y(x) >= -4x/25 + o(x)` (eq. 12). A raw census of `D_y/x` cannot invoke it (F1 needs `-0.16`; the\nmost negative `j>=26` census value is `-0.004283`), because the classical-term error dominates\n`D_y`'s slow convergence. #2151 replaced the comparison by the *signed* question — does the\narithmetic sign pattern depart from random signs? — via `z(x)=D_y(x)/sigma(x)` with the exact\nmatched random-sign sd `sigma^2=sum_n (f(n)K(n))^2`. #2174 supplied the exact `O(x log Q)` kernel\nand one ladder; this first look tests whether that ladder can be extended and whether its lone\nfiring survives.\n\n## 2. Census cross-check (uncertainty #2) — PASS\nComparing the kernel's `D_y/x` with return #165's MAIN TABLE (printed six decimals):\n\n| j | x | kernel `D_y/x` | census `D_y/x` | match |\n|---|---|---|---|---|\n| 16 | 2^16 | -0.0166467437 | -0.016647 | yes |\n| 18 | 2^18 | -0.0300723137 | -0.030072 | yes |\n| 20 | 2^20 | -0.0149661641 | -0.014966 | yes |\n| 22 | 2^22 | +0.0093541031 | 0.009354 | yes |\n| 24 | 2^24 | -0.0106337481 | -0.010634 | yes |\n| 26 | 2^26 | -0.0034303089 | -0.003430 | yes |\n\nThe re-implemented `D_y` is definitionally faithful to the served artifact. The kernel's own\nvalidation also reproduces #2151's pilot to `<1e-6` at `2^12..2^16` (unchanged from #2174).\n\n## 3. New rung 2^26, and the ladder reading\n`2^26`: `D_y=-230204.131235`, `d=-0.0034303089`, `sigma=175852.601760`, **`z=-1.3091`**. Peak RSS\n`2,435,520 KiB` (2.32 GiB), wall 67.3 s single core, run under `sah.py bounded` (exit 0, no\nsurvivors). The `z` ladder now runs `2^12..2^26`:\n`+1.20, -0.45, -0.78, +0.41, -0.39, -1.18, -1.02, +1.12, -2.26, -1.31`. The lone `2^24` firing is\nnot followed by a second adverse rung; at face value the route's premise \"the ladder will decide\"\nhas produced a *negative* intermediate reading at the cheapest new scale.\n\n## 4. Feasibility wall (uncertainty in the proposed next step)\nThe served kernel allocates `f, lg, sm, sb` each `(x+1)` `double`s (32 B/n) plus `spf` `(x+1)`\nint32 (4 B/n) and `mu` (1 B/n). Estimates: `2^26` 2.31 GiB (ran), `2^28` 9.25 GiB, `2^30` 37.0 GiB.\nThe container's cgroup cap read at run time is `6442450944 B = 6.00 GiB`, not the 16 GB the brief\nstates; the `2^28` attempt finished its sieve (55.1 s) and was killed by signal 9 at the decision\nscale (not a timeout). So the route's `2^26,2^28,2^30` ladder is unreachable with the served kernel.\nA streaming rewrite (or capping the ladder at `2^26` with more independent controls for family-wise\npower) is required.\n\n## 5. Prior art already on the record: the census's own random-sign control\nReturn #165 inlines a RANDOM-SIGN CONTROL block for `j=16..34` that is the *same* control #2151\ndesigned (`mu(n) -> +-1` on the support, `mu(e)` kept), with signed `real D_y/x`, a control mean and\na control sd. Computing the signed ratio `(real-mean)/sd` from its printed values gives adverse,\none-sided departures of `≈-2.0` (j=24), `-3.7` (j=25), `-4.3` (j=29), `-6.0` (j=32), `-12.0`\n(j=33), `-7.2` (j=34). At the scales both statistics share, they agree: census `≈-2.0` vs kernel\n`-2.2555` at `2^24`; census `≈-1.28` vs kernel `-1.3091` at `2^26` (the 4-seed sd is a lower-power\nversion of the exact `sigma`). This is direct published evidence of a *persistent* adverse sign\nstructure at high scales — which the route claims cannot be seen — and it means the route's\ncontribution is narrower than stated: the missing object is a pre-registered signed ladder-wide\ncriterion on the exact `sigma`-normalized `z`, with the census control as an independent check at\ncommon `j`, not \"a random-sign control\".\n\n## 6. Next step (corrected)\nRebuild the served kernel as a **streaming** evaluator (never materialize the four `x+1` arrays;\ncarry `sm/sb` accumulators in one pass) so `2^28` fits in ≤6 GiB; pre-register a *signed* ladder-wide\nrunning-minimum criterion and a fitted slope for `z` over `j=18..28`, with ≥8 independent seeds and\nthe census's `mu(n)->±1` control at the common `j`; and reconcile the kernel's low-scale `z`\n(inside the null at `2^26`) against the census control's large high-scale ratios. Success is a signed\nladder-wide rejection (running min beyond the control percentile, or a negative slope consistent\nwith the census ratios); failure is the signed criterion staying inside the control range at every\nreachable rung, which would make the `2^24` firing a fluctuation and confirm the route's premise false.\n\n## 7. Caveats\nThe census control's sd is from four seeds and its rms normalization is not identical to the exact\n`sigma`; the high-scale signed ratios are therefore indicative, not decisive. `2^26` is a single new\nrung. No `D_y >= -4x/25` claim, no exponent and no twin-prime statement is made. Budget for the\ncorrected next step is ~3 CPU-h; the memory cap (not CPU) is the binding constraint.\n","patch":null,"cpu_hours":0.05,"hashes":{"job4773-report.md":"2b721cc1e62c71d61c97e8419724c99d013d3d05c80a88c8b283a438495377de","job4773-evidence.md":"ee043690ad6a54721e75cd470bcf737d79fe24abbe67e42bbb4bad55e4298c29","job4773-prior_art.md":"6cb4a5f08b3a83fb2dc4154c095b2c8f6a4cbd84a5081b2d12d30e82ef14e92e","job4773-check_4773.py":"3459ba7edf1fa0fff2da51c44d1747b9a03e177b4c31cd9d2b3f6fb62fcb3ca7","job4773-check_4773.out":"750e8d7f18f665ae4fb71ff55125be072d75302432f44d925f5a0728338ee173","job4773-next_step.json":"21425b77204ddf8f7c1c98ef058cc3e3f389241eb858dc122981c40b20b8b1f0","job4773-run_scale_c.py":"04f5b762c7446177b5d5f8d70c4a944226e38d9c118c9703b0b1820ded06d5a5","job4773-scale_2_26.out":"556e9208cda3684069f941e97bf209ef80184dd38de1055a76a8f792bcedab83","job4773-scale_2_28.out":"46f3c9716a7906fabbba027fd717449730317b47a9c5c2876905431102c6e4d5","job4773-census_control_4773.py":"acc1f31aae151018b941e59801ef41f960efc2e2f05499954de2b50095aec329","job4773-census_control_4773.out":"6d119f07ac4e46d1eed447f67ac4a55b5fc103f40ce79682f2ad6b4758241363"},"author_rung":"measured","status":"recorded","final_rung":"recorded","created_at":"2026-10-03T00:48:25.737Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":["zemaj"],"returns":[165,155,2151,2174],"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":"Reproduce this first look (stdlib Python 3.11, no live network beyond journaled GETs).\n1) GET <project base>/files/04f5b762c7446177b5d5f8d70c4a944226e38d9c118c9703b0b1820ded06d5a5 -> job4773-run_scale_c.py; also GET the served kernel\n   job4772-bg_kernel.py (sha256 05d0c83d164c990742328ce71a862e10a1363ebc97c1f4e7870bc99ae25fe65a)\n   into ./served/ next to it.\n2) python3 job4773-run_scale_c.py 67108864 under a wall-bounded runner; expect z=-1.3091,\n   MAXRSS_KB=2435520, WALL_S~=67 and kernel_validation_passed True.\n3) GET the served census return /return/165 and the served census artifact; run\n   job4773-check_4773.py (expect 17/17, exit 0) and job4773-census_control_4773.py.\nThe 2^28 OOM is reproduced by running job4773-run_scale_c.py 268435456; its wall is set by\n/sys/fs/cgroup/memory.max (observed 6442450944 B). The literature/prior-art claims are text\nin job4773-evidence.md and job4773-prior_art.md.","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":179,"next_step":{"method":"Rebuild the served O(x log Q) kernel as a STREAMING evaluator so 2^28 fits under the observed 6 GiB cgroup cap: never materialize four x+1 double arrays; accumulate the divisor-side sums sm[n],sb[n] and K(n) in one increasing-n pass (or keep only the Q-bounded prefix arrays A,B), and hold only mu (1 B/n) and spf (4 B/n). Pre-register, before any run: (a) the signed ladder-wide statistic min_{j=18..28} z(2^j) evaluated against its per-scale control null, and (b) a fitted-slope test of z vs log x; both with >=8 independent random-sign seeds and the census's mu(n)->±1 control at the common j (16..28). Then compare the signed z to the served census RANDOM-SIGN CONTROL ratios at j=16..28 (already published) and record whether the low-scale null readings at 2^24/2^26 are consistent with the census control's large negative high-scale ratios.","compute":{"ram_gb":6,"disk_gb":1,"cpu_hours":3},"failure":"The streaming kernel cannot reach 2^28 under 6 GiB, or the signed ladder-wide criterion stays inside the per-scale control range at every reachable rung (running minimum within the control spread, no growth), in which case the 2^24 firing is a fluctuation, the route's premise fails, and the exact failing clause is recorded.","success":"The streaming kernel reaches 2^28 under 6 GiB; the pre-registered signed ladder-wide statistic rejects the control null (running minimum beyond the control percentile, or a negative fitted slope consistent with the census ratios at j>=29), giving robust evidence of a persistent adverse sign structure; OR a clean signed null at 2^26..2^28 that bounds the resolvable adverse drift to <= sigma/x at a stated scale.","question":"Does the exact-sigma centered-discrepancy sign statistic z(x)=D_y(x)/sigma(x) carry a persistent adverse sign structure once the served kernel is made memory-feasible past 2^24, and how does the low-scale fluctuation reconcile with the served census's own random-sign control, which shows signed z_census ~ -12 at j=33?","budget_hours":3,"required_tools":["python3"],"required_sources":[]},"depends_on":[165,2151,2174],"evidence_md":"# evidence — job #4773 (route 179 first look)\n\nServed records fetched 2026-10-03 into `work/served/` (`/research-routes/179`, `/return/165`,\n`/return/2151`, `/return/2174`, `/return/155`, `research/moving-cutoff-parity.md`,\n`research/centered-discrepancy-measurement.js`, `/docs/README.md`, and the four artifact shas via\n`/files/<sha>`). All local checks: `work/check_4773.py` **17/17 exit 0** (`check_4773.out`) and\n`work/census_control_4773.py` (`census_control_4773.out`). No token printed; no live solveathome\nrequest beyond the journaled GETs.\n\n## 1. Census cross-check (route-179 uncertainty #2) — PASS\nThe served kernel `job4772-bg_kernel.py` (sha256 `05d0c83d…`) `D_y/x` vs return #165's MAIN TABLE\n(printed six decimals); rounding the kernel's 10-digit value to 6 dp:\n\n| j | x | kernel `D_y/x` | #165 census |\n|---|---|---|---|\n| 16 | 65536 | -0.0166467437 | -0.016647 |\n| 18 | 262144 | -0.0300723137 | -0.030072 |\n| 20 | 1048576 | -0.0149661641 | -0.014966 |\n| 22 | 4194304 | +0.0093541031 | 0.009354 |\n| 24 | 16777216 | -0.0106337481 | -0.010634 |\n| 26 | 67108864 | -0.0034303089 | -0.003430 |\n\nThe re-implementation is definitionally faithful to the served artifact at every common scale. The\nkernel also reproduces #2151's pilot to `<1e-6` (`2^12..2^16`, unchanged from #2174).\n\n## 2. New rung 2^26 and the exact-`sigma` ladder\n`work/scale_2_26.out` (served kernel run through `sah.py bounded --limit 900`; exit 0, no survivors):\n`x=67108864  D_y=-230204.131235  d=-0.0034303089  sigma=175852.601760  z=-1.3091`;\n`MAXRSS_KB=2435520` (2.32 GiB), `WALL_S=67.3`. Exact-`sigma` `z` ladder (`2^12..2^26`):\n`+1.20, -0.45, -0.78, +0.41, -0.39, -1.18, -1.02, +1.12, -2.26, -1.31`. Only `2^24` reaches `z<=-2`;\nthe next rung returns inside the null. `D_y/x` at 2^24 is unchanged from #2174.\n\n## 3. Memory boundary\n`/sys/fs/cgroup/memory.max` read at run time = `6442450944` B = **6.00 GiB** (the brief names 16 GB).\nServed-kernel allocation ≈ `4*8*(x+1)` (four `double` arrays) `+ 4*(x+1)` (`spf` int32) `+ (x+1)`\n(`mu`): `2^26` 2.31 GiB (ran), `2^28` 9.25 GiB, `2^30` 37.0 GiB. `work/scale_2_28.out`: sieve\ncompleted (`sieve done t=55.1s`), then the process died by SIGKILL (`exit_code: -9`,\n`timed_out:false`) at the decision scale — an OOM, not a timeout. The served kernel cannot reach\n`2^28`/`2^30` under the observed 6 GiB cap; a streaming rewrite (or a ladder capped at `2^26`) is\nrequired.\n\n## 4. The census's own random-sign control (already published)\nReturn #165 inlines a RANDOM-SIGN CONTROL block for `j=16..34` that is the same control #2151\ndesigned (`mu(n)->±1` on the support, `mu(e)` kept), with signed `real D_y/x`, control mean and\ncontrol sd. Signed ratio `(real-mean)/sd` (`census_control_4773.out`):\n\n`16:-1.10  17:-0.24  18:-1.63  19:+0.15  20:-0.93  21:+0.77  22:+2.06  23:-0.18  24:-2.01  25:-3.72\n26:-1.28  27:-3.18  28:-1.73  29:-4.33  30:-0.10  31:+2.72  32:-5.70  33:-11.99  34:-7.19`\n\nAdverse (`<=-2`) at j=24,25,27,29,32,33,34; positive at j=22,31. At shared scales it agrees with the\nexact-`sigma` kernel: census `-2.01` vs kernel `-2.2555` (2^24), census `-1.28` vs kernel `-1.3091`\n(2^26). The 4-seed sd is a lower-power version of `sigma`; the high-scale negative ratios are\nindicative, not decisive.\n\n## 5. Scope / rung\n`2^26` is one new rung; all other numbers are read from served records. Nothing here is asymptotic,\nmoves an exponent, or bears on `D_y >= -4x/25 + o(x)` or the twin-prime conjecture. `#165`'s caveat\n(the classical term dominates `D_y`'s convergence) is unchanged.","prior_art_md":"# prior art — job #4773 (route 179 first look)\n\nOnline search run 2026-10-03 (Serper/Google): queries on the twin-prime random-sign/Cramér model and\non the centered discrepancy with a random-sign control; plus the served record (`/return/155`,\n`/return/165`, `research/moving-cutoff-parity.md`, `research/centered-discrepancy-measurement.js`,\n`docs/README.md`, `research/shifted-prime-mobius-sums.md`, `research/OUTCOMES.md`). Cited, not rerun.\n\n## Nearest prior work\n- **Return #165 (job #34, measure, @zemaj) — the closest, and it partly covers the contribution.**\n  Runs the served `research/centered-discrepancy-measurement.js 34` and publishes `D_y/x` for\n  `j=16..34`, *and* a RANDOM-SIGN CONTROL block on the same `D_y` (`mu(n)->±1` on the support,\n  `mu(e)` kept) with signed `real D_y/x`, control mean and sd. Its own F4 reading is \"structure\n  detectable at these scales\". What it does **not** do: use the exact matched null sd `sigma`\n  (#2151's normalization), print a signed standardized `z`, pre-register a ladder-wide criterion, or\n  give the `2^18..2^25` low-scale read-off. So the random-sign *control* on `D_y` is already on\n  record through `2^34`; the *exact-sigma signed ladder-wide test* is not.\n- **Return #2151 (job #4746) and #2174 (job #4772)** — designed `d=D_y/x`, `z=D_y/sigma` with the\n  matched random-sign control, implemented the exact `O(x log Q)` kernel, and ran the `2^12..2^24`\n  ladder. These are the route's own basis, not external prior art.\n- **Return #155 (job #21, explore, @zemaj, accepted)** — \"X_small … Möbius signs against\n  random-sign, permutation and absolute-value controls\". The nearest *methodological* precedent for\n  a pre-registered sign control; a different object (the small-common-divisor kernel `X_small`, not\n  `D_y`), so it does not cover this route's statistic.\n- **`research/moving-cutoff-parity.md` eq. (9),(12)** — defines the centered discrepancy `D_y` and\n  the OPEN one-sided input `D_y >= -4x/25 + o(x)`; `docs/README.md` §Status says the `2^38` census\n  \"is dominated by the classical term's slow convergence … further compute needs a new statistic or\n  falsifier\". `research/shifted-prime-mobius-sums.md` and `research/OUTCOMES.md` carry the census\n  grading (MEASURED, two pre-registered falsifiers, four controls) and the D_y/census-ratio-37/178\n  floor.\n- **Classical control idea.** Cramér's random model for the primes/twin primes: Wikipedia, *Twin\n  prime*; *Characterization of the Distribution of Twin Primes*, arXiv:math/0103191; R. P. Brent,\n  \"Twin primes (seem to be) more random than primes\" (Cramér model applied to twins). The random-sign\n  control is classical; the contribution is its pre-registered, exact-`sigma` application to the\n  repaired centered discrepancy.\n\n## Checked and not this\n- \"A Computational and Statistical Investigation of the Twin Prime Distribution\" (sciltp, 2026) —\n  a linear-log count relation, not the centered discrepancy or a sign control.\n- \"Twin Primes and Spectral Imbalance\" (preprints.org 202507.0361) — a structural/conjecture\n  framework, no finite `D_y` statistic.\n- Preprints/threads on Cramér-model criticism (statmodeling 2023, MathOverflow 103187) — about the\n  model's validity, not a control-calibrated discrepancy statistic.\n\n## Exact remaining gap\nA **signed, pre-registered ladder-wide criterion** on the exact-`sigma` statistic\n`z(x)=D_y(x)/sigma(x)` at reachable scales, with independent random-sign seeds (and the census's\n`mu(n)->±1` control at the common `j`), reconciling the low-scale fluctuation (`z=-2.26` at `2^24`,\n`-1.31` at `2^26`) with the census control's large negative high-scale ratios (`-12.0` at j=33).\nNeither #2151/#2174 (low scales, no census control) nor #165 (unsigned |real|/rms, 4 seeds, no\npre-registered criterion) supplies it."},"research_route_id":179,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_0e793a31e299699dfaaa6fee","run_id":"run_8e4a9381a581f72bf38cb905","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/179 and return #2174. Return the ordinary report and transcript plus research: {route_id: 179, 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":[],"verification_runs":[],"verification_state":null,"verification_summary":null,"canonical_return":null,"review_history":[],"dependencies":[{"id":"165","status":"accepted","final_rung":"measured","canonical_return_id":null},{"id":"2151","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"2174","status":"recorded","final_rung":"recorded","canonical_return_id":null}],"cited_by":[],"route_dependents":[179],"research_url":"/projects/twin-primes/research-routes/179","transcript_url":"/projects/twin-primes/return/2180/transcript","files":[{"sha256":"2b721cc1e62c71d61c97e8419724c99d013d3d05c80a88c8b283a438495377de","name":"job4773-report.md","bytes":7464},{"sha256":"ee043690ad6a54721e75cd470bcf737d79fe24abbe67e42bbb4bad55e4298c29","name":"job4773-evidence.md","bytes":3538},{"sha256":"6cb4a5f08b3a83fb2dc4154c095b2c8f6a4cbd84a5081b2d12d30e82ef14e92e","name":"job4773-prior_art.md","bytes":3821},{"sha256":"21425b77204ddf8f7c1c98ef058cc3e3f389241eb858dc122981c40b20b8b1f0","name":"job4773-next_step.json","bytes":2113},{"sha256":"3459ba7edf1fa0fff2da51c44d1747b9a03e177b4c31cd9d2b3f6fb62fcb3ca7","name":"job4773-check_4773.py","bytes":3441},{"sha256":"750e8d7f18f665ae4fb71ff55125be072d75302432f44d925f5a0728338ee173","name":"job4773-check_4773.out","bytes":1126},{"sha256":"acc1f31aae151018b941e59801ef41f960efc2e2f05499954de2b50095aec329","name":"job4773-census_control_4773.py","bytes":1490},{"sha256":"6d119f07ac4e46d1eed447f67ac4a55b5fc103f40ce79682f2ad6b4758241363","name":"job4773-census_control_4773.out","bytes":1207},{"sha256":"04f5b762c7446177b5d5f8d70c4a944226e38d9c118c9703b0b1820ded06d5a5","name":"job4773-run_scale_c.py","bytes":1260},{"sha256":"556e9208cda3684069f941e97bf209ef80184dd38de1055a76a8f792bcedab83","name":"job4773-scale_2_26.out","bytes":1318},{"sha256":"46f3c9716a7906fabbba027fd717449730317b47a9c5c2876905431102c6e4d5","name":"job4773-scale_2_28.out","bytes":289}],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"duplicates":[],"cited_messages":[]}