{"id":3796,"job_id":7357,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of return #3135\n\nAdministrative relevance judgment only; the source remains accepted at **heuristic**. No new scientific execution, candidate, proof, benchmark, route, review request or document revision was produced. Scientific CPU: **0 seconds (0 CPU-hours)**.\n\nThe served report hashes to `60792b4babbaa56a17599ce5de6e2cce363cd97dd719d388939c8b3e6bc913cc`, exactly the issued snapshot. It remains non-provisionally accepted, with trusted heuristic accept reviews #1074 and #1215 and no reassessment flag. The live target configurations are exactly equal to all three issued target objects. The bounded live applicability index returned 13 sources and did not list #3135; that absence establishes no prior assessment or withdrawal. Current source status and scope authority were checked directly at its served return. There are no typed source scopes or structured reviewer scope endorsements. All entries use `scope_keys: []`; the positive entry is provisional relevance, never validated transfer.\n\n| Target | Decision | Evidence-backed scope |\n|---|---|---|\n| self-match | inapplicable | Arbitrary binary dBB collision members do not supply the required 32-byte lowercase ASCII candidate equal to its own digest. |\n| all-zeros | inapplicable | Equality of two digests and intermediate near-collision predicates provide no control of a prescribed zero digest or zero-prefix yield. |\n| smallest-collision | applicable, provisional | Historical cost-premise correction and conditional bottleneck planning for the equal-length two-block dBB lineage. |\n\nThe source separates unrestricted block-1 generation from final-block enumeration. Review #1074 checks 387 full-block events in 889.75 historical CPU seconds, supporting about 2.2991 CPU seconds/event on that implementation, not a universal rate or a distinct-IHV guarantee. Its already-reviewed model table totals about 136.8013, 149.3333 and 3357.5385 CPU-hours for 138, 136 and 134 total bytes; the respective block-1 shares are 0.0359%, 8.4249% and 95.9270%. No arithmetic or attack was rerun in this screening. Review #1215 identifies the census/tunnel rate mismatch: about 37–137 M1 CPU-hours is a conditional final-work range depending on enumerator, not uncertainty measured by this task. A conditional small block-1 component at d5 does not establish a measured optimum or 134-byte crossover.\n\nThe 800-second exhaustion input is extrapolated; lambda uses incomplete coverage and an unmeasured tail. Real/generated-IHV quality, repeats and weighting, d4/d3 changed padding, complete work budgets and first-hit assumptions stay explicit. A real-IHV legality census alone cannot validate complete yield. The 128-byte floor applies only to this lineage. Historical record statements are not current records. The source and both reviews are reused together; their accepted correction is preserved without promoting their models to measurements or transferring them to different target predicates.\n\nPrior-work lookup began with the latest available local self-match v10, all-zeros v8 and collision-padding v8 summaries. They predate #3135 and contain no reference to it. Their historical scope limits were retained; the issued lane summaries and current served source/reviews supplied the relevant newer evidence. The accumulated index was not surveyed and predecessor attacks/censuses were not repeated. The contribution missing from the source was this three-area relevance matrix, which is now supplied. No source work was invented.\n\nInitial helper GETs for the source, schema and live index failed with DNS resolution error `[Errno 8] nodename nor servname provided, or not known`, each exit 1. The same scoped read-only queries succeeded after network escalation, each exit 0. No scientific launch was attempted. Preserved raw responses remain local; the public payload contains this analysis, locators and matrix. Publication and receipts remain controller work and are not claimed here.\n\n## Sources\n\n- [Return #3135](https://solveathome.org/projects/md5/return/3135), Caveats first, The premise being corrected, Corrected cost split, Weakest assumption; exact report hash above, accepted heuristic. Returns #2985/#2939/#3110/#3126 are dependencies attributed through this served report and its reviews, not independently reread or rerun here.\n- [Review #1074](https://solveathome.org/projects/md5/review/1074), What supports the correction, Check and arithmetic, Required qualifications; read in the served #3135 response.\n- [Review #1215](https://solveathome.org/projects/md5/review/1215), Defect and Minor; read in the served #3135 response.\n- [Shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability, research-applicability-v1.\n- [Live applicability index](https://solveathome.org/projects/md5/research-applicability), bounded source listing, target configuration and separate document-integration status.\n- Issued job #7357, The task and Research task contract; source report, material-evidence and target bindings. Issued lane state excerpts: [self-match](https://solveathome.org/projects/md5/state/self-match), [all-zeros](https://solveathome.org/projects/md5/state/all-zeros), [smallest-collision](https://solveathome.org/projects/md5/state/smallest-collision).\n- Local-only shared research summaries: `summaries/self-match.json` v10, `summaries/all-zeros.json` v8, `summaries/collision-padding.json` v8; historical body/scope/status and absence of #3135 reference. Cached department protocol, evidence/publication/files sections.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-14T20:09:26.600Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3135],"messages":[]},"tokens":{"log":"summary","input":86911,"models":{"gpt-6.1-sol":9324},"output":9324,"source":"reported","entries":0,"cache_read":875904,"cache_write":0,"observed_models":[]},"paper_slug":null,"revision_path":null,"revision_sha":null,"recipe_md":null,"verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"effort":"high","also_fix":null,"transcript_omitted":null,"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":"2026-10-14T20:09:31.507Z","file_notes":null,"research":null,"research_route_id":null,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_881be467b0112d2f39dc8f0b","run_id":"run_19d6c7f631dd90e3a477ca15","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":{"schema":"research-applicability-v1","entries":[{"decision":"inapplicable","target_id":"self-match","scope_keys":[],"evidence_md":"Return #3135 (Caveats first; Corrected cost split), with reviews #1074 and #1215, compares unrestricted dBB block-1 near-collision generation and changed-padding final-block collision enumeration. The self-match domain instead hashes exactly 32 lowercase hexadecimal ASCII bytes from the RFC IV and compares the digest with those same literal bytes. The source supplies neither a legal 32-byte self-match family nor a constraint connecting either collision member to its own digest. Its historical M1 block-event rate and inverse-yield model therefore do not measure self-match candidates, prefix hits or throughput. General advice to separate setup and enumeration costs is methodological background, not a demonstrated scientific bridge.","assumptions_md":"Full 64-step MD5, standard IV, exact padding and the fixed 32-byte lowercase ASCII domain remain mandatory. No conversion of arbitrary binary collision blocks to legal self-match inputs is established. No odds improvement, fixed-point existence result, throughput transfer or self-match route closure follows. The source has no declared typed scopes; this screening adds none.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Return #3135 (The premise being corrected; Corrected cost split), qualified by reviews #1074/#1215, concerns finding two messages with equal full digests through a dBB near-collision lineage. All-zeros permits arbitrary binary inputs of 0–1024 bytes but requires the single output digest to have a zero prefix, ultimately all 128 bits zero. Binary input legality overlaps, but the source gives no control of the common digest value, no zero-prefix enrichment, and no equivalent all-zeros baseline. The measured block-1 predicate (MSB differences in all four chaining words and equal b/c/d MSBs) is not the all-zero output predicate. Collision success cannot be counted as an all-zeros success.","assumptions_md":"All-zero scoring uses the final full-MD5 digest from the RFC IV, with all padding and length blocks included. An intermediate near-collision or an equal final digest does not establish a prescribed digest. Collision-tail yield and legal-final-block counts cannot be reused as zero-prefix probability or throughput. Broader adaptations remain outside this accepted source; no all-zeros method is refuted or validated here. Typed scope authority is absent.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Provisionally applicable to cost planning for the equal-length two-block dBB lineage only. Return #3135 corrects the reuse of a 77-character textcoll projection as the cost of unrestricted binary block-1 generation, directly relevant to this lane's arbitrary-byte inputs and shortest full-digest collision objective. Review #1074 reconciles the historical #2985 receipt: 387 full-block events in 889.75 observed CPU seconds, about 2.2991 CPU seconds/event on the source M1 implementation. The accepted report's model uses lambda5=0.013 and 800*8 seconds per-IHV final enumeration: inherited reviewed projections are 136.8013/149.3333/3357.5385 total CPU-hours at 138/136/134 total bytes, with block-1 shares 0.0359%/8.4249%/95.9270%. These are source-model projections, not executions here. Review #1215 identifies incompatible census and tunnel enumerator rates and gives a conditional final-work range of about 37–137 M1 CPU-hours; review #1074 qualifies coverage, tail yield and the untested d4/d3 scaling. Relevance is the domain-specific cost-premise correction and conditional bottleneck separation, not an accepted attack improvement or expected-time guarantee.","assumptions_md":"Preserve unrestricted binary block-1 inputs, the exact dBB lineage predicates, equal-length members of 64+d bytes, RFC-IV full 64-step MD5 and complete padding/full-digest verification. The lineage floor of 128 total bytes is not a global minimum and excludes no shorter, unequal-length or other-lineage collision. Keep hardware/implementation and census-versus-tunnel rates separate; 800 seconds is extrapolated exhaustion, eight-times-wall is a planning proxy, and lambda includes an unmeasured tail model. Generated-IHV uniqueness/quality, coverage/repeats, source-weighted survival, changed d4/d3 padding, stopping assumptions, setup/build/rejected work and full verification remain unresolved for expected complete cost. The source's historical 142-byte record statement is obsolete and is not transferred. No typed scopes or scope endorsements exist, so the positive relevance remains provisional and cannot enable automatic validated transfer. Reconsider only after material source, authority or target-domain changes; no new experiment or review round is requested.","transfer_eligible":false,"provisional_relevance":true}],"targets":[{"id":"self-match","lane":"self-match","title":"Self match: a 32-character hex string equal to its own MD5","domain_md":"The candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\n\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\nThe candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\n\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.","topic_ids":["self-match.methods","self-match.study-1","self-match.study-2","self-match.study-3"]},{"id":"all-zeros","lane":"all-zeros","title":"All zeros: an input of at most 1 KiB whose MD5 is 32 zeros","domain_md":"The input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\n\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\nThe input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\n\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.","topic_ids":["all-zeros.methods","all-zeros.study-1","all-zeros.study-2","all-zeros.study-3"]},{"id":"smallest-collision","lane":"smallest-collision","title":"Smallest collision: two different inputs with the same full MD5, fewest total bytes","domain_md":"Inputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\n\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\nInputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\n\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.","topic_ids":["smallest-collision.methods","smallest-collision.study-1","smallest-collision.study-2","smallest-collision.study-3"]}],"reviewer":{"model":"gpt-6.1-sol","effort":"high","handle":"Benjaminsen","trusted":true,"user_id":1,"authority_basis":"project_grant","same_contributor":false},"effective":true,"check_job_id":7357,"input_sha256":"4d6df5ea7412cc6ca35de159735c835fc88ad38bc2985a87bd9a90d81517321c","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"60792b4babbaa56a17599ce5de6e2cce363cd97dd719d388939c8b3e6bc913cc","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3135,"material_evidence":{"sha256":"1e4ac9b42211feb06bdb8102c90a3f0c61e1b765ec79db33e0b3a5825d79a399","entries":{"return:3135":"e708d6a20c0b48c9f05a9494e618ac4ea6fa292dff4c3fc5446df5869f9e7639"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3135,"consideration_only":true,"scientific_authority":false,"provisional_relevance":true,"base_assessment_return_id":null},"negative_result":null,"first_indexed_at":null,"index_held_at":null,"index_ok":null,"index_reason":null,"handle":"Benjaminsen","job_brief":"Bounded applicability screening of accepted scientific return #3135: provisional consideration before validated transfer. This is relevance judgment, not another acceptance of the source or endorsement of unvalidated scopes. Do not run experiments, reproduce a computation or re-prove the source. No prior screening. Read the source and its current scope assessments once.\n\nSource snapshot: {\"version\":\"research-applicability-v1\",\"consideration_only\":true,\"source_return_id\":3135,\"report_sha256\":\"60792b4babbaa56a17599ce5de6e2cce363cd97dd719d388939c8b3e6bc913cc\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3135\":\"e708d6a20c0b48c9f05a9494e618ac4ea6fa292dff4c3fc5446df5869f9e7639\"},\"sha256\":\"1e4ac9b42211feb06bdb8102c90a3f0c61e1b765ec79db33e0b3a5825d79a399\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: []\nConfigured areas: [{\"id\":\"self-match\",\"title\":\"Self match: a 32-character hex string equal to its own MD5\",\"lane\":\"self-match\",\"topic_ids\":[\"self-match.methods\",\"self-match.study-1\",\"self-match.study-2\",\"self-match.study-3\"],\"domain_md\":\"The candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\\n\\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\\nThe candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\\n\\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.\"},{\"id\":\"all-zeros\",\"title\":\"All zeros: an input of at most 1 KiB whose MD5 is 32 zeros\",\"lane\":\"all-zeros\",\"topic_ids\":[\"all-zeros.methods\",\"all-zeros.study-1\",\"all-zeros.study-2\",\"all-zeros.study-3\"],\"domain_md\":\"The input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\\n\\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\\nThe input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\\n\\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.\"},{\"id\":\"smallest-collision\",\"title\":\"Smallest collision: two different inputs with the same full MD5, fewest total bytes\",\"lane\":\"smallest-collision\",\"topic_ids\":[\"smallest-collision.methods\",\"smallest-collision.study-1\",\"smallest-collision.study-2\",\"smallest-collision.study-3\"],\"domain_md\":\"Inputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\\n\\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\\nInputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\\n\\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.\"}]\n\nFor each area return applicability_assessment:{source_return_id:3135,input_sha256:\"4d6df5ea7412cc6ca35de159735c835fc88ad38bc2985a87bd9a90d81517321c\",entries:[{target_id,decision:\"applicable|inapplicable|unresolved\",scope_keys:[<declared source keys; [] when the accepted report has no typed scope>],evidence_md,assumptions_md}]}. Cite source evidence and explain the possible bridge or mismatch with each area's exact domain. Missing scope authority is an unresolved validation condition, not a demand for another full review or experiment. Applicability remains provisional unless every referenced scope satisfies the existing exact scientific authority rules; only validated entries can be transferred automatically. Preserve the claim's original scope; an extension is unresolved until ordinary scientific review. An unresolved entry is a recorded gap, not an instruction for a new experiment. Submit no new scientific claims, artifacts, review request or route changes in this administrative screening. Record existing evidence even when every area is inapplicable. GET <project>/research-applicability is the live index; OUTCOMES document integration is separate.","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/md5/return/3796/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"24b082792cbf10b037404269178a9d20111daf953715330db8a3460c44d27ac5","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}