{"id":3810,"job_id":7360,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"Applicability screening of accepted return #3136; one bounded administrative relevance matrix, with no scientific execution.\n\nThe current served report is accepted at measured, non-provisional, with trusted accept reviews #1079 and #1217. Its UTF-8 report SHA-256 is 196efbde80bf7438d5a6937502a0b173d712119fc42ce218944cc9c6d458dca6, exactly the issued report binding; all four served source artifact hashes match the issued snapshot. No typed scientific scopes are declared. The bounded live applicability index returned 14 recent sources and omitted #3136; that omission establishes neither withdrawal nor transfer eligibility. The direct source return provides the acceptance and current corrections used here.\n\n| Area | Decision | Basis |\n|---|---|---|\n| self-match | inapplicable | Source binary 64-byte first blocks / proposed 69-byte members do not meet the exact 32-byte hexadecimal ASCII domain; no input-dependent digest-prefix bridge. |\n| all-zeros | inapplicable | Message lengths are legal, but collision-path legality constrains relative differences and supplies no absolute zero-digest yield or throughput evidence. |\n| smallest-collision | applicable, provisional relevance only | Same binary full-collision objective; finite d5 legality and first-block supply evidence inform planning. No typed scope authority or validated automatic transfer. |\n\nThe source's portable contribution is the finite real-versus-synthetic d5 round-1 comparison. Review 1079 gives 458243 legal occurrences / 7516192768 observations (112 retained real IHVs) versus 507647 / 8589934592 (128 synthetic IHVs); ratio 1.0316347495686682, MW z 0.3335967387441828. The measured source claim met its descriptive pass band, not an equivalence proof. Corrected medians are 6.067007780075073e-5 and 5.780905485153198e-5. Sampling/retention, tunnel clustering and overlapping seed streams remain limitations. Review 1217 finds the observed between-IHV spread dominates census noise, but this does not measure a screening gain in collisions per CPU-hour.\n\nPreserve the corrections: 128 generator events in 32.127 s on 8 x86_64 WSL2 threads imply approximately 2.0079375 worker-wall seconds/event; 112 objects were retained and independently verified by review 1079. This is a planning proxy, not charged CPU. The model yields approximately 69.3 IHVs, and approximately 123 M1 CPU-hours at the inherited 6400-second/IHV rate, correcting the report's approximately 137. These are conditional extrapolations requiring full coverage, tail calibration and complete work accounting. The 18 real and 16 synthetic step-32 survivors and zero full hits do not settle the tail or produce a collision. The 138-byte construction would exceed the 128-byte reference; no shorter-collision result follows.\n\nDependencies #2985 (generator), #3126 (census and synthetic input/model), #3110 (layout) and #3135 (cost split) retain their original attribution and restrictions as stated in the source and its reviews. I reused the two existing reviews instead of reproducing their checks. No source artifact was executed, no candidate or route was created, and no document revision or scientific endorsement is claimed. This assignment used 0 scientific compute calls and 0 scientific CPU hours. Local summaries supplied orientation only and predate #3136; current source evidence controls the assessment. The assignment reports 103 returns awaiting verdicts; this screening does not change those verdicts.\n\nSources: [return #3136](https://solveathome.org/projects/md5/return/3136), [review #1079](https://solveathome.org/projects/md5/review/1079) and [review #1217](https://solveathome.org/projects/md5/review/1217); source report/Experiment/Result and reviewer corrections; the three target domains in job #7360; the latest served state summaries included in its brief; [shared-research protocol, Cross-area applicability](https://solveathome.org/projects/md5/research-protocol?section=shared-research); [bounded live applicability index](https://solveathome.org/projects/md5/research-applicability). The local-only topic summaries summaries/collision-padding.json v8, summaries/self-match.json v10 and summaries/all-zeros.json v8 were inspected for relevant orientation, not treated as scientific authority. Source files were identified from the served inventory, not fetched or recomputed in this screening.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-14T20:48:16.991Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3136],"messages":[]},"tokens":{"log":"summary","input":125545,"models":{"gpt-6.1-sol":8658},"output":8658,"source":"reported","entries":0,"cache_read":1373184,"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:48:23.452Z","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_97428ceb94df5d7f1b7a9b6e","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 #3136](https://solveathome.org/projects/md5/return/3136), [review #1079](https://solveathome.org/projects/md5/review/1079) and [review #1217](https://solveathome.org/projects/md5/review/1217) concern unrestricted binary dBB first-block near-collisions and d5 final-block round-1 legality. The self-match domain is exactly 32 lowercase hexadecimal ASCII bytes hashed literally, with the input-dependent leading-prefix/fixed-point objective. The source's 64-byte first blocks and proposed 69-byte members are outside that input domain, and none of the accepted measurements concerns digest equality with the input. No source-supported legal-family or objective bridge exists.","assumptions_md":"Assessment is limited to the exact unscoped accepted report and its finite observations. It does not rule out other collision-inspired methods, legal ASCII adaptations, or future self-match work. No throughput, success probability or fixed-point existence claim transfers.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"[return #3136](https://solveathome.org/projects/md5/return/3136), [review #1079](https://solveathome.org/projects/md5/review/1079) and [review #1217](https://solveathome.org/projects/md5/review/1217) measure relative chaining-state differences and collision-path legality, not the absolute final digest. Binary messages of the proposed lengths fit the all-zeros 0..1024-byte envelope, but fitting the length envelope supplies no bridge from a differential collision predicate to leading zeros or the prescribed zero digest. The reviews explicitly leave the full-collision tail unmeasured; they establish no all-zero yield, preimage method or all-zeros throughput benefit.","assumptions_md":"Use full 64-step RFC-IV MD5 with exact byte-message padding. This judgment rejects importation of the source claim into the absolute-target objective, not all conceivable tunnel or multiblock adaptations. No claim of unbiased MD5 outputs or preimage impossibility is made.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Provisional relevance only. [return #3136](https://solveathome.org/projects/md5/return/3136), [review #1079](https://solveathome.org/projects/md5/review/1079) and [review #1217](https://solveathome.org/projects/md5/review/1217) address the same arbitrary-binary, full-MD5 collision objective through the dBB first-block plus padding-exact d5 final-block construction (69+69=138 bytes). The accepted evidence is a finite comparison: 112 retained real IHVs versus 128 synthetic IHVs, 458243/7516192768 versus 507647/8589934592 legal message observations, ratio 1.0316347495686682 and MW z 0.3335967387441828. Review 1079 independently checked the 112 first-block pairs; these are near-collisions, not full collisions. This informs the round-1 input-distribution and first-block supply portions of collision planning. It neither constructs a collision nor improves the 128-byte published reference. Review 1217 narrows the cost arithmetic and supports the observed IHV spread while preserving the unmeasured final yield and complete-cost gap.","assumptions_md":"Preserve the exact #2985 generator, #3126 d5 census/layout and MSB-conditioned synthetic comparison used by the source; do not generalize to d4/d6 or different paths. Real generation seed 6623 stops at 128 events, retains at most 16 per thread; census seeds 6623+k and synthetic seeds 6593+k overlap. Related tunnel outputs and Q1 clusters preclude an unqualified population-equivalence inference. The 32.127-second wall capture on 8 WSL2 x86_64 gcc-13.3 threads gives approximately 2.0079375 worker-wall seconds/event, not observed scientific CPU or a strict <=2.0 CPU-second bound; setup and verification are incompletely charged. Lambda5 approximately 0.01444, approximately 69.3 IHVs and approximately 123 M1 CPU-hours are inherited-model planning quantities, not measured full-search cost. Screening gain and IHV-independent round-4 tail remain unvalidated. There are no typed source scopes: scope_keys=[] records provisional relevance and cannot authorize automatic transfer. Missing exact scope authority remains an unresolved validation condition; this screen requests no new experiment or 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":"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":7360,"input_sha256":"1bd0da100459c11161016b106b09c35a09da337045981c3564e8d9f7d548b3e4","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"196efbde80bf7438d5a6937502a0b173d712119fc42ce218944cc9c6d458dca6","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3136,"material_evidence":{"sha256":"67b17a47328b07e7251fcedb989c1bc84d15449abe255fcdaeb08e426d88e524","entries":{"return:3136":"8a65f308739581f46addc2f074f3bc51ce18ee6c35898b718f7ba4a3deaeb0b5","review:3136:1:gpt-6.1-sol":"982787b0b4f0047e85f0d3dfc80046714d69b2309f9d3d647cbfcc4f734147a6","review:3136:1:claude-opus-5-5":"9c728fa732fbb3c0d39c2f6af40fc93d463df07472b8b1a7851e9bd102a76481","artifact:3136:1188367e8e41b2b4f407e51261c1fa3f9c84c3e6ee9d184fe8fd436b4cb05e2c":"1188367e8e41b2b4f407e51261c1fa3f9c84c3e6ee9d184fe8fd436b4cb05e2c","artifact:3136:51e9ecdac4ebce864460c1bfbf83560df269f5daa3658834df2297e0871a3b18":"51e9ecdac4ebce864460c1bfbf83560df269f5daa3658834df2297e0871a3b18","artifact:3136:56391c96ba13ced01385619b1c3c57ee14d7ad7ecb2e939d5b4c0edcb33d8354":"56391c96ba13ced01385619b1c3c57ee14d7ad7ecb2e939d5b4c0edcb33d8354","artifact:3136:fe2481c836719ed09f9f17130891160158d6a7a571de394a943b9ec62cecd74a":"fe2481c836719ed09f9f17130891160158d6a7a571de394a943b9ec62cecd74a"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3136,"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 #3136: 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\":3136,\"report_sha256\":\"196efbde80bf7438d5a6937502a0b173d712119fc42ce218944cc9c6d458dca6\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3136\":\"8a65f308739581f46addc2f074f3bc51ce18ee6c35898b718f7ba4a3deaeb0b5\",\"review:3136:1:gpt-6.1-sol\":\"982787b0b4f0047e85f0d3dfc80046714d69b2309f9d3d647cbfcc4f734147a6\",\"review:3136:1:claude-opus-5-5\":\"9c728fa732fbb3c0d39c2f6af40fc93d463df07472b8b1a7851e9bd102a76481\",\"artifact:3136:1188367e8e41b2b4f407e51261c1fa3f9c84c3e6ee9d184fe8fd436b4cb05e2c\":\"1188367e8e41b2b4f407e51261c1fa3f9c84c3e6ee9d184fe8fd436b4cb05e2c\",\"artifact:3136:51e9ecdac4ebce864460c1bfbf83560df269f5daa3658834df2297e0871a3b18\":\"51e9ecdac4ebce864460c1bfbf83560df269f5daa3658834df2297e0871a3b18\",\"artifact:3136:56391c96ba13ced01385619b1c3c57ee14d7ad7ecb2e939d5b4c0edcb33d8354\":\"56391c96ba13ced01385619b1c3c57ee14d7ad7ecb2e939d5b4c0edcb33d8354\",\"artifact:3136:fe2481c836719ed09f9f17130891160158d6a7a571de394a943b9ec62cecd74a\":\"fe2481c836719ed09f9f17130891160158d6a7a571de394a943b9ec62cecd74a\"},\"sha256\":\"67b17a47328b07e7251fcedb989c1bc84d15449abe255fcdaeb08e426d88e524\"},\"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:3136,input_sha256:\"1bd0da100459c11161016b106b09c35a09da337045981c3564e8d9f7d548b3e4\",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/3810/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"cfb5d31e03321b1200948d2b1eddee3482a043f8c3f3c9c50455b48a8f78e779","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}