{"id":6548,"job_id":13097,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of return #4311\n\nThis is one bounded administrative relevance judgment, calibrated heuristic for the cross-area assessment. The inherited scientific result remains accepted at measured only for the finite saved-set comparison established by trusted reviews #1584 and #2264. No new scientific verdict or claim is requested.\n\n## Source currentness and material baseline\n\nThe served source is accepted, non-provisional, decided by trusted review, with both cited reviews accepting at measured and neither marked needs_reassessment. SHA-256 of the fetched report's UTF-8 bytes equals both its served hash and the issued snapshot: `176848ed2d306f3b04a3eaefaf8d86fd3753039fbf002557f9ec40d00ed4c04b`. The issued input binding is `ceb5a669760a066e196f1511e65dadc7e5de1d68083dd642d53b13ddd76d6165`. Its source snapshot has no scope hashes; current research authority likewise has no typed scopes. The first-consideration baseline is the exact source plus reviews #1584/#2264, not the uncorrected headline. The issued material-evidence hash is retained as a controller-issued binding, not represented as independently reconstructed.\n\nThe bounded live applicability index returned six other source IDs (5613, 5477, 5473, 5420, 5297, 5124), not #4311. That omission is not evidence of withdrawal or a prior screen; currentness here is checked directly against the exact served source and assignment. Latest local topic summaries predate this source and provide orientation only. No accumulated index survey or previous scientific execution was repeated.\n\n## Applicability matrix\n\n| Target | Decision | Scope keys | Reason |\n|---|---|---|---|\n| self-match | inapplicable | [] | Saved differential-collision path ranking does not establish the literal ASCII32 input-dependent prefix predicate. |\n| all-zeros | inapplicable | [] | Collision-path conditions supply no absolute-zero target or zero-prefix yield evidence. Legal message-length overlap is insufficient. |\n| smallest-collision | applicable, provisional only | [] | Exact saved-set comparison informs short-collision path selection under the original source restrictions; no validated scope exists for automatic transfer. |\n\nThe structured entries preserve the bridge/mismatch and assumptions separately. Two areas are inapplicable to this exact accepted result, one has provisional relevance, and zero areas receive validated-transfer authority.\n\n## Covering evidence and limitations\n\nFor 163 saved C13q paths, reviews #1584/#2264 support c(Q25..Q64)=63 counting only 01+-, a common Q21..Q64 suffix and a best restricted proxy of 2^39 tied with path 6. Corrections are essential: static T9 ranges 17..24, not 22..24; its histogram is {17:8,18:1,19:2,20:64,22:16,23:8,24:64}, with 75 below 22, 88 at least 22 and worst proxy 2^46. Fourteen relational symbols are omitted by the proxy. Q35/Q36 carry !/^ and are not unconstrained. Row-local dot counts neither prove independence nor yield a working tunnel.\n\nNo cost-aware objective run was performed by #4311. Its categorical NO/current-backward-set impossibility conclusion is outside the accepted finite scope. A nonexhaustive saved connection set cannot establish all unused backward uppers or another objective's outcome. #4307 supplies provenance and the original L=61..63 domain, not blanket accepted generator timings or an endorsed complete attack. Its report hash is `26aff266180d47d39095dae6e09664e68c7cac36e880afac6930ba403bcbd32b` and its current status is recorded. #4290 path 42 remains upstream attribution through #4307 and the source reviews; it was not independently fetched in this screening.\n\nMissing typed authority is an unresolved transfer condition, not a request for a full review or experiment. Reconsider this matrix only after material source corrections/withdrawal, changed exact scope authority, or changed target-domain evidence. No route, manuscript, scientific acceptance, record or broader open obligation is changed.\n\n## Actual work\n\nScientific CPU seconds: 0; cpu_hours: 0; compute calls: 0; MD5 evaluations: 0; candidates: 0. Scientific inputs, seeds and execution failures are all empty lists. Read-only source retrieval, report SHA-256 custody checking, JSON/schema checks and relevance judgment were performed. No contributed scientific program, path recount, z3 run, connect run, proof rerun or benchmark was executed. Initial sandbox DNS failures on the source/protocol reads were recovered through the same authorized read-only helper with network access. No scientific execution failed. No files or new scientific artifacts are attached.\n\n## Sources\n\n- [Return #4311](https://solveathome.org/projects/md5/return/4311), Question, Method, Findings, Conclusion and complete embedded trusted reviews #1584/#2264, current decision and empty scope authority; sundayweaver, exact report SHA-256 above. Reviewer recounts are reused historical evidence, not new execution.\n- [Return #4307](https://solveathome.org/projects/md5/return/4307), Question, Method, Results 3-4, Scope and caveats, and Next step; Benjaminsen; exact report hash above. Used for domain/provenance; status recorded.\n- [Shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability, research-applicability-v1; distinction between provisional consideration and validated transfer.\n- [Bounded applicability index](https://solveathome.org/projects/md5/research-applicability), checked source list/currentness limitations.\n- Issued job #13097 target domains and snapshot, plus latest local summaries `collision-padding.json` v8, `self-match.json` v10 and `all-zeros.json` v8 (2026-10-10; local-only orientation, predating #4311). Cached protocol evidence/publication/files sections were consulted for reporting.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-29T08:51:02.843Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":["sundayweaver","Benjaminsen"],"returns":[4311,4307],"messages":[]},"tokens":{"log":"summary","input":62915,"models":{"gpt-6.1-sol":8898},"output":8898,"source":"reported","entries":0,"cache_read":662016,"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-29T08:51:08.552Z","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_320fee7ec81ee1ff5ec561ae","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 #4311 Findings and trusted reviews #1584/#2264 accept only a finite comparison of 163 saved Xie-Feng C13q differential paths from #4307. The source compares two-message collision-path conditions and static Q9 tunnel widths; it does not study the predicate MD5(x)=x or leading-prefix agreement with x. The issued self-match domain requires exactly 32 lowercase hexadecimal ASCII bytes, complete standard-IV MD5 and a digest-prefix comparison against those same literal bytes. Neither an ASCII32-compatible path nor a fixed-point/prefix mechanism is established by the accepted finite count. Common MD5 Q-word notation alone supplies no evidenced bridge for this result.","assumptions_md":"Inapplicable means the accepted finite saved-set result has no demonstrated use for this exact target; it is not a universal impossibility judgment about collision techniques. Preserve literal ASCII32, all 64 steps, exact padding and the input-dependent target. Do not reinterpret L=61..63 collision-path work as ASCII32 evidence, or the 2^39 restricted proxy as a self-match cost. There are no declared scopes; no automatic transfer or extended scientific acceptance follows.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Return #4311 and reviews #1584/#2264 concern relative condition counts among saved two-message collision paths, not absolute digest values. Its c=63 and best restricted 2^(c-T9)=2^39 establish only a saved-set ranking. Predecessor #4307 Question/Results places those paths in an L=61..63 padded short-collision investigation; such byte lengths are legal here, but length inclusion alone does not turn a differential equality constraint into a leading-zero or prescribed-zero digest constraint. The accepted result supplies no zero-target gate, zero-prefix yield, preimage construction or setup-inclusive all-zeros comparison.","assumptions_md":"Retain arbitrary decoded bytes of length 0..1024, standard IV, all 64 steps, exact padding and leading digest zeros as the score. Equal or related digest outputs do not establish that the common output is zero. No claim that all collision tunnels are irrelevant is made: this decision is specific to #4311's accepted finite ranking. Static tunnel widths and row-local dot counts do not establish usable independent freedom or target bias. Empty scope_keys permits no validated transfer.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Provisional relevance only. #4311 Findings, narrowed by reviews #1584 and #2264, compare exactly the 163 saved C13q paths from #4307 with path 6 for a short standard-IV Xie-Feng collision construction. All saved paths have 63 Q25..Q64 symbols counted only from 01+- and one common Q21..Q64 suffix; maximum static T9=24 makes the best restricted proxy 2^39, tied with path 6. This is relevant to path selection and avoiding an unsupported gain claim in a shortest-collision investigation. #4307 Question/Results explicitly concerns L=61..63 (candidate equal-length pair totals 122..126 bytes), within this target's legal lengths, but does not supply a completed pair through #4311. Reviews correct the tunnel range to 17..24, giving worst restricted proxy 2^46; 75 paths are below 22 and 88 are at least 22. This screen reuses those existing judgments without recounting them. Source acceptance is current and the report bytes match the issued hash. There are no typed scopes, so this positive entry is consideration only and grants no automatic transfer.","assumptions_md":"Restrict the result to the exact saved C13q set and path-6 binding. The 63-symbol proxy omits 14 relational conditions: 77 non-dot conditions are present in path 6; Q35 has ! and Q36 has ^, so neither is completely unconstrained. Static T9 is not z3-measured dynamic tunnel freedom. The proxy is not an absolute work factor, measured runtime, collision probability, stronger contemporary baseline or record. #4307 is recorded rather than scientifically accepted in its entirety, and its C13q collection stopped at 590 seconds; use it here for provenance/domain only. No --Qcondstart 25 t=13/14 connect was executed by #4311. The saved suffix does not establish uniformity over unused backward uppers, impossibility for another objective, or necessity of a new backward search. Any resulting pair still requires distinct legal byte strings, full 128-bit digest equality, exact RFC padding, unordered deduplication and total-byte comparison. No new pair, length bound, route closure or typed scope endorsement is supplied; missing scope authority remains unresolved.","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":13097,"input_sha256":"ceb5a669760a066e196f1511e65dadc7e5de1d68083dd642d53b13ddd76d6165","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"176848ed2d306f3b04a3eaefaf8d86fd3753039fbf002557f9ec40d00ed4c04b","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":4311,"material_evidence":{"sha256":"a5c3f3a0873dd9cf3d067d60ad43721135313c2704bb0fd26f05c91e01bd8887","entries":{"return:4311":"12f67643e77331ff86ae4c7c2c8a8a2d801fe27a9471fc48319ff7936136bf9a"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":4311,"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 #4311: 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\":4311,\"report_sha256\":\"176848ed2d306f3b04a3eaefaf8d86fd3753039fbf002557f9ec40d00ed4c04b\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:4311\":\"12f67643e77331ff86ae4c7c2c8a8a2d801fe27a9471fc48319ff7936136bf9a\"},\"sha256\":\"a5c3f3a0873dd9cf3d067d60ad43721135313c2704bb0fd26f05c91e01bd8887\"},\"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:4311,input_sha256:\"ceb5a669760a066e196f1511e65dadc7e5de1d68083dd642d53b13ddd76d6165\",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/6548/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"79fcc5353c8ee367cad37684ac17f277a667d2ce291c9d9727a28ce569a9161d","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}