Pith. sign in

Paper Citation Record · LEDGER

Local Computation Algorithms for Coloring of Uniform Hypergraphs

As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2103.10990.

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

pith.paper-citation-record.v1
2103.10990 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-11T06:34:44.6726+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-10T22:29:43.106208Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-10T22:29:43.276692Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 56a60a7d-5fd9-441c-88ba-27af634276bd · inbound

Locally computing edge orientations cites this paper.

Locally computing edge orientations Local Computation Algorithms for Coloring of Uniform Hypergraphs

Reference 1986

Resolution
verified exact
local_arxiv, observed 2026-08-10T22:29:43.280654Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-08-10T22:29:43.106208Z digest=sha256:b84a4ad8dec83988bc6d29237efaa8582393961db2a7c127527eb8e5c93e932a

Observation 1d4ed68c-33ea-4850-b583-4397b7db996a · inbound

Graph k-Coloring in Average Sublinear Time cites this paper.

Graph k-Coloring in Average Sublinear Time Local Computation Algorithms for Coloring of Uniform Hypergraphs

Reference 51

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:58.404960Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:58.404960Z digest=sha256:d5d34bec4af6a320ff2976cf2c31c910fb756cec7770965f7c97b818fd81ac74