{"as_of":"2026-08-05T14:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e87131d559eb7098cb10aeb425634c9120dce338ae783ac999b04695ec2a6f42","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-12T01:37:10.814358Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T04:14:37.466656Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.08358","snapshot_observed_at":"2026-08-01T10:08:04.334259Z","title":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing , series =","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.20418","last_updated":"2026-08-03T07:42:51Z","snapshot_observed_at":"2026-08-05T13:27:26.893350Z","submitted_at":"2026-07-22T17:54:46Z","title":"Pure-DP Statistical Query Release at the Conjectured Square-Root Rate","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-01T10:08:04.334259Z"},"links":{"cited_paper":"/paper/2605.08358","citing_paper":"/paper/2607.20418"},"observation_digest":"sha256:0f29eb8a326eb5756c9bed59c2a5c97c6ec82ef293b44e4919aa20818231ef83","observation_id":"ab870245-ab71-405a-93c2-53500b4e973d","resolution":{"observed_at":"2026-08-01T10:08:04.334259Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.08358","snapshot_observed_at":"2026-08-04T04:14:37.466656Z","title":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing , series =","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.20418","last_updated":"2026-08-03T07:42:51Z","snapshot_observed_at":"2026-08-05T13:27:26.893350Z","submitted_at":"2026-07-22T17:54:46Z","title":"Pure-DP Statistical Query Release at the Conjectured Square-Root Rate","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-04T04:14:37.466656Z"},"links":{"cited_paper":"/paper/2605.08358","citing_paper":"/paper/2607.20418"},"observation_digest":"sha256:0d225da534e76169abf8c4d6a287f31c7185a752ee4fa060001b0461ad7c1142","observation_id":"b71397e7-527e-45ea-b3dc-d87ebb211515","resolution":{"observed_at":"2026-08-04T04:14:37.466656Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2605.08358/citation-record","integrity":"/paper/2605.08358/integrity","json":"/paper/2605.08358/citation-record.json","paper":"/paper/2605.08358"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Liu, and Mehtaab Sawhney","venue":null,"work_id":"75877d04-bec4-4657-8443-6ce864e4390c","year":2021},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:f0e67d25ca9417540329fff44d704b1865470717624866981dff0805041f4822","observation_id":"3f98434c-b6f1-4e94-9306-83267a52e227","resolution":{"observed_at":"2026-05-14T06:28:59.276008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Balancing vectors and G aussian measures of n -dimensional convex bodies","venue":null,"work_id":"b2d4d1f9-ccc1-48fa-87a9-3487655ffe6c","year":1998},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:68f38a56a9f5f8cc895fb782b11742ea3e2cbcb679090377f9cfd82012049089","observation_id":"2553c211-4db1-4bbc-abed-87a282be6b51","resolution":{"observed_at":"2026-05-14T06:28:59.303769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On a class of balancing games","venue":null,"work_id":"381a9dd0-84cf-4fcf-8a2a-529118535fe1","year":1979},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:44dabb158f01170e42c2700355efae8a943fcfac7ae3722f29637cd4a6e316e3","observation_id":"f71ab33a-c623-4a6b-b952-4b977fa771de","resolution":{"observed_at":"2026-05-14T06:28:59.299183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The G ram- S chmidt walk: a cure for the B anaszczyk blues","venue":null,"work_id":"89f0cc0e-204e-4097-85db-ddb9cb5b3d91","year":2019},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:421694ce346e3ea7d79846f152d3b305d33b91dbc71be6273fa4fd03ffdb783c","observation_id":"b7bd0d2e-4204-4e8e-81d0-fc5b09697021","resolution":{"observed_at":"2026-05-14T06:28:59.307982Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Practical privacy: the SuLQ framework","venue":null,"work_id":"1f49b0a4-5202-4f8f-857e-5525ad2cef0e","year":2005},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:8702a51ca916a691f829d9312129cf43feb24bfccfc41afc8af70e5217eefb3e","observation_id":"f0040d58-b507-474d-b32f-9674ad8cb88c","resolution":{"observed_at":"2026-05-14T06:28:59.317874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Matrix analysis , volume 169 of Graduate Texts in Mathematics","venue":null,"work_id":"5aa5d8bb-83f1-4ab6-a965-072c265d0116","year":1997},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:5ba6a06df112080edce8ca0463c5fda460710fdae3de51f3eb80dfb4d40c3e40","observation_id":"be2e3e44-6647-4db7-8f68-d47de1c6af78","resolution":{"observed_at":"2026-05-14T06:28:59.294807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Decoupling via affine spectral-independence: Beck-fiala and koml\\'os bounds beyond banaszczyk","venue":null,"work_id":"504cc91b-c06f-4b0e-8792-1c4c3de6538c","year":2025},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:e29f4f7bdfc32281e85a235199e4db3d3ead56e1bfe3b1906f15c0e85b01928e","observation_id":"394132c8-e6d6-4549-8219-14dd1b27381b","resolution":{"observed_at":"2026-05-14T06:28:59.280814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The design of competitive online algorithms via a primal-dual approach","venue":null,"work_id":"3e3bdb5f-d466-47db-8759-deff926e73a7","year":2007},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:325252e2bf68cda41436ec081503af1dfedb048ad50b4fa3f461ef277c13724a","observation_id":"c1a9bd5f-3e2e-4450-a07f-2369a7981eee","resolution":{"observed_at":"2026-05-14T06:28:59.252509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Decomposable searching problems i","venue":null,"work_id":"971c7a10-5eee-4dbe-81c1-8f16e876eb3c","year":1980},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:077955a73da987933a52584332fc47e24526d1106c1833007f5914e94049d0d8","observation_id":"0293c69b-1d64-4079-9fb0-d08fff51d8b1","resolution":{"observed_at":"2026-05-14T06:28:59.290307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"73f2e066-2c9e-40dd-8593-3ca074e7675e","year":2020},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:4c7e766345bc8ba3f048eb371961ccb68dd8b4f95150c419cd98503c4c003f7c","observation_id":"a43f78f0-ecf5-4c01-9e1f-089d6f57c7ca","resolution":{"observed_at":"2026-05-14T06:28:59.263056Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Make up your mind: The price of online queries in differential privacy","venue":null,"work_id":"9f887a55-17ac-43db-85f5-0477f9148617","year":2017},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:c71bfaa0cf07b03fcc5967a814b1d90181e2629ecd65492a53fb0bf0c3c07304","observation_id":"63761c39-06a5-4270-8174-c647d561b050","resolution":{"observed_at":"2026-05-14T06:28:59.267175Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fingerprinting codes and the price of approximate differential privacy","venue":null,"work_id":"57d3abcc-64e4-402d-a382-ac3acbf8f2e7","year":2014},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:407e9be67d2abe9dcdb670406a842b7b3e8e24a0134dab02dac7ae07b35dc2d7","observation_id":"b214dbc4-22e9-4369-999d-2eaa4e31ced5","resolution":{"observed_at":"2026-05-14T06:28:59.256475Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tight hardness results for minimizing discrepancy","venue":null,"work_id":"299d2a03-ff00-4d1b-972e-d77d09eaa46f","year":2011},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:57805c2749e8807937cbfde14d0c6c25cc6245d735ffadb228cf502cbc5f661c","observation_id":"d4c40ce0-d82e-43a3-8b3d-216a67af7480","resolution":{"observed_at":"2026-05-14T06:28:59.285674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Private and continual release of statistics","venue":null,"work_id":"cd6f8456-2f44-477a-a434-10b7c4bf4d3e","year":2011},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:234685ee12fc15ad3c9ba62cc90027da4b0a535cbaab814e57315ab11e75679b","observation_id":"29715c9f-1449-4014-b11c-93d7514a9fd2","resolution":{"observed_at":"2026-05-14T06:28:59.259768Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Towards a constructive version of B anaszczyk's vector balancing theorem","venue":null,"work_id":"c7140811-8988-465a-85db-51ec22978f42","year":2019},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:8593e9d27059a695c22a341eef53c55c8ca0df8ac8f744839d1b41133374c7bb","observation_id":"f80aec93-bf65-4185-8eac-e7d70c9e6aa2","resolution":{"observed_at":"2026-05-14T06:28:59.271528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Our data, ourselves: Privacy via distributed noise generation","venue":null,"work_id":"f904b805-d436-47a8-9468-11193434da19","year":2006},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:67cce7c434ab3144a4e9ea254ff8efb046d8df4ada71a4b469fe6252c776bf0c","observation_id":"46fb9791-ce57-4794-b168-93d2fcfc3b5c","resolution":{"observed_at":"2026-05-14T06:28:59.313033Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Dajani, Amy D","venue":null,"work_id":"a39ebb62-0c8a-4d88-bdb3-6c151ec8f764","year":2017},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:3d5d0533b3c065957abcc5bc02c95fbc716cd44cfc288529f4fc2ef65913b14f","observation_id":"21d30ef3-5cfa-4fd8-ac13-12647b4a6dbc","resolution":{"observed_at":"2026-05-14T06:28:59.322811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Calibrating noise to sensitivity in private data analysis","venue":null,"work_id":"c0a9cdc4-fca8-4fc1-ba71-d07b50b1cef0","year":2006},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:84c3b0cdce3dd27c1c5474b5bcaaed94b87ce78a314ebd50c9b1929b233bc771","observation_id":"a2977233-8b4c-431b-bb2e-eb373c4bc294","resolution":{"observed_at":"2026-05-14T06:28:59.432362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Revealing information while preserving privacy","venue":null,"work_id":"f4c2d95f-8246-4bff-805f-008ac0f294c2","year":2003},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:9b1de20472092e92d51de1ec853cd6b12f8642ae831411acbe2caeaa2d3470ff","observation_id":"ee4b8cdb-5538-4eb0-8094-63327c69a57d","resolution":{"observed_at":"2026-05-14T06:28:59.410724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Privacy-preserving datamining on vertically partitioned databases","venue":null,"work_id":"d6e6137e-8524-4868-b72e-d4bfc29273e8","year":2004},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:d36af369970f0799dc6c0a4e46f4fa37f80bc0926707b45196ad423be3b0503b","observation_id":"c0705c2d-bdc4-4795-9425-ec46bfc67b30","resolution":{"observed_at":"2026-05-14T06:28:59.415493Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Rothblum","venue":null,"work_id":"6389841a-3ee3-45cf-8710-859f98e5fce6","year":2010},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:525b0a30559b05e351cb2fccded29bbd3880bd39d4e5c1ae9fef925b387c3acb","observation_id":"69cf95eb-e6ec-4782-8061-c32e72032d4b","resolution":{"observed_at":"2026-05-14T06:28:59.419649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Rothblum, and Salil P","venue":null,"work_id":"f4daedc8-c0d7-49e1-a923-f7a1d6e5d9df","year":2009},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:5fe6a77077e46de6febb13b74bd8c376a64efa4db230f679bbc142c3656770f8","observation_id":"212fc99c-287f-42cd-84dc-5aae0a6878cb","resolution":{"observed_at":"2026-05-14T06:28:59.393414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The algorithmic foundations of differential privacy","venue":null,"work_id":"2d68c547-cdec-4535-b0ff-cb9485ab2f26","year":2014},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:c116ec61ce4fb44a82ae90909764b55b1dd09d18e517f6db46fc3a240c18fdda","observation_id":"545bc01c-275c-4347-8ddf-1c3d2216278b","resolution":{"observed_at":"2026-05-14T06:28:59.427965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Rothblum, and Salil P","venue":null,"work_id":"5efcba92-dcb6-4dd7-a861-6c278b7e123f","year":2010},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:eb7ef230e674a549b20d6977ed3c8b1e163d179482316330f95a37b068148550","observation_id":"3208618f-1662-401c-88c0-49ede24de62b","resolution":{"observed_at":"2026-05-14T06:28:59.423736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"New efficient attacks on statistical disclosure control mechanisms","venue":null,"work_id":"a37e0c0d-5483-4eb4-9f85-35a58d50aa1f","year":2008},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:1b2526672509a7e01a7b1e79d335697e2b39344836654b04e1148e179838a165","observation_id":"4b09e14d-2c2e-40cc-aa18-f4aa1c508f5d","resolution":{"observed_at":"2026-05-14T06:28:59.389376Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Online semidefinite programming","venue":null,"work_id":"4e8fa9f2-efaf-4987-a765-7b2a58de9eac","year":2016},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:b2c3d292afb2ea7396036cbc967ed8122860dbc78f9c27295277d96a8aebb703","observation_id":"9637e4d0-61f8-49e3-9016-83341e9423c8","resolution":{"observed_at":"2026-05-14T06:28:59.397738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"699368cf-54ce-4880-ac81-87e68fabb35d","year":2020},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:00db79b2e3781cc5d79ec3b845c598bd42e0bd8bbf88927e343ec067ae9cb1b9","observation_id":"d0cd7f80-6627-4cbc-b75d-361da360398e","resolution":{"observed_at":"2026-05-14T06:28:59.453057Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Competitive online algorithms for resource allocation over the positive semidefinite cone","venue":null,"work_id":"1a9669fa-7155-4f4f-846b-4269cee9b37e","year":2018},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:7b1419fb488d4b0fc17e84fa91b76b834bf4d58c846f661b3c682e2b2f238d07","observation_id":"52af0e2d-f5a3-45bc-8de5-585d3ac0b0ed","resolution":{"observed_at":"2026-05-14T06:28:59.449771Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Iterative constructions and private data release","venue":null,"work_id":"418a3148-9d5a-4d68-9a40-bb4907363c7a","year":2012},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:3581f9bc4b4c2c32ab6a0226b0266ff02f877a524a46099eb235c14e5c4d2f94","observation_id":"870c45eb-af29-4408-886b-afc5207878b3","resolution":{"observed_at":"2026-05-14T06:28:59.379972Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Sphere packing numbers for subsets of the B oolean n -cube with bounded V apnik- C hervonenkis dimension","venue":null,"work_id":"377ec171-998c-4da0-9ef8-96cbd8d588fe","year":1995},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:60fe19726d0ff1eb1cc4719375d4f492263913000dbe82bf2c5762dc5484ac10","observation_id":"3221b53f-9c4a-4a18-99cd-5dc21820c8e6","resolution":{"observed_at":"2026-05-14T06:28:59.444938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A simple and practical algorithm for differentially private data release","venue":null,"work_id":"635091c0-fc09-4dff-ab6e-70b5404a7758","year":2012},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:fd7575c35d2badc634899169b798f63b9a33f34397b4e305c5fb97574ccf4c47","observation_id":"0e9af11a-3636-4079-9289-772957f35654","resolution":{"observed_at":"2026-05-14T06:28:59.457230Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A multiplicative weights mechanism for privacy-preserving data analysis","venue":null,"work_id":"37183357-82d5-4370-8327-1a6eca45047b","year":2014},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:fa51bfcec442f62d9b8782a0e4d38afc2ec8c4c081fe0f680dcb3555a6d92801","observation_id":"42d8b458-484e-4561-a8eb-032cea921418","resolution":{"observed_at":"2026-05-14T06:28:59.375180Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal online discrepancy minimization","venue":null,"work_id":"9ac1b932-2aa9-4de8-886a-6d3487be8a4c","year":2024},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:997bc27c8433f454274cc4fd336014afdc84c334486e8e2e55961d744ce438ca","observation_id":"a09f359e-ff4c-45ea-a0f2-2475d19e3274","resolution":{"observed_at":"2026-05-14T06:28:59.384516Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Better gaussian mechanism using correlated noise","venue":null,"work_id":"7d7b00ff-c59e-4d53-bb85-671fa7123d86","year":2025},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:a85966a4cd808e998816993c51c9597aca8a5b8ee3abb3b199bf0933288a37fb","observation_id":"0b7b09fc-cf2b-491b-94f7-626a84fa77ad","resolution":{"observed_at":"2026-05-14T06:28:59.401768Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimizing linear counting queries under differential privacy","venue":null,"work_id":"588f2ce6-2255-47ef-8162-e2191af3aa23","year":2010},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:a78e7690b6c1da0ba2360e2b377c66f87f5fc31e589389d6782ed8333fd49e89","observation_id":"fc4249af-056c-4911-b6ad-a38879f1d15a","resolution":{"observed_at":"2026-05-14T06:28:59.405976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Complexity measures of sign matrices","venue":null,"work_id":"c1e91de9-024c-48fb-8a42-f0b7e0f474ae","year":2007},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:58d6852d046f3a914796ee4731d01910875ecb4d23f3e15a81312e88af859f3f","observation_id":"eb5933d3-a47b-441c-9752-ab9b7587fe0f","resolution":{"observed_at":"2026-05-14T06:28:59.436823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Discrepancy of set-systems and matrices","venue":null,"work_id":"723d8672-ee7e-4f91-8662-bbcb1f2581e2","year":1986},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:8e0ee5743349427ec84978a179a46b9e6903558d3d67e6755ad11898305b6c46","observation_id":"6819a66f-fbf1-422b-9dcc-35f9431a96b5","resolution":{"observed_at":"2026-05-14T06:28:59.440563Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Better differentially private approximate histograms and heavy hitters using the misra-gries sketch","venue":null,"work_id":"09ec0999-67e6-4b7c-af56-77eac4fb1c33","year":2024},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:1e07aa5014adbb64ba59fa9e40d78a48bcc8ef2b206e12d9f493e756668770db","observation_id":"a12b12ca-fcd2-4c86-b519-dced14ecc8fc","resolution":{"observed_at":"2026-05-14T06:28:59.367355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimizing error of high-dimensional statistical queries under differential privacy","venue":null,"work_id":"9e9e7568-ddaf-4fb2-af1d-a38b3458ace5","year":2023},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:676a00a3892000a69f87690ddbce9e598fbf7a47dacaf651b8b0761e6cf66892","observation_id":"ec88b3ce-99fa-4236-861d-d55a9ef9d3c5","resolution":{"observed_at":"2026-05-14T06:28:59.355231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal private halfspace counting via discrepancy","venue":null,"work_id":"9d15016e-e154-403d-a905-afcef5e58b8a","year":2012},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:9839b2a5b99491a03888d8bf38422b3219eedcacbc89a73e175eb7fc806cda8f","observation_id":"bace4b06-e3e3-4490-a227-293e62aadee0","resolution":{"observed_at":"2026-05-14T06:28:59.359105Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Factorization norms and hereditary discrepancy","venue":null,"work_id":"14e4370b-1bc0-49ea-84d7-9d70447452c5","year":2020},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:b1141abc87aa960a87084ff4c59dd0c1510673233821990de9be82f35d3cf2b2","observation_id":"d34dea4e-ac98-45d2-a8a7-6f2efc42d309","resolution":{"observed_at":"2026-05-14T06:28:59.362768Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Matou sek","venue":null,"work_id":"b3727ca4-b466-410f-9b30-787343ab4805","year":1995},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:b918af3b24ff57b0fc52f118b83f95c7e174089671e23513fd8ead86b041e24c","observation_id":"259a729b-69c3-47f7-985f-ba828ab744d2","resolution":{"observed_at":"2026-05-14T06:28:59.371332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"General gaussian noise mechanisms and their optimality for unbiased mean estimation","venue":null,"work_id":"e237eb50-001b-4ff4-981f-942999bc7866","year":2024},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:11a22b3ce824579dcfb3713006f0b9c636719621aac6c4af9be2f33f18495638","observation_id":"12b5ef6b-7f2e-4904-aec3-9ad3583787f6","resolution":{"observed_at":"2026-05-14T06:28:59.340500Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The geometry of differential privacy: The small database and approximate cases","venue":null,"work_id":"67474157-bcb9-4af8-94c4-5ebe63bc4376","year":2016},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:d1b0ba1ac30168a25babcbbca38a20917d57e472d30122db1c624762d8eecd09","observation_id":"65226836-34de-4986-9808-c9fa600ea863","resolution":{"observed_at":"2026-05-14T06:28:59.345338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Interactive privacy via the median mechanism","venue":null,"work_id":"50049952-7531-41a4-9637-f8ea6db192d6","year":2010},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:126b5004503bb1b24b4cd7da1fc12fb618c9afe6326d84f57ecf11a828d326b3","observation_id":"ba3648c0-f59d-47b1-8d8e-c04a39ca2696","resolution":{"observed_at":"2026-05-14T06:28:59.350794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Balancing games","venue":null,"work_id":"6316d313-1ca0-4eaa-9dfb-8faaf9f2378a","year":1977},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:00b96558f4136397a3d5e19d65476ad70aca7ebf7b31ab09575398c385f70d90","observation_id":"4441a764-5f72-4999-9608-9dba68346e55","resolution":{"observed_at":"2026-05-14T06:28:59.331237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"High-dimensional probability , volume 47 of Cambridge Series in Statistical and Probabilistic Mathematics","venue":null,"work_id":"8f249b56-42a2-41df-b5bf-131ddd91d401","year":2018},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:049d6a107864cddce9afd622ac81b7cd085735167647c3c15e37fdc0a039cf82","observation_id":"7036780f-9fcb-4fac-b340-61bf6c6213d5","resolution":{"observed_at":"2026-05-14T06:28:59.335915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Differential privacy via wavelet transforms","venue":null,"work_id":"f54b7593-9c62-40b5-aab5-004933a477f8","year":2011},"citing_paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-05-12T01:37:10.814358Z"},"links":{"citing_paper":"/paper/2605.08358"},"observation_digest":"sha256:285e14446a6ed627e9bf17e203337482158114a32c9dedac52c2ecc52709d91c","observation_id":"946e8c86-edc2-44e5-9fce-ce60c352876f","resolution":{"observed_at":"2026-05-14T06:28:59.327174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.08358","last_updated":"2026-05-08T18:12:39Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-02T20:48:13.216656Z","submitted_at":"2026-05-08T18:12:39Z","title":"Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":46},"total_outbound_references":48},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 48 of 48 outbound references and 2 inbound Pith citation observations for arXiv:2605.08358."}