Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-07-03T18:04:17.669900Z
Paper Citation Record · LEDGER
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting
As of 12 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 2 inbound Pith citation observations for arXiv:2607.00876.
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-12T06:34:41.77262+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-03T00:50:58.995162Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-03T06:16:11.147974Z
Reference resolution
25 of 25 outbound references displayed
- verified exact1
- verified fuzzy20
- unresolved4
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation ccb0b4aa-419d-4f40-8f12-fc52172e7bda · outbound
This paper cites Private stochastic convex optimiza- tion: Optimal rates in L1 geometry.
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting Private stochastic convex optimiza- tion: Optimal rates in L1 geometry
Reference 1
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-07-05T04:10:40.188336Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation b80004ad-ff74-4463-89dc-7bbcd5246312 · outbound
This paper cites Continual counting with gradual privacy expiration.
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting Continual counting with gradual privacy expiration
Reference 2
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-07-05T04:10:40.218276Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 1802989b-393d-4340-b4b4-c3badebfbe8a · outbound
This paper cites Count on Your Elders: Laplace vs Gaussian Noise.
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting Count on Your Elders: Laplace vs Gaussian Noise
Reference 3
- Resolution
- verified exact
- arxiv_id, observed 2026-07-03T18:08:45.585947Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation ac9609b3-1ce2-4ea6-8272-3c3c03ed5728 · outbound
This paper cites The price of differential privacy for online learning.
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting The price of differential privacy for online learning
Reference 4
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-07-05T04:10:40.194118Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 423b01ad-3d96-4bc1-b5bd-0491cac50c3a · outbound
This paper cites [CDP+24] Christopher A.
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting [CDP+24] Christopher A
Reference 5
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-07-05T04:10:40.233766Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation b9fd176e-34a7-4cc9-9362-189017fa1aaf · outbound
This paper cites Differentially private space-efficient algorithms for counting distinct elements in the turnstile model.
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting Differentially private space-efficient algorithms for counting distinct elements in the turnstile model
Reference 6
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-07-05T04:10:40.211089Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 80edcd60-94a4-42a1-8133-076434e8fbc5 · outbound
This paper cites Lower bounds for dif- ferential privacy under continual observation and online threshold queries.
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting Lower bounds for dif- ferential privacy under continual observation and online threshold queries
Reference 7
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-07-05T04:10:40.212144Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 5fcdf2e7-b31e-4337-b443-20ce38474f70 · outbound
This paper cites Hubert Chan, Elaine Shi, and Dawn Song.
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting Hubert Chan, Elaine Shi, and Dawn Song
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-07-05T04:10:40.235556Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 024e616f-6fc8-4628-b23a-241b1729ced1 · outbound
This paper cites an unresolved cited work.
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting Unresolved cited work
Reference 9
- Resolution
- unresolved
- raw_fallback, observed 2026-07-05T04:10:40.193333Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 36bea28b-4289-48be-9e62-23452a66b59f · outbound
This paper cites Rothblum.
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting Rothblum
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-07-05T04:10:40.222351Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 2fd6ec87-80f5-4d87-97a3-e5f5870236f5 · outbound
This paper cites Rothblum.
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting Rothblum
Reference 11
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-07-05T04:10:40.241735Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation df76d1c6-f8f3-45bf-af08-c3e7071f84cf · outbound
This paper cites Differentially private algorithms for graphs under continual observation.
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting Differentially private algorithms for graphs under continual observation
Reference 12
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-07-05T04:10:40.244338Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation ede8e598-4915-4708-bf6e-68f1e28e8f84 · outbound
This paper cites Constant matters: Fine-grained error bound on differentially private continual observation.
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting Constant matters: Fine-grained error bound on differentially private continual observation
Reference 13
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-07-05T04:10:40.239772Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation e818d776-b8eb-464a-8ecc-c0c3c84d6f53 · outbound
This paper cites Private streaming SCO inℓ p geometry with applications in high dimensional online decision making.
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting Private streaming SCO inℓ p geometry with applications in high dimensional online decision making
Reference 14
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-07-05T04:10:40.224725Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation ce751983-bd81-478b-9aaa-f2c7ca527c38 · outbound
This paper cites Efficient use of differentially private binary trees.Theory and Practice of Differential Privacy (TPDP 2015), London, UK, 2:26–27,.
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting Efficient use of differentially private binary trees.Theory and Practice of Differential Privacy (TPDP 2015), London, UK, 2:26–27,
Reference 15
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-07-05T04:10:40.226941Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 0d26c533-5237-49b3-9fc9-fd3d02de56d9 · outbound
This paper cites an unresolved cited work.
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting Unresolved cited work
Reference 16
- Resolution
- unresolved
- raw_fallback, observed 2026-07-05T04:10:40.247018Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 7dc640dc-ae4b-4d81-b342-680da671ecde · outbound
This paper cites Almost tight error bounds on differentially private continual counting.
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting Almost tight error bounds on differentially private continual counting
Reference 17
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-07-05T04:10:40.205849Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 99a72132-12dd-4794-8e9f-bd5bc2405e72 · outbound
This paper cites A unifying framework for differ- entially private sums under continual observation.
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting A unifying framework for differ- entially private sums under continual observation
Reference 18
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-07-05T04:10:40.237055Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 35dcfca8-57d3-4744-8d36-90865b602aab · outbound
This paper cites Counting distinct elements in the turnstile model with differential privacy under continual observation.
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting Counting distinct elements in the turnstile model with differential privacy under continual observation
Reference 19
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-07-05T04:10:40.232326Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 169e0e41-171a-40a3-88b8-19db6bf1bb8c · outbound
This paper cites Differentially private online learning.
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting Differentially private online learning
Reference 20
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-07-05T04:10:40.220170Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation a89a48bc-27eb-48de-bf89-98e6b118b2c1 · outbound
This paper cites an unresolved cited work.
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting Unresolved cited work
Reference 21
- Resolution
- unresolved
- raw_fallback, observed 2026-07-05T04:10:40.230030Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 6ebefa20-07b6-45ed-a6f4-70ce49da590a · outbound
This paper cites Practical and private (deep) learning without sampling or shuffling.
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting Practical and private (deep) learning without sampling or shuffling
Reference 22
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-07-05T04:10:40.234739Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 2c7c18cc-a59d-4e71-b99f-95c554a42661 · outbound
This paper cites Factorization norms and hereditary discrepancy.International Mathematics Research Notices, 2020(3):751–780, 02.
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting Factorization norms and hereditary discrepancy.International Mathematics Research Notices, 2020(3):751–780, 02
Reference 23
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-07-05T04:10:40.229247Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 090ccbdb-5b55-48a4-9302-13df4b304796 · outbound
This paper cites The geometry of differential privacy: the sparse and approximate cases.
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting The geometry of differential privacy: the sparse and approximate cases
Reference 24
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-07-05T04:10:40.227425Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation f7f55d84-e714-483d-af11-97134d6af3a5 · outbound
This paper cites an unresolved cited work.
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting Unresolved cited work
Reference 25
- Resolution
- unresolved
- raw_fallback, observed 2026-07-05T04:10:40.222501Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Pith citing papers
Observation 626c4643-0809-414f-b9c6-277b9d2fd960 · inbound
Improved Error Bounds for Pure Differentially Private Continual Counting via Matrix Factorization cites this paper.
Improved Error Bounds for Pure Differentially Private Continual Counting via Matrix Factorization The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting
Reference 4
- Resolution
- unresolved
- no resolver link, observed 2026-07-13T05:28:27.662569Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 942b941c-3631-4e56-b652-2fcfdf147f6c · inbound
Costs of Arbitrary Real Matrix Factorizations for Pure-DP Continual Counting cites this paper.
Costs of Arbitrary Real Matrix Factorizations for Pure-DP Continual Counting The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting
Reference 3
- Resolution
- verified exact
- local_arxiv, observed 2026-08-03T00:54:13.885806Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.