Evidence map›Paper›PMID 42151739›Full record

ArticlePhysiological reports2026

Neural network surrogates enable robust and accessible modeling of renal epithelial transport.

Anita T Layton

Abstract read
In one paragraph

Article in Physiological reports, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

1 author.

Anita T LaytonDepartment of Applied Mathematics and Biology, Cheriton School of Computer Science, School of Pharmacy, University of Waterloo, Waterloo, Ontario, Canada.

Funding

Gouvernement du Canada | Natural Sciences and Engineering Research Council of Canada (NSERC) RGPIN-2025-03958
6 · The paper itself

Abstract

Mathematical models of renal epithelial transport provide powerful tools for investigating kidney function, but their broader use is often hindered by numerical challenges. These highly nonlinear model equations typically require specialized solvers and careful initialization, which can reduce robustness and accessibility. To address these limitations, we propose a neural-network (NN)-based framework for approximating steady-state solutions of epithelial transport models. Training and validation data are generated using published mechanistic models by systematically varying transport parameters and computing corresponding cellular states, including solute concentrations, membrane potentials, and fluxes. The NN is then trained as a fast surrogate for the mechanistic model. Once trained, the NN accurately predicts cellular variables for previously unseen parameter sets. Using proximal convoluted tubule and medullary thick ascending limb cells as examples, we demonstrate high predictive accuracy when training and testing data are drawn from the same sex. Cross-sex predictions are less accurate, reflecting known sex differences in transporter abundance. The NN also accurately models transporter inhibition scenarios and can be trained to infer membrane transport properties from measurable physiological data, highlighting its potential for inverse modeling. Overall, this NN-based solver provides a robust alternative to traditional approaches, eliminating convergence failures and improving accessibility of epithelial transport models.

Indexed as

Epithelial CellsKidneyKidney Tubules, ProximalModels, BiologicalNeural Networks, ComputerAnimalsBiological TransportHumansartificial intelligenceepithelial transportkidneymachine learning

Identifiers

PMID42151739
PMCPMC13183602

What Socratic holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the Socratic graph.