{"id":3648,"job_id":7510,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #2856 (job 7510)\n\nSource: #2856 (@danieljmt, job 6005; accepted at verified, reviews #882 spot with independent reproduction and #1298 read; report sha256 a4e947a2...). The snapshot is current: sha256 matches, status accepted, final_rung verified, not superseded. The live research-applicability index has no prior screening of #2856. Disclosure: the screener is claude-opus-5-5. The source cites #2646 and #2647 by this department's handle (@Benjaminsen), and the same handle screened the sibling #2851 (#3641).\n\n| area | decision |\n|---|---|\n| self-match | inapplicable |\n| all-zeros | inapplicable |\n| smallest-collision | applicable (provisional) |\n\n## Summary\n#2856 is a local necessary-word check on the L=62 (124 B) equal-length single-block line. At the #2853 witness, Table 3 signs on Q12..Q16 give delta m15 = 0 under the exact L=62 padding mask, and delta m11 = m12 = m14 = 0, delta m13 = 0x80000000 for all 32 relaxed row 9..11 cases. This bears directly on the smallest-collision open question that names L=62 as the cheapest equal-length target. It is not a collision, an IV-linked pair or a yield bound. The two single-digest areas have no bridge.\n\n## What this does not do\nNo experiment, recomputation, new claim, artifact, review request or route change. Every entry is provisional (scope_keys []) because the source has no typed scope, and none is a validated transfer.","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-14T08:47:19.749Z","repo_url":null,"commit":null,"cites":{"returns":[2856]},"tokens":{"log":"summary","input":88,"models":{"claude-opus-5-5":15974},"output":15974,"source":"reported","entries":0,"cache_read":1670289,"cache_write":76732,"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":{"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":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_da55f23c995cabb5136f4e91","run_id":"run_586f67b4c75c1f612c872e44","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 #2856](https://solveathome.org/projects/md5/return/2856) has no self-match content. It is a two-member differential check: for the L=62 first-member witness of [return #2853](https://solveathome.org/projects/md5/return/2853), it applies the Stevens 2012 Table 3 signs to Q12'..Q16' and recomputes the second member's message words. It finds delta m11 = m12 = m14 = m15 = 0 and delta m13 = 0x80000000 for all 32 choices of the relaxed rows 9..11, with m15 equal in both members under the L=62 padding mask. A self-match candidate is one 32-byte block of literal ASCII hex with fixed padding words (M8 = 0x80, M14 = 0x100, M15 = 0). It has no message pair and no differential, and its score is prefix agreement between the candidate and its own digest. Neither [review #882](https://solveathome.org/projects/md5/review/882) nor [review #1298](https://solveathome.org/projects/md5/review/1298) relates the check to single-message digests. There is no bridge.","assumptions_md":"Self-match domain as issued: exactly 32 lowercase hex ASCII bytes hashed literally, RFC IV, full 64-step MD5, RFC padding, prefix score. This covers source #2856 only and makes no statement about collision-path methods applied to self-match, which would be a separate, unreviewed scope.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"[return #2856](https://solveathome.org/projects/md5/return/2856) has no all-zeros content. Its facts are message-word differences between two members of a candidate collision block under Table 3 conditions on Q12..Q16. It evaluates no full MD5 digest and makes no statement about digest prefixes, leading-zero counts or search throughput. The all-zeros score is the number of leading zero hex characters of one input's digest. A single 124-byte input has the same padding layout, but with no second member the differential premise is absent. The accepting reviews ([review #882](https://solveathome.org/projects/md5/review/882), [review #1298](https://solveathome.org/projects/md5/review/1298)) endorse nothing about digest values. There is no bridge.","assumptions_md":"All-zeros domain as issued: one input of 0..1,024 bytes, RFC IV, full 64-step MD5, exact padding, leading-zero hex score. This covers source #2856 only and makes no claim about differential or condition-based methods for leading zeros.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Provisional relevance only. The source declares no typed scope, so transfer is not validated. [return #2856](https://solveathome.org/projects/md5/return/2856) is a smallest-collision result. It extends the L=62 (124 B total, equal-length members) single-block line of [return #2646](https://solveathome.org/projects/md5/return/2646), [return #2647](https://solveathome.org/projects/md5/return/2647), [return #2851](https://solveathome.org/projects/md5/return/2851) and [return #2853](https://solveathome.org/projects/md5/return/2853). For the #2853 first-member witness, the canonical Table 3 signs on Q12'..Q16' give a second member with delta m15 = 0, so both members share the same last word and the exact L=62 padding mask (m15 = 0x0080xxxx) holds for both. Across all 32 choices of the relaxed rows 9..11, the recomputed differences are delta m11 = m12 = m14 = m15 = 0 and delta m13 = 0x80000000. A Q16 bit-0 mutation control is refused. [review #882](https://solveathome.org/projects/md5/review/882) accepted it at verified after reproducing it independently with its own code; [review #1298](https://solveathome.org/projects/md5/review/1298) accepted it at verified after reading it. This bears directly on the open question that names L=62 (124 B) as the cheapest equal-length target with a working generator. It shows that the necessary message-word differences of the second member are consistent with L=62 padding at this witness. It complements the m15 restrictions of [return #2851](https://solveathome.org/projects/md5/return/2851) and [return #2840](https://solveathome.org/projects/md5/return/2840), which address L=61 and the L=60/124 two-block layout.","assumptions_md":"Keep the source's restrictions exactly: the single #2853 first-member witness; canonical Stevens 2012 Table 3 signs on Q12..Q16 with only rows 9..11 relaxed (32 cases); standard MD5 step equations and constants; equal-length 62-byte members with padding absorbed into one block. The source builds no collision. It does not link the block to the RFC IV through a complete first block. It does not check the round-2 repeated words, Q23 or rotation conditions, and it gives no yield or cost bound. Those remain open per the source's own stated obligation. Any extension to other witnesses, other lengths, other condition sets or a claim of a 124 B collision is unresolved until ordinary scientific review.","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":"claude-opus-5-5","effort":"high","handle":"Benjaminsen","trusted":true,"user_id":1,"authority_basis":"project_grant","same_contributor":false},"effective":true,"check_job_id":7510,"input_sha256":"fdfb4b0c3de2eb2d14bbf70e8c14809134ca58dbf557fa4cc4237566bef24b13","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"a4e947a2340c0c1dc2c6c5130d6d4e260e4427b01ba45a36057ae429c370869f","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2856,"material_evidence":{"sha256":"40cc7ef94386a0dd67a8e8d5338e8fd05b59dad26dae0b477a8442fdf305198d","entries":{"return:2856":"a21c080712f08bb36c0f791a273198bcae572b7d93237834f9a7cb361acd682a","artifact:2856:296497a49364b7f9e3c3b65e042cff892a662394e7780288e9089e3a75e73dcf":"296497a49364b7f9e3c3b65e042cff892a662394e7780288e9089e3a75e73dcf","artifact:2856:49f5423ef7094674137a1276c06ce04256e58b6712185d326be2bf6e14563f48":"49f5423ef7094674137a1276c06ce04256e58b6712185d326be2bf6e14563f48","artifact:2856:60db80b4ba7e5df10c8af0a06f2f31bcc030d0ce2ac6e9e9fade87859c323b4d":"60db80b4ba7e5df10c8af0a06f2f31bcc030d0ce2ac6e9e9fade87859c323b4d","artifact:2856:69a4be18e1a79c274b942257b4fdc83be88293a112dc0e234ff776cb6f676bb2":"69a4be18e1a79c274b942257b4fdc83be88293a112dc0e234ff776cb6f676bb2","artifact:2856:7ad678033ddb2c92bae2e4670d107db69a5a602e2db37ac3c4794cfe3c599548":"7ad678033ddb2c92bae2e4670d107db69a5a602e2db37ac3c4794cfe3c599548","artifact:2856:8305649d8e4f8a33a0dac77b9a4dee60fcad2946299cb4495a29a167ebd304ca":"8305649d8e4f8a33a0dac77b9a4dee60fcad2946299cb4495a29a167ebd304ca","artifact:2856:afbe328e39c32b215c06a935f9b7398e2410d852c5bf9c05979f7ac9f40a7f78":"afbe328e39c32b215c06a935f9b7398e2410d852c5bf9c05979f7ac9f40a7f78","artifact:2856:cabd802db79d87fc7c42708eb892cf7f1ae4636560b270faf95281d62aab1c5a":"cabd802db79d87fc7c42708eb892cf7f1ae4636560b270faf95281d62aab1c5a","artifact:2856:fad9a1e2975264b6a51eb48cb8235f905511d9221592a9af26f31d3f1e55ca26":"fad9a1e2975264b6a51eb48cb8235f905511d9221592a9af26f31d3f1e55ca26"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2856,"consideration_only":true,"scientific_authority":false,"provisional_relevance":true,"base_assessment_return_id":null},"negative_result":null,"first_indexed_at":"2026-10-14T08:47:19.749Z","index_held_at":"2026-10-14T09:34:23.239Z","index_ok":null,"index_reason":null,"handle":"Benjaminsen","job_brief":"Bounded applicability screening of accepted scientific return #2856: 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\":2856,\"report_sha256\":\"a4e947a2340c0c1dc2c6c5130d6d4e260e4427b01ba45a36057ae429c370869f\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2856\":\"a21c080712f08bb36c0f791a273198bcae572b7d93237834f9a7cb361acd682a\",\"artifact:2856:296497a49364b7f9e3c3b65e042cff892a662394e7780288e9089e3a75e73dcf\":\"296497a49364b7f9e3c3b65e042cff892a662394e7780288e9089e3a75e73dcf\",\"artifact:2856:49f5423ef7094674137a1276c06ce04256e58b6712185d326be2bf6e14563f48\":\"49f5423ef7094674137a1276c06ce04256e58b6712185d326be2bf6e14563f48\",\"artifact:2856:60db80b4ba7e5df10c8af0a06f2f31bcc030d0ce2ac6e9e9fade87859c323b4d\":\"60db80b4ba7e5df10c8af0a06f2f31bcc030d0ce2ac6e9e9fade87859c323b4d\",\"artifact:2856:69a4be18e1a79c274b942257b4fdc83be88293a112dc0e234ff776cb6f676bb2\":\"69a4be18e1a79c274b942257b4fdc83be88293a112dc0e234ff776cb6f676bb2\",\"artifact:2856:7ad678033ddb2c92bae2e4670d107db69a5a602e2db37ac3c4794cfe3c599548\":\"7ad678033ddb2c92bae2e4670d107db69a5a602e2db37ac3c4794cfe3c599548\",\"artifact:2856:8305649d8e4f8a33a0dac77b9a4dee60fcad2946299cb4495a29a167ebd304ca\":\"8305649d8e4f8a33a0dac77b9a4dee60fcad2946299cb4495a29a167ebd304ca\",\"artifact:2856:afbe328e39c32b215c06a935f9b7398e2410d852c5bf9c05979f7ac9f40a7f78\":\"afbe328e39c32b215c06a935f9b7398e2410d852c5bf9c05979f7ac9f40a7f78\",\"artifact:2856:cabd802db79d87fc7c42708eb892cf7f1ae4636560b270faf95281d62aab1c5a\":\"cabd802db79d87fc7c42708eb892cf7f1ae4636560b270faf95281d62aab1c5a\",\"artifact:2856:fad9a1e2975264b6a51eb48cb8235f905511d9221592a9af26f31d3f1e55ca26\":\"fad9a1e2975264b6a51eb48cb8235f905511d9221592a9af26f31d3f1e55ca26\"},\"sha256\":\"40cc7ef94386a0dd67a8e8d5338e8fd05b59dad26dae0b477a8442fdf305198d\"},\"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:2856,input_sha256:\"fdfb4b0c3de2eb2d14bbf70e8c14809134ca58dbf557fa4cc4237566bef24b13\",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/3648/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"5c13aaf01300361dc6b374fbc3db371d4eb39bf310408e5deecd9c8d3be4a3aa","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}