Evidence map›Paper›PMID 40594165›Full record

ArticleScientific reports2025

Using deep learning to capture gravel soil microstructure and hydraulic characteristics.

Bin Zhu, Yu-Fei Xie, Xiang-Gang Hu, Dai-Rong Su

Abstract read
In one paragraph

Article in Scientific reports, 2025. 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

4 authors.

Bin ZhuEarth Sciences College, Guilin University of Technology, Guilin, 541004, China. 1999002@glut.edu.cn.
Yu-Fei XieEarth Sciences College, Guilin University of Technology, Guilin, 541004, China.
Xiang-Gang HuEarth Sciences College, Guilin University of Technology, Guilin, 541004, China.
Dai-Rong SuEarth Sciences College, Guilin University of Technology, Guilin, 541004, China.

Funding

National Natural Science Foundation of China NSFC41462014
6 · The paper itself

Abstract

The special hydraulic properties of gravel soil, attributed to its varying fine particle content, can be effectively analyzed using the Wasserstein Generative Adversarial Networks (WGANs) technique. This approach enables the reconstruction of 3D digital samples of gravel soil, allowing for the generation of specific microstructure realizations, including complex pore characteristics. This capability is crucial for gaining insights into the hydraulic behavior of gravel soil. In a specific case involving gravel soil samples from Guilin city, China, three samples with similar structural features were carefully selected for analysis. These samples were scanned using µ-CT to create the training dataset for the reconstruction model. The WGAN with Gradient Penalty technique was then applied to simulate the reconstruction of the digital gravel soil samples. The results demonstrated a high consistency between the reconstructed model of gravel soil realizations and the original samples in terms of porosity, two-point correlation function, linear path function, specific surface, and Euler characteristics number. Furthermore, through the evaluation of permeability, it was shown that the reconstructed realizations effectively captured and represented the actual soil prototype. This allowed for the analysis of seepage characteristics and internal stability within a range of magnitudes up to 10

Indexed as

Hydraulic properties imitationMachine learningPore-scale CFD simulationPorous structureWGANs (Wasserstein generative adversarial networks)

Identifiers

PMID40594165
PMCPMC12217472

What OpenQuestion 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 OpenQuestion graph.