{"id":6508,"job_id":13046,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"Improvement claim: none. Administrative applicability screening of return #3716 for job #13046; no new scientific claim, execution or acceptance. Relevance judgments are heuristic; the source retains its existing accepted/measured status only within its reviewers' repair/smoke scope.\n\n## Source and currentness\n\nThe observed /projects/md5/return/3716 is accepted/measured, nonprovisional, not superseded, with trusted acceptance reviews #1382 and #2233, neither flagged for reassessment. Its 156-byte report computes to SHA-256 82e874c1440a60e150f321e103e6eba1c621d3d83a555cc5523f8d5bde6ed405, exactly the issued report pin. All six declared file hashes match the issued snapshot's artifact-pin set. This is a check of served metadata and report bytes, not a fresh download/hash check of the six artifact bodies or a reconstruction of the server's material-return fingerprint. The observed source has no research scopes, matching the issued empty scope list. The bounded live research-applicability index returned three other sources, including when source_return_id=3716 was requested; omission from this bounded response is not evidence of withdrawal or currentness. Direct source status, report bytes, pins and current reviews supply the scoped currentness evidence.\n\nThe remaining assignment obligation was a first three-area relevance matrix, not a repeat source review. The latest topic summaries supplied in the assignment were consulted (self-match v50, all-zeros v36, smallest-collision v56). Local-only research/summaries/collision-padding.json v8, updated 2026-10-10, was used as a route-249 lookup aid; it predates #3716 and provides no current acceptance authority. The actual cited precursor #3715 and its reviews #1347/#1351 were read. Source #3716 is a wrapper repair, even though this administrative screening was queued under an accepted-scientific-source policy. That label does not broaden its evidence.\n\n## Applicability matrix\n\n| Target | Decision | Scope keys | Supported relevance |\n|---|---|---|---|\n| self-match | inapplicable | [] | No 32-byte lowercase-ASCII fixed-point candidate method or scoring bridge. |\n| all-zeros | inapplicable | [] | Collision/Q29 counters do not target a zero digest or establish leading-zero efficiency. |\n| smallest-collision | applicable, provisional | [] | Operational reuse of the repaired route-249 measurement wrapper under its existing dependencies and limitations. |\n\nThe structured entries preserve each domain mismatch, the limited collision bridge and its assumptions. The empty scope lists are deliberate: no typed scope is invented or endorsed. No entry supports automatic transfer of scientific claims. In particular, source #3716 does not strengthen #3715's counter observations, fix asymmetric internal timing, publish the full patched generator, replay its states, establish full-cost advantage or produce a collision. Review #1351's censored-count and STOP-quantifier qualifications remain in force. Later evidence visible in the supplied lane summary is not treated as a consequence or validation of this wrapper repair; no unchanged route survey was repeated.\n\n## Work and limitations\n\nActual scientific CPU seconds 0; cpu_hours 0; controller compute calls 0; MD5 evaluations 0; candidates 0; scientific inputs []; seeds []; scientific execution failures []. Historical seeds and measurements cited above belong to prior work. Metadata parsing and report SHA-256 inspection were administrative overhead, not measured scientific CPU execution. No experiment, proof rerun, new scientific artifact, review request, route change or document integration was performed. The only output prepared for controller publication is this report with its bound applicability assessment; no file attachment is needed.\n\nThe first read-only source GET failed with DNS resolution error (Errno 8); the authorized network-enabled retry returned HTTP 200. One local inspection script later failed with AttributeError after treating the protocol's string reply as an object; subsequent parsing used the correct string type. Neither failure launched science. A proposed source filter on the bounded applicability index did not narrow its response, so it was not used as source-specific currentness evidence. Reconsideration requires a material source/report/artifact/authority or target-domain change; absent such a change, reuse this limited matrix. Missing typed authority is not a demand for another experiment or full scientific review.\n\n## Sources\n\n- /projects/md5/return/3716: report, recipe, original repair brief, file pins, current authority/decision and trusted reviews #1382/#2233; report SHA-256 82e874c1440a60e150f321e103e6eba1c621d3d83a555cc5523f8d5bde6ed405; repaired wrapper SHA-256 410f030eea4c3bab6bd54bb2e60d79bcf733362be0767cc58e936821be25b325.\n- /projects/md5/return/3715: report/recipe, current accepted status and reviews #1347/#1351; report SHA-256 490b448adb7b181bc4a583dbae58d2ebe618c717f011bcb3f3b3e5d6c35f6edb. Other works mentioned by those reviews were not independently inspected here.\n- /projects/md5/job/13046: exact supplied applicability contract, source snapshot and target domains; input SHA-256 ff95998fcc9ede199a4ed8bffb1774b652f9e34dde79f188d0edba500a0e77e3. Supplied latest summary excerpts correspond to /projects/md5/state/self-match v50, /projects/md5/state/all-zeros v36 and /projects/md5/state/smallest-collision v56.\n- /projects/md5/research-protocol?section=shared-research: Cross-area applicability (research-applicability-v1), provisional consideration and empty-scope transfer restrictions; /projects/md5/research-applicability: bounded current index.\n- Local-only research/summaries/collision-padding.json v8: route-249 background lookup. Cached department-protocol evidence/publication/files sections: reporting contract. No external literature survey was performed.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-29T04:23:36.122Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3716,3715],"messages":[]},"tokens":{"log":"summary","input":79418,"models":{"gpt-6.1-sol":8245},"output":8245,"source":"reported","entries":0,"cache_read":633600,"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-29T04:23:41.138Z","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_a7b7b4773919c44543a4254b","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 #3716 report/recipe and trusted reviews #1382/#2233 limit the contribution to repository-root resolution and stderr diagnostics in job7169-run_measure_i12.sh. The script orchestrates route-249 L62 steered versus unconstrained md5sbc Q29 counters, not candidates consisting of exactly 32 lowercase hexadecimal ASCII bytes. Neither #3716 nor its cited precursor #3715 supplies a fixed-point objective, legal self-match candidate enumeration or a self-prefix comparison. A generally useful filesystem technique is not evidence of an MD5 search-method transfer.","assumptions_md":"The target hashes the literal 32 ASCII bytes with full 64-step RFC-IV MD5 and exact padding; it scores the initial candidate/digest common prefix. Do not substitute arbitrary binary collision inputs, Q29 events or a different padding/IV domain. Inapplicable describes this source contribution only, not a theorem excluding other adaptations.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Return #3716 and reviews #1382/#2233 repair the route-249 paired-collision measurement wrapper without changing its md5sbc invocation, pins or seeds. Precursor #3715 and review #1351 measure historical Q29ok counters, not a specified digest value or leading-zero distribution. Although arbitrary binary inputs are legal in this target, equal digests of a pair need not equal zero; this source provides no bridge from its differential/Q29 conditions to all-zero preimage search or cheaper leading-zero trials.","assumptions_md":"Legal inputs are 0 through 1024 bytes, hex decoded once; score counts only leading zero digest hex characters under full 64-step RFC-IV MD5 with exact padding. A collision-generator counter is not a zero-preimage success or an equivalent trial unit. No all-zeros impossibility or universal lack of utility is inferred.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Provisional operational relevance only. Return #3716 directly repairs the wrapper for #3715 route-249 L62 steering, a collision-research workflow in this lane. Trusted review #1382 exercised the exact wrapper using stubs for cwd lookup, script-directory fallback, relative invocation, spaces and missing-root failure; review #2233 reused that immutable evidence and source comparison. Repository-root discovery, quoted paths and stderr progress make the same pinned measurement wrapper usable under its recipe. This does not validate a shorter collision or a method gain. Precursor #3715 review #1351 accepts only historical counters on three pinned instances: s2 displayed 102400/1786.3 versus 135168/1745.66, ratio 0.74034020; s0/s1 zero-print observations are censored, not exact zeros. Those figures are prior evidence, not this assignment execution.","assumptions_md":"Retain the exact script SHA-256 410f030eea4c3bab6bd54bb2e60d79bcf733362be0767cc58e936821be25b325 and recipe dependencies: GNU timeout, a built patched md5sbc, FORCE_INST/FORCE_FE pin files and reachable work/job7169/src. Cwd lookup takes precedence over the script checkout; the root / itself is not tested. The wrapper covers instances 1 and 2, two arms each, with historical seeds 0x7169C003 through 0x7169C006, STEER_L 62/0 and FORCE_FE only on the steered arm. ALL_DONE or wrapper exit zero does not prove successful child science. The current full pin patch/state replay and complete matched CPU/setup accounting remain unavailable in the cited evidence; no CPU-normalized gain, exact on-path yield, tail probability, new collision or length minimum follows. A legal target result still requires distinct inputs of at most 1024 bytes each with all 128 digest bits equal, ranked by total bytes. Missing typed-scope authority remains an unresolved validation condition: scope_keys is empty, relevance is provisional and no automatic scientific transfer is authorized.","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":13046,"input_sha256":"ff95998fcc9ede199a4ed8bffb1774b652f9e34dde79f188d0edba500a0e77e3","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"82e874c1440a60e150f321e103e6eba1c621d3d83a555cc5523f8d5bde6ed405","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3716,"material_evidence":{"sha256":"67ed7b4e36c0ac82adfe18a772a810e25887daff1970cbb79e05cd37849a15d4","entries":{"return:3716":"156b0fdf957ec2b551d14db3469f2930737dfcd2328d01def05003c8315dadb5","artifact:3716:410f030eea4c3bab6bd54bb2e60d79bcf733362be0767cc58e936821be25b325":"410f030eea4c3bab6bd54bb2e60d79bcf733362be0767cc58e936821be25b325","artifact:3716:484653eb9632a09bf220f6863cd57710f4ba7363fc0462e40994787b8543a67b":"484653eb9632a09bf220f6863cd57710f4ba7363fc0462e40994787b8543a67b","artifact:3716:56228cf43c58f596dc4fc077fb0f06ee0fdda969568442237c94c7040256d5d7":"56228cf43c58f596dc4fc077fb0f06ee0fdda969568442237c94c7040256d5d7","artifact:3716:6d881bed73fdbc402810ed241b3c8c3d11b6ec613a052350ebbee1b2dc769db3":"6d881bed73fdbc402810ed241b3c8c3d11b6ec613a052350ebbee1b2dc769db3","artifact:3716:82e874c1440a60e150f321e103e6eba1c621d3d83a555cc5523f8d5bde6ed405":"82e874c1440a60e150f321e103e6eba1c621d3d83a555cc5523f8d5bde6ed405","artifact:3716:ec37b5fb717b00cdb52990198366c016bd04a2db0a8b7eeb1ba77e7e1500f333":"ec37b5fb717b00cdb52990198366c016bd04a2db0a8b7eeb1ba77e7e1500f333"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3716,"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 #3716: 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\":3716,\"report_sha256\":\"82e874c1440a60e150f321e103e6eba1c621d3d83a555cc5523f8d5bde6ed405\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3716\":\"156b0fdf957ec2b551d14db3469f2930737dfcd2328d01def05003c8315dadb5\",\"artifact:3716:410f030eea4c3bab6bd54bb2e60d79bcf733362be0767cc58e936821be25b325\":\"410f030eea4c3bab6bd54bb2e60d79bcf733362be0767cc58e936821be25b325\",\"artifact:3716:484653eb9632a09bf220f6863cd57710f4ba7363fc0462e40994787b8543a67b\":\"484653eb9632a09bf220f6863cd57710f4ba7363fc0462e40994787b8543a67b\",\"artifact:3716:56228cf43c58f596dc4fc077fb0f06ee0fdda969568442237c94c7040256d5d7\":\"56228cf43c58f596dc4fc077fb0f06ee0fdda969568442237c94c7040256d5d7\",\"artifact:3716:6d881bed73fdbc402810ed241b3c8c3d11b6ec613a052350ebbee1b2dc769db3\":\"6d881bed73fdbc402810ed241b3c8c3d11b6ec613a052350ebbee1b2dc769db3\",\"artifact:3716:82e874c1440a60e150f321e103e6eba1c621d3d83a555cc5523f8d5bde6ed405\":\"82e874c1440a60e150f321e103e6eba1c621d3d83a555cc5523f8d5bde6ed405\",\"artifact:3716:ec37b5fb717b00cdb52990198366c016bd04a2db0a8b7eeb1ba77e7e1500f333\":\"ec37b5fb717b00cdb52990198366c016bd04a2db0a8b7eeb1ba77e7e1500f333\"},\"sha256\":\"67ed7b4e36c0ac82adfe18a772a810e25887daff1970cbb79e05cd37849a15d4\"},\"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:3716,input_sha256:\"ff95998fcc9ede199a4ed8bffb1774b652f9e34dde79f188d0edba500a0e77e3\",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/6508/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"1db632fd4e974ae884d5789b32ca22f132e202d17f39ec52e76513db36fc05e5","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}