cs.DC · 2026-07-16 · No. 55

Distributed, Parallel, and Cluster Computing, 2026-07-16.

4 new papers in cs.DC. Titles, authors, abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →

01 — The papers

4 entries
  1. 01

    Local Certification of Vertex and Edge Connectivity

    Yi-Jun Chang, Yi-Xuan Lee, Meng-Tsung Tsai

    cs.DC

    Local certification is a framework for verifying global graph properties using only local information. In this model, a prover assigns short labels, called certificates, to the vertices of a graph. Each vertex then exchanges certificates with its neighbors and performs a purely local check to determine whether the graph satisfies the desired property. This line of research has led to efficient certification schemes for a broad range of graph...

    arxiv.org/abs/2607.13677 · PDF

  2. 02

    A Distributed Framework for Compiling and Reasoning with d-DNNF

    Zhenghang Xu, Minghao Yin, jianan Wang, Jean-Marie Lagniez

    cs.DC

    Knowledge Compilation (KC) is a powerful paradigm that enables efficient reasoning by transforming propositional formulas into tractable target languages, such as Deterministic, Decomposable Negation Normal Form (d-DNNF). However, as real-world problem instances grow in complexity, the offline compilation phase becomes a significant computational bottleneck, often exceeding the memory and temporal limits of single-node systems. While...

    arxiv.org/abs/2607.13642 · PDF

  3. 03

    gDMC: A Generic Distributed Model Counting Framework via Work-Stealing

    Zhenghang Xu, Minghao Yin, Jumping Zhou, Jean-Marie Lagniez

    cs.DC

    Propositional Model Counting ($\#\mathsf{SAT}$) is essential for probabilistic reasoning but faces scalability limits on single cores. Existing distributed approaches struggle with high initialization overheads (static decomposition) or rigid architecture. We propose a novel, generic framework for distributed \emph{exact} model counting. Leveraging C++ templates, our architecture decouples parallel orchestration from solving logic, enabling...

    arxiv.org/abs/2607.13634 · PDF

  4. 04

    Fair on the Surface: Transaction-Ordering Bias and MEV in Mysticeti DAG-based BFT Protocol

    Iliya Mirzaei, Mohammad Javad Amiri

    cs.DC

    Distributed systems deployed in untrustworthy environments agree on a common transaction order through Byzantine fault-tolerant (BFT) consensus protocols, and that order has real financial value in many decentralized applications: whoever influences it can profit at other users' expense, a problem known as maximal extractable value (MEV). Mysticeti is a state-of-the-art DAG-based BFT protocol in which many validators propose blocks in...

    arxiv.org/abs/2607.13378 · PDF

This edition is part of The Daily Abstract — cs.DC archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.

Colophon Set in Georgia, with system sans for interface chrome and a monospaced stack for code and paper identifiers. Sole accent: amber #D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.