{"as_of":"2026-08-16T17:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:024e30cfb9cd101af2d6dee895a345a763df3eebccf788ebadaa5a0e387b5ab2","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:33:33.295970Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"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.03500/citation-record","integrity":"/paper/1908.03500/integrity","json":"/paper/1908.03500/citation-record.json","paper":"/paper/1908.03500"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:33:34.785057Z","title":"Fast distributed network decompositions and covers","venue":null,"work_id":"a2d7b02b-e149-481b-a793-5fd3e487e837","year":1996},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:32.397346Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:a4d21b809ac47f4d9de8fc92e4b7c73fbea47c4fd11192d8a46768cd6dba92c9","observation_id":"0f7061fd-18b9-4daf-95ac-e3994bffa64b","resolution":{"observed_at":"2026-08-14T14:33:34.789911Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:33:34.752175Z","title":"A fast and simple randomized parallel algorithm for the maximal independent set problem","venue":null,"work_id":"707ebbd7-466e-479d-ae78-e5cefec514b2","year":1986},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:32.468921Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:dde5e25e73e68517d1d10ddd5ca705ada99a304c91f76c0358a81a293d4d3bd7","observation_id":"872c2c38-860f-4185-8772-90afaa8b7c02","resolution":{"observed_at":"2026-08-14T14:33:34.775481Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:33:34.575003Z","title":"Online load balancing in a distributed network","venue":null,"work_id":"b86d0494-5329-4bff-bed3-40e7dbaf1043","year":1992},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:32.472282Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:86f524e82ee54abd28fb84e07c7985cf5144b8bc488d8777c9e92a595e993a13","observation_id":"6654ad80-14d7-4f90-8fa6-76aeb7c1c124","resolution":{"observed_at":"2026-08-14T14:33:34.646862Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:33:34.564075Z","title":"Network decomposition and locality in distributed computation","venue":null,"work_id":"e3715a3e-3e51-4fb9-a560-5ab62644b561","year":1989},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:32.477526Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:337335c8c273e3b3557302531940faaee2e71b96345bc8923f318ef22f19ae24","observation_id":"41f0e64b-a81c-47cd-8006-1c4fabfaae9b","resolution":{"observed_at":"2026-08-14T14:33:34.568139Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:33:34.552291Z","title":"Sparse partitions","venue":null,"work_id":"d957310d-68e9-4225-a4bf-31af348d23cf","year":1990},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:32.482602Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:ae8a6c8ea7abb6cd6d19fd15416b8abce7c21cac8e4175bbb01f7c43a7fc4b49","observation_id":"6266c850-74e7-4029-b6d9-4cb3db287a5b","resolution":{"observed_at":"2026-08-14T14:33:34.556598Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:33:34.491189Z","title":"Routing with polynomial communication-space srade-ff","venue":null,"work_id":"9347902a-4216-4e80-bbeb-5182746a77ae","year":1992},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:32.486074Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:ec0530f56212fa347835d605d4408ad418af967c98cd32f3a2c35fcd1058260b","observation_id":"748d339e-fe9b-44fb-a54c-0e23bd3ab9c3","resolution":{"observed_at":"2026-08-14T14:33:34.544072Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:33:34.324974Z","title":"Sparser: A paradigm for running distributed algorithms","venue":null,"work_id":"80d46556-c3da-46b4-be49-296928c305a9","year":1993},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:32.489715Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:9bc69f09a3a50de00626a02ed0edbcba6637c82be32cc058e95f6250bdec567e","observation_id":"da5dd43e-06f5-4715-9815-6545c3ea7f07","resolution":{"observed_at":"2026-08-14T14:33:34.407227Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:33:34.312327Z","title":"Space-efficient local computation algorithms","venue":null,"work_id":"91931906-554c-404a-8439-619090a60af7","year":2012},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:32.493466Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:95c36c4cfa0a6c33031553f83f2902a1fc73ed2056ac6c1e356e55ed944336f1","observation_id":"5fe19550-6f73-4895-8424-b25d7e59bed0","resolution":{"observed_at":"2026-08-14T14:33:34.316916Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:33:34.299573Z","title":"Complexity of network synchronization","venue":null,"work_id":"67cad1a7-d0e4-47aa-8a26-b669b861eb53","year":1985},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:32.596898Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:38b444c0d9ff3a646da477fac7c9c49c635431800ebac7090b1a32f9ef4ac436","observation_id":"0a5c6d03-c4ad-4d26-98b0-a7e729abcf2a","resolution":{"observed_at":"2026-08-14T14:33:34.304482Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:33:34.264125Z","title":"Efficient broadcast and light-weighted spanners","venue":null,"work_id":"5c89e3b6-f2b4-4be2-9ebf-c2ad31dea891","year":1992},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:32.707914Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:69a324120addfb15f97964ece15a83f1f372f68edc07a5774d2b6234e69a8cc6","observation_id":"35531a2d-e4b6-4599-a723-98ef17c2c3db","resolution":{"observed_at":"2026-08-14T14:33:34.290659Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:33:34.206573Z","title":"On the locality of some np-complete problems","venue":null,"work_id":"293a12aa-0117-4009-b71d-650986bde725","year":2012},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:32.711225Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:2687c3d8e5d6581f69c5d033584bb519b8393c21a32d0401b8f51a728249db2b","observation_id":"e6c1ee3d-4b09-49b3-b3b2-22d76763d1ea","resolution":{"observed_at":"2026-08-14T14:33:34.211658Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:33:34.195144Z","title":"An algorithmic approach to the lov \\'a sz local lemma","venue":null,"work_id":"fbb626d5-5597-46ac-beb1-ed0dd727a8ae","year":1991},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:32.715624Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:9b35f6188b5dd4421e403fa6298f93c3911e070e9f29bea59ad430c9a567b8bb","observation_id":"913ab897-cb2b-4153-baf1-f2cafade6920","resolution":{"observed_at":"2026-08-14T14:33:34.198627Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:33:34.181334Z","title":"A fast network-decomposition algorithm and its applications to constant-time distributed computation","venue":null,"work_id":"01fed1db-b897-4efe-9367-c6432aaad0b2","year":2018},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:32.720978Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:625b31913eba6bf8fac4a568d265b8715150671d0acc50cd5eb87a26621db491","observation_id":"0210564a-caee-4bd1-aba0-218c1d24d4a3","resolution":{"observed_at":"2026-08-14T14:33:34.185672Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:33:34.087574Z","title":"The locality of distributed symmetry breaking","venue":null,"work_id":"796f87ce-2cb2-4d9c-bc28-dcc338429f7b","year":2016},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:32.724875Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:1ba0f8ea23f4790e2eb4de9552ba3bb7d21dc2d8df33267cb78605586ce0b4ec","observation_id":"05d57338-9391-41ab-99ed-dbceb32448e3","resolution":{"observed_at":"2026-08-14T14:33:34.143749Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:33:33.999971Z","title":"Nearly-linear work parallel sdd solvers, low-diameter decomposition, and low-stretch subgraphs","venue":null,"work_id":"cbd0422e-7f81-4e41-8ef5-09c2b3f81c6c","year":2014},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:32.728440Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:00a747bab5cafc165c06d5a46447012be2245d8c7b8c2041de81f34f54e60b22","observation_id":"ad91d8e5-3c3b-4c41-9ed0-27d2d909631a","resolution":{"observed_at":"2026-08-14T14:33:34.015895Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:33:32.732031Z","title":"A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:32.732031Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:6cc851503ae6fa01d836a2ee5c880ed16b6fbaabfd6a4698e9e628bf82ab61d6","observation_id":"61d6c2a3-d0a4-4444-a830-2b9b23eb4b34","resolution":{"observed_at":"2026-08-14T14:33:32.732031Z","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-14T14:33:33.979255Z","title":"Deterministic distributed dominating set approximation in the CONGEST model","venue":null,"work_id":"0af3b1b6-78a0-4d50-8e39-add92d198f5f","year":2019},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:32.777526Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:10660de1fe334c2ec35abf75c2a4955e287d45a018c0bccaf735db93df37b619","observation_id":"ccb3e7d8-0054-431e-8ab4-37c269fa6231","resolution":{"observed_at":"2026-08-14T14:33:33.984397Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:33:33.967959Z","title":"Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons","venue":null,"work_id":"1eb78d4d-7f1c-4e98-8de5-9b43613f42bd","year":2005},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:32.926867Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:faa5d748de37b5d1a97ee79771143e0b3f53cb6029773264286b762fb2192a54","observation_id":"0a7d031e-e3ba-4157-8a8a-b26c04e26079","resolution":{"observed_at":"2026-08-14T14:33:33.971503Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:33:33.929773Z","title":"A faster distributed protocol for constructing a minimum spanning tree","venue":null,"work_id":"cbb845ae-8650-43a6-9913-1c16a0d445ce","year":2004},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:33.015641Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:1db1fa92f9cca800735227a0692902914671841060eeb22c59e47516a83e539e","observation_id":"9eb6cc33-22f6-49de-a81c-d121e2f018ff","resolution":{"observed_at":"2026-08-14T14:33:33.960180Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:33:33.020294Z","title":"A faster distributed protocol for constructing a minimum spanning tree","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:33.020294Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:6f631a0a322c80b6afbd425c7517650cf32bfd7553466926b51fd2dde0f51097","observation_id":"358a648b-86a5-45c5-bcac-1d52bbbc6714","resolution":{"observed_at":"2026-08-14T14:33:33.020294Z","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-14T14:33:33.775871Z","title":"Distributed strong diameter network decomposition","venue":null,"work_id":"75bdac91-11ea-44c4-9e20-1a6292c117d1","year":2016},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:33.025011Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:c80f0ad50a0f689d3610c6ca71d2f7e0809f4248f5db91af47a6ec16814fc0c2","observation_id":"010ac970-44e7-46c2-89c1-c529a6da0fc7","resolution":{"observed_at":"2026-08-14T14:33:33.837232Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:33:33.763547Z","title":"An improved distributed algorithm for maximal independent set","venue":null,"work_id":"baacc69a-a20a-49c5-ba7a-906c22c56a18","year":2016},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:33.029325Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:7e6729b2731fa25ae08ccf0260ef135626c9182ef5319f8227fa8c0887512ebe","observation_id":"8c5e87b3-728e-4fd3-8d86-d1cf27982cff","resolution":{"observed_at":"2026-08-14T14:33:33.767468Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:33:33.751583Z","title":"Distributed maximal independent set using small messages","venue":null,"work_id":"9ac216fb-02ca-4dc1-a4d0-907cda3b8ea6","year":2019},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:33.036482Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:41c8374dcafa06196750e507092247305f480504864d1162cde1ff5f2535a2fb","observation_id":"c80f1e8f-f4d1-489a-a19a-7971cf83162c","resolution":{"observed_at":"2026-08-14T14:33:33.756063Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:33:33.739833Z","title":"Derandomizing distributed algorithms with small messages: Spanners and dominating set","venue":null,"work_id":"dc27b4be-934e-4c5c-aa9a-ee8d0bfa2d4a","year":2018},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:33.041025Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:ff18173de5499a1421b03f3690690236da848023c35cc86cbea790f23a127e28","observation_id":"b28ed6c7-6a14-4207-8b8c-f18638a0332f","resolution":{"observed_at":"2026-08-14T14:33:33.743893Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:33:33.623301Z","title":"Fast distributed construction of smallk-dominating sets and applications","venue":null,"work_id":"a5ecfceb-ed98-4412-a3a3-943b0281f800","year":1998},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:33.048012Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:0666c5f3c70a7b95860472ffef3578e5ae8f1f9f1285b8b8c68567c07352e7a3","observation_id":"a90184ca-aea6-4989-9e23-4bffef0964ea","resolution":{"observed_at":"2026-08-14T14:33:33.709479Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:33:33.541599Z","title":"Distributive graph algorithms global solutions from local data","venue":null,"work_id":"619a0b9e-0c17-4b99-80be-63ed0d1967c7","year":1987},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:33.144006Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:396c38d9852b53afb4758768b9c52c99bc9d3a47386cf0e8bc374a00d4941d7f","observation_id":"1763cdc5-a67a-48af-9006-f1a67b158add","resolution":{"observed_at":"2026-08-14T14:33:33.546260Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:33:33.527606Z","title":"Low diameter graph decompositions","venue":null,"work_id":"5cbb29a9-9ee3-4d1d-a51c-42d54a4822e4","year":1993},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:33.243796Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:c794f223b9f5a35f72cb699c4d3af4f1c885c123f2a3b061270bde05406b1147","observation_id":"c7d4980f-d121-4f21-93cb-6716506bae72","resolution":{"observed_at":"2026-08-14T14:33:33.532811Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:33:33.514965Z","title":"A simple parallel algorithm for the maximal independent set problem","venue":null,"work_id":"6c9fe3dd-9ec4-4ec9-9f90-697082c4b041","year":1986},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:33.282401Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:162ffec51f6c2c52a501f5f5bd2aaaf49a154a90fddbbaa0613de790300a3251","observation_id":"efa6d4a4-f648-4fe6-8dd5-9a04d3ca0a20","resolution":{"observed_at":"2026-08-14T14:33:33.518780Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:33:33.503000Z","title":"Parallel graph decompositions using random shifts","venue":null,"work_id":"1f724e04-37b4-4d48-9129-39118c2f83e5","year":2013},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:33.286749Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:90f237a7ffd2fea9594bd4ed03f9c19e871f20356e9403133e08cfe559e2afa9","observation_id":"9f7d1813-6532-4116-b89f-42605e4f0ff6","resolution":{"observed_at":"2026-08-14T14:33:33.507186Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:33:33.396864Z","title":"Distributed computing","venue":null,"work_id":"3fcef1fa-0b5f-4b31-acd1-e04deeb5c3ac","year":2000},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:33.292106Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:35dd58114fb94c56940d01756ce3766ff7fcbab3d4e881f32747ed7a83a54dfe","observation_id":"26d4eec7-b3f0-4d3f-85a2-0884c5b08852","resolution":{"observed_at":"2026-08-14T14:33:33.494870Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:33:33.324219Z","title":"Improved distributed algorithms for coloring and network decomposition problems","venue":null,"work_id":"1edd754b-1ecd-4fda-91d7-0e76141cb62b","year":1992},"citing_paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-14T14:33:33.295970Z"},"links":{"citing_paper":"/paper/1908.03500"},"observation_digest":"sha256:e8439f7787acfcc5ab86be11295c93872b8726395fe2c20103913d2452fec327","observation_id":"a87480f3-dbc6-412f-9d76-e0b26b9fb66f","resolution":{"observed_at":"2026-08-14T14:33:33.330911Z","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"}}],"paper":{"arxiv_id":"1908.03500","last_updated":"2019-08-09T15:42:16Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T03:37:50.188375Z","submitted_at":"2019-08-09T15:42:16Z","title":"Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":29},"total_outbound_references":31},"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 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:1908.03500."}