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
-
Compile-Time Java Stream Fusion via mapMulti
A new Java bytecode optimizer fuses map and filter into mapMulti to reduce stream overhead, sidestepping Streamliner's restrictions and delivering superior results in two of nine benchmarks while passing all 31,799 Kafka tests.
-
Rethinking the Need for Source Models: Source-Free Domain Adaptation from Scratch Guided by a Vision-Language Model
The paper introduces the VODA setting for domain adaptation from scratch using vision-language models and presents TS-DRD, which achieves competitive performance on standard benchmarks without source models.
-
An Efficient Spatial Branch-and-Bound Algorithm for Global Optimization of Gaussian Process Posterior Mean Functions
PALM-Mean combines sign-aware piecewise-linear relaxations of locally important kernel terms with closed-form analytic bounds on the rest inside a reduced-space branch-and-bound framework, yielding valid lower bounds and ε-global convergence for GP posterior mean optimization.
-
PECMAN: Perception-enabled Collaborative Multi-Agent Navigation in Unknown Environments
PECMAN lets multiple robots share perception and morph their individual RRT* trees to replan paths in unknown environments, reducing team completion time by up to 52 percent with near-100 percent success in 28,000 simulations and real-robot tests.
-
Proton and kaon production in Au+Au collisions at $\sqrt{s_{\rm NN}}=3$ GeV
Momentum-dependent nuclear mean field with K0=230 MeV provides a good description of proton and kaon production and collective flows in 3 GeV Au+Au collisions, outperforming momentum-independent fields.
- TRUST-TAEA: A trustworthiness-guided two-archive evolutionary algorithm with variable-grouping sparse search for large-scale multi-objective optimization