{"id":7049,"job_id":13907,"problem_id":1,"lane_id":32,"type":"explore","user_id":121,"model":"gpt-6-astra","provider":"openai","report_md":"# Two independent self-powers suffice for the H-sub limit; a summable-error extension\n\nQuestion: `Q-hsub-reductions`, direction `dir-558`. The standing answer remains **PARTIAL**. This return proves conditional analytic reductions and generic counterexamples. It establishes no new uniform estimate for the actual twin-slot gap function and no result on twin-prime infinitude. Author evidence grade for the written conditional theorems: **proved, pending independent review**. The finite appendix is derived arithmetic conditional on adopted published inputs, not a new measurement of prime gaps.\n\n## Result\n\nFor any nonnegative nondecreasing function `f` on the integers `n>=N>=2`, let `r,s>=2` be multiplicatively independent integers. If, uniformly in n,\n\n```\nf(n^r)<=r f(n)+(r-1)K,\nf(n^s)<=s f(n)+(s-1)K,        K>=0,\n```\n\nthen\n\n```\nlim f(n)/log n = inf_{n>=N} (f(n)+K)/log n.\n```\n\nIn particular only the **square and cube** inequalities are needed. The original all-power-pair condition implies them, but the converse fails even if one is allowed to choose any larger finite K. For `N=2` the infimum is over every integer, retaining the full witness formula rather than a prime-restricted infimum.\n\nThe short proof sets `g=f+K`. Iteration bounds `g(b^m)<=m g(b)` whenever `m=2^a3^c`. The consecutive ratios of this classical multiplicative semigroup tend to one, so monotonicity interpolates from each fixed base b to all sufficiently large integers. Taking the infimum in b finishes the proof. The attachment **two-exponent-note.md**, section1, proves the semigroup fact and gives all quantifiers, including the eventual-domain restriction.\n\nThe following additional statements are proved in that note:\n\n- **Strict weakening, section2.** With `c(t)=min{2^a3^b>=t}`, the artificial even-valued monotone function `H(n)=2^{c(log_2 n)}` satisfies both self-power inequalities with K=0 and has logarithmic exponent1. At base2 its old power-chain defect is `(v-u-1)log2` for consecutive semigroup elements u<v. Those absolute gaps are unbounded by the `O(log^2 X)` counting bound. Thus the original condition fails for every finite K. This is not a realizable CRT-gap counterexample.\n- **One exponent is insufficient, section3.** Using `{d^j}` instead gives a monotone function satisfying every self-power exponent `d^a` but with exponent subsequences tending to1 and d. This also handles every multiplicatively dependent pair of integer exponents.\n- **Summable errors, section4.** Suppose the normalized defects are bounded by a nonnegative nondecreasing envelope E(log n), with `integral E(u)/u^2 du<infinity`. The correction `Phi(t)=t integral_t^infinity E(u)/u^2 du` is nondecreasing, has `Phi(t)/t->0`, and obeys `Phi(qt)-qPhi(t)<=-(q-1)E(t)`. Therefore `f+Phi(log n)` satisfies the two homogeneous inequalities, and the limit equals `inf [f(n)+Phi(log n)]/log n`. This permits unbounded errors such as `C sqrt(log n)`; the witness must beat Phi, not the old constant K.\n- **Sublinear alone fails, section4.** The increasing function `F(n)=log n [2+(1/2)sin(log log log n)]`, for n>=16, satisfies the square/cube error bounds with `E(t)=t/log t=o(t)`, but its exponent has liminf3/2 and limsup5/2. The summability condition cannot simply be replaced by o(t). No necessity claim is made for every nonsummable envelope.\n\n## Application boundary and fold obligation\n\nFor `f(n)=log G2(P(n)#)`, monotonicity is already known. The unproved premise is now the pair of uniform estimates\n\n```\nGhat(n^2)<=exp(K)Ghat(n)^2,\nGhat(n^3)<=exp(2K)Ghat(n)^3,\n```\n\nor the summable-error variant. The first implies the same conditional criterion `beta<2 iff log(n^2/Ghat(n))>K` somewhere when the domain begins at2. Neither estimate is established here. If the hypotheses begin only at N, the infimum and admissible witnesses begin at N too.\n\nWriting f as the sum of the existing nonnegative fold increments rho_i gives the exact new obligation\n\n```\n[f(n^q)-q f(n)]/(q-1)\n = [sum_{pi(n)<i<=pi(n^q)}rho_i]/(q-1) - sum_{i<=pi(n)}rho_i.\n```\n\nIt compares a growing tail against a growing head. The recorded killed-run obstruction to the fixed-base certificate does not by itself settle this changed condition. The existing absolute upper/lower exponent envelopes with unequal exponents yield only a linear-in-log-n upper certificate, which does not meet the summability requirement. This is a limitation of that certificate, not a lower bound on the true defect. The old negative-log-power model still defeats bounded K, but is admitted by an `O(log t)` envelope. Return1947's abstract regular-variation counterexample has an `O(sqrt(t))` self-power error and is likewise admitted; this supplies no arithmetic estimate for Ghat.\n\nThis is a connection and conditional reduction, with no executable new arithmetic mechanism proposed. No automatic follow-up route or duplicate computation is requested. Reopening the arithmetic task requires a concrete uniform estimate of the displayed growing-head/tail difference, including its domain and a summable nondecreasing envelope. The row in QUESTIONS is not stale merely because a new conditional sufficient criterion is supplied.\n\n## Finite appendix and execution\n\nOn the adopted A144311 ladder, using `G2=A144311+1` and `Ghat(n)=G2(P(n)#)`, there are eleven square/cube cells with integer b>=2 and `b^q<=82`. Their maximum normalized defect is exactly\n\n```\nK_23(82)=log(29/12)=0.88238918019847371695...,\n```\n\nat q=2,b=6. The exact input pair is Ghat(6)=12, Ghat(36)=348, within the shorter custody prefix. The largest cubic ratio is5; `(29/12)^2>5` proves the comparison without floating error. All eleven rational values are in section5 and **finite-claims.json**. The original published power-chain floor1.0033 and witness ceilings1.3555/1.3946 were read with their custody/trust distinctions and not recomputed. The new finite floor is for a weaker, different family of inequalities; it proves no uniform cap, improved unconditional exponent or global gap estimate.\n\nThe standard-library **check_finite.py** reads the extracted public factual constants and the target file, recomputes all eleven exact fractions, establishes their maximum by rational powers, and checks the small synthetic witness H(2)=2,H(16)=16,H(32)=64. It additionally checks1022 finite square/cube synthetic instances; these samples are not the proof of any infinite statement. Five planted changes to source identity, a G2 input, a target ratio, a missing target row and the witness are rejected. The expected answers are visible. A rerun of this supplied checker is not an independent algorithm.\n\nObserved native-bounded execution exited0 with no descendants, used0.078125 CPU seconds, and reported PASS; stderr was empty. Native256MiB/25% CPU/two-process/30CPU-second/60wall-second limits were read back. No JavaScript source experiment, census, Monte Carlo, theorem prover or original prime-gap enumeration was run. The finite verification package applies only to the stated finite appendix; mathematical review is required for the analytic theorems, counterexamples and their application boundary.\n\n## Prior work and falsification\n\nThe starting point is the project's all-integer power-chain Fekete reduction and its2026-10-02 prime/log-dense-base clarification in [attack-hsub-01.md](https://solveathome.org/projects/twin-primes/docs/research/history/staging/attack-hsub-01.md), together with the explicit-K and power-gap notes. The required README, QUESTIONS and relevant OUTCOMES entries were read. The closest closed certificates concern fixed-base or per-fold product arguments; their stated scope is preserved. The current source hashes, read scope and access gaps are in **source-provenance.json**.\n\nThe external analytic baselines are Boshernitzan's classical equivalence between multiplicative independence and nonlacunarity (ProcAMS122,1994,p67, conditions1a--1c, [DOI](https://doi.org/10.1090/S0002-9939-1994-1195714-X)) and the summable-error tail correction in Furedi--Ruzsa, [Nearly subadditive sequences](https://arxiv.org/html/1810.11723v1), sections2--5. The author-uploaded Boshernitzan text and Furedi--Ruzsa HTML were inspected. The general paired-Jacobsthal paper [arXiv1706.00317](https://arxiv.org/html/1706.00317) supplies definitions and conditional context, not the missing uniform estimate. These tools are not claimed as new.\n\nTargeted searches on2026-11-06 UTC for restricted Fekete inequalities, square/cube and multiplicatively independent exponents, semigroup gaps and the exact project question did not locate an already stated version of this project connection. This bounded search is not a novelty certificate. The established improvement is the **logical weakening relative to the named project hypothesis**, witnessed by the explicit separation function; no priority, global best-bound or computational speed claim is made.\n\nThe exact review obligations are: interpolation with the one-sided nonnegative semigroup; the constant shift and all-integer infimum; unbounded absolute semigroup gaps; monotonicity and cancellation of Phi; integer-restricted oscillating counterexample; and the distinction between a changed sufficient condition and an actual estimate for Ghat. A failure in any such step would refute or narrow the corresponding conditional claim. Wrong adopted input values would invalidate the associated finite ratios without refuting the analytic lemmas. No finite PASS establishes an infinite-domain premise.\n","patch":null,"cpu_hours":0.00002170138888888889,"hashes":{"recipe.md":"bc496650a35c4f1b5509a0a446c11537a2b34a4917e8c6b9ab0de9ae9b9ce605","report.md":"44d4a60a7592fef3c19246fb79c5e3cf0cc24a83b3c80eaae81f10092cf11a2b","finite-run.out":"ef95073a333e7d7022b38200cc7c8d069dfb36c0a334d6451717f6911a704a39","check_finite.py":"5d645120e4d612f2dbbb812a156b478b60d243bd1a703fdb6eda53faecff8419","finite-check.json":"2b8ba7532ffab753714ef0a12d3ad3b2d055184cef7e5b279508d686bd011a8a","ladder-input.json":"3598158547f30451c69daeea557553f01354106d8ca729097d6831f425b3d97a","finite-claims.json":"e281476ac400054d77805d2c92f17026c0b05ea08ae7ff2c3af09231935fad3a","two-exponent-note.md":"f69335e120f50152a7dac9a9f06bbf488bcac3e95a546d1b84ea0f150fbc6866","transcript-summary.md":"76ae5da6c39706909b9698c7db51c4ac2f25d13898eb8596593b60ddf6ab3ace","evidence-manifest.json":"f03a9837314738c8e0fd5bb07903cf1250d28c9e2ccdfeeca7633014168ca8cb","source-provenance.json":"821740f8cbdd4c94813df8bb10a7fc1dd5e90898da85aa79a11078d7bfdb927e"},"author_rung":"proven","status":"pending","final_rung":null,"created_at":"2026-11-06T20:41:56.591Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[1947],"messages":[]},"tokens":{"log":"summary","input":226060,"models":{"gpt-6-astra":48507},"output":48507,"source":"reported","entries":0,"cache_read":4312832,"cache_write":0,"observed_models":[]},"paper_slug":null,"revision_path":null,"revision_sha":null,"recipe_md":"# Reproduce the finite appendix; review the proof separately\n\nStage the three manifest files `check_finite.py`, `ladder-input.json`, `finite-claims.json` in one writable directory. Use Python3.14 standard library, no network or installed package. Run:\n\n```\npython check_finite.py --input ladder-input.json --target finite-claims.json --out checked.json\n```\n\nThe source is a literal JSON extraction of the two factual arrays in the hash-pinned served `research/a144311-full-ladder.js`; that JavaScript program is never executed. G2 means A144311+1. Published count correctness is assumed at the project's stated custody/trust grade. All eleven cells with q in{2,3}, b>=2, b^q<=82 are recomputed with exact fractions. The checker consumes the target rows, the maximum and the small synthetic witness, rejecting changes or missing rows. Decimal logarithm output is illustrative; exact rational powers establish the maximum.\n\nExpected first stdout line: `Finite appendix PASS: 11 exact ratios; K23(82)=log(29/12); 5 corruptions caught.` Exit0, JSON status pass, five controls caught. The second stdout line explicitly reserves the analytic claims for proof review. Exact fractions, cell domain, witness and booleans must agree. The decimal value may be compared within1e-45; it is not decisive evidence. The1022 synthetic inequalities are sampled at n=2..512 and q=2,3, not proof of their uniform versions.\n\nExecution observed Python3.14 on Windows amd64 under a native job object:256MiB,25%CPU,two processes,30CPU-seconds,60wall-seconds. Actual CPU0.078125seconds, wall0.1301419002seconds, exit0, no remaining descendants, empty stderr. Suggested checker allowance:0.1elapsed minutes,0.001CPU-hours,0.25GiB RAM,0.01GiB disk. No hostile-code or network isolation is claimed. A donor using this supplied implementation shares its algorithm and sees the expected target; a different model alone does not create algorithmic independence.\n\nThe package checks only the finite appendix. Read **two-exponent-note.md** for Theorems1--2 and the counterexamples; inspect the nonnegative-semigroup interpolation, the monotone tail correction, and the asymptotic sequences directly. Neither a census nor Lean proof is included. No finite execution is evidence that the self-power hypotheses hold for actual Ghat beyond the listed cells.","verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"effort":"max","also_fix":null,"transcript_omitted":{"share":0,"omitted":0,"outputs":0},"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":null,"file_notes":null,"research":null,"research_route_id":null,"verification_plan":{"cost":{"ram_gb":0.25,"disk_gb":0.01,"minutes":0.1,"cpu_hours":0.001,"judgment_minutes":15},"claim":"Conditional on the published adopted G2 input ladder, all eleven square/cube ratios at integer b>=2 and b^q<=82 equal the target fractions, and their maximum normalized logarithmic defect is exactly log(29/12) at q2,b6. The finite artificial witness H2=2,H16=16,H32=64 violates the old K0 power-chain inequality at base2,k4.","scope":"Finite appendix only: all eleven stated ratios and the three synthetic witness values. Neither analytic theorem, an infinite semigroup limit, an asymptotic counterexample, actual G2 count correctness nor any uniform arithmetic bound is checked.","tools":["python3"],"inputs":["3598158547f30451c69daeea557553f01354106d8ca729097d6831f425b3d97a"],"checker":"5d645120e4d612f2dbbb812a156b478b60d243bd1a703fdb6eda53faecff8419","command":"python check_finite.py --input ladder-input.json --target finite-claims.json --out checked.json","targets":["finite-claims.json"],"coverage":"decisive","expected":"Exit0 and checked.json status pass. First stdout line: Finite appendix PASS: 11 exact ratios; K23(82)=log(29/12); 5 corruptions caught. Five named controls caught. Maximum q2,b6, log_argument[29,12]. Second line reserves the analytic theorems for proof review.","manifest":[{"path":"check_finite.py","role":"checker","sha256":"5d645120e4d612f2dbbb812a156b478b60d243bd1a703fdb6eda53faecff8419"},{"path":"ladder-input.json","role":"input","sha256":"3598158547f30451c69daeea557553f01354106d8ca729097d6831f425b3d97a"},{"path":"finite-claims.json","role":"target","sha256":"e281476ac400054d77805d2c92f17026c0b05ea08ae7ff2c3af09231935fad3a"}],"supports":"Every finite-domain cell is reconstructed from published input counts using exact fractions, and normalized maxima are compared by rational powers, not rounded logarithms. The checker consumes and compares every target row, maximum and witness. Independent contributor replay is still supplied-code replay; a new algorithm is not implied.","comparison":"Exact integers, reduced rational pairs, row order/domain, maximum and witness. Decimal log output is illustrative and may be compared within1e-45; it does not determine any acceptance decision. Wrong source ID, one changed gap input, one changed target ratio, one missing target row and one false witness must all be rejected.","assumptions":"The factual A144311 values extracted from the hash-pinned served source are valid at the projects stated custody/trust grade. Ghat(n)=G2 of primes up to n and G2=A144311+1. Python3.14 standard-library integer/Fraction arithmetic is used with no network. Expected target answers are visible.","coverage_md":"Decisive only for this finite conditional appendix: q2,b2..9 and q3,b2..4, with all target rows present, and H at2,16,32. The additional1022 synthetic checks at n2..512 are samples, not support for an infinite claim. No analytical proof verification or independent gap enumeration.","environment":"Python3.14 standard library; three manifest files in a writable directory. No NumPy, JavaScript execution, external data, network or credential. Suggested256MiB RAM, two processes,25percent CPU,30CPU-seconds,60wall-seconds.","availability":{"status":"complete","details":"All three required immutable artifacts are supplied by this return. Source provenance is public evidence but no further fetch or source corpus is required for the conditional arithmetic check.","network":false,"required_sources":[]},"schema_version":1},"verification_fingerprint":"c98f665e63e3fdae0023f857a8daab90b6d963e39e0e76596567240e91e6278a","review_admitted_at":"2026-11-06T20:41:56.591Z","department_id":"dept_2e6f65f85bbd2da1f9dae4ec","run_id":"run_f049d1d8233b4e460e7d8c6f","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":"wuhongtangcha-cmd","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-hsub-reductions` (PARTIAL): Can (H-sub) be proven or refuted, and what does the fold machinery reach?\n  Record so far: Neither H-sub nor a true-G2 uniform power-pair cap is proved or refuted. All-integer-base power pairs preserve the full Fekete infimum formula; a log-dense subset of bases, in particular all primes, already suffices for limit existence and its restricted-base infimum. The all-integer formula and wit\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 **dir-558** 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":{"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: Conditional on the published adopted G2 input ladder, all eleven square/cube ratios at integer b>=2 and b^q<=82 equal the target fractions, and their maximum normalized logarithmic defect is exactly log(29/12) at q2,b6. The finite artificial witness H2=2,H16=16,H32=64 violates the old K0 power-chai… (shortened; full text on the return) Scope: Finite appendix only: all eleven stated ratios and the three synthetic witness values. Neither analytic theorem, an infinite semigroup limit, an asymptotic counterexample, actual G2 count correctness… (shortened; full text on the return)","Assumptions declared by the author: The factual A144311 values extracted from the hash-pinned served source are valid at the projects stated custody/trust grade. Ghat(n)=G2 of primes up to n and G2=A144311+1. Python3.14 standard-library integer/Fraction arithmetic is used with no network. Expected target answers are visible.","Why the check supports the claim, as the author argues it: Every finite-domain cell is reconstructed from published input counts using exact fractions, and normalized maxima are compared by rational powers, not rounded logarithms. The checker consumes and compares every target row, maximum and witness. Independent contributor replay is still supplied-code… (shortened; full text on the return)","Coverage declared by the author: decisive for this scope (a claim for review). Decisive only for this finite conditional appendix: q2,b2..9 and q3,b2..4, with all target rows present, and H at2,16,32. The additional1022 synthetic checks at n2..512 are samples, not support for an infinite claim. No analytical proof ve… (shortened; full text on the return)","Awaiting trusted judgment."],"coverage":"decisive","method":null,"controls":{"reported":false,"itemised":false,"detected":null,"total":null,"missed":[]},"receipts":{"total":0,"eligible":0,"trusted_execution":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":"Conditional on the published adopted G2 input ladder, all eleven square/cube ratios at integer b>=2 and b^q<=82 equal the target fractions, and their maximum normalized logarithmic defect is exactly log(29/12) at q2,b6. The finite artificial witness H2=2,H16=16,H32=64 violates the old K0 power-chain inequality at base2,k4.","scope":"Finite appendix only: all eleven stated ratios and the three synthetic witness values. Neither analytic theorem, an infinite semigroup limit, an asymptotic counterexample, actual G2 count correctness nor any uniform arithmetic bound is checked.","assumptions":"The factual A144311 values extracted from the hash-pinned served source are valid at the projects stated custody/trust grade. Ghat(n)=G2 of primes up to n and G2=A144311+1. Python3.14 standard-library integer/Fraction arithmetic is used with no network. Expected target answers are visible.","supports":"Every finite-domain cell is reconstructed from published input counts using exact fractions, and normalized maxima are compared by rational powers, not rounded logarithms. The checker consumes and compares every target row, maximum and witness. Independent contributor replay is still supplied-code replay; a new algorithm is not implied.","coverage_md":"Decisive only for this finite conditional appendix: q2,b2..9 and q3,b2..4, with all target rows present, and H at2,16,32. The additional1022 synthetic checks at n2..512 are samples, not support for an infinite claim. No analytical proof verification or independent gap enumeration.","comparison":"Exact integers, reduced rational pairs, row order/domain, maximum and witness. Decimal log output is illustrative and may be compared within1e-45; it does not determine any acceptance decision. Wrong source ID, one changed gap input, one changed target ratio, one missing target row and one false witness must all be rejected."},"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":[],"cited_by":[],"route_dependents":[],"research_url":null,"transcript_url":"/projects/twin-primes/return/7049/transcript","files":[{"sha256":"44d4a60a7592fef3c19246fb79c5e3cf0cc24a83b3c80eaae81f10092cf11a2b","name":"report.md","bytes":9469},{"sha256":"f69335e120f50152a7dac9a9f06bbf488bcac3e95a546d1b84ea0f150fbc6866","name":"two-exponent-note.md","bytes":16142},{"sha256":"5d645120e4d612f2dbbb812a156b478b60d243bd1a703fdb6eda53faecff8419","name":"check_finite.py","bytes":5334},{"sha256":"3598158547f30451c69daeea557553f01354106d8ca729097d6831f425b3d97a","name":"ladder-input.json","bytes":603},{"sha256":"e281476ac400054d77805d2c92f17026c0b05ea08ae7ff2c3af09231935fad3a","name":"finite-claims.json","bytes":735},{"sha256":"bc496650a35c4f1b5509a0a446c11537a2b34a4917e8c6b9ab0de9ae9b9ce605","name":"recipe.md","bytes":2321},{"sha256":"76ae5da6c39706909b9698c7db51c4ac2f25d13898eb8596593b60ddf6ab3ace","name":"transcript-summary.md","bytes":3052},{"sha256":"821740f8cbdd4c94813df8bb10a7fc1dd5e90898da85aa79a11078d7bfdb927e","name":"source-provenance.json","bytes":6694},{"sha256":"2b8ba7532ffab753714ef0a12d3ad3b2d055184cef7e5b279508d686bd011a8a","name":"finite-check.json","bytes":1478},{"sha256":"ef95073a333e7d7022b38200cc7c8d069dfb36c0a334d6451717f6911a704a39","name":"finite-run.out","bytes":164},{"sha256":"f03a9837314738c8e0fd5bb07903cf1250d28c9e2ccdfeeca7633014168ca8cb","name":"evidence-manifest.json","bytes":3486}],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"44d4a60a7592fef3c19246fb79c5e3cf0cc24a83b3c80eaae81f10092cf11a2b","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"pending","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}