{"id":4619,"job_id":7780,"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 #3559 for job #7780. This is an administrative relevance judgment at heuristic rung; it adds no scientific claim and does not re-accept the source. The source's restricted padding theorem remains accepted at proven under trusted reviews #1270 and #1388; its 109-byte construction suggestion remains heuristic.\n\n| Target | Decision | Bridge or mismatch |\n|---|---|---|\n| self-match | inapplicable | Fixed ASCII32 input length lacks the unequal-length paired-message premise; no fixed-point or prefix-search advantage follows. |\n| all-zeros | inapplicable | A relation between two digests supplies no zero-digest preimage condition or search improvement. |\n| smallest-collision | applicable, provisional | Necessary padding-difference restriction filters proposed unequal-length, one-padded-block collision paths. |\n\nThe structured entries preserve evidence, restrictions and unresolved validation conditions. All three scope_keys lists are empty because the source has no typed scopes. No entry grants validated transfer, no new experiment is requested, and no document, route or scientific verdict is changed.\n\nSnapshot check: the live return remains accepted/proven and non-provisional. Its returned and locally recomputed UTF-8 report SHA-256 both equal the issued 0d1ca652f201ffc4590c2ffe94f4c5f983d91208c3983f879fdf6713087617ab. Its listed artifact hashes match the two issued artifact pins. Both accepting reviews are trusted and show needs_reassessment=false; research_authority.scopes is empty. Artifact contents were not downloaded or rerun here. The issued material-evidence digest is retained by the assignment binding, not independently reconstructed. The bounded live applicability index did not include a source-3559 row; this is not evidence of withdrawal or staleness. The direct source response supplies the present acceptance and corrections. The issued brief states no prior screening.\n\nReuse and corrections: the latest issued smallest-collision state already cites #3559's unequal-length restriction. Local shared summaries (self-match v10, all-zeros v8, collision-padding v8, dated 2026-10-10) predate this source and contain no #3559 reference; they were lookup aids only. Reviews #1270/#1388 narrow 'two words' to minimal support, allow optional differences before Lb, correct zero-based step numbering, and decline all-path exclusion or template feasibility. These limitations govern this screening. Prior source dependencies #3104/#3014/#2619 remain attributed through #3559; they were not newly reviewed or promoted here.\n\nNo scientific process, hash search, benchmark, enumeration or proof rerun was launched: actual new scientific CPU hours 0. Three initial controller read-only GET commands failed with DNS error [Errno 8] inside the sandbox. Identical scoped reads succeeded under network escalation with status 200. No missing-source blocker remains. No public scientific artifacts were created, as this assignment requests a source-only matrix. The controller owns publication and exact transcript/usage accounting. The issued brief reports 122 handle returns awaiting verdicts; no action on that queue is part of this assignment.\n\nSources actually used: /projects/md5/return/3559, including current reviews #1270/#1388 and research_authority; /projects/md5/research-applicability (bounded index); /projects/md5/research-protocol?section=shared-research, Cross-area applicability; issued applicability_check and current smallest-collision state excerpts; cached department protocol evidence/publication/files sections; local shared topic summaries as dated lookup aids. Immutable source artifact locators are /files/83d7562c3a7892a37cea2d59cf08672e890f73372df54754900c71b872b611d4 (producer) and /files/6a4f8a67e6e90432f74aeb53edb90764439fb1a7595340e54d91c20bf775b194 (historical output), cited via the return listing, not newly content-verified.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-18T18:18:19.692Z","repo_url":null,"commit":null,"cites":{"files":["83d7562c3a7892a37cea2d59cf08672e890f73372df54754900c71b872b611d4","6a4f8a67e6e90432f74aeb53edb90764439fb1a7595340e54d91c20bf775b194"],"handles":["pjhudgins"],"returns":[3559],"messages":[]},"tokens":{"log":"summary","input":77314,"models":{"gpt-6.1-sol":7299},"output":7299,"source":"reported","entries":0,"cache_read":758400,"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-18T18:18:25.216Z","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_fdb22372ac10468cef17999a","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 #3559, Claim/Consequences, and accepting reviews #1270/#1388 concern differences between RFC-padded messages of unequal lengths 0 <= La < Lb <= 55. Self-match instead hashes one exactly 32-byte lowercase hexadecimal ASCII string and compares its digest prefix with that same string. Two legal self-match candidates have equal length, so the source's nonzero length-word difference premise is absent. The source supplies neither a fixed-point constraint nor a prefix-probability, throughput or search-cost improvement. No supported bridge to this target is established.","assumptions_md":"Keep the exact ASCII32 domain, standard IV, all 64 MD5 steps per block and RFC padding. This is inapplicability of this unequal-length collision restriction, not a hardness or impossibility claim for self-match. The accepted report has no typed scopes; scope_keys stays empty and no automatic transfer is authorized.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Return #3559 and reviews #1270/#1388 restrict two-message collision differentials using unequal single-padded-block lengths. All-zeros seeks one byte string of length 0..1024 with a zero digest prefix or the full zero digest. Equality between two digests does not fix their common value to zero; the source's padding difference supplies no target-digest condition, preimage construction, rejection gate, throughput result or probability advantage. Overlap with the legal short-message input domain alone does not establish a usable bridge.","assumptions_md":"Arbitrary binary inputs remain legal, including empty and multi-block inputs, with standard IV, full MD5 and exact padding. No extension of the paired length-difference theorem to a zero-preimage method is endorsed. No typed scopes exist, so scope_keys is empty.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Provisional relevance only. Return #3559's accepted restricted theorem, as narrowed by reviews #1270/#1388, applies to the legal subdomain 0 <= La < Lb <= 55: m14=8L, m15=0, and additive delta m14=8(Lb-La) in {8,16,...,440}. Byte Lb is 00 in the shorter padded block and 80 in the longer, forcing a difference in the distinct word m_floor(Lb/4). Minimal copying realizes exactly those two differing words; optional differences may occur elsewhere before Lb. The historical enumeration covers 1540 length pairs and 14 minimal word sets. The inspected Stevens differential changes m8/m13 with equal m14, so it cannot directly describe this unequal-length single-padded-block subdomain. This is a useful compatibility filter for proposed short collision paths. At Lb=55 the forced bit matches delta m13=2^31, and La>=36 permits the m8 bit at byte 35; La=54 gives total 109 bytes and delta m14=8. These are a difference template only, not a demonstrated path or collision. Source report hash: 0d1ca652f201ffc4590c2ffe94f4c5f983d91208c3983f879fdf6713087617ab.","assumptions_md":"Preserve arbitrary binary inputs, distinct messages, standard IV, full 128-bit digest equality, RFC padding, and the restriction that EACH MESSAGE pads to one 64-byte block (length <=55). Stevens' published 64-byte messages are comparison data, not members of this subdomain. Exactly two differing words is minimal support, not a universal support claim; optional differences can occur at all bytes before Lb, with the shorter message's suffix fixed. Reviews correct the m14 schedule to zero-based steps [14,25,35,50], RFC operations [15,26,36,51]. The 109-byte template remains heuristic: fixed suffix bytes, m14/m15 and IV-linked state/path consistency are unresolved. No exclusion of all paths, equal-length or multi-block pairs, no shorter-collision impossibility, global minimum or cost advantage follows. Xie-Feng primary-path inspection is not supplied by this screening. Accepted non-witness typed scopes and endorsements are absent: scope_keys=[]; possible relevance is provisional and validated automatic transfer remains unavailable. A changed domain or new construction needs its own ordinary scientific evidence; this gap does not request a new experiment or review round.","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":7780,"input_sha256":"a48ca192cadaf47411821f0ed21893961ca81de56518a8216b9d1ad6d73ee409","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"0d1ca652f201ffc4590c2ffe94f4c5f983d91208c3983f879fdf6713087617ab","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3559,"material_evidence":{"sha256":"f1e271faa9248a53a8c2d3ceb3a0929750b2c641a3563d0407a1bd562eb0e567","entries":{"return:3559":"81b411043cd31836ab2c800986bb5ad4c4c54e46694d7bba8188ebf3723a7416","artifact:3559:6a4f8a67e6e90432f74aeb53edb90764439fb1a7595340e54d91c20bf775b194":"6a4f8a67e6e90432f74aeb53edb90764439fb1a7595340e54d91c20bf775b194","artifact:3559:83d7562c3a7892a37cea2d59cf08672e890f73372df54754900c71b872b611d4":"83d7562c3a7892a37cea2d59cf08672e890f73372df54754900c71b872b611d4"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3559,"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 #3559: 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\":3559,\"report_sha256\":\"0d1ca652f201ffc4590c2ffe94f4c5f983d91208c3983f879fdf6713087617ab\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3559\":\"81b411043cd31836ab2c800986bb5ad4c4c54e46694d7bba8188ebf3723a7416\",\"artifact:3559:6a4f8a67e6e90432f74aeb53edb90764439fb1a7595340e54d91c20bf775b194\":\"6a4f8a67e6e90432f74aeb53edb90764439fb1a7595340e54d91c20bf775b194\",\"artifact:3559:83d7562c3a7892a37cea2d59cf08672e890f73372df54754900c71b872b611d4\":\"83d7562c3a7892a37cea2d59cf08672e890f73372df54754900c71b872b611d4\"},\"sha256\":\"f1e271faa9248a53a8c2d3ceb3a0929750b2c641a3563d0407a1bd562eb0e567\"},\"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:3559,input_sha256:\"a48ca192cadaf47411821f0ed21893961ca81de56518a8216b9d1ad6d73ee409\",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/4619/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"b75ff31d18e530d9e242cd7498318de9dae3f0bd1f2ce03a06a2a0b2013be812","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}