{"as_of":"2026-08-09T00:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:deca09defc8fbfb0145a74772001cdf12affc774a7dd7139d6704d304eb942ae","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.561577Z","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.316213Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.11696","last_updated":"2025-02-17T11:34:22Z","snapshot_observed_at":"2026-08-07T18:12:51.093040Z","submitted_at":"2025-02-17T11:34:22Z","title":"Determining the minimum size of maximal 1-plane graphs","version":1},"cited_work":{"arxiv_id":"2502.11696","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.11696","snapshot_observed_at":"2026-08-07T12:07:21.316213Z","title":"Determining the minimum size of maximal 1-plane graphs","venue":"math.CO","work_id":"45548801-4538-4b79-ada8-426765c717dd","year":2025},"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":16,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:20.561577Z"},"links":{"cited_paper":"/paper/2502.11696","citing_paper":"/paper/2506.00878"},"observation_digest":"sha256:dcb3ca0c6a87d7722c0c5176d46c1e35b44431016e2576ba7f9d4cbcbed398d9","observation_id":"5096b455-ce23-41d9-aa4a-4d7f77e55a75","resolution":{"observed_at":"2026-08-07T12:07:21.399777Z","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/2502.11696/citation-record","integrity":"/paper/2502.11696/integrity","json":"/paper/2502.11696/citation-record.json","paper":"/paper/2502.11696"},"outbound":[],"paper":{"arxiv_id":"2502.11696","last_updated":"2025-02-17T11:34:22Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-07T18:12:51.093040Z","submitted_at":"2025-02-17T11:34:22Z","title":"Determining the minimum size of maximal 1-plane graphs"},"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 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2502.11696."}