arXiv (All)
open access
Tight Bounds for Anonymous Parity Certification
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Tight Bounds for Anonymous Parity Certification#1482970
- The impossibility of local skepticism#750548
- Varieties of Grounding Skepticism#73512
- Localizing the Gardam unit: the support geometry of units in F_2[P] and its non-unique-product relatives#1011293
- 47 U.S.C. § 342 — Process for issuing qualified carrier certification#597999
Record · ID 1489899
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive