{"as_of":"2026-08-09T20:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3f3890a9937858aaea1ad2a2f963c3efaf7b54e73ee743afbed7608836708401","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T00:57:50.123991Z","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-11T16:06:06.811888Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1911.05911","last_updated":"2019-11-14T02:56:56Z","snapshot_observed_at":"2026-07-30T23:23:00.985786Z","submitted_at":"2019-11-14T02:56:56Z","title":"Recent Advances in Algorithmic High-Dimensional Robust Statistics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.05911","snapshot_observed_at":"2026-08-07T00:57:50.123991Z","title":"and Kane, D","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:50.123991Z"},"links":{"cited_paper":"/paper/1911.05911","citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:fa7f25333c0d09ab1055f409fa033fdcaddd02d79253ba2ab507cbd3567165f5","observation_id":"2c593b3b-3e3f-426e-a6e8-9d80a8c13900","resolution":{"observed_at":"2026-08-07T00:57:50.123991Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.05911","last_updated":"2019-11-14T02:56:56Z","snapshot_observed_at":"2026-07-30T23:23:00.985786Z","submitted_at":"2019-11-14T02:56:56Z","title":"Recent Advances in Algorithmic High-Dimensional Robust Statistics","version":1},"cited_work":{"arxiv_id":"1911.05911","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1911.05911","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Recent advances in algorithmic high-dimensional robust statistics","venue":null,"work_id":"414ea7dc-09a7-4524-9645-857a3f8d78b5","year":1911},"citing_paper":{"arxiv_id":"2605.01335","last_updated":"2026-05-02T09:13:50Z","snapshot_observed_at":"2026-07-06T23:14:33.653260Z","submitted_at":"2026-05-02T09:13:50Z","title":"Mean Testing under Truncation beyond Gaussian","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-09T18:49:24.253058Z"},"links":{"cited_paper":"/paper/1911.05911","citing_paper":"/paper/2605.01335"},"observation_digest":"sha256:70307d03735f628e79409f1f858c6568428b720206ae91d088e14772aeaf22fd","observation_id":"108debbc-32d9-4460-a05f-e371745298ee","resolution":{"observed_at":"2026-05-11T16:06:06.817231Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.05911","last_updated":"2019-11-14T02:56:56Z","snapshot_observed_at":"2026-07-30T23:23:00.985786Z","submitted_at":"2019-11-14T02:56:56Z","title":"Recent Advances in Algorithmic High-Dimensional Robust Statistics","version":1},"cited_work":{"arxiv_id":"1911.05911","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1911.05911","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Recent advances in algorithmic high-dimensional robust statistics","venue":null,"work_id":"414ea7dc-09a7-4524-9645-857a3f8d78b5","year":1911},"citing_paper":{"arxiv_id":"2605.07551","last_updated":"2026-05-08T10:27:51Z","snapshot_observed_at":"2026-08-05T14:33:48.431220Z","submitted_at":"2026-05-08T10:27:51Z","title":"Disagreement-Regularized Importance Sampling for Adversarial Label Corruption","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-11T02:07:55.783508Z"},"links":{"cited_paper":"/paper/1911.05911","citing_paper":"/paper/2605.07551"},"observation_digest":"sha256:bb2abb4ecc038453d00564fe2960a2fce8001e59289d2094f4883a00debd72d8","observation_id":"39223023-7d64-429b-a946-1230ce3aa7bb","resolution":{"observed_at":"2026-05-11T03:55:56.282735Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.05911","last_updated":"2019-11-14T02:56:56Z","snapshot_observed_at":"2026-07-30T23:23:00.985786Z","submitted_at":"2019-11-14T02:56:56Z","title":"Recent Advances in Algorithmic High-Dimensional Robust Statistics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.05911","snapshot_observed_at":"2026-07-12T07:46:03.995262Z","title":"arXiv preprint arXiv:1911.05911 , year=","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2607.02681","last_updated":"2026-07-02T18:23:41Z","snapshot_observed_at":"2026-08-04T01:36:35.474781Z","submitted_at":"2026-07-02T18:23:41Z","title":"Contaminated Multi-task Learning with Heterogeneity: Fundamental Limits and Optimal Algorithms","version":1},"reference_index":244,"source":"arxiv_source","source_observed_at":"2026-07-12T07:46:03.995262Z"},"links":{"cited_paper":"/paper/1911.05911","citing_paper":"/paper/2607.02681"},"observation_digest":"sha256:29dfc9a2f18ce8c4411ba5f07973d7c49c65a37c62c708aac74a1a10e194a1eb","observation_id":"208e46b9-919a-4e95-afa6-d1800df584ac","resolution":{"observed_at":"2026-07-12T07:46:03.995262Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.05911","last_updated":"2019-11-14T02:56:56Z","snapshot_observed_at":"2026-07-30T23:23:00.985786Z","submitted_at":"2019-11-14T02:56:56Z","title":"Recent Advances in Algorithmic High-Dimensional Robust Statistics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.05911","snapshot_observed_at":"2026-07-11T12:12:44.455418Z","title":"arXiv preprint arXiv:1911.05911 , year=","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2607.04869","last_updated":"2026-07-06T09:42:52Z","snapshot_observed_at":"2026-08-07T00:28:34.694919Z","submitted_at":"2026-07-06T09:42:52Z","title":"Active Learning on Adversarially Corrupted Graphs","version":1},"reference_index":127,"source":"arxiv_source","source_observed_at":"2026-07-11T12:12:44.455418Z"},"links":{"cited_paper":"/paper/1911.05911","citing_paper":"/paper/2607.04869"},"observation_digest":"sha256:34558b56a750e1c10dee02b6e069a3282ac102b86df8a6c7b86158a8bd1cf0e8","observation_id":"4f58b9e8-8a7c-4cdb-a66d-f439976afa81","resolution":{"observed_at":"2026-07-11T12:12:44.455418Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1911.05911/citation-record","integrity":"/paper/1911.05911/integrity","json":"/paper/1911.05911/citation-record.json","paper":"/paper/1911.05911"},"outbound":[],"paper":{"arxiv_id":"1911.05911","last_updated":"2019-11-14T02:56:56Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-30T23:23:00.985786Z","submitted_at":"2019-11-14T02:56:56Z","title":"Recent Advances in Algorithmic High-Dimensional Robust Statistics"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:1911.05911."}