The core idea is deceptively simple. Instead of solving the partial differential equations that govern fluid flow, heat transfer, or atmospheric dynamics from scratch every time, a foundation model is trained on vast libraries of existing simulation data. Once trained, it can produce predictions in minutes that would otherwise demand days of number-crunching. The authors describe these systems as reusable base models: rather than starting over for each new application, scientists can adapt a pre-trained model to tasks such as inverse design—working backward from a desired outcome to find the parameters that produce it—or uncertainty quantification, without retraining from zero. The result is a workflow in which rapid, physics-informed optimization cycles become routine rather than exceptional.

The article is careful to position foundation models as complements rather than replacements for traditional simulation. The authors draw a direct line to older engineering practice: reduced-order and surrogate models, such as Reynolds-averaged approaches in fluid dynamics, have long been used to trade some physical fidelity for enormous gains in speed. Foundation models share that motivation but bring far greater expressive power, learning from large collections of simulation and experimental data using architectures like transformers and graph neural networks. The authors emphasize that these systems support high-throughput virtual experimentation and help researchers navigate design tradeoffs, while expert judgment and full-fidelity solvers remain essential anchors of the workflow.

The evidence for this approach spans multiple domains. In Earth system science, models such as DeepMind’s GraphCast and NVIDIA’s FourCastNet already use large spatiotemporal datasets to improve weather and climate prediction while providing actionable guidance to human forecasters. In materials science, models trained on crystal structure databases help researchers prioritize promising candidates for further study. Drug discovery efforts use similar techniques for protein structure prediction and molecular design. In fusion energy research, data-driven models assist physicists with plasma control and scenario planning in operational environments that are too complex for intuition alone. The common thread is that foundation models learn intricate physical and chemical relationships from diverse data, enabling rapid prediction across a broad range of physical domains.

One of the article’s most technically grounded sections concerns data management, an often-overlooked foundation of the entire enterprise. The authors argue that as foundation models scale to production on high-performance computing systems, the quality and organization of training data becomes the decisive factor in achieving both speed and generalization. Building high-quality datasets requires programmatic pipelines for collection, quality control, de-duplication, consistent labeling, and machine-readable provenance. They advocate moving beyond generic FAIR data principles toward a campaign-oriented governance model, in which simulation campaigns are recorded with standardized workflows and ontologies, and data curation is driven by impact metrics such as time-to-insight and downstream model quality rather than raw storage volume.

At exascale, the authors note, storing every high-order field produced by a simulation is simply infeasible, making compression a first-class design choice rather than an afterthought. Modern error-bounded lossy compression methods can dramatically reduce data footprints, but the authors insist that fidelity must be defined by physics-aware criteria—controlling errors in energy or gradients, for example—and by quantifying how compression perturbations affect downstream surrogates and emulators. Integrated in situ or in transit within the simulation pipeline, compression can even act as a learnable encoder, yielding compact features that minimize input-output and memory demands during pre-training and fine-tuning while maintaining strict error controls for diagnostics.

To make scientific data usable across domains, the authors propose a token-centric view of AI-readiness that mirrors how foundation models themselves process information. Descriptor tokens would capture meshes, coordinates, units, and provenance, while feature tokens represent compressed field content. Fusion mechanisms would bind these tokens across simulations, experiments, and modalities into coherent scientific narratives. Anchoring such tokens in community standards—netCDF-like schemas for Earth system modeling, for instance—would give model teams a stable, extensible interface to simulation data, creating a feedback loop from simulation to model training and back again.

On the architectural side, the article distinguishes between two main families of models suited to scientific simulation. For regular grids such as latitude-longitude climate meshes, Vision Transformer-style encoders use patch embeddings that align naturally with GPU tensor cores and batched input-output operations, facilitating large-scale spatial correlations with predictable memory layouts. For spherical or unstructured domains, graph neural networks encode locality and adjacency through message passing, preserving mesh topology without expensive remeshing. Temporal structure is typically handled by autoregressive or time-conditioned transformers, though the authors caution that long temporal windows significantly increase attention memory, communication overhead, and checkpoint sizes—all key bottlenecks on distributed supercomputing systems.

Two design principles run through the article’s architectural recommendations. First, physics-aware inductive biases—constraints that force models to respect invariants, conservation laws, and symmetries—improve data efficiency and reliability across different physical regimes. Second, token- and compute-adaptivity allows cost to scale with solution complexity rather than nominal grid size, using mechanisms such as windowed or hierarchical attention for long-range dependencies, sparsity and mixture-of-experts routing for conditional computation, and adaptive token pruning that focuses model capacity where dynamics are actually active. Linear or subquadratic attention variants further reduce the quadratic growth of standard self-attention, enabling extreme resolutions on modern accelerators.

The article also details concrete parallelization strategies drawn from ORBIT-class efforts at Oak Ridge, identifying four key levers for scaling Vision Transformer-based foundation models on supercomputers. Linear-complexity attention reduces self-attention cost from quadratic to linear, enabling multi-billion-token contexts at high resolution. Hybrid parallelization—combining tensor and model sharding with data parallelism—scales to models with over 100 billion parameters while controlling communication and memory overhead. Lightweight architectural efficiency improves hardware utilization without sacrificing accuracy, and domain specialization with robust uncertainty quantification maintains physical consistency in multi-variable predictions. The authors acknowledge that these techniques trade exact global attention for sparse routing and introduce modest auxiliary indices and buffers, and they stress that accuracy-cost impacts must be evaluated explicitly rather than assumed away.

Looking beyond transformers, the article highlights an emerging alternative: pairing diffusion-based generative models with state-space architectures such as Mamba to target linear-time complexity and lower GPU memory requirements. Mapping one-dimensional Mamba architectures to two- and three-dimensional scientific fields uses multi-directional and zigzag scanning patterns, while hybrid designs retain a small fraction of self-attention to preserve global coherence. These approaches reduce activation and key-value cache traffic, ease pressure on interconnects, and enable longer contexts on fixed high-bandwidth memory budgets—naturally improving the scalability of diffusion-based foundation models for probabilistic forecasting, ensemble generation, and uncertainty quantification in chaotic systems.

Performance on supercomputers, the authors observe, is often limited more by memory capacity, memory bandwidth, and collective communication than by raw floating-point throughput. Training costs for multi-channel two- and three-dimensional fields over long contexts are dominated by activation and key-value cache residency, optimizer state footprints, tensor layout conversions, and synchronization overhead. To address this, the article catalogs a battery of optimization techniques: fused attention kernels that reduce high-bandwidth memory movement, hybrid parallelism that shards parameters, gradients, and optimizer states across devices, key-value cache management strategies such as PagedAttention that improve batching efficiency during inference, and topology-aware placement combined with tensor fusion and overlapping collectives that convert theoretical peak performance into sustained throughput.

Cross-layer co-design emerges as a unifying theme. Sequence parallelism and tiling constrain activation footprints; activation checkpointing trades computation for memory; gradient accumulation increases effective batch size; and conditional computation through sparse activations and mixture-of-experts scales cost with solution complexity. Reliability receives particular attention: mixed and low-precision training requires careful gradient scaling and clipping for numerical stability, while deterministic kernels support fast recovery and reproducibility. HPC-native task-based runtimes such as PaRSEC orchestrate workflows as dependency graphs, overlapping collective communication with computation and prioritizing latency-critical inference alongside throughput-driven training.

The article closes with a discussion of trust, arguing that adoption ultimately depends on rigorous validation. The authors call for comparing foundation model outputs against traditional numerical solvers and observed data, quantifying uncertainty through ensembles or diffusion techniques, and enforcing physical constraints. They propose a standardized evaluation framework incorporating accuracy, efficiency, and trustworthiness metrics—mirroring the verification, physics consistency checks, and cross-solver benchmarking with confidence intervals already standard in numerical simulation—alongside a hardware-aware simulation platform for evaluating pipelines across computational architectures with pre-registered acceptance thresholds. Understanding the tradeoff between accuracy and computational time, they conclude, will let practitioners allocate resources effectively and make informed decisions about when foundation models can deliver swift, credible scientific insight on production supercomputers.

Subject of Research: Scalable foundation models for accelerating numerical simulations on high-performance computing platforms

Article Title: Scalable foundation models for numerical simulations on HPC platforms

Article References: Wang, D., Gong, Q., Liu, Z., Wang, X., Cao, Q., & Klasky, S. (2026). Scalable foundation models for numerical simulations on HPC platforms. Frontiers in High Performance Computing, 4, Article 1778471. https://doi.org/10.3389/fhpcp.2026.1778471

Image Credits: AI Generated

DOI: 10.3389/fhpcp.2026.1778471

Keywords: foundation models, high-performance computing, numerical simulation, exascale computing, Vision Transformer, graph neural networks, diffusion models, lossy compression, AI-ready data, uncertainty quantification, parallelization, scientific machine learning

The central idea behind the research is deceptively simple: instead of relying on a single compression algorithm, chain two complementary techniques so that each one exploits the weaknesses left behind by the other. The first stage of both proposed schemes is a technique called Rounding Intensity Followed by Dividing, or RIFD, which was previously introduced by the same author in 2016. RIFD is a lossy operation that reduces the bit depth of an image by rounding pixel intensity values and then dividing them, which collapses many nearly identical gray levels into single representative values. This deliberate quantization shrinks the alphabet of symbols that the subsequent lossless coder has to handle, and it simultaneously reshapes the statistical distribution of those symbols, creating strong redundancies that entropy coders can harvest efficiently.

The two schemes differ in what happens after RIFD has done its work. The first, designated HLL1, feeds the preprocessed image into the Lossless Method of Decomposing Huffman Trees, abbreviated LM-DH, a technique first described by Alkhalayleh and Otair in 2015. Classical Huffman coding, invented by David Huffman in 1952, assigns shorter binary codes to more frequent symbols, but building and storing a single large Huffman tree for an image with many distinct intensity values can itself consume considerable space. LM-DH addresses this by decomposing the Huffman tree into smaller subtrees, which reduces the overhead of transmitting the coding table and improves the overall compression ratio. The second scheme, HLL2, pairs RIFD with the Lempel-Ziv-Welch algorithm, or LZW, the dictionary-based coder that Terry Welch derived from the foundational 1977 work of Jacob Ziv and Abraham Lempel and published in 1984. LZW builds a dictionary of recurring symbol sequences on the fly, so it needs no explicit code table to be sent alongside the compressed data.

To evaluate the two pipelines, the author ran experiments on a dataset of 20 standard test images spanning three common formats: 8-bit grayscale, 16-bit grayscale, and 24-bit RGB color. All processing was performed in MATLAB R2021b, a standard environment for image processing research, and the benchmark images were drawn from widely used public collections, including the CLIC dataset from the Challenge on Learned Image Compression, the USC-SIPI Image Database, the Kodak True Color Image Suite, and the Set11 collection of grayscale images used in reconstruction and compression studies. Using established public benchmarks matters, because it allows other researchers to reproduce the numbers and compare the new schemes directly against both classical baselines and modern learned codecs.

The headline result concerns how much better the hybrid schemes perform than their own lossless components alone. HLL1 produced an average improvement in compression ratio, measured as an ICR value, of 0.20 over the RIFD plus Huffman baseline, meaning that decomposing the Huffman tree into subtrees consistently squeezed out additional savings beyond what conventional Huffman coding could achieve on the same preprocessed data. HLL2 delivered an even more striking figure on the 8-bit grayscale datasets, where pairing RIFD with LZW yielded an average improvement of 73 percent. The author attributes this to the way RIFD’s bit-depth reduction creates long runs of repeated intensity values, precisely the kind of repetitive structure that dictionary-based LZW coding converts into short dictionary references.

Just as important as the size reductions is what the schemes do not cost in quality. Because the second stage of each pipeline is strictly lossless, it introduces no additional distortion whatsoever beyond the RIFD preprocessing step. In other words, once the image has been rounded and divided, every subsequent operation is perfectly reversible, so the decoded image is an exact replica of the preprocessed version. The perceptual integrity of the image is therefore determined entirely by how aggressive the RIFD quantization is, giving practitioners a single, tunable knob for balancing file size against visual fidelity. The study reports that the proposed techniques dramatically shrink file sizes without sacrificing perceptual quality, which makes them candidates for bandwidth-constrained and storage-limited environments where every kilobyte counts.

The work situates itself within a long tradition of hybrid compression research. Earlier studies have combined the discrete wavelet transform with set partitioning techniques and Huffman encoding, and medical imaging researchers have stacked linear predictive coding, wavelet transforms, and Huffman coding to compress clinical scans. More recently, the field has been transformed by learned compression, in which neural networks are trained end to end to transform and entropy-code images, with systems such as variational models with scale hyperpriors, discretized Gaussian mixture likelihoods with attention modules, unevenly grouped space-channel contextual adaptive coding, and latent diffusion approaches for compression all pushing the state of the art. Against this backdrop, the appeal of the new schemes is their computational simplicity: RIFD, Huffman tree decomposition, and LZW all involve elementary arithmetic and table lookups rather than deep network inference, which makes them attractive for hardware with tight power and processing budgets.

The technical logic of why the hybrids work is worth unpacking. Lossless entropy coders are bounded by the entropy of their input: the more skewed and repetitive the symbol distribution, the fewer bits per symbol they need. A raw 8-bit grayscale image often uses most of its 256 possible values with a relatively flat distribution, which limits any lossless coder working alone. RIFD deliberately flattens fine distinctions between neighboring intensities, concentrating probability mass on a smaller set of representative values. For Huffman-style coding, this means shorter average code lengths and, with LM-DH, a smaller tree structure to serialize. For dictionary coding, it means the same intensity values recur in predictable spatial patterns, so the LZW dictionary fills with long, frequently reused phrases. The lossy step thus acts as an amplifier for the lossless stage, and the two designs test two different ways of cashing in that amplification.

The practical implications reach across several domains. Telemedicine systems transmitting diagnostic images over rural networks, remote sensing platforms downlinking satellite imagery, digital archives preserving vast image collections, and consumer services serving billions of photos all face the same trade-off between bandwidth, storage cost, and image fidelity. A method that can be tuned by adjusting a single quantization parameter, that runs quickly on ordinary hardware, and that guarantees no hidden loss beyond the explicitly chosen quantization offers a predictable and auditable alternative to opaque neural codecs. The fact that the study used only public datasets, including CLIC, USC-SIPI, Kodak, and Set11, and performed all experiments in a widely available MATLAB release further lowers the barrier for independent verification and adoption.

There are, of course, boundaries to what the study claims. The reported gains are averages over 20 standard test images in three bit-depth formats, and performance on any particular image class, such as noisy medical scans or highly textured natural photographs, would need separate validation. The comparison baselines are the author’s own RIFD plus Huffman configuration rather than the newest learned codecs, so the schemes should be understood as an efficient classical alternative rather than a replacement for state-of-the-art neural compression at the very highest performance frontier. Nevertheless, the paper demonstrates a clear and reproducible principle: a carefully designed lossy preprocessing step can unlock substantial extra performance from decades-old lossless algorithms, and the choice of the lossless partner, whether a decomposed Huffman tree or an adaptive LZW dictionary, meaningfully shapes where the biggest wins appear. As image volumes continue to explode, such pragmatic hybrids may prove that some of the best new tools for an old problem are clever recombinations of proven ones.

Subject of Research: Hybrid lossy-lossless image compression using RIFD preprocessing with Huffman tree decomposition and LZW coding

Article Title: Hybrid image compression techniques based on RIFD with LM-DH and LZW

Article References: Otair, M. (2026). Hybrid image compression techniques based on RIFD with LM-DH and LZW. Multimedia Tools and Applications, 85(9), Article 741. https://doi.org/10.1007/s11042-026-21902-6

Image Credits: AI Generated

DOI: 10.1007/s11042-026-21902-6

Keywords: image compression, hybrid compression, RIFD, Huffman coding, LM-DH, LZW, lossless coding, lossy compression, entropy coding, MATLAB, grayscale images, Multimedia Tools and Applications

The core of the work, titled Utility-driven knowledge graph summarization with structural-semantic fidelity, addresses a gap that has frustrated researchers for years. Existing summarization techniques have traditionally optimized for one of two goals at a time. Some methods focus on preserving the semantic content of a graph, ensuring that the meaning of facts and the cohesiveness of related concepts survive compression. Others prioritize structure, maintaining the topology of connections so that downstream graph algorithms behave predictably. The trouble, the authors argue, is that these approaches cannot directly control the trade-off between the two dimensions when operating in a lossy setting, where some information is deliberately discarded to achieve meaningful reductions in size. Worse, most lossy methods evaluate information loss only after the summary has been generated, a post-hoc assessment that offers no mechanism to steer the compression process while it is underway.

Wang and Wang’s solution begins with a dual-utility metric, a single mathematical yardstick that simultaneously measures structural preservation and semantic cohesiveness. Rather than judging a summary by how much it shrank or how closely it resembles the original in one narrow sense, the metric quantifies the utility of a summary across both dimensions at once. This allows the summarization process itself to become utility-driven: at every step, the algorithm knows exactly how much value it is sacrificing and can choose the action that minimizes that sacrifice. It is a shift from diagnosing damage after the fact to preventing it during construction, and it transforms summarization from an art of approximation into a controlled engineering process with explicit guarantees.

Three algorithms were developed to put this idea into practice, each targeting a different point on the spectrum of speed, fidelity and loss. The first, called LIDUS, performs lossless summarization. It compresses a graph without discarding any information, preserving both structural and semantic integrity completely. Lossless summaries are ideal when exactness matters, but they inevitably impose limits on how small the representation can become. The second algorithm, LDUS, embraces lossy compression with a utility-guided strategy. It iteratively merges pairs of entities that have been ranked by the system, and at each iteration it selects the merge that minimizes utility loss under the dual metric. The result is a summary that can be far smaller than any lossless counterpart, while the accumulated damage remains visible and bounded at every stage of the process.

The third algorithm, aLDUS, tackles the practical obstacle that threatens to undermine the entire approach: computational cost. Naively evaluating the utility loss of every candidate merge at every iteration is expensive, particularly on large graphs where the number of candidate pairs is enormous. aLDUS resolves this by incrementally computing semantic loss, updating loss figures as merges proceed rather than recalculating them from scratch, while guaranteeing a bounded utility loss throughout. In other words, the speedup does not come at the price of uncontrolled error; the algorithm carries a formal assurance that the quality of the summary stays within limits the user specifies. This combination of efficiency and provable fidelity is what distinguishes the method from earlier attempts at fast graph summarization.

To validate the framework, the researchers ran experiments on five real-world and synthetic knowledge graphs, testing how well summaries preserved the answers to meaningful analytical queries. A central benchmark was the top-10 percent PageRank query, computed on graphs reconstructed from aLDUS summaries. PageRank, the algorithm famously behind web search ranking, identifies the most influential nodes in a network, so reproducing its results from a compressed graph is a demanding test of whether summarization retains what matters. Across the five datasets, setting the utility threshold to 0.8 yielded an average accuracy of 0.89, meaning that summaries produced under this setting nearly matched the importance rankings of the full original graphs despite their reduced size.

The comparisons against competing methods were equally striking. Summaries generated by aLDUS achieved average cohesiveness ratios in the range of 0.93 to 1.21 when measured against rival approaches, indicating that the semantic fabric of the graph was held together at least as well, and often better, than what existing techniques deliver. On runtime, the model recorded the shortest summarization times across three of the five datasets and remained comparable to the fastest available methods on the remaining two. Compression that is both accurate and fast changes the practical calculus for organizations maintaining large knowledge infrastructure, because summaries can be refreshed frequently enough to stay current with evolving data rather than treated as static snapshots.

Query performance is where the benefits become most tangible for end users. In experiments covering both simple and complex queries, summaries produced by LDUS and aLDUS achieved an average F1 score of 0.88, a combined measure of precision and recall that indicates answers drawn from the compressed graphs closely matched answers from the originals. More dramatically, query times dropped by an average of 97 percent. For interactive applications such as knowledge graph exploration, keyword search and question answering, this means analysts can navigate enormous datasets at the responsiveness of a small one, without systematically distorting the answers they receive. The authors’ experiments also demonstrate that the approach generalizes across diverse graph types rather than being tuned to a single benchmark.

The significance of the work extends beyond the immediate algorithms. Industry-scale knowledge graphs, as documented in prior surveys of the field, already contain billions of entities and are growing rapidly, and the research community has identified summarization, profiling and shape extraction as key technologies for taming them. By introducing a principled way to balance structural and semantic fidelity under explicit user control, Wang and Wang provide a foundation that other systems can build upon, from query optimizers that estimate result sizes using summaries to exploratory tools that offer first-sight views of unfamiliar datasets. The dual-utility framing also opens the door to future work in which different applications specify different utility profiles, tailoring the same underlying machinery to search, visualization, machine learning preprocessing or data validation.

For a field that has often treated compression quality as an afterthought to be measured once the dust settles, this study represents a conceptual step forward: loss becomes a dial that engineers can set, monitor and guarantee, rather than a surprise to be discovered afterward. As knowledge graphs continue to expand into domains ranging from biomedicine to e-commerce to national-scale digital infrastructure, tools like LIDUS, LDUS and aLDUS suggest a future in which the size of the data no longer dictates the limits of our understanding of it. The research, received in October 2025 and published on 29 August 2026, signals that the next generation of graph technologies will not simply be bigger, but smarter about what they choose to remember.

Subject of Research: Utility-driven lossless and lossy summarization of knowledge graphs with dual structural and semantic fidelity guarantees

Article Title: Utility-driven knowledge graph summarization with structural-semantic fidelity

Article References: Wang, Y., & Wang, Y. (2026). Utility-driven knowledge graph summarization with structural-semantic fidelity. Data Mining and Knowledge Discovery, 40(5), Article 87. https://doi.org/10.1007/s10618-026-01256-1

Image Credits: AI Generated

DOI: 10.1007/s10618-026-01256-1

Keywords: knowledge graphs, graph summarization, lossy compression, semantic cohesiveness, structural preservation, utility metric, PageRank, query optimization, data mining, algorithms, RDF graphs, graph compression