{"as_of":"2026-08-08T10:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3eafb9d545dcb3bff4ff3d63bcc116cb88e20582356a937190c5070e15a38939","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-07T04:39:11.035503Z","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-07T04:39:11.345274Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2111.07345","last_updated":"2022-07-26T13:43:51Z","snapshot_observed_at":"2026-08-07T10:40:15.284646Z","submitted_at":"2021-11-14T13:56:20Z","title":"On the Performance of the Depth First Search Algorithm in Supercritical Random Graphs","version":3},"cited_work":{"arxiv_id":"2111.07345","doi":null,"metadata_source":"pith","pith_arxiv_id":"2111.07345","snapshot_observed_at":"2026-08-07T04:39:11.345274Z","title":"On the Performance of the Depth First Search Algorithm in Supercritical Random Graphs","venue":"math.CO","work_id":"3af3fa73-e37b-426d-ac72-52c0e191102f","year":2021},"citing_paper":{"arxiv_id":"2506.10084","last_updated":"2025-06-11T18:04:45Z","snapshot_observed_at":"2026-08-08T06:20:37.657963Z","submitted_at":"2025-06-11T18:04:45Z","title":"DeepTraverse: A Depth-First Search Inspired Network for Algorithmic Visual Understanding","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T04:39:11.035503Z"},"links":{"cited_paper":"/paper/2111.07345","citing_paper":"/paper/2506.10084"},"observation_digest":"sha256:3e8c063cc2009d8dc027e43460f9263614693baa6ef8128634935acf75800653","observation_id":"dc03a394-0c50-4b91-bcaa-d7a4bb769658","resolution":{"observed_at":"2026-08-07T04:39:11.451753Z","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/2111.07345/citation-record","integrity":"/paper/2111.07345/integrity","json":"/paper/2111.07345/citation-record.json","paper":"/paper/2111.07345"},"outbound":[],"paper":{"arxiv_id":"2111.07345","last_updated":"2022-07-26T13:43:51Z","latest_version":3,"primary_category":"math.CO","snapshot_observed_at":"2026-08-07T10:40:15.284646Z","submitted_at":"2021-11-14T13:56:20Z","title":"On the Performance of the Depth First Search Algorithm in Supercritical Random 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 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2111.07345."}