{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LG6N6KFKRUVJ3RY6ILS4BAC7R5","short_pith_number":"pith:LG6N6KFK","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"},"canonical_sha256":"59bcdf28aa8d2a9dc71e42e5c0805f8f44df49376fc709902dc1c9242f867b82","source":{"kind":"arxiv","id":"2607.08963","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.08963","created_at":"2026-07-13T00:17:30Z"},{"alias_kind":"arxiv_version","alias_value":"2607.08963v1","created_at":"2026-07-13T00:17:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.08963","created_at":"2026-07-13T00:17:30Z"},{"alias_kind":"pith_short_12","alias_value":"LG6N6KFKRUVJ","created_at":"2026-07-13T00:17:30Z"},{"alias_kind":"pith_short_16","alias_value":"LG6N6KFKRUVJ3RY6","created_at":"2026-07-13T00:17:30Z"},{"alias_kind":"pith_short_8","alias_value":"LG6N6KFK","created_at":"2026-07-13T00:17:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LG6N6KFKRUVJ3RY6ILS4BAC7R5","target":"record","payload":{"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"},"canonical_sha256":"59bcdf28aa8d2a9dc71e42e5c0805f8f44df49376fc709902dc1c9242f867b82","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"},"source_kind":"arxiv","source_id":"2607.08963","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-13T00:17:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kewmHQd94dhhGpN4nhZMgbB5v4HFPnCuWRhZ85qK787YRq9hZ+Vz7AbGTUj4Lx5Roeggq4YKQFXWbCOlRXl5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T10:32:05.894775Z"},"content_sha256":"dea3de49a56a52b7f50ae4529af3deada4ba13b0d37f5516a14bb2fcbfa0d82d","schema_version":"1.0","event_id":"sha256:dea3de49a56a52b7f50ae4529af3deada4ba13b0d37f5516a14bb2fcbfa0d82d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LG6N6KFKRUVJ3RY6ILS4BAC7R5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-13T00:17:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3+gdhoIURmQBdQxwGO1peWcC7g9401AnfzB9W28lICDLOBiPSLWrPSjRTmaGwVkNJdrEZNltHcX9AAKkSRrPAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T10:32:05.895293Z"},"content_sha256":"dd01d7b0656f12b51d1a6945feedf9aa9bc88a50df388afb8091da38e3d84688","schema_version":"1.0","event_id":"sha256:dd01d7b0656f12b51d1a6945feedf9aa9bc88a50df388afb8091da38e3d84688"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LG6N6KFKRUVJ3RY6ILS4BAC7R5/bundle.json","state_url":"https://pith.science/pith/LG6N6KFKRUVJ3RY6ILS4BAC7R5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LG6N6KFKRUVJ3RY6ILS4BAC7R5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-05T10:32:05Z","links":{"resolver":"https://pith.science/pith/LG6N6KFKRUVJ3RY6ILS4BAC7R5","bundle":"https://pith.science/pith/LG6N6KFKRUVJ3RY6ILS4BAC7R5/bundle.json","state":"https://pith.science/pith/LG6N6KFKRUVJ3RY6ILS4BAC7R5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LG6N6KFKRUVJ3RY6ILS4BAC7R5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LG6N6KFKRUVJ3RY6ILS4BAC7R5","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":"f9d7fbbdabf7fa48421623428a6de7c2e48145b839f596381addbed2d1b6ab9c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-09T21:54:56Z","title_canon_sha256":"edf39667290336310ea49f636def9eb66761cd74a62d19cdae8441f6a07e1e70"},"schema_version":"1.0","source":{"id":"2607.08963","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.08963","created_at":"2026-07-13T00:17:30Z"},{"alias_kind":"arxiv_version","alias_value":"2607.08963v1","created_at":"2026-07-13T00:17:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.08963","created_at":"2026-07-13T00:17:30Z"},{"alias_kind":"pith_short_12","alias_value":"LG6N6KFKRUVJ","created_at":"2026-07-13T00:17:30Z"},{"alias_kind":"pith_short_16","alias_value":"LG6N6KFKRUVJ3RY6","created_at":"2026-07-13T00:17:30Z"},{"alias_kind":"pith_short_8","alias_value":"LG6N6KFK","created_at":"2026-07-13T00:17:30Z"}],"graph_snapshots":[{"event_id":"sha256:dd01d7b0656f12b51d1a6945feedf9aa9bc88a50df388afb8091da38e3d84688","target":"graph","created_at":"2026-07-13T00:17:30Z","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.08963/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Nikita P. Kalinin, Pavel Arkhipov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-09T21:54:56Z","title":"Improved Error Bounds for Pure Differentially Private Continual Counting via Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.08963","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:dea3de49a56a52b7f50ae4529af3deada4ba13b0d37f5516a14bb2fcbfa0d82d","target":"record","created_at":"2026-07-13T00:17:30Z","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":"f9d7fbbdabf7fa48421623428a6de7c2e48145b839f596381addbed2d1b6ab9c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-09T21:54:56Z","title_canon_sha256":"edf39667290336310ea49f636def9eb66761cd74a62d19cdae8441f6a07e1e70"},"schema_version":"1.0","source":{"id":"2607.08963","kind":"arxiv","version":1}},"canonical_sha256":"59bcdf28aa8d2a9dc71e42e5c0805f8f44df49376fc709902dc1c9242f867b82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59bcdf28aa8d2a9dc71e42e5c0805f8f44df49376fc709902dc1c9242f867b82","first_computed_at":"2026-07-13T00:17:30.213279Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-13T00:17:30.213279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gPauB37+HTBRwgs0bYln8Qh4x+g87jDQSnDEJ+dMDLe376d9QgR5lPRu5BqnPIM/L61L12Wf1tO9QqXDjFohAg==","signature_status":"signed_v1","signed_at":"2026-07-13T00:17:30.214261Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.08963","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dea3de49a56a52b7f50ae4529af3deada4ba13b0d37f5516a14bb2fcbfa0d82d","sha256:dd01d7b0656f12b51d1a6945feedf9aa9bc88a50df388afb8091da38e3d84688"],"state_sha256":"2ef37022bb8798f2f1276451188c675420c4b2668d93c2cb2e8f703ad74f03ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BXO6WRIRqTfXeWwd1JaPjIoZbSLOAuf6fYFga3HxVB27m9XIRlcmupTRr3XJUCpV+6vbP6HajZiKIbN+mMOMBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T10:32:05.898483Z","bundle_sha256":"b8f6ce42789d1dfb35cd9dbcc54a94a7d78f2d66fc33644191559697226613ed"}}