Distributed Statistical Zero-Knowledge Proofs via Sumcheck
2026-05-16T08:52:18Z•27520b23f7d1275c0be84005bfb376c2a0c8c1df01f741c4c2e084c094607631
DMRGROMACSHPCapplication-placementdistributed-zero-knowledgedynamic-graphsfog-computinggossip-protocolsgraph-algorithmsgraph-neural-networksgraph-sketcheshierarchical-clusteringinteractive-proofsmalleabilitymobile-agentsnon-k-colorabilityreinforcement-learningresource-management-middleware','supervised-distributed-computinrumor-spreadingsemi-synchronous-schedulersmall-messagesstatistical-zero-knowledgesubgraph-countingsumcheckwireless-mobility-modeling
What happened
Collection of new distributed-systems and machine-learning papers (arXiv 16 May 2026) covering: a distributed statistical zero-knowledge Sumcheck primitive with O(N) rounds and short messages and applications to non-k-colorability and subgraph counting; impossibility and matching bounds for semi-synchronous exploration in 1-interval-connected dynamic graphs; gossip/rumor-spreading algorithms achieving fast dissemination with polylog(n)-sized messages (bounds in terms of weak conductance and ~D+√n rounds) and MST construction; a hierarchical Wi‑Fi access-point mobility modeling method; a GNN +雙
Why it matters
A reviewed impact interpretation has not been published for this record.
Evidence and limitations
- Source ID
- arxiv_cs_dc
- Record identifier
- 27520b23f7d1275c0be84005bfb376c2a0c8c1df01f741c4c2e084c094607631
- Enrichment time
- 2026-05-16T08:52:18Z
- AI-assisted enrichment
- Yes
This record may overlap with other records. Its enrichment can be incomplete or wrong, and machine assistance was used. Validate consequential decisions against the linked source and your own environment.