{"id":7431,"job_id":14514,"problem_id":1,"lane_id":1,"type":"explore","user_id":127,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Q-doubling-killrun-0830: the record already answers the question; the registry row is stale (PARTIAL should be ANSWERED)\n\n**Finding.** The question asks whether the per-fold L bounds of the pi(2s) - pi(s) folds in one doubling step can compose to a bound on the weighted kill-run below the allowance 8 Ghat(s)/gbar(s), for all s, without K*. The staging note attack-0830-doubling-killrun.md answers **No**, with proofs. The folds compose as a product, K*+1 <= prod_j (1+L_j). That certificate never improves on the maxsum certificate. It exceeds the allowance from s = 9, and its floor 2^N gbar(s) beats 8 Ghat(s) at s = 16, 32, 64 and, given the cited polynomial ceiling, for all large s. The redteam-0830-doubling.md rider re-derives both proofs (21,641,346 nesting links over 6,012,804 killed runs, 0 failures) and weakens one clause only: 0.8295 is the certificate's ratio and the truth's is 0.6591. The row still reads PARTIAL because of the last clause, \"(M8) ... OPEN\". But (M8), the all-s bound on the maxsum certificate, is the open obligation of the parent row Q-doubling-bridge-0829n, which states exactly that. This question's own answer is complete. **Proposed fix:** status ANSWERED, and replace the last clause with the rider's corrected ratios plus a pointer to Q-doubling-bridge-0829n (patch attached, two rows: the TODO table and the ledger).\n\n**Attempt to break the verdict (verified).** I recomputed the sharpest finite claim from scratch at s = 16 (check16.py, exhaustive over one period of 13# = 30030): D = 1485 admissible residues, gbar = 182/9 = 20.222, Ghat = G2(13#) = 66, N = pi(32) - pi(16) = 5. So 2^N gbar = 647.11 against 8 Ghat = 528, ratio 1.2256, which matches the note's 1.226 and its truth value 66. The s = 32 and s = 64 factors (1.481, 41.348) need G2(31#) and a literature value at 61#, which I did not recompute. The product theorem's proof (every fold kills at least one slot, so 1 + L_j >= 2) has no gap I could find.\n\n**Online search** (one query on twin Jacobsthal functions and primorial doubling bounds). It found the paired Jacobsthal function h2 (arXiv 1706.00317), Costello-Watts on explicit Jacobsthal values, and Iwaniec's Y(x) << x^2 bound. None treats a doubling inequality or per-fold composition, so nothing changes the verdict.\n\n**Rungs.** Stale-row finding: INFERRED from the two rows and the note. s = 16 ratio: VERIFIED. Nothing new about (M8), G2, beta_2 or twin primes.\n\n**Patch** against research/QUESTIONS.md (base sha256 de3354dd6254d5bf1814b8618874a9040ac515ac17f1e3d0030041abc2c1431f; revised file sha256 282a0a9c...). This session cannot open a separate audit return, so the corrected row travels here as a patch for the integrator.\n\n## Sources\n- research/QUESTIONS.md rows Q-doubling-killrun-0830 (lines 166, 442) and Q-doubling-bridge-0829n (line 441).\n- research/history/staging/attack-0830-doubling-killrun.md: verdict, sections 0, 3, 4, and the redteam rider.\n- arXiv 1706.00317 (paired Jacobsthal function), search snippet only.\n","patch":"--- a/research/QUESTIONS.md\n+++ b/research/QUESTIONS.md\n@@ -163,7 +163,7 @@\n | Z5 | `Q-redteam-0830-records` Do attack-0829n-parity-dstar.md (CLOSED, HELD) and attack-0830-record-mechanism.md (PARTIAL, HELD) survive an adversarial pass on independent code, does REFUTED row 95 stand as worded, and is TODO Z5's new title supported? | ANSWERED | Both notes' measurements reproduce on independent code and neither headline is refuted: D* is confirmed EXACTLY, by a BigInt rational simplex written here, at 299 of 376 anchors with 0 contradictions (the other 77 exceed the exact solver's size cap), the old range's 172-figure gate is re-derived exactly at all 43 anchors with 0 disagreements, and an independent 30-wheel sieve to 1e11 reproduces note (b)'s seven decade gap counts, CV^2 and far-tail slopes to every printed digit, with the counts also matching the published pi_2(10^k). Four sentences are wrong or over-stated and are replaced here: REFUTED row 95, note (a)'s ledger, its section 6 and TODO Z5 all attribute the null's 0.025 agreement to the WIDTH law when 0.025 is the ln Q slope difference (the width-slope difference on the same 84 matched anchors is 0.031); note (a) section 3's \"the threshold sits in a gap of at least 0.25 at every anchor\" is scoped in its own producer to the true arm and the null arm's exact gap is 0.1212; P6's HIT rests entirely on the decade-2 collapse that section 5 discounts as a sampler artefact when it discounts kill clause (a); and note (b)'s \"d b_z = 1.0806 +- 0.0014\" carries only the Monte Carlo pairing error, while moving the far-tail slope by 0.02 (against a spread of 0.0174 across six fit windows on the same decade and 0.1196 across decades) moves d b_z from 0.9888 to 1.1720, and continuing the law at slope 1 above the last resolved point still gives 0.7752. REFUTED row 95's CLOSED verdict stands on kill clause (b), which is better powered than the note presents it (paired s.e. 0.0401 against a 0.15 band), and the row needs two clauses reworded; TODO Z5's title is supported for \"measured and not derived\", and a slope-one continuation carries 72 per cent of the residual. This percentage is conditional on extending the measured boundary mass into the unresolved tail; it is not an attribution from resolved data alone. | [redteam-0830-records.md](history/staging/redteam-0830-records.md) |\n | D | `Q-doubling-C2` Does the doubling inequality hold on the base-2 chain, and can a bridging certificate prove it? | PARTIAL | Not proven and not refuted: the exact C2 table has sup 5.2727 at s = 16, eleven proven finite-level bounds C2 <= K*+1 tight to a factor <= 2.91, two closures refuted outright, and the alarm is that K* drifts up (slope 0.6881 +/- 0.1328) while C2 does not (0.2018 +/- 0.1412). | [attack-doubling-01.md](history/staging/attack-doubling-01.md) |\n | D | `Q-doubling-bridge-0829n` Can a bridging certificate carry Ghat(2s) <= 8 Ghat(s) from level s to level 2s uniformly in s, all s, on the base-2 chain? | PARTIAL | Not by any proven mechanism: the K*-product bridge is CLOSED at every C2 by the cited run floor K* >= pi(2s)-pi(s) (K* = 17 at s = 16 by exact walk, VERIFIED, so the certificate reads 18 against 8 on the chain itself; it exits the whole legal band at s = 128, PROVEN); the sharper maxsum bridge Ghat(2s) <= maxsum_{K*+1}(T_s) is PROVEN and holds under 8 at all fourteen enumerable steps (VERIFIED), but its all-s form needs an upper bound on K* against the entering primes' two-class covering that nothing proven supplies; the doubling inequality itself is untouched. | [attack-0829n-doubling-bridge.md](history/staging/attack-0829n-doubling-bridge.md) |\n-| D | `Q-doubling-killrun-0830` Can the exact per-fold L bounds of the pi(2s) - pi(s) folds inside one doubling step compose to an upper bound on the weighted kill-run below the allowance 8 Ghat(s)/gbar(s), for all s, without passing through K*? | PARTIAL | No, and the composition is closed as a route, not merely unproven: the folds compose as a PRODUCT, K*+1 <= prod_j (1+L_j) (PROVEN here, exact at fourteen steps, 540 against 18 at s = 16), the composed certificate never sits below yesterday's maxsum certificate (PROVEN by monotonicity), it exceeds the allowance at 8 of 14 enumerable steps starting at s = 9 (VERIFIED), and since every fold kills a slot the composed index is at least 2^N, whose floor 2^N gbar(s) alone exceeds 8 Ghat(s) at the chain rungs 16, 32, 64 and beats the cited polynomial ceiling on Ghat for all large s (PROVEN given the ceiling); the sum form is false at seven steps and the max form is a floor; the weighted run itself, computed exactly, sits at 0.83 of its allowance at s = 16 and (M8) is exactly where yesterday left it, OPEN. | [attack-0830-doubling-killrun.md](history/staging/attack-0830-doubling-killrun.md) |\n+| D | `Q-doubling-killrun-0830` Can the exact per-fold L bounds of the pi(2s) - pi(s) folds inside one doubling step compose to an upper bound on the weighted kill-run below the allowance 8 Ghat(s)/gbar(s), for all s, without passing through K*? | ANSWERED | No, and the composition is closed as a route, not merely unproven: the folds compose as a PRODUCT, K*+1 <= prod_j (1+L_j) (PROVEN here, exact at fourteen steps, 540 against 18 at s = 16), the composed certificate never sits below yesterday's maxsum certificate (PROVEN by monotonicity), it exceeds the allowance at 8 of 14 enumerable steps starting at s = 9 (VERIFIED), and since every fold kills a slot the composed index is at least 2^N, whose floor 2^N gbar(s) alone exceeds 8 Ghat(s) at the chain rungs 16, 32, 64 and beats the cited polynomial ceiling on Ghat for all large s (PROVEN given the ceiling); the sum form is false at seven steps and the max form is a floor; both proofs re-derive under redteam-0830-doubling.md (21,641,346 nesting links over 6,012,804 killed runs, 0 failures); the weighted run itself, computed exactly, stays under its allowance on the fourteen-step range (truth sup w_true/a = 0.6591, certificate sup w/a = 0.8295, both at s = 16; 0.83 is the certificate's ratio, not the truth's); the all-s (M8) bound is the open obligation of Q-doubling-bridge-0829n, not of this question. | [attack-0830-doubling-killrun.md](history/staging/attack-0830-doubling-killrun.md) |\n | D | `Q-kstar-prereg` What is K* at the three next doubling steps, predicted before any period walk? | ANSWERED | Sealed and committed alone before the period walks. Scored in attack-kstar-01.md section 4: the exact route is HIT at all three steps, with K*=10,17,13 and all 43 N_k cells matching; M1 passes its +/-2 rule. Two illustrative run-count figures in the sealed derived prose were wrong (6 and 36, not 2 and 6), as disclosed in the scoring note; the binding scoring rule and sealed body are unchanged. The all-step growth target is not established by these finite scores. | [attack-kstar-01-prereg.md](history/staging/attack-kstar-01-prereg.md) |\n | D | `Q-recon-0830-rec-killrun` Does the literature hold, in its own conventions, a theorem whose hypotheses REC(s, u0) (the sup-versus-rms recovery of the level-D signed remainder over all positions, attack-0829n-rml-proof.md section 3) or the weighted kill-run K*(s) (the longest run of level-s slots the primes in (s, 2s] can kill, attack-0829n-doubling-bridge.md sections 0 and 3) satisfies as stated, or a Maier-type theorem that makes REC false for two-class sifted sets at some u0 below beta_2? | ANSWERED | No theorem applies to either object as stated, on four calibrated channels searched in the owning conventions; every neighbour is graded NEAREST with its unmet hypothesis named, and neither object is on any refuted row. On the Maier question the answer is negative for REC as stated (the Maier family bounds the COUNT, i.e. the full-level remainder, never a level-D truncation) but carries one calibration: at one class and full level the REC-shaped inequality is FALSE asymptotically, by Buchstab's origin ratio against the Montgomery-Vaughan full-period variance ceiling, and the embedded arithmetic puts the level where that falsity first shows at log10 z between 16 and 141 depending on u0 and epsilon, so a finite-z margin of the kind the corpus measures cannot see a failure of this type; at two classes the same full-level statement is HL-conditional at u0 = 2 and unlocated in print at any u0. No exponent moved. | [recon-0830-rec-killrun.md](history/staging/recon-0830-rec-killrun.md) |\n | D | `Q-redteam-0830-doubling` Do attack-0829n-doubling-bridge.md and attack-0830-doubling-killrun.md survive an adversarial re-derivation on an engine sharing nothing with their producers, and do REFUTED rows 94 and 98 stand as worded? | ANSWERED | The mathematics survives: the maxsum certificate Ghat(2s) <= maxsum_{K*+1}(T_s) and the product composition K*+1 <= prod(1+L_j) are each re-derived here and hold, the second at 21,641,346 nesting links over 6,012,804 killed runs with zero failures including the zero-kill fold, and every quoted figure reproduces digit for digit on a fresh engine (K*(16) = 17; G2(31#) = 348 @ 8813641451 x4 from both base tiles; sup msc 6.6364; the diagonal cells; the 2^N ratios 1.226/1.481/41.348). Row 94 STANDS and is if anything under-claimed, but its attribution is wrong in one direction: Lemma 1 at s = 128 alone clears the whole band, so the s = 16 walk corroborates rather than carries it. One statement is falsified: the bridge note's NOT-REACHED line puts 19#->37# out of reach, but column-major it returns here, reproducing the ladder row x = 37 and adding a FIFTEENTH step at s = 19, 20 (K* = 13, N = 4, C2 3.5200, certificate 3.8000), so the enumerable range ends at s = 20, not s = 18. Row 98 STANDS on its mathematics and is WEAKENED on one clause: \"the truth sits under it everywhere (sup w/a = 0.8295)\" attaches the CERTIFICATE's ratio to the word truth; the truth's sup is 0.6591. | [redteam-0830-doubling.md](history/staging/redteam-0830-doubling.md) |\n@@ -439,7 +439,7 @@\n | `Q-dispersion-range` | ANSWERED | How far do the dispersion and coefficient-sector estimates extend across divisor sizes, and does a better orientation or gcd budget enlarge their overlap? | Averaging the nonzero gcd losses over the original divisor gives a different dispersion bound with cross-prime exponent (5/4)a+(1/2)b+3/50, where a=delta+6/25 and b=nu+1/20. Explicit diagonal, prime-cut and sparse-sector inequalities control a region of full rectangles, including d~x^0.282, e~x^0.522 at product scale x^0.804. Its cross-prime and left-sparse budgets are 0.9985 and 0.9988. The supremum of product exponents in this sufficient region is 5397/6700; it is not a uniform product cutoff. Balanced supports separately allow 12/25<s<94/175. The global remainder and twin margin remain OPEN. | C | [dispersion-range.md](dispersion-range.md) |\n | `Q-doubling-C2` | PARTIAL | Does the doubling inequality hold on the base-2 chain, and can a bridging certificate prove it? | Not proven and not refuted: the exact C2 table has sup 5.2727 at s = 16, eleven proven finite-level bounds C2 <= K*+1 tight to a factor <= 2.91, two closures refuted outright, and the alarm is that K* drifts up (slope 0.6881 +/- 0.1328) while C2 does not (0.2018 +/- 0.1412). | D | [attack-doubling-01.md](history/staging/attack-doubling-01.md) |\n | `Q-doubling-bridge-0829n` | PARTIAL | Can a bridging certificate carry Ghat(2s) <= 8 Ghat(s) from level s to level 2s uniformly in s, all s, on the base-2 chain? | Not by any proven mechanism: the K*-product bridge is CLOSED at every C2 by the cited run floor K* >= pi(2s)-pi(s) (K* = 17 at s = 16 by exact walk, VERIFIED, so the certificate reads 18 against 8 on the chain itself; it exits the whole legal band at s = 128, PROVEN); the sharper maxsum bridge Ghat(2s) <= maxsum_{K*+1}(T_s) is PROVEN and holds under 8 at all fourteen enumerable steps (VERIFIED), but its all-s form needs an upper bound on K* against the entering primes' two-class covering that nothing proven supplies; the doubling inequality itself is untouched. | D | [attack-0829n-doubling-bridge.md](history/staging/attack-0829n-doubling-bridge.md) |\n-| `Q-doubling-killrun-0830` | PARTIAL | Can the exact per-fold L bounds of the pi(2s) - pi(s) folds inside one doubling step compose to an upper bound on the weighted kill-run below the allowance 8 Ghat(s)/gbar(s), for all s, without passing through K*? | No, and the composition is closed as a route, not merely unproven: the folds compose as a PRODUCT, K*+1 <= prod_j (1+L_j) (PROVEN here, exact at fourteen steps, 540 against 18 at s = 16), the composed certificate never sits below yesterday's maxsum certificate (PROVEN by monotonicity), it exceeds the allowance at 8 of 14 enumerable steps starting at s = 9 (VERIFIED), and since every fold kills a slot the composed index is at least 2^N, whose floor 2^N gbar(s) alone exceeds 8 Ghat(s) at the chain rungs 16, 32, 64 and beats the cited polynomial ceiling on Ghat for all large s (PROVEN given the ceiling); the sum form is false at seven steps and the max form is a floor; the weighted run itself, computed exactly, sits at 0.83 of its allowance at s = 16 and (M8) is exactly where yesterday left it, OPEN. | D | [attack-0830-doubling-killrun.md](history/staging/attack-0830-doubling-killrun.md) |\n+| `Q-doubling-killrun-0830` | ANSWERED | Can the exact per-fold L bounds of the pi(2s) - pi(s) folds inside one doubling step compose to an upper bound on the weighted kill-run below the allowance 8 Ghat(s)/gbar(s), for all s, without passing through K*? | No, and the composition is closed as a route, not merely unproven: the folds compose as a PRODUCT, K*+1 <= prod_j (1+L_j) (PROVEN here, exact at fourteen steps, 540 against 18 at s = 16), the composed certificate never sits below yesterday's maxsum certificate (PROVEN by monotonicity), it exceeds the allowance at 8 of 14 enumerable steps starting at s = 9 (VERIFIED), and since every fold kills a slot the composed index is at least 2^N, whose floor 2^N gbar(s) alone exceeds 8 Ghat(s) at the chain rungs 16, 32, 64 and beats the cited polynomial ceiling on Ghat for all large s (PROVEN given the ceiling); the sum form is false at seven steps and the max form is a floor; both proofs re-derive under redteam-0830-doubling.md (21,641,346 nesting links over 6,012,804 killed runs, 0 failures); the weighted run itself, computed exactly, stays under its allowance on the fourteen-step range (truth sup w_true/a = 0.6591, certificate sup w/a = 0.8295, both at s = 16; 0.83 is the certificate's ratio, not the truth's); the all-s (M8) bound is the open obligation of Q-doubling-bridge-0829n, not of this question. | D | [attack-0830-doubling-killrun.md](history/staging/attack-0830-doubling-killrun.md) |\n | `Q-embed-backlog-0829` | PARTIAL | How much of the embed backlog (legacy scripts with no OUTPUT block, readings not traceable to their block) could be closed in one pass, and what did the fresh runs contradict? | MEASURED. embed-backlog fell 218 -> 189 findings in one pass: no-output-block 34 -> 5, readings-not-traceable 181 -> 181 (untouched by design), hand-pasted-tail 3 -> 3. Twenty-nine legacy scripts were bound with node research/qc/embed.js, zero --force was used, and one legacy reading is contradicted by its own fresh output (attack-beta2-03-exact-strata reading 8, \"1.04 to 1.07 across y = 7..23\" against a printed 1.102 at y = 7). | none | [embed-backlog-0829.md](history/staging/embed-backlog-0829.md) |\n | `Q-embed-binding` | ANSWERED | What does the embed fingerprint actually bind, and what does it leave loose? | It binds the code to a claim about the output and does not bind the output block to anything: code-sha256 covers every byte above the banner, out-sha256 is only ever compared against another run, timeouts and failures write nothing, a prose line can unbind a tail and one did during this pass, and 37 cited scripts have no output custody at all. | none | [verify-the-verifier-embeds.md](history/staging/verify-the-verifier-embeds.md) |\n | `Q-endpoint-fourier` | ANSWERED | Does a complete Fourier truncation budget and a matched Kloosterman-fraction theorem control any further part of the actual endpoint sum when its small prime-power coefficients are combined first? | A written classical-input derivation controls the rectangle d in (floor(x^(27/100)),2floor(x^(27/100))], e in (floor(x^(46/100)),2floor(x^(46/100))] to O_H(x/log^H x) for every fixed H. Its product is of order x^(73/100), outside the previously controlled region eventually. The aggregated Fourier exponent is 1989/2000; the full Vaaler tail and gcd=2 branch are included. This is a regional estimate, not a full residual bound or twin theorem; finite algebra and saved-factor checks are separate validation. | C | [endpoint-fourier.md](endpoint-fourier.md) |\n","cpu_hours":0.001,"hashes":{},"author_rung":"verified","status":"recorded","final_rung":"recorded","created_at":"2026-11-21T01:07:30.235Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[],"messages":[]},"tokens":{"log":"summary","input":26,"models":{"claude-opus-5-5":9424},"output":9424,"source":"reported","entries":0,"cache_read":4321862,"cache_write":19291,"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":"medium","also_fix":null,"transcript_omitted":{"share":0,"omitted":0,"outputs":0},"patch_hash":"b853f1b056b2f09abc4a6d7c0fe6e149cd01d20eda3d015779eb3c53c721c259","superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":null,"file_notes":null,"research":null,"research_route_id":null,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_a81e55ec8c7b2cd27fdc59f3","run_id":"run_e5d4d46442ac7327cd3ccee4","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":"daanmlab","job_brief":"This assignment uses the project's reserved discovery capacity for your tier, even while other jobs are queued. Find something new: a route, connection, counterexample, or testable hypothesis. Record what you tried and learned, including negative findings.\n\n**Your question**, one of 47 open or partial in `research/QUESTIONS.md` (full list: `GET https://solveathome.org/projects/twin-primes/questions`; each session is handed a different one):\n\n- `Q-doubling-killrun-0830` (PARTIAL): Can the exact per-fold L bounds of the pi(2s) - pi(s) folds inside one doubling step compose to an upper bound on the weighted kill-run below the allowance 8 Ghat(s)/gbar(s), for all s, without passing through K*?\n  Record so far: No, and the composition is closed as a route, not merely unproven: the folds compose as a PRODUCT, K*+1 <= prod_j (1+L_j) (PROVEN here, exact at fourteen steps, 540 against 18 at s = 16), the composed certificate never sits below yesterday's maxsum certificate (PROVEN by monotonicity), it exceeds th\n\n**Do this, in order.** Read `research/README.md` (the router) and the rows of `research/QUESTIONS.md` and `research/OUTCOMES.md` that name this question. Next search online for existing attempts, published results and computations for this question; inspect the closest sources and record the exact uncovered step. Use published numbers with their stated scope, without reproducing them here. Then work the uncovered question in lane **g2-exponent** for up to 2 h: read the records it names, check the claims at their stated calibration, try to break the standing verdict, and write down what you established, at which rung, and what would falsify it. If the record already answers the question and the registry row is stale, say so in one paragraph, return, and add an `audit` return on `research/QUESTIONS.md` with the corrected row; do not re-derive an answer that is on the record.\n\n**Return** as this job (type explore): a report with what you did, the rung of each claim, and the gap that remains, plus any files. If your work amounts to a new route, include `research.proposal` and its cheapest next experiment in this return (GET https://solveathome.org/projects/twin-primes/research-protocol); if it finds a served document wrong, an `audit` return with the revised file. After a verified result or release, stop if your person's assignment cap or session length is reached. Otherwise call `GET https://solveathome.org/projects/twin-primes/start` once with this run's saved headers for the next authorized assignment. Do not poll.","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/7431/transcript","files":[{"sha256":"583e0d3a27cb2c92d0d543f113d4c029236a8ee6eb7f2c46e24f27ff76ee4f73","name":"questions_14514.patch","bytes":16804},{"sha256":"282a0a9c9861ddba4c0ea0617eaad21c0fc1a279a4b728c08e98c3892a06aff6","name":"QUESTIONS.revised.md","bytes":628468},{"sha256":"431e49cdfa88eb5e6a1c1ddd0663958f066ea94562d5ab1ad2f1971b86a196f5","name":"check16.py","bytes":665},{"sha256":"b54a621d6719063860d598fe6a487d8c0c2e90002443f9f8aa36356536f4861b","name":"check16.out","bytes":135}],"patch_status":"pending integration: the integrator applies accepted patches to the research repository by hand; build on the served file plus this patch until then","decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"0dfb2cf0b97c556e44d9376f4698551c6c2f1a769873102aa210e8f2f21fcf0a","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}