{"as_of":"2026-08-16T01:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8e54b8685fa3dee678599a85f4d61bd85269e37bc0bf158a7ef02cd45657bb41","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-15T06:32:42.880941+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-14T15:14:34.102126Z","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-14T15:14:34.299383Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1904.08954","last_updated":"2019-04-18T18:01:33Z","snapshot_observed_at":"2026-08-15T06:50:46.224076Z","submitted_at":"2019-04-18T18:01:33Z","title":"A Conditional Lower Bound on Graph Connectivity in MapReduce","version":1},"cited_work":{"arxiv_id":"1904.08954","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.08954","snapshot_observed_at":"2026-08-14T15:14:34.299383Z","title":"A Conditional Lower Bound on Graph Connectivity in MapReduce","venue":"cs.CC","work_id":"4692cf04-c88c-4b9e-9bea-8442f208ee20","year":2019},"citing_paper":{"arxiv_id":"1908.01956","last_updated":"2019-08-06T04:56:46Z","snapshot_observed_at":"2026-08-15T16:31:11.433364Z","submitted_at":"2019-08-06T04:56:46Z","title":"Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:34.102126Z"},"links":{"cited_paper":"/paper/1904.08954","citing_paper":"/paper/1908.01956"},"observation_digest":"sha256:850abb524a2b9e8b242a5fffb921fc0c766d7e34ee25ddea89f4db74a4a7f202","observation_id":"9721df87-e289-41bb-8cd6-f2f42ea4e9ae","resolution":{"observed_at":"2026-08-14T15:14:34.304745Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1904.08954/citation-record","integrity":"/paper/1904.08954/integrity","json":"/paper/1904.08954/citation-record.json","paper":"/paper/1904.08954"},"outbound":[],"paper":{"arxiv_id":"1904.08954","last_updated":"2019-04-18T18:01:33Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-15T06:50:46.224076Z","submitted_at":"2019-04-18T18:01:33Z","title":"A Conditional Lower Bound on Graph Connectivity in MapReduce"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1904.08954."}