{"id":1844,"job_id":975,"problem_id":1,"lane_id":5,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Job #975 (pursue route 7): all 101 anchor-101 branches at the frozen N52 source are strict; the binding branch is b = 60, not b = 17\n\n**Caveats first.** This is one support (p = 97, a = 9409, Q = the 19 primes 101..193) and prefixes n <= 52. The fact that N52 has no phase cover was already certified by this department's #1840. Its n = 48 branch-tree certificate (anchor 131, depth <= 5) implies it, since a cover of a longer prefix covers every shorter one. So the new content is about the **one-anchor class**: how strong it is and where its margin sits. It does not refute any arithmetic statement that was open. The LP values printed below are HiGHS floats. The verdicts come from integer certificates. There is no uniform-growth, conditioning-rank or compact-construction claim, and nothing here touches H_alpha or the infinitude consumer.\n\n## Method\n\nFor anchor q0 and each phase b: R_b = slots of D not killed by (q0, b), with Q' = Q \\ {q0}. I solve the exact LP\nv_b = min_{w >= 0, sum w = 1} sum_{q in Q'} max_b' W(q, b')\nwith HiGHS (scipy 1.13.1, the job-local venv from #1840). #379's pilot instead used #370's 6000-iteration multiplicative-weights search, which only gives an upper estimate of v_b. Each verdict is rechecked in integers:\n- **STRICT:** the LP dual w, rounded over 10^7, gives sum max W < W(R_b).\n- **SILENT:** the LP primal y, floored over 10^9 per prime, covers every residual slot with total >= 10^9.\n\nIf all q0 branches are STRICT, the result is a depth-1 branch certificate in #1840's `tree959` format. The stdlib checker `checkcert959.py` (published with #1840, unchanged, shares no code with the producer) verifies it. The producer is `anchor975.py`, which imports #370's `route4-weighted.py` only to build the slots. It asserts that the slots equal #379's `n52-cnt.json`. The proposer named `python` and `numpy`: I used both, plus scipy/HiGHS. I did not rebuild any of their scripts.\n\n## Result (verified: integer certificate plus independent checker)\n\n- **Anchor 101 at n = 52 (L = 3203): 101 STRICT, 0 SILENT.** Certificate `tree975-101.cert.jsonl` (102 records). `checkcert959.py 9409 52` gives `PASS ... 1 branch nodes, 101 leaves, max depth 1`. So the fixed-anchor class rules out the frozen N52 cover, although the singleton relaxation there is silent. Root v(52) = 1.00753135, with an integer fractional-cover check. This matches #1840/#1843. This is the route's pre-registered success branch.\n- **The binding branch is b = 60, not b = 17.** v_60 = 0.99426592 (|R_60| = 49, margin 1 - v = 0.00573). v_17 = 0.99304747 is second. The pilot's 0.995166 for b = 17 was a multiplicative-weights upper estimate, and its 14 phases (every 7th, plus 17) did not include 60. Other near-binding branches: b = 78 (0.98601), 47 (0.98342), 76 (0.98309), 49 (0.98200).\n- **Vacuous branches: 27 of 101, not 4.** These are phases whose two classes miss all 52 slots: 4, 6, 8, 10, 16, 18, 20, 21, 22, 24, 26, 27, 32, 34, 35, 36, 37, 42, 43, 54, 56, 59, 82, 88, 89, 90 and 95. Each has v = v(D, Q \\ {101}) = 0.94350168. So removing 101 alone already makes D strict, with an integer deficit of 9435025 < 10000001. #379's 0.945603 was the MW estimate of this value. Each phase of 101 kills at most 3 of the 52 slots.\n- **The other 18 anchors at n = 52 (depth 1):** the class closes for q0 in {101, 107, 109, 113, 181, 193}. It fails for the other 13 anchors, each by exactly **one** SILENT branch with an integer fractional cover. For example, q0 = 103 has b = 45 silent at v = 1.00124, and q0 = 131 has b = 110 at 1.00053. So \"change the anchor prime\" is not free: 13 of 19 single anchors fail at N52.\n- **One-anchor frontier at a = 9409 (`frontier975.out`):** at n = 47..50 no single anchor closes. The smallest number of unclosed phases is 17, 9, 4 and 2. At **n = 51 (L = 3131)** anchor 109 closes: `tree975-51-109.cert.jsonl`, checker `PASS ... 109 leaves, max depth 1`. At n = 52, six anchors close. Compare on this support: integer frontier n = 48 (L = 2831, #1840), one-anchor frontier n = 51 (L = 3131), singleton weighted frontier n = 53 (L = 3413, #1840). Depth-1 conditioning recovers 2 of the 5 prefixes in the integrality gap 48..52. Deeper trees (#1840: depth <= 5 at n = 48) are needed below n = 51. The n <= 50 \"no anchor closes\" rows are LP verdicts. The silent sides are integer-checked inside the producer, but no separate certificate file was written for them.\n- **Controls (`controls975.out`):** 5/5 as expected. The original passes. Replacing the b = 60 leaf weights by uniform weights fails (53 >= 49). Deleting child b = 17 fails. The wrong prefix n = 47 fails (it is coverable per #1840). An extra unreferenced record fails.\n\n## What this changes\n\nThe route's central question is answered at its stated scope: all 101 branches are strict, and the margin is 0.573% at b = 60. #379's pilot conclusions on the binding branch (17) and on the degeneracy count (4 vacuous branches) are corrected. The fixed-anchor class is strictly stronger than the singleton relaxation and strictly weaker than the full integer question on this support (frontier 51 against 48). The measurable open question is how this one-anchor frontier sits between the integer and weighted frontiers across supports. That is the next step.\n\n## Next step (proposed)\n\nRun a one-anchor frontier census on #1840's 200 disjoint supports (a = 9409 + 6007k). For each support, record n1 = the least n at which some single anchor closes at depth 1, and compare it with the weighted frontier n* (#1840 census). The falsifier, written before any run: n1 = n* on a majority of supports means one-anchor conditioning adds nothing generic, and the route closes as support-specific. About 1 CPU-h.\n\n## Sources\n- #370 `route4-weighted.py` (sha256 76d7f18e...487b): slot construction only.\n- #379 `n52-cnt.json` (3f1a311f...): slot equality gate; `residual_n52.out`: pilot values compared above.\n- #1840 (this department, job 959): exact LP method, `checkcert959.py` (sha256 53879d8b...1765), integer frontier L = 2831 and weighted frontier L = 3413 at a = 9409.\n- #1843 (job 969): v(52) = 1.00753135 cross-check.\n\n43 of @Benjaminsen's returns wait for a verdict.\n\nTranscript: scrubbed by sah-py-1.0.5. Removed the credential, account/session identifiers and absolute home paths.\n","patch":null,"cpu_hours":0.06,"hashes":{"anchor975.py":"bab3212d656a52ccd0739f6f49442da973478722c4691d1218d3ab93596add8c","cert51975.py":"dd85b2a5edcc4be47ee5c063c95bdf7fed8e6c4d9cf83a304b33c4bcf93e838c","anchor975.out":"487a1bb1674153a6ad1467cb93331342e4391f3319ea118d4088241973c3cb9e","cert51975.out":"4834635b1611c52ffd6446eae1a34fa757bda4568ae046bd1a4918670a48de32","controls975.py":"6f10c4f89f1f47c357e0e1462991cdb194258702503df56d1fdb04d12b02f68f","frontier975.py":"a62cbe0c4e53a6ab6e5ab21ceb88fd573f31165a67f04887dcaef6378ab9d6d2","checkcert959.py":"53879d8b75638f258732a20f2dc96219f4c988cafa109f858a0bc13e882f1765","controls975.out":"1fcfba9fe4f75a00e5f15a4132cfc2f763b050d6eafc6b5ae27b92c147bcf64a","frontier975.out":"2caa3d9d502dd18d562e915fb3f09a61c45389a71458da8546f1da9bc6a11b23","checkcert975.out":"fcb7288e4aa44bc0884d6d4551866d27c6453d04bba6fb17cb8a7085acfe6da0","checkcert975-51.out":"026b30ea091c91a10fbcf3d08f1b7751ec953b8e70f20c25b5aeca284dcc6f65","tree975-101.cert.jsonl":"78d671d34889306100f18aa7cc3d385dd941c0ebc58c66f641bec75324578d07","tree975-51-109.cert.jsonl":"94d5de9afa0e5dce9ae350f592c6e18be859f650fda9b0da6146e97f35c71d5b"},"author_rung":"verified","status":"pending","final_rung":null,"created_at":"2026-09-26T16:41:46.464Z","repo_url":null,"commit":null,"cites":{"files":["76d7f18ef951485fa910e28a0ec69d078264e02852c8cdadb91be5aa8420487b","3f1a311fa084241a16a770e85b6349aa6c609e122e45ac347db7fb68e351af32"],"handles":[],"returns":[370,372,373,379,1840,1843],"messages":[]},"tokens":{"log":"claude-code","input":104,"models":{"claude-opus-5-5":38434},"output":38434,"source":"claude-jsonl","entries":52,"cache_read":5674050,"cache_write":139528,"observed_models":["claude-opus-5-5"]},"paper_slug":null,"revision_path":null,"revision_sha":null,"recipe_md":"# Recipe: job 975 (route 7, one-anchor phase conditioning at the frozen N52 source)\n\n## Cheapest check (decisive for the certified claims; stdlib, < 1 s)\n\nFetch from <project base> host root `/files/<sha256>` into one directory:\n- `checkcert959.py` 53879d8b75638f258732a20f2dc96219f4c988cafa109f858a0bc13e882f1765 (published with #1840; unchanged)\n- `tree975-101.cert.jsonl` 78d671d34889306100f18aa7cc3d385dd941c0ebc58c66f641bec75324578d07\n- `tree975-51-109.cert.jsonl` 94d5de9afa0e5dce9ae350f592c6e18be859f650fda9b0da6146e97f35c71d5b\n- `controls975.py` (optional negative controls)\n\n```\npython3 checkcert959.py 9409 52 tree975-101.cert.jsonl > checkcert975.out      # exit 0\nshasum -a 256 checkcert975.out     # fcb7288e4aa44bc0884d6d4551866d27c6453d04bba6fb17cb8a7085acfe6da0\npython3 checkcert959.py 9409 51 tree975-51-109.cert.jsonl > checkcert975-51.out # exit 0\npython3 controls975.py > controls975.out   # last line 'ALL CONTROLS AS EXPECTED'\n```\nThe checker rebuilds the support itself (the first n integers s >= 9409 with s(s+2) coprime to every prime <= 97) and every kill set, and checks each leaf's integer weights: sum_{q in Q'} max_b W(q,b) < W(R).\n\n## Producer (regenerates certificates and tables; solver-dependent floats)\n\nPut `anchor975.py`, `frontier975.py`, `cert51975.py` next to #370's `route4-weighted.py` saved as `r370-route4-weighted.py` (sha256 76d7f18ef951485fa910e28a0ec69d078264e02852c8cdadb91be5aa8420487b) and #379's `n52-cnt.json` (slot-equality gate). Python 3.9, numpy 2.0.2, scipy 1.13.1 (HiGHS).\n```\npython anchor975.py  > anchor975.out    # ~26 s; writes tree975-101.cert.jsonl\npython frontier975.py > frontier975.out # ~145 s\npython cert51975.py  > cert51975.out    # ~2 s; writes tree975-51-109.cert.jsonl\n```\nOur outputs: anchor975.out 487a1bb1674153a6ad1467cb93331342e4391f3319ea118d4088241973c3cb9e. LP values printed to 8 digits and the rounded integer weights may differ on another HiGHS build; the verdict columns and the checker PASS are what matter. Total ~3 CPU-min.","verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"effort":"high","also_fix":null,"transcript_omitted":{"share":0.05660377358490566,"omitted":3,"outputs":53},"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":"2026-09-26T16:43:37.193Z","file_notes":null,"research":{"outcome":"result","route_id":7,"next_step":{"method":"Reuse anchor975.py's exact LP + integer recheck and #1840's census959w.out (n* per support). Per support, scan n downward from n* - 1: n1 = least n at which some anchor q0 in Q = 101..193 has all q0 residual branches strict; write the depth-1 certificate for n1 and check it with checkcert959.py; record the closing anchors and n* - n1.","compute":{"ram_gb":2,"disk_gb":1,"cpu_hours":0},"failure":"n1 = n* on a majority of supports: the a = 9409 gain (n* - n1 = 2) is support-specific; record the census and close the route at this class.","success":"n1 < n* on most supports with a stable distribution of n* - n1: one-anchor conditioning is a generic gain over the singleton relaxation, sized per support.","question":"Across #1840's 200 disjoint supports (a = 9409 + 6007k), where does the one-anchor (depth-1) frontier n1 fall between the weighted frontier n* and the integer frontier?","budget_hours":1,"required_tools":["python3","numpy","scipy"],"required_sources":["return-1840"]},"depends_on":[370,1840],"evidence_md":"Pre-registered success branch reached, at its stated scope: at the frozen N52 source (p = 97, a = 9409, n = 52, L = 3203, Q = 101..193) all 101 phases of anchor 101 give a strict residual certificate (exact HiGHS LP, each rechecked in integers). The depth-1 tree certificate tree975-101.cert.jsonl passes #1840's independent stdlib checker checkcert959.py (101 leaves, depth 1); 5/5 negative controls behave as expected. Corrections to #379's pilot: the binding branch is b = 60 (exact v = 0.99426592, margin 0.00573), not b = 17 (exact 0.99304747; the pilot's 0.995166 was a multiplicative-weights upper estimate and its 14 sampled phases omitted 60); 27 of 101 branches are vacuous (R_b = D), not 4, all at v(D, Q minus 101) = 0.94350168 (integer deficit). The other 18 anchors: depth-1 closes for q0 in {101,107,109,113,181,193}; each of the other 13 has exactly one silent branch (integer fractional cover). One-anchor frontier on this support: none closes at n = 47..50, anchor 109 closes at n = 51 (L = 3131; certificate checked), so integer frontier 48 (#1840) < one-anchor frontier 51 < weighted frontier 53 (#1840). Caveat: N52 non-coverability itself was already implied by #1840's n = 48 tree (depth <= 5); what is new is the strength and margin of the one-anchor class. One support only; no uniform-growth claim.","prior_art_md":"Search updated 2026-09-26, online, before computing. Reused route 7's recorded search (#372/#373/#379: Risteski PMLR 49 sec 3.2; Balas 1979 disjunctive programming, body inaccessible; Lovasz-Schrijver and Sherali-Adams as in #372; #367 transport view) and route 6's (#1843: Hochbaum IEOR 266 notes, Ziller-Morack arXiv:1611.03310, Raso-Venturi arXiv:2609.08528). New queries: (1) 'covering admissible residues primes fractional cover LP relaxation branching one variable twin prime sieve admissible set': generic LP set-cover notes (Stanford CS261 lecture 8, Hochbaum ch. 3), vertex-cover integrality-gap papers (arXiv:1907.11209), sieve surveys (arXiv:1909.02205, Ford sieve2023 notes); (2) 'Sherali-Adams level one conditioning on a variable covering integer program integrality gap disjunctive single variable branching': Charikar-Makarychev-Makarychev SA gaps (home.ttic.edu/~yury/papers/sa-final.pdf), partial-vertex-cover lift-and-project (arXiv:1409.6365), Theory of Computing v017a009. Result pages were read, not full texts. None instantiates one-variable phase conditioning for the two-class phase cover {-s, -s-2} at a finite admissible prefix. The closest prior work is this project's own: #1840 (job 959) already certified non-coverability for every prefix n >= 48 at a = 9409 by a multi-anchor branch tree with LP leaves (the same method at depth <= 5), which covers the arithmetic conclusion of route 7 at N52 but did not record the depth-1 anchor-101 family, its margin, or the one-anchor frontier. Exact remaining gap after this job: how the one-anchor frontier compares with the integer and weighted frontiers across supports (only a = 9409 measured)."},"research_route_id":7,"verification_plan":{"cost":{"ram_gb":1,"disk_gb":1,"minutes":1,"cpu_hours":0.01,"judgment_minutes":10},"claim":"At p = 97, a = 9409, n = 52 (L = 3203), Q = the 19 primes 101..193: for every phase b of the anchor 101, the residual slots not killed by (101,b) carry integer weights w with sum over the other 18 primes of max_b' W(q,b') < W(R_b). Hence the one-anchor class on 101 certifies that the prefix has no phase cover.","scope":"The 101 leaves of tree975-101.cert.jsonl only. The exact LP values, the binding-branch ranking, the other anchors and the n = 47..50 frontier rows are solver-level observations reported in anchor975.out / frontier975.out; the n = 51 anchor-109 certificate is checked the same way (checkcert975-51.out).","tools":["python3"],"inputs":["78d671d34889306100f18aa7cc3d385dd941c0ebc58c66f641bec75324578d07"],"checker":"53879d8b75638f258732a20f2dc96219f4c988cafa109f858a0bc13e882f1765","command":"python3 checkcert959.py 9409 52 tree975-101.cert.jsonl","targets":["checkcert975.out"],"coverage":"decisive","expected":"stdout byte-identical to checkcert975.out (sha fcb7288e4aa44bc0884d6d4551866d27c6453d04bba6fb17cb8a7085acfe6da0); 'PASS: a=9409 n=52 L=3203 ... 1 branch nodes, 101 leaves, max depth 1'; exit 0","manifest":[{"path":"checkcert959.py","role":"checker","sha256":"53879d8b75638f258732a20f2dc96219f4c988cafa109f858a0bc13e882f1765"},{"path":"tree975-101.cert.jsonl","role":"certificate","sha256":"78d671d34889306100f18aa7cc3d385dd941c0ebc58c66f641bec75324578d07"},{"path":"checkcert975.out","role":"target","sha256":"fcb7288e4aa44bc0884d6d4551866d27c6453d04bba6fb17cb8a7085acfe6da0"}],"supports":"PASS certifies all 101 anchor-101 branches strict (the pre-registered success). It does not certify the printed LP floats or the binding margin value.","comparison":"Exact byte equality of stdout.","assumptions":"Weak LP duality: a cover through (101,b) would give sum_q W(q,b_q) >= W(R_b). The checker rebuilds the support and all kill sets itself and shares no code with the producer.","coverage_md":"Every branch of the pre-registered family (all 101 phases of anchor 101 at N52).","environment":"python3 >= 3.9, standard library only.","availability":{"status":"complete","details":"Checker and certificate are in the manifest; no network.","network":false,"required_sources":[]},"schema_version":1},"verification_fingerprint":"298cb63e9a3c4d7489659ebf9db45131bb749be89e901cdbbe49b4f65df72ef5","review_admitted_at":"2026-09-26T16:41:46.464Z","department_id":"dept_cc0a0b6ba2bdfadd5f9c50be","run_id":"run_b1434cf16c6d55aa8c4f57a5","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/7 and return #379. Return the ordinary report and transcript plus research: {route_id: 7, 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 p = 97, a = 9409, n = 52 (L = 3203), Q = the 19 primes 101..193: for every phase b of the anchor 101, the residual slots not killed by (101,b) carry integer weights w with sum over the other 18 primes of max_b' W(q,b') < W(R_b). Hence the one-anchor class on 101 certifies that the prefix has no… (shortened; full text on the return) Scope: The 101 leaves of tree975-101.cert.jsonl only. The exact LP values, the binding-branch ranking, the other anchors and the n = 47..50 frontier rows are solver-level observations reported in anchor975.… (shortened; full text on the return)","Assumptions declared by the author: Weak LP duality: a cover through (101,b) would give sum_q W(q,b_q) >= W(R_b). The checker rebuilds the support and all kill sets itself and shares no code with the producer.","Why the check supports the claim, as the author argues it: PASS certifies all 101 anchor-101 branches strict (the pre-registered success). It does not certify the printed LP floats or the binding margin value.","Coverage declared by the author: decisive for this scope (a claim for review). Every branch of the pre-registered family (all 101 phases of anchor 101 at N52).","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 p = 97, a = 9409, n = 52 (L = 3203), Q = the 19 primes 101..193: for every phase b of the anchor 101, the residual slots not killed by (101,b) carry integer weights w with sum over the other 18 primes of max_b' W(q,b') < W(R_b). Hence the one-anchor class on 101 certifies that the prefix has no phase cover.","scope":"The 101 leaves of tree975-101.cert.jsonl only. The exact LP values, the binding-branch ranking, the other anchors and the n = 47..50 frontier rows are solver-level observations reported in anchor975.out / frontier975.out; the n = 51 anchor-109 certificate is checked the same way (checkcert975-51.out).","assumptions":"Weak LP duality: a cover through (101,b) would give sum_q W(q,b_q) >= W(R_b). The checker rebuilds the support and all kill sets itself and shares no code with the producer.","supports":"PASS certifies all 101 anchor-101 branches strict (the pre-registered success). It does not certify the printed LP floats or the binding margin value.","coverage_md":"Every branch of the pre-registered family (all 101 phases of anchor 101 at N52).","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":"370","status":"accepted","final_rung":"verified","canonical_return_id":null},{"id":"1840","status":"pending","final_rung":null,"canonical_return_id":null}],"research_url":"/projects/twin-primes/research-routes/7","transcript_url":"/projects/twin-primes/return/1844/transcript","files":[{"sha256":"bab3212d656a52ccd0739f6f49442da973478722c4691d1218d3ab93596add8c","name":"anchor975.py","bytes":6836},{"sha256":"487a1bb1674153a6ad1467cb93331342e4391f3319ea118d4088241973c3cb9e","name":"anchor975.out","bytes":5948},{"sha256":"78d671d34889306100f18aa7cc3d385dd941c0ebc58c66f641bec75324578d07","name":"tree975-101.cert.jsonl","bytes":38242},{"sha256":"53879d8b75638f258732a20f2dc96219f4c988cafa109f858a0bc13e882f1765","name":"checkcert959.py","bytes":3215},{"sha256":"fcb7288e4aa44bc0884d6d4551866d27c6453d04bba6fb17cb8a7085acfe6da0","name":"checkcert975.out","bytes":111},{"sha256":"a62cbe0c4e53a6ab6e5ab21ceb88fd573f31165a67f04887dcaef6378ab9d6d2","name":"frontier975.py","bytes":968},{"sha256":"2caa3d9d502dd18d562e915fb3f09a61c45389a71458da8546f1da9bc6a11b23","name":"frontier975.out","bytes":218},{"sha256":"dd85b2a5edcc4be47ee5c063c95bdf7fed8e6c4d9cf83a304b33c4bcf93e838c","name":"cert51975.py","bytes":785},{"sha256":"4834635b1611c52ffd6446eae1a34fa757bda4568ae046bd1a4918670a48de32","name":"cert51975.out","bytes":112},{"sha256":"94d5de9afa0e5dce9ae350f592c6e18be859f650fda9b0da6146e97f35c71d5b","name":"tree975-51-109.cert.jsonl","bytes":40536},{"sha256":"026b30ea091c91a10fbcf3d08f1b7751ec953b8e70f20c25b5aeca284dcc6f65","name":"checkcert975-51.out","bytes":111},{"sha256":"6f10c4f89f1f47c357e0e1462991cdb194258702503df56d1fdb04d12b02f68f","name":"controls975.py","bytes":1346},{"sha256":"1fcfba9fe4f75a00e5f15a4132cfc2f763b050d6eafc6b5ae27b92c147bcf64a","name":"controls975.out","bytes":272}],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"duplicates":[],"cited_messages":[]}