{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:Z2YTNX4AGSWJO3ZRCCAG72RJAC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"93dd58f5e5a8216f6dc2c8a0e3a09694ef6ec9c1f73dbcfb5864489c16193c1b","cross_cats_sorted":["cs.CR","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T12:38:33Z","title_canon_sha256":"3a57c09cd87210560b9ccc47115e1b33507e2f7ddaa6294ffbb3550989b05f66"},"schema_version":"1.0","source":{"id":"2607.00876","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00876","created_at":"2026-07-02T01:18:21Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00876v1","created_at":"2026-07-02T01:18:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00876","created_at":"2026-07-02T01:18:21Z"},{"alias_kind":"pith_short_12","alias_value":"Z2YTNX4AGSWJ","created_at":"2026-07-02T01:18:21Z"},{"alias_kind":"pith_short_16","alias_value":"Z2YTNX4AGSWJO3ZR","created_at":"2026-07-02T01:18:21Z"},{"alias_kind":"pith_short_8","alias_value":"Z2YTNX4A","created_at":"2026-07-02T01:18:21Z"}],"graph_snapshots":[{"event_id":"sha256:39a250501ffa8079be958d88fe7fed1efec6cb28ff2758f2d6eb9de0ef31a3fa","target":"graph","created_at":"2026-07-02T01:18:21Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.00876/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Private continual counting is a fundamental problem in differential privacy: given a binary stream of length $n$, where each $1$ corresponds to the contribution of one individual, the goal is to release all running counts while protecting the privacy of each individual. The standard algorithm is the binary tree mechanism, whose Gaussian-noise variant achieves expected $\\ell_\\infty$ error proportional to $\\log^{3/2} n$ for approximate differential privacy. Whether this dependence on the stream length is necessary has remained a central open problem.\n  In this work, we resolve the dependence on ","authors_text":"Kasper Green Larsen, Konstantina Bairaktari","cross_cats":["cs.CR","cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T12:38:33Z","title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00876","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:88bd326c2b66a7dc592621bcfb62d0f5b85539e708663a1185cfe55adf6354d5","target":"record","created_at":"2026-07-02T01:18:21Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"93dd58f5e5a8216f6dc2c8a0e3a09694ef6ec9c1f73dbcfb5864489c16193c1b","cross_cats_sorted":["cs.CR","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T12:38:33Z","title_canon_sha256":"3a57c09cd87210560b9ccc47115e1b33507e2f7ddaa6294ffbb3550989b05f66"},"schema_version":"1.0","source":{"id":"2607.00876","kind":"arxiv","version":1}},"canonical_sha256":"ceb136df8034ac976f3110806fea2900ac71b55b3ce6c10a7b0dec31583e24b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ceb136df8034ac976f3110806fea2900ac71b55b3ce6c10a7b0dec31583e24b6","first_computed_at":"2026-07-02T01:18:21.999767Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-02T01:18:21.999767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YsWWOPquty6KZeYgvyOQwjdvZakVYAQ4vDB4mAwqyD5EnvsX9xQMt4u6uYjFrgPEuk7GDFT6OAUidPaHD04ADQ==","signature_status":"signed_v1","signed_at":"2026-07-02T01:18:22.000109Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.00876","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88bd326c2b66a7dc592621bcfb62d0f5b85539e708663a1185cfe55adf6354d5","sha256:39a250501ffa8079be958d88fe7fed1efec6cb28ff2758f2d6eb9de0ef31a3fa"],"state_sha256":"5ddb6b3c7c4ccec082b3580a739a13b5725a72c7a61e2313a95bf9aa71701e45"}