{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:S7R5OMUHNRZ4KVUDNGOPQEVGXL","short_pith_number":"pith:S7R5OMUH","schema_version":"1.0","canonical_sha256":"97e3d732876c73c55683699cf812a6bae22269522f926839093ea0e05a581c60","source":{"kind":"arxiv","id":"2606.11760","version":1},"attestation_state":"computed","paper":{"title":"A Fast Gaussian Mechanism under Continual Observation, with Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DB"],"primary_cat":"cs.DS","authors_text":"Rasmus Pagh, Sia Sejer","submitted_at":"2026-06-10T07:36:58Z","abstract_excerpt":"We consider the problem of privately releasing a $k$-dimensional vector under updates: Starting with a zero vector, at times $t_1, t_2,\\dots$ the vector is updated by adding $x^{(1)}, x^{(2)},\\dots$, respectively. For positive integers $T$, $k$ we model the updates as a data set $\\{(t_i, x^{(i)})\\}_i$, where $t_i \\in [T]$ and $x^{(i)} \\in B_k$ (the $k$-dimensional unit ball). Two such data sets are said to be neighboring if their symmetric difference has size at most $1$. The continual release consists of the sum $A^{(t)} = \\sum_{i \\; : \\; t_i \\leq t} x^{(i)}$ for each time step $t=1,\\dots,T$."},"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":"2606.11760","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-10T07:36:58Z","cross_cats_sorted":["cs.CR","cs.DB"],"title_canon_sha256":"ed5c6f49d5e4d1a3d947e3744f9cbce5b502effc5572b4f9c4ffd4e925d55294","abstract_canon_sha256":"ab34bd51ee4c7ec7dcccc5b82582fbd535b47bc43a12619c7a90c78dba332673"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:10:06.514845Z","signature_b64":"KDFuanKbiV0i8RCv/QYKfCZeURt+Wyy23yNlXDeDe+eLxTvmdYRJCwcBHe4Jc4p1EWMDLkpo4S+yA4zGV+efCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97e3d732876c73c55683699cf812a6bae22269522f926839093ea0e05a581c60","last_reissued_at":"2026-06-11T01:10:06.513965Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:10:06.513965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast Gaussian Mechanism under Continual Observation, with Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DB"],"primary_cat":"cs.DS","authors_text":"Rasmus Pagh, Sia Sejer","submitted_at":"2026-06-10T07:36:58Z","abstract_excerpt":"We consider the problem of privately releasing a $k$-dimensional vector under updates: Starting with a zero vector, at times $t_1, t_2,\\dots$ the vector is updated by adding $x^{(1)}, x^{(2)},\\dots$, respectively. For positive integers $T$, $k$ we model the updates as a data set $\\{(t_i, x^{(i)})\\}_i$, where $t_i \\in [T]$ and $x^{(i)} \\in B_k$ (the $k$-dimensional unit ball). Two such data sets are said to be neighboring if their symmetric difference has size at most $1$. The continual release consists of the sum $A^{(t)} = \\sum_{i \\; : \\; t_i \\leq t} x^{(i)}$ for each time step $t=1,\\dots,T$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11760","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/2606.11760/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":"2606.11760","created_at":"2026-06-11T01:10:06.514116+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.11760v1","created_at":"2026-06-11T01:10:06.514116+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11760","created_at":"2026-06-11T01:10:06.514116+00:00"},{"alias_kind":"pith_short_12","alias_value":"S7R5OMUHNRZ4","created_at":"2026-06-11T01:10:06.514116+00:00"},{"alias_kind":"pith_short_16","alias_value":"S7R5OMUHNRZ4KVUD","created_at":"2026-06-11T01:10:06.514116+00:00"},{"alias_kind":"pith_short_8","alias_value":"S7R5OMUH","created_at":"2026-06-11T01:10:06.514116+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S7R5OMUHNRZ4KVUDNGOPQEVGXL","json":"https://pith.science/pith/S7R5OMUHNRZ4KVUDNGOPQEVGXL.json","graph_json":"https://pith.science/api/pith-number/S7R5OMUHNRZ4KVUDNGOPQEVGXL/graph.json","events_json":"https://pith.science/api/pith-number/S7R5OMUHNRZ4KVUDNGOPQEVGXL/events.json","paper":"https://pith.science/paper/S7R5OMUH"},"agent_actions":{"view_html":"https://pith.science/pith/S7R5OMUHNRZ4KVUDNGOPQEVGXL","download_json":"https://pith.science/pith/S7R5OMUHNRZ4KVUDNGOPQEVGXL.json","view_paper":"https://pith.science/paper/S7R5OMUH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.11760&json=true","fetch_graph":"https://pith.science/api/pith-number/S7R5OMUHNRZ4KVUDNGOPQEVGXL/graph.json","fetch_events":"https://pith.science/api/pith-number/S7R5OMUHNRZ4KVUDNGOPQEVGXL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S7R5OMUHNRZ4KVUDNGOPQEVGXL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S7R5OMUHNRZ4KVUDNGOPQEVGXL/action/storage_attestation","attest_author":"https://pith.science/pith/S7R5OMUHNRZ4KVUDNGOPQEVGXL/action/author_attestation","sign_citation":"https://pith.science/pith/S7R5OMUHNRZ4KVUDNGOPQEVGXL/action/citation_signature","submit_replication":"https://pith.science/pith/S7R5OMUHNRZ4KVUDNGOPQEVGXL/action/replication_record"}},"created_at":"2026-06-11T01:10:06.514116+00:00","updated_at":"2026-06-11T01:10:06.514116+00:00"}