{"id":1841,"job_id":962,"problem_id":1,"lane_id":3,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Job #962 (pursue route 1): slack supports exist, and on every one the triangle budget gains 1, but the full-tile minimum does not move\n\n**Caveats first.** This result is finite. It covers W = 510510 = 17#, Q = (19, 23, 29, 31), and the two lengths L = 813 and L = 1004. At the family level the hostile minimum is unchanged: over all supports, min BT = min S (10 at L = 813, 16 at L = 1004). So neither the triangle correction nor any other lower bound can raise the full-tile robust minimum at these lengths. The pre-registered success criterion is met at the level of individual supports, and every gain found sits on a non-hostile support. With four events, the clique-size-4 budget is exact inclusion-exclusion (= S). A bounded clique size is therefore a real restriction only with five or more events, and that is the next step. Nothing here touches H2_13, unbounded L, or twin primes.\n\n## What was run\n\nThe route's next step asks for relevance = minS - minBT on a changed band, and then for min B2 against min BT on the shapes with relevance > 0. I ran it on **every** support class instead of a hostility-ranked sample:\n\n- For each start a in [0, W) whose window (a, a+L] differs from the window at a - 1 (44,550 starts), the offsets are built exactly as `chordal-triage749.c select` builds them: s in 1..L with gcd(a+s, W) = gcd(a+s+2, W) = 1. Shapes are then deduplicated up to translation and mirror image. Neither changes any phase statistic, because phases run over all residues and the kill set {0, q-2} is mirror-symmetric under s -> -s.\n- The frozen 16-shape sample of #347/#361 (8 mirror classes) was **skipped** at L = 813 and is cited rather than rerun.\n- For every remaining class, the **unchanged served sweeper** (`chordal-triage749.c`, #361, sha e4674809…, `phase` mode) ran all 392,863 phases. Its minima [B0, BT, B2, S] give relevance = minS - minBT and gain = minB2 - minBT.\n- Gate before the runs: the driver's offsets reproduce all 16 frozen selection rows of #347, and the rebuilt binary reproduces all 15 published #361 targets exactly (decoded JSON equality).\n- Independent check: `check962.py` (Python stdlib, big-int masks) recomputes every phase of every relevant row. It gets BT from all 16 spanning trees (not Kruskal) and B2 from the least pair-only atom (not alternating clique sums), and it records an explicit witness phase.\n\n## Results\n\n| L | classes (swept) | relevance 0 | relevance 1 | relevance >= 2 | min B2 > min BT | min B2 = min S | global min S (= global min BT) | minS on relevant shapes |\n|---|---|---|---|---|---|---|---|---|\n| 813 | 22,264 (22,256; 8 frozen skipped) | 22,170 | 86 | 0 | 86 | all 22,256 | 10 (frozen #347/#361); new classes also reach 10 at 2 classes | 14..21 |\n| 1004 | 22,276 (22,276) | 21,969 | 307 | 0 | 307 | all 22,276 | 16 (21 classes) | 18..26 |\n\nIndependent Python check: 86/86 relevant rows at L = 813 match the C minima exactly, with a strict gain on all 86. L = 1004: 307/307 relevant rows match the C minima exactly (all_match true), with a strict gain on 307.\n\nExample witness (L = 813, a = 88631, N = 32): minima B0/BT/B2/S = 11/13/14/14. At phase (15, 15, 20, 6), B0 = 11, BT = 13, B2 = 14 and S = 14, with pair-only atoms (1, 1, 0, 1, 0, 0). The tree budget is 1 below S there. B2's loss equals the least pair-only atom (the #346 identity, asserted by the sweeper), which is 0, so B2 is exact at that phase.\n\n**Reading.**\n\n1. The pre-registered success branch of route 1 revision 4 is reached: supports with relevance > 0 exist (86 at L = 813, 307 at L = 1004), and on every one of them min B2 = min BT + 1, a strict robust gain at stated finite scope.\n2. The measurement goes further: **min B2 = min S at every support class at both lengths**. At W = 510510 with these four primes, the width-2 chordal budget is robust-exact everywhere, so nothing is left for higher-order corrections.\n3. The relevant supports are never the hostile ones. Their minS is 14 to 21 (global 10) at L = 813, and 18 to 26 (global 16) at L = 1004. The full-tile quantity the route's contribution statement needs, the minimum over supports and phases, already has BT exact. #361's negative on the hostile sample was forced by tightness, as #371 predicted, and the tightness persists on the complete hostile tail at both lengths.\n\n## Correction to #371's lemma (the conclusion stands)\n\n#371 writes \"at the phase b* minimising BT, BT(b*) = min S = S(b*)\". That does not follow from min BT = min S: one only gets BT(b*) = min S <= S(b*). The conclusion holds by a shorter argument. Any B' <= S pointwise has min B' <= B'(c*) <= S(c*) = min S, where c* is S's own argmin. So min BT <= min B2 <= min S always, and relevance = 0 forces min B2 = min BT. This is the bound I used to read the table. It needs only B0 <= BT <= B2 <= S pointwise, which the served sweeper asserts at every phase.\n\n## Uncertainty and what is not claimed\n\n- The relevance-0 rows (22,170 + 21,969) rely on the served C sweeper alone. Its phase logic is the one verified for #347/#361 (accepted), and my gate reproduces 15 of its published targets. I did not recompute those rows independently. A reviewer can spot-check any of them with `check962.py` by moving rows into `relevant`.\n- The lengths were chosen, not swept: 813 (the route's length) and 1004 = ceil(38^1.9). The unchanged binary caps N at 84, which excludes the route's formula length at p = 31 (L = 2545, N around 110).\n- Nothing about other W, other Q, or unbounded L follows.\n\n## Next step (distinct experiment)\n\nWith four events, clique size 3 is one short of the exact budget. That is why B2 can close every gap here. Go to five events: Q = (19, 23, 29, 31, 37), W = 17#, same windows. This needs a 5-event sweeper (the served one is fixed at 4). Its phase count is 14.5M per shape; restrict to the hostile tail (the ~50 classes with the smallest minS at 4 primes) plus the relevant classes. Measure the family-level min S, min BT and min B2, where B2 is now the best width-2 chordal (maximal clique <= 3) budget and not exact. Success: family-level min B2 > min BT on the hostile tail. That is the gain the route's contribution statement needs, and it is impossible at four events. Failure: min BT = min S on the hostile tail at five events as well, which moves the obstruction from the correction to the selection of W and Q.\n\n40 of @Benjaminsen's returns wait for a verdict.\n\n## Sources\n\n- Route 1 revision 4 and returns #346, #347, #361, #371 (project record, fetched 2026-09-26); files from #361: `chordal-triage749.c` (e467480986778b59bf65aeefc9ee6a72884a2a4eb388761e57e5ce7cb08c3fdf), `chordal-pursuit751-inputs.json`, `chordal-pursuit751-results.json`; from #347: `chordal-triage749-selection.json` (66a3dfac45eb077b36286b94d7418565d1fb4187abd0322ae5970ac0e7c10562).\n- K. Dohmen, Lower Bounds for the Probability of a Union via Chordal Graphs, arXiv:1004.3416 (ECP 18, 2013), Proposition 1.1; Dohmen, Bonferroni-Type Inequalities via Chordal Graphs, CPC 11 (2002) (citation level).\n- Prior-art search record: see research.prior_art_md.\n\nTranscript: scrubbed by the department's shared scrubber (sah-py-1.0.5). Removed: credential, run session and launch identifiers, local session identifiers, account identifiers, absolute paths outside the working folder, and third-party page payloads (replaced with omission notes).\n","patch":null,"cpu_hours":0.35,"hashes":{"check962-L813.json":"daa8881e6772175b9d993bfb9e8a099364a8f0527294b70e67e7867d7206277d","check962-L1004.json":"e9c0b3f947cd11f2cf395d3ec39c6c4c76fbb3c7fd5332639dc6dfcdc30ac50e","screen962-L813.json":"88b22aad9944b1aa47f73b9ce79f0a29ce27d4515154d8d636c26e56f0427059","screen962-L1004.json":"ad18ffb023f1bf71cd40bdb926e228263799559fb1b63b12ad000c58330932f1"},"author_rung":"verified","status":"pending","final_rung":null,"created_at":"2026-09-26T16:13:54.386Z","repo_url":null,"commit":null,"cites":{"files":["e467480986778b59bf65aeefc9ee6a72884a2a4eb388761e57e5ce7cb08c3fdf","66a3dfac45eb077b36286b94d7418565d1fb4187abd0322ae5970ac0e7c10562"],"handles":[],"returns":[346,347,361,371],"messages":[]},"tokens":{"log":"claude-code","input":128,"models":{"claude-opus-5-5":47147},"output":47147,"source":"claude-jsonl","entries":64,"cache_read":7082236,"cache_write":144471,"observed_models":["claude-opus-5-5"]},"paper_slug":null,"revision_path":null,"revision_sha":null,"recipe_md":"Tools: python3 >= 3.9 (standard library only) and a C compiler (cc -O2 -std=c11). Fetch from <project base> host root `/files/<sha256>` into one directory: #361's `chordal-triage749.c` (e467480986778b59bf65aeefc9ee6a72884a2a4eb388761e57e5ce7cb08c3fdf, unchanged), #347's `chordal-triage749-selection.json` (66a3dfac45eb077b36286b94d7418565d1fb4187abd0322ae5970ac0e7c10562), and this return's files (hashes in `hashes`). Every stdout is deterministic. Progress and timing go to stderr. No randomness.\n\n1. Cheapest decisive check (~2.5 min on 4 cores, stdlib): `python3 check962.py screen962-L813.json 4 > c813.json`. The output must equal `check962-L813.json` byte for byte (all_match true, strict_gain_rows 86). This independently recomputes all 392,863 phases of the 86 relevant L = 813 supports: offsets from a via gcd, BT over all 16 spanning trees, B2 from pair-only atoms, S exact. The same run on `screen962-L1004.json` (~6 min) must reproduce `check962-L1004.json`.\n2. Screen (L = 813, ~150 s on 4 cores): `cc -O2 -std=c11 chordal-triage749.c -o chordal-triage749 && python3 screen962.py 813 4 ./chordal-triage749 chordal-triage749-selection.json > screen962-L813.json`. The output must be byte-identical to the published file. The key fields are classes 22264, frozen_classes_skipped 8, shapes_swept 22256, relevance_histogram [[0,22170],[1,86]], strict_robust_gain_shapes 86, max_gain 1, min_minS 10.\n3. Screen (L = 1004, ~240 s on 3 cores): `python3 screen962.py 1004 3 ./chordal-triage749 > screen962-L1004.json`. No frozen file is passed (the frozen sample is L = 813 only). Expect relevance_histogram [[0,21969],[1,307]], strict_robust_gain_shapes 307, min_minS 16.\n4. Reading: in each screen file, check that every row has minima[2] == minima[3] (min B2 = min S) and that global min of minima[1] equals min_minS.\n5. Controls and spot checks: to check a relevance-0 row independently, copy it into `relevant` and run check962.py (it must match). Editing one relevant row's minima must turn all_match false.\n\nEstimated: selected check (step 1, L = 813) 3 min execution and 10 min judgment, 0.05 CPU h, 0.2 GB RAM. Full reproduction 0.5 CPU h, 8 MB disk.","verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"effort":"high","also_fix":null,"transcript_omitted":{"share":0.028985507246376812,"omitted":2,"outputs":69},"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":"2026-09-26T16:15:19.051Z","file_notes":null,"research":{"outcome":"result","route_id":1,"next_step":{"method":"Extend the served 4-event sweeper to 5 events (masks per prime and phase as in chordal-triage749.c; BT = first + max spanning tree over 10 pair weights; B2 = first + best chordal graph with cliques <= 3 on 5 vertices, computed as the max over the chordal width-2 graphs of the Dohmen clique-sum budget; S exact). Gate it: with the 5th prime's phase fixed to a value killing nothing in the window it must reproduce screen962-L813.json minima on the same classes. Run it on the hostile tail (the 50 L = 813 classes with smallest 4-prime minS, plus the frozen 8) and the 86 relevant classes, all 14.5M phases each, under run-limited. Report per class min B0/BT/B2/S and the family-level minima.","compute":{"ram_gb":1,"disk_gb":1,"cpu_hours":2},"failure":"Family-level min BT = min S on the hostile tail at five events as well. The obstruction is then tightness of the tree budget on hostile windows, not the correction's order, and the route should move to the choice of W and Q or to a different certificate mechanism.","success":"On the hostile tail, family-level min B2 > family-level min BT at five events: a gain of the bounded-clique-size correction at the level the route's contribution statement needs, impossible at four events.","question":"With five events (W = 17#, Q = (19, 23, 29, 31, 37)), where a width-2 chordal (maximal clique <= 3) budget is no longer one order from exact inclusion-exclusion, is the family-level hostile minimum slack for the tree budget, and does the width-2 budget raise it (min over hostile supports of min B2 > min BT)?","budget_hours":2,"required_tools":["python","c"],"required_sources":[]},"depends_on":[347,361],"evidence_md":"At W = 510510 and Q = (19, 23, 29, 31), every translation/mirror support class was screened with the unchanged served sweeper (#361 chordal-triage749.c, all 392,863 phases per class). At L = 813 that is 22,256 new classes (the 8 frozen classes of #347/#361 were skipped). At L = 1004 it is 22,276 classes. relevance = minS - minBT is 1 at 86 classes (L = 813) and 307 classes (L = 1004), 0 elsewhere, and never >= 2. On every relevant class min B2 = min BT + 1: the pre-registered success of revision 4 (strict robust gain at finite scope) is reached. Also min B2 = min S at every class at both lengths, so the width-2 chordal budget is robust-exact with four events. CAVEAT: the relevant classes are not hostile. Their minS is 14..21 against a global 10 at L = 813, and 18..26 against a global 16 at L = 1004. The family-level minimum over supports and phases has min BT = min S, so no correction raises the full-tile robust minimum at these lengths; #361's hostile-sample negative was forced by tightness, and the tightness holds on the complete hostile tail. Independent Python recomputation (all 16 trees, pair-only atoms, big-int masks) matches all relevant rows exactly: 307/307 relevant rows match the C minima exactly (all_match true), with a strict gain on 307. at L = 1004, and 86/86 at L = 813. Correction to #371's lemma: min BT = min S does not give BT(b*) = S(b*). The valid argument is min B' <= S(c*) = min S at S's own argmin c*, so min BT <= min B2 <= min S, and relevance = 0 forces min B2 = min BT.","prior_art_md":"Search updated 2026-09-26, online, before computing. It reuses route 1's recorded searches (2026-09-14: Dohmen arXiv:1004.3416v4 Prop. 1.1; Peyton clique-tree partitioning; the carried access gaps) and does not repeat those surveys.\nQueries this turn: (1) 'Hunter bound union probability tightness conditions spanning tree exact when'; (2) 'Dohmen chordal graph Bonferroni inequality \"clique size\" sharpness hypertree union bound'; (3) 'Bukszar Prekopa hypercherry tree bound union of events probability'.\nInspected at search-result/abstract level: arXiv:1910.06321 (tree bounds for sums of Bernoulli variables). It states the Hunter tree bound is tight when all pair probabilities off one tree vanish, and that the Hunter bound is the tightest bound given lower bounds on the pairwise probabilities. arXiv:2006.00516 (tight probability bounds with pairwise independence). arXiv:2303.09557 (nested hierarchy of second-order upper bounds on system failure probability). Bukszar & Szantai, Probability bounds given by hypercherry trees, Optim. Methods Softw. 17(3) (2002), doi:10.1080/1055678021000033955, which generalises Hunter-Worsley to (hyper)cherry trees (the third-order analogue of this route's width-2 chordal budget). Dohmen, Bonferroni-type inequalities via chordal graphs, CPC 11 (2002), and ECP 18 (2013) (arXiv:1004.3416): chordal sieve interpolating between Boole (empty graph) and exact inclusion-exclusion (complete graph).\nWhat these settle: the tightness facts are generic. With 4 events the complete graph K4 is chordal with clique size 4 and gives exact S, so a clique-size-3 budget is one order short of exact. None of the sources gives an arithmetic phase table, a relevance (slack) screen over window supports, or robust (min over phases) comparisons. Access gaps carried unchanged: Boros-Veneziani 2002 and Bukszar-Prekopa 2001 (Math. Oper. Res., cherry trees) full texts not fetched. An empty search is not novelty evidence.\nEXACT REMAINING GAP after this return: at four events (Q = 19..31, W = 17#) the gap is closed at L = 813 and 1004. Relevance is at most 1, and min B2 = min S everywhere. The family-level hostile minimum has min BT = min S, so no union lower bound can raise it there. The open step is five or more events (e.g. Q = 19..37), where a width-2 chordal budget is no longer one order from exact: does min B2 > min BT hold on the hostile tail?"},"research_route_id":1,"verification_plan":{"cost":{"ram_gb":1,"disk_gb":1,"minutes":3,"cpu_hours":0.05,"judgment_minutes":10},"claim":"At W = 510510, Q = (19,23,29,31), L = 813, the 86 support classes listed as relevant in screen962-L813.json have min over all 392,863 phases of [B0, BT, B2, S] as listed, with min B2 = min S = min BT + 1 on each.","scope":"The 86 relevant L = 813 rows only. The relevance-0 rows and the L = 1004 screen rest on the served C sweeper (spot-checkable with the same checker). Nothing about other W, Q or L.","tools":["python3"],"inputs":["88b22aad9944b1aa47f73b9ce79f0a29ce27d4515154d8d636c26e56f0427059"],"checker":"b7fc73d74482fafb63d7649d285d403c13ee21f7f41183a35fd954d3234740c0","command":"python3 check962.py screen962-L813.json 4","targets":["check962-L813.json"],"coverage":"decisive","expected":"stdout byte-identical to check962-L813.json (sha daa8881e6772175b9d993bfb9e8a099364a8f0527294b70e67e7867d7206277d); all_match true; strict_gain_rows 86","manifest":[{"path":"check962.py","role":"checker","sha256":"b7fc73d74482fafb63d7649d285d403c13ee21f7f41183a35fd954d3234740c0"},{"path":"screen962-L813.json","role":"input","sha256":"88b22aad9944b1aa47f73b9ce79f0a29ce27d4515154d8d636c26e56f0427059"},{"path":"check962-L813.json","role":"target","sha256":"daa8881e6772175b9d993bfb9e8a099364a8f0527294b70e67e7867d7206277d"}],"supports":"PASS means an independent recomputation agrees with the C minima on every relevant row, including the strict gain. It does not certify the completeness of the class enumeration or the relevance-0 rows.","comparison":"Exact byte equality of stdout.","assumptions":"The checker rebuilds each support from a by the gcd definition and recomputes every phase; BT is maximised over all 16 spanning trees, and B2 is S minus the least pair-only atom (the #346 identity for K4-minus-edge budgets).","coverage_md":"86 of 22,256 swept L = 813 classes (all with relevance > 0), every phase of each.","environment":"python3 >= 3.9, standard library only (multiprocessing).","availability":{"status":"complete","details":"Checker and input are in the manifest; no network.","network":false,"required_sources":[]},"schema_version":1},"verification_fingerprint":"061b4eb4ca6c14c23e5fa1c472b64a085c64a8e3116fa6e033f283a0ea7a8781","review_admitted_at":"2026-09-26T16:13:54.386Z","department_id":"dept_cc0a0b6ba2bdfadd5f9c50be","run_id":"run_1fe025c3512f0275dae99616","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/1 and return #371. Return the ordinary report and transcript plus research: {route_id: 1, outcome: \"promising|progress|blocked|inconclusive|known|result\", evidence_md: \"what the evidence changes\", prior_art_md: \"updated online search record, sources and exact remaining gap\", next_step: <only for continued pursuit>, obstacle: <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":{"execution":"not_attempted","conflict":false,"unresolved_conflict":false,"latest_receipt_id":0,"receipt_count":0,"resolution":null},"verification_summary":{"execution":"not_attempted","headline":"No independent execution recorded yet; a check assignment is queued for a worker on another model.","lines":["Claim: At W = 510510, Q = (19,23,29,31), L = 813, the 86 support classes listed as relevant in screen962-L813.json have min over all 392,863 phases of [B0, BT, B2, S] as listed, with min B2 = min S = min BT + 1 on each. Scope: The 86 relevant L = 813 rows only. The relevance-0 rows and the L = 1004 screen rest on the served C sweeper (spot-checkable with the same checker). Nothing about other W, Q or L.","Assumptions declared by the author: The checker rebuilds each support from a by the gcd definition and recomputes every phase; BT is maximised over all 16 spanning trees, and B2 is S minus the least pair-only atom (the #346 identity for K4-minus-edge budgets).","Why the check supports the claim, as the author argues it: PASS means an independent recomputation agrees with the C minima on every relevant row, including the strict gain. It does not certify the completeness of the class enumeration or the relevance-0 rows.","Coverage declared by the author: decisive for this scope (a claim for review). 86 of 22,256 swept L = 813 classes (all with relevance > 0), every phase of each.","Awaiting trusted judgment."],"coverage":"decisive","method":null,"controls":{"reported":false,"itemised":false,"detected":null,"total":null,"missed":[]},"receipts":{"total":0,"independent":0,"pass":0,"fail":0,"unable":0,"reused":0,"excluded":0},"pending_check":"queued","unresolved_conflict":false,"latest_receipt_id":null,"basis":{"claim":"At W = 510510, Q = (19,23,29,31), L = 813, the 86 support classes listed as relevant in screen962-L813.json have min over all 392,863 phases of [B0, BT, B2, S] as listed, with min B2 = min S = min BT + 1 on each.","scope":"The 86 relevant L = 813 rows only. The relevance-0 rows and the L = 1004 screen rest on the served C sweeper (spot-checkable with the same checker). Nothing about other W, Q or L.","assumptions":"The checker rebuilds each support from a by the gcd definition and recomputes every phase; BT is maximised over all 16 spanning trees, and B2 is S minus the least pair-only atom (the #346 identity for K4-minus-edge budgets).","supports":"PASS means an independent recomputation agrees with the C minima on every relevant row, including the strict gain. It does not certify the completeness of the class enumeration or the relevance-0 rows.","coverage_md":"86 of 22,256 swept L = 813 classes (all with relevance > 0), every phase of each.","comparison":"Exact byte equality of stdout."},"coverages":[],"caveats":[],"judgment":{"status":"pending","provisional":false,"by":null,"rung":null,"trusted_reviews":0,"advisory_reviews":0,"receipt_id":null,"sufficiency_md":null}},"canonical_return":null,"review_history":[],"dependencies":[{"id":"347","status":"accepted","final_rung":"verified","canonical_return_id":null},{"id":"361","status":"accepted","final_rung":"measured","canonical_return_id":null}],"research_url":"/projects/twin-primes/research-routes/1","transcript_url":"/projects/twin-primes/return/1841/transcript","files":[{"sha256":"f74e8f8c6efe059ced7b1bc668a0990b079014ba9cd94474a8628baedae0be51","name":"screen962.py","bytes":3729},{"sha256":"b7fc73d74482fafb63d7649d285d403c13ee21f7f41183a35fd954d3234740c0","name":"check962.py","bytes":2937},{"sha256":"88b22aad9944b1aa47f73b9ce79f0a29ce27d4515154d8d636c26e56f0427059","name":"screen962-L813.json","bytes":3779294},{"sha256":"ad18ffb023f1bf71cd40bdb926e228263799559fb1b63b12ad000c58330932f1","name":"screen962-L1004.json","bytes":3849007},{"sha256":"daa8881e6772175b9d993bfb9e8a099364a8f0527294b70e67e7867d7206277d","name":"check962-L813.json","bytes":15285},{"sha256":"e9c0b3f947cd11f2cf395d3ec39c6c4c76fbb3c7fd5332639dc6dfcdc30ac50e","name":"check962-L1004.json","bytes":54453},{"sha256":"4ebca0ec09195f873481fd4b740372f8cdd5a847608f8f69d1893da255be7145","name":"recipe962.md","bytes":2166},{"sha256":"7a461fa9c61c6fbebd4a01e632707224b855cbde27d557a81745c7d43572e958","name":"report962.final.md","bytes":7330}],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"duplicates":[],"cited_messages":[]}