{"as_of":"2026-08-16T18:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:184ff16585e6b2a07189169ce6c6f4d9ed0ce069f400d377ea682724a7f89adc","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:21:03.179204Z","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.233863Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1807.08745","last_updated":"2018-07-23T17:49:03Z","snapshot_observed_at":"2026-08-16T12:13:37.496268Z","submitted_at":"2018-07-23T17:49:03Z","title":"Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space","version":1},"cited_work":{"arxiv_id":"1807.08745","doi":null,"metadata_source":"pith","pith_arxiv_id":"1807.08745","snapshot_observed_at":"2026-08-14T15:14:34.233863Z","title":"Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space","venue":"cs.DS","work_id":"8ee28390-3a62-4b38-be40-485ec4096400","year":2018},"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":2017,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:34.126687Z"},"links":{"cited_paper":"/paper/1807.08745","citing_paper":"/paper/1908.01956"},"observation_digest":"sha256:24d6e7694c0e919aad8bd6adfd891718384ec30f00d9a12efd04fa1fd173fc5d","observation_id":"dda86800-8af4-4b20-82c0-84ad4400cac3","resolution":{"observed_at":"2026-08-14T15:14:34.241062Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"1807.08745","last_updated":"2018-07-23T17:49:03Z","snapshot_observed_at":"2026-08-16T12:13:37.496268Z","submitted_at":"2018-07-23T17:49:03Z","title":"Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.08745","snapshot_observed_at":"2026-08-16T11:21:03.179204Z","title":"Round compression for parallel graph algorithms in strongly sublinear space","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.16382","last_updated":"2025-04-25T03:16:43Z","snapshot_observed_at":"2026-08-16T11:02:29.999264Z","submitted_at":"2025-04-23T03:24:15Z","title":"Fully Scalable MPC Algorithms for Euclidean k-Center","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-16T11:21:03.179204Z"},"links":{"cited_paper":"/paper/1807.08745","citing_paper":"/paper/2504.16382"},"observation_digest":"sha256:d2164d17ac35e8b638258b812380b8107ce0ecd640676cd286a1af1752e90e04","observation_id":"efd21560-bf1a-4b9a-8c11-6fc3dcf02242","resolution":{"observed_at":"2026-08-16T11:21:03.179204Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1807.08745","last_updated":"2018-07-23T17:49:03Z","snapshot_observed_at":"2026-08-16T12:13:37.496268Z","submitted_at":"2018-07-23T17:49:03Z","title":"Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.08745","snapshot_observed_at":"2026-08-16T04:47:55.481437Z","title":"Round Compression for Parallel Graph A lgorithms in Strongly Sublinear Space","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.00915","last_updated":"2025-05-01T23:26:31Z","snapshot_observed_at":"2026-08-16T04:29:19.637076Z","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T04:47:55.481437Z"},"links":{"cited_paper":"/paper/1807.08745","citing_paper":"/paper/2505.00915"},"observation_digest":"sha256:6dceac090d0f3509276cfa6250f570248d4ac023a5a4c220e60c0bf12b5463bb","observation_id":"53ed5b4c-b653-4202-9b9c-bebe8450c073","resolution":{"observed_at":"2026-08-16T04:47:55.481437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1807.08745/citation-record","integrity":"/paper/1807.08745/integrity","json":"/paper/1807.08745/citation-record.json","paper":"/paper/1807.08745"},"outbound":[],"paper":{"arxiv_id":"1807.08745","last_updated":"2018-07-23T17:49:03Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T12:13:37.496268Z","submitted_at":"2018-07-23T17:49:03Z","title":"Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space"},"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 3 inbound Pith citation observations for arXiv:1807.08745."}