{"as_of":"2026-08-13T06:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8beb524cc50b1ff08108b88b86e53c692e01250e601d2f1f91353a4289614fd8","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T12:28:53.613412Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T17:14:11.753786Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.06449","last_updated":"2024-12-12T07:14:14Z","snapshot_observed_at":"2026-08-12T22:27:43.799614Z","submitted_at":"2024-10-09T01:13:35Z","title":"The number of edges in graphs with bounded clique number and circumference","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.06449","snapshot_observed_at":"2026-08-12T12:28:53.613412Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.17322","last_updated":"2024-12-12T07:08:43Z","snapshot_observed_at":"2026-08-12T12:11:47.159650Z","submitted_at":"2024-11-26T11:10:27Z","title":"Tur\\'an numbers of cycles plus a general graph","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T12:28:53.613412Z"},"links":{"cited_paper":"/paper/2410.06449","citing_paper":"/paper/2411.17322"},"observation_digest":"sha256:0c090777e54eae892b4f0e5dbd943aed03befcd7c48e7ac4b96761b6d3f671e2","observation_id":"87e27500-5c38-47b1-aba2-98250090fb1d","resolution":{"observed_at":"2026-08-12T12:28:53.613412Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.06449","last_updated":"2024-12-12T07:14:14Z","snapshot_observed_at":"2026-08-12T22:27:43.799614Z","submitted_at":"2024-10-09T01:13:35Z","title":"The number of edges in graphs with bounded clique number and circumference","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.06449","snapshot_observed_at":"2026-08-06T17:33:00.975335Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.11034","last_updated":"2025-07-15T06:56:13Z","snapshot_observed_at":"2026-08-11T11:58:59.711702Z","submitted_at":"2025-07-15T06:56:13Z","title":"Tur\\'an type problems for a fixed graph and a linear forest","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T17:33:00.975335Z"},"links":{"cited_paper":"/paper/2410.06449","citing_paper":"/paper/2507.11034"},"observation_digest":"sha256:483af8ecf2034efbd8aa2ac14ee27f944f890eb5b7a0065caa28a5cbfd0ffe18","observation_id":"4aee6f30-4b3c-41ea-8067-f0256ee8bc08","resolution":{"observed_at":"2026-08-06T17:33:00.975335Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.06449","last_updated":"2024-12-12T07:14:14Z","snapshot_observed_at":"2026-08-12T22:27:43.799614Z","submitted_at":"2024-10-09T01:13:35Z","title":"The number of edges in graphs with bounded clique number and circumference","version":3},"cited_work":{"arxiv_id":"2410.06449","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.06449","snapshot_observed_at":"2026-08-06T17:14:11.753786Z","title":"The number of edges in graphs with bounded clique number and circumference","venue":"math.CO","work_id":"2a8c78f1-84a8-48c9-82be-6f30a9425f7d","year":2024},"citing_paper":{"arxiv_id":"2507.12014","last_updated":"2025-07-16T08:18:54Z","snapshot_observed_at":"2026-08-10T14:20:11.721789Z","submitted_at":"2025-07-16T08:18:54Z","title":"Spectral extremal problems for degenerate graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:09.067949Z"},"links":{"cited_paper":"/paper/2410.06449","citing_paper":"/paper/2507.12014"},"observation_digest":"sha256:5ab3485208cc7af5ce961086d7355b88232af27224bb799f7b0ac51b4b5298a5","observation_id":"8e596539-dd21-440a-b471-17b5f8f54e27","resolution":{"observed_at":"2026-08-06T17:14:11.811535Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2410.06449/citation-record","integrity":"/paper/2410.06449/integrity","json":"/paper/2410.06449/citation-record.json","paper":"/paper/2410.06449"},"outbound":[],"paper":{"arxiv_id":"2410.06449","last_updated":"2024-12-12T07:14:14Z","latest_version":3,"primary_category":"math.CO","snapshot_observed_at":"2026-08-12T22:27:43.799614Z","submitted_at":"2024-10-09T01:13:35Z","title":"The number of edges in graphs with bounded clique number and circumference"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2410.06449."}