{"as_of":"2026-08-21T14:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ee3d17d1acbed57a07975eca5e67a3725ae567d6c28da76e4929de395d1dd6c5","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:10:16.529042Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-22T03:30:59.503815Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.07152","last_updated":"2026-08-15T05:54:37Z","snapshot_observed_at":"2026-08-20T23:08:55.524823Z","submitted_at":"2023-03-13T14:26:27Z","title":"Score Attack: A Lower Bound Technique for Optimal Differentially Private Learning","version":3},"cited_work":{"arxiv_id":"2303.07152","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.07152","snapshot_observed_at":"2026-08-18T01:11:43.156819Z","title":"arXiv preprint arXiv:2303.07152 , year =","venue":null,"work_id":"4ae0099b-0a66-4c7e-a248-671c7753ba48","year":2025},"citing_paper":{"arxiv_id":"2505.16329","last_updated":"2026-04-26T14:33:57Z","snapshot_observed_at":"2026-08-21T08:47:42.325328Z","submitted_at":"2025-05-22T07:34:27Z","title":"High-Dimensional Private Linear Regression with Optimal Rates","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-22T02:50:09.196457Z"},"links":{"cited_paper":"/paper/2303.07152","citing_paper":"/paper/2505.16329"},"observation_digest":"sha256:f12ceabf7adb5e672a113e7bf7b723d00f4899a0acabf6247e1da67af08e7bbd","observation_id":"2ee9c5d9-240c-4168-8804-eb90e249943c","resolution":{"observed_at":"2026-08-18T01:11:43.156819Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.07152","last_updated":"2026-08-15T05:54:37Z","snapshot_observed_at":"2026-08-20T23:08:55.524823Z","submitted_at":"2023-03-13T14:26:27Z","title":"Score Attack: A Lower Bound Technique for Optimal Differentially Private Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.07152","snapshot_observed_at":"2026-08-06T18:10:16.529042Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.09388","last_updated":"2025-07-12T20:09:28Z","snapshot_observed_at":"2026-08-21T08:48:16.264049Z","submitted_at":"2025-07-12T20:09:28Z","title":"Optimal Differentially Private Ranking from Pairwise Comparisons","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T18:10:16.529042Z"},"links":{"cited_paper":"/paper/2303.07152","citing_paper":"/paper/2507.09388"},"observation_digest":"sha256:1146655f8ef3dbc52313ade9b5361f9b470dbd4508e1841ab8239f35ebad0e5d","observation_id":"dab0308b-ca91-472e-b542-16b50daba257","resolution":{"observed_at":"2026-08-06T18:10:16.529042Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.07152","last_updated":"2026-08-15T05:54:37Z","snapshot_observed_at":"2026-08-20T23:08:55.524823Z","submitted_at":"2023-03-13T14:26:27Z","title":"Score Attack: A Lower Bound Technique for Optimal Differentially Private Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.07152","snapshot_observed_at":"2026-08-06T14:56:03.930247Z","title":"Score attack: A lower bound technique for optimal differentially private learning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.17895","last_updated":"2025-07-23T19:46:08Z","snapshot_observed_at":"2026-08-20T06:24:31.499824Z","submitted_at":"2025-07-23T19:46:08Z","title":"Lower Bounds for Public-Private Learning under Distribution Shift","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T14:56:03.930247Z"},"links":{"cited_paper":"/paper/2303.07152","citing_paper":"/paper/2507.17895"},"observation_digest":"sha256:c9687809cd0aa295fd7b80c132da6f4af8e114281e1096c52b4a4f67ea388181","observation_id":"95dec74d-85cd-47a6-83ae-48fa107dc6db","resolution":{"observed_at":"2026-08-06T14:56:03.930247Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.07152","last_updated":"2026-08-15T05:54:37Z","snapshot_observed_at":"2026-08-20T23:08:55.524823Z","submitted_at":"2023-03-13T14:26:27Z","title":"Score Attack: A Lower Bound Technique for Optimal Differentially Private Learning","version":3},"cited_work":{"arxiv_id":"2303.07152","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.07152","snapshot_observed_at":"2026-08-18T01:11:43.156819Z","title":"arXiv preprint arXiv:2303.07152 , year =","venue":null,"work_id":"4ae0099b-0a66-4c7e-a248-671c7753ba48","year":2025},"citing_paper":{"arxiv_id":"2605.19813","last_updated":"2026-07-08T09:10:31Z","snapshot_observed_at":"2026-08-15T20:40:27.836880Z","submitted_at":"2026-05-19T13:09:58Z","title":"A Van Trees Lower Bound for Fully Interactive Differentially Private Federated Learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-20T07:15:29.444050Z"},"links":{"cited_paper":"/paper/2303.07152","citing_paper":"/paper/2605.19813"},"observation_digest":"sha256:50115ba6b5ae8926fe91cf931bb32de657460309670d13b7d155f67a9ea49755","observation_id":"c07b202a-4ffc-496d-b598-5078601f9bc4","resolution":{"observed_at":"2026-08-18T01:11:43.156819Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.07152","last_updated":"2026-08-15T05:54:37Z","snapshot_observed_at":"2026-08-20T23:08:55.524823Z","submitted_at":"2023-03-13T14:26:27Z","title":"Score Attack: A Lower Bound Technique for Optimal Differentially Private Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.07152","snapshot_observed_at":"2026-07-12T16:29:28.243675Z","title":"Tony Cai, Yichen Wang, and Linjun Zhang","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.19813","last_updated":"2026-07-08T09:10:31Z","snapshot_observed_at":"2026-08-15T20:40:27.836880Z","submitted_at":"2026-05-19T13:09:58Z","title":"A Van Trees Lower Bound for Fully Interactive Differentially Private Federated Learning","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-12T16:29:28.243675Z"},"links":{"cited_paper":"/paper/2303.07152","citing_paper":"/paper/2605.19813"},"observation_digest":"sha256:10497d31c6698ab55ba9f8e1548ae35c13240060135a27398cbd361995a29b67","observation_id":"1056ad40-0cdb-4e9f-aea2-f2cd0018b716","resolution":{"observed_at":"2026-07-12T16:29:28.243675Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.07152","last_updated":"2026-08-15T05:54:37Z","snapshot_observed_at":"2026-08-20T23:08:55.524823Z","submitted_at":"2023-03-13T14:26:27Z","title":"Score Attack: A Lower Bound Technique for Optimal Differentially Private Learning","version":3},"cited_work":{"arxiv_id":"2303.07152","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.07152","snapshot_observed_at":"2026-08-18T01:11:43.156819Z","title":"arXiv preprint arXiv:2303.07152 , year =","venue":null,"work_id":"4ae0099b-0a66-4c7e-a248-671c7753ba48","year":2025},"citing_paper":{"arxiv_id":"2605.21860","last_updated":"2026-05-21T01:13:52Z","snapshot_observed_at":"2026-08-18T18:16:07.792584Z","submitted_at":"2026-05-21T01:13:52Z","title":"Robust Statistical Estimators with Bounded Empirical Sensitivity","version":1},"reference_index":255,"source":"arxiv_source","source_observed_at":"2026-05-22T03:28:45.663789Z"},"links":{"cited_paper":"/paper/2303.07152","citing_paper":"/paper/2605.21860"},"observation_digest":"sha256:c9b68e35ffb75fe7001a9c694a6f4bf1cc6e47dff088c97de6340d2459803010","observation_id":"076c45ee-c496-4c9e-a41a-d7d1da959550","resolution":{"observed_at":"2026-08-18T01:11:43.156819Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2303.07152/citation-record","integrity":"/paper/2303.07152/integrity","json":"/paper/2303.07152/citation-record.json","paper":"/paper/2303.07152"},"outbound":[],"paper":{"arxiv_id":"2303.07152","last_updated":"2026-08-15T05:54:37Z","latest_version":3,"primary_category":"math.ST","snapshot_observed_at":"2026-08-20T23:08:55.524823Z","submitted_at":"2023-03-13T14:26:27Z","title":"Score Attack: A Lower Bound Technique for Optimal Differentially Private Learning"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2303.07152."}