{"as_of":"2026-08-16T18:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0860df71754a34b8e6179d92bd09466c9fb3afa58c5059a8fddf3846eca5d51c","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:14:34.145757Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.01956/citation-record","integrity":"/paper/1908.01956/integrity","json":"/paper/1908.01956/citation-record.json","paper":"/paper/1908.01956"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1809.03685","last_updated":"2018-09-14T23:41:03Z","snapshot_observed_at":"2026-08-15T06:50:46.733801Z","submitted_at":"2018-09-11T05:24:43Z","title":"Massively Parallel Dynamic Programming on Trees","version":2},"cited_work":{"arxiv_id":"1809.03685","doi":null,"metadata_source":"pith","pith_arxiv_id":"1809.03685","snapshot_observed_at":"2026-08-14T15:14:34.384109Z","title":"Massively Parallel Dynamic Programming on Trees","venue":"cs.DS","work_id":"6b3832b7-d69f-4f74-8552-17efbd8fe75f","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":3,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:34.071496Z"},"links":{"cited_paper":"/paper/1809.03685","citing_paper":"/paper/1908.01956"},"observation_digest":"sha256:4070de1edac0a6fd2d75ec6e9c4191867206cfda7321c4b50b0801788e7e4622","observation_id":"e9461a69-6fbc-45bf-9725-bfee83c831c7","resolution":{"observed_at":"2026-08-14T15:14:34.390684Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:14:34.502915Z","title":"A new frame- work for distributed submodular maximization","venue":null,"work_id":"9d509b38-138a-4357-b336-efccb5c94747","year":2016},"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":4,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:34.076787Z"},"links":{"citing_paper":"/paper/1908.01956"},"observation_digest":"sha256:afe30cbb100e1e8c9098f034dcfdd628a73224ef159f5da3d6b9a0a1b72b125d","observation_id":"a8407946-8845-4eb0-b911-39692d04550e","resolution":{"observed_at":"2026-08-14T15:14:34.507830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"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:2fc47a187aa524737d3a058f6d0e699b4ac378d09e51d354a039722564be85ac","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-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":"1209.5821","last_updated":"2013-11-16T15:08:23Z","snapshot_observed_at":"2026-08-16T12:10:17.119766Z","submitted_at":"2012-09-26T03:15:16Z","title":"Faster spectral sparsification and numerical algorithms for SDD matrices","version":3},"cited_work":{"arxiv_id":"1209.5821","doi":null,"metadata_source":"pith","pith_arxiv_id":"1209.5821","snapshot_observed_at":"2026-08-14T15:14:34.276162Z","title":"Faster spectral sparsification and numerical algorithms for SDD matrices","venue":"cs.DS","work_id":"2ed250ce-5720-47cd-ab08-75a7fd9dd270","year":2012},"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":10,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:34.107173Z"},"links":{"cited_paper":"/paper/1209.5821","citing_paper":"/paper/1908.01956"},"observation_digest":"sha256:8d88b041da10501a2772f71415799c0120b3596226b7dd4d1629ce6001e998f3","observation_id":"e458956b-500d-41e2-9a03-0a6b96585b9b","resolution":{"observed_at":"2026-08-14T15:14:34.281825Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:14:34.486676Z","title":"A framework for analyzing resparsification algorithms","venue":null,"work_id":"1f0edb9e-68df-437e-b5db-68553eb86138","year":null},"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":11,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:34.112687Z"},"links":{"citing_paper":"/paper/1908.01956"},"observation_digest":"sha256:3fdd6367b8afe8d58feab9795d6b312adee068587dfb99226c61578ca40aac0a","observation_id":"4b11a93a-d9c9-4d2b-898d-fa50fc327236","resolution":{"observed_at":"2026-08-14T15:14:34.491616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"0808.4134","last_updated":"2010-07-20T20:48:36Z","snapshot_observed_at":"2026-08-15T10:07:58.232659Z","submitted_at":"2008-08-29T17:17:29Z","title":"Spectral Sparsification of Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0808.4134","snapshot_observed_at":"2026-08-14T15:14:34.140894Z","title":"[TDB19] Thomas Tseng, Laxman Dhulipala, and Guy Blelloch","venue":null,"work_id":null,"year":null},"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":17,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:34.140894Z"},"links":{"cited_paper":"/paper/0808.4134","citing_paper":"/paper/1908.01956"},"observation_digest":"sha256:199edb1b9711ec794bf7dc39e5fb83199b51b0b26180745a1effc834009490a8","observation_id":"6ecad373-fc81-4fa9-88b5-b60416d358d5","resolution":{"observed_at":"2026-08-14T15:14:34.140894Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1807.10727","last_updated":"2018-07-27T16:53:45Z","snapshot_observed_at":"2026-08-14T18:46:58.370752Z","submitted_at":"2018-07-27T16:53:45Z","title":"Connected Components at Scale via Local Contractions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.10727","snapshot_observed_at":"2026-08-14T15:14:34.117478Z","title":"Connected components at scale via local contractions","venue":null,"work_id":null,"year":null},"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":2009,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:34.117478Z"},"links":{"cited_paper":"/paper/1807.10727","citing_paper":"/paper/1908.01956"},"observation_digest":"sha256:9619b5862ab4fa5cdb591b3d17f169725571c56ee57cb4bdcc8aa912040a0a80","observation_id":"5bae5a02-6213-45eb-9ec2-11f295d11218","resolution":{"observed_at":"2026-08-14T15:14:34.117478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:14:34.469053Z","title":"Distributed submodular maximization: Identifying representative ele ments in massive data","venue":null,"work_id":"cb960da3-a2f0-4353-8f79-fd3ea21b712b","year":null},"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":2010,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:34.122131Z"},"links":{"citing_paper":"/paper/1908.01956"},"observation_digest":"sha256:806a473ade2a80a7bb730d16aeb3ec98f12e8c28075bba428ad2ca7db0fa5baf","observation_id":"f8d24d54-90ae-4b3d-a7de-f7308275af46","resolution":{"observed_at":"2026-08-14T15:14:34.474458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"0803.0929","last_updated":"2009-11-18T07:22:03Z","snapshot_observed_at":"2026-08-15T10:20:03.330065Z","submitted_at":"2008-03-06T18:03:06Z","title":"Graph Sparsification by Effective Resistances","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0803.0929","snapshot_observed_at":"2026-08-14T15:14:34.136058Z","title":"[ST83] Daniel D","venue":null,"work_id":null,"year":null},"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":2011,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:34.136058Z"},"links":{"cited_paper":"/paper/0803.0929","citing_paper":"/paper/1908.01956"},"observation_digest":"sha256:ad346ec3d74d3b6182da4d53884f74c3494beb2f9dfc07561df0546637698539","observation_id":"0df31541-11f5-40c0-b7b7-bbc10073e0a8","resolution":{"observed_at":"2026-08-14T15:14:34.136058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1004.4389","last_updated":"2011-06-15T23:03:32Z","snapshot_observed_at":"2026-08-15T05:20:41.184198Z","submitted_at":"2010-04-25T23:21:23Z","title":"User-friendly tail bounds for sums of random matrices","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1004.4389","snapshot_observed_at":"2026-08-14T15:14:34.145757Z","title":"[VS86] Jeffrey Scott Vitter and Roger A","venue":null,"work_id":null,"year":null},"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":2012,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:34.145757Z"},"links":{"cited_paper":"/paper/1004.4389","citing_paper":"/paper/1908.01956"},"observation_digest":"sha256:067e285b05d71156d726c43984fe23ca955105b4ecb5b3dfa51ee3f461b39ef2","observation_id":"17bf0929-eaab-4b87-8551-708613209758","resolution":{"observed_at":"2026-08-14T15:14:34.145757Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:14:34.451456Z","title":"Spielman and N","venue":null,"work_id":"4bc40695-ee06-425a-a1d1-bb50a96f4575","year":1913},"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":2013,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:34.131278Z"},"links":{"citing_paper":"/paper/1908.01956"},"observation_digest":"sha256:e179c5394e99ab66c07a9372ed060def2df71a9eaeeaad985032eac1cb0b96ec","observation_id":"e00e840f-b6b5-43b6-8f39-7aa39d87a533","resolution":{"observed_at":"2026-08-14T15:14:34.457440Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1709.04599","last_updated":"2017-09-14T02:49:01Z","snapshot_observed_at":"2026-08-14T20:33:20.092159Z","submitted_at":"2017-09-14T02:49:01Z","title":"Simple Round Compression for Parallel Vertex Cover","version":1},"cited_work":{"arxiv_id":"1709.04599","doi":null,"metadata_source":"pith","pith_arxiv_id":"1709.04599","snapshot_observed_at":"2026-08-14T15:14:34.433496Z","title":"Simple Round Compression for Parallel Vertex Cover","venue":"cs.DS","work_id":"88c66930-4496-4c70-9c1e-fe7efd1a6155","year":2017},"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":2014,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:34.061244Z"},"links":{"cited_paper":"/paper/1709.04599","citing_paper":"/paper/1908.01956"},"observation_digest":"sha256:0350482ae432c8970244a96de6a9eb909970a984deff0a4fcd50a3ef6a2928cf","observation_id":"38f57bbb-01a4-49ed-b37c-d1ba822e5b49","resolution":{"observed_at":"2026-08-14T15:14:34.439694Z","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":"1509.06464","last_updated":"2015-09-22T04:56:11Z","snapshot_observed_at":"2026-08-14T22:31:24.848550Z","submitted_at":"2015-09-22T04:56:11Z","title":"Dynamic graph connectivity with improved worst case update time and sublinear space","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1509.06464","snapshot_observed_at":"2026-08-14T15:14:34.097257Z","title":"[GKMS18] Buddhima Gamlath, Sagar Kale, Slobodan Mitrovi´ c , and Ola Svensson","venue":null,"work_id":null,"year":null},"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":2015,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:34.097257Z"},"links":{"cited_paper":"/paper/1509.06464","citing_paper":"/paper/1908.01956"},"observation_digest":"sha256:e95c591eddeb0641b77cd379e4c9df961e4aa8e43d3e884b6917232881662168","observation_id":"79c51ab8-a1d8-41f8-bee9-ba253cb1264a","resolution":{"observed_at":"2026-08-14T15:14:34.097257Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1807.05374","last_updated":"2018-07-19T10:30:01Z","snapshot_observed_at":"2026-08-14T18:52:00.604455Z","submitted_at":"2018-07-14T10:33:21Z","title":"Matching and MIS for Uniformly Sparse Graphs in the Low-Memory MPC Model","version":2},"cited_work":{"arxiv_id":"1807.05374","doi":null,"metadata_source":"pith","pith_arxiv_id":"1807.05374","snapshot_observed_at":"2026-08-14T15:14:34.361290Z","title":"Matching and MIS for Uniformly Sparse Graphs in the Low-Memory MPC Model","venue":"cs.DS","work_id":"de63071c-3c78-4e20-b0dc-02c56ef24c63","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":2016,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:34.081216Z"},"links":{"cited_paper":"/paper/1807.05374","citing_paper":"/paper/1908.01956"},"observation_digest":"sha256:96129ffa7832c8cbef67381faade8b3afc0cb89e3b652a08a954235459390f5e","observation_id":"f781c0a9-fa51-4b0c-8dc4-f5ff57688fdb","resolution":{"observed_at":"2026-08-14T15:14:34.366428Z","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":"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":"1901.03744","last_updated":"2023-08-17T15:44:37Z","snapshot_observed_at":"2026-08-16T16:27:10.921472Z","submitted_at":"2019-01-11T20:50:30Z","title":"Exponentially Faster Massively Parallel Maximal Matching","version":6},"cited_work":{"arxiv_id":"1901.03744","doi":null,"metadata_source":"pith","pith_arxiv_id":"1901.03744","snapshot_observed_at":"2026-08-14T15:14:34.339175Z","title":"Exponentially Faster Massively Parallel Maximal Matching","venue":"cs.DS","work_id":"571b5c3b-6c1c-4251-b043-14a13bb06ddc","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":2018,"source":"pdf_text","source_observed_at":"2026-08-14T15:14:34.086119Z"},"links":{"cited_paper":"/paper/1901.03744","citing_paper":"/paper/1908.01956"},"observation_digest":"sha256:6b9b09760e51cc36772b2b6afa2527f3044bd455cf11d69229b4e41c2137fce2","observation_id":"9d7f7963-2f19-4227-871f-5b1829c2ea43","resolution":{"observed_at":"2026-08-14T15:14:34.343971Z","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":"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"}}],"paper":{"arxiv_id":"1908.01956","last_updated":"2019-08-06T04:56:46Z","latest_version":1,"primary_category":"cs.DS","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"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":5,"verified_exact":7,"verified_fuzzy":4},"total_outbound_references":17},"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 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:1908.01956."}