Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.38829

Tight Bounds for Anonymous Parity Certification

Pedro Montealegre·Jorge Valenzuela
View original source ↗Read source document ↗Export metadata ↓

Abstract

Local certification is the task of verifying graph properties using certificates assigned to vertices and checked using only local information. A central question is which properties admit constant-size certificates, independently of network size. A fundamental test case is the parity of the network order. Bousquet, Feuilloley, Valenzuela, and Zeitoun (DISC 2026) showed that the complexity of certifying even order depends dramatically on the verification model. On arbitrary graphs, three bits per vertex suffice with unique identifiers and verification radius two. In the anonymous radius-one model, they established an $Ω(\log\log^* n)$ lower bound and an $O(\log n)$ upper bound. They also showed that constant-size certificates suffice in this model on bounded-expansion classes. In this paper, we settle the complexity of anonymous parity certification on general graphs and further investigate the role of graph sparsity. Our main contributions are: * We close the gap left by Bousquet et al., proving that the local complexity of certifying even order in the anonymous radius-one model is $Θ(\log\log n)$ bits. * We show that on graphs of degeneracy at most $d$, parity can be certified with $O(\log d)$ bits, while $Ω(\log\log d)$ bits are necessary. In particular, every class of bounded degeneracy admits constant-size certificates, strictly generalizing the result for bounded-expansion classes. * We show that constant-size certification cannot be guaranteed on nowhere-dense classes, a broader notion of sparsity that includes bounded expansion. We construct a fixed, subgraph-closed nowhere-dense class on which parity certification requires $Θ(\log\log n)$ bits. Together, our results provide a more complete picture of anonymous parity certification on sparse graph classes, showing that its complexity depends on the particular structural notion of sparsity.

Explore related subjects

cs.DC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pedro Montealegre, Jorge Valenzuela. 2026-10-28. Tight Bounds for Anonymous Parity Certification. https://arxiv.org/abs/2610.38829

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Rank-Aware CPU Reservation and In-Place Adjustment for MPI CFD on Kubernetes

Non-uniform meshes in computational fluid dynamics (CFD) can leave some Message Passing Interface (MPI) ranks waiting while others determine execution time. On Kubernetes, reserving a full CPU for every rank can then restrict the admission of further simulations. We investigate rank-aware CPU reservation and in-place request adjustment using OpenFOAM on three Kubernetes testbeds. The framework lowers reservations without hard CPU caps and uses online MPI profiles to adjust each rank's CPU request while the solver runs. We reduced the per-job CPU reservation from 16.0 to 5.9 vCPU, with single-job wall-clock time increasing by at most 6%. With these reservations on twelve nodes, six co-located simulations reached 4.09 times the throughput of sequential execution. Matched controls showed no consistent benefit from proportional request shaping. Beyond the nominal CPU capacity, throughput collapsed with default busy-waiting; yielding waits softened the collapse. In one six-simulation run, the online controller performed 120 in-place resizes of running solvers with zero pod restarts; the pipeline reached 2.5 times the throughput of sequential execution. In a separate comparison on 16 physical cores, reallocating ranks from the far field to the near-wall zone reduced fixed-iteration wall-clock time by factors of 2.0 to 4.2 relative to the original concentric allocation, depending on mesh and iteration horizon. The reallocation also outperformed balanced Scotch partitions. The implementation requires no changes to OpenFOAM, the MPI library, or the Kubernetes scheduler.

cs.DC↗
arXiv2026

The Illusion of Power Capping in LLM Decode: A Phase-Aware Energy Characterisation Across Attention Architectures

Power capping is a common GPU energy lever in LLM serving, and it appears to work: the cap is set, the GPU reports drawing less than it, and the energy budget is met. We show the cap does little for the phase that dominates LLM serving: autoregressive decode. Across four attention paradigms (GQA, MLA, Gated DeltaNet, and Mamba2) on an NVIDIA H200 under vLLM eager execution, decode kernels wait on HBM and the GPU idles between kernel launches, so decode draws less than half of the GPU's 700W rating and throughput stays within a few percent under every cap we set. The cap engages only when a large batch runs a long generation. Locking the SM clock instead lowers power without slowing memory-bound decode and recovers up to 32% of decode energy at minimal throughput loss. We identify three architecture-dependent frequency-scaling classes and find that, once prefill is measured without prefix caching, the recurrent architectures pay no prefill penalty: their linear-time mixing undercuts quadratic attention on long prompts, so their efficient decode adds to the prefill saving and lowers total request energy from the first output token at large batch.

cs.DC↗
arXiv2026

Simple-IT: Practical Low-Latency Signature-Free BFT Consensus

Recent advances in quantum computing pose a looming threat to most current Byzantine fault-tolerant (BFT) consensus protocols, which rely on quantum-vulnerable public-key signature schemes such as Ed25519 and BLS12-381. Instead of switching to much more expensive post-quantum secure signature schemes, an alternative is to use signature-free protocols, which rely only on cheap, post-quantum secure authenticated channels. In this paper, we ask whether signature-free BFT consensus protocols can match the performance of current state-of-the-art, quantum-vulnerable BFT consensus protocols. While previous work on the Sailfish++ protocol showed that state-of-the-art throughput is attainable signature-free, the question of latency is still open. Several recent signature-free protocols have low latency in theory, but they are all very intricate, and no practical implementation has so far been presented. In this work, we propose Simple-IT, a new leader-based, signature-free BFT consensus protocol that achieves a theoretical latency of 4 message delays (one more than the optimum), and only 3 on its optimistic path. Crucially, Simple-IT is simple enough to be amenable to implementation and to practical optimizations such as speculative pipelining, and, as we show experimentally in a geo-distributed testbed, it achieves both throughput and latency competitive with state-of-the-art quantum-vulnerable protocols.

cs.DC↗