{"as_of":"2026-08-11T00:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:82958942d58c14cb5ec70c6668d5767a596a9491f4bb30f08aadbe5ea750355e","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-13T05:28:27.662569Z","state":"measured"},{"denominator":54,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":54,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T00:50:58.991713Z","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.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},"cited_work":{"arxiv_id":"2607.08963","doi":"10.48550/arxiv.2607.08963","metadata_source":"pith","pith_arxiv_id":"2607.08963","snapshot_observed_at":"2026-08-03T06:16:11.147974Z","title":"Improved Error Bounds for Pure Differentially Private Continual Counting via Matrix Factorization","venue":"cs.DS","work_id":"693b3417-94f2-4b3c-bc7a-1c9e4a49b711","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":2,"source":"pdf_text","source_observed_at":"2026-08-03T00:50:58.991713Z"},"links":{"cited_paper":"/paper/2607.08963","citing_paper":"/paper/2607.28703"},"observation_digest":"sha256:21d9d50cbe8d44d5df57f66237e78439de83a4b7ffb85723234f898626ac660c","observation_id":"4cf75a3c-a87a-414c-b41e-23a22a1c7c62","resolution":{"observed_at":"2026-08-03T00:54:13.989646Z","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:00.945246+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T16:39:00.945246+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.08963/citation-record","integrity":"/paper/2607.08963/integrity","json":"/paper/2607.08963/citation-record.json","paper":"/paper/2607.08963"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Improved accuracy for private con- tinual cardinality estimation in fully dynamic streams via matrix factorization","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":1,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:0c4c7d0e04d4cfec9c1a92d627b48843999caebdb030f8f1a4d6ec2ff2a1d331","observation_id":"c9456cfd-80aa-4213-8560-6cc34b5887db","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"A smooth binary mechanism for efficient private continual observation","venue":null,"work_id":null,"year":2023},"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":2,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:86fe51c549c40bb6d40bcd005b3f7f61bcd12c02ccc4b7013d473852627787a8","observation_id":"2d7772d0-d0db-4f6a-8030-058a8abf9d11","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Count on your elders: Laplace vs Gaussian noise","venue":null,"work_id":null,"year":2025},"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":3,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:51fbf691a310503929782e66cd7a4637c418fe2c539ab0a2160f80cfc7c1319c","observation_id":"ecd20ce8-8c8b-4b03-974d-70416ba77b00","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":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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Differentially private histograms under continual observation: Streaming selection into the unknown","venue":null,"work_id":null,"year":2022},"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":5,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:d3d59afd8fe22b9f0081db56e4348e0c3f39eaef84ef89d65335550bc41d3af4","observation_id":"747f88c3-9f2f-40eb-a429-b6393f89311b","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Private and continual release of statistics","venue":null,"work_id":null,"year":2011},"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":6,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:2c6749e091282ed0ce2821a400f29e357de17f512ee1d5cb3411cbc583e303d6","observation_id":"72238bd4-27af-4169-91b1-748c200ff05d","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Multi-epoch matrix factorization mechanisms for private machine learning","venue":null,"work_id":null,"year":2023},"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":7,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:4b5c14f55bdc4b692740d3f47215c2347769dc3f163cdd55148ed384d3e9d237","observation_id":"48af781a-5e3f-4b79-b19b-5d20e7a0705e","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Denisov, H","venue":null,"work_id":null,"year":2022},"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":8,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:a4498ef5090c804db89ee8700a49f71d8880a5dd73058956adb018ea4f765509","observation_id":"68a3a3ec-7ba1-40e6-825f-e52078916743","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"A general- ized binary tree mechanism for differentially private approximation of all-pair distances","venue":null,"work_id":null,"year":2025},"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":9,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:4de55b319c094dc68c037b4c4a47a85918f2e4811c08972f0c75e40c200a8510","observation_id":"2992990c-7ef0-434f-a01c-9ff9cfa8b3a5","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Efficient and near-optimal noise generation for streaming differential privacy","venue":null,"work_id":null,"year":2024},"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":10,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:06998f4e6230fd011f026714d29bf174305210c4a1832732c9ec773f633000ba","observation_id":"de233a29-ad18-4ffa-ab47-319d866c445a","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Calibrating noise to sen- sitivity in private data analysis","venue":null,"work_id":null,"year":2006},"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":11,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:e39222930576e8a78fe885e24ccffe04063ebb25415cfb7d42fd0a5a531a638c","observation_id":"cb28c00a-423d-4c82-ab24-810aee072b6d","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Differential privacy under continual observation","venue":null,"work_id":null,"year":2010},"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":12,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:dd94ab936a740410841861349bfbca77092145b2b0550a06841f88fb0674ecb7","observation_id":"2aba238e-63cd-4149-a93a-2ff06546ba6d","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"The power of factorization mechanisms in local and central differential privacy","venue":null,"work_id":null,"year":2020},"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":13,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:b2e4c7dcbd050ba4cefffa198dd7c69ff237bcf2fc206dcf4fcf9841023a3de3","observation_id":"30f596bb-7f9b-423b-a91e-9d547a5ae3a6","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Differentially private continual releases of streaming frequency moment estimations","venue":null,"work_id":null,"year":2023},"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":14,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:87527eb7d81024e6370b899479d2135c24924420d15146e6c934825f074c2dcb","observation_id":"d9dadf57-faee-42ed-857e-0ef28d00dc43","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Differentially private algorithms for graphs under continual observation","venue":null,"work_id":null,"year":2021},"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":15,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:a79976b5c824ceefc73a62ddf2a7111e0c3326b7fe8f27ef88fb545e0867f20b","observation_id":"059d5ca4-3354-427c-9101-e0e319483206","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Constant matters: Fine- grained complexity of differentially private continual observation using completely bounded norms","venue":null,"work_id":null,"year":2023},"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":16,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:4629bce531afc6232fd60a4f402bacc28ebcba0fc27485f9db6d1ed48b1c14d4","observation_id":"023a6c21-71cd-4743-9372-668ea48c0ab2","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":null,"venue":null,"work_id":null,"year":1982},"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":17,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:05136ed6a426e90502c052bca44cc45410846548709f0321ea264c8f9752eb53","observation_id":"38fc82d0-322c-4c52-b27d-ffc3b553236b","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Continual mean estimation under user-level privacy.Journal on Selected Areas in Information Theory, 2024","venue":null,"work_id":null,"year":2024},"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":18,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:e40b0caf5cd765f28d3c7e291d4df1bea3d52f8152e0f30e3b2aa2ade25345f9","observation_id":"1ec646ee-3f5a-49bb-a3d4-2e3c8647bd35","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Kalinin, and Jalaj Upadhyay","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":19,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:e4158b6babbfca9abd0ea559a42af706770690e1ad6da07344e2e4b1024c2615","observation_id":"bee18981-8e51-4aa8-9aeb-58398265e1fb","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Differentially private continual release of histograms and related queries","venue":null,"work_id":null,"year":2025},"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":20,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:a3dc68ac898b10fd980a95705026e2170e70f5c728b72540b938169733bdc5af","observation_id":"1e2163a9-076f-4da0-86a4-58064a1c33c7","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Improved differentially private continual observation using group algebra","venue":null,"work_id":null,"year":2025},"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":21,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:d70339b26a0db12e8f37309826d048d7b056a2193d3775bcb705fe484216f1ac","observation_id":"5909a854-3261-4eb3-9165-423440b8cf12","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Almost tight error bounds on differentially private continual counting","venue":null,"work_id":null,"year":2023},"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":22,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:e7e6cca90360d6c0f00d3cd48580c7e999b346b87a3abd892fce89a54536bd65","observation_id":"02e089f3-b1bc-412b-acec-21fb68887dfe","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Efficient use of differentially private binary trees","venue":null,"work_id":null,"year":2015},"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":23,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:2b15889d116a35c3e1a3e8f90dbb19bab7dc008cb0f4f1a59c5aad8c732c85e5","observation_id":"f61fb672-79c8-48ca-ada1-b6e19abf040c","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Differentially private quantiles with smaller error","venue":null,"work_id":null,"year":2025},"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":24,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:2b02a91d46d187d19482a543eae8743c833b100d4f3fee3ef5c5537d50bc318b","observation_id":"61306dae-1a53-426d-8424-267291944679","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Count- ing distinct elements in the turnstile model with differential privacy under continual observa- tion","venue":null,"work_id":null,"year":2023},"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":25,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:fa8789dc534e30b26e22e8004c32db9897ce9de50b5778288af985f496cdf38b","observation_id":"c37e6015-16ff-45f8-9611-23312bae9d28","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Practical and private (deep) learning without sampling or shuffling","venue":null,"work_id":null,"year":2021},"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":26,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:d2b09cb8e882a33637774dd95c572ab19d7bde0f15cfd4fc74385896af8d82b5","observation_id":"b231c6c5-4259-4d76-a092-cdd6b667d9c1","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Kalinin and Joel Daniel Andersson","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":27,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:8482cfce586810ccb419aa510c0e3d1814a378b92a115bf06b5066047e0548de","observation_id":"20b764a3-bc99-425b-abed-6619f7b1255d","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Kalinin and Christoph H","venue":null,"work_id":null,"year":2024},"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":28,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:599c0682b82a58028fccf9633e127c2d399e2878883a665dd25ec2af9514f31f","observation_id":"6900af8f-f347-4c43-80bb-fc5f6188fd18","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":"2601.22334","last_updated":"2026-05-11T20:34:37Z","snapshot_observed_at":"2026-07-31T17:40:37.681642Z","submitted_at":"2026-01-29T21:21:34Z","title":"DP-{\\lambda}CGD: Efficient Noise Correlation for Differentially Private Model Training","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.22334","snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Kalinin, Ryan McKenna, Rasmus Pagh, and Christoph H Lampert","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":29,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"cited_paper":"/paper/2601.22334","citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:3ed438813ddcc0bd264f7bca4591be0f981c77d67426f962063731186118f11d","observation_id":"313618ed-ee2e-46e0-b0da-6f629faf38f2","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Kalinin, Ryan McKenna, Jalaj Upadhyay, and Christoph H Lampert","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":30,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:42281c8238ba32195b75593a0948700aee131b1f39710509da5030a2a56731c1","observation_id":"c6719d57-f564-4100-a954-e1b250ce7f61","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Kalinin, Aki Rehn, Joel Daniel Andersson, Antti Honkela, and Christoph H Lampert","venue":null,"work_id":null,"year":null},"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":31,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:d6769f04ccab999f6e87355d090a6e9c9769b0c172c4acb6857296f5e614b695","observation_id":"751d2c29-e039-464a-b6e5-dbc17439dd9a","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":"2605.18379","last_updated":"2026-05-18T13:25:56Z","snapshot_observed_at":"2026-07-06T23:29:14.916114Z","submitted_at":"2026-05-18T13:25:56Z","title":"Beyond Square Roots: Explicit Memory-Efficient Factorization for Multi-Epoch Private Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.18379","snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":null,"venue":null,"work_id":null,"year":null},"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":32,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"cited_paper":"/paper/2605.18379","citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:ac4cd81be1afde7ea2c6036aef487b56baf406d8483323c209bd86601de26c7c","observation_id":"47e23def-413e-4c17-99e6-286d54225859","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":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Adam: A method for stochastic optimization, 2014","venue":null,"work_id":null,"year":2014},"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":33,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:e13b148f0dbb748a64b500ff78e33133ce35291ae451e9cf1096cade48dbed22","observation_id":"d42b0f92-cecb-4caa-ba55-4951cae675dc","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Kwapie´ n and A","venue":null,"work_id":null,"year":1970},"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":34,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:60eedf7e9dda3c706faec8b99f05433ab04c7a5d986aca794453e1ae38ecf441","observation_id":"eaa398ed-9376-4953-8e6c-e49873dd282d","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Making old things new: a uni- fied algorithm for differentially private clustering","venue":null,"work_id":null,"year":2024},"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":35,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:c2a82342bc2f4c8aae2c7a4d78978666e5776ec7a1e3aec0d476315d87046064","observation_id":"e5715513-aa80-4499-871a-a46aed47d537","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"The ma- trix mechanism: Optimizing linear counting queries under Differential Privacy.International Conference on Very Large Data Bases (VLDB), 2015","venue":null,"work_id":null,"year":2015},"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":36,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:9fc44c78966f06e510af8613d8e2d3649493a78e89d17e0a1e4822677d3208e8","observation_id":"7461ff39-979e-4f16-8756-9a137483cf10","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"On the limited memory BFGS method for large scale opti- mization.Mathematical programming, 1989","venue":null,"work_id":null,"year":1989},"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":37,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:f5f7de5be26ac7f470ca38392e76ee58cca6eb849eb4e6df4f17e020093a8fa3","observation_id":"065a8c68-8c92-434d-bcf1-34062154456d","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Factorization norms and hereditary discrepancy.International Mathematics Research Notices, 2020","venue":null,"work_id":null,"year":2020},"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":38,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:0fd8b3fac9904dd2ede8dd7ec35bb71076166b670f132d6b37a6dd16b1004552","observation_id":"f85543c4-4693-4640-96ff-a4d02040aaec","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Smith, Mateusz Paprocki, Ondˇ rej ˇCert´ ık, Sergey B","venue":null,"work_id":null,"year":2017},"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":39,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:1f054b0e58bcf1ae26d758f54aae2e39958c5510dcbedf57453df691ab659175","observation_id":"25240bb5-4d8d-49c7-a48f-e241bf368c89","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":"2506.08201","last_updated":"2025-06-09T20:21:50Z","snapshot_observed_at":"2026-08-08T10:56:40.800031Z","submitted_at":"2025-06-09T20:21:50Z","title":"Correlated Noise Mechanisms for Differentially Private Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.08201","snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Correlated noise mechanisms for differentially private learning, 2025","venue":null,"work_id":null,"year":2025},"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":40,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"cited_paper":"/paper/2506.08201","citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:278ad5a0079681edcf149158c0c16ca7108c58ab1cc7975d8a5802037f50df98","observation_id":"6acfbde3-2641-4dc5-8722-0a571b6f71a4","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Understanding hierarchical methods for differentially private histograms.Proc","venue":null,"work_id":null,"year":2013},"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":41,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:aa5c76d3fbc28a26968be8b979727311f72ec0363a5b85f7382a41b76557ecae","observation_id":"29ba1904-1dba-48f4-9cab-35858ac7527d","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Fully dynamic graph algorithms with edge differential privacy.Proceedings of the ACM on Management of Data (PACMMOD), 2024","venue":null,"work_id":null,"year":2024},"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":42,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:879179d08176ec94956587e18275bb41ac65716dc969362901143cac54c2732c","observation_id":"52a98f1e-f3cf-463b-807b-1490a07f9c35","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Sublinear space private algorithms under the sliding window model","venue":null,"work_id":null,"year":2019},"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":43,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:0748b6d4cb661357e05b03795dc459422a0efd6eb77b75f78e1800ab96f46e08","observation_id":"5f8715f6-530e-4901-88e1-ca0c891c11d1","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"round” in the sensen= (2k+1)p−1 2 for somep, then the theorem holds. The remainder of the proof is a careful analysis of what happens fornthat falls in between “round","venue":null,"work_id":null,"year":2024},"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":44,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:084c008371ae7ef3d69a86fb9fe8c492293b75d7a72c517ce916caebf10cb39c","observation_id":"ca7c1086-9a88-45e4-bcaa-ebeae19679b5","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Then|x j|=∥x∥ ∞","venue":null,"work_id":null,"year":null},"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":45,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:d58e0c3539d8607fd3998c4f8c6778d07012b38e54ea8f69e370b6caf312d5b7","observation_id":"f5f3a9e8-9d43-4442-9189-1e374aef6177","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":null,"venue":null,"work_id":null,"year":null},"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":46,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:d9c1cb7719163dc6a943304ef1e2ade8b8f1b810b39eb5e7a4482ff3237e41ec","observation_id":"9f71fdf5-6351-4425-92a8-a4399ae51d79","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":null,"venue":null,"work_id":null,"year":null},"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":47,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:f7e1958a6f6441dae24175cec46151a26af2f9b4c45cbfdbccec28b7d4624f19","observation_id":"18f12bb2-8011-4c34-9bbf-2f8165b2e5c4","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Then, sincea≤1 and−e≤1,D=af+b(−e)≤f+b","venue":null,"work_id":null,"year":null},"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":48,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:9242aa86ab4c56299e19741277eacb586f8e87fe37f887a8d7fa9714b34a2cae","observation_id":"cece2c20-3e8f-4440-a975-104079f49f08","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"LetJ= 0 1 −1 0 , so that det(x, y) =xJ y","venue":null,"work_id":null,"year":null},"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":49,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:a04f387fc94bc9a58638b18ddfe3469d2abf2c71af0d203186527ead44569f21","observation_id":"59c383cc-2866-4b15-ad21-ca4a5f8d4845","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Otherwise,∥y∥ 2 2 = 2/3, and then∥x−y∥ 2 2 = 3 2 det(x, y)2, so Ψ(x, y) = 2/3>0","venue":null,"work_id":null,"year":null},"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":50,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:adf271ebff987516ef5881b0299eb2cc10a7f6d676aedc1a353e54eaed8caae6","observation_id":"eecd48d6-fa60-4bb6-8bb4-aa544ea4fa9e","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Fixx, and suppose thatyis an interior minimizer","venue":null,"work_id":null,"year":null},"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":51,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:0085eb4af3cf55b739d91e469e39084f454e6a47207091f7baaba77a252a8488","observation_id":"40d252d6-5c6e-4a48-92b3-465ade7b0438","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Otherwise,∥x∥ 2 2 = 4/3, andy= 1 2 x+ 3 4 det(x, y)J ′x","venue":null,"work_id":null,"year":null},"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":52,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:7290dc8a9acb8e4828ea816f70e39e0248e90689199a6fe8b05b675b7fd69a8b","observation_id":"8851448c-6769-491a-befd-0e8ca08ccc53","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T05:28:27.662569Z","title":"Since Ψ is invariant under the symmetries of the square, we may assume thaty= (t,1), where−1≤t≤1","venue":null,"work_id":null,"year":null},"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":53,"source":"pdf_text","source_observed_at":"2026-07-13T05:28:27.662569Z"},"links":{"citing_paper":"/paper/2607.08963"},"observation_digest":"sha256:4ea5497c33da15cde80bf3942060818b057a9f29bfb0239ea907a779dba53e88","observation_id":"1fd73ca9-840c-4d8f-8e7d-4f9e3f2cdedd","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"}}],"paper":{"arxiv_id":"2607.08963","last_updated":"2026-07-09T21:54:56Z","latest_version":1,"primary_category":"cs.DS","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"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":53,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":53},"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 11 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 1 inbound Pith citation observation for arXiv:2607.08963."}