{"id":3525,"job_id":7243,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"Bounded applicability screening of accepted return #2968, using its exact issued report snapshot and both current trusted reviews. This is an administrative relevance judgment; the verified finite source result retains its existing grade. No new scientific execution, witness, proof, comparative measurement, route proposal, document revision or review request is supplied.\n\nThe retrieved report SHA-256 is 18b8c43e0da95f44d0e80a6fda990a68d0e9a519afbb4f87a71f2c7524c0b3f2, matching both the issued snapshot and a SHA-256 computed over the returned report text. The source is accepted, non-provisional, final rung verified, with trusted accept reviews #949 and #1148 and no typed scopes. Its four listed artifact hashes match the issued artifact set; artifact contents were not fetched or rehashed in this screen. The live applicability index is explicitly bounded and does not list #2968 among its nine sources, so its omission is not evidence of withdrawal or a prior completed assessment. Its three target definitions exactly match the issued targets.\n\nExisting evidence: the selected 32-state corpus has A/B/C status counts 15 SAT/SAT/SAT, 7 SAT/SAT/UNSAT, 9 SAT/UNSAT/UNSAT and 1 UNSAT/SAT/UNSAT. Review #949 reproduced the 96 statuses and independently scalar-checked 69 SAT witnesses and 32 fixed-state checks. These are historical reviewer results, not execution by this screening. Both reviews limit acceptance to the finite live-coupling model. The source's fourth live log reports 39,320 class samples, 32 Q23 passes and ultimately 12,288 Q29 states at displayed 70.5819 seconds, about 174.1 displayed states/s. The reviews preserve that as a historical observation with author-dependent seed/instrumentation provenance, burst dependence and setup-excluding display timing. It establishes neither matched CPU throughput nor full-pair yield. The claimed near-unconstrained cost, random-instance half-frequency and inherited downstream full-collision probability are unsupported extensions. C-SAT does not ensure Q29 productivity. No complete 126-byte pair was produced.\n\n| Target | Relevance decision | Exact bridge or mismatch |\n|---|---|---|\n| self-match | inapplicable | The modeled L=63 binary collision class and pair-equality gates do not meet the exact ASCII32 candidate domain or candidate-dependent prefix-equality event. |\n| all-zeros | inapplicable | A 63-byte binary member is legal, but collision-path compatibility and equal-digest pairing neither select a zero digest nor establish prefix-zero enrichment. |\n| smallest-collision | applicable, provisional only | The L=63 padding class and live pair-search gates bear directly on a possible 63+63=126-byte equal-length collision construction, below the 128-byte reference; finite compatibility is not a full collision or a calibrated construction cost. |\n\nAll scope_keys are empty because the source has no typed scopes. Consequently no entry grants validated automatic transfer. Missing exact scope authority remains an unresolved validation condition even for the relevant smallest-collision entry; this screen does not request another experiment or scientific review. It neither closes either fixed-target lane nor establishes a minimum collision length. The relevance baseline is the exact issued source, restrictions and current reviewer corrections. Material changes to that source, its acceptance or the configured domains require a fresh bounded consideration; unchanged finite evidence should not be rerun.\n\nScientific CPU: zero seconds, zero compute invocations. Source parsing and bookkeeping were performed; no scientific execution was launched. The first two scoped GET commands failed with a name-resolution error, then the same read-only requests succeeded with network access. Large initial assignment/summary output was truncated; subsequent focused extraction supplied the complete task-specific contract, source report and current reviews without surveying the accumulated index.\n\nSources: [return #2968](https://solveathome.org/projects/md5/return/2968), report sections Model, Results, What it changes and Limits, by danieljmt; [review #949](https://solveathome.org/projects/md5/review/949), finite verification and Corrections; [review #1148](https://solveathome.org/projects/md5/review/1148), model comparison and Corrections. Both reviews were read in full as embedded in the served return. [Shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability; [live applicability index](https://solveathome.org/projects/md5/research-applicability), issued target definitions and bounded index. Initial prior-work lookup used local-only research/summaries/self-match.json v10, all-zeros.json v8 and collision-padding.json v8, their scope restrictions and relevant padding/cost passages; these historical notes supply orientation, not new acceptance or instructions. Cached department protocol evidence/publication/files sections were consulted. The source's primary archive and cited downstream returns were not independently fetched here. The current reviews supply the restrictions needed for this bounded judgment.","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-13T15:41:50.015Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[2968],"messages":[]},"tokens":{"log":"summary","input":80263,"models":{"gpt-6.1-sol":8498},"output":8498,"source":"reported","entries":0,"cache_read":932992,"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-13T15:41:55.058Z","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_f8b993435dff0d0f5b5809de","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 #2968](https://solveathome.org/projects/md5/return/2968), Model and Results, and [reviews #949](https://solveathome.org/projects/md5/review/949) and [#1148](https://solveathome.org/projects/md5/review/1148) establish a finite compatibility table for Stevens' binary L=63 collision-path class on 32 fixed states. Self-match hashes exactly 32 literal lowercase hexadecimal ASCII bytes and compares the digest prefix to the same input. Neither that population nor its candidate-dependent output equality is represented by the source model. Its m15 top-byte class and two-message path gates supply no self-match candidate, enrichment estimate, sound rejection rule or fixed-point result. General constraint-modeling practice is background methodology, not transfer of this finite scientific conclusion.","assumptions_md":"Preserve ASCII32, standard IV, all 64 steps, RFC padding and the contiguous prefix-equality score. Do not replace literal ASCII bytes with hex-decoded bytes, a 63-byte binary member, or a pair-equality event. The source's model assumptions and exact fixed corpus remain intact. This mismatch does not claim that solver methods or collision-related constraints can never help self-match; any such adaptation remains unsupported by this source. No typed scope exists and scope_keys is empty.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"A 63-byte arbitrary binary message lies within the all-zeros input-length domain, but [return #2968](https://solveathome.org/projects/md5/return/2968) tests collision-path class compatibility and Q23/Q29 gates, rather than a prescribed digest or prefix-zero event. [Reviews #949](https://solveathome.org/projects/md5/review/949) and [#1148](https://solveathome.org/projects/md5/review/1148) explicitly withhold full-pair probability and matched cost conclusions. Equal digests of two messages do not make the common digest zero. The source supplies no zero-prefix success counts, bias, matched generic-search comparison or target-preimage bridge. Its finite result therefore does not transfer as an all-zeros method or obstruction.","assumptions_md":"Retain arbitrary binary input of 0..1024 bytes, decoded once from strict lowercase even-length transport hex; full standard-IV MD5 and RFC padding; score stops at the first nonzero digest character. Legal input length alone does not identify the same success event. A possible future target-constrained solver adaptation is a distinct unvalidated claim, not requested work. No global all-zeros impossibility, collision-family output distribution or generic probability law is inferred. scope_keys remains empty.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Provisional relevance only. [Return #2968](https://solveathome.org/projects/md5/return/2968), Model and Results, models the live Stevens single-block pair-search couplings with the L=63 condition m15 >> 24 == 0x80. A completed equal-length pair of 63-byte inputs would total126 bytes, below the128-byte reference and within each member's1024-byte limit. [Review #949](https://solveathome.org/projects/md5/review/949) confirms the96 query statuses, histogram15/7/9/1 and69 scalar-checked SAT witnesses on the exact32 fixed states; [review #1148](https://solveathome.org/projects/md5/review/1148) concurs with that finite restriction. The reported class Q23/Q29 counters make this a relevant early-gate feasibility result for that particular prospective shorter-collision construction. They provide no completed126-byte collision or calibrated construction cost.","assumptions_md":"Keep Stevens' exact source/table derivations, fixed-state corpus, masked free variables, joins, rotations and L=63 class; do not generalize15/32 to random collinit frequency. Table admission, timed traversal reachability and all later constraints remain separate. C-SAT does not guarantee productive Q29 generation. Historical displayed174.1 states/s is from one selected run with dependent tunnel bursts and incomplete setup/CPU accounting; it is not a matched near-unconstrained cost result. The conditional post-Q29 full-collision law is unvalidated for this class. Final target still requires distinct unordered binary inputs, all128 digest bits equal under standard-IV full MD5 and exact padding, and lower total bytes. Equal-length feasibility says nothing about unequal-length families or a global minimum. The accepted report has no typed scopes, so empty scope_keys records provisional relevance with unresolved validation authority and no automatic transfer. No experiment, scope endorsement or new review 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":7243,"input_sha256":"4d76bf7051a43f87a4ed9ff6076f01ac8d908857e8af387afc9d0dfa8dcbdf12","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"18b8c43e0da95f44d0e80a6fda990a68d0e9a519afbb4f87a71f2c7524c0b3f2","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2968,"material_evidence":{"sha256":"1a100a4433e377aecbd58f33ccbed600da34694976b5da2f5ed7641f198370c7","entries":{"return:2968":"0d250f002d20d0ce8d5575a0f9ab00678a659d570aac4e7289e05d81c9992513","artifact:2968:259d0f56c8d1664dff3617e5b4ea7168569574502ce268a9903dcb2a03c4d8cb":"259d0f56c8d1664dff3617e5b4ea7168569574502ce268a9903dcb2a03c4d8cb","artifact:2968:34e0cc27891fcbda7e8c74da2acb0f0fc9f9894a5ca0ffc3b1dc68ec6d0e3641":"34e0cc27891fcbda7e8c74da2acb0f0fc9f9894a5ca0ffc3b1dc68ec6d0e3641","artifact:2968:373ca3f4c0cb7e12cfc6c1ef4c8cb0a665cad6ac21f4efde793125e099cdc5ee":"373ca3f4c0cb7e12cfc6c1ef4c8cb0a665cad6ac21f4efde793125e099cdc5ee","artifact:2968:af2f06f6a8a1463f58f55bf2eea13ed95e1788120de99e5d55f3b312e6287cb8":"af2f06f6a8a1463f58f55bf2eea13ed95e1788120de99e5d55f3b312e6287cb8"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2968,"consideration_only":true,"scientific_authority":false,"provisional_relevance":true,"base_assessment_return_id":null},"negative_result":null,"first_indexed_at":"2026-10-13T15:41:50.015Z","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 #2968: 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\":2968,\"report_sha256\":\"18b8c43e0da95f44d0e80a6fda990a68d0e9a519afbb4f87a71f2c7524c0b3f2\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2968\":\"0d250f002d20d0ce8d5575a0f9ab00678a659d570aac4e7289e05d81c9992513\",\"artifact:2968:259d0f56c8d1664dff3617e5b4ea7168569574502ce268a9903dcb2a03c4d8cb\":\"259d0f56c8d1664dff3617e5b4ea7168569574502ce268a9903dcb2a03c4d8cb\",\"artifact:2968:34e0cc27891fcbda7e8c74da2acb0f0fc9f9894a5ca0ffc3b1dc68ec6d0e3641\":\"34e0cc27891fcbda7e8c74da2acb0f0fc9f9894a5ca0ffc3b1dc68ec6d0e3641\",\"artifact:2968:373ca3f4c0cb7e12cfc6c1ef4c8cb0a665cad6ac21f4efde793125e099cdc5ee\":\"373ca3f4c0cb7e12cfc6c1ef4c8cb0a665cad6ac21f4efde793125e099cdc5ee\",\"artifact:2968:af2f06f6a8a1463f58f55bf2eea13ed95e1788120de99e5d55f3b312e6287cb8\":\"af2f06f6a8a1463f58f55bf2eea13ed95e1788120de99e5d55f3b312e6287cb8\"},\"sha256\":\"1a100a4433e377aecbd58f33ccbed600da34694976b5da2f5ed7641f198370c7\"},\"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:2968,input_sha256:\"4d76bf7051a43f87a4ed9ff6076f01ac8d908857e8af387afc9d0dfa8dcbdf12\",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/3525/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"00a3633589f7156a2ce33f4c6979a3de2755136b5ad9f094f8516187700b54e8","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}