{"as_of":"2026-08-12T11:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:08addcff58c62a3f63af84c9eff912fdd6324110449ccddfd4a17c40387edac1","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-10T17:00:54.350660Z","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-07T00:49:33.092404Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2307.16771","last_updated":"2023-09-10T16:09:28Z","snapshot_observed_at":"2026-08-10T11:23:53.682411Z","submitted_at":"2023-07-31T15:38:22Z","title":"On the Complexity of Algorithms with Predictions for Dynamic Graph Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.16771","snapshot_observed_at":"2026-08-10T17:00:54.350660Z","title":"On the complexity of algorithms with predictions for dynamic graph problems","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-12T11:01:05.132901Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.350660Z"},"links":{"cited_paper":"/paper/2307.16771","citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:570eb1ee3a3e4ab3f29fc50e075c39a7095030eb07b21b4990c69166f85cd583","observation_id":"99f85a72-f56d-4582-af83-84e4d8ed221d","resolution":{"observed_at":"2026-08-10T17:00:54.350660Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.16771","last_updated":"2023-09-10T16:09:28Z","snapshot_observed_at":"2026-08-10T11:23:53.682411Z","submitted_at":"2023-07-31T15:38:22Z","title":"On the Complexity of Algorithms with Predictions for Dynamic Graph Problems","version":2},"cited_work":{"arxiv_id":"2307.16771","doi":null,"metadata_source":"pith","pith_arxiv_id":"2307.16771","snapshot_observed_at":"2026-08-07T00:49:33.092404Z","title":"On the Complexity of Algorithms with Predictions for Dynamic Graph Problems","venue":"cs.DS","work_id":"015653ad-151c-4543-a4f3-2d2bf7d4cc82","year":2023},"citing_paper":{"arxiv_id":"2506.13173","last_updated":"2025-06-16T07:34:54Z","snapshot_observed_at":"2026-08-11T04:39:42.642219Z","submitted_at":"2025-06-16T07:34:54Z","title":"Efficient Approximate Temporal Triangle Counting in Streaming with Predictions","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T00:49:24.213437Z"},"links":{"cited_paper":"/paper/2307.16771","citing_paper":"/paper/2506.13173"},"observation_digest":"sha256:97de805ab18702613070af52a1a001486606146de5420458699061ed9b745240","observation_id":"16291eb1-97ce-4634-b4d5-8d049b9e4473","resolution":{"observed_at":"2026-08-07T00:49:33.175045Z","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/2307.16771/citation-record","integrity":"/paper/2307.16771/integrity","json":"/paper/2307.16771/citation-record.json","paper":"/paper/2307.16771"},"outbound":[],"paper":{"arxiv_id":"2307.16771","last_updated":"2023-09-10T16:09:28Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-10T11:23:53.682411Z","submitted_at":"2023-07-31T15:38:22Z","title":"On the Complexity of Algorithms with Predictions for Dynamic Graph Problems"},"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 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2307.16771."}