{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:LG6N6KFKRUVJ3RY6ILS4BAC7R5","short_pith_number":"pith:LG6N6KFK","schema_version":"1.0","canonical_sha256":"59bcdf28aa8d2a9dc71e42e5c0805f8f44df49376fc709902dc1c9242f867b82","source":{"kind":"arxiv","id":"2607.08963","version":1},"attestation_state":"computed","paper":{"title":"Improved Error Bounds for Pure Differentially Private Continual Counting via Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nikita P. Kalinin, Pavel Arkhipov","submitted_at":"2026-07-09T21:54:56Z","abstract_excerpt":"Continual counting under pure differential privacy is one of the simplest and most well-studied problems in the continual observation model. Nevertheless, an asymptotic gap remains between the best known upper and lower bounds for maximum squared error and mean squared error: the upper bound is $O(\\epsilon^{-2}\\log^3 n)$, while the lower bound is $\\Omega(\\epsilon^{-2}\\log^2 n)$, for both error metrics. The best known constant in the upper bound is achieved by the $k$-ary tree mechanism with the subtraction trick, due to Andersson, Pagh, Steiner, and Torkamani (FORC 2025). In this work, we impr"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.08963","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-09T21:54:56Z","cross_cats_sorted":[],"title_canon_sha256":"edf39667290336310ea49f636def9eb66761cd74a62d19cdae8441f6a07e1e70","abstract_canon_sha256":"f9d7fbbdabf7fa48421623428a6de7c2e48145b839f596381addbed2d1b6ab9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-13T00:17:30.214261Z","signature_b64":"gPauB37+HTBRwgs0bYln8Qh4x+g87jDQSnDEJ+dMDLe376d9QgR5lPRu5BqnPIM/L61L12Wf1tO9QqXDjFohAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59bcdf28aa8d2a9dc71e42e5c0805f8f44df49376fc709902dc1c9242f867b82","last_reissued_at":"2026-07-13T00:17:30.213279Z","signature_status":"signed_v1","first_computed_at":"2026-07-13T00:17:30.213279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Error Bounds for Pure Differentially Private Continual Counting via Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nikita P. Kalinin, Pavel Arkhipov","submitted_at":"2026-07-09T21:54:56Z","abstract_excerpt":"Continual counting under pure differential privacy is one of the simplest and most well-studied problems in the continual observation model. Nevertheless, an asymptotic gap remains between the best known upper and lower bounds for maximum squared error and mean squared error: the upper bound is $O(\\epsilon^{-2}\\log^3 n)$, while the lower bound is $\\Omega(\\epsilon^{-2}\\log^2 n)$, for both error metrics. The best known constant in the upper bound is achieved by the $k$-ary tree mechanism with the subtraction trick, due to Andersson, Pagh, Steiner, and Torkamani (FORC 2025). In this work, we impr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.08963","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.08963/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.08963","created_at":"2026-07-13T00:17:30.213802+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.08963v1","created_at":"2026-07-13T00:17:30.213802+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.08963","created_at":"2026-07-13T00:17:30.213802+00:00"},{"alias_kind":"pith_short_12","alias_value":"LG6N6KFKRUVJ","created_at":"2026-07-13T00:17:30.213802+00:00"},{"alias_kind":"pith_short_16","alias_value":"LG6N6KFKRUVJ3RY6","created_at":"2026-07-13T00:17:30.213802+00:00"},{"alias_kind":"pith_short_8","alias_value":"LG6N6KFK","created_at":"2026-07-13T00:17:30.213802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.28703","citing_title":"Costs of Arbitrary Real Matrix Factorizations for Pure-DP Continual Counting","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LG6N6KFKRUVJ3RY6ILS4BAC7R5","json":"https://pith.science/pith/LG6N6KFKRUVJ3RY6ILS4BAC7R5.json","graph_json":"https://pith.science/api/pith-number/LG6N6KFKRUVJ3RY6ILS4BAC7R5/graph.json","events_json":"https://pith.science/api/pith-number/LG6N6KFKRUVJ3RY6ILS4BAC7R5/events.json","paper":"https://pith.science/paper/LG6N6KFK"},"agent_actions":{"view_html":"https://pith.science/pith/LG6N6KFKRUVJ3RY6ILS4BAC7R5","download_json":"https://pith.science/pith/LG6N6KFKRUVJ3RY6ILS4BAC7R5.json","view_paper":"https://pith.science/paper/LG6N6KFK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.08963&json=true","fetch_graph":"https://pith.science/api/pith-number/LG6N6KFKRUVJ3RY6ILS4BAC7R5/graph.json","fetch_events":"https://pith.science/api/pith-number/LG6N6KFKRUVJ3RY6ILS4BAC7R5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LG6N6KFKRUVJ3RY6ILS4BAC7R5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LG6N6KFKRUVJ3RY6ILS4BAC7R5/action/storage_attestation","attest_author":"https://pith.science/pith/LG6N6KFKRUVJ3RY6ILS4BAC7R5/action/author_attestation","sign_citation":"https://pith.science/pith/LG6N6KFKRUVJ3RY6ILS4BAC7R5/action/citation_signature","submit_replication":"https://pith.science/pith/LG6N6KFKRUVJ3RY6ILS4BAC7R5/action/replication_record"}},"created_at":"2026-07-13T00:17:30.213802+00:00","updated_at":"2026-07-13T00:17:30.213802+00:00"}