archive
Every paper Pith has read. Search by title, abstract, or pith.
1340 papers in cs.IT · page 17
-
Alphabet growth boosts shuffled privacy only on collapse to delta_1
Growing Alphabets in Canonical Shuffle Experiments: Likelihood-Ratio Laws, Estimation Bounds, and Low-Budget Equivariant Design
-
DFT calibration refines low-fidelity digital twin channels
Wireless Digital Twin Calibration: Refining DFT-Domain Channel Information
-
Encoder maps sensitive data to non-reversible vectors without accuracy loss
Informationally Compressive Anonymization: Non-Degrading Sensitive Input Protection for Privacy-Preserving Supervised Machine Learning
-
Longitudinal overlaps yield absolute web-crawl coverage
Estimating Absolute Web Crawl Coverage From Longitudinal Set Intersections
-
Sampling lowers space for α-perfect hashing
Space Upper Bounds for $\alpha$-Perfect Hashing
-
Random simplex codes yield asymptotically good Fock-state codes
Asymptotically good bosonic Fock state codes
-
Few examples let fingerprint detectors adapt to new synthetics
Continual Few-shot Adaptation for Synthetic Fingerprint Detection
-
ISI Gaussian channels allow 2^(n log n R) identification
Identification for ISI Gaussian Channels
-
Dynamic counters deliver sublinear error for growing stream sketches
Sublime: Sublinear Error & Space for Unbounded Skewed Streams
-
Evidence contracts possibilistic ignorance into unique probability densities
The Geometry of Knowing: From Possibilistic Ignorance to Probabilistic Certainty -- A Measure-Theoretic Framework for Epistemic Convergence
-
Diffusion models learn pairwise stats at linear cost
A theory of learning data statistics in diffusion models, from easy to hard
-
LLMs link entropy to correctness by accumulating answer info in prefixes
The Stepwise Informativeness Assumption: Why are Entropy Dynamics and Reasoning Correlated in LLMs?
-
Code equivalence reduces to roots of Plücker invariants
Linear Code Equivalence via Pl\"ucker Coordinates
-
Non-iterative dMWF matches centralized Wiener filter
Distributed Multichannel Wiener Filtering for Wireless Acoustic Sensor Networks
-
TLp penalty yields tunable RIP bounds for sparse recovery
Transformed $\ell_p$ Minimization Model and Sparse Signal Recovery
-
DSTBC removes need for UE calibration in cell-free MIMO
Mitigation of UE Antenna Calibration Errors via Differential STBC in Cell-Free Massive MIMO
-
RIN makes GMI saturate as constellations grow denser
Optical Communications with Relative Intensity Noise: Channel Modeling and Information Rates
-
Weighted Chernoff information governs optimal loss exponent
Weighted Chernoff information and optimal loss exponent in context-sensitive hypothesis testing
-
Tilted sum for Markov sources reduces to affine occupation count
On the Fluctuations of the Single-Letter $d$-Tilted Sum for Binary Markov Sources
-
Analog codes fix single errors with three extra symbols
Analog Error Correcting Codes with Constant Redundancy
-
Polynomial probes yield o(1) bits for NP witness recovery
Intrinsic Information Flow in Structureless NP Search
-
Variational form tightens quantum randomness extraction bounds
Rethinking quantum smooth entropies: Tight one-shot analysis of quantum privacy amplification
-
Diffusion models traverse full RDP surface without retraining
Training-Free Rate-Distortion-Perception Traversal With Diffusion
-
Geometric analysis maps m-height profiles for multi-outlier analog codes
A New Class of Geometric Analog Error Correction Codes for Crossbar Based In-Memory Computing
-
Deep unfolding sets one metasurface phase across all bands
Deep Unfolding for SIM-Assisted Multiband MU-MISO Downlink Systems
-
Fejér filter gives finite-depth bounds for constrained QAOA
Finite-Depth, Finite-Shot Guarantees for Constrained Quantum Optimization via Fej\'er Filtering
-
Superposition edges time-sharing by under 2% for weighted UEP in fading
Weighted Unequal Error Protection over a Rayleigh Fading Channel
-
Double iteration converges to optimal Tsallis FPD solution
Towards Tsallis Fully Probabilistic Design
-
Coordinate ranks yield matroid bounds on zero-error recovery
Zero-Error Recovery under Deterministic Partial Views: Matroid Bounds and Verifiable Realizability
-
Matroid from coordinate ranks bounds zero-error recovery capacity
Zero-Error Recovery under Deterministic Partial Views: Matroid Bounds and Verifiable Realizability
-
Zero-knowledge proofs attest human authorship without biometric exposure
Privacy-Preserving Proof of Human Authorship via Zero-Knowledge Process Attestation
-
Utility gap between agents detects hidden messages in LLM outputs
A Decision-Theoretic Formalisation of Steganography With Applications to LLM Monitoring
-
Spatial consolidation raises total last-mile entropy
On the Entropy in Last-Mile Logistics
-
Optimal MC-CACs derived for M < w
Multichannel Conflict-Avoiding Codes for Expanded Scenarios
-
Quantum deletion codes also fix mixed insertions and deletions
Insertion Correcting Capability for Quantum Deletion-Correcting Codes
-
Encoder signals only along negative mismatch eigenvalues
Strategic Gaussian Signaling under Linear Sensitivity Mismatch
-
Capacity bounds derived for hard-core model on triangular lattice
Recoverable systems and the maximal hard-core model on the triangular lattice
-
Weakly convex-concave penalty recovers sparse signals from quadratic data
Support Recovery and $\ell_2$-Error Bound for Sparse Regression with Quadratic Measurements via Weakly-Convex-Concave Regularization
-
Hyperbolic invariant matches squared Hellinger for Gaussians
Isometric Invariant Quantification of Gaussian Divergence over Poincare Disc
-
Mobius invariance gives new Gaussian divergence measure
Isometric Invariant Quantification of Gaussian Divergence over Poincare Disc
-
Expander graphs bound Ingleton quantity from below
Spectral Conditions for the Ingleton Inequality
-
Semantic communication obeys rate-distance-complexity tradeoff
On the Rate-Distortion-Complexity Tradeoff for Semantic Communication
-
Concatenated codes bound scaling for DNA storage bits
Concatenated Codes for Short-Molecule DNA Storage with Sequencing Channels of Positive Zero-Undetected-Error Capacity
-
Beamforming maximizes secrecy rate in ISAC against dual eavesdroppers
Secure Beamforming for ISAC Systems Under Communication Eavesdropper and Sensing Eavesdropper
-
Fluid antennas cut detection complexity while keeping strong bounds
Cramer-Rao Bounds for Activity Detection in Conventional and Fluid Antenna Systems
-
Tight detection thresholds derived for masked bipartite latent graphs
Information-Theoretic Thresholds for Bipartite Latent-Space Graphs under Noisy Observations
-
Föllmer process selected to minimize path KL error
Variational Optimality of F\"ollmer Processes in Generative Diffusions
-
Signal-space alignment stabilizes binary flow matching
Binary Flow Matching: Prediction-Loss Space Alignment for Robust Learning
-
Self-play LLMs sustain evolution only with rising learnable information
Self-Play Only Evolves When Self-Synthetic Pipeline Ensures Learnable Information Gain
-
10 bits recover up to 72% of LLM performance gap
Haiku to Opus in Just 10 bits: LLMs Unlock Massive Compression Gains