Arbitrary-depth k-stage masked NTT pipelines with fresh inter-stage masking and PF-PINI(≤2) gadgets satisfy a universal 2/q per-observation leakage bound, machine-checked in Lean 4.
(Springer Berlin Heidelberg, 2009)
18 Pith papers cite this work. Polarity classification is still indexing.
18
Pith papers citing it
citation-role summary
background 2
dataset 1
method 1
citation-polarity summary
representative citing papers
SMX explains spectral ML classifiers by summarizing expert zones with PCA, testing quantile predicates via perturbation, aggregating via directed graph centrality, and reconstructing thresholds back onto original spectra.
Hybrid Path-Sums offer a new symbolic framework with rewriting rules and assertions to represent, simplify, and verify properties of hybrid quantum-classical programs.
Multirate SVGD improves robustness and efficiency over standard SVGD by updating attraction and repulsion on independent time scales, with strongest gains on hierarchical and multimodal targets.
A categorical duality links algebraic and birelational semantics for constructive modal logic CK, enabling Sahlqvist correspondence, completeness, and Goldblatt-Thomason definability theorems.
A Maude-with-SMT framework for sound and complete formal analysis and parameter synthesis of parametric time Petri nets, including a folding approach that terminates on finite parametric state-class graphs and support for LTL model checking.
CuLifter recovers types from untyped GPU register files via constraint propagation to lift 99.98% of 24,437 functions across 919 cubins to valid LLVM IR.
An explicit A_infinity description of the Hochschild homology transfer yields a rational model for the Becker-Gottlieb transfer and proves vanishing of certain rational characteristic classes for manifold bundles while modeling fiberwise THH-simple structures.
In the dueling bandit setting, the (1+1) EA selects the Condorcet winner with only constant probability when its advantage is Ω(1/n), while a Max-Min Ant System EDA selects it with probability 1-Θ(p), and repeated duels improve the EA's performance.
Model-checking stateless quantum pushdown systems against PCTL is undecidable while against bPCTL it is decidable and NP-hard.
U-Schema acts as a common pivot representation that reduces the number of direct mappings needed for schema and data migration across heterogeneous database paradigms while preserving structure and query behavior.
For the figure-eight knot complement, the real part of the semi-classical limit of its QHI sequence is rigid and equals 0 or vol(M)/(2 pi) depending on parity of log holonomy eigenvalues on the canonical longitude.
SpecRL uses the fraction of negative tests rejected by candidate specifications as a reward signal in RL training to produce stronger and more verifiable formal specifications than prior methods.
Nine care-trajectory clusters derived from Dynamic Time Warping and hierarchical clustering independently predict mortality in cancer patients and show an inverse link to baseline anxiety in high-utilization groups.
Empirical review of 233 real-world vulnerabilities from 34 TON audits produces a specialized checklist for asynchronous message handling, supported by case studies and an 11-person practitioner survey.
The chapter synthesizes the history of adaptive learning systems and examines how AI can provide instructional intelligence and real-time adaptivity in serious games while highlighting challenges such as explainability and limited long-term outcome data.
Hybrid DEM-ARIMA-ML framework accelerates transient particle simulations while claiming to retain accuracy and match literature results.
citing papers explorer
-
The 1-Bit Barrier is Universal: k-Stage Pipeline Composition and Unified Leakage Bounds for Standard Modular Reductions in PQC Hardware
Arbitrary-depth k-stage masked NTT pipelines with fresh inter-stage masking and PF-PINI(≤2) gadgets satisfy a universal 2/q per-observation leakage bound, machine-checked in Lean 4.
-
Spectral Model eXplainer: a chemically-grounded explainability framework for spectral-based machine learning models
SMX explains spectral ML classifiers by summarizing expert zones with PCA, testing quantile predicates via perturbation, aggregating via directed graph centrality, and reconstructing thresholds back onto original spectra.
-
Hybrid Path-Sums for Hybrid Quantum Programs
Hybrid Path-Sums offer a new symbolic framework with rewriting rules and assertions to represent, simplify, and verify properties of hybrid quantum-classical programs.
-
Multirate Stein Variational Gradient Descent for Efficient Bayesian Sampling
Multirate SVGD improves robustness and efficiency over standard SVGD by updating attraction and repulsion on independent time scales, with strongest gains on hierarchical and multimodal targets.
-
Duality for Constructive Modal Logics: from Sahqlvist to Goldblatt-Thomason
A categorical duality links algebraic and birelational semantics for constructive modal logic CK, enabling Sahlqvist correspondence, completeness, and Goldblatt-Thomason definability theorems.
-
A rewriting-logic-with-SMT-based formal analysis and parameter synthesis framework for parametric time Petri nets
A Maude-with-SMT framework for sound and complete formal analysis and parameter synthesis of parametric time Petri nets, including a folding approach that terminates on finite parametric state-class graphs and support for LTL model checking.
-
CuLifter: Lifting GPU Binaries to Typed IR
CuLifter recovers types from untyped GPU register files via constraint propagation to lift 99.98% of 24,437 functions across 919 cubins to valid LLVM IR.
-
A rational model for the fiberwise THH transfer II: $A_\infty$-algebras
An explicit A_infinity description of the Hochschild homology transfer yields a rational model for the Becker-Gottlieb transfer and proves vanishing of certain rational characteristic classes for manifold bundles while modeling fiberwise THH-simple structures.
-
Analysis of Search Heuristics in the Multi-Armed Bandit Setting
In the dueling bandit setting, the (1+1) EA selects the Condorcet winner with only constant probability when its advantage is Ω(1/n), while a Max-Min Ant System EDA selects it with probability 1-Θ(p), and repeated duels improve the EA's performance.
-
Computational Complexity of Model-Checking Quantum Pushdown Systems
Model-checking stateless quantum pushdown systems against PCTL is undecidable while against bPCTL it is decidable and NP-hard.
-
A Model-Driven Approach to Database Migration with a Unified Data Model
U-Schema acts as a common pivot representation that reduces the number of direct mappings needed for schema and data migration across heterogeneous database paradigms while preserving structure and query behavior.
-
Volume Conjecture and quantum hyperbolic invariants: the figure eight knot complement
For the figure-eight knot complement, the real part of the semi-classical limit of its QHI sequence is rigid and equals 0 or vol(M)/(2 pi) depending on parity of log holonomy eigenvalues on the canonical longitude.
-
Reinforcement Learning with Negative Tests as Completeness Signal for Formal Specification Synthesis
SpecRL uses the fraction of negative tests rejected by candidate specifications as a reward signal in RL training to produce stronger and more verifiable formal specifications than prior methods.
-
Care Trajectories Are Linked to Mental Health and Mortality in Cancer Patients
Nine care-trajectory clusters derived from Dynamic Time Warping and hierarchical clustering independently predict mortality in cancer patients and show an inverse link to baseline anxiety in high-utilization groups.
-
From Paradigm Shift to Audit Rift: Empirical Analysis and Validation of Security Audit Methodologies for Asynchronous Smart Contract Systems
Empirical review of 233 real-world vulnerabilities from 34 TON audits produces a specialized checklist for asynchronous message handling, supported by case studies and an 11-person practitioner survey.
-
AI-Enabled Serious Games: Integrating Intelligence and Adaptivity in Training Systems
The chapter synthesizes the history of adaptive learning systems and examines how AI can provide instructional intelligence and real-time adaptivity in serious games while highlighting challenges such as explainability and limited long-term outcome data.
-
A machine learning framework for computationally expensive transient models
Hybrid DEM-ARIMA-ML framework accelerates transient particle simulations while claiming to retain accuracy and match literature results.
- Rational Weyl group elements of odd type D