{"as_of":"2026-08-23T08:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1718c614d1d0020d71f2460ae124cd9a772adcf5489ae6f141681882aedddf38","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+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-06-29T05:00:47.642665Z","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-06-29T18:53:51.982594Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2312.14712","last_updated":"2025-06-26T13:12:25Z","snapshot_observed_at":"2026-08-18T00:28:26.455376Z","submitted_at":"2023-12-22T14:10:07Z","title":"Balancing Privacy, Robustness, and Efficiency in Machine Learning","version":3},"cited_work":{"arxiv_id":"2312.14712","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2312.14712","snapshot_observed_at":"2026-06-29T18:53:51.982594Z","title":"arXiv preprint arXiv:2312.14712 , year=","venue":null,"work_id":"17163916-be7b-4d89-87c5-d2575638074f","year":null},"citing_paper":{"arxiv_id":"2606.28123","last_updated":"2026-06-26T14:24:11Z","snapshot_observed_at":"2026-08-17T17:57:16.718671Z","submitted_at":"2026-06-26T14:24:11Z","title":"Dangerous Liaisons of Convex Learning and Non-Affine Aggregation","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-06-29T05:00:47.642665Z"},"links":{"cited_paper":"/paper/2312.14712","citing_paper":"/paper/2606.28123"},"observation_digest":"sha256:1e2a4fd2e84c21c665c27985e0eb99983160b8c438555a9b8c40ac69122dfe2c","observation_id":"de757af1-ab03-40f2-91d1-1de208529aa0","resolution":{"observed_at":"2026-06-29T18:53:51.984261Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2312.14712/citation-record","integrity":"/paper/2312.14712/integrity","json":"/paper/2312.14712/citation-record.json","paper":"/paper/2312.14712"},"outbound":[],"paper":{"arxiv_id":"2312.14712","last_updated":"2025-06-26T13:12:25Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T00:28:26.455376Z","submitted_at":"2023-12-22T14:10:07Z","title":"Balancing Privacy, Robustness, and Efficiency in Machine 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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2312.14712."}