Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-15T16:31:29.150588Z
Paper Citation Record · LEDGER
A Simple and Robust Protocol for Distributed Counting
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.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-16T06:30:59.297886+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
68 of 68 outbound references displayed
- verified exact0
- verified fuzzy63
- unresolved5
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 2c65e8a8-8655-4bfe-a4b7-0e9907f96029 · outbound
This paper cites Functional monitoring without monotonicity.
A Simple and Robust Protocol for Distributed Counting Functional monitoring without monotonicity
Reference 1
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.795934Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 73492a8a-99be-4bc1-9e46-650646dc2939 · outbound
This paper cites Adversarial laws of large numbers and optimal regret in online classification.
A Simple and Robust Protocol for Distributed Counting Adversarial laws of large numbers and optimal regret in online classification
Reference 2
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.786667Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation c411ac06-99a8-4099-89ea-2d6cea81e2d3 · outbound
This paper cites A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators.
A Simple and Robust Protocol for Distributed Counting A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators
Reference 3
- Resolution
- unresolved
- no resolver link, observed 2026-08-15T16:31:28.949099Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 7269df88-5381-4df2-bc2a-f26a9ff2d7eb · outbound
This paper cites Rounds vs communication tradeoffs for maximal independent sets.
A Simple and Robust Protocol for Distributed Counting Rounds vs communication tradeoffs for maximal independent sets
Reference 4
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.777799Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 0d014075-4508-4152-ae2f-8bd18aa00ef3 · outbound
This paper cites Deterministic decremental single source shortest paths: beyond the O (mn) bound.
A Simple and Robust Protocol for Distributed Counting Deterministic decremental single source shortest paths: beyond the O (mn) bound
Reference 5
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.768913Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation a6c49e6f-c553-480f-9cac-6b8f18dc2f86 · outbound
This paper cites Deterministic partially dynamic single source shortest paths for sparse graphs.
A Simple and Robust Protocol for Distributed Counting Deterministic partially dynamic single source shortest paths for sparse graphs
Reference 6
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.759869Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 37dc4c94-73cf-453c-8b32-f55e62f95efe · outbound
This paper cites A framework for adversarially robust streaming algorithms.
A Simple and Robust Protocol for Distributed Counting A framework for adversarially robust streaming algorithms
Reference 7
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.750843Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 78e7ec1e-b20a-4b34-8810-d32de2b6faa4 · outbound
This paper cites Adversarially robust streaming via dense-sparse trade-offs.
A Simple and Robust Protocol for Distributed Counting Adversarially robust streaming via dense-sparse trade-offs
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.741411Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation d9da1829-c691-46c0-9082-06a50ed8842d · outbound
This paper cites Deterministic partially dynamic single source shortest paths in weighted graphs.
A Simple and Robust Protocol for Distributed Counting Deterministic partially dynamic single source shortest paths in weighted graphs
Reference 9
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.731978Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation ce8d0004-d43a-4ca7-aff0-4074caa2fdca · outbound
This paper cites Italiano.
A Simple and Robust Protocol for Distributed Counting Italiano
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.722677Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 47d38ebc-2a7f-46b1-9a10-46027247eff1 · outbound
This paper cites Adversarial robustness of streaming algorithms through importance sampling.
A Simple and Robust Protocol for Distributed Counting Adversarial robustness of streaming algorithms through importance sampling
Reference 11
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.712901Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 324e6417-fef1-4a81-9644-1a277591816a · outbound
This paper cites New deterministic approximation algorithms for fully dynamic matching.
A Simple and Robust Protocol for Distributed Counting New deterministic approximation algorithms for fully dynamic matching
Reference 12
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.703074Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 3f1b6d7a-c66d-48d8-a0fe-35d89100a8a1 · outbound
This paper cites Fully dynamic approximate maximum matching and minimum vertex cover in O(log\( ^ 3 \) n) worst case update time.
A Simple and Robust Protocol for Distributed Counting Fully dynamic approximate maximum matching and minimum vertex cover in O(log\( ^ 3 \) n) worst case update time
Reference 13
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.693742Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation f9f527d7-6224-4b93-a177-4d16cb6d87fe · outbound
This paper cites Deterministically maintaining a (2+ ) -approximate minimum vertex cover in O (1/ ^2) amortized update time.
A Simple and Robust Protocol for Distributed Counting Deterministically maintaining a (2+ ) -approximate minimum vertex cover in O (1/ ^2) amortized update time
Reference 14
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.684231Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 824f3c16-5113-4cc9-8a25-33321a55f608 · outbound
This paper cites Deterministic rounding of dynamic fractional matchings.
A Simple and Robust Protocol for Distributed Counting Deterministic rounding of dynamic fractional matchings
Reference 15
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.674682Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 25d09ada-dde5-4223-a61e-5b07fbb7379e · outbound
This paper cites Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds.
A Simple and Robust Protocol for Distributed Counting Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds
Reference 16
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.665433Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 417983e5-ac1f-433d-aa2a-a923f3ab751e · outbound
This paper cites Concentration Inequalities: A Nonasymptotic Theory of Independence.
A Simple and Robust Protocol for Distributed Counting Concentration Inequalities: A Nonasymptotic Theory of Independence
Reference 17
- Resolution
- unresolved
- no resolver link, observed 2026-08-15T16:31:28.994283Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 7033e9a1-6ef5-4500-8e03-ca1a4269657b · outbound
This paper cites Smith, Thomas Steinke, Uri Stemmer, and Jonathan R.
A Simple and Robust Protocol for Distributed Counting Smith, Thomas Steinke, Uri Stemmer, and Jonathan R
Reference 18
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.650538Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 9fe9d52c-fb2b-4fb0-be35-399fa31b6692 · outbound
This paper cites A rounds vs.
A Simple and Robust Protocol for Distributed Counting A rounds vs
Reference 19
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.641171Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 4b8347be-abc9-46e1-8571-7b7fc64bc530 · outbound
This paper cites A deterministic algorithm for balanced cut with applications to dynamic connectivity, flows, and beyond.
A Simple and Robust Protocol for Distributed Counting A deterministic algorithm for balanced cut with applications to dynamic connectivity, flows, and beyond
Reference 20
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.632315Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation a3583bb2-af2d-4c9c-8273-f5fca0721b1a · outbound
This paper cites Holistic aggregates in a networked world: Distributed tracking of approximate quantiles.
A Simple and Robust Protocol for Distributed Counting Holistic aggregates in a networked world: Distributed tracking of approximate quantiles
Reference 21
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.623219Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 57b0942f-f2f0-493a-99b4-3b29578e44cc · outbound
This paper cites Adversarially robust coloring for graph streams.
A Simple and Robust Protocol for Distributed Counting Adversarially robust coloring for graph streams
Reference 22
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.613853Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 30e913eb-24da-40d9-b686-14ec7422c5e9 · outbound
This paper cites Decremental all-pairs shortest paths in deterministic near-linear time.
A Simple and Robust Protocol for Distributed Counting Decremental all-pairs shortest paths in deterministic near-linear time
Reference 23
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.604909Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 67d77bd5-7d23-4fd2-98c3-fa0d8ba5ee1b · outbound
This paper cites A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems.
A Simple and Robust Protocol for Distributed Counting A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems
Reference 24
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.595720Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 2a3d2caf-d6df-422c-b24a-d771323db719 · outbound
This paper cites On the robustness of countsketch to adaptive inputs.
A Simple and Robust Protocol for Distributed Counting On the robustness of countsketch to adaptive inputs
Reference 25
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.586899Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 229a151c-ed01-4a62-9888-35e7160c4fe5 · outbound
This paper cites Muthukrishnan, and Ke Yi.
A Simple and Robust Protocol for Distributed Counting Muthukrishnan, and Ke Yi
Reference 26
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.577846Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 80db82dd-9291-44b8-9b05-a055f860d657 · outbound
This paper cites Continuous sampling from distributed streams.
A Simple and Robust Protocol for Distributed Counting Continuous sampling from distributed streams
Reference 27
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.568917Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation b7cd6a0c-4b80-4cf5-aefe-e3d24dd8b760 · outbound
This paper cites The continuous distributed monitoring model.
A Simple and Robust Protocol for Distributed Counting The continuous distributed monitoring model
Reference 28
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.560067Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation e27cbdf7-917e-4e1e-9297-53783dc190e7 · outbound
This paper cites Deterministic algorithms for decremental shortest paths via layered core decomposition.
A Simple and Robust Protocol for Distributed Counting Deterministic algorithms for decremental shortest paths via layered core decomposition
Reference 29
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.551489Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation fb3fe65d-423b-4ec5-a697-50183b2a8e9e · outbound
This paper cites Woodruff, Fred Zhang, Qiuyi Zhang, and Samson Zhou.
A Simple and Robust Protocol for Distributed Counting Woodruff, Fred Zhang, Qiuyi Zhang, and Samson Zhou
Reference 30
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.542665Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation ff57b5d5-17d1-4c98-bcb6-3777f2b690b1 · outbound
This paper cites Improved algorithms for distributed entropy monitoring.
A Simple and Robust Protocol for Distributed Counting Improved algorithms for distributed entropy monitoring
Reference 31
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.533542Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 9b442d0e-8067-40d3-a8c1-9d318a6e9281 · outbound
This paper cites Multiparty communication complexity.
A Simple and Robust Protocol for Distributed Counting Multiparty communication complexity
Reference 32
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.524557Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 019b58e8-a6d3-4928-8286-90e308bf9b69 · outbound
This paper cites Preserving statistical validity in adaptive data analysis.
A Simple and Robust Protocol for Distributed Counting Preserving statistical validity in adaptive data analysis
Reference 33
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.516081Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation dc5d4e86-0951-48cc-8576-0d5ea3275c29 · outbound
This paper cites Rothblum.
A Simple and Robust Protocol for Distributed Counting Rothblum
Reference 34
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.507144Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 90f24a19-117b-4f08-a7a4-61fccfb15091 · outbound
This paper cites On the complexity of differentially private data release: efficient algorithms and hardness results.
A Simple and Robust Protocol for Distributed Counting On the complexity of differentially private data release: efficient algorithms and hardness results
Reference 35
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.496381Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 95c7c874-f103-4bf2-9f66-ecb1195398c8 · outbound
This paper cites Efficient reactive monitoring.
A Simple and Robust Protocol for Distributed Counting Efficient reactive monitoring
Reference 36
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.486717Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 91c5d6e8-8e20-4b55-86b0-7a8e21a6aead · outbound
This paper cites Optimal communication bounds for classic functions in the coordinator model and beyond.
A Simple and Robust Protocol for Distributed Counting Optimal communication bounds for classic functions in the coordinator model and beyond
Reference 37
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.477851Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 7bd21352-b148-4073-a718-642ef86f76b7 · outbound
This paper cites Adaptive machine unlearning.
A Simple and Robust Protocol for Distributed Counting Adaptive machine unlearning
Reference 38
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.468207Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 687067b4-9cff-49d6-811a-bc4cf35612e2 · outbound
This paper cites New algorithms and hardness for incremental single-source shortest paths in directed graphs.
A Simple and Robust Protocol for Distributed Counting New algorithms and hardness for incremental single-source shortest paths in directed graphs
Reference 39
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.459110Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 1b06bfd2-d704-4be8-9359-6b6c187e414d · outbound
This paper cites Decremental SSSP in weighted digraphs: Faster and against an adaptive adversary.
A Simple and Robust Protocol for Distributed Counting Decremental SSSP in weighted digraphs: Faster and against an adaptive adversary
Reference 40
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.449957Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 55823df3-63c3-4a4e-b12c-cf788046b917 · outbound
This paper cites Deterministic algorithms for decremental approximate shortest paths: Faster and simpler.
A Simple and Robust Protocol for Distributed Counting Deterministic algorithms for decremental approximate shortest paths: Faster and simpler
Reference 41
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.440353Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation e74354e0-1535-4267-b5bf-144d17ed2530 · outbound
This paper cites Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity.
A Simple and Robust Protocol for Distributed Counting Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
Reference 42
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.431127Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 5803d934-c233-4651-a6f1-d4f4918b0f73 · outbound
This paper cites Adversarially robust streaming algorithms via differential privacy.
A Simple and Robust Protocol for Distributed Counting Adversarially robust streaming algorithms via differential privacy
Reference 43
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.421577Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 939af5f7-553b-46d4-a2a0-b76d052cf579 · outbound
This paper cites Communication-efficient distributed covariance sketch, with application to distributed pca.
A Simple and Robust Protocol for Distributed Counting Communication-efficient distributed covariance sketch, with application to distributed pca
Reference 44
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.412202Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 9378c0a9-fa11-4d97-aebf-57b1b2dc9925 · outbound
This paper cites an unresolved cited work.
A Simple and Robust Protocol for Distributed Counting Unresolved cited work
Reference 45
- Resolution
- unresolved
- raw_fallback, observed 2026-08-15T16:31:29.402537Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation f2152091-0620-4d1c-ae20-81617f12fdb2 · outbound
This paper cites Simple and optimal algorithms for heavy hitters and frequency moments in distributed models.
A Simple and Robust Protocol for Distributed Counting Simple and optimal algorithms for heavy hitters and frequency moments in distributed models
Reference 46
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.392490Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 49201843-edb5-4425-b66e-bd07236a6288 · outbound
This paper cites The communication complexity of distributed epsilon-approximations.
A Simple and Robust Protocol for Distributed Counting The communication complexity of distributed epsilon-approximations
Reference 47
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.382805Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation adfe9d78-1228-47d6-9a37-a7fc13487376 · outbound
This paper cites Randomized algorithms for tracking distributed count, frequencies, and ranks.
A Simple and Robust Protocol for Distributed Counting Randomized algorithms for tracking distributed count, frequencies, and ranks
Reference 48
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.373351Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 23185522-96c3-4115-bc42-7b366f7548af · outbound
This paper cites Communication-efficient distributed monitoring of thresholded counts.
A Simple and Robust Protocol for Distributed Counting Communication-efficient distributed monitoring of thresholded counts
Reference 49
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.363901Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 69a2bc8d-13be-4f95-b7d4-066612bb219a · outbound
This paper cites Separating adaptive streaming from oblivious streaming using the bounded storage model.
A Simple and Robust Protocol for Distributed Counting Separating adaptive streaming from oblivious streaming using the bounded storage model
Reference 50
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.354663Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation ed66fa91-b5d0-4c47-afb5-e557ed70e3f7 · outbound
This paper cites Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis.
A Simple and Robust Protocol for Distributed Counting Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis
Reference 51
- Resolution
- unresolved
- no resolver link, observed 2026-08-15T16:31:29.096341Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 2f576068-abb4-48ab-8f61-f4a053321873 · outbound
This paper cites Dynamic spanning forest with worst-case update time: adaptive, L as vegas, and O (n^ 1/2- ) -time.
A Simple and Robust Protocol for Distributed Counting Dynamic spanning forest with worst-case update time: adaptive, L as vegas, and O (n^ 1/2- ) -time
Reference 52
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.340041Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation f62466c2-81a7-41a4-b645-6e5e6b1d72c2 · outbound
This paper cites Dynamic minimum spanning forest with subpolynomial worst-case update time.
A Simple and Robust Protocol for Distributed Counting Dynamic minimum spanning forest with subpolynomial worst-case update time
Reference 53
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.331437Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 14c15cd3-62c3-422e-9ba1-406e4ce0219c · outbound
This paper cites Lower bounds for number-in-hand multiparty communication complexity, made easy.
A Simple and Robust Protocol for Distributed Counting Lower bounds for number-in-hand multiparty communication complexity, made easy
Reference 54
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.322643Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 3b1adfb8-40d7-4340-a9e8-93dc16798684 · outbound
This paper cites Relaxed models for adversarial streaming: The bounded interruptions model and the advice model.
A Simple and Robust Protocol for Distributed Counting Relaxed models for adversarial streaming: The bounded interruptions model and the advice model
Reference 55
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.313502Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 6e62cea6-440d-4e8d-b030-250271972875 · outbound
This paper cites Tight lower bounds for differentially private selection.
A Simple and Robust Protocol for Distributed Counting Tight lower bounds for differentially private selection
Reference 56
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.304089Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 76d9df72-d510-460e-b849-d3c55eb04eda · outbound
This paper cites Optimal random sampling from distributed streams revisited.
A Simple and Robust Protocol for Distributed Counting Optimal random sampling from distributed streams revisited
Reference 57
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.294715Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation d23c6f17-a2b8-4a7c-b12b-da8ee7af322a · outbound
This paper cites Liu, Richard Peng, and Aaron Sidford.
A Simple and Robust Protocol for Distributed Counting Liu, Richard Peng, and Aaron Sidford
Reference 58
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.284957Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 115b9a38-d81e-432c-ad66-d9f04561bbbb · outbound
This paper cites The communication complexity of addition.
A Simple and Robust Protocol for Distributed Counting The communication complexity of addition
Reference 59
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.275670Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 32a97be4-7100-4725-a2fb-88595c4b7045 · outbound
This paper cites Rounding dynamic matchings against an adaptive adversary.
A Simple and Robust Protocol for Distributed Counting Rounding dynamic matchings against an adaptive adversary
Reference 60
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.266634Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation c30db3db-a73f-44a3-a351-a8da57874dbb · outbound
This paper cites Learning based distributed tracking.
A Simple and Robust Protocol for Distributed Counting Learning based distributed tracking
Reference 61
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.257606Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 34076e3a-98fb-4bfa-985b-55f2b378c824 · outbound
This paper cites Fully-dynamic minimum spanning forest with improved worst-case update time.
A Simple and Robust Protocol for Distributed Counting Fully-dynamic minimum spanning forest with improved worst-case update time
Reference 62
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.247882Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 92c4be79-29cc-4a73-a735-c9dc311187dd · outbound
This paper cites Tight bounds for distributed functional monitoring.
A Simple and Robust Protocol for Distributed Counting Tight bounds for distributed functional monitoring
Reference 63
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.237315Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 8d265da2-5f4f-483a-84ad-c11feb158077 · outbound
This paper cites When Distributed Computation is Communication Expensive.
A Simple and Robust Protocol for Distributed Counting When Distributed Computation is Communication Expensive
Reference 64
- Resolution
- unresolved
- no resolver link, observed 2026-08-15T16:31:29.138399Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 285054dd-b94c-48d6-8718-55f71e694c69 · outbound
This paper cites An optimal lower bound for distinct elements in the message passing model.
A Simple and Robust Protocol for Distributed Counting An optimal lower bound for distinct elements in the message passing model
Reference 65
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.227728Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 4ac90e97-bfb6-4fd9-9253-5b3f8a972fb6 · outbound
This paper cites Woodruff and Samson Zhou.
A Simple and Robust Protocol for Distributed Counting Woodruff and Samson Zhou
Reference 66
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.218292Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation bc8cd868-9949-4ce6-9fa4-9c6b238f087b · outbound
This paper cites Adversarially robust distributed count tracking via partial differential privacy.
A Simple and Robust Protocol for Distributed Counting Adversarially robust distributed count tracking via partial differential privacy
Reference 67
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.208712Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 20d4b284-0758-49b2-8677-3d752c36b525 · outbound
This paper cites Optimal tracking of distributed heavy hitters and quantiles.
A Simple and Robust Protocol for Distributed Counting Optimal tracking of distributed heavy hitters and quantiles
Reference 68
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T16:31:29.198389Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Pith citing papers
No inbound Pith citation observations are available.