<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing with OASIS Tables v3.0 20080202//EN" "https://jats.nlm.nih.gov/nlm-dtd/publishing/3.0/journalpub-oasis3.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:oasis="http://docs.oasis-open.org/ns/oasis-exchange/table" xml:lang="en" dtd-version="3.0" article-type="research-article">
  <front>
    <journal-meta><journal-id journal-id-type="publisher">GMD</journal-id><journal-title-group>
    <journal-title>Geoscientific Model Development</journal-title>
    <abbrev-journal-title abbrev-type="publisher">GMD</abbrev-journal-title><abbrev-journal-title abbrev-type="nlm-ta">Geosci. Model Dev.</abbrev-journal-title>
  </journal-title-group><issn pub-type="epub">1991-9603</issn><publisher>
    <publisher-name>Copernicus Publications</publisher-name>
    <publisher-loc>Göttingen, Germany</publisher-loc>
  </publisher></journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.5194/gmd-19-7961-2026</article-id><title-group><article-title>LFD (v1.0): latent-compression-free generative diffusion with geological priors and geophysical regularization for implicit structural modeling</article-title><alt-title>Latent-compression-free diffusion for implicit structural modeling</alt-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author" corresp="no" rid="aff1 aff2 aff3 aff4">
          <name><surname>Guo</surname><given-names>Zhixiang</given-names></name>
          
        </contrib>
        <contrib contrib-type="author" corresp="yes" rid="aff1 aff2 aff3">
          <name><surname>Wu</surname><given-names>Xinming</given-names></name>
          <email>xinmwu@ustc.edu.cn</email>
        <ext-link>https://orcid.org/0000-0002-4910-8253</ext-link></contrib>
        <contrib contrib-type="author" corresp="no" rid="aff1 aff2 aff3">
          <name><surname>Dou</surname><given-names>Yimin</given-names></name>
          
        <ext-link>https://orcid.org/0000-0001-9247-0832</ext-link></contrib>
        <contrib contrib-type="author" corresp="no" rid="aff1 aff2 aff3">
          <name><surname>Gao</surname><given-names>Hui</given-names></name>
          
        <ext-link>https://orcid.org/0009-0004-0963-2554</ext-link></contrib>
        <contrib contrib-type="author" corresp="no" rid="aff4 aff5">
          <name><surname>Caumon</surname><given-names>Guillaume</given-names></name>
          
        </contrib>
        <aff id="aff1"><label>1</label><institution>Laboratory of Seismology and Physics of the Earth's Interior, School of Earth and Space Sciences, University of Science and Technology of China, Hefei, 230026, China</institution>
        </aff>
        <aff id="aff2"><label>2</label><institution>State Key Laboratory of Precision Geodesy, University of Science and Technology of China, Hefei, 230026, China</institution>
        </aff>
        <aff id="aff3"><label>3</label><institution>Mengcheng National Geophysical Observatory, University of Science and Technology of China, Hefei, 230026, China</institution>
        </aff>
        <aff id="aff4"><label>4</label><institution>Université de Lorraine, CNRS, GeoRessources, 54000 Nancy, France</institution>
        </aff>
        <aff id="aff5"><label>5</label><institution>Institut Universitaire de France (IUF), Paris, France</institution>
        </aff>
      </contrib-group>
      <author-notes><corresp id="corr1">Xinming Wu (xinmwu@ustc.edu.cn)</corresp></author-notes><pub-date><day>26</day><month>August</month><year>2026</year></pub-date>
      
      <volume>19</volume>
      <issue>16</issue>
      <fpage>7961</fpage><lpage>7977</lpage>
      <history>
        <date date-type="received"><day>26</day><month>February</month><year>2026</year></date>
           <date date-type="rev-request"><day>21</day><month>April</month><year>2026</year></date>
           <date date-type="rev-recd"><day>2</day><month>August</month><year>2026</year></date>
           <date date-type="accepted"><day>3</day><month>August</month><year>2026</year></date>
      </history>
      <permissions>
        <copyright-statement>Copyright: © 2026 Zhixiang Guo et al.</copyright-statement>
        <copyright-year>2026</copyright-year>
      <license license-type="open-access"><license-p>This work is licensed under the Creative Commons Attribution 4.0 International License. To view a copy of this licence, visit <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</ext-link></license-p></license></permissions><self-uri xlink:href="https://gmd.copernicus.org/articles/19/7961/2026/gmd-19-7961-2026.html">This article is available from https://gmd.copernicus.org/articles/19/7961/2026/gmd-19-7961-2026.html</self-uri><self-uri xlink:href="https://gmd.copernicus.org/articles/19/7961/2026/gmd-19-7961-2026.pdf">The full text article is available as a PDF file from https://gmd.copernicus.org/articles/19/7961/2026/gmd-19-7961-2026.pdf</self-uri>
      <abstract><title>Abstract</title>

      <p id="d2e147">Diffusion models provide a promising way to generate geologically consistent implicit structural models by learning data-driven priors from training examples, potentially improving generalization across surveys. However, existing diffusion transformer pipelines scale poorly to high-dimensional structural modeling data because noise- or velocity-prediction objectives are often unstable at large patch sizes, forcing the use of small patches that lead to long token sequences and high computational cost. To reduce computation, most approaches rely on variational autoencoders (VAEs) and latent diffusion, but robust pretrained VAEs are scarce in geophysics, and enforcing geological priors in latent space is difficult. To address these scalability bottlenecks and the difficulty of enforcing geological priors in latent space, we propose <bold>L</bold>atent-Compression-<bold>F</bold>ree Generative <bold>D</bold>iffusion (LFD) with Geological Priors and Geophysical Regularization for implicit structural modeling. Built on flow matching, LFD generates implicit structural models directly in the data space, enabling efficient large-patch Vision Transformer (ViT) inference and allowing fault/horizon constraints and geophysical regularization to be applied explicitly during generation. To strengthen structural conditioning, we design a structure-enhanced transformer that injects horizon and fault embeddings at multiple layers. We further introduce two prior-guided losses: a horizon loss to match the generated models to the input horizons, and a fault-aware bending-energy term that regularizes smoothness while ignoring stencils across faults. By enforcing these priors directly in the data space, the model is effectively constrained to generate geologically reasonable structures. Experiments on both synthetic data and real surveys validate the effectiveness of LFD for prior-guided implicit structural modeling. Benefiting from large-patch inference, LFD generates a <inline-formula><mml:math id="M1" display="inline"><mml:mrow><mml:mn mathvariant="normal">512</mml:mn><mml:mo>×</mml:mo><mml:mn mathvariant="normal">512</mml:mn></mml:mrow></mml:math></inline-formula> model in 1.56 s on an NVIDIA H20 GPU. With relative positional encoding, LFD can be extended to higher resolutions via simple adaptation without retraining. Overall, LFD offers new insights into deploying diffusion models for high-dimensional implicit structural modeling problems, enabling efficient generation with interpretable, prior-guided constraints.</p>
  </abstract>
    
<funding-group>
<award-group id="gs1">
<funding-source>National Science and Technology Major Project</funding-source>
<award-id>2024ZD1002100</award-id>
</award-group>
</funding-group>
</article-meta>
  </front>
<body>
      

<sec id="Ch1.S1" sec-type="intro">
  <label>1</label><title>Introduction</title>
      <p id="d2e180">Implicit structural modeling aims to recover a continuous subsurface representation from sparse and heterogeneous geological observations. A common formulation estimates an implicit scalar field, often referred to as the relative geological time (RGT), whose iso-surfaces represent stratigraphic interfaces <xref ref-type="bibr" rid="bib1.bibx49 bib1.bibx33 bib1.bibx38" id="paren.1"/>. Compared with explicit surface-based representations <xref ref-type="bibr" rid="bib1.bibx8" id="paren.2"/>, implicit modeling provides a true volumetric description that enables consistent extraction of multiple geological surfaces and unified enforcement of heterogeneous constraints <xref ref-type="bibr" rid="bib1.bibx52 bib1.bibx9 bib1.bibx56 bib1.bibx2" id="paren.3"/>. As a result, implicit structural models have increasingly been adopted in a wide range of applications, including geological surveying and mapping <xref ref-type="bibr" rid="bib1.bibx48 bib1.bibx25" id="paren.4"/>, seismic interpretation <xref ref-type="bibr" rid="bib1.bibx69 bib1.bibx4 bib1.bibx71" id="paren.5"/>, joint geophysical inversion and imaging <xref ref-type="bibr" rid="bib1.bibx74 bib1.bibx22 bib1.bibx23" id="paren.6"/>, mineral resource and reserve estimation <xref ref-type="bibr" rid="bib1.bibx66 bib1.bibx75" id="paren.7"/>, and stratigraphic-domain transformations for subsequent property modeling <xref ref-type="bibr" rid="bib1.bibx13 bib1.bibx50 bib1.bibx68 bib1.bibx15" id="paren.8"/>. Moreover, the automated and efficient nature of implicit modeling facilitates iterative updates and provides a principled basis for incorporating geological knowledge and quantifying structural uncertainty <xref ref-type="bibr" rid="bib1.bibx68 bib1.bibx72" id="paren.9"/>.</p>
      <p id="d2e211">Classical approaches formulate implicit structural modeling as a constrained interpolation or PDE-based problem, incorporating horizons, faults, and orientation information through variational formulations, discretized operators, or least-squares criteria on constraints <xref ref-type="bibr" rid="bib1.bibx7 bib1.bibx9 bib1.bibx24" id="paren.10"/>. To estimate the scalar field from sparse spatial constraints, two major numerical routes are commonly adopted <xref ref-type="bibr" rid="bib1.bibx58" id="paren.11"/>. The first route uses meshfree global interpolation, including radial basis function interpolation <xref ref-type="bibr" rid="bib1.bibx13 bib1.bibx25 bib1.bibx75" id="paren.12"/> and dual kriging with polynomial drift <xref ref-type="bibr" rid="bib1.bibx11 bib1.bibx7 bib1.bibx15 bib1.bibx56" id="paren.13"/>, for which the computational cost is primarily driven by the number of constraint points. The second route relies on grid-based discretization, where the scalar field is computed by discrete smooth interpolation on discontinuity-conforming tetrahedral meshes <xref ref-type="bibr" rid="bib1.bibx17 bib1.bibx9 bib1.bibx51 bib1.bibx35 bib1.bibx3" id="paren.14"/>, and the cost is dominated by the mesh resolution. Complementary PDE-based formulations solve for the implicit field by propagating interface and orientation constraints via Hamilton-Jacobi equations <xref ref-type="bibr" rid="bib1.bibx54 bib1.bibx31 bib1.bibx21" id="paren.15"/>. Across these formulations, explicit treatment of discontinuities induced by faults and unconformities is a key source of algorithmic and computational complexity. Although these approaches can produce geologically meaningful fields, they can become expensive at high resolution and often require re-solving the system when constraints are updated.</p>
      <p id="d2e233">More recently, deep learning has accelerated implicit structural modeling by learning data-driven priors and accelerating inference from sparse geological constraints. Existing approaches can be broadly categorized into two paradigms. The first paradigm is coordinate-based implicit neural representation <xref ref-type="bibr" rid="bib1.bibx29 bib1.bibx41 bib1.bibx16" id="paren.16"/>, where a network takes spatial coordinates as input and outputs the scalar value of the implicit field <xref ref-type="bibr" rid="bib1.bibx36" id="paren.17"/>. This is typically realized with fully connected networks. This formulation is highly flexible and can naturally support divide-and-conquer strategies, such as solving separate sub-fields over different stratigraphic or temporal intervals and then assembling them into a globally consistent model <xref ref-type="bibr" rid="bib1.bibx30" id="paren.18"/>. The second paradigm is field-based prediction <xref ref-type="bibr" rid="bib1.bibx67 bib1.bibx42" id="paren.19"/>, where the input is a structured spatial grid and the network directly maps volumetric observations and constraint rasters to an implicit field, using convolutional networks <xref ref-type="bibr" rid="bib1.bibx46 bib1.bibx5 bib1.bibx73" id="paren.20"/> or Transformer architectures to capture both local structure and long-range dependencies <xref ref-type="bibr" rid="bib1.bibx57" id="paren.21"/>. In both paradigms, geological observations and prior rules can be incorporated through differentiable loss terms that constrain the predicted field to honor horizons, faults, and other structural constraints <xref ref-type="bibr" rid="bib1.bibx71 bib1.bibx18" id="paren.22"/>. Despite this progress, generalization across surveys with different structural styles or acquisition characteristics remains challenging, and new areas may still require re-training or fine-tuning <xref ref-type="bibr" rid="bib1.bibx61 bib1.bibx26" id="paren.23"/>.</p>
      <p id="d2e261">Generative diffusion models learn data-driven priors by modeling the data distribution rather than memorizing samples <xref ref-type="bibr" rid="bib1.bibx62 bib1.bibx60 bib1.bibx6" id="paren.24"/>. This distributional learning can improve generalization, which is appealing for implicit structural modeling. Methodologically, diffusion models follow two main routes. Discrete-time Denoising Diffusion Probabilistic Models (DDPMs) define a forward process that gradually corrupts data through many small Gaussian noise increments until it becomes nearly Gaussian, and the reverse model must therefore undo this corruption progressively – removing only a small amount of noise per step to stay close to the target distribution. Consequently, DDPMs generate samples via a multi-step reverse process <xref ref-type="bibr" rid="bib1.bibx32 bib1.bibx53 bib1.bibx12" id="paren.25"/> and, while conceptually simple, typically require hundreds of sequential denoising steps (i.e., many neural network inferences), making sampling computationally expensive. Continuous-time approaches such as flow matching learn a time-dependent velocity field and sample by integrating an ordinary differential equation (ODE) <xref ref-type="bibr" rid="bib1.bibx45 bib1.bibx43" id="paren.26"/>, often achieving comparable quality with fewer function evaluations and thus better suiting iterative modeling workflows <xref ref-type="bibr" rid="bib1.bibx14 bib1.bibx20" id="paren.27"/>. However, deploying flow matching for high-dimensional implicit structural modeling faces key challenges. Diffusion transformers typically rely on VAE-based latent diffusion for efficiency <xref ref-type="bibr" rid="bib1.bibx59 bib1.bibx55 bib1.bibx39" id="paren.28"/>, yet robust pretrained VAEs are scarce in geophysics. Moreover, geological priors and spatial data are harder to impose and interpret in latent space than in data space <xref ref-type="bibr" rid="bib1.bibx19" id="paren.29"/>. Finally, even with a VAE, noise or velocity prediction in the diffusion models makes structural conditioning indirect because most geological constraints are naturally defined on the implicit scalar field <xref ref-type="bibr" rid="bib1.bibx63" id="paren.30"/>. Recent studies suggest that directly predicting the clean sample (denoted as <inline-formula><mml:math id="M2" display="inline"><mml:mi mathvariant="bold">x</mml:mi></mml:math></inline-formula>), instead of regressing noise (<inline-formula><mml:math id="M3" display="inline"><mml:mi mathvariant="bold-italic">ϵ</mml:mi></mml:math></inline-formula>) or velocity (<inline-formula><mml:math id="M4" display="inline"><mml:mi mathvariant="bold">v</mml:mi></mml:math></inline-formula>), can improve optimization and enable large-patch ViT inference <xref ref-type="bibr" rid="bib1.bibx40" id="paren.31"/>. This reduces attention cost and can avoid VAE-based compression, while allowing priors to be imposed directly in data space.</p>
      <p id="d2e311">Motivated by these observations, we propose <bold>L</bold>atent-Compression-<bold>F</bold>ree Generative <bold>D</bold>iffusion (LFD) with Geological Priors and Geophysical Regularization for implicit structural modeling. Our method is built on three key ideas. First, we adopt an <inline-formula><mml:math id="M5" display="inline"><mml:mi mathvariant="bold">x</mml:mi></mml:math></inline-formula>-prediction formulation that directly predicts the implicit structural models in data space, which makes constraint handling more direct and supports large-patch transformer inference without requiring VAE-based latent compression (Sect. 2.1). Second, we introduce a structure-enhanced network architecture that incorporates interpreted horizons and faults at multiple network layers (Sect. 2.2), enabling these structural constraints to effectively guide the generation of the implicit structural models. Third, we design prior-guided losses derived from geological and geophysical principles to promote structural consistency in the generated models (Sect. 2.3). The trained model can be extended to higher resolutions (e.g., <inline-formula><mml:math id="M6" display="inline"><mml:mn mathvariant="normal">1024</mml:mn></mml:math></inline-formula> and <inline-formula><mml:math id="M7" display="inline"><mml:mn mathvariant="normal">2048</mml:mn></mml:math></inline-formula>) through simple adaptations, even when training is performed at <inline-formula><mml:math id="M8" display="inline"><mml:mn mathvariant="normal">512</mml:mn></mml:math></inline-formula> resolution. Extensive experiments on synthetic data and real surveys with complex faulting demonstrate that our approach produces more geologically consistent implicit structural models, offering new insights into applying diffusion-based generative modeling to implicit structural modeling (Sect. 3).</p>
</sec>
<sec id="Ch1.S2">
  <label>2</label><title>Method</title>
      <p id="d2e360">This section first reviews the fundamentals of flow-based diffusion models and introduces the <inline-formula><mml:math id="M9" display="inline"><mml:mi mathvariant="bold">x</mml:mi></mml:math></inline-formula>-prediction (denoised-sample prediction) formulation adopted in this work. We then present the denoising Transformer architecture, in which interpreted horizons and faults are injected at multiple network layers to ensure that the generated implicit field remains consistent with the input structural constraints. Finally, to better capture the role of structural conditions in generation and to promote geological consistency, we design two prior-guided losses that explicitly enforce structure-consistent learning.</p>
<sec id="Ch1.S2.SS1">
  <label>2.1</label><title><inline-formula><mml:math id="M10" display="inline"><mml:mi mathvariant="bold">x</mml:mi></mml:math></inline-formula>-Prediction Diffusion</title>
      <p id="d2e384">We briefly review flow matching <xref ref-type="bibr" rid="bib1.bibx43" id="paren.32"/>, a generative diffusion framework that learns a continuous transport from a Gaussian base distribution to the data distribution <inline-formula><mml:math id="M11" display="inline"><mml:mrow><mml:mi mathvariant="bold">x</mml:mi><mml:mo>∼</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi mathvariant="normal">data</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold">x</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. The base variable is obtained by scaling a standard Gaussian, <inline-formula><mml:math id="M12" display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">ϵ</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="italic">σ</mml:mi><mml:mspace width="0.125em" linebreak="nobreak"/><mml:msub><mml:mi mathvariant="bold-italic">ϵ</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> with <inline-formula><mml:math id="M13" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">ϵ</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub><mml:mo>∼</mml:mo><mml:mi mathvariant="script">N</mml:mi><mml:mo>(</mml:mo><mml:mn mathvariant="bold">0</mml:mn><mml:mo>,</mml:mo><mml:mi mathvariant="bold">I</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, where the scalar <inline-formula><mml:math id="M14" display="inline"><mml:mrow><mml:mi mathvariant="italic">σ</mml:mi><mml:mo>&gt;</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:math></inline-formula> is referred to as the noise scale (NS), which scales the amplitude of the Gaussian noise. We construct the noisy sample <inline-formula><mml:math id="M15" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> at a randomly sampled time <inline-formula><mml:math id="M16" display="inline"><mml:mrow><mml:mi>t</mml:mi><mml:mo>∼</mml:mo><mml:mi mathvariant="script">U</mml:mi><mml:mo>(</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> using linear interpolation between the data <inline-formula><mml:math id="M17" display="inline"><mml:mi mathvariant="bold">x</mml:mi></mml:math></inline-formula> and the Gaussian noise <inline-formula><mml:math id="M18" display="inline"><mml:mi mathvariant="bold-italic">ϵ</mml:mi></mml:math></inline-formula>:

            <disp-formula id="Ch1.E1" content-type="numbered"><label>1</label><mml:math id="M19" display="block"><mml:mrow><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi>t</mml:mi><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi mathvariant="bold">x</mml:mi><mml:mo>+</mml:mo><mml:mo>(</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>-</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi mathvariant="bold-italic">ϵ</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

          where <inline-formula><mml:math id="M20" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mi mathvariant="bold-italic">ϵ</mml:mi></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M21" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mi mathvariant="bold">x</mml:mi></mml:mrow></mml:math></inline-formula>. Written out, this gives <inline-formula><mml:math id="M22" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi>t</mml:mi><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi mathvariant="bold">x</mml:mi><mml:mo>+</mml:mo><mml:mo>(</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>-</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mi mathvariant="italic">σ</mml:mi><mml:mspace width="0.125em" linebreak="nobreak"/><mml:msub><mml:mi mathvariant="bold-italic">ϵ</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>. The same value of <inline-formula><mml:math id="M23" display="inline"><mml:mi mathvariant="italic">σ</mml:mi></mml:math></inline-formula> is used at training and inference time. Unless stated otherwise, we use <inline-formula><mml:math id="M24" display="inline"><mml:mrow><mml:mi mathvariant="italic">σ</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0.2</mml:mn></mml:mrow></mml:math></inline-formula> throughout this paper; the motivation for this choice is discussed in Sect. <xref ref-type="sec" rid="Ch1.S4"/>. With the linear interpolation path, the target velocity along this path is constant:

            <disp-formula id="Ch1.E2" content-type="numbered"><label>2</label><mml:math id="M25" display="block"><mml:mrow><mml:mi mathvariant="bold">v</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:mo>∂</mml:mo><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mo>∂</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>=</mml:mo><mml:mi mathvariant="bold">x</mml:mi><mml:mo>-</mml:mo><mml:mi mathvariant="bold-italic">ϵ</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

          Flow-based methods train a neural network <inline-formula><mml:math id="M26" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi mathvariant="italic">θ</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> to estimate the velocity field, denoted by <inline-formula><mml:math id="M27" display="inline"><mml:mover accent="true"><mml:mi mathvariant="bold">v</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover></mml:math></inline-formula>, where the network takes the time <inline-formula><mml:math id="M28" display="inline"><mml:mi>t</mml:mi></mml:math></inline-formula> and the corresponding noisy sample <inline-formula><mml:math id="M29" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> as inputs:

            <disp-formula id="Ch1.E3" content-type="numbered"><label>3</label><mml:math id="M30" display="block"><mml:mrow><mml:mover accent="true"><mml:mi mathvariant="bold">v</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mi mathvariant="italic">θ</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

          The model is optimized by matching <inline-formula><mml:math id="M31" display="inline"><mml:mover accent="true"><mml:mi mathvariant="bold">v</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover></mml:math></inline-formula> to <inline-formula><mml:math id="M32" display="inline"><mml:mi mathvariant="bold">v</mml:mi></mml:math></inline-formula>:

            <disp-formula id="Ch1.E4" content-type="numbered"><label>4</label><mml:math id="M33" display="block"><mml:mrow><mml:msub><mml:mi mathvariant="script">L</mml:mi><mml:mi mathvariant="bold">v</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi mathvariant="double-struck">E</mml:mi><mml:mrow><mml:mi mathvariant="bold">x</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="bold-italic">ϵ</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mfenced open="[" close="]"><mml:mrow><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:msubsup><mml:mfenced close="∥" open="∥"><mml:mrow><mml:mover accent="true"><mml:mi mathvariant="bold">v</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:mo>-</mml:mo><mml:mi mathvariant="bold">v</mml:mi></mml:mrow></mml:mfenced><mml:mn mathvariant="normal">2</mml:mn><mml:mn mathvariant="normal">2</mml:mn></mml:msubsup></mml:mrow></mml:mfenced><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

          <inline-formula><mml:math id="M34" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="script">L</mml:mi><mml:mi mathvariant="bold">v</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> minimizes the discrepancy between the target velocity field <inline-formula><mml:math id="M35" display="inline"><mml:mi mathvariant="bold">v</mml:mi></mml:math></inline-formula> and its prediction <inline-formula><mml:math id="M36" display="inline"><mml:mover accent="true"><mml:mi mathvariant="bold">v</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover></mml:math></inline-formula> via an element-wise mean-squared error over the <inline-formula><mml:math id="M37" display="inline"><mml:mi>N</mml:mi></mml:math></inline-formula> pixels of the field, and the expectation is taken over training samples <inline-formula><mml:math id="M38" display="inline"><mml:mi mathvariant="bold">x</mml:mi></mml:math></inline-formula>, Gaussian noise <inline-formula><mml:math id="M39" display="inline"><mml:mi mathvariant="bold-italic">ϵ</mml:mi></mml:math></inline-formula>, and randomly sampled times <inline-formula><mml:math id="M40" display="inline"><mml:mi>t</mml:mi></mml:math></inline-formula>. We refer to it as the <inline-formula><mml:math id="M41" display="inline"><mml:mi>v</mml:mi></mml:math></inline-formula>-loss.</p>
      <p id="d2e885">At inference, we start from a Gaussian sample <inline-formula><mml:math id="M42" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mi mathvariant="italic">σ</mml:mi><mml:mspace width="0.125em" linebreak="nobreak"/><mml:msub><mml:mi mathvariant="bold-italic">ϵ</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> at <inline-formula><mml:math id="M43" display="inline"><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:math></inline-formula>. We then generate a sample by integrating the learned probability-flow ODE from <inline-formula><mml:math id="M44" display="inline"><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:math></inline-formula> to <inline-formula><mml:math id="M45" display="inline"><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>. In practice, we discretize the time interval <inline-formula><mml:math id="M46" display="inline"><mml:mrow><mml:mo>[</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> into <inline-formula><mml:math id="M47" display="inline"><mml:mi>K</mml:mi></mml:math></inline-formula> uniform steps, <inline-formula><mml:math id="M48" display="inline"><mml:mrow><mml:mo mathvariant="italic">{</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:msubsup><mml:mo mathvariant="italic">}</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow><mml:mi>K</mml:mi></mml:msubsup></mml:mrow></mml:math></inline-formula>, with <inline-formula><mml:math id="M49" display="inline"><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi>k</mml:mi><mml:mo>/</mml:mo><mml:mi>K</mml:mi></mml:mrow></mml:math></inline-formula> (thus <inline-formula><mml:math id="M50" display="inline"><mml:mrow><mml:mi mathvariant="normal">Δ</mml:mi><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>/</mml:mo><mml:mi>K</mml:mi></mml:mrow></mml:math></inline-formula>), and evaluate the network to obtain the velocity field.

            <disp-formula id="Ch1.E5" content-type="numbered"><label>5</label><mml:math id="M51" display="block"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi mathvariant="bold">v</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:mi>k</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mi mathvariant="italic">θ</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>)</mml:mo><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

          An explicit solver updates the state as

            <disp-formula id="Ch1.E6" content-type="numbered"><label>6</label><mml:math id="M52" display="block"><mml:mrow><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi mathvariant="normal">Δ</mml:mi><mml:mi>t</mml:mi><mml:mspace linebreak="nobreak" width="0.125em"/><mml:msub><mml:mover accent="true"><mml:mi mathvariant="bold">v</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:mi>k</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mspace width="1em" linebreak="nobreak"/><mml:mi mathvariant="normal">Δ</mml:mi><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

          and the final generated sample is obtained at <inline-formula><mml:math id="M53" display="inline"><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula> as <inline-formula><mml:math id="M54" display="inline"><mml:mrow><mml:mover accent="true"><mml:mi mathvariant="bold">x</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:mo>≡</mml:mo><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mi>K</mml:mi></mml:msub></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>. In practice, flow-based sampling typically requires only tens of ODE steps to reach good sample quality (e.g. <inline-formula><mml:math id="M55" display="inline"><mml:mrow><mml:mi>K</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">50</mml:mn></mml:mrow></mml:math></inline-formula>), which is substantially fewer than the hundreds to thousands of steps often used in DDPM sampling <xref ref-type="bibr" rid="bib1.bibx76" id="paren.33"/>.</p>
      <p id="d2e1218">Learning an accurate velocity field in high-dimensional spaces is challenging for denoisers such as Diffusion Transformers (DiTs) <xref ref-type="bibr" rid="bib1.bibx55" id="paren.34"/>, often leading to unstable training and reduced sampling efficiency at higher resolutions. As a result, <inline-formula><mml:math id="M56" display="inline"><mml:mi>v</mml:mi></mml:math></inline-formula>-prediction models typically use very small square patches (e.g., <inline-formula><mml:math id="M57" display="inline"><mml:mrow><mml:mn mathvariant="normal">2</mml:mn><mml:mo>×</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M58" display="inline"><mml:mrow><mml:mn mathvariant="normal">4</mml:mn><mml:mo>×</mml:mo><mml:mn mathvariant="normal">4</mml:mn></mml:mrow></mml:math></inline-formula>, or <inline-formula><mml:math id="M59" display="inline"><mml:mrow><mml:mn mathvariant="normal">8</mml:mn><mml:mo>×</mml:mo><mml:mn mathvariant="normal">8</mml:mn></mml:mrow></mml:math></inline-formula>), which greatly increases token length and attention cost for high-dimensional data <xref ref-type="bibr" rid="bib1.bibx47" id="paren.35"/>. Most diffusion transformers therefore resort to VAE-based latent diffusion to reduce computation, but this is less appealing for implicit structural models because it may compromise fine structural details and makes it harder to explicitly impose geological priors in the latent space.</p>

      <fig id="F1" specific-use="star"><label>Figure 1</label><caption><p id="d2e1274">Overview of LFD for implicit structural modeling. Top: Training stage. We sample Gaussian noise <inline-formula><mml:math id="M60" display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">ϵ</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="italic">σ</mml:mi><mml:msub><mml:mi mathvariant="bold-italic">ϵ</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> with noise scale <inline-formula><mml:math id="M61" display="inline"><mml:mrow><mml:mi mathvariant="italic">σ</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0.2</mml:mn></mml:mrow></mml:math></inline-formula> and time <inline-formula><mml:math id="M62" display="inline"><mml:mi>t</mml:mi></mml:math></inline-formula>, construct <inline-formula><mml:math id="M63" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi>t</mml:mi><mml:mi mathvariant="bold">x</mml:mi><mml:mo>+</mml:mo><mml:mo>(</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>-</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo><mml:mi mathvariant="bold-italic">ϵ</mml:mi></mml:mrow></mml:math></inline-formula>, and use a structure-enhanced Transformer conditioned on horizons and faults to predict the clean implicit scalar field <inline-formula><mml:math id="M64" display="inline"><mml:mover accent="true"><mml:mi mathvariant="bold">x</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover></mml:math></inline-formula>. Bottom: Inference stage. Starting from <inline-formula><mml:math id="M65" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mi mathvariant="bold-italic">ϵ</mml:mi></mml:mrow></mml:math></inline-formula>, we iteratively integrate the probability-flow ODE using <inline-formula><mml:math id="M66" display="inline"><mml:mover accent="true"><mml:mi mathvariant="bold">x</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover></mml:math></inline-formula> to obtain <inline-formula><mml:math id="M67" display="inline"><mml:mover accent="true"><mml:mi mathvariant="bold">v</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover></mml:math></inline-formula> and generate the final implicit structural model. Note that the implicit scalar field is a continuous-valued output, the colormap visualizations shown here use discrete color bins solely for display purposes.</p></caption>
          <graphic xlink:href="https://gmd.copernicus.org/articles/19/7961/2026/gmd-19-7961-2026-f01.png"/>

        </fig>

      <p id="d2e1396">In contrast, clean samples usually lie on a lower-dimensional manifold <xref ref-type="bibr" rid="bib1.bibx10" id="paren.36"/>, making it easier and more stable to predict the clean signal directly than to regress the velocity field. Recent studies <xref ref-type="bibr" rid="bib1.bibx40" id="paren.37"/> have demonstrated that directly predicting the clean data <inline-formula><mml:math id="M68" display="inline"><mml:mi mathvariant="bold">x</mml:mi></mml:math></inline-formula> combined with the <inline-formula><mml:math id="M69" display="inline"><mml:mi>v</mml:mi></mml:math></inline-formula>-loss leads to more stable optimization and better sample quality. In this setting, the network no longer predicts the velocity field <inline-formula><mml:math id="M70" display="inline"><mml:mi mathvariant="bold">v</mml:mi></mml:math></inline-formula>; instead, it directly predicts the clean sample <inline-formula><mml:math id="M71" display="inline"><mml:mover accent="true"><mml:mi mathvariant="bold">x</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover></mml:math></inline-formula> (as shown in Fig. <xref ref-type="fig" rid="F1"/>):

            <disp-formula id="Ch1.E7" content-type="numbered"><label>7</label><mml:math id="M72" display="block"><mml:mrow><mml:mover accent="true"><mml:mi mathvariant="bold">x</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mi mathvariant="italic">θ</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="bold">cond</mml:mi><mml:mo>)</mml:mo><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

          where <inline-formula><mml:math id="M73" display="inline"><mml:mi mathvariant="bold">cond</mml:mi></mml:math></inline-formula> denotes the additional conditioning information. In our implicit structural modeling task, <inline-formula><mml:math id="M74" display="inline"><mml:mi mathvariant="bold">cond</mml:mi></mml:math></inline-formula> specifically represents the input horizons and faults. Consequently, the predicted velocity field <inline-formula><mml:math id="M75" display="inline"><mml:mover accent="true"><mml:mi mathvariant="bold">v</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover></mml:math></inline-formula> can be obtained from <inline-formula><mml:math id="M76" display="inline"><mml:mover accent="true"><mml:mi mathvariant="bold">x</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover></mml:math></inline-formula> by differentiating the interpolation path in Eq. (<xref ref-type="disp-formula" rid="Ch1.E1"/>):

            <disp-formula id="Ch1.E8" content-type="numbered"><label>8</label><mml:math id="M77" display="block"><mml:mrow><mml:mover accent="true"><mml:mi mathvariant="bold">v</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold">x</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:mo>-</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:mi>t</mml:mi><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mover accent="true"><mml:mi mathvariant="bold">x</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mn mathvariant="normal">1</mml:mn><mml:mo>-</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:mover accent="true"><mml:mi mathvariant="bold">x</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:mo>-</mml:mo><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mn mathvariant="normal">1</mml:mn><mml:mo>-</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:mfrac></mml:mstyle></mml:mrow></mml:math></disp-formula>

          Based on Eq. (<xref ref-type="disp-formula" rid="Ch1.E2"/>), we can still compute the <inline-formula><mml:math id="M78" display="inline"><mml:mi>v</mml:mi></mml:math></inline-formula>-loss in Eq. (<xref ref-type="disp-formula" rid="Ch1.E4"/>) for this velocity estimate. This is the <inline-formula><mml:math id="M79" display="inline"><mml:mi mathvariant="bold">x</mml:mi></mml:math></inline-formula>-prediction diffusion formulation adopted in this work. We next introduce the denoising network used in this diffusion framework, which further strengthens structural guidance through explicit conditioning.</p>
</sec>
<sec id="Ch1.S2.SS2">
  <label>2.2</label><title>Structure-Enhanced Denoising Transformer</title>
      <p id="d2e1609">We adopt a standard Vision Transformer (ViT) backbone as the denoising network <inline-formula><mml:math id="M80" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi mathvariant="italic">θ</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> <xref ref-type="bibr" rid="bib1.bibx55" id="paren.38"/>. Since predicting a clean sample on a low-dimensional data manifold is generally easier than regressing the velocity field <xref ref-type="bibr" rid="bib1.bibx37" id="paren.39"/>, larger patch sizes can be used without sacrificing training stability. In this work, we employ ViT-Base/32 as the backbone, which provides a good trade-off between generation quality and efficiency.</p>
      <p id="d2e1629">Let <inline-formula><mml:math id="M81" display="inline"><mml:mrow><mml:mi>P</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">32</mml:mn></mml:mrow></mml:math></inline-formula> be the patch size and <inline-formula><mml:math id="M82" display="inline"><mml:mrow><mml:mi>N</mml:mi><mml:mo>=</mml:mo><mml:mfenced open="(" close=")"><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mi>H</mml:mi><mml:mi>P</mml:mi></mml:mfrac></mml:mstyle></mml:mfenced><mml:mo>×</mml:mo><mml:mfenced close=")" open="("><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mi>W</mml:mi><mml:mi>P</mml:mi></mml:mfrac></mml:mstyle></mml:mfenced></mml:mrow></mml:math></inline-formula> the number of patches. We tokenize <inline-formula><mml:math id="M83" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> into a sequence of patch tokens using a bottleneck patch embedding <xref ref-type="bibr" rid="bib1.bibx1" id="paren.40"/>, which helps stabilize training:

            <disp-formula id="Ch1.E9" content-type="numbered"><label>9</label><mml:math id="M84" display="block"><mml:mtable class="split" rowspacing="0.2ex" displaystyle="true" columnalign="right left"><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mi mathvariant="bold">x</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mi mathvariant="bold">x</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>)</mml:mo><mml:mo>∈</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mrow><mml:mi>N</mml:mi><mml:mo>×</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mi mathvariant="bold">x</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mo>⋅</mml:mo><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi mathvariant="normal">Conv</mml:mi><mml:mrow><mml:mn mathvariant="normal">1</mml:mn><mml:mo>×</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msub><mml:mo mathsize="1.1em">(</mml:mo><mml:msub><mml:mi mathvariant="normal">Conv</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mo>×</mml:mo><mml:mi>P</mml:mi></mml:mrow></mml:msub><mml:mo>(</mml:mo><mml:mo>⋅</mml:mo><mml:mo>)</mml:mo><mml:mo mathsize="1.1em">)</mml:mo><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>

          where <inline-formula><mml:math id="M85" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="normal">Conv</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mo>×</mml:mo><mml:mi>P</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> denotes a 2D convolution with kernel size <inline-formula><mml:math id="M86" display="inline"><mml:mrow><mml:mi>P</mml:mi><mml:mo>×</mml:mo><mml:mi>P</mml:mi></mml:mrow></mml:math></inline-formula> and stride <inline-formula><mml:math id="M87" display="inline"><mml:mi>P</mml:mi></mml:math></inline-formula> (thus extracting non-overlapping patch features), and <inline-formula><mml:math id="M88" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="normal">Conv</mml:mi><mml:mrow><mml:mn mathvariant="normal">1</mml:mn><mml:mo>×</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> denotes a <inline-formula><mml:math id="M89" display="inline"><mml:mrow><mml:mn mathvariant="normal">1</mml:mn><mml:mo>×</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula> convolution that linearly projects the bottleneck features to the ViT hidden dimension <inline-formula><mml:math id="M90" display="inline"><mml:mi>d</mml:mi></mml:math></inline-formula>.</p>
      <p id="d2e1850">We encode horizons and faults using two separate bottleneck embedding modules. Denote the horizon input by <inline-formula><mml:math id="M91" display="inline"><mml:mi mathvariant="bold">h</mml:mi></mml:math></inline-formula> and the fault input by <inline-formula><mml:math id="M92" display="inline"><mml:mi mathvariant="bold">f</mml:mi></mml:math></inline-formula>. Their token embeddings are

            <disp-formula id="Ch1.E10" content-type="numbered"><label>10</label><mml:math id="M93" display="block"><mml:mrow><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mi mathvariant="bold">h</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mi mathvariant="bold">h</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold">h</mml:mi><mml:mo>)</mml:mo><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="1em"/><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mi mathvariant="bold">f</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mi mathvariant="bold">f</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold">f</mml:mi><mml:mo>)</mml:mo><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

          where <inline-formula><mml:math id="M94" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mi mathvariant="bold">h</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mo>⋅</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M95" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mi mathvariant="bold">f</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mo>⋅</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> have the same bottleneck architecture as <inline-formula><mml:math id="M96" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mi mathvariant="bold">x</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mo>⋅</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> but are parameterized independently. For positional encoding of ViTs, we use sine–cosine embeddings to provide a stable global reference and rotary position embedding (RoPE) <xref ref-type="bibr" rid="bib1.bibx64" id="paren.41"/> to improve relative position modeling, which improves generalization to varying input sizes <xref ref-type="bibr" rid="bib1.bibx28" id="paren.42"/>.</p>
      <p id="d2e1973">We fuse the noisy tokens with structural tokens by element-wise addition, a common token-fusion strategy in Transformers that combines multiple embeddings while keeping the token dimension and sequence length unchanged <xref ref-type="bibr" rid="bib1.bibx55" id="paren.43"/>:

            <disp-formula id="Ch1.E11" content-type="numbered"><label>11</label><mml:math id="M97" display="block"><mml:mrow><mml:msup><mml:mi mathvariant="bold">z</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mi mathvariant="bold">x</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mi mathvariant="bold">h</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mi mathvariant="bold">f</mml:mi></mml:msub><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

          where <inline-formula><mml:math id="M98" display="inline"><mml:mrow><mml:msup><mml:mi mathvariant="bold">z</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:msup><mml:mo>∈</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mrow><mml:mi>N</mml:mi><mml:mo>×</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> denotes the fused token sequence at the input of the Transformer.</p>
      <p id="d2e2047">Beyond the input-level fusion, we further strengthen structural guidance by injecting horizon and fault embeddings into each Transformer layer as residual priors. Specifically, given the intermediate tokens <inline-formula><mml:math id="M99" display="inline"><mml:mrow><mml:msup><mml:mi mathvariant="bold">z</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="normal">ℓ</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula>, we form a structure-enhanced representation by

            <disp-formula id="Ch1.E12" content-type="numbered"><label>12</label><mml:math id="M100" display="block"><mml:mrow><mml:msup><mml:mover accent="true"><mml:mi mathvariant="bold">z</mml:mi><mml:mo mathvariant="normal" stretchy="false">̃</mml:mo></mml:mover><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="normal">ℓ</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:msup><mml:mi mathvariant="bold">z</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="normal">ℓ</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msub><mml:mi mathvariant="italic">α</mml:mi><mml:mi mathvariant="normal">ℓ</mml:mi></mml:msub><mml:mspace linebreak="nobreak" width="0.125em"/><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mi mathvariant="bold">h</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi mathvariant="italic">β</mml:mi><mml:mi mathvariant="normal">ℓ</mml:mi></mml:msub><mml:mspace linebreak="nobreak" width="0.125em"/><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mi mathvariant="bold">f</mml:mi></mml:msub><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

          where <inline-formula><mml:math id="M101" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">α</mml:mi><mml:mi mathvariant="normal">ℓ</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M102" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">β</mml:mi><mml:mi mathvariant="normal">ℓ</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> are learnable, layer-adaptive weights that control how strongly each layer uses horizon and fault priors. Finally, we obtain <inline-formula><mml:math id="M103" display="inline"><mml:mover accent="true"><mml:mi mathvariant="bold">x</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover></mml:math></inline-formula> using Eq. (<xref ref-type="disp-formula" rid="Ch1.E7"/>) with <inline-formula><mml:math id="M104" display="inline"><mml:mrow><mml:mi mathvariant="bold">cond</mml:mi><mml:mo>=</mml:mo><mml:mo>(</mml:mo><mml:mi mathvariant="bold">h</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="bold">f</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, where the residual injections encourage structure-consistent denoising across layers.</p>
      <p id="d2e2181">To further strengthen the role of the input structural constraints in guiding generation, we next introduce prior-guided loss terms designed directly in the data space.</p>
</sec>
<sec id="Ch1.S2.SS3">
  <label>2.3</label><title>Prior-Guided Losses</title>
      <p id="d2e2192">As the model directly predicts the clean data <inline-formula><mml:math id="M105" display="inline"><mml:mover accent="true"><mml:mi mathvariant="bold">x</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover></mml:math></inline-formula>, geological observations and prior constraints can be imposed in a straightforward and differentiable manner. We introduce two prior-guided terms, a horizon loss <inline-formula><mml:math id="M106" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="script">L</mml:mi><mml:mi mathvariant="normal">Hrz</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and a fault-aware bending-energy regularizer <inline-formula><mml:math id="M107" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="script">L</mml:mi><mml:mi mathvariant="normal">Bend</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, to enforce consistency with the input horizons while promoting smoothness within stratigraphic blocks without smoothing across faults.</p>
      <p id="d2e2227">The implicit structural model is required to align with the input horizons. Let <inline-formula><mml:math id="M108" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold">M</mml:mi><mml:mi mathvariant="bold">h</mml:mi></mml:msub><mml:mo>∈</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:msup><mml:mo mathvariant="italic">}</mml:mo><mml:mrow><mml:mi>H</mml:mi><mml:mo>×</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> be a binary mask derived from the input horizon data, indicating horizon locations. We penalize deviations on the horizon by the mean absolute error normalized by the summed target magnitude:

            <disp-formula id="Ch1.E13" content-type="numbered"><label>13</label><mml:math id="M109" display="block"><mml:mrow><mml:msub><mml:mi mathvariant="script">L</mml:mi><mml:mi mathvariant="normal">Hrz</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:msub><mml:mfenced close="∥" open="∥"><mml:mrow><mml:msub><mml:mi mathvariant="bold">M</mml:mi><mml:mi mathvariant="bold">h</mml:mi></mml:msub><mml:mo>⊙</mml:mo><mml:mfenced close=")" open="("><mml:mrow><mml:mover accent="true"><mml:mi mathvariant="bold">x</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:mo>-</mml:mo><mml:mi mathvariant="bold">x</mml:mi></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mfenced close="∥" open="∥"><mml:mrow><mml:msub><mml:mi mathvariant="bold">M</mml:mi><mml:mi mathvariant="bold">h</mml:mi></mml:msub><mml:mo>⊙</mml:mo><mml:mi mathvariant="bold">x</mml:mi></mml:mrow></mml:mfenced><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:mi>c</mml:mi></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

          where <inline-formula><mml:math id="M110" display="inline"><mml:mo>⊙</mml:mo></mml:math></inline-formula> denotes element-wise multiplication and <inline-formula><mml:math id="M111" display="inline"><mml:mi>c</mml:mi></mml:math></inline-formula> is a small constant. This normalization reduces sensitivity to the absolute scale of implicit structural model values.</p>
      <p id="d2e2335">Additionally, implicit structural models are expected to form a globally smooth field, and horizons should not exhibit excessive curvature in a geologically reasonable interpretation. We therefore introduce a bending-energy regularizer <xref ref-type="bibr" rid="bib1.bibx58 bib1.bibx3" id="paren.44"/> that penalizes second-order variations of the predicted implicit scalar field. Importantly, this smoothness prior should not be enforced across faults, since faults correspond to discontinuities. To honour fault discontinuities, we compute the bending energy only on the non-fault region and use fault-aware finite-difference stencils that do not cross fault pixels.</p>
      <p id="d2e2341">Let <inline-formula><mml:math id="M112" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold">M</mml:mi><mml:mi mathvariant="bold">f</mml:mi></mml:msub><mml:mo>∈</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:msup><mml:mo mathvariant="italic">}</mml:mo><mml:mrow><mml:mi>H</mml:mi><mml:mo>×</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> denote the input fault mask, and define the fault domain <inline-formula><mml:math id="M113" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi mathvariant="normal">Faults</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo><mml:mo>|</mml:mo><mml:msub><mml:mi mathvariant="bold">M</mml:mi><mml:mi mathvariant="bold">f</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo mathvariant="italic">}</mml:mo></mml:mrow></mml:math></inline-formula>. The fault-aware bending-energy loss is defined as

            <disp-formula id="Ch1.E14" content-type="numbered"><label>14</label><mml:math id="M114" display="block"><mml:mtable class="split" rowspacing="0.2ex" displaystyle="true" columnalign="right left"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="script">L</mml:mi><mml:mi mathvariant="normal">Bend</mml:mi></mml:msub><mml:mo>=</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi mathvariant="normal">E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo><mml:mo>∉</mml:mo><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi mathvariant="normal">Faults</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mfenced open="[" close=""><mml:mrow><mml:msup><mml:mfenced close=")" open="("><mml:mrow><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">1</mml:mn><mml:mrow><mml:mi mathvariant="normal">Δ</mml:mi><mml:msup><mml:mi>i</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msup></mml:mrow></mml:mfrac></mml:mstyle><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:msup><mml:mo>∂</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:msup><mml:mover accent="true"><mml:mi mathvariant="bold">x</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo>∂</mml:mo><mml:msup><mml:mi>i</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msup></mml:mrow></mml:mfrac></mml:mstyle></mml:mrow></mml:mfenced><mml:mn mathvariant="normal">2</mml:mn></mml:msup></mml:mrow></mml:mfenced></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mfenced open="" close="]"><mml:mrow><mml:mo>+</mml:mo><mml:mn mathvariant="normal">2</mml:mn><mml:msup><mml:mfenced close=")" open="("><mml:mrow><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">1</mml:mn><mml:mrow><mml:mi mathvariant="normal">Δ</mml:mi><mml:mi>i</mml:mi><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi mathvariant="normal">Δ</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:mfrac></mml:mstyle><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:msup><mml:mo>∂</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:msup><mml:mover accent="true"><mml:mi mathvariant="bold">x</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo>∂</mml:mo><mml:mi>i</mml:mi><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mo>∂</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:mfrac></mml:mstyle></mml:mrow></mml:mfenced><mml:mn mathvariant="normal">2</mml:mn></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mfenced close=")" open="("><mml:mrow><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">1</mml:mn><mml:mrow><mml:mi mathvariant="normal">Δ</mml:mi><mml:msup><mml:mi>j</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msup></mml:mrow></mml:mfrac></mml:mstyle><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:msup><mml:mo>∂</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:msup><mml:mover accent="true"><mml:mi mathvariant="bold">x</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo>∂</mml:mo><mml:msup><mml:mi>j</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msup></mml:mrow></mml:mfrac></mml:mstyle></mml:mrow></mml:mfenced><mml:mn mathvariant="normal">2</mml:mn></mml:msup></mml:mrow></mml:mfenced><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
      <p id="d2e2598">where <inline-formula><mml:math id="M115" display="inline"><mml:mrow><mml:mi mathvariant="normal">Δ</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M116" display="inline"><mml:mrow><mml:mi mathvariant="normal">Δ</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:math></inline-formula> denote the grid spacing in the <inline-formula><mml:math id="M117" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>- and <inline-formula><mml:math id="M118" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula>-directions, respectively, and the second-order derivatives are implemented with fault-aware discrete operators that ignore stencils crossing fault pixels. Specifically, for each second-order derivative term, we adopt a stencil-validity masking strategy: the curvature contribution at a given location is computed only if all sampling points involved in the corresponding standard central-difference stencil lie in the non-fault region; if any point of the stencil falls on a fault pixel, the curvature term at that location is set to zero rather than being approximated with a lower-order one-sided or truncated scheme. As a result, the accuracy of the stencil itself does not vary near fault boundaries. The final training objective combines the flow matching loss with the prior-guided losses:

            <disp-formula id="Ch1.E15" content-type="numbered"><label>15</label><mml:math id="M119" display="block"><mml:mrow><mml:mi mathvariant="script">L</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi mathvariant="script">L</mml:mi><mml:mi mathvariant="bold">v</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mi mathvariant="normal">Hrz</mml:mi></mml:msub><mml:msub><mml:mi mathvariant="script">L</mml:mi><mml:mi mathvariant="normal">Hrz</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mi mathvariant="normal">Bend</mml:mi></mml:msub><mml:msub><mml:mi mathvariant="script">L</mml:mi><mml:mi mathvariant="normal">Bend</mml:mi></mml:msub><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

          where <inline-formula><mml:math id="M120" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mi mathvariant="normal">Hrz</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M121" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mi mathvariant="normal">Bend</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> are weighting factors used to balance the relative magnitudes of different loss terms during training. In practice, we set <inline-formula><mml:math id="M122" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mi mathvariant="normal">Hrz</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">10</mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M123" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mi mathvariant="normal">Bend</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0.1</mml:mn></mml:mrow></mml:math></inline-formula> to keep <inline-formula><mml:math id="M124" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="script">L</mml:mi><mml:mi mathvariant="bold">v</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M125" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="script">L</mml:mi><mml:mi mathvariant="normal">Hrz</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math id="M126" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="script">L</mml:mi><mml:mi mathvariant="normal">Bend</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> on comparable scales throughout training, thereby avoiding any single term dominating the gradients and ensuring stable optimization.</p>
      <p id="d2e2764">These design choices define the overall LFD framework, combining <inline-formula><mml:math id="M127" display="inline"><mml:mi mathvariant="bold">x</mml:mi></mml:math></inline-formula>-prediction with the <inline-formula><mml:math id="M128" display="inline"><mml:mi>v</mml:mi></mml:math></inline-formula>-loss, structure-enhanced denoising transformers, and data-space prior-guided regularization. In the following, we evaluate its effectiveness on synthetic data and challenging field examples.</p>
</sec>
</sec>
<sec id="Ch1.S3">
  <label>3</label><title>Experiments</title>
<sec id="Ch1.S3.SS1">
  <label>3.1</label><title>Data Preparation</title>
      <p id="d2e2797">To train and validate our conditional generative diffusion model for implicit structural modeling, we construct a large synthetic dataset in two stages: (i) geology-informed 3D structural simulation and (ii) conversion to 2D conditional training pairs (as shown in Fig. <xref ref-type="fig" rid="F2"/>).</p>

      <fig id="F2"><label>Figure 2</label><caption><p id="d2e2804">Synthetic dataset examples used for training, testing, and conditional generation. Top: representative samples from the training set (left) and test set (right). Bottom: conditional generations from LFD.</p></caption>
          <graphic xlink:href="https://gmd.copernicus.org/articles/19/7961/2026/gmd-19-7961-2026-f02.png"/>

        </fig>

      <p id="d2e2813">First, we generate realistic 3D implicit structural models using a simulation workflow in the spirit of <xref ref-type="bibr" rid="bib1.bibx70" id="text.45"/>. Folding deformation is created by superposing multiple parameterized Gaussian functions, with key parameters randomly sampled to cover a wide range of fold wavelengths, amplitudes, and asymmetries. We then introduce geologically plausible faulting by constructing 3D fault surfaces, assembling fault networks (fault assemblages), and simulating 3D slip distributions between the hanging wall and footwall. Building on the resulting folded–faulted framework, we further incorporate unconformities and associated stratal termination patterns (e.g., onlap, downlap, toplap, and related terminations). This procedure yields 3000 realistic 3D implicit structural models at <inline-formula><mml:math id="M129" display="inline"><mml:mrow><mml:mn mathvariant="normal">512</mml:mn><mml:mo>×</mml:mo><mml:mn mathvariant="normal">512</mml:mn><mml:mo>×</mml:mo><mml:mn mathvariant="normal">512</mml:mn></mml:mrow></mml:math></inline-formula> resolution, each paired with a full-volume 3D fault mask. The combination of explicit fold/fault/unconformity rules and controlled parameter randomization ensures both geological plausibility and broad structural–stratigraphic diversity across the dataset. It should be noted that the synthetic dataset is generated through a geometry-based structural simulation workflow rather than an explicit reconstruction of geological event histories. This design prioritizes structural diversity for diffusion-model training rather than reproducing specific geological evolution pathways.</p>
      <p id="d2e2836">Second, to match our 2D conditional diffusion training setup, we randomly extract <inline-formula><mml:math id="M130" display="inline"><mml:mrow><mml:mn mathvariant="normal">512</mml:mn><mml:mo>×</mml:mo><mml:mn mathvariant="normal">512</mml:mn></mml:mrow></mml:math></inline-formula> slices from the 3D volumes of implicit models and fault masks along both inline and crossline directions to increase directional variability and improve generalization. From each 2D implicit model (used as the target label (<inline-formula><mml:math id="M131" display="inline"><mml:mi mathvariant="bold">x</mml:mi></mml:math></inline-formula>)), we derive conditioning inputs in two forms: (1) the corresponding full 2D fault mask (<inline-formula><mml:math id="M132" display="inline"><mml:mi mathvariant="bold">f</mml:mi></mml:math></inline-formula>), providing complete fault-boundary conditions, and (2) sparse horizon constraints (<inline-formula><mml:math id="M133" display="inline"><mml:mi mathvariant="bold">h</mml:mi></mml:math></inline-formula>) obtained by randomly selecting between 1 and 6 relative geological time (RGT) values and extracting the corresponding iso-contours from the target implicit structural model. This strategy mimics practical interpretation scenarios where only a limited number of horizons are available as constraints <xref ref-type="bibr" rid="bib1.bibx5" id="paren.46"><named-content content-type="pre">following</named-content></xref>. These complementary conditions – global fault geometry from (<inline-formula><mml:math id="M134" display="inline"><mml:mi mathvariant="bold">f</mml:mi></mml:math></inline-formula>) and sparse stratigraphic cues from (<inline-formula><mml:math id="M135" display="inline"><mml:mi mathvariant="bold">h</mml:mi></mml:math></inline-formula>) – jointly guide the conditional diffusion model to generate structurally consistent implicit scalar fields. In total, we construct 64 000 training pairs <inline-formula><mml:math id="M136" display="inline"><mml:mrow><mml:mo mathvariant="italic">{</mml:mo><mml:mo>(</mml:mo><mml:mi mathvariant="bold">h</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="bold">f</mml:mi><mml:mo>)</mml:mo><mml:mo>,</mml:mo><mml:mi mathvariant="bold">x</mml:mi><mml:mo mathvariant="italic">}</mml:mo></mml:mrow></mml:math></inline-formula>, and normalize both inputs and target implicit fields to <inline-formula><mml:math id="M137" display="inline"><mml:mrow><mml:mo>[</mml:mo><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> to stabilize training. Throughout this paper, we visualize the continuous implicit scalar field using a discrete colormap to better reveal the stratigraphic layering.</p>
      <p id="d2e2934">For field-data evaluation, we test on several real-survey cases from <xref ref-type="bibr" rid="bib1.bibx34" id="text.47"/>, characterized by complex flower-structure faulting with associated horizon interpretations, as shown in the first two columns of Fig. <xref ref-type="fig" rid="F3"/>. We denote the five cases in Fig. <xref ref-type="fig" rid="F3"/>a–e as <italic>real-1</italic> through <italic>real-5</italic>, respectively. Since implicit scalar field values on horizons are unavailable in real surveys, we assign normalized horizon values by mapping the mean horizon depth ratio linearly to <inline-formula><mml:math id="M138" display="inline"><mml:mrow><mml:mo>[</mml:mo><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>, providing a consistent relative ordering of horizons for conditioning.</p>

      <fig id="F3"><label>Figure 3</label><caption><p id="d2e2972">Field data results on flower-structure faulting. <bold>(a–e)</bold> Five real-survey examples with progressively increasing structural complexity from <xref ref-type="bibr" rid="bib1.bibx34" id="text.48"/>. From left to right, each row shows the input fault interpretation, the input horizon constraints, the implicit structural model generated by SiT, and the result produced by our method.</p></caption>
          <graphic xlink:href="https://gmd.copernicus.org/articles/19/7961/2026/gmd-19-7961-2026-f03.png"/>

        </fig>

</sec>
<sec id="Ch1.S3.SS2">
  <label>3.2</label><title>Training Settings</title>
      <p id="d2e2995">We initialize the ViT-Base/32 backbone with pretrained weights from <xref ref-type="bibr" rid="bib1.bibx40" id="text.49"/>. We set the noise scale to 0.2 when constructing noisy samples during training, because it yields smoother implicit fields in our experiments. We discuss the impact of noise scale in Sect. <xref ref-type="sec" rid="Ch1.S4"/>. We use a learning rate of <inline-formula><mml:math id="M139" display="inline"><mml:mrow><mml:mn mathvariant="normal">5</mml:mn><mml:mo>×</mml:mo><mml:msup><mml:mn mathvariant="normal">10</mml:mn><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">5</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> with a batch size of 128 and train for 600 epochs. Training is performed on three 96 GB NVIDIA H20 GPUs and takes approximately 18 h. At inference, we discretize the ODE integration into <inline-formula><mml:math id="M140" display="inline"><mml:mrow><mml:mi>K</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">50</mml:mn></mml:mrow></mml:math></inline-formula> steps for all experiments.</p>
      <p id="d2e3033">For comparison, we implement a latent-diffusion baseline that follows the SiT <xref ref-type="bibr" rid="bib1.bibx47" id="paren.50"/> training paradigm with a pretrained VAE <xref ref-type="bibr" rid="bib1.bibx59" id="paren.51"/>. As reported in Table <xref ref-type="table" rid="T1"/>, our model (LFD) and the SiT baseline have comparable parameter counts, making the comparison fair. All models are trained under the same settings as above.</p>

<table-wrap id="T1"><label>Table 1</label><caption><p id="d2e3047">Model parameter counts. Bold indicates the smallest total parameter count.</p></caption><oasis:table frame="topbot"><oasis:tgroup cols="4">
     <oasis:colspec colnum="1" colname="col1" align="left"/>
     <oasis:colspec colnum="2" colname="col2" align="left"/>
     <oasis:colspec colnum="3" colname="col3" align="left"/>
     <oasis:colspec colnum="4" colname="col4" align="left"/>
     <oasis:thead>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1">Parameter</oasis:entry>
         <oasis:entry colname="col2">VAE</oasis:entry>
         <oasis:entry colname="col3">Diffusion</oasis:entry>
         <oasis:entry colname="col4">Total</oasis:entry>
       </oasis:row>
     </oasis:thead>
     <oasis:tbody>
       <oasis:row>
         <oasis:entry colname="col1">SiT-B/2</oasis:entry>
         <oasis:entry colname="col2">101.14 M</oasis:entry>
         <oasis:entry colname="col3">144.55 M</oasis:entry>
         <oasis:entry colname="col4">245.69 M</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">LFD (ViT-B/32)</oasis:entry>
         <oasis:entry colname="col2">–</oasis:entry>
         <oasis:entry colname="col3">145.42 M</oasis:entry>
         <oasis:entry colname="col4"><bold>145.42 M</bold></oasis:entry>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup></oasis:table></table-wrap>

</sec>
<sec id="Ch1.S3.SS3">
  <label>3.3</label><title>Evaluation Metric</title>
      <p id="d2e3124">To quantify horizon adherence on real surveys, where ground-truth implicit structural models are unavailable, we propose the <italic>Horizon Consistency Error</italic> (HCE), which measures how consistent the predicted implicit field values are along each input horizon. Let <inline-formula><mml:math id="M141" display="inline"><mml:mrow><mml:mover accent="true"><mml:mi mathvariant="bold">x</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:mo>∈</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mrow><mml:mi>H</mml:mi><mml:mo>×</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> denote the generated implicit model, and let <inline-formula><mml:math id="M142" display="inline"><mml:mrow><mml:mi mathvariant="bold">H</mml:mi><mml:mo>∈</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mi mathvariant="normal">…</mml:mi><mml:msup><mml:mo mathvariant="italic">}</mml:mo><mml:mrow><mml:mi>H</mml:mi><mml:mo>×</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> be the horizon label map, where <inline-formula><mml:math id="M143" display="inline"><mml:mrow><mml:mi mathvariant="bold">H</mml:mi><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:math></inline-formula> indicates background and <inline-formula><mml:math id="M144" display="inline"><mml:mrow><mml:mi mathvariant="bold">H</mml:mi><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:math></inline-formula> denotes the <inline-formula><mml:math id="M145" display="inline"><mml:mi>k</mml:mi></mml:math></inline-formula>th horizon. For each horizon <inline-formula><mml:math id="M146" display="inline"><mml:mrow><mml:mi>k</mml:mi><mml:mo>∈</mml:mo><mml:mi mathvariant="script">K</mml:mi><mml:mo>=</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mi>k</mml:mi><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mo>|</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mi>k</mml:mi><mml:mo>≠</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo mathvariant="italic">}</mml:mo></mml:mrow></mml:math></inline-formula>, we define the horizon support

            <disp-formula id="Ch1.E16" content-type="numbered"><label>16</label><mml:math id="M147" display="block"><mml:mrow><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo><mml:mo>|</mml:mo><mml:mi mathvariant="bold">H</mml:mi><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:mi>k</mml:mi><mml:mo mathvariant="italic">}</mml:mo><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula>

          We first compute the mean implicit value on that horizon,

            <disp-formula id="Ch1.E17" content-type="numbered"><label>17</label><mml:math id="M148" display="block"><mml:mrow><mml:msub><mml:mi mathvariant="italic">μ</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">1</mml:mn><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>|</mml:mo></mml:mrow></mml:mfrac></mml:mstyle><mml:munder><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo><mml:mo>∈</mml:mo><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:munder><mml:mover accent="true"><mml:mi mathvariant="bold">x</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

          and then measure the mean absolute deviation from this mean:

            <disp-formula id="Ch1.E18" content-type="numbered"><label>18</label><mml:math id="M149" display="block"><mml:mrow><mml:msub><mml:mi>e</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">1</mml:mn><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>|</mml:mo></mml:mrow></mml:mfrac></mml:mstyle><mml:munder><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo><mml:mo>∈</mml:mo><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:munder><mml:mfenced close="|" open="|"><mml:mrow><mml:mover accent="true"><mml:mi mathvariant="bold">x</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo><mml:mo>-</mml:mo><mml:msub><mml:mi mathvariant="italic">μ</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mfenced><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula>

          If the generated implicit field is well aligned with the <inline-formula><mml:math id="M150" display="inline"><mml:mi>k</mml:mi></mml:math></inline-formula>th horizon, <inline-formula><mml:math id="M151" display="inline"><mml:mover accent="true"><mml:mi mathvariant="bold">x</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover></mml:math></inline-formula> should be nearly constant along <inline-formula><mml:math id="M152" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, yielding <inline-formula><mml:math id="M153" display="inline"><mml:mrow><mml:msub><mml:mi>e</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>≈</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:math></inline-formula>; otherwise, <inline-formula><mml:math id="M154" display="inline"><mml:mrow><mml:msub><mml:mi>e</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> increases as <inline-formula><mml:math id="M155" display="inline"><mml:mover accent="true"><mml:mi mathvariant="bold">x</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover></mml:math></inline-formula> varies along the horizon. Finally, we aggregate the per-horizon errors using a pixel-wise normalized average:

            <disp-formula id="Ch1.E19" content-type="numbered"><label>19</label><mml:math id="M156" display="block"><mml:mrow><mml:msub><mml:mi mathvariant="script">M</mml:mi><mml:mi mathvariant="normal">HCE</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:msub><mml:mo>∑</mml:mo><mml:mi>k</mml:mi></mml:msub><mml:mo>|</mml:mo><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>|</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:msub><mml:mi>e</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mo>∑</mml:mo><mml:mi>k</mml:mi></mml:msub><mml:mo>|</mml:mo><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>|</mml:mo></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula></p>
      <p id="d2e3572">This pixel-wise normalized aggregation avoids dependence on the number and length of horizons, enabling fair comparisons across cases.</p>
</sec>
<sec id="Ch1.S3.SS4">
  <label>3.4</label><title>Results</title>
      <p id="d2e3584">Figure <xref ref-type="fig" rid="F2"/> shows representative synthetic test examples. The generated implicit models honor the input faults and horizons and produce sharp, fault-aligned discontinuities. This indicates that the structural constraints are effectively enforced during generation. By default, all results in this paper are generated using <inline-formula><mml:math id="M157" display="inline"><mml:mrow><mml:mi>K</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">50</mml:mn></mml:mrow></mml:math></inline-formula> ODE sampling steps. Benefiting from large-patch inference, generating a <inline-formula><mml:math id="M158" display="inline"><mml:mrow><mml:mn mathvariant="normal">512</mml:mn><mml:mo>×</mml:mo><mml:mn mathvariant="normal">512</mml:mn></mml:mrow></mml:math></inline-formula> implicit model under this setting requires only 1.56 s on a single NVIDIA H20 GPU (see Sect. 4 for a sensitivity analysis on the number of sampling steps). This runtime is measured with batch size 1 by generating 20 samples and reporting the average per-sample time. As summarized in Table <xref ref-type="table" rid="T2"/>, our method is faster than the SiT baseline, largely because the larger patch size reduces token length and attention cost. Moreover, SiT additionally incurs VAE encoding and decoding overhead, further widening the efficiency gap.</p>

<table-wrap id="T2"><label>Table 2</label><caption><p id="d2e3618">Inference times. Bold indicates the shortest inference time.</p></caption><oasis:table frame="topbot"><oasis:tgroup cols="5">
     <oasis:colspec colnum="1" colname="col1" align="left"/>
     <oasis:colspec colnum="2" colname="col2" align="right"/>
     <oasis:colspec colnum="3" colname="col3" align="right"/>
     <oasis:colspec colnum="4" colname="col4" align="right"/>
     <oasis:colspec colnum="5" colname="col5" align="right"/>
     <oasis:thead>
       <oasis:row>
         <oasis:entry colname="col1">Time (s)</oasis:entry>
         <oasis:entry colname="col2">VAE</oasis:entry>
         <oasis:entry colname="col3">Diffusion</oasis:entry>
         <oasis:entry colname="col4">VAE</oasis:entry>
         <oasis:entry colname="col5">Total</oasis:entry>
       </oasis:row>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1"/>
         <oasis:entry colname="col2">Enc</oasis:entry>
         <oasis:entry colname="col3"/>
         <oasis:entry colname="col4">Dec</oasis:entry>
         <oasis:entry colname="col5"/>
       </oasis:row>
     </oasis:thead>
     <oasis:tbody>
       <oasis:row>
         <oasis:entry colname="col1">SiT-B/2</oasis:entry>
         <oasis:entry colname="col2">0.95</oasis:entry>
         <oasis:entry colname="col3">1.60</oasis:entry>
         <oasis:entry colname="col4">0.07</oasis:entry>
         <oasis:entry colname="col5">2.62</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">LFD (ViT-B/32)</oasis:entry>
         <oasis:entry colname="col2">–</oasis:entry>
         <oasis:entry colname="col3"><bold>1.56</bold></oasis:entry>
         <oasis:entry colname="col4">–</oasis:entry>
         <oasis:entry colname="col5"><bold>1.56</bold></oasis:entry>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup></oasis:table></table-wrap>

      <p id="d2e3714">We further evaluate the method on five challenging real-survey cases with complex flower-structure faulting (Fig. <xref ref-type="fig" rid="F3"/>). As shown in Fig. <xref ref-type="fig" rid="F3"/>a–e, the structural complexity increases progressively from <italic>real-1</italic> to <italic>real-5</italic>, placing higher demands on both fault continuity and horizon conformity. The SiT baseline (third column in Fig. <xref ref-type="fig" rid="F3"/>) can recover the major faults, but without explicit geological priors its generated implicit models tend to drift away from the input horizons, which in turn degrades finer-scale stratigraphic features.</p>
      <p id="d2e3730">Beyond this overall trend, the visual comparisons in Fig. <xref ref-type="fig" rid="F3"/> highlight several characteristic behaviors. In Fig. <xref ref-type="fig" rid="F3"/>a, the red box shows that SiT exhibits noticeably stronger noise than our method, which may be related to the sensitivity of VAE decoding to latent perturbations that can be amplified into artifacts in the implicit field <xref ref-type="bibr" rid="bib1.bibx44" id="paren.52"/>. In Fig. <xref ref-type="fig" rid="F3"/>b, the red box reveals anomalous values in the SiT result, indicating potential instabilities in latent-space generation. Moreover, the red ellipse indicates that our method can still enforce a fault-aligned discontinuity in the implicit field even where horizon constraints are sparse, whereas SiT fails to express the fault geometry at that location. In Fig. <xref ref-type="fig" rid="F3"/>d and e, the red boxes further demonstrate that our method remains better anchored to the input horizons and produces sharper, more clearly delineated fault boundaries. We also note a challenging region in Fig. <xref ref-type="fig" rid="F3"/>e (red ellipse), where both methods deviate from the input horizons due to the presence of pronounced thrusting, making faithful recovery particularly difficult. This represents a limitation of our current approach; nevertheless, our method still achieves relatively improved horizon conformity compared with SiT in this setting.</p>
      <p id="d2e3747">The above visual comparisons are quantitatively confirmed by the error metrics given in Table <xref ref-type="table" rid="T3"/>, which show that our approach achieves better horizon consistency than SiT, consistent with Fig. <xref ref-type="fig" rid="F3"/> and highlighting the value of explicitly injecting geological priors for reliable implicit structural modeling in complex real surveys.</p>

<table-wrap id="T3"><label>Table 3</label><caption><p id="d2e3757">Values of Horizon Consistency Error (HCE) on field data shown in Fig. <xref ref-type="fig" rid="F3"/>. Bold indicates the lowest HCE value for each case.</p></caption><oasis:table frame="topbot"><oasis:tgroup cols="6">
     <oasis:colspec colnum="1" colname="col1" align="left"/>
     <oasis:colspec colnum="2" colname="col2" align="right"/>
     <oasis:colspec colnum="3" colname="col3" align="right"/>
     <oasis:colspec colnum="4" colname="col4" align="right"/>
     <oasis:colspec colnum="5" colname="col5" align="right"/>
     <oasis:colspec colnum="6" colname="col6" align="right"/>
     <oasis:thead>
       <oasis:row>
         <oasis:entry colname="col1">HCE</oasis:entry>
         <oasis:entry colname="col2">real-1</oasis:entry>
         <oasis:entry colname="col3">real-2</oasis:entry>
         <oasis:entry colname="col4">real-3</oasis:entry>
         <oasis:entry colname="col5">real-4</oasis:entry>
         <oasis:entry colname="col6">real-5</oasis:entry>
       </oasis:row>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1">(1 <inline-formula><mml:math id="M159" display="inline"><mml:mo>×</mml:mo></mml:math></inline-formula> 10<sup>−3</sup>) <inline-formula><mml:math id="M161" display="inline"><mml:mo>↓</mml:mo></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col2"/>
         <oasis:entry colname="col3"/>
         <oasis:entry colname="col4"/>
         <oasis:entry colname="col5"/>
         <oasis:entry colname="col6"/>
       </oasis:row>
     </oasis:thead>
     <oasis:tbody>
       <oasis:row>
         <oasis:entry colname="col1">SiT-B/2</oasis:entry>
         <oasis:entry colname="col2">6.17</oasis:entry>
         <oasis:entry colname="col3">6.62</oasis:entry>
         <oasis:entry colname="col4">13.41</oasis:entry>
         <oasis:entry colname="col5">16.33</oasis:entry>
         <oasis:entry colname="col6">16.42</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">LFD (ViT-B/32)</oasis:entry>
         <oasis:entry colname="col2"><bold>3.05</bold></oasis:entry>
         <oasis:entry colname="col3"><bold>3.59</bold></oasis:entry>
         <oasis:entry colname="col4"><bold>3.64</bold></oasis:entry>
         <oasis:entry colname="col5"><bold>2.97</bold></oasis:entry>
         <oasis:entry colname="col6"><bold>6.17</bold></oasis:entry>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup></oasis:table></table-wrap>

</sec>
<sec id="Ch1.S3.SS5">
  <label>3.5</label><title>Ablation Study on Uncertainty: Effects of Conditioning Sparsity and Prior-Guided Regularization Strength</title>
      <p id="d2e3908">To investigate how the number of input horizon constraints affects generation quality and realization variability, we conduct an ablation study in which the number of input horizons is systematically reduced from 6 to 4, 2, and 1 (top row in Fig. <xref ref-type="fig" rid="F4"/>). For each configuration, we generate 20 independent realizations by sampling different initial Gaussian noise fields while keeping the fault and horizon conditioning fixed, and compute the pixel-wise variance across realizations to quantify uncertainty.</p>

      <fig id="F4" specific-use="star"><label>Figure 4</label><caption><p id="d2e3915">Ablation study on horizon sparsity and realization uncertainty. Top row: input conditioning, showing the shared fault interpretation (leftmost) and horizon inputs with 6, 4, 2, and 1 horizons.  Middle row: mean implicit structural model over 20 realizations for each horizon configuration, with the reference model shown in the leftmost panel. Bottom row: pixel-wise variance across 20 realizations (leftmost panel: mean variance as a function of the number of input horizons), demonstrating that realization variance increases monotonically as horizon constraints become sparser.</p></caption>
          <graphic xlink:href="https://gmd.copernicus.org/articles/19/7961/2026/gmd-19-7961-2026-f04.png"/>

        </fig>

      <p id="d2e3924">The middle row of Fig. <xref ref-type="fig" rid="F4"/> shows the mean implicit structural models over 20 realizations generated under each sparsity level. As the number of input horizons decreases, the generated models remain geologically plausible but exhibit increasing variability in stratigraphic geometry, particularly in regions far from the remaining horizon constraints. This reflects the model's learned prior filling in the unconstrained space with a broader range of geologically consistent solutions. We note that, since these 20 realizations are generated from different initial noise samples, this also indicates that the sampled initial noise has a visible influence on the resulting structural details, with different noise samples leading to different specific realizations, while the overall outputs remain geologically plausible.</p>
      <p id="d2e3930">The bottom row of Fig. <xref ref-type="fig" rid="F4"/> shows the spatial distribution of pixel-wise variance across 20 realizations for each horizon configuration. With 6 input horizons, variance is uniformly low across the model domain, indicating that dense conditioning effectively anchors the generation. As the number of horizons is reduced to 4, 2, and finally 1, high-variance regions progressively expand, concentrating first in areas between horizons and eventually spanning the majority of the model domain. This spatial pattern is consistent with the intuition that uncertainty grows where conditioning data are absent. The mean variance plot (bottom-left panel of Fig. <xref ref-type="fig" rid="F4"/>) further confirms this trend quantitatively: mean variance increases monotonically from approximately 0.0013 (6 horizons) to 0.0073 (1 horizon), demonstrating that realization spread is directly controlled by the density of horizon constraints. Collectively, these results suggest that LFD generates a data-consistent distribution: when conditioning data are abundant, the model converges to consistent solutions; when data are sparse, the model appropriately broadens its output distribution to reflect the increased geological ambiguity, rather than collapsing to a single overconfident prediction.</p>
      <p id="d2e3937">Beyond conditioning sparsity, we further investigate how the strength of the proposed fault-aware bending-energy regularization affects the realization ensemble. For each bending-energy weight <inline-formula><mml:math id="M162" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mi mathvariant="normal">Bend</mml:mi></mml:msub><mml:mo>∈</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">0.1</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo mathvariant="italic">}</mml:mo></mml:mrow></mml:math></inline-formula> (<inline-formula><mml:math id="M163" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mi mathvariant="normal">Bend</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0.1</mml:mn></mml:mrow></mml:math></inline-formula> being the default used throughout this paper), we train a separate model under the same training settings and evaluate it on the full validation set (3200 cases). For each case, we extract the central horizon of the implicit field together with the corresponding fault mask as the conditioning input, and generate 20 realizations from different noise seeds. We report the resulting pixel-wise Mean Squared Error (MSE), the Horizon Consistency Error (HCE-6, evaluated on 6 horizons uniformly extracted from the ground-truth implicit field), and the mean realization variance, averaged over the validation set, in Table <xref ref-type="table" rid="T4"/>.</p>

<table-wrap id="T4"><label>Table 4</label><caption><p id="d2e3987">Ablation on fault-aware bending-energy weight <inline-formula><mml:math id="M164" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mi mathvariant="normal">Bend</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>.</p></caption><oasis:table frame="topbot"><oasis:tgroup cols="4">
     <oasis:colspec colnum="1" colname="col1" align="left"/>
     <oasis:colspec colnum="2" colname="col2" align="right"/>
     <oasis:colspec colnum="3" colname="col3" align="right"/>
     <oasis:colspec colnum="4" colname="col4" align="right"/>
     <oasis:thead>
       <oasis:row>
         <oasis:entry colname="col1"><inline-formula><mml:math id="M165" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mi mathvariant="normal">Bend</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col2">MSE</oasis:entry>
         <oasis:entry colname="col3">HCE-6</oasis:entry>
         <oasis:entry colname="col4">Mean Variance</oasis:entry>
       </oasis:row>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1"/>
         <oasis:entry colname="col2">(1 <inline-formula><mml:math id="M166" display="inline"><mml:mo>×</mml:mo></mml:math></inline-formula> 10<sup>−2</sup>) <inline-formula><mml:math id="M168" display="inline"><mml:mo>↓</mml:mo></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col3">(1 <inline-formula><mml:math id="M169" display="inline"><mml:mo>×</mml:mo></mml:math></inline-formula> 10<sup>−2</sup>)  <inline-formula><mml:math id="M171" display="inline"><mml:mo>↓</mml:mo></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col4">(1 <inline-formula><mml:math id="M172" display="inline"><mml:mo>×</mml:mo></mml:math></inline-formula> 10<sup>−3</sup>)</oasis:entry>
       </oasis:row>
     </oasis:thead>
     <oasis:tbody>
       <oasis:row>
         <oasis:entry colname="col1">0</oasis:entry>
         <oasis:entry colname="col2"><inline-formula><mml:math id="M174" display="inline"><mml:mn mathvariant="normal">3.73</mml:mn></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col3"><inline-formula><mml:math id="M175" display="inline"><mml:mn mathvariant="normal">3.65</mml:mn></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col4"><inline-formula><mml:math id="M176" display="inline"><mml:mn mathvariant="normal">7.63</mml:mn></mml:math></inline-formula></oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">0.1</oasis:entry>
         <oasis:entry colname="col2"><inline-formula><mml:math id="M177" display="inline"><mml:mn mathvariant="normal">2.93</mml:mn></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col3"><inline-formula><mml:math id="M178" display="inline"><mml:mn mathvariant="normal">2.84</mml:mn></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col4"><inline-formula><mml:math id="M179" display="inline"><mml:mn mathvariant="normal">7.27</mml:mn></mml:math></inline-formula></oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">1</oasis:entry>
         <oasis:entry colname="col2"><inline-formula><mml:math id="M180" display="inline"><mml:mn mathvariant="normal">3.50</mml:mn></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col3"><inline-formula><mml:math id="M181" display="inline"><mml:mn mathvariant="normal">3.36</mml:mn></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col4"><inline-formula><mml:math id="M182" display="inline"><mml:mn mathvariant="normal">8.61</mml:mn></mml:math></inline-formula></oasis:entry>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup></oasis:table></table-wrap>

      <p id="d2e4218">As shown in Table <xref ref-type="table" rid="T4"/>, MSE and HCE-6 do not vary monotonically with <inline-formula><mml:math id="M183" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mi mathvariant="normal">Bend</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, but both are consistently lower with the bending-energy prior enabled than without it, indicating that the regularization yields realizations that are more stable and closer to the reference model, rather than drifting into implausible solutions. In particular, <inline-formula><mml:math id="M184" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mi mathvariant="normal">Bend</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0.1</mml:mn></mml:mrow></mml:math></inline-formula> achieves the lowest pixel-wise error among the three settings. At the same time, the prior does not reduce realization variance; the strongest setting (<inline-formula><mml:math id="M185" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mi mathvariant="normal">Bend</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>) yields the highest variance among the three, showing that this improved stability does not come at the cost of the model's ability to represent structural uncertainty.</p>
</sec>
</sec>
<sec id="Ch1.S4">
  <label>4</label><title>Discussion</title>
      <p id="d2e4273">In developing LFD, we observed several interesting behaviors that provide additional insight into diffusion-based implicit structural modeling, while also revealing practical limitations of the current study. We summarize these findings below.</p>
      <p id="d2e4276"><italic>Resolution robustness.</italic> Our model is trained on <inline-formula><mml:math id="M186" display="inline"><mml:mrow><mml:mn mathvariant="normal">512</mml:mn><mml:mo>×</mml:mo><mml:mn mathvariant="normal">512</mml:mn></mml:mrow></mml:math></inline-formula> samples, yet we observe encouraging robustness to higher resolutions. In principle, the same adaptation applies to other larger input sizes; here we use <inline-formula><mml:math id="M187" display="inline"><mml:mrow><mml:mn mathvariant="normal">1024</mml:mn><mml:mo>×</mml:mo><mml:mn mathvariant="normal">1024</mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M188" display="inline"><mml:mrow><mml:mn mathvariant="normal">2048</mml:mn><mml:mo>×</mml:mo><mml:mn mathvariant="normal">2048</mml:mn></mml:mrow></mml:math></inline-formula> as representative examples. In testing, we upsample the input horizons and faults to <inline-formula><mml:math id="M189" display="inline"><mml:mrow><mml:mn mathvariant="normal">1024</mml:mn><mml:mo>×</mml:mo><mml:mn mathvariant="normal">1024</mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M190" display="inline"><mml:mrow><mml:mn mathvariant="normal">2048</mml:mn><mml:mo>×</mml:mo><mml:mn mathvariant="normal">2048</mml:mn></mml:mrow></mml:math></inline-formula> using nearest-neighbor interpolation. To keep the token length unchanged (i.e., a <inline-formula><mml:math id="M191" display="inline"><mml:mrow><mml:mn mathvariant="normal">16</mml:mn><mml:mo>×</mml:mo><mml:mn mathvariant="normal">16</mml:mn></mml:mrow></mml:math></inline-formula> token grid), we increase the patch size to <inline-formula><mml:math id="M192" display="inline"><mml:mrow><mml:mi>P</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">64</mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M193" display="inline"><mml:mrow><mml:mi>P</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">128</mml:mn></mml:mrow></mml:math></inline-formula> for <inline-formula><mml:math id="M194" display="inline"><mml:mn mathvariant="normal">1024</mml:mn></mml:math></inline-formula> and <inline-formula><mml:math id="M195" display="inline"><mml:mn mathvariant="normal">2048</mml:mn></mml:math></inline-formula> inputs, respectively. For each bottleneck patch embedding module, the spatial grid changes with resolution; therefore, we interpolate the positional embeddings and reuse the pretrained network parameters accordingly to adapt the model to the new grid. Surprisingly, the generated implicit models remain high-quality at both <inline-formula><mml:math id="M196" display="inline"><mml:mn mathvariant="normal">1024</mml:mn></mml:math></inline-formula> and <inline-formula><mml:math id="M197" display="inline"><mml:mn mathvariant="normal">2048</mml:mn></mml:math></inline-formula> resolutions (Fig. <xref ref-type="fig" rid="F5"/>). We attribute this behavior partly to the relative positional encoding (RoPE), which provides a degree of resolution robustness by expressing positions in a scale-consistent manner. This observation is consistent with prior findings that RoPE improves resolution extrapolation in vision transformers <xref ref-type="bibr" rid="bib1.bibx28 bib1.bibx65" id="paren.53"/>. We note, however, that this finding may be task-dependent: implicit structural models are typically smooth fields and do not require extremely high-frequency details.</p>

      <fig id="F5" specific-use="star"><label>Figure 5</label><caption><p id="d2e4414">Resolution generalization. The model trained at <inline-formula><mml:math id="M198" display="inline"><mml:mrow><mml:mn mathvariant="normal">512</mml:mn><mml:mo>×</mml:mo><mml:mn mathvariant="normal">512</mml:mn></mml:mrow></mml:math></inline-formula> is directly applied to higher resolutions by adjusting the patch size to keep the token grid fixed. From left to right: 512/32 (same result as the real-3 case in Fig. <xref ref-type="fig" rid="F3"/>c), 1024/64, and 2048/128 (resolution/patch size). The model preserves high-quality implicit structural predictions at <inline-formula><mml:math id="M199" display="inline"><mml:mrow><mml:mn mathvariant="normal">1024</mml:mn><mml:mo>×</mml:mo><mml:mn mathvariant="normal">1024</mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M200" display="inline"><mml:mrow><mml:mn mathvariant="normal">2048</mml:mn><mml:mo>×</mml:mo><mml:mn mathvariant="normal">2048</mml:mn></mml:mrow></mml:math></inline-formula> without additional training.</p></caption>
        <graphic xlink:href="https://gmd.copernicus.org/articles/19/7961/2026/gmd-19-7961-2026-f05.png"/>

      </fig>

      <p id="d2e4462"><italic>Impact of noise scale.</italic> We find that the noise scale is a critical factor for implicit structural modeling. In early experiments, using commonly adopted noise scales for natural-image diffusion (e.g., <inline-formula><mml:math id="M201" display="inline"><mml:mn mathvariant="normal">1.0</mml:mn></mml:math></inline-formula> or <inline-formula><mml:math id="M202" display="inline"><mml:mn mathvariant="normal">2.0</mml:mn></mml:math></inline-formula>) often led to overly noisy generations even with prolonged training. This is likely because implicit structural models exhibit relatively smooth distributions, for which excessively strong corruption can hinder stable denoising. To probe this behavior before committing to a full retraining, we took the exploratory model trained with <inline-formula><mml:math id="M203" display="inline"><mml:mrow><mml:mi mathvariant="normal">NS</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">2.0</mml:mn></mml:mrow></mml:math></inline-formula> and varied only the inference-time noise scale (Fig. <xref ref-type="fig" rid="F6"/>), and observed that decreasing it yields noticeably smoother and more geologically reasonable implicit fields. On the basis of this observation we retrained the model with <inline-formula><mml:math id="M204" display="inline"><mml:mrow><mml:mi mathvariant="normal">NS</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0.2</mml:mn></mml:mrow></mml:math></inline-formula>, which is used for all other results in this paper. This finding provides practical guidance for deploying diffusion models in geophysics: the noise scale should be tuned to the target task and data characteristics to achieve optimal generation quality.</p>

      <fig id="F6" specific-use="star"><label>Figure 6</label><caption><p id="d2e4509">Effect of noise scale (NS) on generation. This experiment was carried out with an early exploratory model trained with <inline-formula><mml:math id="M205" display="inline"><mml:mrow><mml:mi mathvariant="normal">NS</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">2.0</mml:mn></mml:mrow></mml:math></inline-formula>, before the final configuration was fixed. During inference, we vary only the noise scale while keeping all other settings fixed. Panels <bold>(a)</bold>–<bold>(e)</bold> correspond to <inline-formula><mml:math id="M206" display="inline"><mml:mrow><mml:mi mathvariant="normal">NS</mml:mi><mml:mo>=</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mn mathvariant="normal">2.0</mml:mn><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mn mathvariant="normal">1.0</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mn mathvariant="normal">0.5</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mn mathvariant="normal">0.2</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mn mathvariant="normal">0.1</mml:mn><mml:mo mathvariant="italic">}</mml:mo></mml:mrow></mml:math></inline-formula>. As NS decreases, the generated implicit structural models become smoother and exhibit less residual noise. Guided by this observation, the final model used for all other results in this paper was retrained with <inline-formula><mml:math id="M207" display="inline"><mml:mrow><mml:mi mathvariant="normal">NS</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0.2</mml:mn></mml:mrow></mml:math></inline-formula> (Sect. 3.2).</p></caption>
        <graphic xlink:href="https://gmd.copernicus.org/articles/19/7961/2026/gmd-19-7961-2026-f06.png"/>

      </fig>

      <p id="d2e4585"><italic>Impact of sampling steps.</italic> In addition to the noise scale, we examine the sensitivity of generation quality to the number of ODE sampling steps <inline-formula><mml:math id="M208" display="inline"><mml:mrow><mml:mi>K</mml:mi><mml:mo>∈</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mn mathvariant="normal">5</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">10</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">20</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">30</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">50</mml:mn><mml:mo mathvariant="italic">}</mml:mo></mml:mrow></mml:math></inline-formula>, evaluated on 100 validation samples, using the fault mask together with the central horizon extracted from the implicit field as conditioning, and reporting the average inference time. As shown in Table <xref ref-type="table" rid="T5"/>, inference time scales approximately linearly with <inline-formula><mml:math id="M209" display="inline"><mml:mi>K</mml:mi></mml:math></inline-formula>, while both MSE and HCE-6 improve only marginally beyond <inline-formula><mml:math id="M210" display="inline"><mml:mrow><mml:mi>K</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">20</mml:mn></mml:mrow></mml:math></inline-formula>, with diminishing returns thereafter. The default setting used throughout this paper (<inline-formula><mml:math id="M211" display="inline"><mml:mrow><mml:mi>K</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">50</mml:mn></mml:mrow></mml:math></inline-formula>) is chosen to showcase the best achievable generation quality; in practice, the number of sampling steps can be reduced to obtain substantially faster inference while maintaining comparable quality.</p>

<table-wrap id="T5"><label>Table 5</label><caption><p id="d2e4661">Ablation on the number of ODE sampling steps <inline-formula><mml:math id="M212" display="inline"><mml:mi>K</mml:mi></mml:math></inline-formula>.</p></caption><oasis:table frame="topbot"><oasis:tgroup cols="4">
     <oasis:colspec colnum="1" colname="col1" align="left"/>
     <oasis:colspec colnum="2" colname="col2" align="right"/>
     <oasis:colspec colnum="3" colname="col3" align="right"/>
     <oasis:colspec colnum="4" colname="col4" align="right"/>
     <oasis:thead>
       <oasis:row>
         <oasis:entry colname="col1"><inline-formula><mml:math id="M213" display="inline"><mml:mi>K</mml:mi></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col2">MSE</oasis:entry>
         <oasis:entry colname="col3">HCE-6</oasis:entry>
         <oasis:entry colname="col4">Time</oasis:entry>
       </oasis:row>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1"/>
         <oasis:entry colname="col2">(1 <inline-formula><mml:math id="M214" display="inline"><mml:mo>×</mml:mo></mml:math></inline-formula> 10<sup>−2</sup>) <inline-formula><mml:math id="M216" display="inline"><mml:mo>↓</mml:mo></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col3">(1 <inline-formula><mml:math id="M217" display="inline"><mml:mo>×</mml:mo></mml:math></inline-formula> 10<sup>−2</sup>) <inline-formula><mml:math id="M219" display="inline"><mml:mo>↓</mml:mo></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col4">(s)</oasis:entry>
       </oasis:row>
     </oasis:thead>
     <oasis:tbody>
       <oasis:row>
         <oasis:entry colname="col1">5</oasis:entry>
         <oasis:entry colname="col2"><inline-formula><mml:math id="M220" display="inline"><mml:mn mathvariant="normal">3.18</mml:mn></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col3"><inline-formula><mml:math id="M221" display="inline"><mml:mn mathvariant="normal">3.016</mml:mn></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col4"><inline-formula><mml:math id="M222" display="inline"><mml:mn mathvariant="normal">0.15</mml:mn></mml:math></inline-formula></oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">10</oasis:entry>
         <oasis:entry colname="col2"><inline-formula><mml:math id="M223" display="inline"><mml:mn mathvariant="normal">3.16</mml:mn></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col3"><inline-formula><mml:math id="M224" display="inline"><mml:mn mathvariant="normal">3.021</mml:mn></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col4"><inline-formula><mml:math id="M225" display="inline"><mml:mn mathvariant="normal">0.32</mml:mn></mml:math></inline-formula></oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">20</oasis:entry>
         <oasis:entry colname="col2"><inline-formula><mml:math id="M226" display="inline"><mml:mn mathvariant="normal">3.13</mml:mn></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col3"><inline-formula><mml:math id="M227" display="inline"><mml:mn mathvariant="normal">3.025</mml:mn></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col4"><inline-formula><mml:math id="M228" display="inline"><mml:mn mathvariant="normal">0.64</mml:mn></mml:math></inline-formula></oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">30</oasis:entry>
         <oasis:entry colname="col2"><inline-formula><mml:math id="M229" display="inline"><mml:mn mathvariant="normal">3.08</mml:mn></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col3"><inline-formula><mml:math id="M230" display="inline"><mml:mn mathvariant="normal">2.950</mml:mn></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col4"><inline-formula><mml:math id="M231" display="inline"><mml:mn mathvariant="normal">0.97</mml:mn></mml:math></inline-formula></oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">50</oasis:entry>
         <oasis:entry colname="col2"><inline-formula><mml:math id="M232" display="inline"><mml:mn mathvariant="normal">3.04</mml:mn></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col3"><inline-formula><mml:math id="M233" display="inline"><mml:mn mathvariant="normal">2.967</mml:mn></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col4"><inline-formula><mml:math id="M234" display="inline"><mml:mn mathvariant="normal">1.56</mml:mn></mml:math></inline-formula></oasis:entry>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup></oasis:table></table-wrap>

      <p id="d2e4925"><italic>Reliability of clean-data prediction at high noise levels.</italic> Since LFD directly predicts the clean data <inline-formula><mml:math id="M235" display="inline"><mml:mover accent="true"><mml:mi>x</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover></mml:math></inline-formula> at every timestep, it is worth examining how the reliability of this prediction varies with the noise level, as this bears on the validity of applying the horizon and bending-energy losses uniformly across all timesteps during training. Using a single validation sample, we fix the same implicit field and noise realization while varying only the timestep <inline-formula><mml:math id="M236" display="inline"><mml:mi>t</mml:mi></mml:math></inline-formula>, and visualize the resulting single-step prediction <inline-formula><mml:math id="M237" display="inline"><mml:mover accent="true"><mml:mi>x</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover></mml:math></inline-formula> (Fig. <xref ref-type="fig" rid="F7"/>). As <inline-formula><mml:math id="M238" display="inline"><mml:mi>t</mml:mi></mml:math></inline-formula> increases from 0.01 to 0.9 (i.e., as the noise level decreases), the prediction error decreases by more than three orders of magnitude (from <inline-formula><mml:math id="M239" display="inline"><mml:mrow><mml:mn mathvariant="normal">1.89</mml:mn><mml:mo>×</mml:mo><mml:msup><mml:mn mathvariant="normal">10</mml:mn><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> to <inline-formula><mml:math id="M240" display="inline"><mml:mrow><mml:mn mathvariant="normal">1.47</mml:mn><mml:mo>×</mml:mo><mml:msup><mml:mn mathvariant="normal">10</mml:mn><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">5</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula>), and the predicted field becomes visibly sharper. This confirms that predictions are more blurred at high noise levels. We note that this diagnostic measures single-step denoising given a partially informative <inline-formula><mml:math id="M241" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, since <inline-formula><mml:math id="M242" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi>t</mml:mi><mml:mi mathvariant="bold">x</mml:mi><mml:mo>+</mml:mo><mml:mo>(</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>-</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo><mml:mi mathvariant="bold-italic">ϵ</mml:mi></mml:mrow></mml:math></inline-formula> still contains a fraction <inline-formula><mml:math id="M243" display="inline"><mml:mi>t</mml:mi></mml:math></inline-formula> of the ground-truth field, and is therefore not directly comparable to the end-to-end generation error in Table <xref ref-type="table" rid="T4"/>. In principle, geological and geophysical regularization terms such as the horizon and bending-energy losses would be more directly justified at low noise levels, where <inline-formula><mml:math id="M244" display="inline"><mml:mover accent="true"><mml:mi>x</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover></mml:math></inline-formula> more closely approximates the implicit model. However, our results show that even at <inline-formula><mml:math id="M245" display="inline"><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0.01</mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M246" display="inline"><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0.05</mml:mn></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math id="M247" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold">z</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is almost pure noise and the pixel-wise error is largest, the network still recovers a coherent, fault-aligned stratigraphic architecture rather than a severely blurred or incoherent field. The prior losses therefore act on a structurally meaningful target across the whole range of <inline-formula><mml:math id="M248" display="inline"><mml:mi>t</mml:mi></mml:math></inline-formula>, even though their justification is strongest at low noise levels. Applying them with a uniform weight across all <inline-formula><mml:math id="M249" display="inline"><mml:mi>t</mml:mi></mml:math></inline-formula>, as we do in this paper, should thus be regarded as an empirically motivated choice rather than one that is equally well-founded at every noise level. Building on this observation, a promising direction for future work is to design a more refined weighting schedule in which the strength of the bending-energy regularization decays with the timestep, which may enable finer control over the trade-off between reconstruction fidelity and geological plausibility.</p>

      <fig id="F7" specific-use="star"><label>Figure 7</label><caption><p id="d2e5117">Single-step clean-data prediction at different noise levels. The first panel shows the input conditioning; the remaining panels show the predicted <inline-formula><mml:math id="M250" display="inline"><mml:mover accent="true"><mml:mi>x</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover></mml:math></inline-formula> at <inline-formula><mml:math id="M251" display="inline"><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0.01</mml:mn></mml:mrow></mml:math></inline-formula>, 0.05, 0.1, 0.3, 0.5, 0.7, 0.9, using the same ground-truth sample and the same noise realization across all panels. Prediction error (MSE, relative to the ground-truth field) decreases monotonically as <inline-formula><mml:math id="M252" display="inline"><mml:mi>t</mml:mi></mml:math></inline-formula> increases, indicating that predictions become progressively more reliable as the noise level decreases.</p></caption>
        <graphic xlink:href="https://gmd.copernicus.org/articles/19/7961/2026/gmd-19-7961-2026-f07.png"/>

      </fig>

      <p id="d2e5155"><italic>Conditioning flexibility and applicability.</italic> We only consider faults and horizons as conditioning inputs in this work. For practical implicit structural modeling, additional information such as interpreted normals or orientation constraints are often beneficial, and we believe they can be incorporated naturally in our framework, either as extra input channels or as explicit loss terms. Compared with VAE-based latent diffusion, injecting such geological priors in our data-space approach is more direct and interpretable, avoiding the ambiguity of enforcing constraints in a learned latent space. Moreover, our formulation enables flexible generation of implicit structural model samples. With only a few sketched horizons and faults, the model can produce geologically realistic implicit fields, which facilitates the construction and iterative refinement of structural modeling datasets compared with traditional workflows that often rely on computationally intensive physics-based forward modeling.</p>
      <p id="d2e5160"><italic>Generalization capacity.</italic> The real-survey experiments (Fig. <xref ref-type="fig" rid="F3"/>) provide some indication of the model's generalization capacity. Since the synthetic training data are generated using parameterized fold, fault, and unconformity rules, the model is expected to perform reasonably well when the target geological structures fall within the range of styles represented in the training distribution. However, as demonstrated in Fig. 3e, performance degrades noticeably in the presence of pronounced thrust structures, which are absent from the training dataset. This suggests that the current model should be applied with caution in tectonic settings that deviate significantly from the training distribution, such as thrust-and-fold belts. Expanding the synthetic dataset to include such structural styles would be a natural direction for future work.</p>
      <p id="d2e5167"><italic>Variability under sparse horizon conditioning.</italic> The horizon-sparsity ablation study (Sec.<xref ref-type="sec" rid="Ch1.S3.SS5"/>) shows that the variability of the generated realizations increases as the number of horizon constraints decreases, with mean variance rising from 0.0013 (6 horizons) to 0.0073 (1 horizon). This trend is also evident from the variance maps in Fig. <xref ref-type="fig" rid="F4"/>, where high-variance regions progressively expand as conditioning horizons are removed. Such behavior is expected, since regions that are weakly constrained by horizon information inherently admit a broader range of geologically plausible solutions. As the amount of conditioning information decreases, the model is afforded greater freedom in generating the implicit structural field, resulting in increased realization variability. These observations suggest that the model responds to sparse conditioning in a physically reasonable manner, producing more diverse structural realizations where geological constraints are limited.</p>
      <p id="d2e5176"><italic>Fault sparsity.</italic> The current framework relies on fault masks to indicate locations where structural discontinuities are permitted, and discontinuities in the generated implicit field therefore tend to coincide with the supplied fault constraints. If a fault is omitted from the conditioning data, the corresponding region is no longer explicitly identified as a discontinuity, and the model tends to preserve the smoothness of the implicit structural field there, potentially leading to weakened or absent discontinuities. A similar trend is observed in the horizon-sparsity ablation study (Fig. <xref ref-type="fig" rid="F4"/>), where reducing conditioning information results in increased realization variability and structural ambiguity. Since fault masks are introduced through the same conditional mechanism, sparse or incomplete fault constraints would likewise reduce the structural information available to the model, increasing ambiguity near fault zones while favoring smoother structures in unconstrained regions. This behavior is consistent with the conditional nature of the framework, which is designed to honor the available structural constraints. In many implicit structural modeling workflows, it is desirable for the model to infer previously unidentified discontinuities even when fault information is sparse. However, this capability is not explicitly investigated in the present study. Extending the framework to identify and incorporate such missing discontinuities represents an interesting direction for future work.</p>
      <p id="d2e5183"><italic>Unconformities.</italic> Unconformity-related geometries are present in the synthetic training models; however, unconformities are not explicitly represented as conditioning constraints in the current framework. In this study, our primary objective was to evaluate the effectiveness of the proposed diffusion-based workflow under a simplified conditioning scheme using only horizons and faults. Consequently, the ability of the model to reconstruct unconformity surfaces has not been systematically evaluated, which we acknowledge as a limitation of the current work. Similar to faults, unconformities correspond to discontinuities in the implicit scalar field, although their geological meaning differs: faults represent stratigraphic displacement, whereas unconformities represent contact relationships between distinct stratigraphic packages. This suggests that unconformities could be incorporated as an additional conditioning channel, analogous to fault masks, together with an unconformity-aware regularization to explicitly model discontinuous stratigraphic contacts. Extending the framework in this direction represents an important avenue for future work.</p>
      <p id="d2e5189"><italic>Geologically impossible results.</italic> The fault-aware bending-energy loss encourages the generated implicit field to remain smooth within fault-bounded regions, which in practice is intended to suppress localized artifacts such as closed iso-surfaces (e.g., “bubbles”) that would be geologically implausible. In our experiments, we did not observe such artifacts in the generated results, suggesting that the bending-energy regularization is effective in practice. Nevertheless, under very sparse conditioning (e.g., 1 input horizon), the high-variance regions visible in Fig. <xref ref-type="fig" rid="F4"/> indicate that the model has considerable freedom in unconstrained areas, and the occurrence of geologically unreasonable structures cannot be entirely ruled out in more challenging scenarios. Incorporating additional geological rules, such as stratigraphic monotonicity constraints, into the loss function could further reduce the likelihood of such artifacts and would be a worthwhile direction for future work.</p>

      <fig id="F8" specific-use="star"><label>Figure 8</label><caption><p id="d2e5198">Sensitivity of high-curvature fold hinges to the bending-energy weight. Left column: input conditioning for three test cases, each featuring a fold hinge positioned sufficiently far from any fault: a tight anticline (top), an asymmetric fold (middle), and a double-hinge fold without any fault present (bottom). Right three columns: ensemble-mean structural models, averaged over 20 realizations from different noise seeds, generated under <inline-formula><mml:math id="M253" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mi mathvariant="normal">Bend</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:math></inline-formula>, 0.1, 1.0, respectively.</p></caption>
        <graphic xlink:href="https://gmd.copernicus.org/articles/19/7961/2026/gmd-19-7961-2026-f08.png"/>

      </fig>

      <p id="d2e5222"><italic>Preservation of high-curvature features.</italic> While the bending-energy loss suppresses geologically implausible artifacts, a quadratic penalty on curvature could, in principle, also over-smooth genuine, non-fault high-curvature features such as fold hinges. To examine this risk, we constructed several high-curvature test cases in which the fold hinges are located away from any fault (including a tight anticline, an asymmetric fold, and a double-hinge fold without any fault present). For each case, we generate 20 realizations from different noise seeds under three bending-energy weights (<inline-formula><mml:math id="M254" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mi mathvariant="normal">Bend</mml:mi></mml:msub><mml:mo>∈</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">0.1</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo mathvariant="italic">}</mml:mo></mml:mrow></mml:math></inline-formula>) and compare the resulting ensemble-mean structural models (Fig. <xref ref-type="fig" rid="F8"/>). Even under the strongest setting (<inline-formula><mml:math id="M255" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mi mathvariant="normal">Bend</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>), the model accurately preserves the high-curvature geometry at these fold hinges, with no noticeable over-smoothing or structural collapse observed. Together with the quantitative results in Table <xref ref-type="table" rid="T4"/>, where reconstruction accuracy improves and realization variance does not decrease monotonically with <inline-formula><mml:math id="M256" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mi mathvariant="normal">Bend</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, this indicates that, within the tested weight range, the regularizer does not compromise high-curvature geological features while still preserving meaningful realization diversity.</p>
      <p id="d2e5284"><italic>Limitation and 3D extension.</italic> This study primarily focuses on validating the effectiveness of <inline-formula><mml:math id="M257" display="inline"><mml:mi mathvariant="bold">x</mml:mi></mml:math></inline-formula>-prediction, the structure-enhanced transformer design, and the proposed prior-guided losses. Accordingly, our experiments are conducted on 2D implicit structural modeling, which does not fully capture 3D geological complexity such as fault connectivity and branching. Nevertheless, the proposed framework is conceptually extendable to 3D by replacing 2D patch embeddings and attention with their 3D counterparts. However, a practical 3D implementation requires additional considerations due to the substantially increased computational cost and the higher structural complexity of volumetric faulted settings. Future work will evaluate the full 3D extension, including computational scaling and constraint satisfaction in volumetric settings. Similarly, the present study assumes a uniformly sampled grid, consistent with the fixed-size patch embedding used by the ViT backbone; extending the framework to non-uniform grids, where spacing varies spatially (e.g., locally warped or flattened grids), would require rethinking the patch embedding scheme, and represents another promising direction for future work.</p>
</sec>
<sec id="Ch1.S5" sec-type="conclusions">
  <label>5</label><title>Conclusions</title>
      <p id="d2e5305">To eliminate reliance on VAE-based latent compression in high-dimensional diffusion modeling and overcome the difficulty of imposing geological priors in latent space, we propose LFD, a latent-compression-free, prior-guided diffusion framework with denoised-sample prediction for implicit structural modeling. LFD uses flow matching but predicts the implicit structural model directly in data space. This keeps the modeling target explicit and makes it easier to enforce geological constraints. We design a structure-enhanced ViT to improve conditioning. The network injects horizon and fault information at multiple layers. We also add two prior-guided losses. The horizon loss enforces consistency on horizon locations. The fault-aware bending-energy loss penalizes curvature only within fault-bounded regions. It avoids stencils across faults and preserves sharp discontinuities. Experiments on synthetic data and five real-survey examples with complex flower-structure faulting show that LFD produces more coherent implicit structural models than SiT. Overall, LFD demonstrates that diffusion models can effectively generate implicit structural models while directly honoring geological constraints in data space.</p>
</sec>

      
      </body>
    <back><notes notes-type="codedataavailability"><title>Code and data availability</title>

      <p id="d2e5312">The training data and source code of this study is openly available on Zenodo at <ext-link xlink:href="https://doi.org/10.5281/zenodo.20508635" ext-link-type="DOI">10.5281/zenodo.20508635</ext-link> <xref ref-type="bibr" rid="bib1.bibx27" id="paren.54"/>.</p>
  </notes><notes notes-type="authorcontribution"><title>Author contributions</title>

      <p id="d2e5324">Z.G. carried out the experiments, performed the analysis, and drafted the manuscript. X.W. proposed the main ideas, supervised the work, and revised the manuscript. Y.D. collected and curated the data. H.G. contributed to the discussion and revised the manuscript. G.C. contributed to the discussion and revised the manuscript.</p>
  </notes><notes notes-type="competinginterests"><title>Competing interests</title>

      <p id="d2e5330">The contact author has declared that none of the authors has any competing interests.</p>
  </notes><notes notes-type="disclaimer"><title>Disclaimer</title>

      <p id="d2e5336">Publisher's note: Copernicus Publications remains neutral with regard to jurisdictional claims made in the text, published maps, institutional affiliations, or any other geographical representation in this paper. The authors bear the ultimate responsibility for providing appropriate place names. Views expressed in the text are those of the authors and do not necessarily reflect the views of the publisher.</p>
  </notes><ack><title>Acknowledgements</title><p id="d2e5343">Z.G. acknowledges support from the China Scholarship Council under the Joint PhD Program for his mobility scholarship at Université de Lorraine. G.C. acknowledges the sponsors of the RING Consortium (<uri>http://ring-team.org/consortium</uri>, last access: 12 August 2026).</p></ack><notes notes-type="financialsupport"><title>Financial support</title>

      <p id="d2e5351">This research has been supported by the DeepEarth Probe and Mineral Resources Exploration – National Science and Technology Major Project (grant no. 2024ZD1002100).</p>
  </notes><notes notes-type="reviewstatement"><title>Review statement</title>

      <p id="d2e5357">This paper was edited by Thomas Poulet and reviewed by Samuel Thiele and Pouria Behnoudfar.</p>
  </notes><ref-list>
    <title>References</title>

      <ref id="bib1.bibx1"><label>Alemi et al.(2016)</label><mixed-citation>Alemi, A. A., Fischer, I., Dillon, J. V., and Murphy, K.: Deep variational information bottleneck, arXiv [preprint], <ext-link xlink:href="https://doi.org/10.48550/arXiv.1612.00410" ext-link-type="DOI">10.48550/arXiv.1612.00410</ext-link>, 2016.</mixed-citation></ref>
      <ref id="bib1.bibx2"><label>Arienti et al.(2025)</label><mixed-citation>Arienti, G., Bistacchi, A., Caumon, G., Monopoli, B., and Dal Piaz, G.: 3D structural implicit modelling of folded metamorphic units at Lago di Cignana with uncertainty assessment, J. Struct. Geol., 191, 105329, <ext-link xlink:href="https://doi.org/10.1016/j.jsg.2024.105329" ext-link-type="DOI">10.1016/j.jsg.2024.105329</ext-link>, 2025.</mixed-citation></ref>
      <ref id="bib1.bibx3"><label>Belhachmi et al.(2025)</label><mixed-citation>Belhachmi, A., Benabbou, A., and Mourrain, B.: A spline-based regularized method for the reconstruction of complex geological models, Math. Geosci., 57, 89–114, <ext-link xlink:href="https://doi.org/10.1007/s11004-024-10149-2" ext-link-type="DOI">10.1007/s11004-024-10149-2</ext-link>, 2025.</mixed-citation></ref>
      <ref id="bib1.bibx4"><label>Bi et al.(2021)</label><mixed-citation>Bi, Z., Wu, X., Geng, Z., and Li, H.: Deep relative geologic time: A deep learning method for simultaneously interpreting 3-D seismic horizons and faults, J. Geophys. Res.-Sol. Ea., 126, e2021JB021882, <ext-link xlink:href="https://doi.org/10.1029/2021JB021882" ext-link-type="DOI">10.1029/2021JB021882</ext-link>, 2021.</mixed-citation></ref>
      <ref id="bib1.bibx5"><label>Bi et al.(2022)</label><mixed-citation>Bi, Z., Wu, X., Li, Z., Chang, D., and Yong, X.: DeepISMNet: three-dimensional implicit structural modeling with convolutional neural network, Geosci. Model Dev., 15, 6841–6861, <ext-link xlink:href="https://doi.org/10.5194/gmd-15-6841-2022" ext-link-type="DOI">10.5194/gmd-15-6841-2022</ext-link>, 2022.</mixed-citation></ref>
      <ref id="bib1.bibx6"><label>Bonnaire et al.(2025)</label><mixed-citation>Bonnaire, T., Urfin, R., Biroli, G., and Mézard, M.: Why Diffusion Models Don't Memorize: The Role of Implicit Dynamical Regularization in Training, arXiv [preprint], <ext-link xlink:href="https://doi.org/10.48550/arXiv.2505.17638" ext-link-type="DOI">10.48550/arXiv.2505.17638</ext-link>, 2025.</mixed-citation></ref>
      <ref id="bib1.bibx7"><label>Calcagno et al.(2008)</label><mixed-citation>Calcagno, P., Chilès, J.-P., Courrioux, G., and Guillen, A.: Geological modelling from field data and geological knowledge: Part I. Modelling method coupling 3D potential-field interpolation and geological rules, Phys. Earth Planet. In., 171, 147–157, <ext-link xlink:href="https://doi.org/10.1016/j.pepi.2008.06.013" ext-link-type="DOI">10.1016/j.pepi.2008.06.013</ext-link>, 2008.</mixed-citation></ref>
      <ref id="bib1.bibx8"><label>Caumon et al.(2009)</label><mixed-citation>Caumon, G., Collon-Drouaillet, P., Le Carlier de Veslud, C., Viseur, S., and Sausse, J.: Surface-based 3D modeling of geological structures, Math. Geosci., 41, 927–945, <ext-link xlink:href="https://doi.org/10.1007/s11004-009-9244-2" ext-link-type="DOI">10.1007/s11004-009-9244-2</ext-link>, 2009.</mixed-citation></ref>
      <ref id="bib1.bibx9"><label>Caumon et al.(2013)</label><mixed-citation>Caumon, G., Gray, G., Antoine, C., and Titeux, M.-O.: Three-dimensional implicit stratigraphic model building from remote sensing data on tetrahedral meshes: theory and application to a regional model of La Popa Basin, NE Mexico, IEEE T. Geosci. Remote, 51, 1613–1621,  <ext-link xlink:href="https://doi.org/10.1109/TGRS.2012.2207727" ext-link-type="DOI">10.1109/TGRS.2012.2207727</ext-link>, 2013.</mixed-citation></ref>
      <ref id="bib1.bibx10"><label>Chapelle et al.(2009)</label><mixed-citation>Chapelle, O., Scholkopf, B., and Zien, A.: Semi-supervised learning (Chapelle, O. et al., Eds.; 2006) [book reviews], IEEE T. Neural Networ., 20, 542–542, <ext-link xlink:href="https://doi.org/10.1109/TNN.2009.2015974" ext-link-type="DOI">10.1109/TNN.2009.2015974</ext-link>, 2009.</mixed-citation></ref>
      <ref id="bib1.bibx11"><label>Chilès et al.(2007)</label><mixed-citation>Chilès, J., Aug, C., Guillen, A., and Lees, T.: Modelling the geometry of geological units and its uncertainty in 3D from structural data: the potential-field method, in: Orebody Modelling and Strategic Mine Planning – Uncertainty and Risk Management Models, edited by: Dimitrakopoulos, R., 2nd edn., Spectrum Series, vol. 14, The Australasian Institute of Mining and Metallurgy, Melbourne, Australia, <uri>https://hal.science/hal-00796180</uri> (last access: 12 August 2026), 2007.</mixed-citation></ref>
      <ref id="bib1.bibx12"><label>Choi et al.(2021)</label><mixed-citation>Choi, J., Kim, S., Jeong, Y., Gwon, Y., and Yoon, S.: ILVR: Conditioning Method for Denoising Diffusion Probabilistic Models, 2021 IEEE/CVF International Conference on Computer Vision (ICCV), Montreal, QC, Canada, 2021, 14347–14356, <ext-link xlink:href="https://doi.org/10.1109/ICCV48922.2021.01410" ext-link-type="DOI">10.1109/ICCV48922.2021.01410</ext-link>, 2021.</mixed-citation></ref>
      <ref id="bib1.bibx13"><label>Cowan et al.(2002)</label><mixed-citation>Cowan, E. J., Beatson, R. K., Fright, W. R., McLennan, T. J., and Mitchell, T. J.: Rapid geological modelling, in: Applied Structural Geology for Mineral Exploration and Mining, International Symposium, Kalgoorlie, Australia, 23–25 September 2002, Australian Institute of Geoscientists, <uri>https://api.semanticscholar.org/CorpusID:160034199</uri> (last access: 12 August 2026), 2002.</mixed-citation></ref>
      <ref id="bib1.bibx14"><label>Dao et al.(2023)</label><mixed-citation>Dao, Q., Phung, H., Nguyen, B., and Tran, A.: Flow matching in latent space, arXiv [preprint], <ext-link xlink:href="https://doi.org/10.48550/arXiv.2307.08698" ext-link-type="DOI">10.48550/arXiv.2307.08698</ext-link>, 2023.</mixed-citation></ref>
      <ref id="bib1.bibx15"><label>de la Varga et al.(2019)</label><mixed-citation>de la Varga, M., Schaaf, A., and Wellmann, F.: GemPy 1.0: open-source stochastic geological modeling and inversion, Geosci. Model Dev., 12, 1–32, <ext-link xlink:href="https://doi.org/10.5194/gmd-12-1-2019" ext-link-type="DOI">10.5194/gmd-12-1-2019</ext-link>, 2019.</mixed-citation></ref>
      <ref id="bib1.bibx16"><label>Fan et al.(2025)</label><mixed-citation>Fan, W., Azevedo, L., Liu, G., Chen, Q., Wu, X., and Li, Y.: Automatic reconstruction of 3D geological models based on Recurrent Neural Network and predictive learning, Comput. Geosci., 105996, <ext-link xlink:href="https://doi.org/10.1016/j.cageo.2025.105996" ext-link-type="DOI">10.1016/j.cageo.2025.105996</ext-link>, 2025.</mixed-citation></ref>
      <ref id="bib1.bibx17"><label>Frank(2007)</label><mixed-citation> Frank, T.: Advanced visualization and modeling of tetrahedral meshes, Gesellschaft für Informatik, Bonn, ISBN 978-3-88579-411-0, 2007.</mixed-citation></ref>
      <ref id="bib1.bibx18"><label>Gao and Wellmann(2025)</label><mixed-citation>Gao, K. and Wellmann, F.: Fault representation in structural modelling with implicit neural representations, Comput. Geosci., 199, 105911, <ext-link xlink:href="https://doi.org/10.1016/j.cageo.2025.105911" ext-link-type="DOI">10.1016/j.cageo.2025.105911</ext-link>, 2025.</mixed-citation></ref>
      <ref id="bib1.bibx19"><label>Garayt et al.(2025)</label><mixed-citation>Garayt, C., Desassis, N., Blusseau, S., Gibert, P.-M., Langanay, J., and Romary, T.: Two-dimensional stochastic structural geomodeling with deep generative adversarial networks, Math. Geosci., 57, 1095–1114, <ext-link xlink:href="https://doi.org/10.1007/s11004-025-10188-3" ext-link-type="DOI">10.1007/s11004-025-10188-3</ext-link>, 2025.</mixed-citation></ref>
      <ref id="bib1.bibx20"><label>Gat et al.(2024)</label><mixed-citation>Gat, I., Remez, T., Shaul, N., Kreuk, F., Chen, R. T., Synnaeve, G., Adi, Y., and Lipman, Y.: Discrete flow matching, Adv. Neur. In., 37, 133345–133385, <ext-link xlink:href="https://doi.org/10.52202/079017-4239" ext-link-type="DOI">10.52202/079017-4239</ext-link>, 2024.</mixed-citation></ref>
      <ref id="bib1.bibx21"><label>Gillberg et al.(2014)</label><mixed-citation>Gillberg, T., Bruaset, A. M., Hjelle, Ø., and Sourouri, M.: Parallel solutions of static Hamilton-Jacobi equations for simulations of geological folds, Journal of Mathematics in Industry, 4, 10, <ext-link xlink:href="https://doi.org/10.1186/2190-5983-4-10" ext-link-type="DOI">10.1186/2190-5983-4-10</ext-link>, 2014.</mixed-citation></ref>
      <ref id="bib1.bibx22"><label>Giraud et al.(2020)</label><mixed-citation>Giraud, J., Lindsay, M., Jessell, M., and Ogarko, V.: Towards plausible lithological classification from geophysical inversion: honouring geological principles in subsurface imaging, Solid Earth, 11, 419–436, <ext-link xlink:href="https://doi.org/10.5194/se-11-419-2020" ext-link-type="DOI">10.5194/se-11-419-2020</ext-link>, 2020.</mixed-citation></ref>
      <ref id="bib1.bibx23"><label>Giraud et al.(2024)</label><mixed-citation>Giraud, J., Caumon, G., Grose, L., Ogarko, V., and Cupillard, P.: Integration of automatic implicit geological modelling in deterministic geophysical inversion, Solid Earth, 15, 63–89, <ext-link xlink:href="https://doi.org/10.5194/se-15-63-2024" ext-link-type="DOI">10.5194/se-15-63-2024</ext-link>, 2024.</mixed-citation></ref>
      <ref id="bib1.bibx24"><label>Grose et al.(2021)</label><mixed-citation>Grose, L., Ailleres, L., Laurent, G., and Jessell, M.: LoopStructural 1.0: time-aware geological modelling, Geosci. Model Dev., 14, 3915–3937, <ext-link xlink:href="https://doi.org/10.5194/gmd-14-3915-2021" ext-link-type="DOI">10.5194/gmd-14-3915-2021</ext-link>, 2021.</mixed-citation></ref>
      <ref id="bib1.bibx25"><label>Guo et al.(2018)</label><mixed-citation>Guo, J., Wu, L., Zhou, W., Li, C., and Li, F.: Section-constrained local geological interface dynamic updating method based on the HRBF surface, J. Struct. Geol., 107, 64–72, <ext-link xlink:href="https://doi.org/10.1016/j.jsg.2017.11.017" ext-link-type="DOI">10.1016/j.jsg.2017.11.017</ext-link>, 2018.</mixed-citation></ref>
      <ref id="bib1.bibx26"><label>Guo et al.(2025)</label><mixed-citation>Guo, Z., Wu, X., Liang, L., Sheng, H., Chen, N., and Bi, Z.: Cross-domain foundation model adaptation: Pioneering computer vision models for geophysical data analysis, Journal of Geophysical Research: Machine Learning and Computation, 2, e2025JH000601, <ext-link xlink:href="https://doi.org/10.1029/2025JH000601" ext-link-type="DOI">10.1029/2025JH000601</ext-link>, 2025.</mixed-citation></ref>
      <ref id="bib1.bibx27"><label>Guo et al.(2026)</label><mixed-citation>Guo, Z., Wu, X., Dou, Y., Gao, H., and Caumon, G.: Code from “Latent-Compression-Free Generative Diffusion with Geological Priors and Geophysical Regularization for Implicit Structural Modeling”, Zenodo [code], <ext-link xlink:href="https://doi.org/10.5281/zenodo.20508635" ext-link-type="DOI">10.5281/zenodo.20508635</ext-link>, 2026.</mixed-citation></ref>
      <ref id="bib1.bibx28"><label>Heo et al.(2024)</label><mixed-citation>Heo, B., Park, S., Han, D., and Yun, S.: Rotary position embedding for vision transformer, in: European Conference on Computer Vision, Springer, 289–305, <ext-link xlink:href="https://doi.org/10.1007/978-3-031-72684-2_17" ext-link-type="DOI">10.1007/978-3-031-72684-2_17</ext-link>, 2024.</mixed-citation></ref>
      <ref id="bib1.bibx29"><label>Hillier et al.(2021)</label><mixed-citation>Hillier, M., Wellmann, F., Brodaric, B., de Kemp, E., and Schetselaar, E.: Three-dimensional structural geological modeling using graph neural networks, Math. Geosci., 53, 1725–1749, <ext-link xlink:href="https://doi.org/10.1007/s11004-021-09945-x" ext-link-type="DOI">10.1007/s11004-021-09945-x</ext-link>, 2021.</mixed-citation></ref>
      <ref id="bib1.bibx30"><label>Hillier et al.(2023)</label><mixed-citation>Hillier, M., Wellmann, F., de Kemp, E. A., Brodaric, B., Schetselaar, E., and Bédard, K.: GeoINR 1.0: an implicit neural network approach to three-dimensional geological modelling, Geosci. Model Dev., 16, 6987–7012, <ext-link xlink:href="https://doi.org/10.5194/gmd-16-6987-2023" ext-link-type="DOI">10.5194/gmd-16-6987-2023</ext-link>, 2023.</mixed-citation></ref>
      <ref id="bib1.bibx31"><label>Hjelle and Petersen(2011)</label><mixed-citation>Hjelle, Ø. and Petersen, S. A.: A Hamilton–Jacobi framework for modeling folds in structural geology, Math. Geosci., 43, 741–761, <ext-link xlink:href="https://doi.org/10.1007/s11004-011-9357-2" ext-link-type="DOI">10.1007/s11004-011-9357-2</ext-link>, 2011.</mixed-citation></ref>
      <ref id="bib1.bibx32"><label>Ho et al.(2020)</label><mixed-citation>Ho, J., Jain, A., and Abbeel, P.: Denoising diffusion probabilistic models, arXiv [preprint], <ext-link xlink:href="https://doi.org/10.48550/arXiv.2006.11239" ext-link-type="DOI">10.48550/arXiv.2006.11239</ext-link>, 2020.</mixed-citation></ref>
      <ref id="bib1.bibx33"><label>Houlding(1994)</label><mixed-citation>Houlding, S.: 3D Geoscience Modeling: Computer Techniques for Geological Characterization, 3D Geoscience Modeling: Computer Techniques for Geological Characterization, Springer-Verlag, ISBN 9783540580157, <ext-link xlink:href="https://doi.org/10.1007/978-3-642-79012-6" ext-link-type="DOI">10.1007/978-3-642-79012-6</ext-link>, 1994.</mixed-citation></ref>
      <ref id="bib1.bibx34"><label>Huang and Liu(2017)</label><mixed-citation>Huang, L. and Liu, C.-Y.: Three types of flower structures in a divergent-wrench fault zone, J. Geophys. Res.-Sol. Ea., 122, 10–478, <ext-link xlink:href="https://doi.org/10.1002/2017JB014675" ext-link-type="DOI">10.1002/2017JB014675</ext-link>, 2017.</mixed-citation></ref>
      <ref id="bib1.bibx35"><label>Irakarama et al.(2022)</label><mixed-citation>Irakarama, M., Thierry-Coudon, M., Zakari, M., and Caumon, G.: Finite element implicit 3D subsurface structural modeling, Comput. Aided Design, 149, 103267, <ext-link xlink:href="https://doi.org/10.1016/j.cad.2022.103267" ext-link-type="DOI">10.1016/j.cad.2022.103267</ext-link>, 2022.</mixed-citation></ref>
      <ref id="bib1.bibx36"><label>Kamath et al.(2026)</label><mixed-citation>Kamath, A. V., Thiele, S. T., Moulard, M., Grose, L., Tolosana-Delgado, R., Hillier, M. J., Wellmann, F., and Gloaguen, R.: Curlew 1.0: Spatio-temporal implicit geological modelling with neural fields in python, Geosci. Model Dev., 19, 3455–3475, <ext-link xlink:href="https://doi.org/10.5194/gmd-19-3455-2026" ext-link-type="DOI">10.5194/gmd-19-3455-2026</ext-link>, 2026.</mixed-citation></ref>
      <ref id="bib1.bibx37"><label>Karras et al.(2022)</label><mixed-citation>Karras, T., Aittala, M., Aila, T., and Laine, S.: Elucidating the design space of diffusion-based generative models, Adv. Neur. In., 35, 26565–26577, <ext-link xlink:href="https://doi.org/10.52202/068431-1926" ext-link-type="DOI">10.52202/068431-1926</ext-link>, 2022.</mixed-citation></ref>
      <ref id="bib1.bibx38"><label>Lajaunie et al.(1997)</label><mixed-citation>Lajaunie, C., Courrioux, G., and Manuel, L.: Foliation fields and 3D cartography in geology: principles of a method based on potential interpolation, Math. Geol., 29, 571–584, <ext-link xlink:href="https://doi.org/10.1007/BF02775087" ext-link-type="DOI">10.1007/BF02775087</ext-link>, 1997.</mixed-citation></ref>
      <ref id="bib1.bibx39"><label>Lee et al.(2025)</label><mixed-citation>Lee, D., Ovanger, O., Eidsvik, J., Aune, E., Skauvold, J., and Hauge, R.: Latent diffusion model for conditional reservoir facies generation, Comput. Geosci., 194, 105750, <ext-link xlink:href="https://doi.org/10.1016/j.cageo.2024.105750" ext-link-type="DOI">10.1016/j.cageo.2024.105750</ext-link>, 2025.</mixed-citation></ref>
      <ref id="bib1.bibx40"><label>Li and He(2025)</label><mixed-citation>Li, T. and He, K.: Back to basics: Let denoising generative models denoise, arXiv [preprint], <ext-link xlink:href="https://doi.org/10.48550/arXiv.2511.13720" ext-link-type="DOI">10.48550/arXiv.2511.13720</ext-link>, 2025.</mixed-citation></ref>
      <ref id="bib1.bibx41"><label>Li et al.(2025)</label><mixed-citation>Li, X., Zhao, J., and Zhou, S.: Implicit neural representations for 3D gravity inversion, Comput. Geosci., 106082, <ext-link xlink:href="https://doi.org/10.1016/j.cageo.2025.106082" ext-link-type="DOI">10.1016/j.cageo.2025.106082</ext-link>, 2025.</mixed-citation></ref>
      <ref id="bib1.bibx42"><label>Lin et al.(2025)</label><mixed-citation>Lin, L., Li, C., Wei, H., Zhong, Z., Wang, X., Li, Q., and Gorman, A.: An improved parametric 3D geologic modeling framework for seismic structure identification using deep learning in complex geologic settings, Geophysics, 90, IM81–IM102, <ext-link xlink:href="https://doi.org/10.1190/geo2024-0532.1" ext-link-type="DOI">10.1190/geo2024-0532.1</ext-link>, 2025.</mixed-citation></ref>
      <ref id="bib1.bibx43"><label>Lipman et al.(2022)</label><mixed-citation>Lipman, Y., Chen, R. T., Ben-Hamu, H., Nickel, M., and Le, M.: Flow matching for generative modeling, arXiv [preprint], <ext-link xlink:href="https://doi.org/10.48550/arXiv.2210.02747" ext-link-type="DOI">10.48550/arXiv.2210.02747</ext-link>, 2022.</mixed-citation></ref>
      <ref id="bib1.bibx44"><label>Liu et al.(2026)</label><mixed-citation>Liu, S., Qin, C., Yin, H., Yan, Q., Duan, Z.-P., Li, C., Lyu, J., Guo, C.-L., and Li, C.: Improving Reconstruction of Representation Autoencoder, arXiv [preprint], <ext-link xlink:href="https://doi.org/10.48550/arXiv.2602.08620" ext-link-type="DOI">10.48550/arXiv.2602.08620</ext-link>, 2026.</mixed-citation></ref>
      <ref id="bib1.bibx45"><label>Liu et al.(2022)</label><mixed-citation>Liu, X., Gong, C., and Liu, Q.: Flow straight and fast: Learning to generate and transfer data with rectified flow, arXiv [preprint], <ext-link xlink:href="https://doi.org/10.48550/arXiv.2209.03003" ext-link-type="DOI">10.48550/arXiv.2209.03003</ext-link>, 2022.</mixed-citation></ref>
      <ref id="bib1.bibx46"><label>Liu and Durlofsky(2021)</label><mixed-citation>Liu, Y. and Durlofsky, L. J.: 3D CNN-PCA: A deep-learning-based parameterization for complex geomodels, Comput. Geosci., 148, 104676, <ext-link xlink:href="https://doi.org/10.1016/j.cageo.2020.104676" ext-link-type="DOI">10.1016/j.cageo.2020.104676</ext-link>, 2021.</mixed-citation></ref>
      <ref id="bib1.bibx47"><label>Ma et al.(2024)</label><mixed-citation>Ma, N., Goldstein, M., Albergo, M. S., Boffi, N. M., Vanden-Eijnden, E., and Xie, S.: Sit: Exploring flow and diffusion-based generative models with scalable interpolant transformers, in: European Conference on Computer Vision, Springer, 23–40, <ext-link xlink:href="https://doi.org/10.1007/978-3-031-72980-5_2" ext-link-type="DOI">10.1007/978-3-031-72980-5_2</ext-link>, 2024.</mixed-citation></ref>
      <ref id="bib1.bibx48"><label>MacCormack et al.(2019)</label><mixed-citation>MacCormack, K. E., Rokosh, D., and Branscombe, P.: Chapter 5: The Alberta Geological Survey 3D Geological Modelling Program, Alberta Energy Regulator/Alberta Geological Survey, <uri>https://api.semanticscholar.org/CorpusID:208368942</uri> (last access: 12 August 2026), 2019.</mixed-citation></ref>
      <ref id="bib1.bibx49"><label>Mallet(1989)</label><mixed-citation>Mallet, J.-L.: Discrete smooth interpolation, ACM T. Graphic., 8, 121–144, <ext-link xlink:href="https://doi.org/10.1145/62054.62057" ext-link-type="DOI">10.1145/62054.62057</ext-link>, 1989.</mixed-citation></ref>
      <ref id="bib1.bibx50"><label>Mallet(2004)</label><mixed-citation>Mallet, J.-L.: Space–time mathematical framework for sedimentary geology, Math. Geol., 36, 1–32, <ext-link xlink:href="https://doi.org/10.1023/B:MATG.0000016228.75495.7c" ext-link-type="DOI">10.1023/B:MATG.0000016228.75495.7c</ext-link>, 2004.</mixed-citation></ref>
      <ref id="bib1.bibx51"><label>Mallet(2014)</label><mixed-citation>Mallet, J.-L.: Elements of mathematical sedimentary geology: The GeoChron model, EAGE, <ext-link xlink:href="https://doi.org/10.3997/9789462820081" ext-link-type="DOI">10.3997/9789462820081</ext-link>, 2014.</mixed-citation></ref>
      <ref id="bib1.bibx52"><label>Maxelon et al.(2009)</label><mixed-citation>Maxelon, M., Renard, P., Courrioux, G., Brändli, M., and Mancktelow, N.: A workflow to facilitate three-dimensional geometrical modelling of complex poly-deformed geological units, Comput. Geosci., 35, 644–658, <ext-link xlink:href="https://doi.org/10.1016/j.cageo.2008.06.005" ext-link-type="DOI">10.1016/j.cageo.2008.06.005</ext-link>, 2009.</mixed-citation></ref>
      <ref id="bib1.bibx53"><label>Nichol and Dhariwal(2021)</label><mixed-citation>Nichol, A. Q. and Dhariwal, P.: Improved denoising diffusion probabilistic models, in: International conference on machine learning, 8162–8171, PMLR, arXiv [preprint], <ext-link xlink:href="https://doi.org/10.48550/arXiv.2102.09672" ext-link-type="DOI">10.48550/arXiv.2102.09672</ext-link>, 2021.</mixed-citation></ref>
      <ref id="bib1.bibx54"><label>Osher(1993)</label><mixed-citation>Osher, S.: A level set formulation for the solution of the Dirichlet problem for Hamilton–Jacobi equations, SIAM J. Math. Anal., 24, 1145–1152, <ext-link xlink:href="https://doi.org/10.1137/0524066" ext-link-type="DOI">10.1137/0524066</ext-link>, 1993.</mixed-citation></ref>
      <ref id="bib1.bibx55"><label>Peebles and Xie(2023)</label><mixed-citation>Peebles, W. and Xie, S.: Scalable diffusion models with transformers, in: Proceedings of the IEEE/CVF international conference on computer vision,   4195–4205, <ext-link xlink:href="https://doi.org/10.1109/ICCV51070.2023.00387" ext-link-type="DOI">10.1109/ICCV51070.2023.00387</ext-link>, 2023.</mixed-citation></ref>
      <ref id="bib1.bibx56"><label>Pizzella et al.(2022)</label><mixed-citation>Pizzella, L., Alais, R., Lopez, S., Freulon, X., and Rivoirard, J.: Taking better advantage of fold axis data to characterize anisotropy of complex folded structures in the implicit modeling framework, Math. Geosci., 54, 95–130, <ext-link xlink:href="https://doi.org/10.1007/s11004-021-09950-0" ext-link-type="DOI">10.1007/s11004-021-09950-0</ext-link>, 2022.</mixed-citation></ref>
      <ref id="bib1.bibx57"><label>Ren et al.(2025)</label><mixed-citation>Ren, A., Wu, L., Xu, J., Xing, Y., Qiu, Q., and Xie, Z.: A deep learning method for 3D geological modeling using ET4DD with offset-attention mechanism, Comput. Geosci., 200, 105929, <ext-link xlink:href="https://doi.org/10.1016/j.cageo.2025.105929" ext-link-type="DOI">10.1016/j.cageo.2025.105929</ext-link>, 2025.</mixed-citation></ref>
      <ref id="bib1.bibx58"><label>Renaudeau et al.(2019)</label><mixed-citation>Renaudeau, J., Malvesin, E., Maerten, F., and Caumon, G.: Implicit structural modeling by minimization of the bending energy with moving least squares functions, Math. Geosci., 51, 693–724, <ext-link xlink:href="https://doi.org/10.1007/s11004-019-09789-6" ext-link-type="DOI">10.1007/s11004-019-09789-6</ext-link>, 2019.</mixed-citation></ref>
      <ref id="bib1.bibx59"><label>Rombach et al.(2022)</label><mixed-citation>Rombach, R., Blattmann, A., Lorenz, D., Esser, P., and Ommer, B.: High-resolution image synthesis with latent diffusion models, in: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition,   10684–10695, <ext-link xlink:href="https://doi.org/10.1109/CVPR52688.2022.01042" ext-link-type="DOI">10.1109/CVPR52688.2022.01042</ext-link>, 2022.</mixed-citation></ref>
      <ref id="bib1.bibx60"><label>Shah et al.(2025)</label><mixed-citation>Shah, K., Kalavasis, A., Klivans, A. R., and Daras, G.: Does generation require memorization? Creative diffusion models using ambient diffusion, arXiv [preprint], <ext-link xlink:href="https://doi.org/10.48550/arXiv.2502.21278" ext-link-type="DOI">10.48550/arXiv.2502.21278</ext-link>, 2025.</mixed-citation></ref>
      <ref id="bib1.bibx61"><label>Sheng et al.(2025)</label><mixed-citation>Sheng, H., Wu, X., Si, X., Li, J., Zhang, S., and Duan, X.: Seismic foundation model: A next generation deep-learning model in geophysics, Geophysics, 90, IM59–IM79, <ext-link xlink:href="https://doi.org/10.1190/geo2024-0262.1" ext-link-type="DOI">10.1190/geo2024-0262.1</ext-link>, 2025.</mixed-citation></ref>
      <ref id="bib1.bibx62"><label>Sohl-Dickstein et al.(2015)</label><mixed-citation>Sohl-Dickstein, J., Weiss, E., Maheswaranathan, N., and Ganguli, S.: Deep unsupervised learning using nonequilibrium thermodynamics, in: International conference on machine learning, ICML'15, arXiv [preprint], <ext-link xlink:href="https://doi.org/10.48550/arXiv.1503.03585" ext-link-type="DOI">10.48550/arXiv.1503.03585</ext-link>, 2015.</mixed-citation></ref>
      <ref id="bib1.bibx63"><label>Song et al.(2023)</label><mixed-citation>Song, B., Kwon, S. M., Zhang, Z., Hu, X., Qu, Q., and Shen, L.: Solving inverse problems with latent diffusion models via hard data consistency, arXiv [preprint], <ext-link xlink:href="https://doi.org/10.48550/arXiv.2307.08123" ext-link-type="DOI">10.48550/arXiv.2307.08123</ext-link>, 2023.</mixed-citation></ref>
      <ref id="bib1.bibx64"><label>Su et al.(2024)</label><mixed-citation>Su, J., Ahmed, M., Lu, Y., Pan, S., Bo, W., and Liu, Y.: Roformer: Enhanced transformer with rotary position embedding, Neurocomputing, 568, 127063, <ext-link xlink:href="https://doi.org/10.1016/j.neucom.2023.127063" ext-link-type="DOI">10.1016/j.neucom.2023.127063</ext-link>, 2024.</mixed-citation></ref>
      <ref id="bib1.bibx65"><label>van de Geijn et al.(2025)</label><mixed-citation>van de Geijn, C., Lüddecke, T., Turishcheva, P., and Ecker, A. S.: A Circular Argument: Does RoPE need to be Equivariant for Vision?, arXiv [preprint], <ext-link xlink:href="https://doi.org/10.48550/arXiv.2511.08368" ext-link-type="DOI">10.48550/arXiv.2511.08368</ext-link>, 2025.</mixed-citation></ref>
      <ref id="bib1.bibx66"><label>Vollgger et al.(2015)</label><mixed-citation>Vollgger, S. A., Cruden, A. R., Ailleres, L., and Cowan, E. J.: Regional dome evolution and its control on ore-grade distribution: Insights from 3D implicit modelling of the Navachab gold deposit, Namibia, Ore Geol. Rev., 69, 268–284, <ext-link xlink:href="https://doi.org/10.1016/j.oregeorev.2015.02.020" ext-link-type="DOI">10.1016/j.oregeorev.2015.02.020</ext-link>, 2015.</mixed-citation></ref>
      <ref id="bib1.bibx67"><label>Wang et al.(2023)</label><mixed-citation>Wang, S., Cai, Z., Si, X., and Cui, Y.: A three-dimensional geological structure modeling framework and its application in machine learning, Math. Geosci., 55, 163–200, <ext-link xlink:href="https://doi.org/10.1007/s11004-022-10027-9" ext-link-type="DOI">10.1007/s11004-022-10027-9</ext-link>, 2023.</mixed-citation></ref>
      <ref id="bib1.bibx68"><label>Wellmann and Caumon(2018)</label><mixed-citation>Wellmann, F. and Caumon, G.: 3-D Structural geological models: Concepts, methods, and uncertainties, in: Advances in geophysics, Elsevier, vol. 59, 1–121, <ext-link xlink:href="https://doi.org/10.1016/bs.agph.2018.09.001" ext-link-type="DOI">10.1016/bs.agph.2018.09.001</ext-link>, 2018.</mixed-citation></ref>
      <ref id="bib1.bibx69"><label>Wu and Hale(2015)</label><mixed-citation>Wu, X. and Hale, D.: 3D seismic image processing for unconformities, Geophysics, 80, IM35–IM44, <ext-link xlink:href="https://doi.org/10.1190/geo2014-0323.1" ext-link-type="DOI">10.1190/geo2014-0323.1</ext-link>, 2015.</mixed-citation></ref>
      <ref id="bib1.bibx70"><label>Wu et al.(2020)</label><mixed-citation>Wu, X., Geng, Z., Shi, Y., Pham, N., Fomel, S., and Caumon, G.: Building realistic structure models to train convolutional neural networks for seismic structural interpretation, Geophysics, 85, WA27–WA39, <ext-link xlink:href="https://doi.org/10.1190/geo2019-0375.1" ext-link-type="DOI">10.1190/geo2019-0375.1</ext-link>, 2020.</mixed-citation></ref>
      <ref id="bib1.bibx71"><label>Wu et al.(2023)</label><mixed-citation>Wu, X., Ma, J., Si, X., Bi, Z., Yang, J., Gao, H., Xie, D., Guo, Z., and Zhang, J.: Sensing prior constraints in deep neural networks for solving exploration geophysical problems, P. Natl. Acad. Sci. USA, 120, e2219573120, <ext-link xlink:href="https://doi.org/10.1073/pnas.2219573120" ext-link-type="DOI">10.1073/pnas.2219573120</ext-link>, 2023.</mixed-citation></ref>
      <ref id="bib1.bibx72"><label>Yang et al.(2019)</label><mixed-citation>Yang, L., Hyde, D., Grujic, O., Scheidt, C., and Caers, J.: Assessing and visualizing uncertainty of 3D geological surfaces using level sets with stochastic motion, Comput. Geosci., 122, 54–67, <ext-link xlink:href="https://doi.org/10.1016/j.cageo.2018.10.006" ext-link-type="DOI">10.1016/j.cageo.2018.10.006</ext-link>, 2019. </mixed-citation></ref>
      <ref id="bib1.bibx73"><label>Zhang et al.(2024)</label><mixed-citation>Zhang, B., Xu, Z., Wei, X., Song, L., Shah, S. Y. A., Khan, U., Du, L., and Li, X.: Deep subsurface pseudo-lithostratigraphic modeling based on three-dimensional convolutional neural network (3D CNN) using inversed geophysical properties and shallow subsurface geological model, Lithosphere, 2024, lithosphere_2023_273, <ext-link xlink:href="https://doi.org/10.2113/2024/lithosphere_2023_273" ext-link-type="DOI">10.2113/2024/lithosphere_2023_273</ext-link>, 2024.</mixed-citation></ref>
      <ref id="bib1.bibx74"><label>Zheglova et al.(2018)</label><mixed-citation>Zheglova, P., Lelièvre, P. G., and Farquharson, C. G.: Multiple level-set joint inversion of traveltime and gravity data with application to ore delineation: A synthetic study, Geophysics, 83, R13–R30, <ext-link xlink:href="https://doi.org/10.1190/geo2016-0675.1" ext-link-type="DOI">10.1190/geo2016-0675.1</ext-link>, 2018.</mixed-citation></ref>
      <ref id="bib1.bibx75"><label>Zhong et al.(2019)</label><mixed-citation>Zhong, D.-Y., Wang, L.-G., Bi, L., and Jia, M.-T.: Implicit modeling of complex orebody with constraints of geological rules, T. Nonferr. Metal. Soc., 29, 2392–2399, <ext-link xlink:href="https://doi.org/10.1016/S1003-6326(19)65145-9" ext-link-type="DOI">10.1016/S1003-6326(19)65145-9</ext-link>, 2019.</mixed-citation></ref>
      <ref id="bib1.bibx76"><label>Zhou et al.(2024)</label><mixed-citation>Zhou, Z., Chen, D., Wang, C., Chen, C., and Lyu, S.: Simple and fast distillation of diffusion models, Adv. Neur. In., 37, 40831–40860, <ext-link xlink:href="https://doi.org/10.52202/079017-1291" ext-link-type="DOI">10.52202/079017-1291</ext-link>, 2024.</mixed-citation></ref>

  </ref-list></back>
    <!--<article-title-html>LFD (v1.0): latent-compression-free generative diffusion with geological priors and geophysical regularization for implicit structural modeling</article-title-html>
<abstract-html/>
<ref-html id="bib1.bib1"><label>Alemi et al.(2016)</label><mixed-citation>
      
Alemi, A. A., Fischer, I., Dillon, J. V., and Murphy, K.: Deep variational information bottleneck, arXiv [preprint], <a href="https://doi.org/10.48550/arXiv.1612.00410" target="_blank">https://doi.org/10.48550/arXiv.1612.00410</a>, 2016.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib2"><label>Arienti et al.(2025)</label><mixed-citation>
      
Arienti, G., Bistacchi, A., Caumon, G., Monopoli, B., and Dal Piaz, G.: 3D structural implicit modelling of folded metamorphic units at Lago di Cignana with uncertainty assessment, J. Struct. Geol., 191, 105329,
<a href="https://doi.org/10.1016/j.jsg.2024.105329" target="_blank">https://doi.org/10.1016/j.jsg.2024.105329</a>, 2025.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib3"><label>Belhachmi et al.(2025)</label><mixed-citation>
      
Belhachmi, A., Benabbou, A., and Mourrain, B.: A spline-based regularized method for the reconstruction of complex geological models, Math. Geosci., 57, 89–114, <a href="https://doi.org/10.1007/s11004-024-10149-2" target="_blank">https://doi.org/10.1007/s11004-024-10149-2</a>, 2025.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib4"><label>Bi et al.(2021)</label><mixed-citation>
      
Bi, Z., Wu, X., Geng, Z., and Li, H.: Deep relative geologic time: A deep learning method for simultaneously interpreting 3-D seismic horizons and faults, J. Geophys. Res.-Sol. Ea., 126, e2021JB021882,
<a href="https://doi.org/10.1029/2021JB021882" target="_blank">https://doi.org/10.1029/2021JB021882</a>, 2021.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib5"><label>Bi et al.(2022)</label><mixed-citation>
      
Bi, Z., Wu, X., Li, Z., Chang, D., and Yong, X.: DeepISMNet: three-dimensional implicit structural modeling with convolutional neural network, Geosci. Model Dev., 15, 6841–6861, <a href="https://doi.org/10.5194/gmd-15-6841-2022" target="_blank">https://doi.org/10.5194/gmd-15-6841-2022</a>, 2022.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib6"><label>Bonnaire et al.(2025)</label><mixed-citation>
      
Bonnaire, T., Urfin, R., Biroli, G., and Mézard, M.: Why Diffusion Models
Don't Memorize: The Role of Implicit Dynamical Regularization in Training, arXiv [preprint], <a href="https://doi.org/10.48550/arXiv.2505.17638" target="_blank">https://doi.org/10.48550/arXiv.2505.17638</a>, 2025.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib7"><label>Calcagno et al.(2008)</label><mixed-citation>
      
Calcagno, P., Chilès, J.-P., Courrioux, G., and Guillen, A.: Geological modelling from field data and geological knowledge: Part I. Modelling method coupling 3D potential-field interpolation and geological rules, Phys. Earth Planet. In., 171, 147–157, <a href="https://doi.org/10.1016/j.pepi.2008.06.013" target="_blank">https://doi.org/10.1016/j.pepi.2008.06.013</a>, 2008.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib8"><label>Caumon et al.(2009)</label><mixed-citation>
      
Caumon, G., Collon-Drouaillet, P., Le Carlier de Veslud, C., Viseur, S., and Sausse, J.: Surface-based 3D modeling of geological structures, Math. Geosci., 41, 927–945, <a href="https://doi.org/10.1007/s11004-009-9244-2" target="_blank">https://doi.org/10.1007/s11004-009-9244-2</a>, 2009.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib9"><label>Caumon et al.(2013)</label><mixed-citation>
      
Caumon, G., Gray, G., Antoine, C., and Titeux, M.-O.: Three-dimensional implicit stratigraphic model building from remote sensing data on tetrahedral meshes: theory and application to a regional model of La Popa Basin, NE Mexico, IEEE T. Geosci. Remote, 51, 1613–1621,  <a href="https://doi.org/10.1109/TGRS.2012.2207727" target="_blank">https://doi.org/10.1109/TGRS.2012.2207727</a>, 2013.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib10"><label>Chapelle et al.(2009)</label><mixed-citation>
      
Chapelle, O., Scholkopf, B., and Zien, A.: Semi-supervised learning (Chapelle, O. et al., Eds.; 2006) [book reviews], IEEE T. Neural Networ., 20, 542–542, <a href="https://doi.org/10.1109/TNN.2009.2015974" target="_blank">https://doi.org/10.1109/TNN.2009.2015974</a>, 2009.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib11"><label>Chilès et al.(2007)</label><mixed-citation>
      
Chilès, J., Aug, C., Guillen, A., and Lees, T.: Modelling the geometry of geological units and its uncertainty in 3D from structural data: the potential-field method, in: Orebody Modelling and Strategic Mine Planning – Uncertainty and Risk Management Models, edited by: Dimitrakopoulos, R., 2nd edn., Spectrum Series, vol. 14, The Australasian Institute of Mining and Metallurgy, Melbourne, Australia, <a href="https://hal.science/hal-00796180" target="_blank"/> (last access: 12 August 2026), 2007.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib12"><label>Choi et al.(2021)</label><mixed-citation>
      
Choi, J., Kim, S., Jeong, Y., Gwon, Y., and Yoon, S.: ILVR: Conditioning Method for Denoising Diffusion Probabilistic Models, 2021 IEEE/CVF International Conference on Computer Vision (ICCV), Montreal, QC, Canada, 2021, 14347–14356, <a href="https://doi.org/10.1109/ICCV48922.2021.01410" target="_blank">https://doi.org/10.1109/ICCV48922.2021.01410</a>, 2021.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib13"><label>Cowan et al.(2002)</label><mixed-citation>
      
Cowan, E. J., Beatson, R. K., Fright, W. R., McLennan, T. J., and Mitchell, T. J.: Rapid geological modelling, in: Applied Structural Geology for Mineral Exploration and Mining, International Symposium, Kalgoorlie, Australia, 23–25 September 2002, Australian Institute of Geoscientists, <a href="https://api.semanticscholar.org/CorpusID:160034199" target="_blank"/> (last access: 12 August 2026), 2002.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib14"><label>Dao et al.(2023)</label><mixed-citation>
      
Dao, Q., Phung, H., Nguyen, B., and Tran, A.: Flow matching in latent space, arXiv [preprint], <a href="https://doi.org/10.48550/arXiv.2307.08698" target="_blank">https://doi.org/10.48550/arXiv.2307.08698</a>, 2023.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib15"><label>de la Varga et al.(2019)</label><mixed-citation>
      
de la Varga, M., Schaaf, A., and Wellmann, F.: GemPy 1.0: open-source stochastic geological modeling and inversion, Geosci. Model Dev., 12, 1–32, <a href="https://doi.org/10.5194/gmd-12-1-2019" target="_blank">https://doi.org/10.5194/gmd-12-1-2019</a>, 2019.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib16"><label>Fan et al.(2025)</label><mixed-citation>
      
Fan, W., Azevedo, L., Liu, G., Chen, Q., Wu, X., and Li, Y.: Automatic reconstruction of 3D geological models based on Recurrent Neural Network and
predictive learning, Comput. Geosci., 105996,
<a href="https://doi.org/10.1016/j.cageo.2025.105996" target="_blank">https://doi.org/10.1016/j.cageo.2025.105996</a>, 2025.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib17"><label>Frank(2007)</label><mixed-citation>
      
Frank, T.: Advanced visualization and modeling of tetrahedral meshes,
Gesellschaft für Informatik, Bonn, ISBN 978-3-88579-411-0, 2007.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib18"><label>Gao and Wellmann(2025)</label><mixed-citation>
      
Gao, K. and Wellmann, F.: Fault representation in structural modelling with
implicit neural representations, Comput. Geosci., 199, 105911,
<a href="https://doi.org/10.1016/j.cageo.2025.105911" target="_blank">https://doi.org/10.1016/j.cageo.2025.105911</a>, 2025.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib19"><label>Garayt et al.(2025)</label><mixed-citation>
      
Garayt, C., Desassis, N., Blusseau, S., Gibert, P.-M., Langanay, J., and Romary, T.: Two-dimensional stochastic structural geomodeling with deep generative adversarial networks, Math. Geosci., 57, 1095–1114,
<a href="https://doi.org/10.1007/s11004-025-10188-3" target="_blank">https://doi.org/10.1007/s11004-025-10188-3</a>, 2025.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib20"><label>Gat et al.(2024)</label><mixed-citation>
      
Gat, I., Remez, T., Shaul, N., Kreuk, F., Chen, R. T., Synnaeve, G., Adi, Y., and Lipman, Y.: Discrete flow matching, Adv. Neur. In., 37, 133345–133385, <a href="https://doi.org/10.52202/079017-4239" target="_blank">https://doi.org/10.52202/079017-4239</a>, 2024.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib21"><label>Gillberg et al.(2014)</label><mixed-citation>
      
Gillberg, T., Bruaset, A. M., Hjelle, Ø., and Sourouri, M.: Parallel solutions of static Hamilton-Jacobi equations for simulations of geological folds, Journal of Mathematics in Industry, 4, 10,
<a href="https://doi.org/10.1186/2190-5983-4-10" target="_blank">https://doi.org/10.1186/2190-5983-4-10</a>, 2014.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib22"><label>Giraud et al.(2020)</label><mixed-citation>
      
Giraud, J., Lindsay, M., Jessell, M., and Ogarko, V.: Towards plausible lithological classification from geophysical inversion: honouring geological principles in subsurface imaging, Solid Earth, 11, 419–436, <a href="https://doi.org/10.5194/se-11-419-2020" target="_blank">https://doi.org/10.5194/se-11-419-2020</a>, 2020.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib23"><label>Giraud et al.(2024)</label><mixed-citation>
      
Giraud, J., Caumon, G., Grose, L., Ogarko, V., and Cupillard, P.: Integration of automatic implicit geological modelling in deterministic geophysical inversion, Solid Earth, 15, 63–89, <a href="https://doi.org/10.5194/se-15-63-2024" target="_blank">https://doi.org/10.5194/se-15-63-2024</a>, 2024.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib24"><label>Grose et al.(2021)</label><mixed-citation>
      
Grose, L., Ailleres, L., Laurent, G., and Jessell, M.: LoopStructural 1.0: time-aware geological modelling, Geosci. Model Dev., 14, 3915–3937, <a href="https://doi.org/10.5194/gmd-14-3915-2021" target="_blank">https://doi.org/10.5194/gmd-14-3915-2021</a>, 2021.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib25"><label>Guo et al.(2018)</label><mixed-citation>
      
Guo, J., Wu, L., Zhou, W., Li, C., and Li, F.: Section-constrained local geological interface dynamic updating method based on the HRBF surface, J. Struct. Geol., 107, 64–72, <a href="https://doi.org/10.1016/j.jsg.2017.11.017" target="_blank">https://doi.org/10.1016/j.jsg.2017.11.017</a>, 2018.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib26"><label>Guo et al.(2025)</label><mixed-citation>
      
Guo, Z., Wu, X., Liang, L., Sheng, H., Chen, N., and Bi, Z.: Cross-domain foundation model adaptation: Pioneering computer vision models for geophysical data analysis, Journal of Geophysical Research: Machine Learning
and Computation, 2, e2025JH000601, <a href="https://doi.org/10.1029/2025JH000601" target="_blank">https://doi.org/10.1029/2025JH000601</a>, 2025.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib27"><label>Guo et al.(2026)</label><mixed-citation>
      
Guo, Z., Wu, X., Dou, Y., Gao, H., and Caumon, G.: Code from “Latent-Compression-Free Generative Diffusion with Geological Priors and Geophysical Regularization for Implicit Structural Modeling”, Zenodo [code], <a href="https://doi.org/10.5281/zenodo.20508635" target="_blank">https://doi.org/10.5281/zenodo.20508635</a>, 2026.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib28"><label>Heo et al.(2024)</label><mixed-citation>
      
Heo, B., Park, S., Han, D., and Yun, S.: Rotary position embedding for vision
transformer, in: European Conference on Computer Vision, Springer, 289–305, <a href="https://doi.org/10.1007/978-3-031-72684-2_17" target="_blank">https://doi.org/10.1007/978-3-031-72684-2_17</a>, 2024.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib29"><label>Hillier et al.(2021)</label><mixed-citation>
      
Hillier, M., Wellmann, F., Brodaric, B., de Kemp, E., and Schetselaar, E.: Three-dimensional structural geological modeling using graph neural networks, Math. Geosci., 53, 1725–1749, <a href="https://doi.org/10.1007/s11004-021-09945-x" target="_blank">https://doi.org/10.1007/s11004-021-09945-x</a>, 2021.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib30"><label>Hillier et al.(2023)</label><mixed-citation>
      
Hillier, M., Wellmann, F., de Kemp, E. A., Brodaric, B., Schetselaar, E., and Bédard, K.: GeoINR 1.0: an implicit neural network approach to three-dimensional geological modelling, Geosci. Model Dev., 16, 6987–7012, <a href="https://doi.org/10.5194/gmd-16-6987-2023" target="_blank">https://doi.org/10.5194/gmd-16-6987-2023</a>, 2023.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib31"><label>Hjelle and Petersen(2011)</label><mixed-citation>
      
Hjelle, Ø. and Petersen, S. A.: A Hamilton–Jacobi framework for modeling
folds in structural geology, Math. Geosci., 43, 741–761,
<a href="https://doi.org/10.1007/s11004-011-9357-2" target="_blank">https://doi.org/10.1007/s11004-011-9357-2</a>, 2011.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib32"><label>Ho et al.(2020)</label><mixed-citation>
      
Ho, J., Jain, A., and Abbeel, P.: Denoising diffusion probabilistic models, arXiv [preprint], <a href="https://doi.org/10.48550/arXiv.2006.11239" target="_blank">https://doi.org/10.48550/arXiv.2006.11239</a>, 2020.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib33"><label>Houlding(1994)</label><mixed-citation>
      
Houlding, S.: 3D Geoscience Modeling: Computer Techniques for Geological Characterization, 3D Geoscience Modeling: Computer Techniques for Geological Characterization, Springer-Verlag, ISBN 9783540580157,
<a href="https://doi.org/10.1007/978-3-642-79012-6" target="_blank">https://doi.org/10.1007/978-3-642-79012-6</a>, 1994.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib34"><label>Huang and Liu(2017)</label><mixed-citation>
      
Huang, L. and Liu, C.-Y.: Three types of flower structures in a divergent-wrench fault zone, J. Geophys. Res.-Sol. Ea., 122, 10–478, <a href="https://doi.org/10.1002/2017JB014675" target="_blank">https://doi.org/10.1002/2017JB014675</a>, 2017.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib35"><label>Irakarama et al.(2022)</label><mixed-citation>
      
Irakarama, M., Thierry-Coudon, M., Zakari, M., and Caumon, G.: Finite element implicit 3D subsurface structural modeling, Comput. Aided Design, 149,
103267, <a href="https://doi.org/10.1016/j.cad.2022.103267" target="_blank">https://doi.org/10.1016/j.cad.2022.103267</a>, 2022.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib36"><label>Kamath et al.(2026)</label><mixed-citation>
      
Kamath, A. V., Thiele, S. T., Moulard, M., Grose, L., Tolosana-Delgado, R., Hillier, M. J., Wellmann, F., and Gloaguen, R.: Curlew 1.0: Spatio-temporal implicit geological modelling with neural fields in python, Geosci. Model Dev., 19, 3455–3475, <a href="https://doi.org/10.5194/gmd-19-3455-2026" target="_blank">https://doi.org/10.5194/gmd-19-3455-2026</a>, 2026.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib37"><label>Karras et al.(2022)</label><mixed-citation>
      
Karras, T., Aittala, M., Aila, T., and Laine, S.: Elucidating the design space of diffusion-based generative models, Adv. Neur. In., 35, 26565–26577, <a href="https://doi.org/10.52202/068431-1926" target="_blank">https://doi.org/10.52202/068431-1926</a>, 2022.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib38"><label>Lajaunie et al.(1997)</label><mixed-citation>
      
Lajaunie, C., Courrioux, G., and Manuel, L.: Foliation fields and 3D cartography in geology: principles of a method based on potential interpolation, Math. Geol., 29, 571–584, <a href="https://doi.org/10.1007/BF02775087" target="_blank">https://doi.org/10.1007/BF02775087</a>, 1997.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib39"><label>Lee et al.(2025)</label><mixed-citation>
      
Lee, D., Ovanger, O., Eidsvik, J., Aune, E., Skauvold, J., and Hauge, R.: Latent diffusion model for conditional reservoir facies generation, Comput. Geosci., 194, 105750, <a href="https://doi.org/10.1016/j.cageo.2024.105750" target="_blank">https://doi.org/10.1016/j.cageo.2024.105750</a>, 2025.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib40"><label>Li and He(2025)</label><mixed-citation>
      
Li, T. and He, K.: Back to basics: Let denoising generative models denoise, arXiv [preprint], <a href="https://doi.org/10.48550/arXiv.2511.13720" target="_blank">https://doi.org/10.48550/arXiv.2511.13720</a>, 2025.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib41"><label>Li et al.(2025)</label><mixed-citation>
      
Li, X., Zhao, J., and Zhou, S.: Implicit neural representations for 3D gravity inversion, Comput. Geosci., 106082,
<a href="https://doi.org/10.1016/j.cageo.2025.106082" target="_blank">https://doi.org/10.1016/j.cageo.2025.106082</a>, 2025.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib42"><label>Lin et al.(2025)</label><mixed-citation>
      
Lin, L., Li, C., Wei, H., Zhong, Z., Wang, X., Li, Q., and Gorman, A.: An improved parametric 3D geologic modeling framework for seismic structure identification using deep learning in complex geologic settings, Geophysics,
90, IM81–IM102, <a href="https://doi.org/10.1190/geo2024-0532.1" target="_blank">https://doi.org/10.1190/geo2024-0532.1</a>, 2025.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib43"><label>Lipman et al.(2022)</label><mixed-citation>
      
Lipman, Y., Chen, R. T., Ben-Hamu, H., Nickel, M., and Le, M.: Flow matching for generative modeling, arXiv [preprint], <a href="https://doi.org/10.48550/arXiv.2210.02747" target="_blank">https://doi.org/10.48550/arXiv.2210.02747</a>, 2022.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib44"><label>Liu et al.(2026)</label><mixed-citation>
      
Liu, S., Qin, C., Yin, H., Yan, Q., Duan, Z.-P., Li, C., Lyu, J., Guo, C.-L., and Li, C.: Improving Reconstruction of Representation Autoencoder, arXiv [preprint], <a href="https://doi.org/10.48550/arXiv.2602.08620" target="_blank">https://doi.org/10.48550/arXiv.2602.08620</a>, 2026.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib45"><label>Liu et al.(2022)</label><mixed-citation>
      
Liu, X., Gong, C., and Liu, Q.: Flow straight and fast: Learning to generate and transfer data with rectified flow, arXiv [preprint], <a href="https://doi.org/10.48550/arXiv.2209.03003" target="_blank">https://doi.org/10.48550/arXiv.2209.03003</a>, 2022.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib46"><label>Liu and Durlofsky(2021)</label><mixed-citation>
      
Liu, Y. and Durlofsky, L. J.: 3D CNN-PCA: A deep-learning-based parameterization for complex geomodels, Comput. Geosci., 148, 104676, <a href="https://doi.org/10.1016/j.cageo.2020.104676" target="_blank">https://doi.org/10.1016/j.cageo.2020.104676</a>, 2021.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib47"><label>Ma et al.(2024)</label><mixed-citation>
      
Ma, N., Goldstein, M., Albergo, M. S., Boffi, N. M., Vanden-Eijnden, E., and Xie, S.: Sit: Exploring flow and diffusion-based generative models with scalable interpolant transformers, in: European Conference on Computer Vision, Springer, 23–40, <a href="https://doi.org/10.1007/978-3-031-72980-5_2" target="_blank">https://doi.org/10.1007/978-3-031-72980-5_2</a>, 2024.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib48"><label>MacCormack et al.(2019)</label><mixed-citation>
      
MacCormack, K. E., Rokosh, D., and Branscombe, P.: Chapter 5: The Alberta Geological Survey 3D Geological Modelling Program, Alberta Energy Regulator/Alberta Geological Survey, <a href="https://api.semanticscholar.org/CorpusID:208368942" target="_blank"/> (last access: 12 August 2026), 2019.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib49"><label>Mallet(1989)</label><mixed-citation>
      
Mallet, J.-L.: Discrete smooth interpolation, ACM T. Graphic., 8, 121–144, <a href="https://doi.org/10.1145/62054.62057" target="_blank">https://doi.org/10.1145/62054.62057</a>, 1989.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib50"><label>Mallet(2004)</label><mixed-citation>
      
Mallet, J.-L.: Space–time mathematical framework for sedimentary geology, Math. Geol., 36, 1–32, <a href="https://doi.org/10.1023/B:MATG.0000016228.75495.7c" target="_blank">https://doi.org/10.1023/B:MATG.0000016228.75495.7c</a>, 2004.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib51"><label>Mallet(2014)</label><mixed-citation>
      
Mallet, J.-L.: Elements of mathematical sedimentary geology: The GeoChron
model, EAGE, <a href="https://doi.org/10.3997/9789462820081" target="_blank">https://doi.org/10.3997/9789462820081</a>, 2014.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib52"><label>Maxelon et al.(2009)</label><mixed-citation>
      
Maxelon, M., Renard, P., Courrioux, G., Brändli, M., and Mancktelow, N.: A workflow to facilitate three-dimensional geometrical modelling of complex
poly-deformed geological units, Comput. Geosci., 35, 644–658,
<a href="https://doi.org/10.1016/j.cageo.2008.06.005" target="_blank">https://doi.org/10.1016/j.cageo.2008.06.005</a>, 2009.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib53"><label>Nichol and Dhariwal(2021)</label><mixed-citation>
      
Nichol, A. Q. and Dhariwal, P.: Improved denoising diffusion probabilistic
models, in: International conference on machine learning, 8162–8171,
PMLR, arXiv [preprint], <a href="https://doi.org/10.48550/arXiv.2102.09672" target="_blank">https://doi.org/10.48550/arXiv.2102.09672</a>, 2021.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib54"><label>Osher(1993)</label><mixed-citation>
      
Osher, S.: A level set formulation for the solution of the Dirichlet problem for Hamilton–Jacobi equations, SIAM J. Math. Anal., 24, 1145–1152, <a href="https://doi.org/10.1137/0524066" target="_blank">https://doi.org/10.1137/0524066</a>, 1993.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib55"><label>Peebles and Xie(2023)</label><mixed-citation>
      
Peebles, W. and Xie, S.: Scalable diffusion models with transformers, in: Proceedings of the IEEE/CVF international conference on computer vision,   4195–4205, <a href="https://doi.org/10.1109/ICCV51070.2023.00387" target="_blank">https://doi.org/10.1109/ICCV51070.2023.00387</a>, 2023.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib56"><label>Pizzella et al.(2022)</label><mixed-citation>
      
Pizzella, L., Alais, R., Lopez, S., Freulon, X., and Rivoirard, J.: Taking better advantage of fold axis data to characterize anisotropy of complex folded structures in the implicit modeling framework, Math. Geosci., 54, 95–130, <a href="https://doi.org/10.1007/s11004-021-09950-0" target="_blank">https://doi.org/10.1007/s11004-021-09950-0</a>, 2022.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib57"><label>Ren et al.(2025)</label><mixed-citation>
      
Ren, A., Wu, L., Xu, J., Xing, Y., Qiu, Q., and Xie, Z.: A deep learning method for 3D geological modeling using ET4DD with offset-attention mechanism, Comput. Geosci., 200, 105929, <a href="https://doi.org/10.1016/j.cageo.2025.105929" target="_blank">https://doi.org/10.1016/j.cageo.2025.105929</a>,
2025.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib58"><label>Renaudeau et al.(2019)</label><mixed-citation>
      
Renaudeau, J., Malvesin, E., Maerten, F., and Caumon, G.: Implicit structural modeling by minimization of the bending energy with moving least squares functions, Math. Geosci., 51, 693–724, <a href="https://doi.org/10.1007/s11004-019-09789-6" target="_blank">https://doi.org/10.1007/s11004-019-09789-6</a>, 2019.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib59"><label>Rombach et al.(2022)</label><mixed-citation>
      
Rombach, R., Blattmann, A., Lorenz, D., Esser, P., and Ommer, B.: High-resolution image synthesis with latent diffusion models, in: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition,   10684–10695, <a href="https://doi.org/10.1109/CVPR52688.2022.01042" target="_blank">https://doi.org/10.1109/CVPR52688.2022.01042</a>, 2022.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib60"><label>Shah et al.(2025)</label><mixed-citation>
      
Shah, K., Kalavasis, A., Klivans, A. R., and Daras, G.: Does generation require memorization? Creative diffusion models using ambient diffusion, arXiv [preprint], <a href="https://doi.org/10.48550/arXiv.2502.21278" target="_blank">https://doi.org/10.48550/arXiv.2502.21278</a>, 2025.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib61"><label>Sheng et al.(2025)</label><mixed-citation>
      
Sheng, H., Wu, X., Si, X., Li, J., Zhang, S., and Duan, X.: Seismic foundation model: A next generation deep-learning model in geophysics, Geophysics, 90, IM59–IM79, <a href="https://doi.org/10.1190/geo2024-0262.1" target="_blank">https://doi.org/10.1190/geo2024-0262.1</a>, 2025.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib62"><label>Sohl-Dickstein et al.(2015)</label><mixed-citation>
      
Sohl-Dickstein, J., Weiss, E., Maheswaranathan, N., and Ganguli, S.: Deep unsupervised learning using nonequilibrium thermodynamics, in: International
conference on machine learning, ICML'15, arXiv [preprint], <a href="https://doi.org/10.48550/arXiv.1503.03585" target="_blank">https://doi.org/10.48550/arXiv.1503.03585</a>, 2015.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib63"><label>Song et al.(2023)</label><mixed-citation>
      
Song, B., Kwon, S. M., Zhang, Z., Hu, X., Qu, Q., and Shen, L.: Solving inverse problems with latent diffusion models via hard data consistency, arXiv [preprint], <a href="https://doi.org/10.48550/arXiv.2307.08123" target="_blank">https://doi.org/10.48550/arXiv.2307.08123</a>, 2023.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib64"><label>Su et al.(2024)</label><mixed-citation>
      
Su, J., Ahmed, M., Lu, Y., Pan, S., Bo, W., and Liu, Y.: Roformer: Enhanced
transformer with rotary position embedding, Neurocomputing, 568, 127063,
<a href="https://doi.org/10.1016/j.neucom.2023.127063" target="_blank">https://doi.org/10.1016/j.neucom.2023.127063</a>, 2024.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib65"><label>van de Geijn et al.(2025)</label><mixed-citation>
      
van de Geijn, C., Lüddecke, T., Turishcheva, P., and Ecker, A. S.: A
Circular Argument: Does RoPE need to be Equivariant for Vision?, arXiv [preprint], <a href="https://doi.org/10.48550/arXiv.2511.08368" target="_blank">https://doi.org/10.48550/arXiv.2511.08368</a>, 2025.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib66"><label>Vollgger et al.(2015)</label><mixed-citation>
      
Vollgger, S. A., Cruden, A. R., Ailleres, L., and Cowan, E. J.: Regional dome evolution and its control on ore-grade distribution: Insights from 3D implicit modelling of the Navachab gold deposit, Namibia, Ore Geol. Rev., 69, 268–284, <a href="https://doi.org/10.1016/j.oregeorev.2015.02.020" target="_blank">https://doi.org/10.1016/j.oregeorev.2015.02.020</a>, 2015.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib67"><label>Wang et al.(2023)</label><mixed-citation>
      
Wang, S., Cai, Z., Si, X., and Cui, Y.: A three-dimensional geological structure modeling framework and its application in machine learning, Math. Geosci., 55, 163–200, <a href="https://doi.org/10.1007/s11004-022-10027-9" target="_blank">https://doi.org/10.1007/s11004-022-10027-9</a>, 2023.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib68"><label>Wellmann and Caumon(2018)</label><mixed-citation>
      
Wellmann, F. and Caumon, G.: 3-D Structural geological models: Concepts, methods, and uncertainties, in: Advances in geophysics, Elsevier, vol. 59, 1–121, <a href="https://doi.org/10.1016/bs.agph.2018.09.001" target="_blank">https://doi.org/10.1016/bs.agph.2018.09.001</a>, 2018.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib69"><label>Wu and Hale(2015)</label><mixed-citation>
      
Wu, X. and Hale, D.: 3D seismic image processing for unconformities, Geophysics, 80, IM35–IM44, <a href="https://doi.org/10.1190/geo2014-0323.1" target="_blank">https://doi.org/10.1190/geo2014-0323.1</a>, 2015.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib70"><label>Wu et al.(2020)</label><mixed-citation>
      
Wu, X., Geng, Z., Shi, Y., Pham, N., Fomel, S., and Caumon, G.: Building realistic structure models to train convolutional neural networks for seismic
structural interpretation, Geophysics, 85, WA27–WA39,
<a href="https://doi.org/10.1190/geo2019-0375.1" target="_blank">https://doi.org/10.1190/geo2019-0375.1</a>, 2020.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib71"><label>Wu et al.(2023)</label><mixed-citation>
      
Wu, X., Ma, J., Si, X., Bi, Z., Yang, J., Gao, H., Xie, D., Guo, Z., and Zhang, J.: Sensing prior constraints in deep neural networks for solving exploration geophysical problems, P. Natl. Acad. Sci. USA, 120, e2219573120, <a href="https://doi.org/10.1073/pnas.2219573120" target="_blank">https://doi.org/10.1073/pnas.2219573120</a>, 2023.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib72"><label>Yang et al.(2019)</label><mixed-citation>
      
Yang, L., Hyde, D., Grujic, O., Scheidt, C., and Caers, J.: Assessing and visualizing uncertainty of 3D geological surfaces using level sets with stochastic motion, Comput. Geosci., 122, 54–67, <a href="https://doi.org/10.1016/j.cageo.2018.10.006" target="_blank">https://doi.org/10.1016/j.cageo.2018.10.006</a>, 2019.


    </mixed-citation></ref-html>
<ref-html id="bib1.bib73"><label>Zhang et al.(2024)</label><mixed-citation>
      
Zhang, B., Xu, Z., Wei, X., Song, L., Shah, S. Y. A., Khan, U., Du, L., and Li, X.: Deep subsurface pseudo-lithostratigraphic modeling based on three-dimensional convolutional neural network (3D CNN) using inversed geophysical properties and shallow subsurface geological model, Lithosphere, 2024, lithosphere_2023_273, <a href="https://doi.org/10.2113/2024/lithosphere_2023_273" target="_blank">https://doi.org/10.2113/2024/lithosphere_2023_273</a>, 2024.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib74"><label>Zheglova et al.(2018)</label><mixed-citation>
      
Zheglova, P., Lelièvre, P. G., and Farquharson, C. G.: Multiple level-set
joint inversion of traveltime and gravity data with application to ore
delineation: A synthetic study, Geophysics, 83, R13–R30,
<a href="https://doi.org/10.1190/geo2016-0675.1" target="_blank">https://doi.org/10.1190/geo2016-0675.1</a>, 2018.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib75"><label>Zhong et al.(2019)</label><mixed-citation>
      
Zhong, D.-Y., Wang, L.-G., Bi, L., and Jia, M.-T.: Implicit modeling of complex orebody with constraints of geological rules, T. Nonferr. Metal. Soc., 29, 2392–2399, <a href="https://doi.org/10.1016/S1003-6326(19)65145-9" target="_blank">https://doi.org/10.1016/S1003-6326(19)65145-9</a>, 2019.

    </mixed-citation></ref-html>
<ref-html id="bib1.bib76"><label>Zhou et al.(2024)</label><mixed-citation>
      
Zhou, Z., Chen, D., Wang, C., Chen, C., and Lyu, S.: Simple and fast
distillation of diffusion models, Adv. Neur. In., 37, 40831–40860, <a href="https://doi.org/10.52202/079017-1291" target="_blank">https://doi.org/10.52202/079017-1291</a>, 2024.

    </mixed-citation></ref-html>--></article>
