{"as_of":"2026-08-10T23:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0acae677b153771519912d6a480c8cf4f75882ad87fb8de58e1f1cb23ca49eb1","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-03T18:04:17.669900Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T00:50:58.995162Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-03T06:16:11.147974Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2607.00876","last_updated":"2026-07-02T11:12:33Z","snapshot_observed_at":"2026-08-10T09:32:37.702544Z","submitted_at":"2026-07-01T12:38:33Z","title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.00876","snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"The binary tree mechanism is optimal for approximate differentially private continual counting, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.08963","last_updated":"2026-07-09T21:54:56Z","snapshot_observed_at":"2026-08-08T08:51:05.231818Z","submitted_at":"2026-07-09T21:54:56Z","title":"Improved Error Bounds for Pure Differentially Private Continual Counting via Matrix Factorization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"cited_paper":"/paper/2607.00876","citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:1af32ab52ba5b5bfc935f89706e1fe96fb6d9b86a818cfcc006d3074cea56b25","observation_id":"626c4643-0809-414f-b9c6-277b9d2fd960","resolution":{"observed_at":"2026-07-13T05:28:27.662569Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2607.00876","last_updated":"2026-07-02T11:12:33Z","snapshot_observed_at":"2026-08-10T09:32:37.702544Z","submitted_at":"2026-07-01T12:38:33Z","title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting","version":2},"cited_work":{"arxiv_id":"2607.00876","doi":"10.48550/arxiv.2607.00876","metadata_source":"pith","pith_arxiv_id":"2607.00876","snapshot_observed_at":"2026-08-03T06:16:11.147974Z","title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting","venue":"cs.DS","work_id":"2b2084eb-3594-4c86-8892-9dfb9419057e","year":2026},"citing_paper":{"arxiv_id":"2607.28703","last_updated":"2026-08-06T12:24:59Z","snapshot_observed_at":"2026-08-09T23:12:24.025465Z","submitted_at":"2026-07-30T14:41:34Z","title":"Costs of Arbitrary Real Matrix Factorizations for Pure-DP Continual Counting","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T00:50:58.995162Z"},"links":{"cited_paper":"/paper/2607.00876","citing_paper":"/paper/2607.28703"},"observation_digest":"sha256:3dff40efd2d8fb9ab44ab885d1e60aaaaebe11c0bfc8ad47da91740298fd9e50","observation_id":"942b941c-3631-4e56-b652-2fcfdf147f6c","resolution":{"observed_at":"2026-08-03T00:54:13.885806Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-03T16:39:01.11289+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T16:39:01.11289+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2607.00876/citation-record","integrity":"/paper/2607.00876/integrity","json":"/paper/2607.00876/citation-record.json","paper":"/paper/2607.00876"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T08:12:07.237568Z","title":"Private stochastic convex optimiza- tion: Optimal rates in L1 geometry","venue":null,"work_id":"36a95895-74e4-4f17-a6e2-2855429232ac","year":2021},"citing_paper":{"arxiv_id":"2607.00876","last_updated":"2026-07-02T11:12:33Z","snapshot_observed_at":"2026-08-10T09:32:37.702544Z","submitted_at":"2026-07-01T12:38:33Z","title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-03T18:04:17.669900Z"},"links":{"citing_paper":"/paper/2607.00876"},"observation_digest":"sha256:c6b27dd2bc32826bcf8b10fb7f5fc367f345150abc6ff4167ecf1b0b10211017","observation_id":"ccb0b4aa-419d-4f40-8f12-fc52172e7bda","resolution":{"observed_at":"2026-07-05T04:10:40.188336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-06T08:12:07.239413Z","title":"Continual counting with gradual privacy expiration","venue":null,"work_id":"7ebd8716-2aaf-4446-8dff-b67962921cf6","year":2024},"citing_paper":{"arxiv_id":"2607.00876","last_updated":"2026-07-02T11:12:33Z","snapshot_observed_at":"2026-08-10T09:32:37.702544Z","submitted_at":"2026-07-01T12:38:33Z","title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-03T18:04:17.669900Z"},"links":{"citing_paper":"/paper/2607.00876"},"observation_digest":"sha256:ce6b35b0c332fb0872e8eaca31deb393f6d0a3334dfe292a7d91706b9a22e174","observation_id":"b80004ad-ff74-4463-89dc-7bbcd5246312","resolution":{"observed_at":"2026-07-05T04:10:40.218276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.07021","last_updated":"2024-11-18T15:40:25Z","snapshot_observed_at":"2026-07-06T19:00:17.992934Z","submitted_at":"2024-08-13T16:36:33Z","title":"Count on Your Elders: Laplace vs Gaussian Noise","version":3},"cited_work":{"arxiv_id":"2408.07021","doi":"10.48550/arxiv.2408.07021","metadata_source":"arxiv_reference","pith_arxiv_id":"2408.07021","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Improved counting under continual observation with pure differential privacy.CoRR, abs/2408.07021,","venue":null,"work_id":"15bf14e4-44d4-4db4-bf9b-0b80e743aefc","year":2024},"citing_paper":{"arxiv_id":"2607.00876","last_updated":"2026-07-02T11:12:33Z","snapshot_observed_at":"2026-08-10T09:32:37.702544Z","submitted_at":"2026-07-01T12:38:33Z","title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-03T18:04:17.669900Z"},"links":{"cited_paper":"/paper/2408.07021","citing_paper":"/paper/2607.00876"},"observation_digest":"sha256:082fcacccdbdc45677af87fb13d18d75523585a6c460a97a6602d34b33d2d62c","observation_id":"1802989b-393d-4340-b4b4-c3badebfbe8a","resolution":{"observed_at":"2026-07-03T18:08:45.585947Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-06T08:12:07.195949Z","title":"The price of differential privacy for online learning","venue":null,"work_id":"f0c0b86f-efae-4a1d-9d39-80335049bb30","year":2017},"citing_paper":{"arxiv_id":"2607.00876","last_updated":"2026-07-02T11:12:33Z","snapshot_observed_at":"2026-08-10T09:32:37.702544Z","submitted_at":"2026-07-01T12:38:33Z","title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-03T18:04:17.669900Z"},"links":{"citing_paper":"/paper/2607.00876"},"observation_digest":"sha256:e0f302a7faba111223e06ebea80b960a3904982cd5638d33d5f109798894a5ca","observation_id":"ac9609b3-1ce2-4ea6-8272-3c3c03ed5728","resolution":{"observed_at":"2026-07-05T04:10:40.194118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-06T08:12:07.233473Z","title":"[CDP+24] Christopher A","venue":null,"work_id":"839ab53a-4450-4ba9-88c8-aa50f1803947","year":2024},"citing_paper":{"arxiv_id":"2607.00876","last_updated":"2026-07-02T11:12:33Z","snapshot_observed_at":"2026-08-10T09:32:37.702544Z","submitted_at":"2026-07-01T12:38:33Z","title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-03T18:04:17.669900Z"},"links":{"citing_paper":"/paper/2607.00876"},"observation_digest":"sha256:40f08d29dd098fe5f4c813215d0bdc440ed0829cec23291a7151ee4e07cb7e43","observation_id":"423b01ad-3d96-4bc1-b5bd-0491cac50c3a","resolution":{"observed_at":"2026-07-05T04:10:40.233766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-06T08:12:07.207659Z","title":"Differentially private space-efficient algorithms for counting distinct elements in the turnstile model","venue":null,"work_id":"8829d114-261b-40ea-b6c6-04f6f1ff98b0","year":2025},"citing_paper":{"arxiv_id":"2607.00876","last_updated":"2026-07-02T11:12:33Z","snapshot_observed_at":"2026-08-10T09:32:37.702544Z","submitted_at":"2026-07-01T12:38:33Z","title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-03T18:04:17.669900Z"},"links":{"citing_paper":"/paper/2607.00876"},"observation_digest":"sha256:54be85ec35624c5bed130ef1b2d93ed562955b2f53f221999f487d66537889ba","observation_id":"b9fd176e-34a7-4cc9-9362-189017fa1aaf","resolution":{"observed_at":"2026-07-05T04:10:40.211089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-06T08:12:07.238410Z","title":"Lower bounds for dif- ferential privacy under continual observation and online threshold queries","venue":null,"work_id":"88165714-6b7a-4cba-8400-cc78dcd9f425","year":2023},"citing_paper":{"arxiv_id":"2607.00876","last_updated":"2026-07-02T11:12:33Z","snapshot_observed_at":"2026-08-10T09:32:37.702544Z","submitted_at":"2026-07-01T12:38:33Z","title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-03T18:04:17.669900Z"},"links":{"citing_paper":"/paper/2607.00876"},"observation_digest":"sha256:7aac91eefd684f5e8806f4ece95f576644384df32e16fe0b5718a5d100a5a519","observation_id":"80edcd60-94a4-42a1-8133-076434e8fbc5","resolution":{"observed_at":"2026-07-05T04:10:40.212144Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-05T04:10:40.234322Z","title":"Hubert Chan, Elaine Shi, and Dawn Song","venue":null,"work_id":"fd941d9e-0e28-4b0b-8a8d-7c862e2aefcb","year":2010},"citing_paper":{"arxiv_id":"2607.00876","last_updated":"2026-07-02T11:12:33Z","snapshot_observed_at":"2026-08-10T09:32:37.702544Z","submitted_at":"2026-07-01T12:38:33Z","title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-03T18:04:17.669900Z"},"links":{"citing_paper":"/paper/2607.00876"},"observation_digest":"sha256:489c4ce1ca59af9ef5fafd0a72c3092e12661370f365e3b15f29767957333ecb","observation_id":"5fcdf2e7-b31e-4337-b443-20ce38474f70","resolution":{"observed_at":"2026-07-05T04:10:40.235556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-06T08:12:07.209367Z","title":null,"venue":null,"work_id":"87de8c2d-2ff6-49f3-be88-074c17403686","year":2006},"citing_paper":{"arxiv_id":"2607.00876","last_updated":"2026-07-02T11:12:33Z","snapshot_observed_at":"2026-08-10T09:32:37.702544Z","submitted_at":"2026-07-01T12:38:33Z","title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-03T18:04:17.669900Z"},"links":{"citing_paper":"/paper/2607.00876"},"observation_digest":"sha256:a2b133b24a9acc216787cdf2396a5ddab9377bd05187d6dd918646a94539efbb","observation_id":"024e616f-6fc8-4628-b23a-241b1729ced1","resolution":{"observed_at":"2026-07-05T04:10:40.193333Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-06T08:12:07.240473Z","title":"Rothblum","venue":null,"work_id":"279e1c2a-1853-46f0-b46e-17f48435c56d","year":2010},"citing_paper":{"arxiv_id":"2607.00876","last_updated":"2026-07-02T11:12:33Z","snapshot_observed_at":"2026-08-10T09:32:37.702544Z","submitted_at":"2026-07-01T12:38:33Z","title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-03T18:04:17.669900Z"},"links":{"citing_paper":"/paper/2607.00876"},"observation_digest":"sha256:218651fda5a2ef1bb962449c077fc990a72f6ad6671beb0cf1af8554e48f701e","observation_id":"36bea28b-4289-48be-9e62-23452a66b59f","resolution":{"observed_at":"2026-07-05T04:10:40.222351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-06T08:12:07.227175Z","title":"Rothblum","venue":null,"work_id":"c9cdb3a2-42aa-409e-9bec-030be084927e","year":2015},"citing_paper":{"arxiv_id":"2607.00876","last_updated":"2026-07-02T11:12:33Z","snapshot_observed_at":"2026-08-10T09:32:37.702544Z","submitted_at":"2026-07-01T12:38:33Z","title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-03T18:04:17.669900Z"},"links":{"citing_paper":"/paper/2607.00876"},"observation_digest":"sha256:1412ce3acfb9cbd0c95c503ad95a04494431f41edc23d759e2bcaa4ba94081ae","observation_id":"2fd6ec87-80f5-4d87-97a3-e5f5870236f5","resolution":{"observed_at":"2026-07-05T04:10:40.241735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-06T08:12:07.235355Z","title":"Differentially private algorithms for graphs under continual observation","venue":null,"work_id":"984e498f-e5fb-4a14-bfa3-1467da6d0baf","year":2021},"citing_paper":{"arxiv_id":"2607.00876","last_updated":"2026-07-02T11:12:33Z","snapshot_observed_at":"2026-08-10T09:32:37.702544Z","submitted_at":"2026-07-01T12:38:33Z","title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-03T18:04:17.669900Z"},"links":{"citing_paper":"/paper/2607.00876"},"observation_digest":"sha256:c64bf1689eba05f5c3219b1a8928a091f3891862b8f499e88ea2c011f0bf8638","observation_id":"df76d1c6-f8f3-45bf-af08-c3e7071f84cf","resolution":{"observed_at":"2026-07-05T04:10:40.244338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-06T08:12:07.229107Z","title":"Constant matters: Fine-grained error bound on differentially private continual observation","venue":null,"work_id":"3e21c081-0fce-44a3-833b-847174844f94","year":2023},"citing_paper":{"arxiv_id":"2607.00876","last_updated":"2026-07-02T11:12:33Z","snapshot_observed_at":"2026-08-10T09:32:37.702544Z","submitted_at":"2026-07-01T12:38:33Z","title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-03T18:04:17.669900Z"},"links":{"citing_paper":"/paper/2607.00876"},"observation_digest":"sha256:c4fe713ceb717b7a59139bf6472360834a5190a95f5657bba05fdc7346f4db8c","observation_id":"ede8e598-4915-4708-bf6e-68f1e28e8f84","resolution":{"observed_at":"2026-07-05T04:10:40.239772Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-06T08:12:07.229360Z","title":"Private streaming SCO inℓ p geometry with applications in high dimensional online decision making","venue":null,"work_id":"8140e173-d871-44d7-98cc-7b2ec2d77f16","year":2022},"citing_paper":{"arxiv_id":"2607.00876","last_updated":"2026-07-02T11:12:33Z","snapshot_observed_at":"2026-08-10T09:32:37.702544Z","submitted_at":"2026-07-01T12:38:33Z","title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-03T18:04:17.669900Z"},"links":{"citing_paper":"/paper/2607.00876"},"observation_digest":"sha256:ebf6f922bd561092e395e5f037c19497162291ec238407b90fa180a6fe619a05","observation_id":"e818d776-b8eb-464a-8ecc-c0c3c84d6f53","resolution":{"observed_at":"2026-07-05T04:10:40.224725Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-06T08:12:07.225059Z","title":"Efficient use of differentially private binary trees.Theory and Practice of Differential Privacy (TPDP 2015), London, UK, 2:26–27,","venue":null,"work_id":"8fe7d054-8d83-4cda-8864-8b2acbb343fa","year":2015},"citing_paper":{"arxiv_id":"2607.00876","last_updated":"2026-07-02T11:12:33Z","snapshot_observed_at":"2026-08-10T09:32:37.702544Z","submitted_at":"2026-07-01T12:38:33Z","title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-03T18:04:17.669900Z"},"links":{"citing_paper":"/paper/2607.00876"},"observation_digest":"sha256:e6fb9995733ed2646ee987f2f3b9bf4379dca0b483ec1cb713afe14ba303aa09","observation_id":"ce751983-bd81-478b-9aaa-f2c7ca527c38","resolution":{"observed_at":"2026-07-05T04:10:40.226941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-06T08:12:07.222866Z","title":null,"venue":null,"work_id":"eba00ed4-8a08-4ef4-a829-023d0d434589","year":2024},"citing_paper":{"arxiv_id":"2607.00876","last_updated":"2026-07-02T11:12:33Z","snapshot_observed_at":"2026-08-10T09:32:37.702544Z","submitted_at":"2026-07-01T12:38:33Z","title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-03T18:04:17.669900Z"},"links":{"citing_paper":"/paper/2607.00876"},"observation_digest":"sha256:3d8a3a8e6baf22498cbde3b16ee5a69c7287671de388be77497d3f6de5d8aadb","observation_id":"0d26c533-5237-49b3-9fc9-fd3d02de56d9","resolution":{"observed_at":"2026-07-05T04:10:40.247018Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-05T04:10:40.203782Z","title":"Almost tight error bounds on differentially private continual counting","venue":null,"work_id":"31e08072-4d6f-4e6b-978b-7be15d498118","year":2023},"citing_paper":{"arxiv_id":"2607.00876","last_updated":"2026-07-02T11:12:33Z","snapshot_observed_at":"2026-08-10T09:32:37.702544Z","submitted_at":"2026-07-01T12:38:33Z","title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-03T18:04:17.669900Z"},"links":{"citing_paper":"/paper/2607.00876"},"observation_digest":"sha256:1baf51adcb58c0c119c53ed25862394342811e143b595382da5964dce962ffdc","observation_id":"7dc640dc-ae4b-4d81-b342-680da671ecde","resolution":{"observed_at":"2026-07-05T04:10:40.205849Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-06T08:12:07.227326Z","title":"A unifying framework for differ- entially private sums under continual observation","venue":null,"work_id":"61f38b8e-986c-40cd-96b1-a2809906cc31","year":2024},"citing_paper":{"arxiv_id":"2607.00876","last_updated":"2026-07-02T11:12:33Z","snapshot_observed_at":"2026-08-10T09:32:37.702544Z","submitted_at":"2026-07-01T12:38:33Z","title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-03T18:04:17.669900Z"},"links":{"citing_paper":"/paper/2607.00876"},"observation_digest":"sha256:f7ce0dad5c7a91e90c98c0980f8d2077a5dc0901deaabd6b0eb02fe2935be716","observation_id":"99a72132-12dd-4794-8e9f-bd5bc2405e72","resolution":{"observed_at":"2026-07-05T04:10:40.237055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-06T08:12:07.236508Z","title":"Counting distinct elements in the turnstile model with differential privacy under continual observation","venue":null,"work_id":"2a925ff3-02e7-4071-8dac-525f9397a0ca","year":2023},"citing_paper":{"arxiv_id":"2607.00876","last_updated":"2026-07-02T11:12:33Z","snapshot_observed_at":"2026-08-10T09:32:37.702544Z","submitted_at":"2026-07-01T12:38:33Z","title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-03T18:04:17.669900Z"},"links":{"citing_paper":"/paper/2607.00876"},"observation_digest":"sha256:43a16b5cf36ce11d53c52c73645fe462ab9cc970488c08aa6c86a8fe3673228b","observation_id":"35dcfca8-57d3-4744-8d36-90865b602aab","resolution":{"observed_at":"2026-07-05T04:10:40.232326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-06T08:12:07.218709Z","title":"Differentially private online learning","venue":null,"work_id":"35c7787d-3a18-4693-9a43-4099ff221b50","year":2012},"citing_paper":{"arxiv_id":"2607.00876","last_updated":"2026-07-02T11:12:33Z","snapshot_observed_at":"2026-08-10T09:32:37.702544Z","submitted_at":"2026-07-01T12:38:33Z","title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-03T18:04:17.669900Z"},"links":{"citing_paper":"/paper/2607.00876"},"observation_digest":"sha256:317ef48131f5ffd351a6a0779289b8927f54a934851cf9a0063143cc2be3c737","observation_id":"169e0e41-171a-40a3-88b8-19db6bf1bb8c","resolution":{"observed_at":"2026-07-05T04:10:40.220170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-06T08:12:07.241390Z","title":null,"venue":null,"work_id":"a9b76157-d46a-45a2-8f9f-2788f8e70236","year":2023},"citing_paper":{"arxiv_id":"2607.00876","last_updated":"2026-07-02T11:12:33Z","snapshot_observed_at":"2026-08-10T09:32:37.702544Z","submitted_at":"2026-07-01T12:38:33Z","title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-03T18:04:17.669900Z"},"links":{"citing_paper":"/paper/2607.00876"},"observation_digest":"sha256:ba71402f1024a1a24bea73d5dec2d96176c291d38c284422ceda2c06259005f3","observation_id":"a89a48bc-27eb-48de-bf89-98e6b118b2c1","resolution":{"observed_at":"2026-07-05T04:10:40.230030Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-06T08:12:07.211836Z","title":"Practical and private (deep) learning without sampling or shuffling","venue":null,"work_id":"9669b2da-d1f4-49f6-8e90-2c1029651264","year":2021},"citing_paper":{"arxiv_id":"2607.00876","last_updated":"2026-07-02T11:12:33Z","snapshot_observed_at":"2026-08-10T09:32:37.702544Z","submitted_at":"2026-07-01T12:38:33Z","title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-03T18:04:17.669900Z"},"links":{"citing_paper":"/paper/2607.00876"},"observation_digest":"sha256:b898edccd2ac1608232234f2b4528ad3c3084f34e576357d2beafe2c6ea82a8f","observation_id":"6ebefa20-07b6-45ed-a6f4-70ce49da590a","resolution":{"observed_at":"2026-07-05T04:10:40.234739Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-06T08:12:07.234655Z","title":"Factorization norms and hereditary discrepancy.International Mathematics Research Notices, 2020(3):751–780, 02","venue":null,"work_id":"24deb963-a0e9-443f-bab9-82297ca50362","year":2020},"citing_paper":{"arxiv_id":"2607.00876","last_updated":"2026-07-02T11:12:33Z","snapshot_observed_at":"2026-08-10T09:32:37.702544Z","submitted_at":"2026-07-01T12:38:33Z","title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-03T18:04:17.669900Z"},"links":{"citing_paper":"/paper/2607.00876"},"observation_digest":"sha256:760407281a799483b472139c64e547eea48b4205c3a0eedb7f5c7c927151abf4","observation_id":"2c7c18cc-a59d-4e71-b99f-95c554a42661","resolution":{"observed_at":"2026-07-05T04:10:40.229247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-06T08:12:07.231377Z","title":"The geometry of differential privacy: the sparse and approximate cases","venue":null,"work_id":"f3dee445-d4d8-43b3-b5ee-8d530cabf69d","year":2013},"citing_paper":{"arxiv_id":"2607.00876","last_updated":"2026-07-02T11:12:33Z","snapshot_observed_at":"2026-08-10T09:32:37.702544Z","submitted_at":"2026-07-01T12:38:33Z","title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-03T18:04:17.669900Z"},"links":{"citing_paper":"/paper/2607.00876"},"observation_digest":"sha256:49039c559431a7c9c23822be1611fd6bb8213156272fdc2815e646a8193446e5","observation_id":"090ccbdb-5b55-48a4-9302-13df4b304796","resolution":{"observed_at":"2026-07-05T04:10:40.227425Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-06T08:12:07.216766Z","title":null,"venue":null,"work_id":"d6bd8b0c-dd45-4009-a959-58fda350a5d1","year":2013},"citing_paper":{"arxiv_id":"2607.00876","last_updated":"2026-07-02T11:12:33Z","snapshot_observed_at":"2026-08-10T09:32:37.702544Z","submitted_at":"2026-07-01T12:38:33Z","title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-03T18:04:17.669900Z"},"links":{"citing_paper":"/paper/2607.00876"},"observation_digest":"sha256:d10b383aea16e8249e75b3faa36cfccea5a3add7e0aa0e1c621a0625339040fb","observation_id":"f7f55d84-e714-483d-af11-97134d6af3a5","resolution":{"observed_at":"2026-07-05T04:10:40.222501Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.00876","last_updated":"2026-07-02T11:12:33Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-10T09:32:37.702544Z","submitted_at":"2026-07-01T12:38:33Z","title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":20},"total_outbound_references":25},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 2 inbound Pith citation observations for arXiv:2607.00876."}