For a uniform random Boolean function on p bits, its low-degree Fourier coefficients uniquely determine it with high probability precisely when d exceeds p/2 by an O(sqrt(p log p)) window.
Probability inequalities for sums of bounded random variables
8 Pith papers cite this work. Polarity classification is still indexing.
8
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
years
2026 8roles
method 1polarities
use method 1representative citing papers
Rigorous security proofs for variable-length QKD, phase-error bounding with imperfect detectors, marginal-constrained entropy accumulation, and authentication reductions place practical QKD on firmer mathematical ground.
S2-WEF detects dynamic free-riders in federated learning by simulating attack WEF patterns from prior global models, combining them with mutual deviation scores, and using two-dimensional clustering without proxy data or pre-training.
STE is a differentiable method to compute continuous analogues of the Top Cycle and Uncovered Set from pairwise comparison data for stable set-valued evaluation of cyclic agent interactions.
SVAR-FM uses simulator clamping to produce interventional distributions and flow matching to identify time series causal structures, with an error bound that predicts sign reversal of causal effects below a simulator accuracy threshold.
Arqon delivers reliable quantum network service via admission control and scheduling that satisfies defined reliability requirements for accepted demands in static topologies, with O(k^3) and O(N^3) complexity.
NPAP is a Python package built on NetworkX that supplies 13 partitioning strategies and two aggregation profiles for network graph reduction via a strategy pattern allowing custom extensions.
An unsupervised-to-supervised ML pipeline on UK NDNS data discovers four dietary patterns, reproduces them with macro-F1 0.963 using a surrogate classifier, and interprets them via SHAP for potential clinical use.
citing papers explorer
-
Low-Degree Fourier Threshold for Random Boolean Functions
For a uniform random Boolean function on p bits, its low-degree Fourier coefficients uniquely determine it with high probability precisely when d exceeds p/2 by an O(sqrt(p log p)) window.
-
Rigorous Security Proofs for Practical Quantum Key Distribution
Rigorous security proofs for variable-length QKD, phase-error bounding with imperfect detectors, marginal-constrained entropy accumulation, and authentication reductions place practical QKD on firmer mathematical ground.
-
Dynamic Free-Rider Detection in Federated Learning via Simulated Attack Patterns
S2-WEF detects dynamic free-riders in federated learning by simulating attack WEF patterns from prior global models, combining them with mutual deviation scores, and using two-dimensional clustering without proxy data or pre-training.
-
Soft Tournament Equilibrium
STE is a differentiable method to compute continuous analogues of the Top Cycle and Uncovered Set from pairwise comparison data for stable set-valued evaluation of cyclic agent interactions.
-
Intervention-Based Time Series Causal Discovery via Simulator-Generated Interventional Distributions
SVAR-FM uses simulator clamping to produce interventional distributions and flow matching to identify time series causal structures, with an error bound that predicts sign reversal of causal effects below a simulator accuracy threshold.
-
Arqon: A suite of control applications enabling a reliable quantum network
Arqon delivers reliable quantum network service via admission control and scheduling that satisfies defined reliability requirements for accepted demands in static topologies, with O(k^3) and O(N^3) complexity.
-
NPAP: Network Partitioning and Aggregation Package for Python
NPAP is a Python package built on NetworkX that supplies 13 partitioning strategies and two aggregation profiles for network graph reduction via a strategy pattern allowing custom extensions.
-
An Explainable Unsupervised-to-Supervised Machine Learning Framework for Dietary Pattern Discovery Using UK National Dietary Survey Data
An unsupervised-to-supervised ML pipeline on UK NDNS data discovers four dietary patterns, reproduces them with macro-F1 0.963 using a surrogate classifier, and interprets them via SHAP for potential clinical use.