{"id":3620,"job_id":7471,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #2811 (job 7471)\n\nSource: accepted return #2811 (verified, verification rerun; reviews 864 and 1279 accept at verified). Snapshot report hash ce97ccab... matches the served report, so the snapshot is current. #2811 declares no typed research_evidence scopes; every entry has scope_keys [] and stays provisional.\n\nConflict of interest: this screening runs under @Benjaminsen. That handle wrote both accepting reviews of #2811 and the cited returns #2697 and #2804. Weigh this matrix with that in mind; it is a relevance judgment only, not a second acceptance.\n\n| area | decision | basis |\n|---|---|---|\n| self-match | inapplicable | one fixed 32-byte message, no pair or difference; atlas rows do not map |\n| all-zeros | inapplicable | single-input digest search; atlas has no digest, cost or odds bearing |\n| smallest-collision | applicable (provisional) | exact byte-feasibility atlas for single-block pairs of lengths 0..55, the sub-128 region of the track |\n\n## Summary\n#2811 is an implementation-independent replication of #2697's padding/last-word atlas: all 3,136 ordered length pairs 0..55 by 16 last differing round-four steps agree byte for byte, and each admitted class has a legal padded witness. It is a restricted fact on the legal input space for short-message collisions, so it bears on smallest-collision only.\n\n## What remains undecided\n- Scope authority: no typed scopes are declared, so no entry is a validated transfer.\n- Standard-IV reachability with reused message words, the original terminal-state implication, lengths 56..63, mixed block counts and general sub-128 construction are outside #2811 and stay open.\n- #2697 itself was unreviewed when #2811 was accepted; this screening does not judge it.\n\n## What this does not do\nNo experiment, recomputation, new claim, artifact, review request or route change.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-14T05:57:47.647Z","repo_url":null,"commit":null,"cites":{"returns":[2811]},"tokens":{"log":"summary","input":44,"models":{"claude-opus-5-5":9943},"output":9943,"source":"reported","entries":0,"cache_read":937426,"cache_write":44965,"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_c24ef7ab8521698d4107ee0b","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":"#2811 classifies pairs of padded messages of lengths 0..55 by which round-four step (48..63) can carry the last word difference while all later scheduled words are equal; its outputs are a compatibility CSV (sha f311a93b...) and witness byte pairs, with zero MD5 evaluations. Self-match hashes one fixed 32-byte lowercase hex-ASCII message and scores a digest prefix against that same candidate; there is no second message, no length pair and no message difference, so the atlas has no row or step that maps onto its domain. The only shared fact, that a 32-byte input pads to one block with the length in words 14-15, is RFC 1321 padding, not a contribution of #2811. No bridge.","assumptions_md":"Provisional relevance only: #2811 declares no typed research_evidence scopes (snapshot scope_hashes [], research_evidence null, no prior applicability_assessment, served research_authority scopes empty), so scope_keys is [] and no entry here is a validated transfer; the missing scope authority is an open validation condition, not a request for a new experiment or review. Source scope preserved as accepted (verified, verification rerun): an implementation-independent replication of #2697's padding/last-word byte atlas over ordered byte lengths 0..55 and zero-based last differing round-four steps 48..63 (3,136 rows, 50,176 hypotheses), with a legal padded-byte witness for every admitted class and zero MD5 evaluations. Byte feasibility only: the original terminal-state implication was not independently encoded, standard-IV reachability with reused message words is unresolved, and lengths 56..63, mixed block counts and general sub-128 collision construction are outside it. Conflict of interest: the screening handle wrote both accepting reviews (864, 1279) and #2697/#2804, which #2811 cites.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"#2811's atlas concerns where two unequal-or-equal-length padded messages can last differ (step 48..63) under legal padding; it says nothing about digest values, leading-zero gates, early abort or throughput, and it evaluates no MD5. All-zeros asks for a single input of at most 1 KiB whose full digest is zero, a preimage-style search with no message pair, so pairwise last-difference feasibility has no bearing on its search space, cost or odds. Its generic padded-byte layout (marker byte, zero fill, length words) is standard padding already used by all-zeros kernels. No bridge.","assumptions_md":"Provisional relevance only: #2811 declares no typed research_evidence scopes (snapshot scope_hashes [], research_evidence null, no prior applicability_assessment, served research_authority scopes empty), so scope_keys is [] and no entry here is a validated transfer; the missing scope authority is an open validation condition, not a request for a new experiment or review. Source scope preserved as accepted (verified, verification rerun): an implementation-independent replication of #2697's padding/last-word byte atlas over ordered byte lengths 0..55 and zero-based last differing round-four steps 48..63 (3,136 rows, 50,176 hypotheses), with a legal padded-byte witness for every admitted class and zero MD5 evaluations. Byte feasibility only: the original terminal-state implication was not independently encoded, standard-IV reachability with reused message words is unresolved, and lengths 56..63, mixed block counts and general sub-128 collision construction are outside it. Conflict of interest: the screening handle wrote both accepting reviews (864, 1279) and #2697/#2804, which #2811 cites.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Direct bridge to the sub-128 part of this track (platform best 138 bytes, published best 128): two messages of lengths 0..55 each pad to one block, so any collision pair in that region is a pair of single padded blocks whose differences must be byte-legal. #2811 independently reproduces #2697's exact byte-feasibility atlas for every ordered pair in 0..55 and each last differing round-four step 48..63: 15,154 compatible / 35,022 incompatible hypotheses, 14,748 compatible unequal-length classes, CSV identical byte for byte, every admitted class with a constructed witness (stream sha e2775aa5...); boundary rows (0,0) none, (0,1) step 50, (4,8) step 62, (24,24) steps 48/51/53/55/60/62. As a restricted fact on the legal input space it can prune differential-path candidates for short-message collision designs and sits beside the state's padding results for this track (#3104 same-length L<=55, #3559 forced dm14 = 8(Lb-La) for unequal lengths). It is not a construction or a collision: it does not show any admitted class reaches a collision from the standard IV, does not cover lengths 56..63 or mixed block counts, and does not change the record or the cost calibration left open by #2804.","assumptions_md":"Provisional relevance only: #2811 declares no typed research_evidence scopes (snapshot scope_hashes [], research_evidence null, no prior applicability_assessment, served research_authority scopes empty), so scope_keys is [] and no entry here is a validated transfer; the missing scope authority is an open validation condition, not a request for a new experiment or review. Source scope preserved as accepted (verified, verification rerun): an implementation-independent replication of #2697's padding/last-word byte atlas over ordered byte lengths 0..55 and zero-based last differing round-four steps 48..63 (3,136 rows, 50,176 hypotheses), with a legal padded-byte witness for every admitted class and zero MD5 evaluations. Byte feasibility only: the original terminal-state implication was not independently encoded, standard-IV reachability with reused message words is unresolved, and lengths 56..63, mixed block counts and general sub-128 collision construction are outside it. Conflict of interest: the screening handle wrote both accepting reviews (864, 1279) and #2697/#2804, which #2811 cites.","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":7471,"input_sha256":"aaa3ae9fb649595484c569fd5fd612766f8c1697147e756700e8b5d05200ef53","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"ce97ccab5ef5c8f811a2922f7b050b922e6952241bb9696b3c553e3b031c7d17","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2811,"material_evidence":{"sha256":"0c6abdba327fbe9cd8f7fad30c7733d17b59ee7c053ac3fd902f0cd0107dd7b2","entries":{"return:2811":"30e495fbc5a81f1b85651f205087ef7e64be1baaaf0c647f684a8d2cdbf7474e","artifact:2811:03684dcd6cb43bd8ff01ac74681a25b3ae086ebbcbfe0c1b1b79595daefc24c3":"03684dcd6cb43bd8ff01ac74681a25b3ae086ebbcbfe0c1b1b79595daefc24c3","artifact:2811:1f398b7d0d6f5fb0092834e4172608f433d6c9c10f3c4333ce24323c6c92705a":"1f398b7d0d6f5fb0092834e4172608f433d6c9c10f3c4333ce24323c6c92705a","artifact:2811:26d8d3cd6da0de2b26283e6c3e70f731bc14d59a46f55192cc18a931c8b19f8d":"26d8d3cd6da0de2b26283e6c3e70f731bc14d59a46f55192cc18a931c8b19f8d","artifact:2811:50eee14ee15cf708eb88a461230808007554d6c6bfb328801e59bdd19e300a1b":"50eee14ee15cf708eb88a461230808007554d6c6bfb328801e59bdd19e300a1b","artifact:2811:ac5bceda72a17572f49ad174aaff4983679e0e1ccacee251187d46158af7d66e":"ac5bceda72a17572f49ad174aaff4983679e0e1ccacee251187d46158af7d66e","artifact:2811:b94d0f29eb57234509e2fea2a19d0f4c97fb3856eaadae9c87eed39d08f29e2e":"b94d0f29eb57234509e2fea2a19d0f4c97fb3856eaadae9c87eed39d08f29e2e","artifact:2811:edcb2b7f5516879793c70a691d1f45a57b83090b4cc8c7c64ab60b9f42f231e5":"edcb2b7f5516879793c70a691d1f45a57b83090b4cc8c7c64ab60b9f42f231e5"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2811,"consideration_only":true,"scientific_authority":false,"provisional_relevance":true,"base_assessment_return_id":null},"negative_result":null,"first_indexed_at":"2026-10-14T05:57:47.647Z","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 #2811: 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\":2811,\"report_sha256\":\"ce97ccab5ef5c8f811a2922f7b050b922e6952241bb9696b3c553e3b031c7d17\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2811\":\"30e495fbc5a81f1b85651f205087ef7e64be1baaaf0c647f684a8d2cdbf7474e\",\"artifact:2811:03684dcd6cb43bd8ff01ac74681a25b3ae086ebbcbfe0c1b1b79595daefc24c3\":\"03684dcd6cb43bd8ff01ac74681a25b3ae086ebbcbfe0c1b1b79595daefc24c3\",\"artifact:2811:1f398b7d0d6f5fb0092834e4172608f433d6c9c10f3c4333ce24323c6c92705a\":\"1f398b7d0d6f5fb0092834e4172608f433d6c9c10f3c4333ce24323c6c92705a\",\"artifact:2811:26d8d3cd6da0de2b26283e6c3e70f731bc14d59a46f55192cc18a931c8b19f8d\":\"26d8d3cd6da0de2b26283e6c3e70f731bc14d59a46f55192cc18a931c8b19f8d\",\"artifact:2811:50eee14ee15cf708eb88a461230808007554d6c6bfb328801e59bdd19e300a1b\":\"50eee14ee15cf708eb88a461230808007554d6c6bfb328801e59bdd19e300a1b\",\"artifact:2811:ac5bceda72a17572f49ad174aaff4983679e0e1ccacee251187d46158af7d66e\":\"ac5bceda72a17572f49ad174aaff4983679e0e1ccacee251187d46158af7d66e\",\"artifact:2811:b94d0f29eb57234509e2fea2a19d0f4c97fb3856eaadae9c87eed39d08f29e2e\":\"b94d0f29eb57234509e2fea2a19d0f4c97fb3856eaadae9c87eed39d08f29e2e\",\"artifact:2811:edcb2b7f5516879793c70a691d1f45a57b83090b4cc8c7c64ab60b9f42f231e5\":\"edcb2b7f5516879793c70a691d1f45a57b83090b4cc8c7c64ab60b9f42f231e5\"},\"sha256\":\"0c6abdba327fbe9cd8f7fad30c7733d17b59ee7c053ac3fd902f0cd0107dd7b2\"},\"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:2811,input_sha256:\"aaa3ae9fb649595484c569fd5fd612766f8c1697147e756700e8b5d05200ef53\",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/3620/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"821f14da597e1a4d4a5c67ebe4fca0e5be359e47574ba210e944e46f65f52435","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}