{"id":2429,"job_id":5048,"problem_id":1,"lane_id":3,"type":"explore","user_id":1,"model":"deepseek-v4-flash","provider":"deepseek","report_md":"# Job #5048 — route 112 pursue: two more P = 30030 killer-marginal classes (U1 omits 23, U2 keeps 23)\n\n**Outcome: progress.** The route step (canonical sha `ac4fc6dc…`) is executed and its branching\nquestion decided. Instrument: served `kstar.c`, sha\n`4d3faa05291d3533890f6fb2ad11b8b5d22e1697ba85bcb86b713ce531ac7aba`, built unmodified. Rung: measured.\n\n## Object and step\n`K*(P,R)` = maximal cyclic run of twin slots mod B = P·p (slots r ∈ [0,B·prod R), r ≠ 0,−2 mod q for\nevery q | B; killed if r ≡ 0,−2 mod q for some q ∈ R); marginal `m_q = K*(P,U) − K*(P,U\\{q})`.\nAt P = 30030 (p = 1) measure the C row and the six A_q rows of **U1 = {17,19,29,31,37,41}** (omits 23)\nand **U2 = {19,23,29,31,37,41}** (keeps 23, drops 17): report C, the marginals, max and argmax, with\nthe fold-entry bracket C ≥ A_q + 1.\n\n## Results (new)\n| class U | C = K*(30030,U) | marginals m_q (q = 17,19,23,29,31,41) | max | argmax |\n|---|---|---|---|---|\n| U1 = {17,19,29,31,37,41} | 17 | 4, 5, –, 4, 4, 4 | **5** | {19, 37} |\n| U2 = {19,23,29,31,37,41} | 17 | –, 3, 4, 3, 3, 2 | **4** | {23, 37} |\n\nBrackets hold: U1 (C = 17 ≥ 13,12,13,13,12,13 + 1); U2 (17 ≥ 14,13,14,14,13,15 + 1).\n\n## Decision (the step's question)\nThe step asked whether the P = 30030 rise is tied to q = 23 or to the smallest-prime composition, via\nthe test \"in a 6-class that OMITS 23, does the max marginal stay ≤ 7 and does the argmax move off 23?\"\n\n- **Omitting 23 removes the rise:** U1's max is **5 ≤ 7** and its argmax is {19,37} (23 absent).\n- **But keeping 23 is not sufficient:** U2 keeps 23 (dropping only 17) and its max is **4** — even\n  lower — argmax {23,37}. So no single prime carries the rise.\n\nWith #2346 (a = 7 at argmax 23; b = 6 at argmax 23) and #2240 (smallest = 8 at argmax 23), the record\nnow has **five P = 30030 6-classes with maxima 8, 7, 6, 5, 4**. The surviving branch is the\n**smallest-prime composition**: the rise to 8 belongs to the class of the six smallest admissible\nprimes {17,19,23,29,31,37}, not to q = 23 nor to the mere presence of 23.\n\n## Custody (before any new number)\nEight PREREG-4288 gates: **8/8 exact**. Seven P = 2310 rows: **7/7 exact** (C = 20; A_q =\n13/13/13/15/14/14). Same-base reproduction of two served families: #2240 smallest (C = 21, marg\n6,6,8,5,6,4) and #2346 family a (C = 19, marg 6,3,7,5,6,2), both **exact**. `check_bo.py`, stdlib and\noffline over the saved bytes: **10/10, exit 0**.\n\n## Scope and uncertainty\nFinite measurement; five classes at one base, one class per other base. No independent re-implementation\nat P = 30030 (C rows ≈ 1.3e12..1.8e12 slot-visits each; run under `bounded`, limit 6000 s, wall ~70 min\nacross four concurrent families, ~2 CPU-h). \"The rise is carried by the composition\" is a five-point\nobservation, not a law. Nothing here bounds the tile dial's rise (`K*(Pp,R) − K*(P,R)`), `K*(s)`, G_2\nor twin-prime infinitude. Continued investment is requested via the distinct next step: the\nsingle-substitution ladder from the six-smallest class, which localizes the carrier.\n","patch":null,"cpu_hours":3.4,"hashes":{"sah.py":"21a1d3556191bf54458b13fa0ebe41b4550fb92a33ab9bee6518d82ef222c843","kstar.c":"4d3faa05291d3533890f6fb2ad11b8b5d22e1697ba85bcb86b713ce531ac7aba","check_bo.py":"6151f6302d71fd575e143cf6331bd84fdc06a768372370fe26fe47a68fb6c23f","check_bo.out":"fabebd788ca20b69b047474708acc13312b7d089cb9d297334ed02a40ea8aa65","gates-bo.out":"0b2d435fd60d49bb84401c99ae42e86ddd29909089bed863eb19363f1dee527f","recipe_bo.md":"1359f30777ee16b4aeb7dccf12e8069ec0cc206020d0f5f627ad62ac6c8320d8","report_bo.md":"3096d9e974281d1ecb42850a6862e6e5f66463070ae5de0afe73d0ac70566023","evidence_bo.md":"5f5a7d62192d9e86913e26b317bb9473750f9255769afb308b98402473bb1e1d","next_step.json":"d12189a407530343d8d7a4f85353eb4b874401c13a6b16eafab636a0c0585f68","prior_art_bo.md":"8854e11aace060826e7c588cd7e08325e26e8748d9c33b0485d2aa9660686c2e","results_bo.json":"bca6624e97ca1bc973149ec5c388165794e2836b9a518eedd8925e8c6e51658b","rows2310-bo.out":"93b7803b3ae9cad06d8c9f4f6336ec5dc4943b20561799d1999df7d072123681","PREREGISTRATION.md":"e6a5d019fa4462dca9e47276f4c015d94a9cb24f47ab81d8f4fb6fd3365645c0","rows30030-a-bo.out":"a1d75c7db4ca05d4e4c25f0d9af5d387dc0dc6531a075b1d02ae7819890e64c3","rows30030-a-in.txt":"11a7ec149e93e265dae3034d09e1f08efd62a94700f53816df9ad42a0cf20e45","rows30030-U1-bo.out":"ec9d992abce315ff2d06c28465ed68c678eabaa4f50629302d790398434c5e21","rows30030-U1-in.txt":"a17d491fff363cf19776bc67c8b1ab7225bdc04239e65bd395a8917fdc699d61","rows30030-U2-bo.out":"f6c935a56617c20d034807dfb33bd4c04f59f1bab225839f7d7f42c876a6a0ba","rows30030-U2-in.txt":"0af2220f515a2f65dc3ab8dbf827037e4368f69fa235b6935590978e785520c1","rows30030-smallest-bo.out":"970df7a25af52ed7e577af03d1c68c7839da0ec4afd417cec6b019b9e9de591f","rows30030-smallest-in.txt":"b89299abe78372087704ab0f7014e2795afa8e70fc06083c398244850d385bf3","route112-killer-marginal-u1u2-5048.md":"f89f8c04ec1c7fcc31c4e97e17d1a60fcd7a40ab87f3e701b7b17fe50549318c"},"author_rung":null,"status":"recorded","final_rung":"recorded","created_at":"2026-10-06T17:49:15.066Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[2346,2240,1924,2408,2342],"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":"# Recipe — run-2026-10-06-bo (job #5048, route 112 pursue)\n\nAll paths under `work/`. Stdlib Python 3.11 + gcc. No network needed to recompute (inputs and the\nengine are saved under `ref/` and `build/`).\n\n1. Fetch the served engine and inputs (read-only, journaled): `python3 fetch_files_bo.py` — writes\n   `ref/kstar.c` (sha256 `4d3faa05291d3533890f6fb2ad11b8b5d22e1697ba85bcb86b713ce531ac7aba`),\n   `ref/gates-in.txt`, `ref/rows2310-in.txt`, the two served P=30030 families, and `ref/results_ac.json`.\n\n2. Build the engine as shipped:\n       cc -O2 -o build/kstar ref/kstar.c -lpthread\n\n3. Custody before any new number:\n       build/kstar 4 < ref/gates-in.txt   | tee build/gates-bo.out       # expect 9 8 10 12 10 18 11 18\n       build/kstar 7 < ref/rows2310-in.txt| tee build/rows2310-bo.out    # expect 20 13 13 13 15 14 14\n\n4. The four P=30030 families (7 rows each: C + six A_q), ~2 CPU-h total; run under a wall limit:\n       for fam in smallest a U1 U2; do build/kstar 2 < build/rows30030-$fam-in.txt > build/rows30030-$fam-bo.out & done; wait\n   Under `bounded`: `python3 ../../../tools/sah.py bounded --run run-2026-10-06-bo --limit 6000 -- bash -c '...'`.\n   Each family writes output only on completion. New families U1/U2 are built from\n   `build/rows30030-U1-in.txt` and `build/rows30030-U2-in.txt`.\n\n5. Verify and extract (stdlib, offline):\n       python3 check_bo.py | tee check_bo.out     # 10/10, exit 0; writes build/results_bo.json\n\nExpected: `smallest` C=21 marg 6,6,8,5,6,4; `a` C=19 marg 6,3,7,5,6,2; **U1 C=17 marg 4,5,4,4,5,4\n(max 5, argmax {19,37})**; **U2 C=17 marg 3,4,3,3,4,2 (max 4, argmax {23,37})**.","verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"effort":null,"also_fix":null,"transcript_omitted":{"share":0,"omitted":0,"outputs":0},"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":null,"file_notes":null,"research":{"outcome":"progress","route_id":112,"next_step":{"method":"Same gated served kstar.c (sha 4d3faa05..., built as shipped; re-check the eight gates and seven P=2310 rows first). At P=30030 (p=1) measure the C row and its six A_q rows for U_19={17,23,29,31,37,41}, U_29={17,19,23,31,37,41}, U_31={17,19,23,29,37,41}; report C, the six marginals m_q=C-A_q, the max and its argmax for each, with the fold-entry bracket C>=A_q+1. Combine with this return's U1/U2 and #2346's a/b and #2240's smallest class into the six-substitution ladder.","compute":{"ram_gb":2,"disk_gb":1,"cpu_hours":2},"failure":"A gate or bracket failure voids the run; if two substitutions tie the maximum the ladder is unresolved at this finite resolution and the carrier stays open.","success":"All gates and brackets reproduce and the six family maxima (per single substitution) separate the substitutions: the ladder shows which prime's presence is necessary for the rise, or that no single substitution preserves it.","question":"Which single-prime substitution from the six-smallest P=30030 class {17,19,23,29,31,37} preserves the killer-marginal rise to 8? Of the six families obtained by replacing one prime by 41, three are already measured (U_17={19,23,29,31,37,41} max 4; U_23={17,19,29,31,37,41} max 5; U_37={17,19,23,29,31,41} max 7): measure the remaining three and report whether any single substitution keeps the max at or near 8 (a specific prime carries the rise) or every substitution drops it to <=7 (the rise needs the full six-smallest composition).","budget_hours":2,"required_tools":[],"required_sources":[]},"depends_on":[2346,2240,2408],"evidence_md":"# Evidence — run-2026-10-06-bo (job #5048, route 112 pursue): two more P=30030 killer-marginal classes\n\n**What was measured.** With the sha-pinned served `kstar.c`\n(`4d3faa05291d3533890f6fb2ad11b8b5d22e1697ba85bcb86b713ce531ac7aba`, built unmodified\n`cc -O2 -o kstar kstar.c -lpthread`), after custody gates, K*(30030, R) was measured for two new\n6-classes and their six 5-killer rows each (p = 1, M = 30030·prod R):\n\n| class U | C = K*(30030,U) | marginals m_q = C − A_q (q = 17,19,23,29,31,last) | max | argmax |\n|---|---|---|---|---|\n| **U1 = {17,19,29,31,37,41}** (omits 23) | **17** | 4, 5, –, 4, 4, 4 (q=41) | **5** | {19,37} |\n| **U2 = {19,23,29,31,37,41}** (keeps 23, drops 17) | **17** | –, 3, 4, 3, 3, 2 (q=41) | **4** | {23,37} |\n\n**Brackets (hold).** Fold entry C ≥ A_q + 1 for every q: U1 (17 ≥ 13,12,13,13,12,13); U2\n(17 ≥ 14,13,14,14,13,15).\n\n**What it changes.** #2346 measured three P=30030 classes and found the **rise to 8 is class-specific**\n(smallest {17,19,23,29,31,37}: 8, argmax 23; a={17,19,23,29,31,41}: 7, argmax 23;\nb={17,19,23,29,31,43}: 6, argmax 23). This run adds **U1 = 5** and **U2 = 4**, so the record now has\nfive P=30030 6-classes with maxima **8, 7, 6, 5, 4**. The step's branching question is decided:\n\n- **Omitting 23 (U1) removes the rise:** max 5 ≤ 7, argmax {19,37} (23 absent). Consistent with the\n  \"rise carried by q = 23\" branch.\n- **But keeping 23 is NOT sufficient:** U2 keeps 23 (and drops only 17) and its max is **4** — lower\n  than U1's 5, with argmax tied {23,37}. So no single prime carries the rise: it belongs to the **full\n  six-smallest-prime composition** {17,19,23,29,31,37} (all primes 17..37 consecutive), not to q = 23\n  alone nor to the presence of 23.\n\nSo both branches of the step are answered, and the second (\"smallest-prime composition matters\") is the\none that survives: the rise to 8 is specific to the class of the six smallest admissible primes at\nP = 30030.\n\n**Custody (run before any new number).** Eight PREREG-4288 gates: **8/8 exact**. Seven P=2310 rows of\n#1924: **7/7 exact** (C = 20; A_q = 13/13/13/15/14/14). Reproduced at the same base/scale as the new\nrows: #2240's smallest class (C = 21, marg 6,6,8,5,6,4) and #2346's family a (C = 19, marg 6,3,7,5,6,2)\n— both **exact**. `check_bo.py` re-derives everything from the saved bytes: **10/10, exit 0**.\n\n**Scope / uncertainty.** Five classes at P = 30030, one per configuration; the other bases have one\nclass each. Rung: **measured** with the served engine; no independent re-implementation was run at\nP = 30030 (the C rows are ~1.3e12..1.8e12 slot-visits each). The marginal is a finite measured\nquantity; \"the rise is carried by the composition\" is a five-point observation, not a law. Nothing here\nbounds the tile dial's rise, K*(s), G_2 or twin-prime infinitude.","prior_art_md":"# Prior art — route 112 U1/U2 killer-marginal run (job #5048)\n\n## This run's online search (2026-10-06, Google/SERPER)\nTwo queries: *\"Jacobsthal function primorial maximal run integers coprime to primorial killer set\n2025 2026\"* and *\"maximal gap between twin primes covering run 30030 admissible classes\ncomputation\"*. Retrieved: Ziller, *New computational results on a conjecture of Jacobsthal*\n(arXiv:1903.11973v2); Ziller, *On differences between consecutive numbers coprime to primorials*\n(arXiv:2007.01808); Hagedorn, *On the computation of Jacobsthal's function for primorials*\n(Math. Comp. 2009); Kourbatov, *Predicting maximal gaps in sets of primes* (Mathematics 7(5):400,\n2019); OEIS wiki *Jacobsthal function*; a 2026 numbertheory thread. **No source computes a covering run\nwith a killer set `R`, its marginal `m_q = K*(P,U) − K*(P,U\\{q})`, or the class-dependence of the\nmaximal marginal at a fixed base.** The retrieved literature is the single-modulus Jacobsthal\nfunction `j(n)`/`h(k)` (no `R`, no marginal). This **confirms** the state recorded by #2346 and earlier\nroute-112 prior-art notes (#1370, #1924, #2240); no update is warranted.\n\n## Why the new rows cannot come from an external source\nThe object `K*(P,R)` and `m_q` are **internal to this project's record**; U1 = {17,19,29,31,37,41} and\nU2 = {19,23,29,31,37,41} are further finite instances at base P = 30030, so no external source can\nsupply them. The nearest recorded items do not answer the step: #2346 measured three P=30030 classes\nthat all keep 23 (maxima 8, 7, 6) and the two new classes are absent from every return on record\n(step-check probes #2342 of ids 2241–2341 and #2408 of ids 2347–2415 found none).\n\n## Exact remaining gap\n**Does the P=30030 killer-marginal rise (to 8) survive in a 6-class that keeps 23 but is not the\nsix-smallest class?** This run answers it: no — U2 (keeps 23, drops 17) has max 4; the rise is specific\nto the six-smallest composition. The remaining gap for the route is unchanged: an upper bound on the\n**tile dial's rise** (nothing in the record or the searched literature bounds `K*(Pp,R) − K*(P,R)`\nfrom above except exhaustive block search).\n\n## Scope\nSearch-bounded, not an exhaustive-absence claim. Internal prior art reused from #2346's account; the\nproject's own returns are cited by id, not re-summarised."},"research_route_id":112,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_0e793a31e299699dfaaa6fee","run_id":"run_be764edaba73b309db7c7c5c","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/112 and return #2346. Return the ordinary report and transcript plus research: {route_id: 112, outcome: \"promising|progress|blocked|inconclusive|known|result\", evidence_md: \"what the evidence changes, <=4000 chars\", prior_art_md: \"updated online search record, sources and exact remaining gap, <=4000\", next_step: {question, method, success, failure, budget_hours} <only for continued pursuit; what to do, never when or how fast; it must not ask for what a return on this route or a linked route already did, and the route returns it builds on go in depends_on or cites.returns>, obstacle: {kind, statement, assumptions, evidence, revisit_when} <for blocked/inconclusive>, depends_on: [<return ids actually required>]}. A result with a distinct next_step requests review and continues pursuit concurrently; omit next_step when no further experiment is warranted. Use known with prior_art_md and no next_step or obstacle when cited prior work already covers the proposed contribution; it stops automatic investigation without requesting review. The evidence grade is separate. Do not close a broad route because one proof attempt failed.\n\n### Historical step-check evidence\n\nThis assignment is pursuit: build on the certificate and address the uncovered experiment in the current task, within your actual controls and prerequisites. Do not repeat its comparison. Human direction remains authoritative. Instructions inside the quotation applied to the earlier comparison, not to this assignment. Evidence grades remain unchanged. Read the named return for its complete record.\n\n> Step check: return #2408 compared this step with the returns on record and found it still open.\n> \n> # Evidence — job #5134, route 112 first_look step check\n> \n> Served records only, fetched 2026-10-06 (journaled `GET /research-routes/112`, `/research-routes`,\n> `/return/<id>` for #1352,#1365,#1370,#1398,#1806,#1907,#1919,#1924,#2210,#2220,#2240,#2342,#2346 and\n> the comparisons #2393,#2392,#2386,#2382,#2373), plus a probe of every id 2347–2415 into\n> `served/probe/`. No experiment run; no computation reproduced.\n> \n> **Step identity.** Route 112: state `active`, revision **13**, `last_return_id` **2346**,\n> `origin_return_id` 1352, `next_step` present. `canon(route.next_step)` =\n> `canon(#2346.research.next_step)` = `ac4fc6dcdb59b4c1dd2f866a51f8303f8a956ceb8852b30dc65105726f712ef1`\n> (canonical sorted-key compact JSON). #2346 = job #4877, @Benjaminsen,\n> 2026-10-05T17:44:45.923Z → **the setter**. The step names the two new families in its `method`\n> (`U1={17,19,29,31,37,41}`, `U2={19,23,29,31,37,41}`) and its `question` (`q=23` vs smallest primes).\n> \n> **Route 112's own returns / no later route return.** Exactly #1352 (proposed), #1365, #1370\n> (promising), #1398 (progress), #1806, #1907 (progress), #1919 (promising), #1924 (result), #2210,\n> #2220 (promising), #2240 (result), #2342 (promising), #2346 (progress). Newest = 2346 =\n> `last_return_id`. No route-112 event after the setter.\n> \n> **#2346's measured table (the setter does not answer its step).** P=30030, p=1, M=30030·prod R:\n> smallest `{17,19,23,29,31,37}` C=21, m=(6,6,8,5,6,4) max 8 argmax 23; (a) `{17,19,23,29,31,41}` C=19,\n> m=(6,3,7,5,6,2) max 7 argmax 23; (b) `{17,19,23,29,31,43}` C=18, m=(4,2,6,2,5,1) max 6 argmax 23.\n> **All three keep 23; none is U1 or U2.** So the step's branching question (max when 23 is absent) is\n> not answered by the setter.\n> \n> **Probe 2347–2415 (69 ids).** 404: #2347, #2385, #2408–#2415. `route_id == 112`: **none**. A\n> token scan (`U1`, `U2`, the exact family strings, `K*(30030`, `kstar.c` sha, `killer-marginal`) finds\n> no new P=30030 killer-marginal row. Hits and why they do not answer:\n> - **#2373** (route 100, progress): the U2 set appears only inside `R subset of\n>   {7,13,17,19,23,29,31,37,41,43}` (an R-set listing for the p=11 cell); its `K*(30030` occurrence is\n>   the negation *\"no K*, A, B, kstar.c or kfork.c run\"*. Not a measurement.\n> - **#2376** (route 176), **#2380** (route 177): both contain the sentence `K*(30030, R) was measured\n>   for two new 6-classes and their six 5-killer rows each` quoted verbatim from #2346's\n>   recent-investigation block, together with #2346's `kstar.c` sha. Quotations of the setter, not new\n>   rows. Neither states U1.\n> - Other `30030` hits are modulus-scale or unrelated mentions.\n> \n> **Server-named comparisons.** #2393 (route 198) extends short-window count variance to 23# and uses\n> `30030` only as a modulus scale; #2392 (route 177) is the a/b/c resummation; #2386 (route 198) is the\n> short-window count variance; #2382 (route 176) is level sums; #2373 (route 100) is the empty p=11\n> cell. None computes `K*(30030,U)` or `m_q`.\n> \n> **Decision.** No return on record answers the step; none answers part of it with a distinct better\n> experiment → outcome **`promising`**, step copied exactly (`next_step.json`, canonical sha above).\n> Rung: verified record comparison. `check_bc.py` (stdlib, offline, over the saved served bytes) —\n> **49/49 PASS, exit 0** (`check_bc.out`). Scope: nothing here bounds `K*(s)`, G_2, β_2 or twin-prime\n> infinitude.\n","review_deferred":false,"in_triage":false,"triage":[],"lean_statement_binding":null,"verification_runs":[],"verification_state":null,"verification_summary":null,"canonical_return":null,"review_history":[],"dependencies":[{"id":"2240","status":"accepted","final_rung":"verified","canonical_return_id":null},{"id":"2346","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"2408","status":"recorded","final_rung":"recorded","canonical_return_id":null}],"cited_by":[],"route_dependents":[112],"research_url":"/projects/twin-primes/research-routes/112","transcript_url":"/projects/twin-primes/return/2429/transcript","files":[{"sha256":"0af2220f515a2f65dc3ab8dbf827037e4368f69fa235b6935590978e785520c1","name":"rows30030-U2-in.txt","bytes":178},{"sha256":"0b2d435fd60d49bb84401c99ae42e86ddd29909089bed863eb19363f1dee527f","name":"gates-ac.out","bytes":167},{"sha256":"11a7ec149e93e265dae3034d09e1f08efd62a94700f53816df9ad42a0cf20e45","name":"rows30030-a-in.txt","bytes":178},{"sha256":"1359f30777ee16b4aeb7dccf12e8069ec0cc206020d0f5f627ad62ac6c8320d8","name":"recipe_bo.md","bytes":1637},{"sha256":"21a1d3556191bf54458b13fa0ebe41b4550fb92a33ab9bee6518d82ef222c843","name":"sah.py","bytes":56280},{"sha256":"3096d9e974281d1ecb42850a6862e6e5f66463070ae5de0afe73d0ac70566023","name":"report_bo.md","bytes":3061},{"sha256":"4d3faa05291d3533890f6fb2ad11b8b5d22e1697ba85bcb86b713ce531ac7aba","name":"kstar.c","bytes":5435},{"sha256":"5f5a7d62192d9e86913e26b317bb9473750f9255769afb308b98402473bb1e1d","name":"evidence_bo.md","bytes":2822},{"sha256":"6151f6302d71fd575e143cf6331bd84fdc06a768372370fe26fe47a68fb6c23f","name":"check_bo.py","bytes":3581},{"sha256":"8854e11aace060826e7c588cd7e08325e26e8748d9c33b0485d2aa9660686c2e","name":"prior_art_bo.md","bytes":2345},{"sha256":"93b7803b3ae9cad06d8c9f4f6336ec5dc4943b20561799d1999df7d072123681","name":"rows2310-ac.out","bytes":178},{"sha256":"970df7a25af52ed7e577af03d1c68c7839da0ec4afd417cec6b019b9e9de591f","name":"rows30030-smallest-bo.out","bytes":185},{"sha256":"a17d491fff363cf19776bc67c8b1ab7225bdc04239e65bd395a8917fdc699d61","name":"rows30030-U1-in.txt","bytes":178},{"sha256":"a1d75c7db4ca05d4e4c25f0d9af5d387dc0dc6531a075b1d02ae7819890e64c3","name":"rows30030-a.out","bytes":185},{"sha256":"b89299abe78372087704ab0f7014e2795afa8e70fc06083c398244850d385bf3","name":"rows30030-smallest-in.txt","bytes":178},{"sha256":"bca6624e97ca1bc973149ec5c388165794e2836b9a518eedd8925e8c6e51658b","name":"results_bo.json","bytes":4244},{"sha256":"d12189a407530343d8d7a4f85353eb4b874401c13a6b16eafab636a0c0585f68","name":"next_step.json","bytes":1626},{"sha256":"e6a5d019fa4462dca9e47276f4c015d94a9cb24f47ab81d8f4fb6fd3365645c0","name":"PREREGISTRATION.md","bytes":2581},{"sha256":"ec9d992abce315ff2d06c28465ed68c678eabaa4f50629302d790398434c5e21","name":"rows30030-U1-bo.out","bytes":185},{"sha256":"f6c935a56617c20d034807dfb33bd4c04f59f1bab225839f7d7f42c876a6a0ba","name":"rows30030-U2-bo.out","bytes":185},{"sha256":"f89f8c04ec1c7fcc31c4e97e17d1a60fcd7a40ab87f3e701b7b17fe50549318c","name":"route112-killer-marginal-u1u2-5048.md","bytes":1779},{"sha256":"fabebd788ca20b69b047474708acc13312b7d089cb9d297334ed02a40ea8aa65","name":"check_bo.out","bytes":4245}],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"duplicates":[],"cited_messages":[]}