Pith. sign in

Paper Citation Record · LEDGER

On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$

As of 18 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 0 inbound Pith citation observations for arXiv:2608.06698.

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

pith.paper-citation-record.v1
2608.06698 v1

Coverage vector

measured 13 of 13 reference resolution

Typed states for the displayed outbound observations.

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

measured 13 of 13 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-17T06:30:58.91139+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

13 of 13 outbound references displayed

  • verified exact1
  • verified fuzzy7
  • unresolved5
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 4487f141-91f2-41c4-b85a-816af4773b72 · outbound

This paper cites an unresolved cited work.

On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$ Unresolved cited work

Reference 1

Resolution
unresolved
raw_fallback, observed 2026-08-10T22:29:54.832440Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-10T22:29:54.640973Z digest=sha256:f2e1d6b76e0d0936e088da49a81d7b0c3ce61efa514f11c8ceee7f76c30f55e7

Observation a588f3d9-c395-43f5-95b8-5684d6708ca8 · outbound

This paper cites On 2-connected graphs without cycles of length 1 modulo 3.

On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$ On 2-connected graphs without cycles of length 1 modulo 3

Reference 2

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

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-10T22:29:54.644891Z digest=sha256:e2a2ac2773e2d8f67d9e75af90910e81abe4cf63aea0e316ebb8cb4353679086

Observation e13bb161-90bd-4d59-8d92-7589b7d06261 · outbound

This paper cites On graphs without cycles of length 1 modulo 3.

On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$ On graphs without cycles of length 1 modulo 3

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-10T22:29:54.648803Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T22:29:54.648803Z digest=sha256:15d93f3851323965b5f8f04aebcb726beefed45f3e64a982751aa8df06776d85

Observation 5a17f4fa-1354-43dd-a76f-a92209b18807 · outbound

This paper cites Bollob´ as, Cycles modulok,Bulletin of the London Mathematical Society9 (1) (1977), 97–98.

On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$ Bollob´ as, Cycles modulok,Bulletin of the London Mathematical Society9 (1) (1977), 97–98

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T22:29:54.823049Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-10T22:29:54.652524Z digest=sha256:35aa64a408b39076f509bd7bfa83fe18c40e3b2fb89a62478b15f1e0b1123fa5

Observation f3e4dddc-a721-4cd9-858c-3a6526148dcc · outbound

This paper cites Cai and W.

On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$ Cai and W

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T22:29:54.813094Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-10T22:29:54.656448Z digest=sha256:81387a084b27c894ac8242678ec70fc2a9d3dd372698b928148bcbd041d84439

Observation 1d40dc53-7aae-4b7b-84cf-73abf6b1008c · outbound

This paper cites Chen and A.

On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$ Chen and A

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T22:29:54.803994Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-10T22:29:54.659958Z digest=sha256:bc91c6a4a2c0072a10309d5f354b34650220ab48aecb6a7d4f12caade83089ee

Observation dc2c752f-f612-442e-ab67-9f16c86c9cf2 · outbound

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

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

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-10T22:29:54.663476Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T22:29:54.663476Z digest=sha256:544f9bd896dd9cf70a7e37be4ac9a336b5d67fe95b2365128cab9ebae6021f7a

Observation ab20486f-f5e6-43cc-bb0a-cfe8d4a60f55 · outbound

This paper cites Erd˝ os, Some recent problems and results in graph theory, combinatorics, and num- ber theory,Proc.

On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$ Erd˝ os, Some recent problems and results in graph theory, combinatorics, and num- ber theory,Proc

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T22:29:54.794800Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-10T22:29:54.666978Z digest=sha256:0aced5da5a7947a948330c9e98f974953c5a2a442697f2f11c756ac5054f6598

Observation 3aa0cf95-846e-4d22-b5d0-504fb22bac27 · outbound

This paper cites an unresolved cited work.

On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$ Unresolved cited work

Reference 9

Resolution
unresolved
raw_fallback, observed 2026-08-10T22:29:54.784024Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-10T22:29:54.670085Z digest=sha256:116b43b7b686bca3b7791e53dca801d65c67814da13a50a387e26dc0b26f4a6a

Observation c4a60a72-f573-45ec-b630-f32f7ef78cb1 · outbound

This paper cites an unresolved cited work.

On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$ Unresolved cited work

Reference 10

Resolution
unresolved
raw_fallback, observed 2026-08-10T22:29:54.774598Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-10T22:29:54.673146Z digest=sha256:2c8b19629fc5797ac71e7b6dca508a6c12026a6430f46dd72bf5b520ea3398c7

Observation ea85c884-88c2-45b2-9418-39f257413937 · outbound

This paper cites Gy˝ ori, B.

On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$ Gy˝ ori, B

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T22:29:54.764787Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-10T22:29:54.676250Z digest=sha256:596814df01a5c602977ff2ca12f04a525f0f594423bc7f8fb548f69a2e64cb88

Observation 0154287b-a286-4b1f-b8ba-8f194875a023 · outbound

This paper cites Simonovits, Extremal graph problems with symmetrical extremal graphs.

On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$ Simonovits, Extremal graph problems with symmetrical extremal graphs

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T22:29:54.755169Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-10T22:29:54.679260Z digest=sha256:4d22e022c8e57ef83127e01f33d16d8e095e2cc51a01dda0235a5ce79512ff8c

Observation c31ace9d-ce25-4741-8f96-29bfc4495622 · outbound

This paper cites Sudakov and J.

On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$ Sudakov and J

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T22:29:54.744857Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-10T22:29:54.682187Z digest=sha256:9c168a48f35f7ccc26e733ee8d276901cb364fd1f1abc6cee173a7d0acf34f93

Pith citing papers

No inbound Pith citation observations are available.