Paper deep dive
TCA-SIR: Learning Target-Conditioned Abstractions for Scientific Inspiration Retrieval
Yuto Suzuki, Farnoush Banaei-Kashani
Intelligence
Status: succeeded | Model: Gemma-4-26B-A4B | Prompt: intel-v1 | Confidence: 93%
Last extracted: 8/3/2026, 10:18:05 AM
Summary
The paper introduces TCA-SIR, a method for Scientific Inspiration Retrieval (SIR) that reformulates the task as Target-Conditioned Abstraction (TCA). Instead of ranking papers by topical similarity, TCA-SIR generates transferable abstract principles from candidate inspirations conditioned on a target problem. The model, built on Llama-3.1-8B with LoRA, jointly learns to generate Reasoning/Abstraction pairs and predict transferability scores. Evaluated on ResearchBench, TCA-SIR significantly outperforms existing methods like MOOSE-Chem and direct LLM retrieval, improving HitRate@top4% by over 10 percentage points while providing interpretable rationales for inspiration transfer.
Entities (8)
Relation Signals (6)
TCA-SIR â evaluatedon â ResearchBench
confidence 98% · Using the ResearchBench benchmark, we demonstrate that TCA-SIR outperforms the existing SIR solutions...
TCA-SIR â outperforms â MOOSE-Chem
confidence 95% · TCA-SIR outperforms prior SIR methods and direct LLM retrieval, improving HitRate@top4% over MOOSE-Chem by more than 10 percentage points.
TCA-SIR â usesbackbone â Llama-3.1-8B-Instruct
confidence 95% · Following the TCA formulation... with Llama-3.1-8B-Instruct as the sole teacher... TCA-SIR fine-tunes an LLM with LoRA
TCA-SIR â implements â Target-Conditioned Abstraction
confidence 92% · we reformulate SIR as target-conditioned abstraction (TCA)... we present TCA-SIR, a novel TCA-based SIR method
Scientific Inspiration Retrieval â reformulatedas â Target-Conditioned Abstraction
confidence 90% · we reformulate SIR as target-conditioned abstraction (TCA).
TCA-SIR â generates â Reasoning/Abstraction
confidence 88% · TCA-SIR, which jointly learns to generate Reasoning/Abstraction intermediates and to score transferability
Cypher Suggestions (0)
No Cypher suggestions yet.
Abstract
Abstract:Scientific hypothesis generation for AI for Science typically involves Scientific Inspiration Retrieval (SIR) followed by hypothesis composition. Existing SIR methods rank papers by topical similarity and do not explicitly represent how a candidate inspiration transfers to a target problem. This is especially limiting for remote inspirations, whose value often lies in reusable problem-solving principles rather than topical overlap. Motivated by how humans abstract transferable aspects of a source and remap them to a new target, we reformulate SIR as target-conditioned abstraction (TCA). The retrieval object is a transferable abstract principle extracted from a candidate specifically for the target. We present TCA-SIR, which learns to generate target-conditioned abstractions and uses their representations to predict transferability. On ResearchBench, TCA-SIR outperforms prior SIR methods and direct LLM retrieval, improving HitRate@top4% over MOOSE-Chem by more than 10 percentage points. Learned abstractions also recover target-relevant mechanisms more clearly than an untrained TCA prompt, yielding both stronger retrieval and an interpretable rationale for scientific inspiration.
Tags
Links
- Source: https://arxiv.org/abs/2607.28498v1
- Canonical: https://arxiv.org/abs/2607.28498v1
Trouble viewing inline? Open PDF directly â
Full Text
85,615 characters extracted from source content.
Expand or collapse full text
TCA-SIR: Learning Target-Conditioned Abstractions for Scientific Inspiration Retrieval Yuto Suzuki1, Farnoush Banaei-Kashani1 Corresponding author. Abstract Scientific hypothesis generation is a key component of the emerging AI for Science systems. Hypothesis generation is performed in two steps: 1) Scientific Inspiration Retrieval (SIR), to identify the existing inspiring knowledge that can seed a hypothesis to address a target problem, and 2) Hypothesis Composition, to compose the hypothesis for addressing the target problem based on the retrieved inspirations. Existing SIR methods rank papers merely based on topical similarity without explicitly representing how a candidate inspiration is transferable to the target. This approach particularly disregards remote inspirations (i.e., inspirations from knowledge domains other than the target domain), which are known for generation of most creative hypotheses. The relevance of such inspirations depends not on topical similarity but on reusable problem-solving principles they offer. Motivated by how humans transfer ideas by abstracting transferable aspects of source inspirations and remapping them to address a target problem, we reformulate SIR as target-conditioned abstraction (TCA). With this approach, the retrieved object is a transferable abstract principle extracted from a candidate inspiration specifically relevant for addressing the target problem. Accordingly, we present TCA-SIR, a novel TCA-based SIR method that learns to generate target-conditioned abstractions for candidate inspirations and uses their learned representations to predict the transferability of the inspirations to the target. Using the ResearchBench benchmark, we demonstrate that TCA-SIR outperforms the existing SIR solutions as well as direct LLM retrieval, improving HitRate@top4% over the state-of-the-art MOOSE-Chem method by more than 10 percentage points. Comparisons with the same backbone using an untrained TCA prompt further show that learned abstractions more clearly recover target-relevant mechanisms (including chemical levers and performance bottlenecks) rather than topical slogans or superficial facts. By explicitly exposing the reusable principles connecting a candidate inspiration to the target, TCA-SIR not only improves retrieval performance, but also provides an interpretable rationale for scientific inspiration retrieval. 1 Introduction AI for science is advancing rapidly, driven by both scientific opportunity and capability gains in large language models (LLMs). Systems such as the AI Scientist series automate substantial parts of the discovery pipeline and can draft papers with limited human intervention (Lu et al. 2024; Yamada et al. 2025; Lu et al. 2026). AI already contributes at each stage of the scientific discovery process (Wei et al. 2025): (1) observation and hypothesis generation (Si et al. 2025; Romera-Paredes et al. 2024; Yang et al. 2026; Novikov et al. 2025; Liu et al. 2026a; Radensky et al. 2026; Baek et al. 2025), (2) experimental planning and execution (Boiko et al. 2023; Swanson et al. 2024), (3) result analysis (Wang et al. 2025; Ding et al. 2024), and (4) synthesis, validation, and evolution (Ou et al. 2025; Takagi et al. 2023). Among these stages, hypothesis generation is especially consequential: a weak hypothesis wastes downstream experimental and analytical effort, yet robust, scalable hypothesis generation remains an open problem. MOOSE-Chem (Yang et al. 2025) and ResearchBench (Liu et al. 2026b) further decompose hypothesis generation into scientific inspiration retrieval (SIR) and hypothesis composition. SIR asks systems to rank papers that can seed a hypothesis for a target research problem. This step is particularly difficult to implement for LLMs because useful inspirations often come from distant domains and share little topic similarity with the target problem. Such inspirations must be recognized by identifying transferable abstract principles/ideas rather than topical overlap. Prior work attacks this difficulty by enriching embeddings with citation-graph context (Garikaparthi et al. 2025), generating multi-level abstractions to strip domain-specific detail (Gu et al. 2024), or extracting domain-agnostic core problems and matching papers that share them (Kargupta et al. 2026). These approaches help, but they still leave a central ambiguity unresolved: a single inspiration admits many transferable readings along both facet (e.g., a component, an analytical method, or an entire framework) and depth (domain-specific vs. domain-agnostic statements). Source-side abstraction alone is therefore insufficient, and useful retrieval must select the abstraction that connects to the target. Figure 1 contrasts this target-conditioned view with direct paper matching and target-agnostic abstraction. Figure 1: Three formulations of scientific inspiration retrieval. (a) direct matching leaves the transferable principle implicit (Yang et al. 2025); (b) target-agnostic abstraction produces multiple possible cores (Gu et al. 2024; Kargupta et al. 2026); (c) target-conditioned abstraction selects the principle relevant to the target, making retrieval explicit and interpretable. Drawing on how humans apply remote analogies (by abstracting a portable core and remapping it to a new setting), we redefine SIR as target-conditioned abstraction (TCA). With TCA, the retrieval object is not the paper itself, but a transferable principle extracted from the candidate and conditioned on the target. We propose TCA-SIR, which jointly learns to generate Reasoning/Abstraction intermediates and to score transferability, so that the model learns which target-conditioned reading of an inspiration is useful. Using ResearchBench (Liu et al. 2026b) as benchmark, rigorous comparisons against direct LLM retrieval and multiple abstraction-based baselines, together with ablations and qualitative analyses, show that TCA-SIR improves HitRate and ranking metrics while yielding interpretable mechanisms for why an inspiration helps a target, a useful signal for the subsequent composition stage. We summarize our contributions as follows: âą We redefine scientific inspiration retrieval as TCA (target-conditioned abstraction), where the retrieval object is a transferable principle selected for the target rather than the candidate paper itself. âą We propose TCA-SIR, which jointly learns target-conditioned Reasoning/Abstraction generation and transferability scoring for ranking candidate inspirations. âą Through quantitative evaluation, ablations, and qualitative analysis with an established benchmark, we show that learned TCA improves retrieval over strong LLM baselines and provides interpretable explanations of inspirationsâ usefulness. 2 Related Work 2.1 Scientific Inspiration Retrieval Computational approaches to scientific discovery have evolved from analogy mining (Hope et al. 2017) to recent LLM-based scientific discovery systems such as SciMON (Wang et al. 2024) and CHIMERA (Sternlicht and Hope 2026). MOOSE-Chem (Yang et al. 2025) and ResearchBench (Liu et al. 2026b) further decompose hypothesis generation into inspiration retrieval (ranking papers that can seed a hypothesis for a target problem) and hypothesis composition. This decomposition highlights that the quality of the retrieved inspirations strongly influences downstream hypothesis generation: many useful inspirations are not background knowledge for the target domain, yet can still unlock a solution when recombined with what the researcher already knows. That view aligns with classic accounts of creativity as unfamiliar combinations of familiar ideas (Koestler 1964; Boden 2004), and it helps explain why surface lexical overlap and domain-local retrieval often miss the inspirations that matter. Existing retrieval methods address this challenge only partially. MIR (Garikaparthi et al. 2025) proposes related Methodology Inspiration Retrieval, which requires citation contexts and citation-graph signals to enrich embeddings. However, these artifacts are often unavailable or incomplete in many open candidate pools. Combinatorial-creativity approaches (Gu et al. 2024) generate multi-level abstractions (e.g., L1âL4) to enable cross-domain matching, yet the abstraction levels are heuristically defined, and matching often reduces to embedding or LLM similarity that need not reflect problemâsolution transfer. Idea-Catalyst (Kargupta et al. 2026) instead strips domain surface form to recover a domain-agnostic conceptual challenge and then seeks external papers that share that challenge; however, the critical extraction step relies entirely on prompting rather than task-specific learning. Across these lines of work, inspiration retrieval benefits from some form of abstraction or restructuring, but prior methods leave the transferable core underspecified, unconditioned on the target, or dependent on side information that ResearchBench-style SIR settings do not provide. Our work addresses this gap by learning target-conditioned transferable abstractions optimized directly for scientific inspiration retrieval. 2.2 Abstraction Learning A growing recent line of work treats abstraction as part of the LLM reasoning process. Abstraction-of-Thought (Hong et al. 2024) inserts abstract thinking steps so models can reason at a higher level before specializing to a concrete solution. RLAD (Qu et al. 2025) trains models to discover abstractions first and then follow more efficient reasoning paths. AbstRaL (Gao et al. 2025) reinforces abstract thinking with the same goal of improving reasoning performance. These methods primarily learn procedural abstractions, i.e., compressed reasoning schemas that help solve the instance at hand. They are not designed to extract a reusable conceptual core from one problem (or inspiration) so that it can be transferred to a different target. However, this is exactly the form of abstraction needed for scientific inspiration retrieval, and deriving such abstractions is one of the objectives of our work. 3 Problem Definition Scientific Inspiration Retrieval in previous work. Prior work (namely, MOOSE-Chem (Yang et al. 2025) and ResearchBench (Liu et al. 2026b)) defines Scientific Inspiration Retrieval (SIR) as follows. Let b denote the research background (target problem), i an inspiration (e.g., a publication), and I the candidate literature pool. Then SIR is expected to generate the ranking policy Pâ(iâŁb,I)P(i b,I): given a fixed background b, rank candidates in I so that publications useful for composing a hypothesis rise to the top. Limitation. Existing SIR methods implicitly assume that the publication itself is the retrieval object: each iâIiâ I is treated as an atomic document to be matched against b. That assumption does not specify what transferable content should be extracted from i, nor how that content should depend on b. Implementations therefore compare raw publication text to b (or score usefulness only after generation), which conflates topical overlap with transferability. Moreover, it leaves no intermediate that explains why a retrieved publication can be useful in hypothesis generation for the target problem. We instead argue that the retrieval object should be the transferable principle extracted from the publication. Human analogical transfer typically does not jump from a raw source instance to a target either: the source is first abstracted into a portable structural principle, then reinstantiated in the target (Hope et al. 2017; Boden 2004). A classic illustration is biomimetic bridge design inspired by bone: a bone resists fracture while remaining light because a hard outer shell surrounds an internal web-like (trabecular) structure. What transfers is not bone tissue or its exact morphology, but the abstract principle (a stiff envelope plus a sparse load-bearing lattice), which can be remapped onto materials and geometry suited to bridge construction. Conditioning on the target matters: the same source (bone) admits many readings, and only the one needed for bridges is selected and remapped. This is why we introduce target-conditioned abstraction as an intermediate before ranking inspirations for SIR. Multi-facet, multi-depth inspiration. A single scientific publication often contains multiple transferable ideas operating at different levels of abstraction. Along the facet axis, one may transfer a concrete component, an analysis method, an algorithm, or an entire problem-solving framework. Along the depth axis, the same idea can be stated in domain-specific terms or lifted toward a more domain-agnostic structural principle. Different targets may need different facetâdepth pairs from the same i. Source-only abstraction therefore yields a set of candidate cores a(1),a(2),âŠ,a(m)=Absâ(i),\a^(1),a^(2),âŠ,a^(m)\=Abs(i), (1) but only one of them may be the reading that connects to b. Useful SIR therefore requires selecting the right abstraction for the target, not merely summarizing i. Target-conditioned abstraction (TCA). To address the limitations of the previous formalization of the problem, we redefine SIR by introducing an explicit intermediate representation: a ReasoningâAbstraction (R/A) pair conditioned on both the candidate and the target, Ίâ(i,b)=(ri,ai), (i,b)=(r_i,a_i), (2) where rir_i is a reasoning trace that maps evidence in i to b, and aia_i is the resulting transferable core (mechanism, hypothesis schema, bottleneck principle, etc.). Transferability is scored from the conditioned R/A representation: si=Ïâ(Ίâ(i,b),b)â[0,1].s_i=Ï( (i,b),b)â[0,1]. (3) Ranking candidates by sis_i yields the retrieval policy Pâ(iâŁb,I)âexpâĄ(Ïâ(Ίâ(i,b),b)),P(i b,I)\; \; \! (Ï( (i,b),b) ), (4) over target-conditioned R/A pairs Ίâ(i,b):iâI\ (i,b):iâ I\. Why this formalization is more useful. Compared with atomic publication ranking, TCA changes the object of retrieval from âwhich publication is related to b?â to âwhich transferable core, when conditioned on b, best supports composing a hypothesis?â This shift is valuable for three reasons. First, it makes multi-facet / multi-depth ambiguity an explicit modeling target: Ίâ(â ,b) (·,b) must choose the facet that the target needs. Second, (ri,ai)(r_i,a_i) are inspectable intermediates that explain why an inspiration is useful, which is critical for trusted use and for the downstream composition step Pâ(hâŁb,i)P(h b,i). Third, it yields a trainable objective for SIR itself: learn Ί and Ï jointly so that the highly scored candidates are those whose conditioned abstraction is actually transferable, rather than those that merely share vocabulary with b. Next we present our proposed method to address TCA, dubbed TCA-SIR. TCA-SIR learns target-conditioned R/A generation together with a transfer score for ResearchBench-style retrieval. 4 Method Figure 2: Overview of TCA-SIR. Given a target problem and an inspiration candidate, an LLM fine-tuned with LoRA generates a Reasoning / target-conditioned abstraction and predicts a transferability score from the last-layer hidden state at a controller-inserted Transfer score: token via a linear score head. The figure shows two independent forward passes on the same target with two different inspirations as examples, yielding distinct abstractions and scores. 4.1 Overview TCA-SIR has two stages. First, we build supervision for Ί and Ï: (i) a label-aware R/A teacher that writes target-conditioned Reasoning/Abstraction text for each (b,i)(b,i); (i) a generative judge that filters those generations so only examples whose judged polarity matches the gold pair label are kept, as training-data quality control; and (i) a transferability grader that assigns a 5-level score that supervises continuous transfer strength. Second, a LoRA student jointly learns to emit R/A (Ί ) and to predict that graded score from a readout-token hidden state (Ï), then ranks candidates by the predicted sis_i. 4.2 Training Data Construction Following the TCA formulation in the previous section, TCA-SIR jointly learns the abstraction function Ί and the transfer scoring function Ï. Concretely, it maps a target problem b and a candidate inspiration i to a ReasoningâAbstraction (R/A) pair (ri,ai)=Ίâ(i,b)(r_i,a_i)= (i,b) and a graded transfer score si=Ïâ(ri,ai,b)â[0,1]s_i=Ï(r_i,a_i,b)â[0,1]. Supervision for Ί and Ï is built from ResearchBench (Liu et al. 2026b) training pairs with Llama-3.1-8B-Instruct as the sole teacher; therefore, label generation and later fine-tuning share one open checkpoint and avoid proprietary-model contamination. Pair construction. We extract balanced positive/negative pairs from the ResearchBench train split: ground-truth inspirations are positives, and negatives preferentially use ResearchBench hard-tier candidates when available in the original dataset. Label-aware R/A teacher. For each pair we generate target-conditioned reasoning and abstraction with separate positive and negative teacher prompts that are conditioned on the gold label (transferable vs. scope-limited; Appendix E). A frozen generative judge then assigns a continuous usefulness score to each generated abstraction and thresholds it into a binary decision (keep as positive if above the threshold, negative if below). We retain a training example (b,i,ri,ai)(b,i,r_i,a_i) only when that decision agrees with the pairâs gold label, and mismatched examples are discarded. Graded transferability labels. Because binary positive/negative labels are coarse (even ground-truth inspirations vary in how strongly they help a target), a second LLM call assigns a 5-level mechanism-based transferability score 0.1,0.3,0.5,0.7,0.9\0.1,0.3,0.5,0.7,0.9\ under a fixed rubric that emphasizes adaptable mechanisms over topical overlap. We use five evenly spaced grades rather than a binary label so the teacher can express intermediate transfer strength without requiring a fully continuous score that is hard to assign consistently, yielding nuanced supervision for the score head. We score the targetâcandidate pair without showing the teacher R/A to the grader, so the grade reflects an independent transferability judgment rather than phrasing patterns of the abstractions that the score head could later recover as surface cues. The grader does receive the gold binary label and tier as reference metadata (with an instruction not to copy them), which helps the LLM predict the scores with context of connections. When the score distribution is unbalanced, an LLM rechecks adjacent scores (e.g., 0.70.7 vs. 0.90.9) and adjusts the scores. Label-aware teacher prompts improve R/A supervision, but risk polarity-correlated phrasing that a score head could exploit as a shortcut. However, manual inspection found no fixed phrase-to-score templates across grades (Appendix F). The grader prompt appears with the teacher templates in Appendix E; graded-score distributions appear in Appendix D; we inspected samples and found Llama-generated R/A adequate for this supervision setting. We intentionally use the same open-source LLM for teacher generation, judging, grading, and student initialization to avoid introducing external knowledge through a stronger or proprietary teacher. This design isolates the effect of the proposed target-conditioned abstraction representation rather than improvements arising from teacher distillation. 4.3 Model Architecture Figure 2 depicts the proposed model architecture. The architecture has two modules: a LoRA-tuned generator that realizes Ί by emitting target-conditioned Reasoning/Abstraction text, and a linear score head that realizes Ï by reading the hidden state after generation to predict transferability. TCA-SIR fine-tunes an LLM with LoRA (Hu et al. 2022) on attention projections. Given (b,i)(b,i), the model generates a text-anchored Reasoning and Abstraction sequence (headings Reasoning: / Abstraction:). A lightweight linear score head then maps the last-layer hidden state at a controller-inserted Transfer score: readout token to a scalar transfer logit; at inference we apply a sigmoid to obtain si=Ïâ(ri,ai,b)â[0,1]s_i=Ï(r_i,a_i,b)â[0,1]. Thus scoring is not a separate decoder over R/A surface text: it reads the contextualized representation after the model has produced the full target-conditioned R/A sequence. 4.4 Training Objective We jointly minimize a generation language-modeling loss on the R/A tokens and a mean-squared-error (MSE) loss between the predicted score and the graded transferability label: â=λLMââLM+λsââMSE.L= _LM\,L_LM+ _s\,L_MSE. (5) The LM term trains Ί to emit useful, target-conditioned R/A; the MSE term trains Ï to recover continuous transfer strength rather than a binary decision. With λLM=λs=1 _LM= _s=1 on the reported checkpoint, joint optimization encourages the model to generate target-conditioned abstractions whose hidden representations are predictive of transferability. 5 Experiments Method HitRate@top4% HitRate@top20% MRR NDCG@3 SourceAbs 0.189±0.0350.189± 0.035 0.558±0.0430.558± 0.043 0.245±0.0470.245± 0.047 0.173±0.0330.173± 0.033 Prompt-TCA 0.219±0.0340.219± 0.034 0.708±0.0410.708± 0.041 0.290±0.0480.290± 0.048 0.203±0.0330.203± 0.033 Gen-level (aligned) 0.263±0.0390.263± 0.039 0.694±0.0410.694± 0.041 0.361±0.0530.361± 0.053 0.258±0.0400.258± 0.040 Gen-level (max) 0.289±0.0420.289± 0.042 0.690±0.0410.690± 0.041 0.376±0.0540.376± 0.054 0.279±0.0410.279± 0.041 Idea-Catalyst 0.299±0.0410.299± 0.041 0.655±0.0440.655± 0.044 0.414±0.0550.414± 0.055 0.296±0.0420.296± 0.042 Direct LLM 0.371±0.0420.371± 0.042 0.750±0.0370.750± 0.037 0.511±0.0550.511± 0.055 0.371±0.0420.371± 0.042 Direct LLM pair score 0.379±0.0440.379± 0.044 0.808±0.0360.808± 0.036 0.483±0.0550.483± 0.055 0.371±0.0440.371± 0.044 TCA-SIR 0.481±0.0450.481± 0.045 0.850±0.0310.850± 0.031 0.601±0.0540.601± 0.054 0.472±0.0450.472± 0.045 Table 1: Test240 scientific inspiration retrieval. Cells report mean ± half-width of a bootstrap 95% CI over targets. Rows are ordered from simpler baselines to our final model (TCA-SIR, lr 1Ă10â51Ă10^-5). Best value in each column is bold. 5.1 Dataset We evaluate on the Inspiration Retrieval task from ResearchBench (Liu et al. 2026b). ResearchBench covers 12 scientific domains and is built from papers published in 2024 onward to reduce overlap with LLM pretraining corpora. For each target, the input is a research question and a background survey. The system must rank a fixed pool of 75 candidate papers, each represented by title and abstract only. Every pool contains 2â3 gold inspirations that contributed to the original paperâs hypothesis, together with hard negatives sampled at multiple topical distances from the target. The ranking goal is to recover those gold inspirations within the pool. We construct domain-balanced holdouts with an equal number of targets per domain: test240 uses 20 targets/domain (headline results), and val120 uses 10 targets/domain. Training uses all remaining complete-pool targets after the test and validation holdouts (domain-balanced remainder; not a fixed per-domain train quota). Sensitivity sweeps use pilot12 (one target per domain from val120) to avoid test leakage. Train, validation, and test target sets are enforced to be disjoint in the split pipeline, and pre-training contamination checks verify that training pairs never include held-out evaluation targets. 5.2 Evaluation metrics Following ResearchBench (Liu et al. 2026b), we report HitRate@top4% and HitRate@top20% as the fraction of gold inspirations recovered in the top 3/753/75 or 15/7515/75 of each pool, averaged over targets. We also report MRR (reciprocal rank of the first gold inspiration) and NDCG@3 over the top three positions (mean ± bootstrap 95% CI half-width); the NDCG discount formula appears in Appendix C. 5.3 Baselines All methods use Llama-3.1-8B-Instruct at temperature 0 under the same two-round retrieval protocol (75 candidates â 5 groups of 15 â shortlist â top 3). We evaluate on a single open backbone so that gains can be attributed to the retrieval formulation rather than to differences in underlying LLM capacity. We choose Llama-3.1-8B-Instruct because its pretraining cutoff (December 2023) precedes ResearchBenchâs source papers (2024 onward), reducing the risk of pretraining contamination. We organize baselines into three groups: direct retrieval methods that rank papers without an explicit abstraction intermediate (strong untrained references); prior abstraction methods adapted from related SIR work; and untrained TCA controls that share our Reasoning/Abstraction interface but without learning. Direct retrieval. Direct LLM (MOOSE-Chem) applies the original MOOSE-Chem prompt (Yang et al. 2025) to select the most useful inspirations from each candidate group. Direct LLM pair score scores each targetâcandidate pair with the same five-level transferability rubric used for TCA-SIR supervision, without generating an abstraction. Prior abstraction methods. Idea-Catalyst-style extracts domain-agnostic core problems for the target and candidates (Kargupta et al. 2026), then applies listwise selection over those representations. Gen-level retrieval generates four abstraction levels for the target and candidate (Gu et al. 2024) and ranks candidates using cosine similarity between Llama hidden-state embeddings. The aligned variant compares corresponding levels, whereas the max variant uses the highest cross-level similarity. Untrained TCA controls. SourceAbs generates a target-agnostic abstraction of each candidate and then scores its usefulness for the target. Prompt-TCA uses the same target-conditioned Reasoning/Abstraction interface as TCA-SIR, but without fine-tuning or a learned score head. 5.4 Implementation details TCA-SIR fine-tunes with LoRA (Hu et al. 2022) (r=8r=8, α=16α=16 on q_proj/v_proj) for 3 epochs at learning rate 1Ă10â51Ă10^-5 with score-loss weight 1.01.0; sensitivity on pilot12 is in Appendix B.1. Hardware and full run configs appear in Appendix C. 6 Results 6.1 Main comparison Table 1 summarizes HitRate at top-4% / top-20%, MRR, and NDCG@3 on test240. TCA-SIR is best on all four metrics. Among untrained methods, the Direct LLM baselines are strongest: MOOSE-Chem listwise screening and Direct LLM pair score both outperform every prompt-based abstraction method. Notably, all untrained abstraction methods underperform Direct LLM, whereas trained TCA-SIR substantially exceeds it, indicating that abstraction becomes effective only when learned for the retrieval objective. Idea-Catalyst is the best untrained abstraction baseline, but still trails Direct LLM. It reuses the MOOSE-Chem listwise harness after replacing each publication with a one-sentence, domain-agnostic core problem; those cores often wash out mechanism detail (Appendix B); therefore, listwise selection loses surface evidence that Direct LLM still uses. Gen-level ranks next: an L1âL4 ladder retains more structure than a single abstraction, but high levels collapse into vague language and mismatched level pairs can bury the true inspiration (Appendix B, Cases GâI). Prompt-TCA outperforms SourceAbs because its abstraction is target-conditioned, but zero-shot R/A often hedges and underranks true inspirations (e.g., ranks 7â10 on Cases GâI). SourceAbs is the weakest: target-agnostic paraphrase collapses one inspirationâs many facets into a single aspect that need not align with the target. Taken together, inspiration abstraction is multi-faceted and multi-depth: choosing the wrong facet or depth loses the SIR signal, and untrained prompting alone does not reliably select it. 6.2 Qualitative target-conditioned abstraction Target / inspiration TCA-SIR Prompt-TCA A ranks 1 / 3 How can we design a high-performance lithium-sulfur battery electrode material that simultaneously addresses the problems of low sulfur loading, polysulfide shuttle effect, and sluggish polysulfide redox kinetics, leading to improved capacity, cycling stability, and rate capability? Inspiration: Strong adsorption of lithium polysulfides on ethylenediamine-functionalized carbon fiber paper interlayer providing excellent capacity retention of lithium-sulfur batteries A high-performance lithium-sulfur battery electrode material can be designed by incorporating a functionalized interlayer with amide groups that strongly adsorb lithium polysulfides, thereby reducing the polysulfide shuttle effect and improving capacity retention, cycling stability, and rate capability. This approach can be achieved by modifying the surface of the electrode material with amide-containing functional groups, which can effectively trap high-order polysulfides and facilitate their conversion to solid lithium sulfides, thereby addressing the challenges of low sulfur loading, polysulfide shuttle effect, and sluggish polysulfide redox kinetics. A key principle that can be abstracted from the inspiration paper is the use of functionalized carbon materials to enhance the adsorption of lithium polysulfides. This principle can be applied to the target problem by designing high-performance lithium-sulfur battery electrode materials that incorporate functional groups capable of strong interactions with lithium polysulfides. By leveraging this principle, researchers can develop materials that effectively mitigate the polysulfide shuttle effect and improve the overall performance of lithium-sulfur batteries. B ranks 1 / 1 How can the design and performance of a helium Dewar be improved for the Resolve instrument onboard the XRISM satellite to meet the stringent cooling requirements for an X-ray microcalorimeter array, ensuring a thermal interface below 1.5 K and a helium lifetime of over 3 years in orbit? Inspiration: Flight model performance test results of a helium dewar for the soft Xâray spectrometer onboard ASTRO-H A key principle for improving the design and performance of the helium Dewar for the Resolve instrument is to incorporate innovative design improvements and rigorous testing to meet the stringent cooling requirements, such as reducing the heat load to the helium tank and minimizing heat transfer through multiple stages of insulation and cooling, thereby ensuring a thermal interface below 1.5 K and a helium lifetime of over 3 years in orbit. A transferable mechanism principle from the inspiration is the incorporation of a hybrid cooling system that includes both liquid helium and mechanical coolers, which can be adapted to the target problem to minimize heat transfer and maximize efficiency. This principle can be applied to the design of the helium Dewar for the Resolve instrument, potentially leading to improved thermal performance and a longer helium lifetime. Table 2: Model-generated abstractions for Examples AâB (ranks: TCA-SIR / Prompt-TCA). Beyond ranking metrics, we inspect whether TCA-SIR extracts a target-relevant mechanism rather than topical similarity. Table 2 compares TCA-SIR and Prompt-TCA on two cases chosen so the two methods abstract the inspiration differently (ranks: TCA-SIR / Prompt-TCA). âą Example A (battery materials). TCA-SIR recovers the inspirationâs specific chemical lever (amide / ethylenediamine groups that bind unwanted intermediates) and retargets it into electrode design; Prompt-TCA collapses to a near-template claim (âuse functionalized carbonâ) that any related paper could have produced (ranks 1 / 3). âą Example B (space instrumentation). TCA-SIR selects the inspirationâs performance bottleneck (reduce heat leak so cryogen lasts long enough) rather than restating system inventory; Prompt-TCA mainly lists a co-present hardware fact (hybrid coolers) without committing to that bottleneck-solving principle (both rank 1). Example C (hypothesis-schema / environmental economics) appears in Appendix B.2. Overall, TCA-SIR recovers target-relevant portable cores, whereas Prompt-TCA often produces generic or secondary observations. 6.3 Ablation Study Method HitRate@top4% MRR SourceAbs 0.189±0.0350.189± 0.035 0.245±0.0470.245± 0.047 Prompt-TCA 0.219±0.0340.219± 0.034 0.290±0.0480.290± 0.048 TCA-SIR (binary BCE) 0.417±0.0420.417± 0.042 0.545±0.0540.545± 0.054 TCA-SIR (score-only) 0.443±0.0480.443± 0.048 0.535±0.0560.535± 0.056 TCA-SIR (no reasoning) 0.446±0.0470.446± 0.047 0.544±0.0560.544± 0.056 TCA-SIR 0.481±0.0450.481± 0.045 0.601±0.0540.601± 0.054 Table 3: Ablation ladder from source-only prompting to full TCA-SIR (lr 1Ă10â51Ă10^-5) on test240 (mean ± bootstrap 95% CI half-width). Best value in each column is bold. Table 3 isolates the stack from source-only prompting to full TCA-SIR. Target conditioning helps modestly (Prompt-TCA >> SourceAbs), but the gain is small: without training, prompting for âan abstractionâ often misses the facet the target needs (Table 2; SourceAbs in Appendix B.2). The decisive jump is supervised learning. TCA-SIR (binary BCE) keeps R/A generation and the score head, but trains the head with binary BCE instead of graded scores. TCA-SIR (score-only) disables R/A generation (λLM=0 _LM=0) and trains only the graded score head. TCA-SIR (no reasoning) generates Abstraction and a graded score but drops Reasoning. Replacing Prompt-TCA with binary BCE nearly doubles HitRate@top4%, so most of the gain comes from learning rather than the TCA prompt alone. Graded scores then beat binary labels, indicating that continuous transfer strength is a better training target than a coarse positive/negative split, since not all ground-truth inspirations are equally useful. Score-only stays close to full TCA-SIR, but the drop shows that generating abstractions also helps ranking, not only interpretability. Omitting Reasoning still hurts, suggesting the trace is part of applying an abstraction to a new target. Across this ladder, trained TCA-SIR variants exceed Direct LLM while every untrained abstraction method falls below it (Table 1). Prompt-only intermediates are an inductive bias that needs learning signal; full TCA-SIR recovers the portable core illustrated qualitatively above. 7 Conclusions and Future Work Scientific inspiration retrieval (SIR) is a bottleneck for LLM-based hypothesis generation. Useful inspirations are often topically remote, yet carry a transferable principle for the target. Drawing on how humans abstract and reinstantiate remote analogies, we redefined SIR as TCA (Target-Conditioned Abstraction), where the retrieval object is a transferable principle extracted from a candidate and conditioned on the target rather than the publication as an atomic document. We proposed TCA-SIR, which jointly learns target-conditioned abstractions and a transferability score for ranking candidates. On ResearchBench, TCA-SIR improves HitRate and ranking metrics over direct LLM prompting and abstraction-based baselines, and qualitative analysis shows that learned abstractions recover target-relevant mechanisms rather than generic topical similarities. A practical limitation is computational cost. Because each abstraction is target-conditioned, TCA-SIR must generate an R/A intermediate for every target-candidate pair rather than a single source-side summary, making large pools expensive at inference. Future work will explore more efficient ways to scale this approach. Use of AI Tools Generative AI tools were used to assist with language editing, code development and debugging, and figure generation and refinement. The authors reviewed and verified all AI-assisted outputs and take full responsibility for the manuscript and its supporting materials. References J. Baek, S. K. Jauhar, S. Cucerzan, and S. J. Hwang (2025) ResearchAgent: iterative research idea generation over scientific literature with large language models. In Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers), p. 6709â6738. Cited by: §1. M. A. Boden (2004) The creative mind: myths and mechanisms. Routledge. Cited by: §2.1, §3. D. A. Boiko, R. MacKnight, B. Kline, and G. Gomes (2023) Autonomous chemical research with large language models. Nature 624 (7992), p. 570â578. Cited by: §1. N. Ding, S. Qu, L. Xie, Y. Li, Z. Liu, K. Zhang, Y. Xiong, Y. Zuo, Z. Chen, E. Hua, et al. (2024) Automating exploratory proteomics research via language models. arXiv preprint arXiv:2411.03743. Cited by: §1. S. Gao, A. Bosselut, S. Bengio, and E. Abbe (2025) AbstRaL: augmenting LLMsâ reasoning by reinforcing abstract thinking. arXiv preprint arXiv:2506.07751. Cited by: §2.2. A. Garikaparthi, M. Patwardhan, A. S. Kanade, A. Hassan, L. Vig, and A. Cohan (2025) MIR: methodology inspiration retrieval for scientific research problems. In Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), p. 28614â28659. Cited by: §1, §2.1. T. Gu, J. Wang, Z. Zhang, and H. Li (2024) LLMs can realize combinatorial creativity: generating creative ideas via LLMs for scientific research. arXiv preprint arXiv:2412.14141. Cited by: Figure 1, §1, §2.1, §5.3. R. Hong, H. Zhang, X. Pan, D. Yu, and C. Zhang (2024) Abstraction-of-thought makes language models better reasoners. In Findings of the Association for Computational Linguistics: EMNLP 2024, p. 1993â2027. Cited by: §2.2. T. Hope, J. Chan, A. Kittur, and D. Shahaf (2017) Accelerating innovation through analogy mining. In Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, p. 235â243. Cited by: §2.1, §3. E. J. Hu, Y. Shen, P. Wallis, Z. Allen-Zhu, Y. Li, S. Wang, L. Wang, and W. Chen (2022) LoRA: low-rank adaptation of large language models. ICLR. Cited by: §4.3, §5.4. P. Kargupta, S. Mehri, D. Hakkani-Tur, and J. Han (2026) Sparking scientific creativity via LLM-driven interdisciplinary inspiration. arXiv preprint arXiv:2603.12226. Cited by: Figure 1, §1, §2.1, §5.3. A. Koestler (1964) The act of creation. Hutchinson, London. Cited by: §2.1. F. Liu, X. Zeng, and H. Liu (2026a) Towards multimodal data-driven scientific discovery powered by LLM agents. In The Fourteenth International Conference on Learning Representations, Cited by: §1. Y. Liu, Z. Yang, T. Xie, J. Ni, B. Gao, Y. Li, S. Tang, W. Ouyang, E. Cambria, and D. Zhou (2026b) ResearchBench: benchmarking LLMs in scientific discovery via inspiration-based task decomposition. In Findings of the Association for Computational Linguistics: ACL 2026, p. 13187â13207. Cited by: §C.1, §1, §1, §2.1, §3, §4.2, §5.1, §5.2. C. Lu, C. Lu, R. T. Lange, J. Foerster, J. Clune, and D. Ha (2024) The AI scientist: towards fully automated open-ended scientific discovery. arXiv preprint arXiv:2408.06292. Cited by: §1. C. Lu, C. Lu, R. T. Lange, Y. Yamada, S. Hu, J. Foerster, D. Ha, and J. Clune (2026) Towards end-to-end automation of AI research. Nature 651 (8107), p. 914â919. Cited by: §1. A. Novikov, N. VĆ©, M. Eisenberger, E. Dupont, P. Huang, A. Z. Wagner, S. Shirobokov, B. Kozlovskii, F. J. R. Ruiz, A. Mehrabian, et al. (2025) AlphaEvolve: a coding agent for scientific and algorithmic discovery. arXiv preprint arXiv:2506.13131. Cited by: §1. J. Ou, W. G. Walden, K. Sanders, Z. Jiang, K. Sun, J. Cheng, W. Jurayj, M. Wanner, S. Liang, C. Morgan, et al. (2025) CLAIMCHECK: how grounded are LLM critiques of scientific papers?. Published online March 27. Cited by: §1. Y. Qu, A. Singh, Y. Lee, A. Setlur, R. Salakhutdinov, C. Finn, and A. Kumar (2025) RLAD: training LLMs to discover abstractions for solving reasoning problems. arXiv preprint arXiv:2510.02263. Cited by: §2.2. M. Radensky, S. Shahid, R. Fok, P. Siangliulue, T. Hope, and D. S. Weld (2026) Scideator: human-LLM compound system for scientific ideation through facet recombination and novelty evaluation. In Proceedings of the ACM Conference on AI and Agentic Systems, p. 348â374. Cited by: §1. B. Romera-Paredes, M. Barekatain, A. Novikov, M. Balog, M. P. Kumar, E. Dupont, F. J. R. Ruiz, J. S. Ellenberg, P. Wang, O. Fawzi, et al. (2024) Mathematical discoveries from program search with large language models. Nature 625 (7995), p. 468â475. Cited by: §1. C. Si, D. Yang, and T. Hashimoto (2025) Can LLMs generate novel research ideas? a large-scale human study with 100+ NLP researchers. In International Conference on Learning Representations, Vol. 2025, p. 94003â94092. Cited by: §1. N. Sternlicht and T. Hope (2026) CHIMERA: a knowledge base of scientific idea recombinations for research analysis and ideation. In Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), p. 1871â1905. Cited by: §2.1. K. Swanson, W. Wu, N. L. Bulaong, J. E. Pak, and J. Zou (2024) The virtual lab: AI agents design new SARS-CoV-2 nanobodies with experimental validation. bioRxiv. Note: doi:10.1101/2024.11.11.623004 Cited by: §1. S. Takagi, R. Yamauchi, and W. Kumagai (2023) Towards autonomous hypothesis verification via language models with minimal guidance. arXiv preprint arXiv:2311.09706. Cited by: §1. H. Wang, Y. He, P. P. Coelho, M. Bucci, A. Nazir, B. Chen, L. Trinh, S. Zhang, K. Huang, V. Chandrasekar, et al. (2025) SpatialAgent: an autonomous AI agent for spatial biology. bioRxiv, p. 2025â04. Cited by: §1. Q. Wang, D. Downey, H. Ji, and T. Hope (2024) SciMON: scientific inspiration machines optimized for novelty. In Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), p. 279â299. Cited by: §2.1. J. Wei, Y. Yang, X. Zhang, Y. Chen, X. Zhuang, Z. Gao, D. Zhou, G. Wang, Z. Gao, J. Cao, et al. (2025) From AI for science to agentic science: a survey on autonomous scientific discovery. arXiv preprint arXiv:2508.14111. Cited by: §1. Y. Yamada, R. T. Lange, C. Lu, S. Hu, C. Lu, J. Foerster, J. Clune, and D. Ha (2025) The AI scientist-v2: workshop-level automated scientific discovery via agentic tree search. arXiv preprint arXiv:2504.08066. Cited by: §1. Z. Yang, W. Liu, B. Gao, Y. Liu, W. Li, T. Xie, L. Bing, W. Ouyang, E. Cambria, and D. Zhou (2026) MOOSE-Chem2: exploring LLM limits in fine-grained scientific hypothesis discovery via hierarchical search. Advances in Neural Information Processing Systems 38, p. 89045â89076. Cited by: §1. Z. Yang, W. Liu, B. Gao, T. Xie, Y. Li, W. Ouyang, S. Poria, E. Cambria, and D. Zhou (2025) MOOSE-Chem: large language models for rediscovering unseen chemistry scientific hypotheses. In International Conference on Learning Representations, Vol. 2025, p. 33251â33277. Cited by: Figure 1, §1, §2.1, §3, §5.3. Appendix A Overview This appendix provides extended experimental results for the main text. Naming follows the main text: TCA-SIR (trained target-conditioned abstraction), Prompt-TCA (prompted target-conditioned abstraction), and SourceAbs (source-only abstraction). Qualitative tables reprint full generations for main-text Examples AâB, present Example C (hypothesis-schema case) here, and add same-inspiration / cross-task cases, plus Gen-level L1âL4 and Idea-Catalyst core-problem intermediates that help explain those baselinesâ weaker retrieval. We also include teacher-supervision quality checks, the teacher and grader prompts used to construct TCA-SIR training supervision, and representative positive/negative training R/A examples. Appendix B Additional Results B.1 Sensitivity (pilot12) Table 4 and Figures 3â5 summarize learning-rate, score-loss weight, and instruction-detail sweeps on pilot12. Within the explored ranges, learning rate 1Ă10â51Ă10^-5 and score-loss weight 1.01.0 (our reference setting) perform best; verbose instructions underperform the standard/minimal prompts. Axis Setting HitRate@top4% Learning rate 5Ă10â65Ă10^-6 0.319 Learning rate 1Ă10â51Ă10^-5 0.458 Learning rate 2Ă10â52Ă10^-5 0.403 Score-loss weight 0.5 0.347 Score-loss weight 1.0 0.458 Score-loss weight 2.0 0.444 Instruction detail minimal 0.431 Instruction detail standard (ref.) 0.458 Instruction detail verbose 0.347 Table 4: Sensitivity on pilot12 (12-target subset of val120). HitRate@top4% for learning rate, score-loss weight, and instruction-detail sweeps. Best value within each axis is bold. Figure 3: Learning-rate sensitivity on pilot12 (HitRate@top4%). Figure 4: Score-loss weight sensitivity on pilot12 (HitRate@top4%). Figure 5: Instruction-detail sensitivity on pilot12 (HitRate@top4%). B.2 Qualitative examples (extended) Table 5 presents Example C, an environmental-economics case moved out of the main text. TCA-SIR recovers a structured hypothesis from the inspiration (fiscal policy shapes an Environmental Kuznets Curve) and remaps it to a new outcome variable (load capacity factor) and setting (BRICS). Prompt-TCA only offers a soft advice slogan (âconsider fiscal policy / greener energyâ) without that reusable model (ranks 2 / 5). This case illustrates recovery of a transferable hypothesis schema rather than a concrete chemical lever or performance bottleneck. Table 6 reports SourceAbs generations for main-text Examples AâB and Appendix Example C. Table 7 reprints earlier qualitative cases (Examples GâI: queuing/edge offloading, pericyte atlas, PINN shocks), where TCA-SIR and Prompt-TCA often share a mechanism family and Prompt-TCA mainly under-ranks. Table 8 adds Examples DâF (space robotics, disulfide/disulfidptosis, MXene/SiRF). Table 9 holds the inspiration fixed (anionic polyacrylamide adsorption study) and varies the target: TCA-SIR emphasizes experimentalâcomputational characterization for a specific PAA@TiO2 nanocomposite target, but polymerânanoparticle integration for a generic cost-efficient adsorbent target. This is preliminary evidence of target-sensitive facet selection; the two targets remain closely related, so we do not treat them as a conclusive cross-goal counterfactual. Target / inspiration TCA-SIR Prompt-TCA C ranks 2 / 5 How does fiscal policy (specifically, government expenditure and taxation revenue), along with renewable and non-renewable energy consumption and economic growth, impact the load capacity factor (LCF), a comprehensive measure of environmental quality, in BRICS nations (Brazil, Russia, India, China, and South Africa), considering potential asymmetric effects? Inspiration: Testing the role of fiscal policy in the environmental degradation: The case of Turkey A fiscal policy-induced Environmental Kuznets Curve (EKC) hypothesis can be applied to BRICS nations, where government expenditure and taxation revenue influence the load capacity factor (LCF), a comprehensive measure of environmental quality, by reducing carbon emissions and promoting sustainable economic growth, particularly when fiscal policies support energy efficiency and alternative energy systems. A transferable mechanism principle from the inspiration paper is the importance of integrating fiscal policy analysis into environmental studies, particularly in the context of emerging economies. This principle can be adapted to the target problem by emphasizing the need for policymakers in BRICS nations to consider the environmental implications of their fiscal decisions when designing policies to promote economic growth and reduce environmental degradation. Specifically, the inspiration paperâs findings suggest that policymakers should focus on enhancing fiscal policies that support energy efficiency and promote alternative energy systems, which can be applied to the target problem by highlighting the need for BRICS nations to transition towards greener energy practices and reduce their reliance on non-renewable energy sources. Table 5: Environmental-economics case (Example C). Model-generated abstractions (ranks: TCA-SIR / Prompt-TCA). SourceAbs for this case is in Table 6. Target / inspiration SourceAbs A rank 1 How can we design a high-performance lithium-sulfur battery electrode material that simultaneously addresses the problems of low sulfur loading, polysulfide shuttle effect, and sluggish polysulfide redox kinetics, leading to improved capacity, cycling stability, and rate capability? Inspiration: Strong adsorption of lithium polysulfides on ethylenediamine-functionalized carbon fiber paper interlayer providing excellent capacity retention of lithium-sulfur batteries Designing and implementing tailored materials with specific functional groups to enhance chemical interactions with target species can significantly improve the performance of energy storage systems by mitigating key challenges such as capacity degradation and shuttle effects. B rank 3 How can the design and performance of a helium Dewar be improved for the Resolve instrument onboard the XRISM satellite to meet the stringent cooling requirements for an X-ray microcalorimeter array, ensuring a thermal interface below 1.5 K and a helium lifetime of over 3 years in orbit? Inspiration: Flight model performance test results of a helium dewar for the soft Xâray spectrometer onboard ASTRO-H Design and testing of complex systems under stringent requirements can be achieved through a combination of rigorous engineering, innovative design improvements, and comprehensive testing. This approach enables the identification and mitigation of potential failure modes, ultimately leading to the development of reliable and efficient systems that meet or exceed performance expectations. C rank 2 How does fiscal policy (specifically, government expenditure and taxation revenue), along with renewable and non-renewable energy consumption and economic growth, impact the load capacity factor (LCF), a comprehensive measure of environmental quality, in BRICS nations (Brazil, Russia, India, China, and South Africa), considering potential asymmetric effects? Inspiration: Testing the role of fiscal policy in the environmental degradation: The case of Turkey Integrate policy analysis into studies of complex systems to uncover the interplay between policy variables and system outcomes, and to identify potential policy levers that can be manipulated to achieve desired system behaviors. This involves analyzing the relationships between policy variables, system indicators, and outcomes, and using statistical and econometric techniques to test hypotheses and identify causal relationships. By doing so, researchers can develop a deeper understanding of the dynamics of complex systems and identify effective policy strategies that can be used to manage system outcomes and achieve desired goals. Table 6: SourceAbs generations for Examples AâC (group rank of the ground-truth inspiration). Examples AâB appear in the main paper; Example C is discussed in this supplement. Target / inspiration TCA-SIR Prompt-TCA G ranks 1 / 7 How can we effectively manage computation offloading in a multi-mobile user (MU), multi-edge server (ES) environment where ES resources are heterogeneous and finite, considering the need to minimize both MU time and energy consumption while maximizing ES resource utilization? Inspiration: A queuing theory model for cloud computing A queuing theory-based approach can be applied to model the computation offloading process in a multi-user, multi-edge server environment, where edge servers are treated as queuing systems with finite capacities, and task allocation is optimized to minimize waiting times and maximize resource utilization, thereby balancing MU time and energy consumption while maximizing ES resource utilization. A queuing theory-based approach can be adapted to model the computation offloading process in a multi-mobile user, multi-edge server environment. This approach can help identify bottlenecks and optimize resource utilization by analyzing the arrival rates, service rates, and file sizes of computation tasks. However, the model would need to be extended to account for the dynamic and adaptive nature of the target problem, incorporating factors such as user mobility, edge server heterogeneity, and finite resources. H ranks 1 / 10 What are the diverse roles of pericytes in disease pathobiology, and how can understanding these roles inform future therapeutic strategies? Inspiration: A molecular atlas of cell types and zonation in the brain vasculature A detailed molecular characterization of pericytes using single-cell transcriptomics can reveal their diverse roles in disease pathobiology, including their involvement in fibrosis and immune modulation, and inform therapeutic strategies by identifying specific molecular profiles and functional roles that can be targeted for treatment. One transferable mechanism principle from the inspiration paper is the use of single-cell transcriptomics to define the molecular characteristics of pericytes and their roles in different biological contexts. This approach can be adapted to study pericytes in various diseases and tissues, providing insights into their diverse roles and potential therapeutic targets. By applying this principle, researchers can gain a deeper understanding of pericyte biology and develop targeted therapeutic strategies for a range of disorders. I ranks 1 / 8 How can the accuracy and reliability of physics-informed neural networks (PINNs) be improved for simulating problems involving strong nonlinear discontinuities, such as shock waves in hyperbolic equations? Inspiration: Understanding and mitigating gradient flow pathologies in physics-informed neural networks A learning rate annealing algorithm that utilizes gradient statistics during model training can be employed to balance the interplay between different terms in the composite loss function of PINNs, thereby mitigating the effects of numerical stiffness and improving the stability and accuracy of PINNs in capturing strong nonlinear discontinuities in hyperbolic equations. A potential mechanism for improving the accuracy and reliability of PINNs for simulating strong nonlinear discontinuities is to adapt the learning rate annealing algorithm to balance the interplay between different terms in composite loss functions. This could help mitigate the numerical stiffness issue and improve the predictive accuracy of PINNs for the target problem. However, a more robust approach may be needed to specifically address the challenges of simulating strong nonlinear discontinuities, such as shock waves in hyperbolic equations. Table 7: Additional TCA-SIR vs. Prompt-TCA generations (Examples GâI; ranks: TCA-SIR / Prompt-TCA). These cases show target-conditioned wording but often shared mechanism family; they were previously used as an earlier main-paper qualitative set. TCA-SIR Prompt-TCA SourceAbs D ranks 2 / 11 / 3 LAST + E-Walker assembly Insp.: space-robotics OOS A transferable principle for LAST assembly by an E-Walker is to use advanced microgravity control (nonholonomic / adaptive / robust) that limits base disturbances and stabilizes the manipulator after contact. Develop advanced motion-planning and manipulation controllers for microgravity; scoped mainly to individual E-Walker components rather than full large-scale assembly coordination. Integrate kinematics, dynamics, and control so robotic systems can handle uncertain dynamics, a holistic but less target-specific principle. E ranks 3 / 9 / 1 SLC7A11 / disulfidptosis Insp.: disulfide switches Regulate disulfide bonds in SLC7A11 (including those tied to disulfidptosis) as cleavable switches for cancer therapeutics that modulate cell-death pathways. Treat disulfide cleavage as a protein-function switch and ask how that lens applies to SLC7A11-regulated cystine transport / glutathione synthesis in disulfidptosis. Reinterpret stable structural elements as dynamic regulatory switches that fine-tune protein activity under changing conditions. F ranks 1 / 9 / 2 flame-retardant light SiRF Insp.: MXene retardants Adapt MXene-style nanomaterials to boost SiRF flame retardancy and thermal stability without heavy filler loadings that ruin lightness and flexibility. Incorporate high-surface-area nanofillers (e.g., Ti3C2Tx) to disperse flame retardants in SiRF; notes remaining stability / aggregation questions. Add functional nanomaterials to composites for multifunctionality, with dispersion and compatibility as the main engineering bottlenecks. Table 8: Additional model-generated abstractions (Examples DâF; ranks: TCA-SIR / Prompt-TCA / SourceAbs). D: cross-task space-robotics transfer (on-orbit servicing review â E-Walker telescope assembly). E: general-to-specific disulfide mechanism (protein disulfide switches â SLC7A11/disulfidptosis); SourceAbs can rank first while remaining domain-washed. F: materials transfer (MXene flame-retardant polymers â flame-retardant silicone rubber foam). Target focus TCA-SIR abstraction (same inspiration) Optimize a specific PAA@TiO2 nanocomposite for crystal-violet removal Integrate experiments with DFT, MD, and MC to characterize adsorption mechanisms and thermodynamics, enabling optimization of the PAA@TiO2 adsorbent. Chemistry target; TCA-SIR rank 1 Design an effective, cost-efficient adsorbent (molecular-level understanding secondary) Integrate nanoparticles with a polymer matrix to improve stability/dispersion and adsorption capacity for a sustainable water-treatment material. Materials target; TCA-SIR rank 1 Table 9: Same inspiration, different targets (controlled target conditioning). Shared source: Investigation of the anionic polyacrylamide as a potential adsorbent of crystal violet dye⊠(DFT, MC, MD). TCA-SIR emphasizes experimentalâcomputational characterization when the target asks how to optimize PAA@TiO2, but polymerânanoparticle composite design when the target asks how to develop a broadly effective adsorbent. The targets are related formulations of a similar problem, so this is preliminary evidence of facet selection rather than transfer across unrelated goals. Scoreâgeneration disagreement. TCA-SIRâs transfer score and generated abstraction are not perfectly aligned. In some held-out cases the model ranks a ground-truth inspiration highly while the generated text is cautious or scope-limited (e.g., nonlinear programming for satellite orbit prediction; economic-growth/environment work for renewable-energy spillovers; zinc-complex synthesis for antileukemia complexes). A high retrieval score should therefore not always be read as evidence of a faithful actionable abstraction; improving scoreâgeneration consistency is future work. B.3 Why Gen-level and Idea-Catalyst underperform The main-paper comparison shows that Gen-level and Idea-Catalyst lag Direct LLM and TCA-SIR. Tables 10 and 11 inspect intermediate artifacts on Examples GâI (SourceAbs for Examples AâC appears in Table 6). Gen-level L3âL4 texts and Idea-Catalyst core problems both tend to erase domain-specific mechanism details in favor of generic âcomplex systemsâ language, which weakens ranking for scientific inspiration transfer. Target L1âL4 GT inspiration L1âL4 G L1: Develop an optimization algorithm for computation offloading in a multi-mobile user, multi-edge server environment with heterogeneous and finite resources to minimize user time and energy consumption while maximizing server utilization. L2: Design a multi-objective optimization framework for task allocation in distributed systems with heterogeneous resources and finite capacities to balance competing performance metrics. L3: Create a resource allocation strategy for complex systems with multiple users and limited resources to optimize performance and efficiency while minimizing waste. L4: Find an optimal allocation of limited resources among competing demands to maximize overall system performance and minimize waste. Inspiration: A queuing theory model for cloud computing L1: Improving QoS in cloud computing environments using queuing theory. L2: Analyzing and optimizing performance in distributed computing systems. L3: Identifying and addressing bottlenecks in complex systems to enhance efficiency. L4: Optimizing system performance by understanding and managing resource utilization and capacity. Best cosine pair: target L3 â source L4 (group rank 1; shortlist rank 2). H L1: What are the diverse roles of pericytes in disease pathobiology? L2: How do specialized cells contribute to vascular stability and function in various biological contexts? L3: What are the mechanisms by which cells with diverse functions interact with their environment to influence disease progression? L4: How do complex systems integrate diverse cell types to maintain homeostasis and respond to pathological conditions? Inspiration: A molecular atlas of cell types and zonation in the brain vasculature L1: Understanding the molecular characteristics of brain vascular cells in the adult mouse brain. L2: Characterizing the molecular properties of vascular cells in various organs and tissues to understand their roles in health and disease. L3: Applying single-cell transcriptomics to identify and categorize cell types in complex biological systems. L4: The importance of cellular heterogeneity in understanding complex biological systems and its implications for disease. Best cosine pair: target L2 â source L2 (group rank 1; shortlist rank 2). I L1: How can the accuracy and reliability of PINNs be improved for simulating shock waves in hyperbolic equations? L2: How can numerical methods be enhanced to accurately capture strong nonlinear discontinuities in complex systems governed by PDEs? L3: How can machine learning models be adapted to effectively handle abrupt changes in physical quantities in various complex systems? L4: How can models be improved to handle abrupt changes in complex systems with high uncertainty and nonlinearity? Inspiration: Understanding and mitigating gradient flow pathologies in PINNs L1: Physics-informed neural networks in computational physics. L2: Training constrained neural networks in scientific machine learning. L3: Mitigating numerical instability in neural networks with composite loss functions. L4: Balancing competing objectives in complex optimization problems. Best cosine pair: target L1 â source L3 (group rank 9; not shortlisted). Table 10: Gen-level retrieval intermediate abstractions on Examples GâI (max variant). Higher levels (esp. L3âL4) wash mechanism detail into broad âcomplex systemsâ / âresource allocationâ language, so cosine matching can reward vague topical overlap (G, H) or miss the actionable mechanism transfer entirely (I). Target core problem GT inspiration core problem Illustrative distractor core G How to efficiently allocate limited resources among competing tasks to minimize time and energy consumption while maximizing utilization. Inspiration: A queuing theory model for cloud computing Developing a framework to predict and optimize the performance of complex systems under varying loads and constraints. Paper: Developing and validating trust measures for e-commerce Developing a unified framework to measure complex, multifaceted concepts across different contexts. H Understanding the dynamic behavior of specialized cells in complex biological systems to identify their diverse roles and potential therapeutic targets. Inspiration: A molecular atlas of cell types and zonation in the brain vasculature Identifying and categorizing the distinct characteristics of individual cell types within a complex system to understand their roles and relationships. Paper: Gaia Data Release 2 Integrating and processing large amounts of diverse data to provide a comprehensive and accurate representation of a complex system. I How to effectively handle abrupt changes in a systemâs behavior while maintaining stability and preserving underlying physical properties. Inspiration: Understanding and mitigating gradient flow pathologies in PINNs How to balance competing objectives in complex optimization problems to prevent numerical instability and improve overall performance. Paper: SC3: consensus clustering of single-cell RNA-seq data Identifying a robust and accurate method to group similar items into clusters when the data is noisy and multiple solutions are possible. Table 11: Idea-Catalyst intermediate core problems on Examples GâI. Target and source statements are intentionally domain-agnostic one-liners; as a result, unrelated papers can share nearly interchangeable âcomplex systemâ cores (G, H), and even when the GT inspiration is shortlisted the extracted problem rarely retains the transferable mechanism that TCA-SIR surfaces. B.4 Per-discipline breakdown Figure 6 reports HitRate@top4% by ResearchBench domain for headline methods. Aggregate test240 gains for TCA-SIR are not driven by a single discipline; relative orderings remain broadly stable across domains. Figure 6: Per-discipline HitRate@top4% heatmap on test240 for headline methods. B.5 Training dynamics and extra ranking views Figure 7 shows train loss components and validation trends for the TCA-SIR run used in the main comparison (lr 1Ă10â51Ă10^-5). Figures 8â11 give extra ranking views: trained vs. untrained HitRate@top4%, overall MRR, overall HitRate@top4%, and ablation / Prompt-TCA / SourceAbs HitRate@top4%. Figure 7: TCA-SIR training loss and validation trend. Figure 8: Trained vs. untrained HitRate@top4% on test240. Figure 9: Overall MRR ranking on test240. Figure 10: Overall HitRate@top4% ranking on test240. Figure 11: Ablation / Prompt-TCA / SourceAbs HitRate@top4%. Appendix C Implementation Notes C.1 Ranking metrics HitRate follows ResearchBench (Liu et al. 2026b): for each target, the fraction of gold inspirations among the top k retrieved candidates, with k=3k=3 (top 4% of a 75-pool) or k=15k=15 (top 20%), then averaged over targets. MRR is 1/r1/r for the rank r of the first gold inspiration (0 if none is retrieved), averaged over targets. For NDCG@3, each of the top three positions contributes a binary gain of 11 if it matches a still-unmatched gold inspiration, discounted by log2âĄ(i+1) _2(i+1) at position i, then normalized by the ideal top-3 ranking; we report the mean over targets together with a bootstrap 95% CI half-width. C.2 Hardware and software All reported training and HitRate evaluations were run on a dual-socket Linux server with 512 GB RAM and two NVIDIA RTX PRO 6000 GPUs (96 GB each), under Ubuntu Server 24.04. Each fine-tuning or evaluation job used a single GPU. The reported TCA-SIR LoRA fine-tune (Llama-3.1-8B-Instruct, 3 epochs, learning rate 1Ă10â51Ă10^-5) takes roughly 8 hours wall-clock on one GPU; ablation and sensitivity runs are in the same regime. Software stack: Python 3.11, PyTorch with CUDA, Hugging Face Transformers / PEFT / TRL, and the frozen YAML configs shipped with the code-and-data package. C.3 Artifacts and configs Frozen ResearchBench holdouts used in this paper live under the submission data directory: test240 (headline HitRate), val120 (training-time validation / ablation screening), and pilot12 (one target per domain from val120, seed 42, for sensitivity sweeps). Training and HitRate evaluation configs are the frozen YAML copies under the submission configs directory, with per-experiment notes under the submission experiments directory. Paper display names (TCA-SIR / Prompt-TCA / SourceAbs) are defined in the analysis naming module and NAMING.md in the paper folder. Tables and figures in this appendix can be regenerated from the repository root with the submission run_paper_assets.sh script. Appendix D Teacher Supervision Quality We inspected the accepted frozen supervision rows used for TCA-SIR training (n=3967n=3967, from the same v4c text-anchor SFT set used in the main experiments) to check whether the 5-level grader collapses to an almost binary 0.1,0.9\0.1,0.9\ assignment. Figures 12â13 show that it does not. Positive pairs concentrate at 0.50.5 and 0.70.7, negatives concentrate at 0.10.1, and the two classes still overlap at intermediate levels rather than separating into a degenerate two-point code. This is consistent with the grader adding transfer nuance beyond the original positive/negative pairing. All accepted rows0204060Score levelPercent0.142.10.314.10.530.50.712.10.91.2 Positive rows0204060Score levelPercent0.121.00.316.60.540.80.719.60.92.1 Negative rows0204060Score levelPercent0.167.90.310.90.518.00.72.90.90.2 Figure 12: Five-level supervision distributions over accepted training rows. Left: overall distribution. Middle/right: per-class score histograms normalized within positive and negative rows, respectively. The mass is not collapsed to only 0.10.1 and 0.90.9: positives peak at 0.50.5 and 0.70.7, while negatives peak at 0.10.1 but still occupy 0.30.3 and 0.50.5. Average score by class0.00.10.20.30.40.5Neg0.213Pos0.430 Positive rows: high scores010203040Percent0.540.80.719.60.92.1 Negative rows0204060Percent0.167.90.310.9 Figure 13: Summary views of teacher-supervision quality. Left: average graded score by class (positive 0.4300.430, negative 0.2130.213). Middle panels: within positive rows, 40.8%40.8\% receive 0.50.5, 19.6%19.6\% receive 0.70.7, and 2.1%2.1\% receive 0.90.9. Right: within negative rows, 67.9%67.9\% receive 0.10.1 while 10.9%10.9\% receive 0.30.3. Together with Figure 12, this overlap supports a nuanced grader rather than a near-binary collapse. Appendix E Training-Data Construction Prompts We use Llama-3.1-8B-Instruct for both the label-aware R/A teacher and the transferability grader. Placeholders of the form problem are filled from each ResearchBench pair at runtime. The templates below are the production prompts for TCA-SIR supervision (v2 teacher templates and the 5-level grader). Prompts are shown in a reduced monospace font and hard-wrapped to the column width. E.1 Positive teacher (label-aware R/A) Given a target research problem and an inspiration paper, produce a transfer decision with reasoning and abstraction. Target problem: problem Background: background Inspiration title: title Inspiration abstract: abstract Set transfer_decision to "transferable". In reasoning (1-3 sentences), explain which specific aspect of the inspiration is useful for the target problem. In abstraction (one paragraph), state a transferable principle adapted to this target. Ground it in the inspiration content. Do NOT use markdown, bullet lists, or generic filler. Do NOT copy refusal boilerplate. Respond with ONLY valid JSON (no markdown fences): "transfer_decision": "transferable", "reasoning": "<1-3 sentences>", "abstraction": "<single paragraph>" E.2 Negative teacher (scope-limited R/A) Given a target research problem and an inspiration paper, produce a transfer decision with scope-limited reasoning and abstraction. Target problem: problem Background: background Inspiration title: title Inspiration abstract: abstract Set transfer_decision to "not_transferable". In reasoning (1-3 sentences), follow this pattern: "The inspiration appears related because X, but it is limited to Y, while the target requires Z. Therefore, the transfer is unreliable." In abstraction (one paragraph), follow this pattern: "Scope-limited abstraction: the source applies to Y and does not provide a reliable transferable principle for Z." Name concrete X (superficial overlap), Y (source scope), and Z (target requirement). Do NOT invent a positive bridge. Do NOT use markdown or bullet lists. Do NOT use generic refusal boilerplate. Respond with ONLY valid JSON (no markdown fences): "transfer_decision": "not_transferable", "reasoning": "<1-3 sentences>", "abstraction": "<single paragraph>" E.3 Five-level transferability grader You are grading scientific inspiration transferability. Your task is to assign a graded transferability score for how useful the candidate inspiration paper is for solving the target research problem. You must judge the candidate based on transferable mechanism, not surface similarity. Important distinction: * A paper can be topically related but still weak if it does not provide a useful mechanism for the target. * A paper can be from a different domain but strong if it provides a mechanism, method, or design principle that can be adapted to the target. * A broad analogy is not enough for a high score. * Do not overclaim transferability. * Penalize candidates that are only generally related, only share keywords, or only provide background knowledge. Scoring scale: 0.9 = Strong / central transfer. The candidate provides a mechanism, method, or design principle that directly addresses the targetâs main bottleneck. 0.7 = Useful partial transfer. Useful for part of the target, but does not fully address the central problem. 0.5 = Plausible broad analogy. Reasonable abstract connection, but the mechanism is generic, indirect, or not clearly central. 0.3 = Weak / scope-limited relation. Peripheral or requires major adaptation. 0.1 = Unrelated or misleading. No useful transferable mechanism. Target research problem: target_problem Target background: target_background Candidate inspiration paper: Title: candidate_title Abstract: candidate_abstract Original dataset metadata, for reference only. Do not copy this label. Re-grade independently: original_metadata Now grade the candidate. Return valid JSON only. Do not include markdown. JSON schema: "graded_transfer_score": 0.1, "transfer_level": "unrelated | weak | broad_plausible | partial | strong", "label_rationale": "...", "central_transfer_mechanism": "...", "why_not_higher": "...", "overclaim_risk": "low | medium | high" Appendix F Training Supervision Examples A natural concern is that label-aware R/A teaching could imprint a small set of polarity or grade-specific surface templates, and that a score head reading the final-token hidden state after generation could then recover the graded label from those templates rather than from transfer content. Inspection of accepted training rows does not support a unique phrase-to-score mapping: within each graded score, Reasoning/Abstraction vary in framing (mechanism adaptation, methodological template, scope mismatch, domain-specific mechanism claims, etc.). Below we show two accepted training rows for each score in 0.1,0.3,0.5,0.7,0.9\0.1,0.3,0.5,0.7,0.9\ (verbatim teacher R/A; problem text truncated to the lead question). Comparing the pair at a fixed score makes the within-label stylistic diversity visible. F.1 Graded 0.10.1 Example A (Astronomy; gold negative). Target. How can artificial intelligence (AI) be effectively integrated into gravitational wave (GW) data analysis to enhance the efficiency, accuracy, and scope of scientific discoveries? Inspiration. Advanced Virgo: a second-generation interferometric gravitational wave detector. Teacher Reasoning. The inspiration paper focuses on the design and construction of a gravitational wave detector, Advanced Virgo, which is a hardware upgrade rather than a software solution. This paper does not address the integration of AI into gravitational wave data analysis, which is the target problem. The paperâs scope is limited to the detectorâs hardware and its expected performance, rather than software applications. Teacher Abstraction. The Advanced Virgo detector is a second-generation interferometric gravitational wave detector being constructed to increase the detection rate by three orders of magnitude, with a focus on hardware upgrades and detector performance, assuming a specific scale of detector size and sensitivity, and a method of interferometric detection. Example B (Astronomy; gold positive). Target. How can the significant imbalance between non-pulsar and pulsar samples in pulsar candidate datasets be effectively addressed to improve the accuracy of pulsar candidate identification using deep learning models? Inspiration. Neural discrete representation learning. Teacher Reasoning. The inspirationâs use of vector quantisation (VQ) to learn discrete representations can be applied to address the imbalance between non-pulsar and pulsar samples in pulsar candidate datasets by generating synthetic pulsar samples that can help alleviate the challenges of imbalanced datasets. Teacher Abstraction. A VQ-based generative model can be adapted to learn discrete representations of pulsar signals, enabling the synthesis of realistic pulsar samples that can be used to augment the training dataset and improve the performance of machine learning classifiers in pulsar candidate identification, thereby addressing the significant imbalance between non-pulsar and pulsar samples. F.2 Graded 0.30.3 Example A (Biology; gold positive). Target. How can recent advances and clinical trials in pancreatic ductal adenocarcinoma (PDAC) improve patient outcomes through novel therapeutic strategies, biomarkers, and clinical trial designs? Inspiration. Master protocols: new directions in drug discovery. Teacher Reasoning. The inspirationâs concept of master protocols, particularly umbrella trials, can be applied to PDAC to evaluate multiple therapeutic options simultaneously, streamlining the drug development process and enabling personalized treatment approaches based on tumor biology. Teacher Abstraction. A master protocol design, specifically an umbrella trial, can be adapted for PDAC to evaluate multiple therapeutic combinations and biomarkers in a single study, leveraging molecular profiling to stratify patients and optimize treatment outcomes, thereby enhancing the efficiency and effectiveness of clinical trials in this challenging disease. Example B (Biology; gold positive). Target. How can recent advances and clinical trials in pancreatic ductal adenocarcinoma (PDAC) improve patient outcomes through novel therapeutic strategies, biomarkers, and clinical trial designs? Inspiration. Maintenance olaparib for germline BRCA-mutated metastatic pancreatic cancer. Teacher Reasoning. The inspirationâs use of PARP inhibitors as a targeted therapy for germline BRCA-mutated metastatic pancreatic cancer provides a useful approach for addressing the molecular heterogeneity and tumor vulnerabilities in PDAC, particularly in patients with specific genetic mutations. Teacher Abstraction. Targeted therapies that exploit specific tumor vulnerabilities, such as PARP inhibitors for BRCA-mutated PDAC, can improve patient outcomes by enhancing treatment efficacy and reducing adverse effects, underscoring the importance of integrating molecular data into clinical decision-making to personalize treatment approaches and address the complex molecular landscape of PDAC. F.3 Graded 0.50.5 Example A (Astronomy; gold positive). Target. How can we improve the calibration of Adaptive Optics (AO) systems in telescopes to effectively compensate for static optical aberrations without modifying the optical path, thereby enhancing image quality? Inspiration. Phase retrieval and diversity in adaptive optics. Teacher Reasoning. The inspirationâs concept of phase retrieval and diversity in adaptive optics can be applied to improve the calibration of AO systems by leveraging the modulus of the signal from a systemâs focal plane array to estimate phase aberrations, which can be used to derive control signals to align the optical system. Teacher Abstraction. A transferable principle for improving AO system calibration is to utilize phase retrieval algorithms that estimate phase aberrations from the modulus of the signal from a systemâs focal plane array, enabling the derivation of control signals to dynamically adjust the optical system and compensate for static optical aberrations without modifying the optical path. Example B (Biology; gold positive). Target. How can a comprehensive understanding of the cellular and molecular mechanisms involved in wound healing lead to the development of novel therapeutics that prevent scarring and promote the repair of chronic wounds? Inspiration. Live imaging of wound angiogenesis reveals macrophage orchestrated vessel sprouting and regression. Teacher Reasoning. The inspirationâs findings on the crucial role of macrophages in orchestrating vessel sprouting and regression during wound healing provide a valuable insight into the complex cellular interactions involved in wound repair, which can be leveraged to develop novel therapeutics that prevent scarring and promote healing. Teacher Abstraction. A therapeutic strategy that modulates macrophage activation state and function could potentially enhance wound healing by promoting angiogenesis and preventing excessive scarring, as macrophages play a pivotal role in driving vessel sprouting and regression, and their dysregulation can lead to impaired healing outcomes. F.4 Graded 0.70.7 Example A (Cell Biology; gold positive). Target. How can we significantly increase the throughput of long-read RNA sequencing to enable more comprehensive identification and quantification of full-length RNA isoforms, particularly in single-cell applications? Inspiration. ConcatSeq: a method for increasing throughput of single molecule sequencing by concatenating short DNA fragments. Teacher Reasoning. The inspirationâs ConcatSeq method, which concatenates short DNA fragments to increase the throughput of single molecule sequencing, can be adapted to long-read RNA sequencing by concatenating short RNA fragments to generate longer templates for sequencing, thereby increasing the throughput of long-read RNA sequencing. Teacher Abstraction. A transferable principle, dubbed Concatenate-and-Sequence, involves generating longer RNA templates by concatenating short RNA fragments, leveraging the capabilities of long-read sequencing technologies to increase the throughput and accuracy of full-length RNA isoform identification, particularly in single-cell applications. Example B (Biology; gold positive). Target. How can bispecific antibodies (bsAbs) be effectively developed and utilized in cancer therapy to achieve novel mechanisms of action and therapeutic applications that surpass those of conventional IgG-based antibodies? Inspiration. Biology drives the discovery of bispecific antibodies as innovative therapeutics. Teacher Reasoning. The inspiration paper highlights the potential of bispecific antibodies to enable novel mechanisms of action and therapeutic applications by binding two different targets or epitopes, and the classification system for bsAb formats based on antigen-binding domains and Fc domain presence provides a framework for selecting a bispecific format to meet biology needs. Teacher Abstraction. A systematic approach to designing bispecific antibodies for cancer therapy involves categorizing formats based on antigen-binding domains and Fc domain presence to select a format that aligns with the specific biology of the target, thereby enabling novel mechanisms of action and therapeutic applications that surpass those of conventional IgG-based antibodies. F.5 Graded 0.90.9 Example A (Chemistry; gold positive). Target. How can the structural stability and reversible capacity of P2-type layered transition metal oxides, used as cathode materials in sodium-ion batteries, be improved to achieve high energy density and long-cycle life? Inspiration. Identifying the critical role of Li substitution in P2-Nax[LiyNizMn1-y-z]O2 (0<x,y,z<10<x,y,z<1) intercalation cathode materials. Teacher Reasoning. The inspiration paper highlights the beneficial effects of Li substitution in P2-type layered transition metal oxides, specifically the stabilization of the P2 structure and delay of phase transformation at high voltages, which is crucial for improving the structural stability and reversible capacity of these materials. Teacher Abstraction. Introducing Li substitution in P2-type layered transition metal oxides can stabilize the P2 structure and delay phase transformation at high voltages, allowing for more Na ions to reside in prismatic sites and maintaining the overall charge balance of the compound, thus enhancing the structural stability and reversible capacity of these materials. Example B (Cell Biology; gold positive). Target. How can we design advanced catalysts with optimized heterostructure interfaces to improve the performance of hydrogen electrocatalysis reactions, particularly in alkaline media? Inspiration. Interface engineering of heterostructured electrocatalysts towards efficient alkaline hydrogen electrocatalysis. Teacher Reasoning. The inspiration paper highlights the importance of interface engineering in enhancing the performance of heterostructured electrocatalysts for hydrogen evolution and oxidation reactions in alkaline media, particularly through the promotion of reaction kinetics and the optimization of electronic structures at the interface. Teacher Abstraction. Designing advanced catalysts with optimized heterostructure interfaces for hydrogen electrocatalysis in alkaline media involves leveraging the synergistic effects of combining different materials at the interface to enhance electrocatalytic performance, while also optimizing the binding energies of key intermediates through electronic interaction, interfacial bonding, and lattice strain, ultimately leading to improved reaction kinetics and overall efficiency.