Pith. sign in

Paper Citation Record · LEDGER

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

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

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

pith.paper-citation-record.v1
2507.12798 v1

Coverage vector

measured 14 of 14 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-06T16:49:04.132022Z

measured 16 of 16 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+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-06-28T13:55:44.072306Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-07-01T23:46:24.174943Z

Reference resolution

14 of 14 outbound references displayed

  • verified exact2
  • verified fuzzy5
  • unresolved7
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 55a02a89-d7e2-45a8-8515-56ca0e7d25de · outbound

This paper cites an unresolved cited work.

On $2$-connected graphs avoiding cycles of length $0$ modulo $4$ Unresolved cited work

Reference 1

Resolution
unresolved
raw_fallback, observed 2026-08-06T16:49:07.559484Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-06T16:49:02.378990Z digest=sha256:4e689233a8b7e07b19f50e7a79b2a7f15ef16525ef3636f7a1af5e28ec634d81

Observation 8826c0ca-aafb-43a4-9299-9e4cac4df1dc · outbound

This paper cites Bollob´as.

On $2$-connected graphs avoiding cycles of length $0$ modulo $4$ Bollob´as

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:49:07.364832Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-06T16:49:02.509013Z digest=sha256:9be22eaf024b87341c19a7363ca82ae428f886b079128260922d2e3bd115a265

Observation 79d781d1-fbdf-46cd-8ca9-3400cbd0c799 · outbound

This paper cites an unresolved cited work.

On $2$-connected graphs avoiding cycles of length $0$ modulo $4$ Unresolved cited work

Reference 3

Resolution
unresolved
raw_fallback, observed 2026-08-06T16:49:07.097976Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-06T16:49:02.619308Z digest=sha256:8eb913435e07bf827a17cf3245ce031c4f4431869658299cdd0af687674248f9

Observation e93949b2-b92f-4b1a-a77c-9cadee6ace8f · outbound

This paper cites an unresolved cited work.

On $2$-connected graphs avoiding cycles of length $0$ modulo $4$ Unresolved cited work

Reference 4

Resolution
unresolved
raw_fallback, observed 2026-08-06T16:49:06.813545Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-06T16:49:02.784480Z digest=sha256:9406e7b2ff29c1e9dcbd43b0d4969fb049a913b776a4bd8da349cd11f358e0ca

Observation 8224a389-5c05-423c-b0fc-11bd6a1959ff · outbound

This paper cites an unresolved cited work.

On $2$-connected graphs avoiding cycles of length $0$ modulo $4$ Unresolved cited work

Reference 5

Resolution
unresolved
raw_fallback, observed 2026-08-06T16:49:06.567765Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-06T16:49:02.874529Z digest=sha256:11cd1acfab7109b274c4197ca56a089d4f4614d37c84ad709130b7e90e979c3c

Observation 2edb5809-57e6-43c0-beaa-0b44dc11f3f6 · outbound

This paper cites Erd˝os, Some recent problems and results in graph theory, combinatorics, and number theory, In Proc.

On $2$-connected graphs avoiding cycles of length $0$ modulo $4$ Erd˝os, Some recent problems and results in graph theory, combinatorics, and number theory, In Proc

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:49:06.301536Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-06T16:49:03.026531Z digest=sha256:b93497bbc105f4f3154152ede9d3e398fe99266c2b56b9148e226fc9ed8da26c

Observation 28b5e20e-42b6-4835-af50-2275b7fd0eec · outbound

This paper cites an unresolved cited work.

On $2$-connected graphs avoiding cycles of length $0$ modulo $4$ Unresolved cited work

Reference 7

Resolution
unresolved
raw_fallback, observed 2026-08-06T16:49:06.052682Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-06T16:49:03.169456Z digest=sha256:7e2c351912428dc19c01549c7bbb2059d46f67a13e19a5d21bbdfee6eae3acbb

Observation ac61b98e-c35e-4e9a-aaf6-1fb1b28586ef · outbound

This paper cites an unresolved cited work.

On $2$-connected graphs avoiding cycles of length $0$ modulo $4$ Unresolved cited work

Reference 8

Resolution
unresolved
raw_fallback, observed 2026-08-06T16:49:05.865893Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-06T16:49:03.295415Z digest=sha256:1c37fd115a8fd24cba29638ca43a7794ca04b3b66a6cc11ae8a256ce7f967a1f

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

This paper cites On graphs without cycles of length 0 modulo 4.

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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T16:49:03.427602Z digest=sha256:1fa911e58e084bfa6e319ba5a7c43a4f5f8585eb71855c9e0da7d838fcd13a66

Observation 26250f58-353b-485b-8c4b-9bf6a2b177bf · outbound

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

On $2$-connected graphs avoiding cycles of length $0$ modulo $4$ A note on two cycles of consecutive even lengths in graphs

Reference 10

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

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-06T16:49:03.558927Z digest=sha256:7c4f4439d367d88f656a1a42d47e4a2bdb32238ca14aa674bd06f8a2f0d0e7a7

Observation b51a1ab1-7425-458e-8192-a10ecea07fa8 · outbound

This paper cites an unresolved cited work.

On $2$-connected graphs avoiding cycles of length $0$ modulo $4$ Unresolved cited work

Reference 11

Resolution
unresolved
raw_fallback, observed 2026-08-06T16:49:05.674957Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-06T16:49:03.682246Z digest=sha256:e39a21e47470f434983c58c1fd93ddf8ad2e8cf6c1caa9cb1441466dd1016fe7

Observation 3bdd2d82-1d89-46d7-9d32-2895199351dd · outbound

This paper cites Saito, Cycles of length 2 modulo 3 in graphs, Discrete Mathematics, 101(1–3):285–289, 1992.

On $2$-connected graphs avoiding cycles of length $0$ modulo $4$ Saito, Cycles of length 2 modulo 3 in graphs, Discrete Mathematics, 101(1–3):285–289, 1992

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:49:05.478649Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-06T16:49:03.784122Z digest=sha256:12270f2903df23b3f21840749f43cdbe3e34404f2d5cc532564f388d3bd48f0e

Observation 097185c1-9f7e-4e5a-936a-f150a19be403 · outbound

This paper cites Sudakov and J.

On $2$-connected graphs avoiding cycles of length $0$ modulo $4$ Sudakov and J

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:49:05.168765Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-06T16:49:04.024623Z digest=sha256:1db2dcf5152e49a9ac65e6bdbee9eab43465508fbbfeddfd8648a71973b2cc6a

Observation 9ab67152-502d-4914-871b-e00aae10a555 · outbound

This paper cites Verstra ¨ete, Extremal problems for cycles in graphs, In Recent trends in combinatorics , Springer, 83–116, 2016.

On $2$-connected graphs avoiding cycles of length $0$ modulo $4$ Verstra ¨ete, Extremal problems for cycles in graphs, In Recent trends in combinatorics , Springer, 83–116, 2016

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:49:04.914824Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-06T16:49:04.132022Z digest=sha256:94ed3428b52da70677a4481549eb908011bd8fe85806c87f0c2d9f4cfd25b29e

Pith citing papers

Observation 9ff70c8d-4d7d-425a-8894-a4a144b01cee · inbound

Existence of cycles of length divisible by 3 or 4 cites this paper.

Existence of cycles of length divisible by 3 or 4 On $2$-connected graphs avoiding cycles of length $0$ modulo $4$

Reference 6

Resolution
verified exact
arxiv_id, observed 2026-05-09T06:40:40.374666Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-05-08T18:14:21.929479Z digest=sha256:e388d0346ad8c37486064181772c2ac1be3e151b28289e91a22f03cda4353f1b

Observation 5344d71e-ba25-423a-bc07-b63909a12090 · inbound

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

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

Reference 5

Resolution
verified exact
arxiv_id, observed 2026-07-01T23:46:24.176798Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-06-28T13:55:44.072306Z digest=sha256:c173c63fa0c372f458d1be74da5926ec9270bd0faddfd75ac085df18ebc5418d