❌

Reading view

Advances in single-cell and spatial multi-omics for deciphering the mechanisms of pan-organ metastasis in breast cancer

Biochim Biophys Acta Rev Cancer. 2026 Sep 15:189717. doi: 10.1016/j.bbcan.2026.189717. Online ahead of print.

ABSTRACT

Breast cancer deaths are mainly caused by metastasis to distant organs, not by the primary tumor. Bone, lung, liver, and brain are the most common metastatic sites, each showing different clinical behaviors and treatment responses-a pattern often called metastatic organotropism. Bulk omics can provide tissue-level information, but they fall short in identifying rare metastasis-initiating clones or capturing how tumor cells adapt to distinct organ microenvironments. With recent progress in single-cell sequencing, multi-omics integration, and spatial profiling, it is now possible to study metastasis at much finer cellular and spatial resolution. In this review, we synthesize current evidence from two complementary perspectives. First, we summarize pan-organ programs associated with metastatic competence, including partial epithelial-mesenchymal transition, lineage plasticity, stem-like states, stress tolerance, metabolic flexibility, immune evasion, and stromal-vascular remodeling. Second, we discuss how these programs are reshaped by organ-specific microenvironments: osteolytic and mixed bone remodeling and marrow dormancy in bone, inflammatory vascular niches in lung, tolerogenic antigen presentation and hepatic metabolism in liver, and blood-brain/blood-tumor barrier constraints, glial crosstalk, neuronal interactions, and lipid-metabolic adaptation in brain. We also highlight how CTC/CTM profiling, spatial mapping, and longitudinal integration refine the understanding of dissemination, dormancy, colonization, outgrowth, and treatment resistance. Although these approaches hold translational promise, most remain at the discovery or early validation stage and require assay simplification, prospective testing, and cross-center standardization. Overall, single-cell and spatial multi-omics are reframing breast cancer metastasis as a dynamic, multi-stage, and tissue-shaped process, providing a foundation for future biomarker development and mechanism-guided therapeutic strategies.

PMID:42744123 | DOI:10.1016/j.bbcan.2026.189717

  •  

Neural Scalable Symbolic Search Framework for Complex Logical Queries with Multiple Free Variables

arXiv:2605.25985v1 Announce Type: new Abstract: Complex Query Answering (CQA) is a fundamental knowledge representation and reasoning task over incomplete knowledge graphs (KGs). Answering existential first-order queries with $k$ free variables (i.e., $\text{EFO}_k$ queries) is a crucial yet challenging problem, as it requires ranking answer tuples in $\mathcal{E}^k$, where $\mathcal{E}$ denotes the entity set of a KG. This quickly becomes intractable as $k$ grows. Consequently, existing benchmarks and methods rely on marginal rankings over individual variables; however, marginal rankings are a poor proxy for the true joint ranking of tuples. Building on neural symbolic search for $\text{EFO}_1$ queries, we propose Neural Scalable Symbolic Search (NS3), a budgeted framework that approximates joint ranking without enumerating $\mathcal{E}^k$. NS3 (i) answers marginalized sub-queries to obtain necessary candidate sets, (ii) merges multiple free variables into hypernodes whose domains are pruned and controlled by a dynamic budget $B$, and (iii) progressively reduces an $\text{EFO}_k$ query to an $\text{EFO}_{k-1}$ query over a budgeted reduced domain. Across three standard KG datasets, NS3 substantially improves joint ranking performance while retaining strong marginal accuracy. We further release a joint-ranking benchmark that extends existing $\text{EFO}_1$ datasets to $k=3$, enabling systematic evaluation of multi-variable queries. Our code is provided in https://github.com/HKUST-KnowComp/NS3_KDD2026.
  •  

Efficient and Scalable Neural Symbolic Search for Knowledge Graph Complex Query Answering

arXiv:2505.08155v4 Announce Type: replace Abstract: Complex Query Answering (CQA) is a crucial reasoning task over Knowledge Graphs (KGs), which aims to answer first-order logical queries from incomplete KGs. While existing neural-symbolic methods achieve strong performance, they face significant complexity bottlenecks: quadratic data complexity scaling with the number of entities, and NP-hard query complexity for cyclic queries. Consequently, these approaches struggle to scale effectively to large knowledge graphs and complex queries. To address these limitations, we propose an efficient and scalable symbolic search method comprising two key components: (1) constraint strategies that drastically reduce the variable search domain, lowering data complexity; and (2) a local search algorithm that approximately solves NP-hard cyclic queries. Experiments on various CQA benchmarks demonstrate that, for tree-form queries, our method achieves 97% relative MRR with a 10$\times$ speedup using only 10% of the search space. Furthermore, it demonstrates robust performance on complex cyclic queries and large-scale KGs, effectively alleviating efficiency and scalability challenges. Our code is provided in https://github.com/HKUST-KnowComp/NLISA_KDD2026.
  •  

MoirΓ© engineering of Cooper-pair density modulation states

Nature, Published online: 01 April 2026; doi:10.1038/s41586-026-10325-w

Researchers created a moirΓ© superlattice in Sb2Te3/FeTe bilayers, producing spatially modulated superconducting gaps directly imaged with Josephson scanning tunnelling microscopy and spectroscopy, tunable by replacing Sb2Te3 with Bi2Te3.
  •  

Stoichiometric FeTe is a superconductor

Nature, Published online: 01 April 2026; doi:10.1038/s41586-026-10321-0

Analysis of FeTe films grown using molecular-beam epitaxy and annealed under a Te flux post-growth shows that stoichiometric FeTe is inherently a superconductor, contradicting the long-held view that it is an antiferromagnetic metal.
  •  
❌