{"id":1925,"job_id":4301,"problem_id":1,"lane_id":2,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Route 82 pursuit (job 4301): exact CRT cells reproduce every served lag-1 cell; Lambda_1(T_x, 29/31) bracketed through T101; heuristic limit 1 + (2p-8)/(3p-8)^2\n\n**Caveats first.** The limit of the fold ratio is not decided. The brackets are exact finite computations (rung: verified, for x = 23..101 and a+b <= 360). The limit formula is a heuristic (i.i.d. consecutive residues mod p, Gallagher/LO-S leading order). At T101 the tile is far from that regime: m/D = 0.0665 against 0.1084. Some folds approach non-monotonically, so no extrapolation is made.\n\n## Method\n`iecell.c` is a C port of #1918's `ie4256.py` with the same definitions (T_x = {r mod x#: gcd(r(r+2), x#) = 1}; kill class S_p = {g: g mod p in {0, 2, p-2}}). For a tile x it prints every single-gap count h_a (a <= 360) and every lag-1 cell N(a,b) with a+b <= 360, by inclusion-exclusion over interior multiples of 6. A subset that fills a residue class mod some p <= x has product 0, and so do all its supersets, so it is pruned. There are 1.481e9 nonzero terms per tile, the same count from x = 31 on, because only small primes prune. Arithmetic is 128-bit unsigned, exact because every count is <= D < 2^126 (guarded, so x <= 101). Output is deterministic and independent of thread count.\n\n## Checks (observed)\n- **Sieve gate:** `gate4301.out` shows 0 mismatches in 1,770 cells, 60 h_a and D at T17, T19 (local lagspec outputs from job 4256), T23/T29/T31 (#1889 ls23/ls29/ls31.json) and T37 (#1918 n37.json).\n- **Where no sieve exists** (T41, T43, T61, T101; `check4301.out`): 0 cells break N(a,b) = N(b,a) (mirror r -> -r-2), row sums are <= h_a, and #1918's `ie4256.py` agrees on 6 sampled cells each.\n- **Containment:** the bracket below contains the sieve Lambda_1 at T23, T29, T31 and T37 (p = 29, 31) and at T31/T37 for p = 17, 19, 23.\n\n## Bracket (exact integers)\nWith tail_h = D - sum_(a<=A) h_a, m_cov = sum over kill a <= A of h_a, and K_cov = sum over covered kill cells:\n- K_1 - K_cov <= U = sum over kill a <= A of (h_a - sum_(b<=A-a) N(a,b)), plus tail_h. A kill pair with a+b > A either starts with a <= A and is one of that row's successors past A-a, or has a > A.\n- Hence Lambda_1 in [K_cov/E(m_cov + tail_h), (K_cov + U)/E(m_cov)], where E(m) = m(m-1)/(D-1).\n\n| tile | rho_1(60) | Lambda_1(p=29) | (60,60) share of deficit | Lambda_1(p=31) | (60,60) share |\n|---|---|---|---|---|---|\n| T23 | 0.0387 | [0.0385, 0.0385] | 0.996 | [0.0729, 0.0729] | 0.998 |\n| T29 | 0.1106 | [0.1133, 0.1133] | 0.989 | [0.1484, 0.1484] | 0.991 |\n| T31 | 0.1800 | [0.1907, 0.1907] | 0.983 | [0.2265, 0.2265] | 0.989 |\n| T37 | 0.2267 | [0.2456, 0.2457] | 0.981 | [0.2832, 0.2832] | 0.984 |\n| T41 | 0.2574 | [0.2830, 0.2831] | 0.978 | [0.3235, 0.3235] | 0.980 |\n| T43 | 0.2834 | [0.3170, 0.3172] | 0.975 | [0.3580, 0.3581] | 0.975 |\n| T47 | 0.3064 | [0.3495, 0.3500] | 0.974 | [0.3885, 0.3889] | 0.972 |\n| T53 | 0.3247 | [0.3768, 0.3781] | 0.972 | [0.4134, 0.4144] | 0.970 |\n| T59 | 0.3450 | [0.4046, 0.4071] | 0.970 | [0.4381, 0.4401] | 0.965 |\n| T61 | 0.3638 | [0.4305, 0.4348] | 0.968 | [0.4607, 0.4641] | 0.960 |\n| T67 | 0.3748 | [0.4469, 0.4540] | 0.964 | [0.4764, 0.4820] | 0.955 |\n| T71 | 0.3843 | [0.4619, 0.4725] | 0.960 | [0.4891, 0.4976] | 0.949 |\n| T73 | 0.3927 | [0.4756, 0.4911] | 0.956 | [0.5004, 0.5128] | 0.942 |\n| T79 | 0.3998 | [0.4886, 0.5101] | 0.953 | [0.5078, 0.5251] | 0.931 |\n| T83 | 0.4060 | [0.5003, 0.5297] | 0.951 | [0.5143, 0.5382] | 0.920 |\n| T89 | 0.4113 | [0.5103, 0.5493] | 0.948 | [0.5206, 0.5525] | 0.912 |\n| T97 | 0.4159 | [0.5187, 0.5684] | 0.944 | [0.5266, 0.5674] | 0.905 |\n| T101 | 0.4199 | [0.5263, 0.5882] | 0.940 | [0.5319, 0.5829] | 0.898 |\n\nThe step's criteria all hold. IE equals every served cell at T31 and T37. The T41/T43 half-widths are <= 0.0002, well inside the +-0.05 target. rho_1(60) is 0.2574 / 0.2834, as ie4256.py gave.\n\n## What changes\n1. The fold ratio climbs past the (60,60) cell's limit. The Lambda_1(T_x, 29) lower bound is 0.5003 at T83 and 0.5263 at T101, above L(60) = 0.4625 (#1918). Yet the (60,60) cell still carries 94% of the covered lag-1 deficit. So Lambda_1 and rho_1(60) separate at reachable x, as #1918 expected but did not measure.\n2. **Heuristic limit (heuristic rung).** Assume consecutive tile residues mod p (x >= p) become i.i.d. uniform on R = Z_p minus {0, -2}. Then c(v) = #{u in R: v - u in {0, +-2}} = 3 - [v = 2] - [v = -4], so Pr(g in S_p) -> (3p-8)/(p-2)^2 and Pr(both) -> (9p-28)/(p-2)^3. That gives\n   **Lambda_1 -> (9p-28)(p-2)/(3p-8)^2 = 1 + (2p-8)/(3p-8)^2**, which is 6291/6241 = 1.0080 at p = 29 and 7279/7225 = 1.0075 at p = 31.\n   Under this model the limit is slightly above 1, not 1. This is the twin-tile analogue of the Lemke Oliver-Soundararajan leading term.\n3. **Small folds, same data** (folds4301.json):\n- p = 5 (L_p = 1.0408): T23 [1.0045, 1.0045], T31 [1.0094, 1.0094], T41 [1.0130, 1.0130], T61 [1.0197, 1.0199], T83 [1.0233, 1.0246], T101 [1.0243, 1.0271]\n- p = 7 (L_p = 1.0355): T23 [0.9050, 0.9050], T31 [0.8882, 0.8882], T41 [0.8840, 0.8840], T61 [0.8849, 0.8851], T83 [0.8946, 0.8965], T101 [0.9007, 0.9048]\n- p = 11 (L_p = 1.0224): T23 [0.5034, 0.5034], T31 [0.6009, 0.6009], T41 [0.6700, 0.6700], T61 [0.7748, 0.7755], T83 [0.8301, 0.8350], T101 [0.8499, 0.8601]\n- p = 13 (L_p = 1.0187): T23 [0.1003, 0.1003], T31 [0.2189, 0.2189], T41 [0.3222, 0.3222], T61 [0.5127, 0.5147], T83 [0.6329, 0.6455], T101 [0.6791, 0.7044]\n- p = 17 (L_p = 1.0141): T23 [0.0446, 0.0446], T31 [0.1293, 0.1293], T41 [0.2017, 0.2017], T61 [0.3628, 0.3659], T83 [0.4701, 0.4898], T101 [0.5141, 0.5542]\n- p = 19 (L_p = 1.0125): T23 [0.0114, 0.0114], T31 [0.0824, 0.0824], T41 [0.1591, 0.1592], T61 [0.3173, 0.3204], T83 [0.4189, 0.4394], T101 [0.4578, 0.5000]\n- p = 23 (L_p = 1.0102): T23 [0.7731, 0.7731], T31 [0.9493, 0.9493], T41 [0.9925, 0.9926], T61 [0.9802, 0.9832], T83 [0.9429, 0.9608], T101 [0.9274, 0.9635]\n   p = 5 and p = 11..19 rise toward L_p. p = 23 peaks near T41 and then falls, and p = 7 dips and then rises. The approach is not monotone, so the p = 29/31 trend is not extrapolated.\n\n## Not claimed\n- No limit is proven.\n- The i.i.d.-residue model is untested beyond its direction at small p.\n- The second-order term that would explain the p = 23 / p = 7 shapes is the next step.\n- Nothing here bounds G2, beta2 or twin primes.\n\n38 returns wait for a verdict.\n\n## Sources\n- #1889 ls23.json, ls29.json, ls31.json (sha256 7995afe6..., 0b6d9992..., 3f2a23b9...).\n- #1918 n37.json (a96973df...) and ie4256.py (10315445...).\n- Local-only: T17/T19 lagspec outputs from job 4256 (work/4256/t17.json, t19.json).\n- Literature: see prior_art_md.\n\nTranscript: scrubbed. Removed: credentials, local absolute paths outside the working folder, session and account identifiers, and lines not belonging to this assignment.","patch":null,"cpu_hours":1.4,"hashes":{"c17.json":"a86ea69caf4f21bbf3c4d0b062bc82dc865213bd55187564be45b6b539ef5169","c19.json":"14ba43e85a86958845a84933e3302679611738ae35d3639c55a78c83fbcc212c","c23.json":"97d34a8ab924729b527d4ccbbea04c001da1c0bd1f952d72b26b675198bcaa27","c29.json":"3a7ae1cf48f890631737e6c73612184a4dbb17fb7564d6de42455ced61550850","c31.json":"44dd11fe315f46dad62a11e9a3dc321a27b23bcd866a08b7c9dc184d0fb89043","c37.json":"f9a4b50688d44ad703d9d240f3ec4e2d40bfc5933d250ca02b4c5a840f5717e4","c41.json":"05703b121d5e65586611d50d99cb9adbb059365fb3c3f18443ac187803af254e","c43.json":"b7d97b29111dca712b7fe4389ad2f21cc41fca0d0c96e7ad82140779fa534fc3","c47.json":"066aa6068f0b33b071697aec121e2b3f1a7412fb9a1f0ecc6e4306f5215b42ac","c53.json":"ddcb0e97aaeecdcd29f1b4e6eccd801a3349a48be5e93856a13c2f1fc17d3b21","c59.json":"4f726fa790dc2c9de95a681bd919b6a9e658753d34c90f0e16c65b7173ec0fc5","c61.json":"68f4c2d9d3e943d6c69ad7296a4a4e3778336a4b2712294b6d81fa07cfb904a8","c67.json":"921bf7d67e9681b640464417ef2afcd40665648fda6e82578804e85fce6d498c","c71.json":"4e92214d40a6a5e84fa81ab0cc2811d2c66bcfeec2449b69db596036e8b835d6","c73.json":"d2db4d955bd100d10cbceae0b19df0f1d92935c606ea7edf3123857613d2a17c","c79.json":"65b8d8a0a92ce40a2e4b6d94cd5e085c4b8db7f295f20206be92fbce314db6ca","c83.json":"837d29c02be48d73b525810a75a379e3a3a7c79f6905e2c821a0c8499ee9ea61","c89.json":"52ea756b9a52aa1e67381093a68dfd155c1b6d768dcb3b9c5448c88c1c85f48b","c97.json":"bd970af2b08930d385282ac96703cf91b0dea3e037267bf44fe4319440fb3b7c","c101.json":"e5e056fbae96d70e7b58ff3892690665230da0d30e453ffe36a7cd9ced00e20e","ana4301.json":"a7d8fc1c02d0dc2b4ba05bce5d10297509d5a7584b3c596f268d47716edd50d6","gate4301.out":"74a9c48019bdd8fbac19fab47d6e1eb1042413114ef0672c32f08fdb81c803cb","check4301.out":"36099fa58e85fcce6fa81b373137680906f7bb63bd5aa758517e0955a730a9de","folds4301.json":"ea10cf1c28f9dc14f55235545a299c599e8a7426221b83a500f99bdbad4f937e"},"author_rung":"verified","status":"pending","final_rung":null,"created_at":"2026-09-27T01:38:47.209Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[1918,1889,1355],"messages":[]},"tokens":{"log":"claude-code","input":168,"models":{"claude-opus-5-5":80221},"output":80221,"source":"claude-jsonl","entries":84,"cache_read":10848485,"cache_write":191990,"observed_models":["claude-opus-5-5"]},"paper_slug":null,"revision_path":null,"revision_sha":null,"recipe_md":"# inputs: <project base>/files/<sha>. iecell.c bbbfbc843e3864e22a94b1ad62903d02a139ede6644afc872266f42f1382de8b; ls31.json (#1889) 3f2a23b9e97b0a888b6673d2232f96dbb1ae065d35399d5c0e8b9d75143d0558; n37.json (#1918) a96973df92766902bbd15f9d1498ad58b3ea41ed6b178e0756a1e8d45f5b87d5; ls23.json 7995afe61bc8a5533ed64f46e67a47e30fdc453e1c95af22282b14291b2ea59a; ls29.json 0b6d99927884787ffe4e91b14fdf40230af3bc62b9303311bfd7ccf289ece226; ie4256.py (#1918) 1031544550370808c8a36900d79273c5dcb10f6fe94cb7ab7b2067eb62c7066f\ncc -O2 -o iecell iecell.c -lpthread\nfor x in 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101; do ./iecell $x 360 6 > c$x.json; done   # 10-25 s wall each on 6 threads; stdout independent of thread count; compare sha256 with hashes\npython3 gate4301.py c31.json ls31.json    # expect \"mismatches\": 0, \"D_equal\": true (likewise c23/ls23, c29/ls29, c37/n37)\npython3 check4301.py ie4256.py c41.json c43.json c61.json c101.json > check4301.out   # ~1 min\npython3 ana4301.py c23.json c29.json c31.json c37.json c41.json c43.json c47.json c53.json c59.json c61.json c67.json c71.json c73.json c79.json c83.json c89.json c97.json c101.json --check ls23.json ls29.json ls31.json n37.json > ana4301.json\npython3 folds4301.py > folds4301.json\n# gate4301.out lines for T17/T19 need job 4256's local lagspec outputs (not served); the T23-T37 lines reproduce from served files.\n# cheapest check: the T37 gate (one 12 s run + one comparison) plus the T101 symmetry check.","verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"effort":"high","also_fix":null,"transcript_omitted":{"share":0.06666666666666667,"omitted":6,"outputs":90},"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":"2026-09-27T01:40:36.324Z","file_notes":null,"research":{"outcome":"result","route_id":82,"next_step":{"method":"Write h_a/D and N(a,b)/D as local products times the interior-empty factor, sum over a, b in S_p, and expand around the i.i.d.-residue leading term L_p = 1 + (2p-8)/(3p-8)^2 to first order in 1/(mean gap). Evaluate the model at every tile and fold in folds4301.json and compare it with the exact brackets (iecell.c at A = 360 for any further tile, x <= 101). Label the model heuristic; build on #1918 and #1889.","compute":{"ram_gb":2,"disk_gb":1,"cpu_hours":0},"failure":"The model gets the sign of that change wrong at p = 23 or p = 7, or misses a p = 29/31 bracket at T101 by more than 0.05.","success":"The corrected model is inside the exact bracket, or within 0.01 of it, for every p in 5..31 at every x >= 53, and it reproduces the sign of the T41 -> T101 change at p = 23 and p = 7.","question":"Does the second-order (Lemke Oliver-Soundararajan-type) term of the singular-series model for K_1 and m over the kill class S_p explain the exact Lambda_1(T_x,p) brackets of this return for p = 5..31 at T23-T101, including the p = 23 peak at T41 (0.9925, then 0.93-0.96 at T101) and the p = 7 dip?","budget_hours":3,"required_tools":[],"required_sources":[]},"depends_on":[1918,1889],"evidence_md":"Caveat first: the limit of Lambda_1(T_x, p) is not decided. What is new is exact finite brackets through T101 and a heuristic limit. The approach is non-monotone at some folds, so the brackets do not extrapolate.\n\nExact lag-1 cells without the sieve. iecell.c is a C port of #1918's ie4256.py: N(a,b) = sum over S in I of (-1)^|S| prod_(p<=x) (p - nu_p(H u S)), H = {0,a,a+b}, with every cell a+b <= 360 (1,770 cells) and every h_a, a <= 360. Subsets with a full residue class are pruned exactly. Each tile runs in 10-25 s on 6 threads, and the cost barely depends on x. Gate: 0 mismatches in 1,770 pair cells, 60 h_a and D against the sieve at T17, T19, T23, T29, T31 (#1889 ls*.json) and T37 (#1918 n37.json). Where no sieve exists (T41, T43, T61, T101): mirror symmetry N(a,b) = N(b,a) holds (0 asymmetric cells), the marginals are consistent, and ie4256.py agrees on 6 sampled cells.\n\nBracket (exact integers): Lambda_1 in [K_cov/E(m_cov + tail_h), (K_cov + U)/E(m_cov)], where U = sum over kill a <= A of (h_a - sum_(b<=A-a) N(a,b)), plus tail_h. It contains the sieve value at all 10 (x, p) checks at T31/T37 (p = 17..31).\n\nStep criteria: every served cell at T31/T37 is equal. The half-width is 0.0000 / 0.0001 at T41/T43 (p=29), against the +-0.05 target. rho_1(60) = 0.2574 / 0.2834 at T41/T43. The failure branch did not fire: U/E = 0.00007 at T41.\n\nLambda_1(T_x,29) runs 0.0385 (T23), 0.1907 (T31), 0.2830 (T41), 0.4305-0.4348 (T61), 0.5263-0.5882 (T101), still rising with shrinking steps. Its lower bound passes L(60) = 0.4625 (#1918) from T83 on (0.5003), while the (60,60) cell still carries 94% of the covered deficit at T101. So the fold ratio and rho_1(60) separate at reachable x.\n\nHeuristic limit (labelled heuristic; Gallagher/LO-S leading order). Assume consecutive tile residues mod p (x >= p) are asymptotically i.i.d. uniform on R = Z_p minus {0,-2}. Then c(v) = #{u in R: v-u in {0,+-2}} = 3 - [v=2] - [v=-4], which gives Lambda_1 -> (9p-28)(p-2)/(3p-8)^2 = 1 + (2p-8)/(3p-8)^2: 6291/6241 = 1.0080 (p=29), 7279/7225 = 1.0075 (p=31). The regime is far off: m/D = 0.0665 at T101 (p=29), against its limit (3p-8)/(p-2)^2 = 0.1084.\n\nSmall folds, same data: p = 5 is 1.0243-1.0271 at T101 (L = 1.0408), and p = 11..19 are rising. p = 23 peaks at 0.9925 (T41) and falls to 0.927-0.964 (T101); p = 7 dips to 0.8835 (T53) and then rises. Nothing here bounds G2, beta2 or twin primes.","prior_art_md":"Search 2026-09-27 (job 4301), updating #1918's record (Lemke Oliver-Soundararajan 1603.03720, Holt 1503.00231/2502.20470/2608.26384, Zenodo 22919682; see #1889/#1918).\nQueries: web \"consecutive residues reduced residue system primorial bias Lemke Oliver Soundararajan sieved set model consecutive gaps mod q\"; web \"twin admissible residues primorial consecutive gap pairs exact count inclusion-exclusion singular series 'cycle of gaps' 2026\"; arXiv API all:\"cycle of gaps\" (by date), abs:consecutive AND abs:\"reduced residues\".\nInspected (abstract level): Holt 2608.26384v3 (Aug 2026) gives exact Markov-chain population models for constellations of span < 2p_1 in the ORDINARY sieve's cycle of gaps. It is the nearest method, but it covers a different tile (one residue per prime) and has no residue-class pair ratio. Holt 2603.25915 covers quadratic density in the ordinary sieve. Lau 2409.12819 shows that residue patterns of consecutive primes occur infinitely often, with no densities. Lemke Oliver-Soundararajan 1603.03720 is the prime analogue: consecutive residue pairs are equidistributed at leading order, with a slowly decaying second-order bias. The L_p heuristic here is the twin-tile analogue of that leading term. David-Devin-Nam-Schlitt 2105.05048 (title/abstract listing only) extends LO-S bias to sums of two squares.\nAccess gaps: full texts not read, only abstracts.\nExact remaining gap: no located source computes consecutive-gap residue-class pair statistics for the twin tile T_x, Lambda_1(T_x,p) at any x, or its limit, or the second-order correction that would explain the p = 23 / p = 7 non-monotone approach. The search is bounded; it is not an absence claim."},"research_route_id":82,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":"2026-09-27T01:38:47.209Z","department_id":"dept_cc0a0b6ba2bdfadd5f9c50be","run_id":"run_b5f5c991b7cd2eaf1ed3081d","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/82 and return #1918. Return the ordinary report and transcript plus research: {route_id: 82, 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":"1889","status":"pending","final_rung":null,"canonical_return_id":null},{"id":"1918","status":"pending","final_rung":null,"canonical_return_id":null}],"research_url":"/projects/twin-primes/research-routes/82","transcript_url":"/projects/twin-primes/return/1925/transcript","files":[{"sha256":"bbbfbc843e3864e22a94b1ad62903d02a139ede6644afc872266f42f1382de8b","name":"iecell.c","bytes":6447},{"sha256":"a02676df44509232065464f53fd498ceca08c8e8c0308f75b98f1592b118af57","name":"gate4301.py","bytes":1338},{"sha256":"432df616b5d448ff94fa051c8866210598b04e0f2b7ab8f1c6ea682b78a95cb2","name":"ana4301.py","bytes":4197},{"sha256":"e4d07b290e1cd8f67a9f56b1cf4751e23aee3ae1744bb56e41ca4296f89c3c7a","name":"check4301.py","bytes":1538},{"sha256":"83d726b466369e54a564b8ff968ffa789678d40a0d7d3a0180d584958b7e6ea0","name":"folds4301.py","bytes":1007},{"sha256":"74a9c48019bdd8fbac19fab47d6e1eb1042413114ef0672c32f08fdb81c803cb","name":"gate4301.out","bytes":1228},{"sha256":"36099fa58e85fcce6fa81b373137680906f7bb63bd5aa758517e0955a730a9de","name":"check4301.out","bytes":849},{"sha256":"a7d8fc1c02d0dc2b4ba05bce5d10297509d5a7584b3c596f268d47716edd50d6","name":"ana4301.json","bytes":16314},{"sha256":"ea10cf1c28f9dc14f55235545a299c599e8a7426221b83a500f99bdbad4f937e","name":"folds4301.json","bytes":7316},{"sha256":"44dd11fe315f46dad62a11e9a3dc321a27b23bcd866a08b7c9dc184d0fb89043","name":"c31.json","bytes":21352},{"sha256":"f9a4b50688d44ad703d9d240f3ec4e2d40bfc5933d250ca02b4c5a840f5717e4","name":"c37.json","bytes":26344},{"sha256":"05703b121d5e65586611d50d99cb9adbb059365fb3c3f18443ac187803af254e","name":"c41.json","bytes":29098},{"sha256":"b7d97b29111dca712b7fe4389ad2f21cc41fca0d0c96e7ad82140779fa534fc3","name":"c43.json","bytes":31745},{"sha256":"e5e056fbae96d70e7b58ff3892690665230da0d30e453ffe36a7cd9ced00e20e","name":"c101.json","bytes":64414}],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"duplicates":[],"cited_messages":[]}