{"as_of":"2026-08-10T03:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2ed09c709b8e0fafb3984917cf85e8aa99c24529761cd87478ff01648345ee39","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-09T06:31:02.800959+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-07T00:49:22.229353Z","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-06T15:45:55.637886Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2212.14220","last_updated":"2022-12-29T08:41:45Z","snapshot_observed_at":"2026-08-07T05:46:24.754775Z","submitted_at":"2022-12-29T08:41:45Z","title":"Graph Searching with Predictions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.14220","snapshot_observed_at":"2026-08-07T00:49:22.229353Z","title":"Banerjee, V","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.13173","last_updated":"2025-06-16T07:34:54Z","snapshot_observed_at":"2026-08-09T11:41:21.821744Z","submitted_at":"2025-06-16T07:34:54Z","title":"Efficient Approximate Temporal Triangle Counting in Streaming with Predictions","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T00:49:22.229353Z"},"links":{"cited_paper":"/paper/2212.14220","citing_paper":"/paper/2506.13173"},"observation_digest":"sha256:36e84073adbaa7663ce7e487c3fb894f968aed3e0a87e7411e6d4e7b6246d041","observation_id":"2f9dd4c5-962b-48d6-80d7-b864736e5bc1","resolution":{"observed_at":"2026-08-07T00:49:22.229353Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.14220","last_updated":"2022-12-29T08:41:45Z","snapshot_observed_at":"2026-08-07T05:46:24.754775Z","submitted_at":"2022-12-29T08:41:45Z","title":"Graph Searching with Predictions","version":1},"cited_work":{"arxiv_id":"2212.14220","doi":null,"metadata_source":"pith","pith_arxiv_id":"2212.14220","snapshot_observed_at":"2026-08-06T15:45:55.637886Z","title":"Graph Searching with Predictions","venue":"cs.DS","work_id":"90d4138e-1560-48f8-bbd4-6e613e2f6a74","year":2022},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-06T15:24:12.475474Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.447631Z"},"links":{"cited_paper":"/paper/2212.14220","citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:a572fb94e3f0324e41895e99c69450766c039aa8a831ea78bebd3763a8572b9c","observation_id":"997e955a-84f9-4489-b256-63225d6a4a05","resolution":{"observed_at":"2026-08-06T15:45:55.644719Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2212.14220/citation-record","integrity":"/paper/2212.14220/integrity","json":"/paper/2212.14220/citation-record.json","paper":"/paper/2212.14220"},"outbound":[],"paper":{"arxiv_id":"2212.14220","last_updated":"2022-12-29T08:41:45Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-07T05:46:24.754775Z","submitted_at":"2022-12-29T08:41:45Z","title":"Graph Searching with Predictions"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2212.14220."}