Machine learning methods discover a new noncrossing-partition statistic interpreting q,t-Narayana polynomials and yield a combinatorial proof of their symmetry.
Canonical reference
Title resolution pending
Canonical reference. 80% of citing Pith papers cite this work as background.
731
Pith papers citing it
1
external citations · Crossref
Background
80% of classified citations
citation-role summary
background 247
method 24
baseline 6
dataset 4
extension 2
citation-polarity summary
authors
co-cited works
representative citing papers
SLayerGen generates crystals invariant to any space or layer group via autoregressive lattice and Wyckoff sampling plus equivariant diffusion, achieving gains over bulk models on diperiodic materials after correcting a prior loss inconsistency for hexagonal groups.
Every proper minor-closed graph class admits an optimal (1+o(1)) log n bit adjacency labeling scheme.
A directed weighted two-graph model separates feasibility from movement in solution discovery and yields a detailed complexity classification for path and shortest-path discovery.
The method reformulates ALE mesh motion as independent multi-patch spline parameterizations per time step, using barrier functions, tangential-slip reparameterization, and constant-preserving quasi-interpolation to enable large-rotation FSI simulations.
Superconductivity in high-pressure MnB4 is induced by altermagnetic spin fluctuations, yielding extended-s pairing symmetry.
A new qubit-efficient HUBO encoding for graph partitioning problems like minimum coloring uses logarithmic bits and a lexicographic penalty to cut resources while providing provable optimality conditions.
A survey of 172 open educational datasets from 204 papers across LAK, EDM, and AIED conferences reveals trends, 143 previously uncatalogued datasets, field gaps, and an 8-item PRACTICE checklist for better data publication.
A microlocal lift of Navier-Stokes dynamics on manifolds yields an if-and-only-if geometric criterion for solution blow-up in terms of deformation integrability, directional entropy, and lifted energy.
A 9U CubeSat detector can identify a thermonuclear weapon on a satellite from 4 km away by observing spallation neutrons induced by GeV protons in roughly one week.
O(n log n) algorithm and matching Omega(n log n) lower bound for partitioning a simple polygon's boundary into the minimum number of contiguous visible segments.
Introduces a method to design structure-specific relational inductive biases for a base transformer architecture, enabling end-to-end transcription of documents with intrinsic structures, demonstrated on sheet music, shape drawings, and mechanical engineering drawings.
An optimization-based inverse design method discovers metainterfaces achieving custom friction laws including power laws with exponents from 2/3 to 1.35 and bilinear forms, with experimental validation for some cases.
AMLE graph value extensions meet a local action-gap certificate guaranteeing goal-reaching greedy rollouts under argmin-Q planning and achieve 0.97 success on AntMaze-derived graphs versus 0.58 for harmonic extension.
Reversa is a reverse documentation engineering framework that deploys a multi-agent pipeline to extract implicit rules from legacy software and produce traceable specifications with confidence scores and explicit gaps for human review.
First epitaxial EuPdSi3 thin films on MgO exhibit two zero-field magnetic transitions at 19 K and 15 K with distinct field-orientation-dependent phases.
Introduces De Simone laws over Kleisli categories that guarantee compositionality of coalgebraic trace equivalence and recovers the classical De Simone format while adding a probabilistic variant.
CausalHealth detects lithium-ion battery degradation with 100% sensitivity and up to 402-cycle lead time using causal anomaly scores from voltage, current, temperature, and resistance time series across seven cells.
Truncated-binary encoding approximates high-cardinality CFN problems as low-degree HUBO Hamiltonians with an L^∞ error bound, conditions preserving the global minimum, and a smoothness-based criterion for choosing the cutoff.
TriALS introduces a 150-case four-phase CT dataset and challenge showing top segmentation methods reach 0.754 Dice on venous phase but only 0.57 on non-contrast CT, with external validation gains up to 28%.
An E(3)-equivariant deep RL framework lets an O2 agent discover kinetically plausible diffusion and dissociation pathways in disordered Si/a-SiO2 without hand-crafted reaction coordinates or collective variables.
A taxonomy of SNN training algorithms is presented with the release of NeuroTrain, an open benchmarking framework for reproducible comparisons across datasets and architectures.
A 14-code content model for local post-hoc AI explanations, derived from 325 user statements and validated by experts with high reliability scores.
A flow-adaptive ergodic coverage formulation using MMD that preserves guarantees over evolving domains and supports open-loop planning for robots in flows.
citing papers explorer
-
Verification of the Outer Space Treaty with Cosmic Protons
A 9U CubeSat detector can identify a thermonuclear weapon on a satellite from 4 km away by observing spallation neutrons induced by GeV protons in roughly one week.
-
The Contiguous Art Gallery Problem is in {\Theta}(n log n)
O(n log n) algorithm and matching Omega(n log n) lower bound for partitioning a simple polygon's boundary into the minimum number of contiguous visible segments.
-
A document is worth a structured record: Principled inductive bias design for document recognition
Introduces a method to design structure-specific relational inductive biases for a base transformer architecture, enabling end-to-end transcription of documents with intrinsic structures, demonstrated on sheet music, shape drawings, and mechanical engineering drawings.
-
GLUE: Coordinating Pre-Trained Generative Models for System-Level Design
GLUE orchestrates frozen pre-trained generative models into a system-level design generator that enforces feasibility, performance, and diversity, with data-driven and data-free variants benchmarked on UAV design.
-
DualGuard: Dual-stream Large Language Model Watermarking Defense against Paraphrase and Spoofing Attack
DualGuard uses adaptive dual-stream watermark signals to detect and trace both paraphrase and spoofing attacks in LLM outputs while preserving text quality.
-
SemanticBridge - A Dataset for 3D Semantic Segmentation of Bridges and Domain Gap Analysis
SemanticBridge provides a new 3D dataset for bridge component segmentation and quantifies sensor-induced domain gaps that drop model performance by up to 11.4% mIoU.
-
Data-driven modeling of multivariate stochastic trajectories -- Application to water waves
A data-driven stochastic model for water wave kinematics is built by combining functional PCA feature reduction with vine copulas for the bulk distribution and Heffernan-Tawn conditional modeling for the tails, enabling synthetic trajectory generation under a breaking constraint.
-
A Tight Double-Exponentially Lower Bound for High-Multiplicity Bin Packing
Establishes a tight double-exponential lower bound for high-multiplicity bin packing parameterized by number of distinct item types d, showing no |I|^{2^{o(d)}} algorithm exists unless ETH fails, via a novel 3-SAT reduction to an ILP with O(log n) variables.
-
PLS-complete problems with lexicographic cost functions: Max-$k$-SAT and Abelian Permutation Orbit Minimization
Establishes PLS-completeness for lexicographic local search in 4-CNF and 3-CNF (double flips), and for Abelian permutation orbit minimization even when groups are cyclic or consist of involutions, with applications to bounded congestion games.
-
Neuroprobe: Evaluating Intracranial Brain Responses to Naturalistic Stimuli
Neuroprobe is a new suite of decoding tasks on the BrainTreebank iEEG dataset for evaluating multi-modal language processing in the brain during naturalistic movie viewing.
-
Limit theorems for stochastic Volterra processes
Develops a Hilbert space-valued Markovian lift framework for stochastic Volterra equations and establishes existence of limit distributions, LLN with convergence rate, and CLT for time averages in the Gaussian domain.
-
Lifetime-Aware Design for Item-Level Intelligence at the Extreme Edge
FlexiFlow optimizes carbon footprint for item-level intelligence on flexible electronics by modeling lifetime variation, delivering 1.62X microarchitectural and 14.5X algorithmic reductions plus a 30.9 kHz tape-out.
-
EyeMulator: Improving Code Language Models by Mimicking Human Visual Attention
EyeMulator augments CodeLLM fine-tuning loss with token weights derived from human eye-tracking scan paths, producing large gains on code translation and summarization across StarCoder, Llama-3.2 and DeepSeek-Coder.
-
Accurate and scalable exchange-correlation with deep learning
Skala is a neural XC functional trained on wavefunction data that beats state-of-the-art hybrids on main-group chemistry benchmarks at semi-local computational cost.
-
Homomorphism Indistinguishability Relations induced by Quantum Groups
Generalizes homomorphism indistinguishability equivalences induced by orthogonal easy quantum groups, including a classification of (0,0)-intertwiners for graph-theoretic versions.
-
ICNN-enhanced 2SP: Leveraging input convex neural networks for solving two-stage stochastic programming
ICNN-enhanced 2SP uses architecturally convex neural networks to enable exact LP embedding of recourse surrogates, replacing MIP formulations and yielding up to 100x speedups on benchmark problems.
-
$c$-Birkhoff polytopes
c-Birkhoff polytopes are unimodularly equivalent to the order polytopes of the heap posets of the c-sorting words of the longest permutation.
-
High specific impulse electrospray propulsion with small capillary emitters
Smaller capillary emitters enable stable low-flow-rate cone-jet electrospray operation, achieving I_sp up to 3000 s and >50% efficiency with ionic liquids, roughly doubling prior values.
-
Input convex neural networks: universal approximation theorem and implementation for isotropic polyconvex hyperelastic energies
Input-convex neural networks in elementary polynomials of signed singular values provably approximate any frame-indifferent isotropic polyconvex hyperelastic energy.
-
Urban Priority Pass: Fair Signalized Intersection Management Accounting For Passenger Needs Through Prioritization
Proposes the Priority Pass as a new reservation-based controller for individual vehicle prioritization at intersections, with Manhattan case study claiming up to 40% delay reduction for entitled vehicles and up to $1M daily revenue potential.
-
How Large Language Models Systematically Misrepresent American Climate Opinions
LLMs compress U.S. climate opinion diversity and apply uniform gender assumptions that match reality for White and Hispanic Americans but misrepresent Black Americans.
-
Coherence in the brain unfolds across separable temporal regimes
Language coherence arises from slow contextual integration in default-mode cortex and rapid event-driven reconfiguration in auditory and language areas, captured by LLM-derived signals in single-subject fMRI.
-
Mixed formulation and structure-preserving discretization of Cosserat rod dynamics in a port-Hamiltonian framework
A mixed formulation for Cosserat rod dynamics is cast as an infinite-dimensional nonlinear port-Hamiltonian system and discretized with structure-preserving finite elements to yield energy-momentum consistent time integration.
-
A pressure-projection formulation in a least-squares meshfree method for the incompressible Navier-Stokes equations using a staggered-variable arrangement
A least-squares meshfree method for incompressible flows introduces a local primal-dual grid to achieve consistent staggered discretization and local divergence-free velocities.
-
Conserving mass, momentum, and energy for the Benjamin-Bona-Mahony, Korteweg-de Vries, and nonlinear Schr\"odinger equations
High-order essentially explicit discretizations using Fourier Galerkin plus projection-relaxation conserve mass, momentum, and energy for BBM, KdV, and NLS equations.
-
Dynamic one-time delivery of critical data by small and sparse UAV swarms: a model problem for MARL scaling studies
A new family of deterministic UAV relay games shows off-the-shelf MARL matching a shortest-path baseline for small swarms but failing to scale as agent numbers grow.
-
HOLE: Homological Observation of Latent Embeddings for Neural Network Interpretability
HOLE applies persistent homology to latent embeddings in neural networks and uses visualizations such as cluster flow diagrams to reveal patterns of class separation, feature disentanglement, and robustness.
-
Industrial AI Robustness Card for Time Series Models
The paper proposes the IARC-TS protocol that combines drift monitoring, uncertainty quantification, and stress tests to generate reproducible robustness evidence for industrial time series models mapped to EU AI Act obligations.
-
Semantic-aware Random Convolution and Source Matching for Domain Generalization in Medical Image Segmentation
Semantic-aware random convolution and intensity-based source matching enable effective single-source domain generalization for medical image segmentation, outperforming prior methods and sometimes matching in-domain performance.
-
Supervisory control synthesis for multilevel DES with local buses
A novel MLDES architecture with per-level local bus detection enables an algorithm for tree-structured hierarchical decomposition, shown in a production-line case study to reduce the sum of controlled state-space sizes of local supervisors.
-
LatencyScope: A System-Level Mathematical Framework for 5G RAN Latency
LatencyScope models 5G RAN latency sources across the protocol stack and provides a configuration analyzer that identifies settings meeting latency-reliability targets, validated on open-source testbeds and commercial network measurements where it outperforms prior models and simulators.
-
Parameterized complexity of the f-Critical Set problem
The f-Critical Set problem is NP-complete on planar subcubic bipartite graphs with m(f)=2, W[1]-hard parameterized by treewidth alone, yet FPT parameterized by treewidth plus m(f) or Δ(G), with kernels of size O(k·m(f)) and O(k·Δ(G)).
-
TabPFN-2.5: Advancing the State of the Art in Tabular Foundation Models
TabPFN-2.5 scales tabular foundation models to 20x larger datasets, outperforms tuned tree models on TabArena, achieves near-perfect win rates against default XGBoost, and adds a distillation engine for fast production deployment.
-
Inexact subgradient algorithm with a non-asymptotic convergence guarantee for copositive programming problems
An inexact subgradient algorithm achieves O(ε^{-2}) iteration complexity for ε-accurate solutions to copositive programs while allowing inexact solves of NP-hard quadratic subproblems and providing a sufficient condition for non-complete positivity.
-
Mutual visibility in Moore graphs and $(d,2)$-graphs with defect
Mutual-visibility number equals 20 in the Hoffman-Singleton graph; algebraic conditions and exact values are given for small-defect (d,2)-graphs.
-
CoGate-LSTM: Prototype-Guided Feature-Space Gating for Mitigating Gradient Dilution in Imbalanced Toxic Comment Classification
CoGate-LSTM adds prototype-guided cosine feature-space gating to a character-level BiLSTM with multi-source embeddings and focal loss, reaching 0.881 macro-F1 on Jigsaw toxic comments while using 7.3M parameters and outperforming fine-tuned BERT by 6.9 points on minority labels.
-
Mixed-precision iterative refinement for low-rank Lyapunov equations
Develops mixed-precision iterative refinement for low-rank Lyapunov equations with rounding error analysis enabling reduced precision for moderately conditioned problems.
-
Modeling Spatial Heterogeneity in Exposure Buffers and Risk: A Hierarchical Bayesian Approach
SVBR is a new hierarchical Bayesian method that treats buffer radii as unknown spatially varying parameters, improves parameter recovery in simulations, and reveals spatial heterogeneity in healthcare access effects on antenatal care in Madagascar.
-
Constrained Co-evolutionary Metamorphic Differential Testing for Autonomous Systems with an Interpretability Approach
CoCoMagic applies constrained cooperative co-evolution to metamorphic and differential testing to find up to 287% more distinct behavioral divergences in an end-to-end ADS than baseline search methods.
-
Encoding and Reasoning about Arrays in Constraint Logic Programming with Sets
Encodes arrays as sets of ordered pairs and supplies a decision procedure for a set-theory fragment that lets {log} reason about arrays alongside sets and functions.
-
Two-neutrino $\beta\beta$ decay to excited states at next-to-leading order
Shell model calculations find NLO contributions to 2νββ half-lives to excited states typically below 5% but larger when leading-order terms cancel, yielding half-life predictions slightly above the 76Ge limit and consistent with recent 82Se indications.
-
Learning graphons from data: Random walks, transfer operators, and spectral clustering
Connects continuum stochastic signals to graphon random walks via Koopman and Perron-Frobenius operators for spectral clustering and graphon reconstruction from data.
-
SPT-3G D1: CMB temperature and polarization power spectra and cosmology from 2019 and 2020 observations of the SPT-3G Main field
SPT-3G delivers the most precise CMB EE and TE spectra at high multipoles to date, giving LCDM parameters with H0 = 66.66 ± 0.60 km/s/Mpc from ground-based data alone and reaching Planck-level constraints when combined with ACT.
-
Manifold Learning for Personalized and Label-Free Detection of Cardiac Arrhythmias
Nonlinear dimensionality reduction on ECG signals enables unsupervised personalized arrhythmia detection with high accuracy on 2D embeddings using standard algorithms on the MIT-BIH database.
-
Rotary Masked Autoencoders are Versatile Learners
RoMAE applies rotary positional embeddings to masked autoencoders to enable representation learning and interpolation on continuous positional data across irregular time-series, images, and audio without modality-specific modifications.
-
Catability as a metric for evaluating superposed coherent states
Introduces catability metric rooted in nonlinear squeezing for detecting cat-like features in quantum superpositions, shown numerically robust to loss.
-
Complexity of Firefighting on Graphs
Deciding ffn(G) <= m is NP-hard, shortest strategies on complete binary trees have superpolynomial length, with almost sharp bounds for those trees and transfer of results to the Hunter and Rabbit game.
-
Robust Containment Queries over Collections of Trimmed NURBS Surfaces via Generalized Winding Numbers
A robust containment query for collections of trimmed NURBS surfaces that computes generalized winding numbers directly via adaptive quadrature on solid angle boundary integrals without surface discretization.
-
Enabling Global, Human-Centered Explanations for LLMs:From Tokens to Interpretable Code and Test Generation
CodeQ aggregates token rationales into code categories to enable global interpretability of LLMs, claiming over 50% entropy reduction and revealing model preference for syntactic cues plus human misalignment in a 37-person study.
-
On tropical knapsack-type problems
NP-completeness of knapsack and subset sum proven for max-plus and max-times matrix semigroups, with pseudo-polynomial and polynomial algorithms demonstrated.