{"as_of":"2026-08-08T21:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:76af042aa3dd6ad765cbe838f1fe7ed53ca1fe9320b12c1d37349d1ebfbaffee","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:07:20.249495Z","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-07T12:07:21.622139Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.16085","last_updated":"2024-08-28T18:28:23Z","snapshot_observed_at":"2026-08-07T22:24:10.140583Z","submitted_at":"2024-08-28T18:28:23Z","title":"On $k$-planar Graphs without Short Cycles","version":1},"cited_work":{"arxiv_id":"2408.16085","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.16085","snapshot_observed_at":"2026-08-07T12:07:21.622139Z","title":"On $k$-planar Graphs without Short Cycles","venue":"math.CO","work_id":"dffae46d-d286-42e4-8310-30b62c748f30","year":2024},"citing_paper":{"arxiv_id":"2506.00878","last_updated":"2025-06-01T07:37:34Z","snapshot_observed_at":"2026-08-08T10:00:16.549555Z","submitted_at":"2025-06-01T07:37:34Z","title":"The minimum size of maximal bipartite IC-plane graphs with given connectivity","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:20.249495Z"},"links":{"cited_paper":"/paper/2408.16085","citing_paper":"/paper/2506.00878"},"observation_digest":"sha256:335a82c81f030350455e2b1262ee5ee298ca50f0f9953373b6d31a0930a1358d","observation_id":"e4b89eb6-9d12-4a95-bcc6-d52f1aad9c15","resolution":{"observed_at":"2026-08-07T12:07:21.727731Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2408.16085/citation-record","integrity":"/paper/2408.16085/integrity","json":"/paper/2408.16085/citation-record.json","paper":"/paper/2408.16085"},"outbound":[],"paper":{"arxiv_id":"2408.16085","last_updated":"2024-08-28T18:28:23Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-07T22:24:10.140583Z","submitted_at":"2024-08-28T18:28:23Z","title":"On $k$-planar Graphs without Short Cycles"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2408.16085."}