{"as_of":"2026-08-24T02:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eff077459813a0c46d1b18fcee3baa4ac8ca8bc81667acd2b57a17d8c76427d2","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T19:54:08.360833Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.04347/citation-record","integrity":"/paper/2607.04347/integrity","json":"/paper/2607.04347/citation-record.json","paper":"/paper/2607.04347"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T19:54:08.360833Z","title":"Alon and C","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.04347","last_updated":"2026-07-05T15:05:12Z","snapshot_observed_at":"2026-08-03T03:56:19.678402Z","submitted_at":"2026-07-05T15:05:12Z","title":"Strong Subgraph-Count Stability in $C_{2\\ell+1}$-Free Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-11T19:54:08.360833Z"},"links":{"citing_paper":"/paper/2607.04347"},"observation_digest":"sha256:996e848bcde312da64528264de8c1918b8d906b64b7e566d92d77fccdaecdd8d","observation_id":"21a7b5b1-b98f-4409-a357-d35aa29a86de","resolution":{"observed_at":"2026-07-11T19:54:08.360833Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T19:54:08.360833Z","title":"Erdős and A.H","venue":null,"work_id":null,"year":1946},"citing_paper":{"arxiv_id":"2607.04347","last_updated":"2026-07-05T15:05:12Z","snapshot_observed_at":"2026-08-03T03:56:19.678402Z","submitted_at":"2026-07-05T15:05:12Z","title":"Strong Subgraph-Count Stability in $C_{2\\ell+1}$-Free Graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-11T19:54:08.360833Z"},"links":{"citing_paper":"/paper/2607.04347"},"observation_digest":"sha256:a6b977dd973690a07a519bba7fc577dd9fe4ad0d93d833264d1e557a64fb4bd5","observation_id":"a48a2391-3924-4cca-b4a9-50499d9b4a9d","resolution":{"observed_at":"2026-07-11T19:54:08.360833Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T19:54:08.360833Z","title":"Erdős and M","venue":null,"work_id":null,"year":1966},"citing_paper":{"arxiv_id":"2607.04347","last_updated":"2026-07-05T15:05:12Z","snapshot_observed_at":"2026-08-03T03:56:19.678402Z","submitted_at":"2026-07-05T15:05:12Z","title":"Strong Subgraph-Count Stability in $C_{2\\ell+1}$-Free Graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-11T19:54:08.360833Z"},"links":{"citing_paper":"/paper/2607.04347"},"observation_digest":"sha256:f53a2b8f59671a394124ab2c13bb598c7a863aee922331b132562bf157aae063","observation_id":"4fbd2dfb-dc0a-44dd-ae96-7ae4b6286eef","resolution":{"observed_at":"2026-07-11T19:54:08.360833Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T19:54:08.360833Z","title":"Erdős, On the number of complete subgraphs contained in certain graphs, Publ","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2607.04347","last_updated":"2026-07-05T15:05:12Z","snapshot_observed_at":"2026-08-03T03:56:19.678402Z","submitted_at":"2026-07-05T15:05:12Z","title":"Strong Subgraph-Count Stability in $C_{2\\ell+1}$-Free Graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-11T19:54:08.360833Z"},"links":{"citing_paper":"/paper/2607.04347"},"observation_digest":"sha256:17833aa6d621c0410cd5d4288e7b359f1adf001cb22c03d78568d93e5a8f720f","observation_id":"87154be0-c7c5-4bb5-b8dc-e31a91101acb","resolution":{"observed_at":"2026-07-11T19:54:08.360833Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T19:54:08.360833Z","title":"Füredi and D.S","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.04347","last_updated":"2026-07-05T15:05:12Z","snapshot_observed_at":"2026-08-03T03:56:19.678402Z","submitted_at":"2026-07-05T15:05:12Z","title":"Strong Subgraph-Count Stability in $C_{2\\ell+1}$-Free Graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-11T19:54:08.360833Z"},"links":{"citing_paper":"/paper/2607.04347"},"observation_digest":"sha256:e63b807092e5c778446da42c02eaf9ead552a1a4d1cd0d6892b2cf8cc9bda7d4","observation_id":"9d2d1b88-afc9-4fef-8b73-0df93c197d7a","resolution":{"observed_at":"2026-07-11T19:54:08.360833Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T19:54:08.360833Z","title":"Gerbner, On Turán-good graphs, Discrete Math","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.04347","last_updated":"2026-07-05T15:05:12Z","snapshot_observed_at":"2026-08-03T03:56:19.678402Z","submitted_at":"2026-07-05T15:05:12Z","title":"Strong Subgraph-Count Stability in $C_{2\\ell+1}$-Free Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-11T19:54:08.360833Z"},"links":{"citing_paper":"/paper/2607.04347"},"observation_digest":"sha256:f384c3086463eff73d7cd88dbfa491304f334e3fd7180043151e1400512b7c01","observation_id":"2661ff7e-9b7f-497e-aaba-af8294c163ef","resolution":{"observed_at":"2026-07-11T19:54:08.360833Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T19:54:08.360833Z","title":"Gerbner and C","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.04347","last_updated":"2026-07-05T15:05:12Z","snapshot_observed_at":"2026-08-03T03:56:19.678402Z","submitted_at":"2026-07-05T15:05:12Z","title":"Strong Subgraph-Count Stability in $C_{2\\ell+1}$-Free Graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-11T19:54:08.360833Z"},"links":{"citing_paper":"/paper/2607.04347"},"observation_digest":"sha256:73119746f9010f9cdaec33d6a7aaf1c9deea3636c6fa7c8b6fe37620c14a74b7","observation_id":"d141a241-4140-44e4-b8c3-001bd4951828","resolution":{"observed_at":"2026-07-11T19:54:08.360833Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T19:54:08.360833Z","title":"Hei and X","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04347","last_updated":"2026-07-05T15:05:12Z","snapshot_observed_at":"2026-08-03T03:56:19.678402Z","submitted_at":"2026-07-05T15:05:12Z","title":"Strong Subgraph-Count Stability in $C_{2\\ell+1}$-Free Graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-11T19:54:08.360833Z"},"links":{"citing_paper":"/paper/2607.04347"},"observation_digest":"sha256:210ffd59895920f9bad553b3a52bb2c484eba0f624da4865da679605db8e71d8","observation_id":"68c6c7b6-0af0-4ed2-a176-2f440f1435c5","resolution":{"observed_at":"2026-07-11T19:54:08.360833Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T19:54:08.360833Z","title":"Mantel, Problem 28, Wiskundige Opgaven 10 (1907) 60–61","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2607.04347","last_updated":"2026-07-05T15:05:12Z","snapshot_observed_at":"2026-08-03T03:56:19.678402Z","submitted_at":"2026-07-05T15:05:12Z","title":"Strong Subgraph-Count Stability in $C_{2\\ell+1}$-Free Graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-11T19:54:08.360833Z"},"links":{"citing_paper":"/paper/2607.04347"},"observation_digest":"sha256:6298afeb55e531b49355a3b1647e8e2f1f49fc7f96e0d7ec8d5a78b13513a877","observation_id":"4b00a89b-f54a-4ee9-8418-defd326e8786","resolution":{"observed_at":"2026-07-11T19:54:08.360833Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T19:54:08.360833Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04347","last_updated":"2026-07-05T15:05:12Z","snapshot_observed_at":"2026-08-03T03:56:19.678402Z","submitted_at":"2026-07-05T15:05:12Z","title":"Strong Subgraph-Count Stability in $C_{2\\ell+1}$-Free Graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-11T19:54:08.360833Z"},"links":{"citing_paper":"/paper/2607.04347"},"observation_digest":"sha256:395aa084d9386f8769409c231910b8f9d9aae092226bd9d2a13d744ae6cec9a8","observation_id":"a83bad6d-cc07-472d-9583-7d7490a8d96d","resolution":{"observed_at":"2026-07-11T19:54:08.360833Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T19:54:08.360833Z","title":"Simonovits, A method for solving extremal problems in graph theory, stability problems, in: Theory of Graphs (Proc","venue":null,"work_id":null,"year":1966},"citing_paper":{"arxiv_id":"2607.04347","last_updated":"2026-07-05T15:05:12Z","snapshot_observed_at":"2026-08-03T03:56:19.678402Z","submitted_at":"2026-07-05T15:05:12Z","title":"Strong Subgraph-Count Stability in $C_{2\\ell+1}$-Free Graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-11T19:54:08.360833Z"},"links":{"citing_paper":"/paper/2607.04347"},"observation_digest":"sha256:dd8eed7dfe3e326cdc3df5c0fde5603ff9a7852fb08d15c5c69fd9e3b28d6cdd","observation_id":"7d9e4e70-915e-4fa8-b462-266641380a09","resolution":{"observed_at":"2026-07-11T19:54:08.360833Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T19:54:08.360833Z","title":"Turán, On an extremal problem in graph theory, Mat","venue":null,"work_id":null,"year":1941},"citing_paper":{"arxiv_id":"2607.04347","last_updated":"2026-07-05T15:05:12Z","snapshot_observed_at":"2026-08-03T03:56:19.678402Z","submitted_at":"2026-07-05T15:05:12Z","title":"Strong Subgraph-Count Stability in $C_{2\\ell+1}$-Free Graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-11T19:54:08.360833Z"},"links":{"citing_paper":"/paper/2607.04347"},"observation_digest":"sha256:7796d5cf78611d05439c3a2c693747f2846b59f2ab70bd7b2b2841b12f802abe","observation_id":"e7f39cae-8a62-4b07-9a26-35db68a93e9d","resolution":{"observed_at":"2026-07-11T19:54:08.360833Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T19:54:08.360833Z","title":"Yan and Y","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.04347","last_updated":"2026-07-05T15:05:12Z","snapshot_observed_at":"2026-08-03T03:56:19.678402Z","submitted_at":"2026-07-05T15:05:12Z","title":"Strong Subgraph-Count Stability in $C_{2\\ell+1}$-Free Graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-11T19:54:08.360833Z"},"links":{"citing_paper":"/paper/2607.04347"},"observation_digest":"sha256:de4414b7206b3258e385a86ea5ebfdf84aaf9f0e53664f346da5d5697dfa4cb8","observation_id":"aafb41ed-0cc8-49f7-b2e9-6a832c26c49c","resolution":{"observed_at":"2026-07-11T19:54:08.360833Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T19:54:08.360833Z","title":"Yan and Y","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.04347","last_updated":"2026-07-05T15:05:12Z","snapshot_observed_at":"2026-08-03T03:56:19.678402Z","submitted_at":"2026-07-05T15:05:12Z","title":"Strong Subgraph-Count Stability in $C_{2\\ell+1}$-Free Graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-11T19:54:08.360833Z"},"links":{"citing_paper":"/paper/2607.04347"},"observation_digest":"sha256:87579f4d763f996839d24096c4b1c47873b16c072832db4802f36546d4bb301a","observation_id":"ae52836f-6f49-4e0d-ad46-b955b5b326ef","resolution":{"observed_at":"2026-07-11T19:54:08.360833Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T19:54:08.360833Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.04347","last_updated":"2026-07-05T15:05:12Z","snapshot_observed_at":"2026-08-03T03:56:19.678402Z","submitted_at":"2026-07-05T15:05:12Z","title":"Strong Subgraph-Count Stability in $C_{2\\ell+1}$-Free Graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-11T19:54:08.360833Z"},"links":{"citing_paper":"/paper/2607.04347"},"observation_digest":"sha256:38f45668064a5967486e28f5805cede274590ce074223418a5c34a5cd8b5ffd9","observation_id":"9ca6bf6f-1fcd-4b39-81fc-de1f8db31f68","resolution":{"observed_at":"2026-07-11T19:54:08.360833Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.13643","last_updated":"2025-08-27T08:10:12Z","snapshot_observed_at":"2026-08-09T22:44:10.542942Z","submitted_at":"2025-08-19T08:54:09Z","title":"Strong spectral stabilities for $C_{2k+1}$-free graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.13643","snapshot_observed_at":"2026-07-11T19:54:08.360833Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04347","last_updated":"2026-07-05T15:05:12Z","snapshot_observed_at":"2026-08-03T03:56:19.678402Z","submitted_at":"2026-07-05T15:05:12Z","title":"Strong Subgraph-Count Stability in $C_{2\\ell+1}$-Free Graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-11T19:54:08.360833Z"},"links":{"cited_paper":"/paper/2508.13643","citing_paper":"/paper/2607.04347"},"observation_digest":"sha256:27dbea550074370292f42ceef4d385fdde077879fff60e7d454fb8575ade3eda","observation_id":"677959c3-e8a2-42bd-bf34-51ce64eeccaa","resolution":{"observed_at":"2026-07-11T19:54:08.360833Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.04347","last_updated":"2026-07-05T15:05:12Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-03T03:56:19.678402Z","submitted_at":"2026-07-05T15:05:12Z","title":"Strong Subgraph-Count Stability in $C_{2\\ell+1}$-Free Graphs"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":16},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 24 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2607.04347."}