{"as_of":"2026-08-13T04:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cee6fa73d5a78f7f293d1afaffc2299d1f505fffbb7ace76a71f188982b11d01","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T17:32:01.317921Z","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-06T21:49:46.747471Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.05902","last_updated":"2024-06-08T15:18:22Z","snapshot_observed_at":"2026-08-13T00:10:49.978406Z","submitted_at":"2024-05-09T16:54:47Z","title":"The largest subgraph without a forbidden induced subgraph","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.05902","snapshot_observed_at":"2026-08-12T17:32:01.317921Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.12659","last_updated":"2024-11-19T17:07:29Z","snapshot_observed_at":"2026-08-12T17:15:03.226171Z","submitted_at":"2024-11-19T17:07:29Z","title":"Induced even cycles in locally sparse graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T17:32:01.317921Z"},"links":{"cited_paper":"/paper/2405.05902","citing_paper":"/paper/2411.12659"},"observation_digest":"sha256:63bef01b8f7a3386a2986654dc509202a5dadd6608d7b3753ae04fb5d103a0ea","observation_id":"472264d4-c5b1-41f5-ac77-495c8645894b","resolution":{"observed_at":"2026-08-12T17:32:01.317921Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.05902","last_updated":"2024-06-08T15:18:22Z","snapshot_observed_at":"2026-08-13T00:10:49.978406Z","submitted_at":"2024-05-09T16:54:47Z","title":"The largest subgraph without a forbidden induced subgraph","version":2},"cited_work":{"arxiv_id":"2405.05902","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.05902","snapshot_observed_at":"2026-08-06T21:49:46.747471Z","title":"The largest subgraph without a forbidden induced subgraph","venue":"math.CO","work_id":"59d4b290-bd80-471c-921e-c32f44915142","year":2024},"citing_paper":{"arxiv_id":"2506.23942","last_updated":"2025-06-30T15:09:00Z","snapshot_observed_at":"2026-08-06T21:25:28.080518Z","submitted_at":"2025-06-30T15:09:00Z","title":"$C_4$-free subgraphs of high degree with geometric applications","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T21:49:44.171760Z"},"links":{"cited_paper":"/paper/2405.05902","citing_paper":"/paper/2506.23942"},"observation_digest":"sha256:36fae16b8ebb663d0bb701116bab458e44046374695978edc931058f764248ad","observation_id":"b1deae82-8d2a-47b1-b009-61a5a73e606f","resolution":{"observed_at":"2026-08-06T21:49:46.798644Z","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/2405.05902/citation-record","integrity":"/paper/2405.05902/integrity","json":"/paper/2405.05902/citation-record.json","paper":"/paper/2405.05902"},"outbound":[],"paper":{"arxiv_id":"2405.05902","last_updated":"2024-06-08T15:18:22Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-08-13T00:10:49.978406Z","submitted_at":"2024-05-09T16:54:47Z","title":"The largest subgraph without a forbidden induced subgraph"},"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 2 inbound Pith citation observations for arXiv:2405.05902."}