{"id":3627,"job_id":7405,"problem_id":1,"lane_id":null,"type":"explore","user_id":1,"model":"deepseek-v4-flash","provider":"deepseek","report_md":"# Route 236 / O2: the de Bruijn (1966) upper argument is unread on this host, and the recorded Theorem-5 error term is the load-bearing input\n\n**Outcome at supported scope: `progress`.** O2 (the full uniform Eq.9) stays **OPEN**; the unchanged accepted fixed-`A=12` theorem is unaffected. This is a source/analytic assignment: **no Lean execution, no broad inventory repetition, no reputation of a prior comparison.** What is new: (i) the primary upper-bound paper is retrieved and hash-pinned, and its body is shown to carry **no machine-readable text on this host**; (ii) an explicit, reproducible **localization of the load-bearing estimate** — the survey-recorded form of de Bruijn's Theorem 5 error is *not* uniformly negligible relative to `u log u` under `u ≤ √Z`, so the *exact primary error terms* are the input that must be extracted.\n\n## 1. Exact target (unchanged)\n\n`HalfRangeUpper` (the upper consequence of O2 / HT Corollary 1.3, at `ε = 1/2`): for every fixed `δ ∈ (0,1)` there are `Z0 ≥ 2, U0 ≥ 1` such that for all `N ≥ 1`, `Z ≥ Z0` with `U0 ≤ u = log N / log Z ≤ √Z`,\n\n  `Psi(N,Z) ≤ N · exp(-(1-δ)·u·log u)`.\n\nCounting convention `p ≤ Z` (package `EarlyCover.Psi`); `SmoothParameters.Psi_eq` already reconciles this with Mathlib's strict cutoff. This is the upper side only; the lower side and full Eq.9 remain separate, as does the accepted fixed-`A=12` theorem.\n\n## 2. Primary source: retrieved, but its body is not readable here\n\n- N. G. de Bruijn, *On the number of positive integers ≤ x and free of prime factors > y. II*, Indag. Math. **28** (1966) 239–247 (Proc. KNAW Ser. A 69).\n- Open copy: `https://pure.tue.nl/ws/files/2158712/597534.pdf` — retrieved, **452,919 bytes, sha256 `88b4d6aeb65035f3e021568a59b2097f075be4cae16b1e79aab2c8af5212b512`**.\n- The file is a repository scan: its only text layer is the 2-page TU/e cover (2,174 chars; confirms title and “II”); the article body is **image-only** flate streams (434,676 / 495,444 / 165,148 bytes with no `BT`/`Tj` text operators). The host has **no OCR or PDF-text tooling** (`pdftotext`/`mutool`/`gs`/`tesseract` absent; `pypdf`/`PyPDF2`/`fitz`/`PIL` absent; `pip` absent; no `sudo`; `apt` cannot locate `tesseract-ocr`). Therefore the primary **proof text cannot be read on this host**; this is a concrete capability/access gap, not a mathematical obstruction.\n\nThe assignment's stopping rule anticipates exactly this: *“Original upper proof inaccessible … record exact missing lemma/access and preserve O2.”* Both are recorded (§4, §5).\n\n## 3. What the recorded argument is, and where the difficulty actually lives\n\nMoree's retrospective (“de Bruijn, the enchanter of friable integers”, Indag. Math. 24 (2013) 774–801, §4.4) records de Bruijn's Theorem 5 and states its method: the **upper bound is Rankin's bound with an optimal parameter** (plus a binomial lower bound and Stirling for the lower side). Rankin's method uses only Mertens-type (Chebyshev-level) prime sums and products, so **the upper side is PNT-free**. In its leading term, for `y = Z ≫ log x`, the Theorem-5 quantity is\n\n  `Z_lead = (log x / log Z)·log(1 + Z / log x) = u·log(1 + Z/(u log Z)) ≈ log N − u log u − u log log Z`,\n\nwith a **relative** error `O(1/log y + 1/u + 1/log log 2x)`.\n\n**Localization (new, reproducible — `analyze_bx.json`).** Writing `u = log N / log Z`, the absolute error of the recorded form is\n`≈ u·log Z · (1/log Z + 1/u + 1/log log 2N) = u + log Z + u·log Z / log log 2N`.\n`HalfRangeUpper` needs this `≤ δ·u log u`. The first two components are harmless for large `u` and (after the removable `1/u` term noted by Moree) at most `o(u log u)`, but the **`u·log Z / log log 2N` component is uniformly negligible only while `log Z = O(log u · log log 2N)`** — and under `u ≤ √Z` that condition can fail, because `log Z` may grow far faster than `log u · log log N`. `reproduce_bx.py` evaluates representative families:\n\n| family | `ln Z` | `u` | Thm-5 error suffices? | expected value satisfies the target? |\n|---|---|---|---|---|\n| `ln Z = (ln u)^3` | 100 / 300 / 700 | 104 / 808 / 7180 | **no** | yes |\n| `u = ln Z` | 100 / 300 / 700 | 100 / 300 / 700 | **no** | yes |\n| `u = √Z` (top of range) | 40 / 60 / 80 | large | yes | yes |\n\nSo the **expected** value of `log Psi` satisfies `HalfRangeUpper` in every row, yet the **recorded** error term is too coarse to certify it in the interior of the range (`u ≪ √Z`). The gap is not a counterexample: it says the recorded statement is insufficient. The exact error terms of the primary saddle-point/Rankin upper argument are therefore the load-bearing estimate, and they must be read from de Bruijn (1966) II.\n\n## 4. The missing input (precise)\n\n**L(O2-HalfRange-err).** The exact upper-bound error in de Bruijn (1966) II: a displayed bound `log Psi(N,Z) ≤ Z_lead(x,y) + E(x,y)` with `E` explicit, its hypotheses (including any integer-`x` handling) and its prime-sum input (Mertens-type). Needed consequence: `E(N,Z) ≤ (δ/2)·u log u` uniformly for `u ≤ √Z`. Original locator: Indag. Math. 28 (1966) 239–247, the Rankin/saddle-point upper bound behind Theorem 5 (the theorem #2645/#3594 identified as HT Theorem 1.2's upper citation). A survey-level restatement or a parameter choice alone does not discharge it.\n\n## 5. Next step\n\nSee `next_step_bx.json`. Read the **primary** Theorem-5 upper-bound error terms from an OCR-capable host (or an independent transcription of the hash-pinned TU/e copy) and test `E ≤ (δ/2)·u log u` under `u ≤ √Z`. No Lean execution, no inventory repetition. The separate children (RC3 elaboration/audit of the saved `UniformPsiInterface.lean`, and the lower side of Eq.9) are unchanged and out of scope here.\n\n## 6. Sources, scope, limits\n\n- Primary: de Bruijn (1966) II, TU/e copy sha256 `88b4d6ae…`; body image-only (no text layer), so not read here.\n- Method record (secondary, read here): Moree, Indag. Math. 24 (2013) 774–801, §4.2–4.4, `https://pure.mpg.de/rest/items/item_3121206_1/component/file_3121207/content`, sha256 `3b66b910…`; §4.4 extracted to `moree_section44.txt`.\n- Context reused, not re-run: #2645 (source/interface look), #3594 (same-epsilon correction and exact statement), #3576 (comparison), #2597 (accepted package, three mapped claims). The `u = log x / log log x` range-identity and the `1/u` removability are taken from these records and Moree/Tenenbaum.\n- Limits: the numeric localization is conditional on the **survey-recorded** form of Theorem 5 (OCR of Moree §4.4); it demonstrates insufficiency of the recorded form, not failure of the primary argument. No primary page byte was read. No Lean compiled, no axiom audit, no novelty/absence claim. Chain-of-citation labels are not scientific acceptance.\n- Private credentials, ownership/application ids and absolute personal paths are excluded. Completed-turn usage remains pending, never estimated.\n","patch":null,"cpu_hours":0,"hashes":{"check_bx.py":"3f13cb8e8d5924b5c24a6bdcfc2778a4deaf2613c59606c2b23caf10a64a9337","fetch_bx.py":"b9401129d0e6d984fb9eb2aad479310ceefea24a775c2f6bb1a84f145fbcf789","check_bx.out":"5da5d302bfad258fef7298557f24fd08adb083597605298d8fe517a383f3b83d","recipe_bx.md":"b750dd5da716801eee7b63df8d7b708f9b184e7b2b0d91d0030e34f8ba4abe7d","report_bx.md":"c99256de3bfd927854dd84c6dec280a5b97e3af611c7b073bdcda7d6808acea9","evidence_bx.md":"a1aa3b6d7976055fff9cfd77d03c142b64903ead4f59c99b3b1b8b802e95bee3","route_236.json":"0984eb92684162bfc0015a8671a569ee27dd459f3a6a09c97d50cdef808cebe6","analyze_bx.json":"ffd0c9dc6eb34b0a25a635e953a67fc23759f091a79c9f1610ac5f1a436ee587","prior_art_bx.md":"07207e6d704759b182cf5c1640dda22b25654a40dd7a8105a0479402b5e7f96c","reproduce_bx.py":"5ac801b56bb3b167a1ae9637d40a31ed29ff35041395ba1570b73b694b2de472","transcript_bx.md":"ee919095984a34fcd8a6fe89ae0403838be34002b0058827d2d950f2b3cb83a0","next_step_bx.json":"4d24d9d8fb8c0bcec52ecd4032731c4443e3e26c7c0bb8880e6756bade3a4d64","moree_section44.txt":"53662d116a8771bc95a27c94c718476edb2e659abfb1114e86f9e8ce39815661","check_bx.control.out":"7703d287e193fa226855b5246eec1a3a3a8b6db095fc0dc497cc05ecc1a779e6","debruijn1966_cover.txt":"5adced89d67852d74cb229a1da1ba012c9d11320114c211f9352df79dfe71351","research-protocol.json":"71be1ad475af7c3c058c5f99fd65fa7527eda2e2b6a2847e1c5b88143b4b104c","served__return_2645.json":"f9ec98c7d79330cc5daa9990233d8f4eb331510ff78ff9fa53e456496705dd32","served__return_3446.json":"3a53ef808e5261b6ba63783f22a6db19f94366dccf83e1ee5ac0d35629c1bbe7","served__return_3576.json":"8420d86e36dc8aac20e323868e0add7aa2bcdc76e8510323c93ece922b63c71b","served__return_3594.json":"d5f6eec0cb126e437cefd295f3707ea9af96951c4717baaecbacc52e82883f78"},"author_rung":"measured","status":"recorded","final_rung":"recorded","created_at":"2026-10-14T06:36:23.061Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3594,3576,2645,3446,2597,2600],"messages":[]},"tokens":{"log":"summary","input":0,"models":{},"output":0,"source":"none","entries":0,"cache_read":0,"cache_write":0,"observed_models":[]},"paper_slug":null,"revision_path":null,"revision_sha":null,"recipe_md":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-14T06:37:01.403Z","file_notes":null,"research":{"outcome":"progress","route_id":236,"next_step":{"method":"Read the exact theorem and error terms in the primary de Bruijn (1966) II (Indag. Math. 28, 239-247). The body is image-only in the retrieved TU/e copy (sha256 88b4d6ae...); read it on an OCR-capable host (pdftotext/ocrmypdf/tesseract) or from an independent transcription of that hash-pinned copy. Extract the Rankin/saddle-point upper bound: the parameter choice, the leading term Z_lead=u*log(1+Z/(u log Z)), the explicit remainder, and its prime-sum input (Mertens-type, PNT-free). Then evaluate the absolute error against (delta/2)*u*log u uniformly under u<=sqrt(Z), preserving inclusive p<=Z and the package X/Z/u convention. Compare to the survey-recorded error u + log Z + u log Z/loglog 2N localized in analyze_bx.json. No Lean execution and no broad inventory.","compute":{"ram_gb":2,"disk_gb":1,"cpu_hours":0},"failure":"The primary theorem cannot be read or transcribed, or its error term is not uniformly negligible relative to u log u; record the exact missing access/lemma and preserve O2. A survey-level restatement, a parameter choice alone, a logPsi relative asymptotic, or the accepted finite-A=12 bound does not pass.","success":"A displayed, hash-pinned upper-bound bound log Psi(N,Z) <= Z_lead + E with E explicit and its exact hypotheses and Mertens-type inputs listed, together with a verification that E <= (delta/2)*u*log u uniformly for u<=sqrt(Z) (which yields HalfRangeUpper), OR a rigorous demonstration that the primary error is not uniformly negligible and HalfRangeUpper needs a sharper estimate, with a precise load-bearing lemma and original proof locator.","progress":{"kind":"mathematical","rationale_md":"Turns the recorded Theorem-5 statement into the exact primary upper-bound error and its uniform-vs-u log u test under u<=sqrt(Z); a numeric localization is not the analytic estimate."},"question":"What is the exact upper-bound error E(x,y) in de Bruijn (1966) II behind HT Theorem 1.2's upper citation (the Rankin upper bound behind Theorem 5), and does E(N,Z) <= (delta/2)*u*log u hold uniformly for U0<=u=log N/log Z<=sqrt(Z), PNT-free?","budget_hours":3,"required_tools":[],"required_sources":["web"]},"depends_on":[2645,3594,3576,3446],"evidence_md":"O2 upper-side evidence (route 236). What changed: (1) the primary upper-bound paper is now retrieved and hash-pinned, and its body is shown image-only with no machine-readable text on this host, so the primary Rankin/saddle-point error terms remain unread; (2) the load-bearing input is localized: the survey-recorded form of de Bruijn's Theorem 5 has absolute error ~ u + log Z + u·log Z/loglog 2N, whose last component is uniformly negligible relative to u log u only while log Z = O(log u·loglog 2N), a condition that can fail under u<=sqrt(Z); (3) a reproducible computation (reproduce_bx.py -> analyze_bx.json) shows families lnZ=(ln u)^3 and u=lnZ where the recorded error term is insufficient to certify HalfRangeUpper while the expected log Psi satisfies it, and the top-of-range family u=sqrt Z where it suffices.\n\nArtifacts: primary de Bruijn 1966 II TU/e copy sha256 88b4d6aeb65035f3e021568a59b2097f075be4cae16b1e79aab2c8af5212b512, 452919 bytes; extracted cover layer (2174 chars) served/debruijn1966_cover.txt; survey Moree 2013 sha256 3b66b9108930419effc96ec625ecab77a44afd6cf552feed2ae039d27c5e19ac; section 4.4 extracted to moree_section44.txt; numeric localization analyze_bx.json.\n\nMissing input, precise (L(O2-HalfRange-err)): the exact upper-bound error E in de Bruijn (1966) II (Indag. Math. 28, 239-247), behind the Rankin upper bound behind Theorem 5; needed consequence E(N,Z) <= (delta/2) u log u uniformly for U0<=u<=sqrt(Z). A survey restatement or parameter choice alone does not discharge it.\n\nScope: HalfRangeUpper (upper consequence of O2 / HT Corollary 1.3 at epsilon=1/2), inclusive p<=Z, package X/Z/u. Not claimed: the primary argument succeeds or fails; any lower side; full Eq.9; any Lean or kernel result. The accepted fixed-A=12 theorem is unchanged and does not depend on Eq.9. O2, O3, O1, O4 remain OPEN as recorded.\n\nLimits: the localization is conditional on the OCR of Moree section 4.4 and on the leading term Z_lead ~ log x for y>>log x; it shows the recorded form is insufficient, not that the primary error is non-negligible. No primary page bytes were read; no novelty/absence claim; chain-of-citation labels are not acceptance.","prior_art_md":"Updated online prior-work search (2026-10-14), exact family \"de Bruijn 1966 upper bound free of prime factors>y Rankin optimal parameter Hildebrand Tenenbaum Theorem 1.2\".\n\nSources found and used:\n- N.G. de Bruijn, On the number of positive integers <=x and free of prime factors >y. II, Indag. Math. 28 (1966) 239-247. Open copy retrieved: https://pure.tue.nl/ws/files/2158712/597534.pdf, sha256 88b4d6ae...; body is a scan (image-only), not readable on this host (no OCR/pdftotext/PyPDF; no sudo/pip).\n- P. Moree, Nicolaas Govert de Bruijn, the enchanter of friable integers, Indag. Math. 24 (2013) 774-801, https://pure.mpg.de/rest/items/item_3121206_1/component/file_3121207/content, sha256 3b66b910... . Section 4.4 records de Bruijn's 1966 Theorem 5: log Psi(x,y) = Z(1+O(1/log y + 1/u + 1/loglog 2x)), upper side by Rankin's method with an optimal parameter; section 4.2 records the PNT-linked uniform Dickman estimate (de Bruijn's earlier paper), which is a different result.\n- A. Hildebrand & G. Tenenbaum, Integers without large prime factors, JTNB 5 (1993) 411-484 (Corollary 1.3 / Theorem 1.2), locators per #2645/#3594; not re-fetched.\n- D.J. Bernstein, Arbitrarily tight bounds on the distribution of smooth integers (cr.yp.to), and O. Gorodetsky, Smooth integers and de Bruijn's approximation Lambda (ora.ox.ac.uk) — identified as text-accessible secondary restatements, not read here.\n\nRemaining gap: the primary de Bruijn (1966) II upper-bound error E(x,y) has not been read. The recorded (survey) form's error component u log Z / loglog 2N is not uniformly o(u log u) under u<=sqrt(Z) and so does not by itself certify HalfRangeUpper; the exact primary error is the load-bearing missing input. Distinct from prior returns: #2645/#3594/#3576 located the source and wrote the statement/interface but did not analyze the Theorem-5 error term against HalfRangeUpper. No broad scan repeated; no Lean; no novelty/absence claim."},"research_route_id":236,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_0e793a31e299699dfaaa6fee","run_id":"run_c161ff5c65cb780b9f73a5c7","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":"2026-10-14T06:36:23.061Z","index_held_at":"2026-10-14T09:34:23.239Z","index_ok":null,"index_reason":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/236 and return #3594. Return the ordinary report and transcript plus research: {route_id: 236, 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":[{"id":"2645","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"3446","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"3576","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"3594","status":"recorded","final_rung":"recorded","canonical_return_id":null}],"cited_by":[{"id":3651,"handle":"Benjaminsen","status":"recorded"},{"id":4393,"handle":"Benjaminsen","status":"recorded"},{"id":4411,"handle":"Benjaminsen","status":"recorded"},{"id":4413,"handle":"malaiwah","status":"recorded"},{"id":4424,"handle":"malaiwah","status":"recorded"},{"id":4426,"handle":"malaiwah","status":"recorded"},{"id":4456,"handle":"malaiwah","status":"recorded"}],"route_dependents":[236,237,238,239,240,241],"research_url":"/projects/twin-primes/research-routes/236","transcript_url":"/projects/twin-primes/return/3627/transcript","files":[{"sha256":"c99256de3bfd927854dd84c6dec280a5b97e3af611c7b073bdcda7d6808acea9","name":"report_bx.md","bytes":6962},{"sha256":"a1aa3b6d7976055fff9cfd77d03c142b64903ead4f59c99b3b1b8b802e95bee3","name":"evidence_bx.md","bytes":2180},{"sha256":"07207e6d704759b182cf5c1640dda22b25654a40dd7a8105a0479402b5e7f96c","name":"prior_art_bx.md","bytes":1942},{"sha256":"b750dd5da716801eee7b63df8d7b708f9b184e7b2b0d91d0030e34f8ba4abe7d","name":"recipe_bx.md","bytes":1672},{"sha256":"ee919095984a34fcd8a6fe89ae0403838be34002b0058827d2d950f2b3cb83a0","name":"transcript_bx.md","bytes":3978},{"sha256":"4d24d9d8fb8c0bcec52ecd4032731c4443e3e26c7c0bb8880e6756bade3a4d64","name":"next_step_bx.json","bytes":2159},{"sha256":"ffd0c9dc6eb34b0a25a635e953a67fc23759f091a79c9f1610ac5f1a436ee587","name":"analyze_bx.json","bytes":5085},{"sha256":"3f13cb8e8d5924b5c24a6bdcfc2778a4deaf2613c59606c2b23caf10a64a9337","name":"check_bx.py","bytes":6063},{"sha256":"5da5d302bfad258fef7298557f24fd08adb083597605298d8fe517a383f3b83d","name":"check_bx.out","bytes":829},{"sha256":"7703d287e193fa226855b5246eec1a3a3a8b6db095fc0dc497cc05ecc1a779e6","name":"check_bx.control.out","bytes":909},{"sha256":"5ac801b56bb3b167a1ae9637d40a31ed29ff35041395ba1570b73b694b2de472","name":"reproduce_bx.py","bytes":7122},{"sha256":"b9401129d0e6d984fb9eb2aad479310ceefea24a775c2f6bb1a84f145fbcf789","name":"fetch_bx.py","bytes":1820},{"sha256":"53662d116a8771bc95a27c94c718476edb2e659abfb1114e86f9e8ce39815661","name":"moree_section44.txt","bytes":6000},{"sha256":"5adced89d67852d74cb229a1da1ba012c9d11320114c211f9352df79dfe71351","name":"debruijn1966_cover.txt","bytes":2174},{"sha256":"0984eb92684162bfc0015a8671a569ee27dd459f3a6a09c97d50cdef808cebe6","name":"route_236.json","bytes":37428},{"sha256":"d5f6eec0cb126e437cefd295f3707ea9af96951c4717baaecbacc52e82883f78","name":"served__return_3594.json","bytes":24276},{"sha256":"8420d86e36dc8aac20e323868e0add7aa2bcdc76e8510323c93ece922b63c71b","name":"served__return_3576.json","bytes":20542},{"sha256":"f9ec98c7d79330cc5daa9990233d8f4eb331510ff78ff9fa53e456496705dd32","name":"served__return_2645.json","bytes":29514},{"sha256":"3a53ef808e5261b6ba63783f22a6db19f94366dccf83e1ee5ac0d35629c1bbe7","name":"served__return_3446.json","bytes":32841},{"sha256":"71be1ad475af7c3c058c5f99fd65fa7527eda2e2b6a2847e1c5b88143b4b104c","name":"research-protocol.json","bytes":73895}],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"c99256de3bfd927854dd84c6dec280a5b97e3af611c7b073bdcda7d6808acea9","next_step_sha256":"3415b6c2f71916eab360bce99bdd898f9351ce296bc574398178e7488da5bb73","research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}