Reachability is undecidable in the RMW-free fragment of Release/Acquire, but decidable when both context switches and RMWs are bounded.
super hub Canonical reference
In: Proc
Canonical reference. 88% of citing Pith papers cite this work as background.
374
Pith papers citing it
Background
88% of classified citations
hub tools
citation-role summary
background 60
method 2
baseline 1
dataset 1
extension 1
citation-polarity summary
authors
co-cited works
representative citing papers
A noncommutative Cartier formula for E1-ring spectra is proven and applied to show that p-curvature of the quantum connection computes quantum Steenrod operations for Calabi-Yau symplectic manifolds.
Extends structural identifiability analysis to functional components of differential equation models and characterizes conditions for unique recovery using differential algebra techniques.
A linearized solver estimates rolling-shutter relative pose and motion from 7 affine correspondences in 1.2 ms and reports best-in-benchmark accuracy plus usable translational velocity.
New prime enumeration algorithms achieve N (log log N)^{1+o(1)} bit operations in the multitape Turing model, improving prior work by nearly log N via fast polynomial arithmetic over finite fields and error-correcting code ideas.
Every smooth compact submanifold of R^n is isotopically approximable by real loci of nonsingular real algebraic subsets of C^n, settling a version of Nash's conjecture with uniformity for codim >=2.
Any two Lagrangian (p,q)-pinwheel embeddings in B_{p,q} are Hamiltonian isotopic, with Symp_c(B_{p,q}) generated by the pintwist τ_{p,q}.
Unprivileged CUDA kernels can use Rowhammer to tamper with GPU page tables for targeted privilege escalation, leaking cryptographic keys and escalating to CPU root access by bypassing IOMMU.
Lean 4 formalization proves Singer's Sidon-set construction for every prime power and builds a library that yields unconditional two-sided bounds h(N)=Θ(√N) plus a conditional route to the full Erdős Problem 30 asymptotic.
The single-pass streaming space complexity of CSP(Γ) is characterized up to log factors by the non-redundancy NRD_n(Γ) of the constraint language.
For n-qubit stabilizer states the optimal sample complexity of approximate cloning is Θ(n), matching the complexity of learning.
SuperDP refutes ε-DP via simultaneous synthesis of input pairs and witness functions using upper expectation supermartingales and lower expectation submartingales, delivering the first fully automated, sound, and semi-complete method applicable to both discrete and continuous stochastic mechanisms.
A dependent linear type theory is constructed by embedding linear logic into dependent type theory, yielding multiplicities that depend on variables, supporting W-types, with semantics in indexed Categories with Families and an Agda implementation.
HDL defines dynamic theories with lifting and combination operations, proves soundness and relative completeness in Isabelle, and demonstrates the approach on a Java controller steering a differential dynamic logic plant model.
Proves Kiyohara's 2001 metrics with arbitrary high-degree polynomial integrals are not superintegrable, solving two Bolsinov-Kozlov-Fomenko conjectures via a new theorem on Poisson brackets of integrals.
Long-range order for the fermion bilinear is proved in three Euclidean lattice Gross-Neveu models at small coupling and large even N via reflection positivity, chessboard estimates and a Peierls argument.
Network realignment complexes over arbitrary connected graphs admit an equivariant deformation retraction onto a complete graph plus discrete space; for complete graphs, diameter bounds and Aut(X_n) ≅ S_n (n≥5) are established.
Dipole ghost sectors emerge from the multiplicity of classical solutions in higher-order Chern-Simons theory, and spontaneous symmetry breaking lifts this degeneracy.
There is no bound on the order of the conditions needed to write a multisymplectic form with constant coefficients: for every j, explicit 3-forms in dimension 2j+5 require conditions of order j.
SPoILeR uses multimodal pre-training to enable accurate novel view synthesis of infrared, polarimetric, and multispectral data from RGB-supervised fine-tuning on new scenes.
Symmetric colorings of Hales-Jewett cubes coincide with one-weight colorings, reducing the symmetric lower-bound problem to 1D Gallai homothety coloring and yielding HJ(3,3)≥22 and HJ(4,2)≥14.
Establishes refined L^p-based blow-up criteria for triangular SKT cross-diffusion systems via hierarchical structure and tame Sobolev estimates, and proves global existence of non-negative strong solutions for two-species logistic systems in d ≤ 2.
No universal constant exists allowing convex-hull bounds with controlled L_log norms for the difference set of arbitrary finite T under symmetric Weibull(r) processes when 0<r<1.
X-CAPPS generates coherent attosecond X-ray pulse pairs from Cu Kα1 stimulated emission pumped by SASE XFEL pulses and measures their time delays, amplitudes, and phases via interference spectra on sequential Bragg spectrometers.
citing papers explorer
-
On the Decidability of Verification under Release/Acquire
Reachability is undecidable in the RMW-free fragment of Release/Acquire, but decidable when both context switches and RMWs are bounded.
-
Noncommutative Cartier Formulae
A noncommutative Cartier formula for E1-ring spectra is proven and applied to show that p-curvature of the quantum connection computes quantum Steenrod operations for Calabi-Yau symplectic manifolds.
-
Structural functional identifiability and model discovery in differential equation models
Extends structural identifiability analysis to functional components of differential equation models and characterizes conditions for unique recovery using differential algebra techniques.
-
Rolling Shutter Relative Pose Estimation Made Practical
A linearized solver estimates rolling-shutter relative pose and motion from 7 affine correspondences in 1.2 ms and reports best-in-benchmark accuracy plus usable translational velocity.
-
Faster enumeration of primes
New prime enumeration algorithms achieve N (log log N)^{1+o(1)} bit operations in the multitape Turing model, improving prior work by nearly log N via fast polynomial arithmetic over finite fields and error-correcting code ideas.
-
Optimal embedding dimension in the Nash--Tognoli theorem
Every smooth compact submanifold of R^n is isotopically approximable by real loci of nonsingular real algebraic subsets of C^n, settling a version of Nash's conjecture with uniformity for codim >=2.
-
The nearby Lagrangian conjecture for pinwheels
Any two Lagrangian (p,q)-pinwheel embeddings in B_{p,q} are Hamiltonian isotopic, with Symp_c(B_{p,q}) generated by the pintwist τ_{p,q}.
-
GPUBreach: Privilege Escalation Attacks on GPUs using Rowhammer
Unprivileged CUDA kernels can use Rowhammer to tamper with GPU page tables for targeted privilege escalation, leaking cryptographic keys and escalating to CPU root access by bypassing IOMMU.
-
Formalizing Singer Sidon Constructions and Sidon Set Infrastructure in Lean 4
Lean 4 formalization proves Singer's Sidon-set construction for every prime power and builds a library that yields unconditional two-sided bounds h(N)=Θ(√N) plus a conditional route to the full Erdős Problem 30 asymptotic.
-
Characterizing Streaming Decidability of CSPs via Non-Redundancy
The single-pass streaming space complexity of CSP(Γ) is characterized up to log factors by the non-redundancy NRD_n(Γ) of the constraint language.
-
Cloning is as Hard as Learning for Stabilizer States
For n-qubit stabilizer states the optimal sample complexity of approximate cloning is Θ(n), matching the complexity of learning.
-
SuperDP: Differential Privacy Refutation via Supermartingales
SuperDP refutes ε-DP via simultaneous synthesis of input pairs and witness functions using upper expectation supermartingales and lower expectation submartingales, delivering the first fully automated, sound, and semi-complete method applicable to both discrete and continuous stochastic mechanisms.
-
Dependent Multiplicities in Dependent Linear Type Theory
A dependent linear type theory is constructed by embedding linear logic into dependent type theory, yielding multiplicities that depend on variables, supporting W-types, with semantics in indexed Categories with Families and an Agda implementation.
-
Heterogeneous Dynamic Logic: Provability Modulo Program Theories
HDL defines dynamic theories with lifting and combination operations, proves soundness and relative completeness in Isabelle, and demonstrates the approach on a Java controller steering a differential dynamic logic plant model.
-
Real-analyticity of 2-dimensional superintegrable metrics and solution of two Bolsinov-Kozlov-Fomenko conjectures
Proves Kiyohara's 2001 metrics with arbitrary high-degree polynomial integrals are not superintegrable, solving two Bolsinov-Kozlov-Fomenko conjectures via a new theorem on Poisson brackets of integrals.
-
Chiral Long-Range Order in three Euclidean Lattice Gross-Neveu Models
Long-range order for the fermion bilinear is proved in three Euclidean lattice Gross-Neveu models at small coupling and large even N via reflection positivity, chessboard estimates and a Peierls argument.
-
Network Realignment Complexes over General Graphs
Network realignment complexes over arbitrary connected graphs admit an equivariant deformation retraction onto a complete graph plus discrete space; for complete graphs, diameter bounds and Aut(X_n) ≅ S_n (n≥5) are established.
-
Dipole ghosts and spontaneous symmetry breaking in higher-order Chern-Simons theory
Dipole ghost sectors emerge from the multiplicity of classical solutions in higher-order Chern-Simons theory, and spontaneous symmetry breaking lifts this degeneracy.
-
The Spencer cohomology and integrability of multisymplectic structures
There is no bound on the order of the conditions needed to write a multisymplectic form with constant coefficients: for every j, explicit 3-forms in dimension 2j+5 require conditions of order j.
-
Learning Spectral and Polarimetric Clues for One-to-Multimodal Novel View Synthesis
SPoILeR uses multimodal pre-training to enable accurate novel view synthesis of infrared, polarimetric, and multispectral data from RGB-supervised fine-tuning on new scenes.
-
One-Weight Colorings, the Symmetric Class, and Lower Bounds for Hales--Jewett Numbers
Symmetric colorings of Hales-Jewett cubes coincide with one-weight colorings, reducing the symmetric lower-bound problem to 1D Gallai homothety coloring and yielding HJ(3,3)≥22 and HJ(4,2)≥14.
-
Refined blow-up criteria and global solutions for triangular cross-diffusion systems
Establishes refined L^p-based blow-up criteria for triangular SKT cross-diffusion systems via hierarchical structure and tame Sobolev estimates, and proves global existence of non-negative strong solutions for two-species logistic systems in d ≤ 2.
-
Failure of Convex-Hull Bounds under Log-Convex Tails
No universal constant exists allowing convex-hull bounds with controlled L_log norms for the difference set of arbitrary finite T under symmetric Weibull(r) processes when 0<r<1.
-
X-ray Coherent Attosecond Pulse Pair Spectroscopy
X-CAPPS generates coherent attosecond X-ray pulse pairs from Cu Kα1 stimulated emission pumped by SASE XFEL pulses and measures their time delays, amplitudes, and phases via interference spectra on sequential Bragg spectrometers.
-
On volume vectors determined by hypergraphs in thin subsets of Euclidean space
The paper establishes non-trivial dimensional thresholds for volume vectors determined by hypergraphs of simplices via a Jacobian method leveraging distance results and a refinement for planar triangles, improving prior bounds.
-
RESOLVE: A Multi-Resolution and Multi-Modal Dataset for Roadside Cooperative Perception
RESOLVE provides a controlled multi-resolution LiDAR and camera benchmark for evaluating 3D detection and tracking under point sparsity variations in roadside cooperative perception.
-
Constant-factor approximation of maximum distance-2 independent set in graphs of bounded merge-width
Constant-factor LP-based approximation for Max Dist-2 Independent Set (and Min Dominating Set) in bounded radius-2 merge-width graphs, with the domination-to-2-independence ratio shown bounded and tight for radius-1.
-
Diffusion-Based Material Regularization for Physics-Based Inverse Rendering
A regularization technique that treats diffusion model outputs as a similarity kernel during material optimization in inverse rendering, enabling joint reconstruction of geometry, materials, and illumination that satisfies the rendering equation and generalizes to new lighting.
-
Generic Number-of-Copies Amplification for Pseudorandom States
Any 1-PRS can be amplified to t-PRS for polynomial t by randomness accounting and quantum extractors that eliminate arbitrary ancilla.
-
AirGroundBench: Probing Spatial Intelligence in Multimodal Large Models under Heterogeneous Multi-View Embodied Collaboration
AirGroundBench is a new diagnostic benchmark exposing that MLLMs handle basic spatial perception but struggle with cross-view alignment, transformation reasoning, and embodied navigation under heterogeneous air-ground views.
-
Exact Leg-Cut Influence Functional and Emergence of Gaussian Entanglement Theory in a Statistical-Dressing Ladder Model
Exact lattice influence functional on a bipartitioned hard-core ladder proves density-density character for initial mixedness and analytic suppression of higher-order terms to Gaussian continuum form under coarse-graining.
-
CrypFormBench: Benchmarking Formal Analysis Capability of Large Language Models for Cryptographic Schemes
CrypFormBench is a new benchmark jointly covering symbolic and computational security to evaluate LLMs on five formal analysis capabilities, with results showing top model Claude-3.5 scores 48.7/100 and most models struggling on generation, transformation, and correction.
-
Canopies: A Generalization of Vines and Vineyards for Parameterized Persistence
Canopies generalize vines and vineyards by tracking simplex pairs in filtered chain complexes instead of persistence diagram points, with proofs of homeomorphism and applications to multiplicity and monodromy.
-
Virtual Surjection and the $n$-$(n+1)$-$(n+2)$ Theorem for Profinite Groups
Proves Virtual Surjection Conjecture and n-(n+1)-(n+2) Conjecture for profinite groups via a numerical criterion for FP_n of modules.
-
SEMIR: Topology-Preserving Graph Minors for Thin-Structure Segmentation
SEMIR uses topology-preserving graph minors to collapse pixel lattices into small supernode graphs for GNN classification, enabling full-resolution thin-structure segmentation without patching and matching baselines on three datasets with 4.6x less fragmentation.
-
The Mortensen observer on the space of probability measures
The authors construct a Mortensen-type observer on the Wasserstein space P2(R^d), establish dynamic programming and viscosity solution properties for the associated HJB equation using two formulations, prove uniqueness via comparison, and introduce a convergent semi-Lagrangian scheme.
-
FLM-Occ: Feed-forward Likelihood Maximization for Efficient Indoor Occupancy Prediction
FLM-Occ reformulates indoor occupancy prediction as feed-forward likelihood maximization over a mixture model with volume-normalized weights, achieving superior accuracy on Occ-ScanNet using only 32 superquadrics.
-
Giskard : Byzantine Robust and Confidential Aggregation for Large-Scale Decentralized Learning
Giskard is a new protocol using tree-structured log-sized committees and MPC-based approximate median to achieve scalable confidential and Byzantine-robust aggregation in decentralized learning.
-
FAIR+S: A validation study of a framework for sustainable research data and software
FAIR+S extends FAIR with sustainability metrics and is validated via expert survey confirming importance but revealing awareness gaps in green practices.
-
UAV-CAS: A Calibrated Digital-Twin Dataset for Intrusion Detection in UAV Swarm Networks
UAV-CAS is a calibrated digital-twin dataset with 99k flows across 1,024 configurations for training and testing intrusion detection in UAV swarm networks.
-
MeiBRD: Meta-Learning Intraoperative Biomechanical Residual Deformation
MeiBRD meta-learns a graph-neural residual deformation function to correct linear biomechanical predictions for intraoperative liver registration from sparse context samples.
-
VIPIR: A Versatile GPU Framework for Integrating Private Information Retrieval Protocols
VIPIR introduces two new PIR protocols, ExpPack compression, and GPU optimizations for NTT and GEMM that deliver orders-of-magnitude higher throughput than prior systems.
-
On Balance, To What Degree is Burr's Conjecture True?
For lopsided trees with t2 >= 2 t1, Burr's bound has a gap of order max(t1^2/t2, sqrt(t1)); for t2 >= 500 t1 the bound is tight if Delta(T) <= t2 - t1 but off by Omega(log t2) otherwise.
-
When Types Intersect and Effects Get Handled
Introduces the first intersection type system for a lambda calculus with algebraic effects and handlers that characterizes termination via subject reduction and expansion while inducing a sound simple type system with decidable HOMC.
-
Energy maximum principle for vectorial higher order absolute minimisers in $L^\infty$ and $L^p$
Vectorial higher-order L∞ absolute minimisers satisfy an energy maximum principle that exactly characterises absolute minimisers with respect to compactly supported variations.
-
Infinite sequences with optimal diaphony, periodic $L_2$-discrepancy, and beyond
Infinite order-2 digital sequences over F_2 attain the optimal periodic L2-discrepancy bound of order C_d (log N)^{d/2}/N for all N except 1, improving prior order-5 constructions by reducing dimension from 5d to 2d.
-
Local description of gl-regular Haantjes operators
A complete local classification of gl-regular Haantjes operators is derived, together with a splitting theorem for the general case and a treatment of complex eigenvalues.
-
Gaussian-Process Dynamics of Diagonal Expectation Propagation under Variance-Profile Gaussian Measurements
Diagonal EP under variance-profile Gaussian matrices produces Gaussian-process dynamics with profile-dependent memory instead of conventional scalar state evolution.
-
Anomalies in Multivariate Time Series Benchmarks Are Mostly Univariate
Anomalies in eight popular MTSAD benchmarks are predominantly univariate, with no cross-channel ruptures occurring without accompanying univariate deviations, rendering the benchmarks unsuitable for testing cross-channel modeling.
-
TIDES: Time-Derivative Event Simulation via Deformable Reconstruction
TIDES simulates realistic event camera streams in continuous time via dynamic Gaussian splatting with adaptive occlusion handling and sensor artifact modeling, claiming SOTA fidelity and better downstream transfer than prior methods.