{"as_of":"2026-08-16T20:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e0894b0b61180b007a29d8e69be9980c3de8a4abd522405552324e83483b7eb2","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:42:07.507886Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T13:28:19.161282Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1907.10937","last_updated":"2020-05-10T18:24:18Z","snapshot_observed_at":"2026-08-14T16:02:29.337051Z","submitted_at":"2019-07-25T10:01:49Z","title":"Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.10937","snapshot_observed_at":"2026-08-14T14:42:07.507886Z","title":"Polylogarithmic-time deterministic network decomposition and distributed derandomization","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"1908.03022","last_updated":"2020-08-03T13:53:51Z","snapshot_observed_at":"2026-08-16T10:27:37.011094Z","submitted_at":"2019-08-08T11:35:44Z","title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-14T14:42:07.507886Z"},"links":{"cited_paper":"/paper/1907.10937","citing_paper":"/paper/1908.03022"},"observation_digest":"sha256:036b3caa8cf55945d29788f14054209ea07ac10ed430235b5f64af6509d64d94","observation_id":"15f43d1a-d12a-4ae9-9a3e-a61395e8de52","resolution":{"observed_at":"2026-08-14T14:42:07.507886Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.10937","last_updated":"2020-05-10T18:24:18Z","snapshot_observed_at":"2026-08-14T16:02:29.337051Z","submitted_at":"2019-07-25T10:01:49Z","title":"Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.10937","snapshot_observed_at":"2026-08-14T13:08:40.374077Z","title":"Polylogarithmic-time deterministic network decomposition and distributed derandomization","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"1908.06270","last_updated":"2019-08-20T10:47:56Z","snapshot_observed_at":"2026-08-16T10:29:16.344692Z","submitted_at":"2019-08-17T09:24:35Z","title":"A Sharp Threshold Phenomenon for the Distributed Complexity of the Lov\\'asz Local Lemma","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-14T13:08:40.374077Z"},"links":{"cited_paper":"/paper/1907.10937","citing_paper":"/paper/1908.06270"},"observation_digest":"sha256:b73879495ad1d3f1222cf81a4648128a722ba94bac122285d3d14310f7e8d11a","observation_id":"5833f925-11e4-438e-bd89-ab0753cdf9eb","resolution":{"observed_at":"2026-08-14T13:08:40.374077Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.10937","last_updated":"2020-05-10T18:24:18Z","snapshot_observed_at":"2026-08-14T16:02:29.337051Z","submitted_at":"2019-07-25T10:01:49Z","title":"Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization","version":2},"cited_work":{"arxiv_id":"1907.10937","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.10937","snapshot_observed_at":"2026-07-03T13:28:19.161282Z","title":"RozhoňandM","venue":null,"work_id":"0fdf2269-6070-4ffc-b9ea-ba19d82b2c94","year":2020},"citing_paper":{"arxiv_id":"2606.11558","last_updated":"2026-07-01T05:58:05Z","snapshot_observed_at":"2026-08-08T04:34:54.901040Z","submitted_at":"2026-06-10T01:35:26Z","title":"Measurable matchings in unbalanced graphs","version":1},"reference_index":130,"source":"pdf_text","source_observed_at":"2026-06-27T07:58:19.731645Z"},"links":{"cited_paper":"/paper/1907.10937","citing_paper":"/paper/2606.11558"},"observation_digest":"sha256:40bb839fa6f8c6cf4d66ab2cbb546660544e7f55d4cf96aefac676d9d312d3b8","observation_id":"a31eb629-86fc-4db2-bf26-62f5b17a798a","resolution":{"observed_at":"2026-07-03T13:28:19.162828Z","resolver_source":"arxiv_id","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":"1907.10937","last_updated":"2020-05-10T18:24:18Z","snapshot_observed_at":"2026-08-14T16:02:29.337051Z","submitted_at":"2019-07-25T10:01:49Z","title":"Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization","version":2},"cited_work":{"arxiv_id":"1907.10937","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.10937","snapshot_observed_at":"2026-07-03T13:28:19.161282Z","title":"RozhoňandM","venue":null,"work_id":"0fdf2269-6070-4ffc-b9ea-ba19d82b2c94","year":2020},"citing_paper":{"arxiv_id":"2606.11558","last_updated":"2026-07-01T05:58:05Z","snapshot_observed_at":"2026-08-08T04:34:54.901040Z","submitted_at":"2026-06-10T01:35:26Z","title":"Measurable matchings in unbalanced graphs","version":2},"reference_index":131,"source":"pdf_text","source_observed_at":"2026-07-02T22:41:26.591332Z"},"links":{"cited_paper":"/paper/1907.10937","citing_paper":"/paper/2606.11558"},"observation_digest":"sha256:a30f89547a9568246334afa34d80bde1e36e5f624fd438fe0745693ab3dfdd99","observation_id":"48ef7cf6-23cd-44e1-9dc8-387fe2e6b55f","resolution":{"observed_at":"2026-07-02T22:47:25.362380Z","resolver_source":"arxiv_id","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/1907.10937/citation-record","integrity":"/paper/1907.10937/integrity","json":"/paper/1907.10937/citation-record.json","paper":"/paper/1907.10937"},"outbound":[],"paper":{"arxiv_id":"1907.10937","last_updated":"2020-05-10T18:24:18Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T16:02:29.337051Z","submitted_at":"2019-07-25T10:01:49Z","title":"Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization"},"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 4 inbound Pith citation observations for arXiv:1907.10937."}