Pith. sign in

Paper Citation Record · LEDGER

Restricted subgraphs of edge-colored graphs and applications

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

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

pith.paper-citation-record.v1
2412.13945 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-08T06:32:00.761636+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-07T04:29:03.481009Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-07T04:29:04.798558Z

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 752e2fa4-a242-4e95-8621-27d03bef169c · inbound

Recent progress in graph theory using expansion cites this paper.

Recent progress in graph theory using expansion Restricted subgraphs of edge-colored graphs and applications

Reference 113

Resolution
unresolved
no resolver link, observed 2026-08-01T00:48:46.448044Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-01T00:48:46.448044Z digest=sha256:887d12bc4579d4d7ee6ff184b2dcc0bc2db3c9e50f1cdc002def2ab81946ddf8

Observation b71e4f9a-afc6-492a-baa1-f0d6fc500665 · inbound

A proof of Andersen's rainbow path conjecture for large $n$ cites this paper.

A proof of Andersen's rainbow path conjecture for large $n$ Restricted subgraphs of edge-colored graphs and applications

Reference 57

Resolution
verified exact
local_arxiv, observed 2026-08-07T04:29:04.885281Z

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.

source=pdf_text observed=2026-08-07T04:29:03.481009Z digest=sha256:38c3b87466529f76ee32f257b03cea11284bca71a1d6576f749ba1f768ebf885