{"as_of":"2026-08-16T21:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9236488f18ab801ac8e1680724443fc8ee98394b179e3979dccaa82191c1472d","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:28:56.987677Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-02T05:56:40.143452Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1702.05860","last_updated":"2017-02-28T20:49:30Z","snapshot_observed_at":"2026-08-14T21:15:46.165156Z","submitted_at":"2017-02-20T05:22:55Z","title":"Robust Sparse Estimation Tasks in High Dimensions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1702.05860","snapshot_observed_at":"2026-08-14T14:28:56.987677Z","title":"Robust sparse estimation tasks in high dime nsions","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.06130","last_updated":"2020-05-19T01:20:43Z","snapshot_observed_at":"2026-08-16T13:54:37.785613Z","submitted_at":"2019-08-08T22:14:09Z","title":"Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries","version":2},"reference_index":1986,"source":"pdf_text","source_observed_at":"2026-08-14T14:28:56.987677Z"},"links":{"cited_paper":"/paper/1702.05860","citing_paper":"/paper/1908.06130"},"observation_digest":"sha256:50debe9ee29be3e5781693055aa7b5738d41212cbb0fee79134897417ae9d2a6","observation_id":"3bcc0aec-943a-4798-8154-69ea792b0573","resolution":{"observed_at":"2026-08-14T14:28:56.987677Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1702.05860","last_updated":"2017-02-28T20:49:30Z","snapshot_observed_at":"2026-08-14T21:15:46.165156Z","submitted_at":"2017-02-20T05:22:55Z","title":"Robust Sparse Estimation Tasks in High Dimensions","version":2},"cited_work":{"arxiv_id":"1702.05860","doi":null,"metadata_source":"pith","pith_arxiv_id":"1702.05860","snapshot_observed_at":"2026-07-02T05:56:40.143452Z","title":"Robust Sparse Estimation Tasks in High Dimensions","venue":"cs.LG","work_id":"30735cba-e5ba-4c79-8601-b04a48ae5d29","year":2017},"citing_paper":{"arxiv_id":"2607.00897","last_updated":"2026-07-01T13:02:12Z","snapshot_observed_at":"2026-08-14T20:26:06.599729Z","submitted_at":"2026-07-01T13:02:12Z","title":"Recovery of Planted Subgraphs","version":1},"reference_index":213,"source":"arxiv_source","source_observed_at":"2026-07-02T05:49:41.894386Z"},"links":{"cited_paper":"/paper/1702.05860","citing_paper":"/paper/2607.00897"},"observation_digest":"sha256:c692f13d1d1df6ba8fd8c85d61f65d49460d17bb4ef7d74ec9a33b0bce255c50","observation_id":"c85f0435-8e4e-4d6b-b0d7-00ab7a95c0c0","resolution":{"observed_at":"2026-07-02T05:56:40.144621Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1702.05860","last_updated":"2017-02-28T20:49:30Z","snapshot_observed_at":"2026-08-14T21:15:46.165156Z","submitted_at":"2017-02-20T05:22:55Z","title":"Robust Sparse Estimation Tasks in High Dimensions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1702.05860","snapshot_observed_at":"2026-08-01T19:10:35.083095Z","title":"arXiv preprint arXiv:1702.05860 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":215,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:35.083095Z"},"links":{"cited_paper":"/paper/1702.05860","citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:9940b549943e91781ba1f0c79b72ea74e14dc79462cbeb22ecc8210b2b61145c","observation_id":"587e03c6-5319-4390-8644-b8ddf56f7ac0","resolution":{"observed_at":"2026-08-01T19:10:35.083095Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1702.05860/citation-record","integrity":"/paper/1702.05860/integrity","json":"/paper/1702.05860/citation-record.json","paper":"/paper/1702.05860"},"outbound":[],"paper":{"arxiv_id":"1702.05860","last_updated":"2017-02-28T20:49:30Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T21:15:46.165156Z","submitted_at":"2017-02-20T05:22:55Z","title":"Robust Sparse Estimation Tasks in High Dimensions"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1702.05860."}