{"as_of":"2026-08-16T08:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8ed547f082e7bf8638e19d772842079b8b78f1d7654df7192390bc3429dd5824","coverage":[{"denominator":68,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":68,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T16:31:29.150588Z","state":"measured"},{"denominator":68,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":68,"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/2509.05870/citation-record","integrity":"/paper/2509.05870/integrity","json":"/paper/2509.05870/citation-record.json","paper":"/paper/2509.05870"},"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-15T16:31:29.792911Z","title":"Functional monitoring without monotonicity","venue":null,"work_id":"ed7d3899-c51d-488b-b2b9-f3beaecd3bb0","year":2009},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:28.942401Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:c0f1b6338c9cfa586402d7091daa31a2adcb5a459e3f35fadc7518ea9075a558","observation_id":"2c65e8a8-8655-4bfe-a4b7-0e9907f96029","resolution":{"observed_at":"2026-08-15T16:31:29.795934Z","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-15T16:31:29.783482Z","title":"Adversarial laws of large numbers and optimal regret in online classification","venue":null,"work_id":"be34f00f-507f-4741-a14e-dd4bcf51cbb0","year":2021},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:28.946081Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:cc1d685512dfe04d8a329673a4fb0bf398b283e4f87dda0fc88c4f0cbf808ff0","observation_id":"73492a8a-99be-4bc1-9e46-650646dc2939","resolution":{"observed_at":"2026-08-15T16:31:29.786667Z","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":"2107.14527","last_updated":"2022-09-26T12:08:43Z","snapshot_observed_at":"2026-08-13T18:37:08.793146Z","submitted_at":"2021-07-30T10:20:38Z","title":"A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.14527","snapshot_observed_at":"2026-08-15T16:31:28.949099Z","title":"A framework for adversarial streaming via differential privacy and difference estimators","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:28.949099Z"},"links":{"cited_paper":"/paper/2107.14527","citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:4d3b883a0fb61b670ceccba9628482054a3897ac54184d2f642dfa4abd3986ba","observation_id":"c411ac06-99a8-4099-89ea-2d6cea81e2d3","resolution":{"observed_at":"2026-08-15T16:31:28.949099Z","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-15T16:31:29.774632Z","title":"Rounds vs communication tradeoffs for maximal independent sets","venue":null,"work_id":"07358b2a-9859-4f92-bebd-f938ebe1499a","year":2022},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:28.953021Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:aebb7351ad253b41a12fa832fb1f96738edb5fc4311fda2d8f98f8dff2437a17","observation_id":"7269df88-5381-4df2-bc2a-f26a9ff2d7eb","resolution":{"observed_at":"2026-08-15T16:31:29.777799Z","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-15T16:31:29.765488Z","title":"Deterministic decremental single source shortest paths: beyond the O (mn) bound","venue":null,"work_id":"18cb7944-682a-4742-b6f3-4f9d23d499bd","year":2016},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:28.956235Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:fac304abbb4570f2e1a923eeb78ea977184c4b22e04fce86312570eef7da86c8","observation_id":"0d014075-4508-4152-ae2f-8bd18aa00ef3","resolution":{"observed_at":"2026-08-15T16:31:29.768913Z","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-15T16:31:29.756672Z","title":"Deterministic partially dynamic single source shortest paths for sparse graphs","venue":null,"work_id":"59e2fea7-6d5d-4f65-98d5-67fc87401343","year":2017},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:28.959454Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:5516c7bad18dae65eaa1763a9b686177f1e3d74197b0d2b643d8c0fed5d74574","observation_id":"a6c49e6f-c553-480f-9cac-6b8f18dc2f86","resolution":{"observed_at":"2026-08-15T16:31:29.759869Z","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-15T16:31:29.747621Z","title":"A framework for adversarially robust streaming algorithms","venue":null,"work_id":"d278126e-5c17-4018-b406-394929d91c81","year":2020},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:28.962881Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:fad9ce93c609772c93c262e63390efa36a452581b80395a20745b95507fcaf2b","observation_id":"37dc4c94-73cf-453c-8b32-f55e62f95efe","resolution":{"observed_at":"2026-08-15T16:31:29.750843Z","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-15T16:31:29.738094Z","title":"Adversarially robust streaming via dense-sparse trade-offs","venue":null,"work_id":"e01a67ed-9582-4ce0-b9f8-70e76a5fa0d9","year":2022},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:28.966683Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:d804d805afa987fc6c2cc948c7575e970496bfcfc8131b64328fcc802b65a9a9","observation_id":"78e7ec1e-b20a-4b34-8810-d32de2b6faa4","resolution":{"observed_at":"2026-08-15T16:31:29.741411Z","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-15T16:31:29.728654Z","title":"Deterministic partially dynamic single source shortest paths in weighted graphs","venue":null,"work_id":"8d4d3b16-66e9-4d7c-9730-33d66bb444ce","year":2017},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:28.969884Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:c668c2d8011872f2031e0ef9d4d78b1f8caacdfcbbd2c36a930b539e299153dc","observation_id":"d9da1829-c691-46c0-9082-06a50ed8842d","resolution":{"observed_at":"2026-08-15T16:31:29.731978Z","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-15T16:31:29.719461Z","title":"Italiano","venue":null,"work_id":"f7856189-aa4a-49ef-8441-0ca811e673a4","year":2015},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:28.973114Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:8355533940ff4ebad15e42ac150ff8d58c1bd021662c11319059c91d12a8dd14","observation_id":"ce8d0004-d43a-4ca7-aff0-4074caa2fdca","resolution":{"observed_at":"2026-08-15T16:31:29.722677Z","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-15T16:31:29.709404Z","title":"Adversarial robustness of streaming algorithms through importance sampling","venue":null,"work_id":"00db037c-1122-4aa8-a2ef-2aa227635f50","year":2021},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:28.976219Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:7a2c4cc8d6763ed6ba4c6ab497dff3c5c6e80c4bca8176d0fdee5c2fdd29286f","observation_id":"47d38ebc-2a7f-46b1-9a10-46027247eff1","resolution":{"observed_at":"2026-08-15T16:31:29.712901Z","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-15T16:31:29.699786Z","title":"New deterministic approximation algorithms for fully dynamic matching","venue":null,"work_id":"a0f29220-7fa8-44cd-9661-c7ea7bc3871e","year":2016},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:28.979386Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:7a329253cb10f7b05ffd42150bb6fd98969dfb2dca135ad9354a6896c3d01480","observation_id":"324e6417-fef1-4a81-9644-1a277591816a","resolution":{"observed_at":"2026-08-15T16:31:29.703074Z","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-15T16:31:29.690234Z","title":"Fully dynamic approximate maximum matching and minimum vertex cover in O(log\\( ^ 3 \\) n) worst case update time","venue":null,"work_id":"125abcb0-1922-42e6-8b93-0a8f5d4b0f47","year":2017},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:28.982444Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:ac5175d9aeedc441d517706a2119dbe5a8c01fab30a89d63d2acee398ae8e744","observation_id":"3f1b6d7a-c66d-48d8-a0fe-35d89100a8a1","resolution":{"observed_at":"2026-08-15T16:31:29.693742Z","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-15T16:31:29.680754Z","title":"Deterministically maintaining a (2+ ) -approximate minimum vertex cover in O (1/ ^2) amortized update time","venue":null,"work_id":"fa2eee15-ba9c-43d7-ae23-f9e33805de56","year":2019},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:28.985455Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:ab2359772b11e8277162c9b0405616f0f3beb7ec9b435faa887ee8fa1ed687c0","observation_id":"f9f527d7-6224-4b93-a177-4d16cb6d87fe","resolution":{"observed_at":"2026-08-15T16:31:29.684231Z","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-15T16:31:29.671609Z","title":"Deterministic rounding of dynamic fractional matchings","venue":null,"work_id":"ab2c3efb-b541-43f2-9c8c-f3b85cf2c121","year":2021},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:28.988382Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:480449be59ad88edf6b1ac41345cf3ca20c56f1efa75ce8f27af45632363566b","observation_id":"824f3c16-5113-4cc9-8a25-33321a55f608","resolution":{"observed_at":"2026-08-15T16:31:29.674682Z","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-15T16:31:29.662098Z","title":"Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds","venue":null,"work_id":"cf03723e-51cb-4132-be42-20d347ad5588","year":2022},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:28.991335Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:9e3540ac9b2b6cdacea6ce23e59a3fdeb286a21e8265798abc4dea85d00a3918","observation_id":"25d09ada-dde5-4223-a61e-5b07fbb7379e","resolution":{"observed_at":"2026-08-15T16:31:29.665433Z","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-15T16:31:28.994283Z","title":"Concentration Inequalities: A Nonasymptotic Theory of Independence","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:28.994283Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:e199d7e58b329087034c13ed670fa3880a7e3ec9979b86c576db8be981b0d8ab","observation_id":"417983e5-ac1f-433d-aa2a-a923f3ab751e","resolution":{"observed_at":"2026-08-15T16:31:28.994283Z","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-15T16:31:29.647049Z","title":"Smith, Thomas Steinke, Uri Stemmer, and Jonathan R","venue":null,"work_id":"26c75686-6a5f-4322-b710-ec3effaf469b","year":2016},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:28.997180Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:d261a6aac4b715ab82c6e8b9952da14f7f88965f4e6544e3d90a9bb5fad2fc39","observation_id":"7033e9a1-6ef5-4500-8e03-ca1a4269657b","resolution":{"observed_at":"2026-08-15T16:31:29.650538Z","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-15T16:31:29.638097Z","title":"A rounds vs","venue":null,"work_id":"22e3f753-de0f-4241-a127-71d3c86f272c","year":2017},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.000300Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:55e828e70d7a3ff0446ada1e72c62c0ce3bc26785abe73c4daed2bd1f8d449cf","observation_id":"9fe9d52c-fb2b-4fb0-be35-399fa31b6692","resolution":{"observed_at":"2026-08-15T16:31:29.641171Z","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-15T16:31:29.629001Z","title":"A deterministic algorithm for balanced cut with applications to dynamic connectivity, flows, and beyond","venue":null,"work_id":"8b9ae282-07e7-4361-9308-b95208eac661","year":2020},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.003399Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:a9172f6e8af232b4550b8895a903e05b8364dce513f5bf9094089f3eb699408d","observation_id":"4b8347be-abc9-46e1-8571-7b7fc64bc530","resolution":{"observed_at":"2026-08-15T16:31:29.632315Z","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-15T16:31:29.619676Z","title":"Holistic aggregates in a networked world: Distributed tracking of approximate quantiles","venue":null,"work_id":"2e907059-ec66-4314-89cf-301072bbb4d4","year":2005},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.006172Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:e3c225dd7383b6f2f7cdf354e43136cce8eabc373b99323213d824e1e71a4798","observation_id":"a3583bb2-af2d-4c9c-8273-f5fca0721b1a","resolution":{"observed_at":"2026-08-15T16:31:29.623219Z","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-15T16:31:29.610738Z","title":"Adversarially robust coloring for graph streams","venue":null,"work_id":"58788870-a328-4552-8302-6ff50266c391","year":2022},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.009157Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:5b0cd90bc9a9b17c57213bb799e5a8753e935699e155e0fff82af1ff9c758fef","observation_id":"57b0942f-f2f0-493a-99b4-3b29578e44cc","resolution":{"observed_at":"2026-08-15T16:31:29.613853Z","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-15T16:31:29.601659Z","title":"Decremental all-pairs shortest paths in deterministic near-linear time","venue":null,"work_id":"a9d547b7-4329-4619-9b64-d33b07cab0a8","year":2021},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.011987Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:a9d736c18f021a3cdbaf5c5390c3edd9617bdbf8ce9d578bca4a720af79e6352","observation_id":"30e913eb-24da-40d9-b686-14ec7422c5e9","resolution":{"observed_at":"2026-08-15T16:31:29.604909Z","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-15T16:31:29.592531Z","title":"A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems","venue":null,"work_id":"8f5a3278-b31c-4cc6-b447-80646998a924","year":2019},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.014918Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:03bea5440409bb8b269cbeabd55de6e1675813b08b415e74fa933b41b6ae1f56","observation_id":"67d77bd5-7d23-4fd2-98c3-fa0d8ba5ee1b","resolution":{"observed_at":"2026-08-15T16:31:29.595720Z","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-15T16:31:29.583752Z","title":"On the robustness of countsketch to adaptive inputs","venue":null,"work_id":"88bb961e-9e46-41a1-8bd5-c5592ecbd90f","year":2022},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.017893Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:4143df11fbe55e0f7fdc72717bcc6773ab3ae6e0c22df3025863b948044dcebd","observation_id":"2a3d2caf-d6df-422c-b24a-d771323db719","resolution":{"observed_at":"2026-08-15T16:31:29.586899Z","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-15T16:31:29.574770Z","title":"Muthukrishnan, and Ke Yi","venue":null,"work_id":"386150f2-7144-49a7-a84a-7a2ede185395","year":2008},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.020856Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:efddf4218508072b3967acbc3b9e345bd1ad31d7ac38a15bbb51eff3f98e5719","observation_id":"229a151c-ed01-4a62-9888-35e7160c4fe5","resolution":{"observed_at":"2026-08-15T16:31:29.577846Z","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-15T16:31:29.565728Z","title":"Continuous sampling from distributed streams","venue":null,"work_id":"3758cc7a-cea9-46c4-9b22-75da3d2a295c","year":2012},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.023905Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:1dc566a8ae949e286175d107402410f1a1e10875e4d2a5645f10723c05ba3796","observation_id":"80db82dd-9291-44b8-9b05-a055f860d657","resolution":{"observed_at":"2026-08-15T16:31:29.568917Z","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-15T16:31:29.557197Z","title":"The continuous distributed monitoring model","venue":null,"work_id":"ec1fb049-e81e-44fa-95c0-3dfee379a183","year":2013},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.026976Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:6ba46467dceccc177449424094108ceab5bbbf706a02ae824971c1cd9ab0d79d","observation_id":"b7cd6a0c-4b80-4cf5-aefe-e3d24dd8b760","resolution":{"observed_at":"2026-08-15T16:31:29.560067Z","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-15T16:31:29.548199Z","title":"Deterministic algorithms for decremental shortest paths via layered core decomposition","venue":null,"work_id":"e29acbed-3d98-4d41-875d-53866809a2bc","year":2021},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.030008Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:99f194f050f70baa3905c7a8dfd994b2f9bc12e4af61c5ef9ad023add6c90c54","observation_id":"e27cbdf7-917e-4e1e-9297-53783dc190e7","resolution":{"observed_at":"2026-08-15T16:31:29.551489Z","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-15T16:31:29.539448Z","title":"Woodruff, Fred Zhang, Qiuyi Zhang, and Samson Zhou","venue":null,"work_id":"be4f217d-75b2-435c-8a1a-63b87be29ea2","year":2023},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.033035Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:50658544969a59da13e99cac989ca6de7b315f35b75372bf8f68d5e7c62dbd47","observation_id":"fb3fe65d-423b-4ec5-a697-50183b2a8e9e","resolution":{"observed_at":"2026-08-15T16:31:29.542665Z","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-15T16:31:29.530429Z","title":"Improved algorithms for distributed entropy monitoring","venue":null,"work_id":"504f2abe-543d-471a-a7cd-f45c72666144","year":2017},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.036136Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:3e95c5977118c6fb3db2f7ea138c4c4b40370cb5994598bbb2a4d0db9a938e88","observation_id":"ff57b5d5-17d1-4c98-bcb6-3777f2b690b1","resolution":{"observed_at":"2026-08-15T16:31:29.533542Z","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-15T16:31:29.521621Z","title":"Multiparty communication complexity","venue":null,"work_id":"3a6c2ff5-1cb4-419a-b79c-442e7ef909da","year":1989},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.039092Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:aefa0fdfee174db9fab09ad878849ac4097d5f105fa3bd5b5e41c30cb0179afa","observation_id":"9b442d0e-8067-40d3-a8c1-9d318a6e9281","resolution":{"observed_at":"2026-08-15T16:31:29.524557Z","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-15T16:31:29.512947Z","title":"Preserving statistical validity in adaptive data analysis","venue":null,"work_id":"cbafe483-d73c-479a-8f41-f9943b812a97","year":2015},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.042115Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:3ffa7585156460f9ef649f305e7f20ca5858063cb0ce39f3bed0e9fb7000b77a","observation_id":"019b58e8-a6d3-4928-8286-90e308bf9b69","resolution":{"observed_at":"2026-08-15T16:31:29.516081Z","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-15T16:31:29.503638Z","title":"Rothblum","venue":null,"work_id":"74df75ef-3808-4096-83e1-43079b751187","year":2010},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.045277Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:42bfba145151b56a91f42d759a94357550869cb5fb2d6714d24b18806a155dcf","observation_id":"dc5d4e86-0951-48cc-8576-0d5ea3275c29","resolution":{"observed_at":"2026-08-15T16:31:29.507144Z","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-15T16:31:29.492867Z","title":"On the complexity of differentially private data release: efficient algorithms and hardness results","venue":null,"work_id":"43275959-f5c4-4b2f-adc8-2f1d0393a837","year":2009},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.048268Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:b7a9d85c919a4879a025980c976f79bf26e7dc2343bf43e03b041fa88ed4793d","observation_id":"90f24a19-117b-4f08-a7a4-61fccfb15091","resolution":{"observed_at":"2026-08-15T16:31:29.496381Z","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-15T16:31:29.483645Z","title":"Efficient reactive monitoring","venue":null,"work_id":"a3800784-107e-41f8-8e7c-1191a3d8e692","year":2002},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.051325Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:a6a76b840f22ab8d57e5ef4460c0192b2614c2212713fb4c9f22adde8c0e9269","observation_id":"95c7c874-f103-4bf2-9f66-ecb1195398c8","resolution":{"observed_at":"2026-08-15T16:31:29.486717Z","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-15T16:31:29.474305Z","title":"Optimal communication bounds for classic functions in the coordinator model and beyond","venue":null,"work_id":"3d80c083-af8a-45e9-950f-4bc48565e86c","year":1911},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.054332Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:ce27f1075e60468f398fe26a5a38b8c61810b03401dcf138962e26fd4a6459d3","observation_id":"91c5d6e8-8e20-4b55-86b0-7a8e21a6aead","resolution":{"observed_at":"2026-08-15T16:31:29.477851Z","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-15T16:31:29.465005Z","title":"Adaptive machine unlearning","venue":null,"work_id":"d504b7f0-cbd1-47cb-a1c7-9844b6e06bc8","year":2021},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.057234Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:7808a7a73c4276218fd97ebffe1b4ed20d5949f8eacf05881c82776bd74255f9","observation_id":"7bd21352-b148-4073-a718-642ef86f76b7","resolution":{"observed_at":"2026-08-15T16:31:29.468207Z","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-15T16:31:29.455906Z","title":"New algorithms and hardness for incremental single-source shortest paths in directed graphs","venue":null,"work_id":"26f85312-cf95-4f8b-9138-7ab9b385c3a8","year":2020},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.059936Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:a1b3f46d771bc09f47282fff97980319d66faf87af70848b0b19bfc14873c330","observation_id":"687067b4-9cff-49d6-811a-bc4cf35612e2","resolution":{"observed_at":"2026-08-15T16:31:29.459110Z","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-15T16:31:29.446318Z","title":"Decremental SSSP in weighted digraphs: Faster and against an adaptive adversary","venue":null,"work_id":"4468e367-831e-4adf-a1da-ebb4a7f136bf","year":2020},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.062898Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:24739c55ecd2e84cb9245ed636e4b514c29ed6b763a15c6fb3d717a5c85d3e5d","observation_id":"1b06bfd2-d704-4be8-9359-6b6c187e414d","resolution":{"observed_at":"2026-08-15T16:31:29.449957Z","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-15T16:31:29.436983Z","title":"Deterministic algorithms for decremental approximate shortest paths: Faster and simpler","venue":null,"work_id":"64d8d4da-b476-4d95-9665-e9fc092b3cce","year":2020},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.065879Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:07fb51487ecc497154c2c8b3103ff9db3c3dc2dc56355c01ac98a8c172ddeb2b","observation_id":"55823df3-63c3-4a4e-b12c-cf788046b917","resolution":{"observed_at":"2026-08-15T16:31:29.440353Z","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-15T16:31:29.427716Z","title":"Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity","venue":null,"work_id":"9553b36a-d796-46cd-9204-25ab36d44b10","year":2001},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.068810Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:4ffe20ca03690f606c89d841ea6e2f6d1a6ff2c9dcc24cb5addd4c1b64a92441","observation_id":"e74354e0-1535-4267-b5bf-144d17ed2530","resolution":{"observed_at":"2026-08-15T16:31:29.431127Z","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-15T16:31:29.418381Z","title":"Adversarially robust streaming algorithms via differential privacy","venue":null,"work_id":"9c36189d-d5ea-4690-b41a-a47834a5147f","year":2020},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.071895Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:a1803ac334c0e111739fd2dca2ea07b43532df9b91690217916894f05c07fbb1","observation_id":"5803d934-c233-4651-a6f1-d4f4918b0f73","resolution":{"observed_at":"2026-08-15T16:31:29.421577Z","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-15T16:31:29.408740Z","title":"Communication-efficient distributed covariance sketch, with application to distributed pca","venue":null,"work_id":"fc5c2f58-b147-4fb4-912c-b5ffcc9a917b","year":2021},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.075127Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:9db206ccc76c0227acb91bd86ecb266da4df93b5c5bbab9d824cc81c07518f0a","observation_id":"939af5f7-553b-46d4-a2a0-b76d052cf579","resolution":{"observed_at":"2026-08-15T16:31:29.412202Z","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-15T16:31:29.399030Z","title":null,"venue":null,"work_id":"9150bfff-bd47-4fd8-bca6-031dbe7de44a","year":2014},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.078162Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:a97eccd4fe1da5a639227a6ac8c4c5a4d020b845a336d903ea64ddf27c1fff07","observation_id":"9378c0a9-fa11-4d97-aebf-57b1b2dc9925","resolution":{"observed_at":"2026-08-15T16:31:29.402537Z","resolver_source":"raw_fallback","status":"unresolved"},"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-15T16:31:29.389055Z","title":"Simple and optimal algorithms for heavy hitters and frequency moments in distributed models","venue":null,"work_id":"66a37419-e40c-4f36-8c1e-39e00d41deef","year":2025},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.081107Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:3791c47153420c274eb4431a650f1c3be790403b29a56eb7b133748cf76fdc4d","observation_id":"f2152091-0620-4d1c-ae20-81617f12fdb2","resolution":{"observed_at":"2026-08-15T16:31:29.392490Z","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-15T16:31:29.379430Z","title":"The communication complexity of distributed epsilon-approximations","venue":null,"work_id":"d1a7ca89-c42e-4946-9e9e-262792ccff15","year":2017},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.084178Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:47a1dd4dad97a966c954446aa44e4e90e5d60e95c165d41edb95e0cccb3bd399","observation_id":"49201843-edb5-4425-b66e-bd07236a6288","resolution":{"observed_at":"2026-08-15T16:31:29.382805Z","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-15T16:31:29.370027Z","title":"Randomized algorithms for tracking distributed count, frequencies, and ranks","venue":null,"work_id":"7410d380-41ec-40f6-b063-6db87cd9e7bf","year":2012},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.087098Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:8367536ba5fb686fbaac0262af6ef263c2c9365dd2deba570d22a5490c6295ec","observation_id":"adfe9d78-1228-47d6-9a37-a7fc13487376","resolution":{"observed_at":"2026-08-15T16:31:29.373351Z","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-15T16:31:29.360526Z","title":"Communication-efficient distributed monitoring of thresholded counts","venue":null,"work_id":"2c0d5730-3ee5-46f0-99b3-4613988127bd","year":2006},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.090124Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:4d45932e0ebf01a1b6bc0f8e76005e2cd8a483505f7282805352dd9b0ae7a148","observation_id":"23185522-96c3-4115-bc42-7b366f7548af","resolution":{"observed_at":"2026-08-15T16:31:29.363901Z","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-15T16:31:29.351581Z","title":"Separating adaptive streaming from oblivious streaming using the bounded storage model","venue":null,"work_id":"964648cc-f3d8-4f6f-aca2-6df9f7315820","year":2021},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.093306Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:7562e460e9ff4329aff9c147f8db3b683181227a092d60bd411ca2c950d209f2","observation_id":"69a2bc8d-13be-4f95-b7d4-066612bb219a","resolution":{"observed_at":"2026-08-15T16:31:29.354663Z","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-15T16:31:29.096341Z","title":"Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.096341Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:b6866bda2029c54ff8fe774331c1ba73df0d2e3014071e6c71583b622bc1acd2","observation_id":"ed66fa91-b5d0-4c47-afb5-e557ed70e3f7","resolution":{"observed_at":"2026-08-15T16:31:29.096341Z","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-15T16:31:29.336862Z","title":"Dynamic spanning forest with worst-case update time: adaptive, L as vegas, and O (n^ 1/2- ) -time","venue":null,"work_id":"a4bc6afb-057b-4d32-914b-63cadbb56f6a","year":2017},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.099563Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:8ba4df7622890384ffd15ac75f012428858f308d5ec22787ba99f323e82e3fbb","observation_id":"2f576068-abb4-48ab-8f61-f4a053321873","resolution":{"observed_at":"2026-08-15T16:31:29.340041Z","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-15T16:31:29.328288Z","title":"Dynamic minimum spanning forest with subpolynomial worst-case update time","venue":null,"work_id":"a7b58d5e-d98f-4b0b-b7f1-8e59ddc0221a","year":2017},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.102699Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:f0d6c0305e2065575de1ac7c29bd7763015b865cf6e3b291c86ed9674694fe47","observation_id":"f62466c2-81a7-41a4-b645-6e5e6b1d72c2","resolution":{"observed_at":"2026-08-15T16:31:29.331437Z","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-15T16:31:29.319213Z","title":"Lower bounds for number-in-hand multiparty communication complexity, made easy","venue":null,"work_id":"3b10b157-04b8-40bb-96a6-9a4159c83b3e","year":2012},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.105861Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:af069677d557b06af6ab66fdeb45ab06bd2160977b00ae7b59515b7e6a69053e","observation_id":"14c15cd3-62c3-422e-9ba1-406e4ce0219c","resolution":{"observed_at":"2026-08-15T16:31:29.322643Z","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-15T16:31:29.310227Z","title":"Relaxed models for adversarial streaming: The bounded interruptions model and the advice model","venue":null,"work_id":"3b72aaad-6df3-45fc-87ec-db42f5749840","year":2023},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.109142Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:baa7428ea662cd55bf8494ca8996dd03583c9d61cc4ce49cbe68e465ec7d88c5","observation_id":"3b1adfb8-40d7-4340-a9e8-93dc16798684","resolution":{"observed_at":"2026-08-15T16:31:29.313502Z","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-15T16:31:29.300911Z","title":"Tight lower bounds for differentially private selection","venue":null,"work_id":"eb165952-26e5-4cb0-8764-d7437ce9533f","year":2017},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.112251Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:3bf98e96e3263ad0389b6e51d7bf7af386aff77ffd3f84237164a60a7c792342","observation_id":"6e62cea6-440d-4e8d-b030-250271972875","resolution":{"observed_at":"2026-08-15T16:31:29.304089Z","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-15T16:31:29.291481Z","title":"Optimal random sampling from distributed streams revisited","venue":null,"work_id":"7513cfb6-8860-4877-abfa-f1dde31bf971","year":2011},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.115614Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:18e89ca61f01e451d15cc4175395ba888b77e4e69e717e9812ee4fa69bac4574","observation_id":"76d9df72-d510-460e-b849-d3c55eb04eda","resolution":{"observed_at":"2026-08-15T16:31:29.294715Z","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-15T16:31:29.281727Z","title":"Liu, Richard Peng, and Aaron Sidford","venue":null,"work_id":"cb14dad5-9b64-4b54-bb90-9cb8cfbe574c","year":2022},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.119060Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:12eb90ce99deafd9d894463b9478ccb60224e042c0b07fc71b021aef7257597a","observation_id":"d23c6f17-a2b8-4a7c-b12b-da8ee7af322a","resolution":{"observed_at":"2026-08-15T16:31:29.284957Z","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-15T16:31:29.272356Z","title":"The communication complexity of addition","venue":null,"work_id":"2519f451-52e0-4a26-8fb0-2618adef8596","year":2015},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.122125Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:375640b9fdaa84f00c9074fdc894c33af03de1a5013d020b5c55ad6c9290bc56","observation_id":"115b9a38-d81e-432c-ad66-d9f04561bbbb","resolution":{"observed_at":"2026-08-15T16:31:29.275670Z","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-15T16:31:29.263510Z","title":"Rounding dynamic matchings against an adaptive adversary","venue":null,"work_id":"33ca9731-dbda-4be6-aeb7-5eeb600ee05d","year":2020},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.125854Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:8e4ed75e34c4fb71389985b7b3f4e9619cb69186cd4c99c6b10336df5c4ba32d","observation_id":"32a97be4-7100-4725-a2fb-88595c4b7045","resolution":{"observed_at":"2026-08-15T16:31:29.266634Z","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-15T16:31:29.254223Z","title":"Learning based distributed tracking","venue":null,"work_id":"07f0540a-ce4b-4016-a67d-6935bbfb968c","year":2020},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.129004Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:97f76711a02c469359c73e88fd8fad5492fcf757f29c8a738ff9a29e26b53d91","observation_id":"c30db3db-a73f-44a3-a351-a8da57874dbb","resolution":{"observed_at":"2026-08-15T16:31:29.257606Z","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-15T16:31:29.244383Z","title":"Fully-dynamic minimum spanning forest with improved worst-case update time","venue":null,"work_id":"94f07668-9422-418e-810f-ceeaadcbd7dc","year":2017},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.132409Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:ea6ff8c7e981fb454b9b398eedfefb41334955da2850ab863305dd98315ae056","observation_id":"34076e3a-98fb-4bfa-985b-55f2b378c824","resolution":{"observed_at":"2026-08-15T16:31:29.247882Z","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-15T16:31:29.234068Z","title":"Tight bounds for distributed functional monitoring","venue":null,"work_id":"8df1f466-c8d4-426c-8eca-510e6258487d","year":2012},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.135336Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:3046fccd105bfa6fa40e2488103e83b024e2022af288910d0177475dd5585403","observation_id":"92c4be79-29cc-4a73-a735-c9dc311187dd","resolution":{"observed_at":"2026-08-15T16:31:29.237315Z","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":"1304.4636","last_updated":"2013-07-26T17:13:46Z","snapshot_observed_at":"2026-08-15T00:21:13.421237Z","submitted_at":"2013-04-16T22:14:12Z","title":"When Distributed Computation is Communication Expensive","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1304.4636","snapshot_observed_at":"2026-08-15T16:31:29.138399Z","title":"When distributed computation does not help","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.138399Z"},"links":{"cited_paper":"/paper/1304.4636","citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:7a3502ef2b0cb235f74c20332a23c2f4e9ae9803ce8e0d3920eacad60233b63b","observation_id":"8d265da2-5f4f-483a-84ad-c11feb158077","resolution":{"observed_at":"2026-08-15T16:31:29.138399Z","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-15T16:31:29.224320Z","title":"An optimal lower bound for distinct elements in the message passing model","venue":null,"work_id":"65613531-c6a4-4bc2-99a9-415b2924de6b","year":2014},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.141735Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:097843d13e9cf9643c6cb67dc839ac3ac96f9810181f88b33524420be5548ec5","observation_id":"285054dd-b94c-48d6-8718-55f71e694c69","resolution":{"observed_at":"2026-08-15T16:31:29.227728Z","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-15T16:31:29.215055Z","title":"Woodruff and Samson Zhou","venue":null,"work_id":"a90eeb1d-8316-4ec5-a084-00a3945e9317","year":2021},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.144554Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:c8cb581102feeeb8604d95570e1f0a28d97d321836c8e4a1426c7e99a4428319","observation_id":"4ac90e97-bfb6-4fd9-9253-5b3f8a972fb6","resolution":{"observed_at":"2026-08-15T16:31:29.218292Z","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-15T16:31:29.205373Z","title":"Adversarially robust distributed count tracking via partial differential privacy","venue":null,"work_id":"d7e2b55e-d645-4137-aee1-217d898686f9","year":2023},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.147543Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:e4b7320ecc7fc045c158a0ca5330acd231139036e3d24ede3ed2b201d357138b","observation_id":"bc8cd868-9949-4ce6-9fa4-9c6b238f087b","resolution":{"observed_at":"2026-08-15T16:31:29.208712Z","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-15T16:31:29.193486Z","title":"Optimal tracking of distributed heavy hitters and quantiles","venue":null,"work_id":"83ee20ad-9dc6-4f7b-9268-d0485cc52992","year":2009},"citing_paper":{"arxiv_id":"2509.05870","last_updated":"2025-09-06T23:57:57Z","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-15T16:31:29.150588Z"},"links":{"citing_paper":"/paper/2509.05870"},"observation_digest":"sha256:7558910c1b50878738efa7d3471404b7b12fde9e168f0cc697681fa4d62eacf7","observation_id":"20d4b284-0758-49b2-8677-3d752c36b525","resolution":{"observed_at":"2026-08-15T16:31:29.198389Z","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":"2509.05870","last_updated":"2025-09-06T23:57:57Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-15T16:18:38.239594Z","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting"},"reference_resolution":{"displayed":68,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":63},"total_outbound_references":68},"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 68 of 68 outbound references and 0 inbound Pith citation observations for arXiv:2509.05870."}