Paper Citation Record · LEDGER

The local complexity of certifying parity

As of 8 August 2026, this Paper Citation Record lists 14 of 14 outbound references and 1 inbound Pith citation observation for arXiv:2606.04934.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2606.04934 v1

Coverage vector

measured 14 of 14 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-06-28T04:22:53.777865Z

measured 15 of 15 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-02T04:40:14.274726Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

14 of 14 outbound references displayed

verified exact11
verified fuzzy0
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch3

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 0fab6974-12c8-46ed-93de-4e4fb325f5d7 · outbound

This paper cites Optimal local certification on graphs of bounded pathwidth.

The local complexity of certifying parity Optimal local certification on graphs of bounded pathwidth

Reference 1

Resolution: verified exact; arxiv_id, observed 2026-06-28T04:31:39.731146Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation df7e3091-f1c3-432d-bffd-d1770c187ea9 · outbound

This paper cites Local certification of forbidden subgraphs.

The local complexity of certifying parity Local certification of forbidden subgraphs

Reference 2

Resolution: verified exact; arxiv_id, observed 2026-07-02T11:16:53.438553Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation fb8b28a4-a257-4275-9c44-ccd5db7b5cc4 · outbound

This paper cites Local certification of forbidden subgraphs.

The local complexity of certifying parity Local certification of forbidden subgraphs

Reference 3

Resolution: metadata mismatch; arxiv_id, observed 2026-06-28T04:31:39.735835Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation f06449b2-8409-450c-afbb-5cac0a70b585 · outbound

This paper cites 5 Nicolas Bousquet, Laurent Feuilloley, and Sébastien Zeitoun.

The local complexity of certifying parity 5 Nicolas Bousquet, Laurent Feuilloley, and Sébastien Zeitoun

Reference 4

Resolution: verified exact; doi, observed 2026-06-28T04:31:39.737732Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation beacfe74-ee76-4376-bd8e-7c07db3065a2 · outbound

This paper cites Local Certification of Local Properties: Tight Bounds, Trade-Offs, and New Parameters , journal =.

The local complexity of certifying parity Local Certification of Local Properties: Tight Bounds, Trade-Offs, and New Parameters , journal =

Reference 5

Resolution: metadata mismatch; doi, observed 2026-06-28T04:31:39.719210Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation ad0892cf-5673-4556-8ff5-77f1e2b5d0c3 · outbound

This paper cites 7 LindaCook, EunJungKim, andTomásMasarík.

The local complexity of certifying parity 7 LindaCook, EunJungKim, andTomásMasarík

Reference 6

Resolution: verified exact; arxiv_id, observed 2026-06-28T04:31:39.732647Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 39acd43b-6fe6-4459-9e62-ec87aadba24e · outbound

This paper cites 8 Laurent Feuilloley.

The local complexity of certifying parity 8 Laurent Feuilloley

Reference 7

Resolution: verified exact; arxiv_id, observed 2026-06-28T04:31:39.721786Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation f0e45466-8e84-45f4-9652-e5b615e5dbfb · outbound

This paper cites 9 Laurent Feuilloley, Nicolas Bousquet, and Théo Pierron.

The local complexity of certifying parity 9 Laurent Feuilloley, Nicolas Bousquet, and Théo Pierron

Reference 8

Resolution: verified exact; doi, observed 2026-06-28T04:31:39.723438Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 61216f5f-1beb-4626-9d82-a99b38154aaf · outbound

This paper cites 1007/S00453-021-00823-W.

The local complexity of certifying parity 1007/S00453-021-00823-W

Reference 9

Resolution: verified exact; doi, observed 2026-06-28T04:31:39.725123Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 49faf6c4-938d-4c65-a123-8dbaab2f44cd · outbound

This paper cites 12 Arnold Filtser and Orr Fischer.

The local complexity of certifying parity 12 Arnold Filtser and Orr Fischer

Reference 10

Resolution: verified exact; arxiv_id, observed 2026-07-02T11:16:53.440465Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation b4e0fc7d-e556-452f-9c8f-15bf0a978f4f · outbound

This paper cites Near-Resolution of the Tradeoff Conjecture in Distributed Proof Labeling Schemes.

The local complexity of certifying parity Near-Resolution of the Tradeoff Conjecture in Distributed Proof Labeling Schemes

Reference 11

Resolution: metadata mismatch; local_arxiv, observed 2026-07-02T11:16:53.442062Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 1f9a2635-59cb-495e-824e-6785a56e6b6c · outbound

This paper cites 14 Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, and Ioan Todinca.

The local complexity of certifying parity 14 Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, and Ioan Todinca

Reference 12

Resolution: verified exact; doi, observed 2026-06-28T04:31:39.727981Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 629e6832-7602-49c4-b1c2-6111fbc57237 · outbound

This paper cites 1007/s00453-023-01185-1,doi:10.1007/S00453-023-01185-1.

The local complexity of certifying parity 1007/s00453-023-01185-1,doi:10.1007/S00453-023-01185-1

Reference 13

Resolution: verified exact; doi, observed 2026-06-28T04:31:39.729866Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation e6c9f18d-54bf-4f55-a961-f9e7b250a467 · outbound

This paper cites 19 Moni Naor and Larry J.

The local complexity of certifying parity 19 Moni Naor and Larry J

Reference 14

Resolution: verified exact; doi, observed 2026-06-28T04:31:39.726170Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Pith citing papers

Observation 3f6e6814-4a1b-419e-ab4d-1ad1b01d082a · inbound

Local Certification of Vertex and Edge Connectivity cites this paper.

Local Certification of Vertex and Edge Connectivity The local complexity of certifying parity

Reference 2026

Resolution: unresolved; no resolver link, observed 2026-08-02T04:40:14.274726Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.