Pith. sign in

Paper Citation Record · LEDGER

Strong Subgraph-Count Stability in $C_{2\ell+1}$-Free Graphs

As of 23 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2607.04347.

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

pith.paper-citation-record.v1
2607.04347 v1

Coverage vector

measured 16 of 16 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-11T19:54:08.360833Z

measured 16 of 16 standing notices

One-hop event checks from named stored sources.

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

16 of 16 outbound references displayed

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

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 21a7b5b1-b98f-4409-a357-d35aa29a86de · outbound

This paper cites Alon and C.

Strong Subgraph-Count Stability in $C_{2\ell+1}$-Free Graphs Alon and C

Reference 1

Resolution
unresolved
no resolver link, observed 2026-07-11T19:54:08.360833Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T19:54:08.360833Z digest=sha256:996e848bcde312da64528264de8c1918b8d906b64b7e566d92d77fccdaecdd8d

Observation a48a2391-3924-4cca-b4a9-50499d9b4a9d · outbound

This paper cites Erdős and A.H.

Strong Subgraph-Count Stability in $C_{2\ell+1}$-Free Graphs Erdős and A.H

Reference 2

Resolution
unresolved
no resolver link, observed 2026-07-11T19:54:08.360833Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T19:54:08.360833Z digest=sha256:a6b977dd973690a07a519bba7fc577dd9fe4ad0d93d833264d1e557a64fb4bd5

Observation 4fbd2dfb-dc0a-44dd-ae96-7ae4b6286eef · outbound

This paper cites Erdős and M.

Strong Subgraph-Count Stability in $C_{2\ell+1}$-Free Graphs Erdős and M

Reference 3

Resolution
unresolved
no resolver link, observed 2026-07-11T19:54:08.360833Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T19:54:08.360833Z digest=sha256:f53a2b8f59671a394124ab2c13bb598c7a863aee922331b132562bf157aae063

Observation 87154be0-c7c5-4bb5-b8dc-e31a91101acb · outbound

This paper cites Erdős, On the number of complete subgraphs contained in certain graphs, Publ.

Strong Subgraph-Count Stability in $C_{2\ell+1}$-Free Graphs Erdős, On the number of complete subgraphs contained in certain graphs, Publ

Reference 4

Resolution
unresolved
no resolver link, observed 2026-07-11T19:54:08.360833Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T19:54:08.360833Z digest=sha256:17833aa6d621c0410cd5d4288e7b359f1adf001cb22c03d78568d93e5a8f720f

Observation 9d2d1b88-afc9-4fef-8b73-0df93c197d7a · outbound

This paper cites Füredi and D.S.

Strong Subgraph-Count Stability in $C_{2\ell+1}$-Free Graphs Füredi and D.S

Reference 5

Resolution
unresolved
no resolver link, observed 2026-07-11T19:54:08.360833Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T19:54:08.360833Z digest=sha256:e63b807092e5c778446da42c02eaf9ead552a1a4d1cd0d6892b2cf8cc9bda7d4

Observation 2661ff7e-9b7f-497e-aaba-af8294c163ef · outbound

This paper cites Gerbner, On Turán-good graphs, Discrete Math.

Strong Subgraph-Count Stability in $C_{2\ell+1}$-Free Graphs Gerbner, On Turán-good graphs, Discrete Math

Reference 6

Resolution
unresolved
no resolver link, observed 2026-07-11T19:54:08.360833Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T19:54:08.360833Z digest=sha256:f384c3086463eff73d7cd88dbfa491304f334e3fd7180043151e1400512b7c01

Observation d141a241-4140-44e4-b8c3-001bd4951828 · outbound

This paper cites Gerbner and C.

Strong Subgraph-Count Stability in $C_{2\ell+1}$-Free Graphs Gerbner and C

Reference 7

Resolution
unresolved
no resolver link, observed 2026-07-11T19:54:08.360833Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T19:54:08.360833Z digest=sha256:73119746f9010f9cdaec33d6a7aaf1c9deea3636c6fa7c8b6fe37620c14a74b7

Observation 68c6c7b6-0af0-4ed2-a176-2f440f1435c5 · outbound

This paper cites Hei and X.

Strong Subgraph-Count Stability in $C_{2\ell+1}$-Free Graphs Hei and X

Reference 8

Resolution
unresolved
no resolver link, observed 2026-07-11T19:54:08.360833Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T19:54:08.360833Z digest=sha256:210ffd59895920f9bad553b3a52bb2c484eba0f624da4865da679605db8e71d8

Observation 4b00a89b-f54a-4ee9-8418-defd326e8786 · outbound

This paper cites Mantel, Problem 28, Wiskundige Opgaven 10 (1907) 60–61.

Strong Subgraph-Count Stability in $C_{2\ell+1}$-Free Graphs Mantel, Problem 28, Wiskundige Opgaven 10 (1907) 60–61

Reference 9

Resolution
unresolved
no resolver link, observed 2026-07-11T19:54:08.360833Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T19:54:08.360833Z digest=sha256:6298afeb55e531b49355a3b1647e8e2f1f49fc7f96e0d7ec8d5a78b13513a877

Observation a83bad6d-cc07-472d-9583-7d7490a8d96d · outbound

This paper cites an unresolved cited work.

Strong Subgraph-Count Stability in $C_{2\ell+1}$-Free Graphs Unresolved cited work

Reference 10

Resolution
unresolved
no resolver link, observed 2026-07-11T19:54:08.360833Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T19:54:08.360833Z digest=sha256:395aa084d9386f8769409c231910b8f9d9aae092226bd9d2a13d744ae6cec9a8

Observation 7d9e4e70-915e-4fa8-b462-266641380a09 · outbound

This paper cites Simonovits, A method for solving extremal problems in graph theory, stability problems, in: Theory of Graphs (Proc.

Strong Subgraph-Count Stability in $C_{2\ell+1}$-Free Graphs Simonovits, A method for solving extremal problems in graph theory, stability problems, in: Theory of Graphs (Proc

Reference 11

Resolution
unresolved
no resolver link, observed 2026-07-11T19:54:08.360833Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T19:54:08.360833Z digest=sha256:dd8eed7dfe3e326cdc3df5c0fde5603ff9a7852fb08d15c5c69fd9e3b28d6cdd

Observation e7f39cae-8a62-4b07-9a26-35db68a93e9d · outbound

This paper cites Turán, On an extremal problem in graph theory, Mat.

Strong Subgraph-Count Stability in $C_{2\ell+1}$-Free Graphs Turán, On an extremal problem in graph theory, Mat

Reference 12

Resolution
unresolved
no resolver link, observed 2026-07-11T19:54:08.360833Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T19:54:08.360833Z digest=sha256:7796d5cf78611d05439c3a2c693747f2846b59f2ab70bd7b2b2841b12f802abe

Observation aafb41ed-0cc8-49f7-b2e9-6a832c26c49c · outbound

This paper cites Yan and Y.

Strong Subgraph-Count Stability in $C_{2\ell+1}$-Free Graphs Yan and Y

Reference 13

Resolution
unresolved
no resolver link, observed 2026-07-11T19:54:08.360833Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T19:54:08.360833Z digest=sha256:de4414b7206b3258e385a86ea5ebfdf84aaf9f0e53664f346da5d5697dfa4cb8

Observation ae52836f-6f49-4e0d-ad46-b955b5b326ef · outbound

This paper cites Yan and Y.

Strong Subgraph-Count Stability in $C_{2\ell+1}$-Free Graphs Yan and Y

Reference 14

Resolution
unresolved
no resolver link, observed 2026-07-11T19:54:08.360833Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T19:54:08.360833Z digest=sha256:87579f4d763f996839d24096c4b1c47873b16c072832db4802f36546d4bb301a

Observation 9ca6bf6f-1fcd-4b39-81fc-de1f8db31f68 · outbound

This paper cites an unresolved cited work.

Strong Subgraph-Count Stability in $C_{2\ell+1}$-Free Graphs Unresolved cited work

Reference 15

Resolution
unresolved
no resolver link, observed 2026-07-11T19:54:08.360833Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T19:54:08.360833Z digest=sha256:38f45668064a5967486e28f5805cede274590ce074223418a5c34a5cd8b5ffd9

Observation 677959c3-e8a2-42bd-bf34-51ce64eeccaa · outbound

This paper cites Strong spectral stabilities for $C_{2k+1}$-free graphs.

Strong Subgraph-Count Stability in $C_{2\ell+1}$-Free Graphs Strong spectral stabilities for $C_{2k+1}$-free graphs

Reference 16

Resolution
unresolved
no resolver link, observed 2026-07-11T19:54:08.360833Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T19:54:08.360833Z digest=sha256:27dbea550074370292f42ceef4d385fdde077879fff60e7d454fb8575ade3eda

Pith citing papers

No inbound Pith citation observations are available.