Paper Citation Record · LEDGER

New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms

As of 12 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:2607.09626.

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

pith.paper-citation-record.v1
2607.09626 v1

Coverage vector

measured 24 of 24 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-13T01:39:09.857731Z

measured 24 of 24 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-12T06:34:41.77262+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

24 of 24 outbound references displayed

verified exact0
verified fuzzy0
unresolved24
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 2193240d-23b2-42c7-8354-d7c1bd473861 · outbound

This paper cites Locality in online, dynamic, sequential, and distributed graph algorithms.

New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms Locality in online, dynamic, sequential, and distributed graph algorithms

Reference 1

Resolution: unresolved; no resolver link, observed 2026-07-13T01:39:09.857731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation eba3ff1d-dc64-4c10-b829-060a3610e2a2 · outbound

This paper cites The distributed complexity of locally checkable problems on paths is decidable.

New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms The distributed complexity of locally checkable problems on paths is decidable

Reference 2

Resolution: unresolved; no resolver link, observed 2026-07-13T01:39:09.857731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2db79d65-350f-4732-81ab-b0727646204f · outbound

This paper cites Efficient Classification of Locally Checkable Problems in Regular Trees.

New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms Efficient Classification of Locally Checkable Problems in Regular Trees

Reference 3

Resolution: unresolved; no resolver link, observed 2026-07-13T01:39:09.857731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5bcbccda-cda9-4331-9d10-04cb8e357125 · outbound

This paper cites The Distributed Complexity Landscape on Trees Depends on the Knowledge About the Network Size.

New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms The Distributed Complexity Landscape on Trees Depends on the Knowledge About the Network Size

Reference 4

Resolution: unresolved; no resolver link, observed 2026-07-13T01:39:09.857731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e7740964-fedc-469d-abd0-a489eb68def5 · outbound

This paper cites Locally checkable problems in rooted trees.

New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms Locally checkable problems in rooted trees

Reference 5

Resolution: unresolved; no resolver link, observed 2026-07-13T01:39:09.857731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8b4a80d2-58e5-48b0-bc78-2998530eb9c3 · outbound

This paper cites Almost Global Problems in the LOCAL Model.

New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms Almost Global Problems in the LOCAL Model

Reference 6

Resolution: unresolved; no resolver link, observed 2026-07-13T01:39:09.857731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 65ba15f4-0af5-4487-8e55-1b34867029a0 · outbound

This paper cites Distributedquantumadvantage in locally checkable labeling problems.

New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms Distributedquantumadvantage in locally checkable labeling problems

Reference 7

Resolution: unresolved; no resolver link, observed 2026-07-13T01:39:09.857731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 15262655-0181-4d27-adaa-ce9240bc42da · outbound

This paper cites Locally Checkable Labelings with Small Messages.

New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms Locally Checkable Labelings with Small Messages

Reference 8

Resolution: unresolved; no resolver link, observed 2026-07-13T01:39:09.857731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a60fdeab-689e-4116-8e21-99694935840a · outbound

This paper cites Shared randomness helps with local distributed problems.

New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms Shared randomness helps with local distributed problems

Reference 9

Resolution: unresolved; no resolver link, observed 2026-07-13T01:39:09.857731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3c772bd2-83b9-4f63-b2fc-ea157fba4dcd · outbound

This paper cites Separating complexity classes of LCL problems on grids.

New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms Separating complexity classes of LCL problems on grids

Reference 10

Resolution: unresolved; no resolver link, observed 2026-07-13T01:39:09.857731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 293f9105-6482-4b5b-8a1c-edbaf5a8476c · outbound

This paper cites How local constraints influence network diameter and applications to LCL generalizations.

New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms How local constraints influence network diameter and applications to LCL generalizations

Reference 11

Resolution: unresolved; no resolver link, observed 2026-07-13T01:39:09.857731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f825d36a-0ea4-47d6-838a-1dcdaa9076c7 · outbound

This paper cites Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics.

New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics

Reference 12

Resolution: unresolved; no resolver link, observed 2026-07-13T01:39:09.857731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ba55ad96-29e8-4d4f-b05d-19b1404f0e1e · outbound

This paper cites The randomized local computation complexity of the lovász local lemma.

New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms The randomized local computation complexity of the lovász local lemma

Reference 13

Resolution: unresolved; no resolver link, observed 2026-07-13T01:39:09.857731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7af68541-c19f-4c74-b998-0beb9cc1285e · outbound

This paper cites The Complexity Landscape of Distributed Locally Checkable Problems on Trees.

New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms The Complexity Landscape of Distributed Locally Checkable Problems on Trees

Reference 14

Resolution: unresolved; no resolver link, observed 2026-07-13T01:39:09.857731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f8219df6-3dd1-4003-a318-7c85449a1b34 · outbound

This paper cites The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees.

New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees

Reference 15

Resolution: unresolved; no resolver link, observed 2026-07-13T01:39:09.857731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 648cfaf6-8f46-4493-8682-a9b3a4bd8215 · outbound

This paper cites Local problems in trees across a wide range of distributed models.

New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms Local problems in trees across a wide range of distributed models

Reference 16

Resolution: unresolved; no resolver link, observed 2026-07-13T01:39:09.857731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0ecd357e-97e6-4059-a783-7e3b8d48a06f · outbound

This paper cites Non-Local Probes Do Not Help with Graph Problems.

New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms Non-Local Probes Do Not Help with Graph Problems

Reference 17

Resolution: unresolved; no resolver link, observed 2026-07-13T01:39:09.857731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 28b24577-c4e2-464f-bda9-1b7834753785 · outbound

This paper cites The landscape of distributed complexities on trees and beyond.

New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms The landscape of distributed complexities on trees and beyond

Reference 18

Resolution: unresolved; no resolver link, observed 2026-07-13T01:39:09.857731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 05200251-cff1-4e04-b78e-054dcf4a1f25 · outbound

This paper cites Shared randomness in locally checkable problems: The role of computational assumptions.

New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms Shared randomness in locally checkable problems: The role of computational assumptions

Reference 19

Resolution: unresolved; no resolver link, observed 2026-07-13T01:39:09.857731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dc48f19a-3da6-4031-a54c-34c70cfd870f · outbound

This paper cites Constructing low-redundancy codes via distributed graph coloring.arXiv preprint arXiv:2512.04197,.

New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms Constructing low-redundancy codes via distributed graph coloring.arXiv preprint arXiv:2512.04197,

Reference 20

Resolution: unresolved; no resolver link, observed 2026-07-13T01:39:09.857731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 665f732e-6103-467a-8a82-45f24f06ebb8 · outbound

This paper cites Fast Local Computation Algorithms.

New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms Fast Local Computation Algorithms

Reference 21

Resolution: unresolved; no resolver link, observed 2026-07-13T01:39:09.857731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c9d85870-5099-4762-961a-ccd9f4f247e0 · outbound

This paper cites LCLs Beyond Bounded Degrees.

New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms LCLs Beyond Bounded Degrees

Reference 22

Resolution: unresolved; no resolver link, observed 2026-07-13T01:39:09.857731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation eacc410e-bfca-4721-92d9-3d93ab8915b0 · outbound

This paper cites An algebraic approach to Borel CSPs.

New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms An algebraic approach to Borel CSPs

Reference 23

Resolution: unresolved; no resolver link, observed 2026-07-13T01:39:09.857731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1ea562f8-4eaa-4d7f-afcf-4bdae56e8011 · outbound

This paper cites Distributedconstraint satisfaction for formalizing distributed problem solving.

New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms Distributedconstraint satisfaction for formalizing distributed problem solving

Reference 24

Resolution: unresolved; no resolver link, observed 2026-07-13T01:39:09.857731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.