{"as_of":"2026-08-16T19:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4d448e30c2ad3072c03bffe137b2111d8d10ddf8e2db62e92c8da7db08d409fd","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-16T06:30:59.297886+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.066899Z","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.411433Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1905.00850","last_updated":"2019-05-02T16:53:55Z","snapshot_observed_at":"2026-08-14T16:38:06.434918Z","submitted_at":"2019-05-02T16:53:55Z","title":"Log Diameter Rounds Algorithms for $2$-Vertex and $2$-Edge Connectivity","version":1},"cited_work":{"arxiv_id":"1905.00850","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.00850","snapshot_observed_at":"2026-08-14T15:14:34.411433Z","title":"Log Diameter Rounds Algorithms for $2$-Vertex and $2$-Edge Connectivity","venue":"cs.DS","work_id":"ec1baf03-3255-47dc-9e21-c6b89b260532","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":2019,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:34.066899Z"},"links":{"cited_paper":"/paper/1905.00850","citing_paper":"/paper/1908.01956"},"observation_digest":"sha256:bc0fe12f9385db3e4dbf2a8f2821cec40e77adeb73c1d909ea520f688236704d","observation_id":"6bc31b2a-785f-404b-ab4f-f5b5a7036bbd","resolution":{"observed_at":"2026-08-14T15:14:34.416611Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1905.00850/citation-record","integrity":"/paper/1905.00850/integrity","json":"/paper/1905.00850/citation-record.json","paper":"/paper/1905.00850"},"outbound":[],"paper":{"arxiv_id":"1905.00850","last_updated":"2019-05-02T16:53:55Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T16:38:06.434918Z","submitted_at":"2019-05-02T16:53:55Z","title":"Log Diameter Rounds Algorithms for $2$-Vertex and $2$-Edge Connectivity"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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:1905.00850."}