Pith. sign in

Paper Citation Record · LEDGER

On graphs without cycles of length 0 modulo 4

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

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

pith.paper-citation-record.v1
2312.09999 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-07T05:23:02.812754Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-06T16:49:04.550471Z

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 8edfb1d3-cee4-4f4c-803f-af18a81c0795 · inbound

A note on two cycles of consecutive even lengths in graphs cites this paper.

A note on two cycles of consecutive even lengths in graphs On graphs without cycles of length 0 modulo 4

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-07T05:23:02.812754Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T05:23:02.812754Z digest=sha256:67a91eeaeeec01c3c507ecfbdacb0c64631eb35ba9f96776d0c7a43c0343e839

Observation 2d93e954-baa1-46d2-9187-b3d1a837dc9f · inbound

On $2$-connected graphs avoiding cycles of length $0$ modulo $4$ cites this paper.

On $2$-connected graphs avoiding cycles of length $0$ modulo $4$ On graphs without cycles of length 0 modulo 4

Reference 9

Resolution
verified exact
local_arxiv, observed 2026-08-06T16:49:04.690456Z

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-06T16:49:03.427602Z digest=sha256:849a02044215c3b757e43ad2ae458cb4d7c4fa17b1439d0e859aa82e5ea0ec76