{"as_of":"2026-08-16T11:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:33fc2122fe4a8ab8c09f113b7f9018b4bbfb72797c20a32345adc2099438912b","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:28:57.021958Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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-08-16T04:19:06.079763Z","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-08-16T04:19:06.390370Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.06130","last_updated":"2020-05-19T01:20:43Z","snapshot_observed_at":"2026-08-16T08:39:30.045828Z","submitted_at":"2019-08-08T22:14:09Z","title":"Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries","version":2},"cited_work":{"arxiv_id":"1908.06130","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.06130","snapshot_observed_at":"2026-08-16T04:19:06.390370Z","title":"Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries","venue":"cs.CC","work_id":"59d1caec-0263-4958-b94b-0d357b2c5924","year":2019},"citing_paper":{"arxiv_id":"2505.01990","last_updated":"2025-07-19T00:31:14Z","snapshot_observed_at":"2026-08-16T04:01:59.768514Z","submitted_at":"2025-05-04T05:36:07Z","title":"On optimal distinguishers for Planted Clique","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T04:19:06.079763Z"},"links":{"cited_paper":"/paper/1908.06130","citing_paper":"/paper/2505.01990"},"observation_digest":"sha256:03a5a40c35c6813c1bb4bf44ab451c9de743b042258af8a39279914b7f91e1d9","observation_id":"ba456929-224c-425b-ba5e-ea3aae6d2e8d","resolution":{"observed_at":"2026-08-16T04:19:06.395889Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/1908.06130/citation-record","integrity":"/paper/1908.06130/integrity","json":"/paper/1908.06130/citation-record.json","paper":"/paper/1908.06130"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:28:57.501714Z","title":"A nearly tight sum-of-squares lower bound for the planted clique problem","venue":null,"work_id":"f3902f9b-3c7c-423b-a6ca-a0179a643419","year":2016},"citing_paper":{"arxiv_id":"1908.06130","last_updated":"2020-05-19T01:20:43Z","snapshot_observed_at":"2026-08-16T08:39:30.045828Z","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":5,"source":"pdf_text","source_observed_at":"2026-08-14T14:28:56.897748Z"},"links":{"citing_paper":"/paper/1908.06130"},"observation_digest":"sha256:9e84ac4e72a46be0108dc2792645cdf67e29c398dee849d019d500a6642fd11b","observation_id":"5c171f14-3e69-4a75-a8ff-df8ead50a2dd","resolution":{"observed_at":"2026-08-14T14:28:57.509081Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1801.00518","last_updated":"2018-01-01T21:53:55Z","snapshot_observed_at":"2026-08-14T19:58:44.282563Z","submitted_at":"2018-01-01T21:53:55Z","title":"Statistical and Computational Limits for Sparse Matrix Detection","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1801.00518","snapshot_observed_at":"2026-08-14T14:28:56.919264Z","title":"Tony Cai and Yihong Wu","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-16T08:39:30.045828Z","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":9,"source":"pdf_text","source_observed_at":"2026-08-14T14:28:56.919264Z"},"links":{"cited_paper":"/paper/1801.00518","citing_paper":"/paper/1908.06130"},"observation_digest":"sha256:0743e3828ba569bfc5f6f77821811516a4cad4eac2abbef02027e6029e564400","observation_id":"938d010d-2033-4a50-8713-d9ebefbb3c6b","resolution":{"observed_at":"2026-08-14T14:28:56.919264Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:28:57.483013Z","title":"Robust estimators in high dimensions wit hout the computational intractability","venue":null,"work_id":"5442caf3-dbf5-4747-a271-9c04a8ef497c","year":2016},"citing_paper":{"arxiv_id":"1908.06130","last_updated":"2020-05-19T01:20:43Z","snapshot_observed_at":"2026-08-16T08:39:30.045828Z","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":10,"source":"pdf_text","source_observed_at":"2026-08-14T14:28:56.924284Z"},"links":{"citing_paper":"/paper/1908.06130"},"observation_digest":"sha256:2a2965822de7cfa6bdce24772803efc72c510cab63403c892b5b81716fb96b09","observation_id":"dbf8514b-7418-4717-99da-74d484a7109b","resolution":{"observed_at":"2026-08-14T14:28:57.489920Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:28:57.461728Z","title":"Statistical query lower bounds for robust estimation of high-dimensional gaussians and gaussian mixtures","venue":null,"work_id":"c9a58d7b-2206-4adc-8fca-56a61fadca1c","year":2017},"citing_paper":{"arxiv_id":"1908.06130","last_updated":"2020-05-19T01:20:43Z","snapshot_observed_at":"2026-08-16T08:39:30.045828Z","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":11,"source":"pdf_text","source_observed_at":"2026-08-14T14:28:56.929261Z"},"links":{"citing_paper":"/paper/1908.06130"},"observation_digest":"sha256:a3862bb7d382201ad286f69ea26c6f509487655fda2a86812a07e8d3104c5dde","observation_id":"2934223e-0124-41de-894c-adf03fb89a56","resolution":{"observed_at":"2026-08-14T14:28:57.469138Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1904.07174","last_updated":"2019-12-30T10:56:26Z","snapshot_observed_at":"2026-08-14T16:46:18.985816Z","submitted_at":"2019-04-15T16:44:00Z","title":"The Landscape of the Planted Clique Problem: Dense subgraphs and the Overlap Gap Property","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.07174","snapshot_observed_at":"2026-08-14T14:28:56.944993Z","title":"The landscape of the p lanted clique problem: Dense subgraphs and the overlap gap property","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"1908.06130","last_updated":"2020-05-19T01:20:43Z","snapshot_observed_at":"2026-08-16T08:39:30.045828Z","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":14,"source":"pdf_text","source_observed_at":"2026-08-14T14:28:56.944993Z"},"links":{"cited_paper":"/paper/1904.07174","citing_paper":"/paper/1908.06130"},"observation_digest":"sha256:b5c5e1b3ba840c0bc7b2c59b88cc8cd782facc340878c2b78ace72d48f56a3bf","observation_id":"32bcf4e4-4d0c-4b3f-a7bc-e49c479a66cc","resolution":{"observed_at":"2026-08-14T14:28:56.944993Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1903.07870","last_updated":"2019-06-03T23:17:58Z","snapshot_observed_at":"2026-08-14T17:00:14.399351Z","submitted_at":"2019-03-19T07:48:33Z","title":"How Hard Is Robust Mean Estimation?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.07870","snapshot_observed_at":"2026-08-14T14:28:56.950246Z","title":"How hard is robust mean e stimation? arXiv preprint arXiv:1903.07870,","venue":null,"work_id":null,"year":1903},"citing_paper":{"arxiv_id":"1908.06130","last_updated":"2020-05-19T01:20:43Z","snapshot_observed_at":"2026-08-16T08:39:30.045828Z","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":15,"source":"pdf_text","source_observed_at":"2026-08-14T14:28:56.950246Z"},"links":{"cited_paper":"/paper/1903.07870","citing_paper":"/paper/1908.06130"},"observation_digest":"sha256:951907a1e96a63ea35dc61ff9d6471c752a6f4b5bd50b221b42caff17a486266","observation_id":"16c37653-332d-4d75-bd5c-493fa7afe735","resolution":{"observed_at":"2026-08-14T14:28:56.950246Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:28:57.419980Z","title":"Efficient bayesian estimation from few samples: community detection and related problems","venue":null,"work_id":"ba33f240-23be-4912-8a74-aa77ec4b02b9","year":2017},"citing_paper":{"arxiv_id":"1908.06130","last_updated":"2020-05-19T01:20:43Z","snapshot_observed_at":"2026-08-16T08:39:30.045828Z","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":16,"source":"pdf_text","source_observed_at":"2026-08-14T14:28:56.956656Z"},"links":{"citing_paper":"/paper/1908.06130"},"observation_digest":"sha256:5ac4177bf3f97412fb350b9ed760af008a9b67b135098e525bb532b6330ff64d","observation_id":"af2c235a-4aaa-4fd2-963d-5855296c155e","resolution":{"observed_at":"2026-08-14T14:28:57.431878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:28:57.399674Z","title":"How to play unique games against a semi-random adversary: Study of semi-rando m models of unique games","venue":null,"work_id":"405f72ee-488c-4535-baf6-4df12e44daf8","year":2011},"citing_paper":{"arxiv_id":"1908.06130","last_updated":"2020-05-19T01:20:43Z","snapshot_observed_at":"2026-08-16T08:39:30.045828Z","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":18,"source":"pdf_text","source_observed_at":"2026-08-14T14:28:56.969891Z"},"links":{"citing_paper":"/paper/1908.06130"},"observation_digest":"sha256:26413cda46a641a71d5d9ce5dc60d2a546dd40133661b258975eb06e1372cb80","observation_id":"e154c9ff-c0c2-469e-aa2e-4755b5a08c6a","resolution":{"observed_at":"2026-08-14T14:28:57.405382Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1701.04521","last_updated":"2017-01-17T03:36:34Z","snapshot_observed_at":"2026-08-14T21:20:54.410675Z","submitted_at":"2017-01-17T03:36:34Z","title":"Sum of squares lower bounds for refuting any CSP","version":1},"cited_work":{"arxiv_id":"1701.04521","doi":null,"metadata_source":"pith","pith_arxiv_id":"1701.04521","snapshot_observed_at":"2026-08-14T14:28:57.098339Z","title":"Sum of squares lower bounds for refuting any CSP","venue":"cs.CC","work_id":"f03568a5-1a7b-497d-9ab9-a09b7cdba2e7","year":2017},"citing_paper":{"arxiv_id":"1908.06130","last_updated":"2020-05-19T01:20:43Z","snapshot_observed_at":"2026-08-16T08:39:30.045828Z","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":19,"source":"pdf_text","source_observed_at":"2026-08-14T14:28:56.976143Z"},"links":{"cited_paper":"/paper/1701.04521","citing_paper":"/paper/1908.06130"},"observation_digest":"sha256:4bbcce349183053ece15e88693ebf7451796006562c4033e4755779b04b62e08","observation_id":"3c60013e-eb8e-4d15-bd24-6bcba2d9e495","resolution":{"observed_at":"2026-08-14T14:28:57.107811Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:28:57.380278Z","title":"Phase transitions and optimal algorithms in high-dimensional Gaussian mixture clustering","venue":null,"work_id":"15ecb34f-e4e7-4703-8563-95de69f9781e","year":2016},"citing_paper":{"arxiv_id":"1908.06130","last_updated":"2020-05-19T01:20:43Z","snapshot_observed_at":"2026-08-16T08:39:30.045828Z","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":20,"source":"pdf_text","source_observed_at":"2026-08-14T14:28:56.982048Z"},"links":{"citing_paper":"/paper/1908.06130"},"observation_digest":"sha256:eb3fdf017a3b1e37bd5c0f35fe3963dc8959691141ea481c92275b807cadacac","observation_id":"891fe294-27c4-41e8-8af7-e7e29c46ae65","resolution":{"observed_at":"2026-08-14T14:28:57.387726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:28:57.344350Z","title":"Agnosti c estimation of mean and covariance","venue":null,"work_id":"427e10f4-d097-42f1-97a7-3908c5c9ae4d","year":2016},"citing_paper":{"arxiv_id":"1908.06130","last_updated":"2020-05-19T01:20:43Z","snapshot_observed_at":"2026-08-16T08:39:30.045828Z","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":23,"source":"pdf_text","source_observed_at":"2026-08-14T14:28:56.999303Z"},"links":{"citing_paper":"/paper/1908.06130"},"observation_digest":"sha256:df51e2b68feefbfd83b9ce39a459be717de1aecfaf15e002415888e3927229ae","observation_id":"cc9ed51f-67c1-4ab2-b615-95b60ddec415","resolution":{"observed_at":"2026-08-14T14:28:57.351347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:28:57.327418Z","title":"Mathematics and the picturing of data","venue":null,"work_id":"6be517fe-2fac-4797-ae1a-b2820008fff0","year":1975},"citing_paper":{"arxiv_id":"1908.06130","last_updated":"2020-05-19T01:20:43Z","snapshot_observed_at":"2026-08-16T08:39:30.045828Z","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":25,"source":"pdf_text","source_observed_at":"2026-08-14T14:28:57.010965Z"},"links":{"citing_paper":"/paper/1908.06130"},"observation_digest":"sha256:7b5a827f24f0f893273e3284e5cd5a1d7261a3782c4de6c77fb60ba47c6bc26a","observation_id":"2143e6d5-db29-4e1d-be0d-8979b62a5746","resolution":{"observed_at":"2026-08-14T14:28:57.333083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:28:57.309025Z","title":"Detection a nd feature selection in sparse mixture models","venue":null,"work_id":"ebd15f67-dc93-41cf-917c-0623e250ae1d","year":1920},"citing_paper":{"arxiv_id":"1908.06130","last_updated":"2020-05-19T01:20:43Z","snapshot_observed_at":"2026-08-16T08:39:30.045828Z","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":26,"source":"pdf_text","source_observed_at":"2026-08-14T14:28:57.016882Z"},"links":{"citing_paper":"/paper/1908.06130"},"observation_digest":"sha256:ff5b6dc61a270c2e11ae423e72bf77f7715619343a3e93f27cc591cbcb96d16d","observation_id":"7836d4f8-a673-4243-8820-95ad1ca817cb","resolution":{"observed_at":"2026-08-14T14:28:57.316270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1803.03241","last_updated":"2020-06-04T15:42:45Z","snapshot_observed_at":"2026-08-14T19:38:04.511269Z","submitted_at":"2018-03-08T18:30:31Z","title":"Efficient Algorithms for Outlier-Robust Regression","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.03241","snapshot_observed_at":"2026-08-14T14:28:56.963628Z","title":"Effic ient algorithms for outlier- robust regression","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-16T08:39:30.045828Z","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":1977,"source":"pdf_text","source_observed_at":"2026-08-14T14:28:56.963628Z"},"links":{"cited_paper":"/paper/1803.03241","citing_paper":"/paper/1908.06130"},"observation_digest":"sha256:9808f75c839667c75db30126361af0c57b64f756634874b7eec698c45735e015","observation_id":"7f8c407f-d7bd-4c1d-87a7-1a295f233ebe","resolution":{"observed_at":"2026-08-14T14:28:56.963628Z","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":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-16T08:39:30.045828Z","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:c589d3107101ef249512ce11f48c9fd7cc4291dd0bc80364ed33afa24d24163a","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:28:57.361360Z","title":"Mmse of probabilistic low- rank matrix estimation: Universality with respect to the ou tput channel","venue":null,"work_id":"efdfc209-8ced-4f43-b29f-6455292679b2","year":2015},"citing_paper":{"arxiv_id":"1908.06130","last_updated":"2020-05-19T01:20:43Z","snapshot_observed_at":"2026-08-16T08:39:30.045828Z","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":1992,"source":"pdf_text","source_observed_at":"2026-08-14T14:28:56.993253Z"},"links":{"citing_paper":"/paper/1908.06130"},"observation_digest":"sha256:5b23556aa6616f367d85ca1a91dd83addfc2b52156ef4cd9a57b6893bcf69f10","observation_id":"018456fe-a567-4664-acc3-57f82a830fb9","resolution":{"observed_at":"2026-08-14T14:28:57.368135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1507.05136","last_updated":"2016-03-11T23:40:57Z","snapshot_observed_at":"2026-08-14T22:39:56.102564Z","submitted_at":"2015-07-18T00:32:28Z","title":"Tight Lower Bounds for Planted Clique in the Degree-4 SOS Program","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1507.05136","snapshot_observed_at":"2026-08-14T14:28:57.004447Z","title":"Tight lower b ounds for planted clique in the degree-4 sos program","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-16T08:39:30.045828Z","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":1997,"source":"pdf_text","source_observed_at":"2026-08-14T14:28:57.004447Z"},"links":{"cited_paper":"/paper/1507.05136","citing_paper":"/paper/1908.06130"},"observation_digest":"sha256:432ca7752293c45cf598d9607891c3ca5c7831cfce0004df531bfd39a55aa8c0","observation_id":"48ddfe19-7e62-44d0-af97-5cbceb3e737a","resolution":{"observed_at":"2026-08-14T14:28:57.004447Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06996","last_updated":"2018-08-21T16:16:46Z","snapshot_observed_at":"2026-08-14T18:38:46.706447Z","submitted_at":"2018-08-21T16:16:46Z","title":"Curse of Heterogeneity: Computational Barriers in Sparse Mixture Models and Phase Retrieval","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.06996","snapshot_observed_at":"2026-08-14T14:28:56.934443Z","title":"Curse of heterogeneity: Computational barriers in sparse mixture models and phase r etrieval","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-16T08:39:30.045828Z","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":2001,"source":"pdf_text","source_observed_at":"2026-08-14T14:28:56.934443Z"},"links":{"cited_paper":"/paper/1808.06996","citing_paper":"/paper/1908.06130"},"observation_digest":"sha256:8034255b383f4fa2582fa75e6978e53c483d6cfcdd5d90caf99eb26e29f52e35","observation_id":"1ca5a461-20f0-4706-beeb-543ab3c69d80","resolution":{"observed_at":"2026-08-14T14:28:56.934443Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:28:57.445929Z","title":"Sparse cc a: Adaptive estimation and computational barriers","venue":null,"work_id":"5f0dda9f-3f65-4c62-9d28-5dac381d6cfd","year":null},"citing_paper":{"arxiv_id":"1908.06130","last_updated":"2020-05-19T01:20:43Z","snapshot_observed_at":"2026-08-16T08:39:30.045828Z","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":2010,"source":"pdf_text","source_observed_at":"2026-08-14T14:28:56.939720Z"},"links":{"citing_paper":"/paper/1908.06130"},"observation_digest":"sha256:acbfb79ea082b0f1297087d388f2d11f58f849befe69631b0afc7c36bc80fa2c","observation_id":"8dc20147-d715-40bd-b6f4-39f52dacc2ee","resolution":{"observed_at":"2026-08-14T14:28:57.451965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1902.07380","last_updated":"2019-02-20T02:35:39Z","snapshot_observed_at":"2026-08-14T18:15:02.971993Z","submitted_at":"2019-02-20T02:35:39Z","title":"Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.07380","snapshot_observed_at":"2026-08-14T14:28:56.879955Z","title":"Optimal average-ca se reductions to sparse pca: From weak assumptions to strong hardness","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"1908.06130","last_updated":"2020-05-19T01:20:43Z","snapshot_observed_at":"2026-08-16T08:39:30.045828Z","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":2011,"source":"pdf_text","source_observed_at":"2026-08-14T14:28:56.879955Z"},"links":{"cited_paper":"/paper/1902.07380","citing_paper":"/paper/1908.06130"},"observation_digest":"sha256:6cf7c9535148f6224fa27a007213918ea2ec3869770092fe98fac43761579ada","observation_id":"3f273233-c5a7-4dce-b657-13b242af0e3e","resolution":{"observed_at":"2026-08-14T14:28:56.879955Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.07324","last_updated":"2019-04-06T04:46:25Z","snapshot_observed_at":"2026-08-14T18:15:02.720907Z","submitted_at":"2019-02-19T22:18:46Z","title":"Computational Hardness of Certifying Bounds on Constrained PCA Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.07324","snapshot_observed_at":"2026-08-14T14:28:56.903219Z","title":"Computational hardness of certifying bounds on constrained pca problems","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"1908.06130","last_updated":"2020-05-19T01:20:43Z","snapshot_observed_at":"2026-08-16T08:39:30.045828Z","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":2013,"source":"pdf_text","source_observed_at":"2026-08-14T14:28:56.903219Z"},"links":{"cited_paper":"/paper/1902.07324","citing_paper":"/paper/1908.06130"},"observation_digest":"sha256:b32c3c2cce9c3b6368019d4d216f8ec6df5aeb6f575f874312d81469ee8b867f","observation_id":"1b2f9c5c-5f35-44b9-a5ec-179ee60e516e","resolution":{"observed_at":"2026-08-14T14:28:56.903219Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:28:56.874288Z","title":"Algorit hmic barriers from phase transi- tions","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"1908.06130","last_updated":"2020-05-19T01:20:43Z","snapshot_observed_at":"2026-08-16T08:39:30.045828Z","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":2014,"source":"pdf_text","source_observed_at":"2026-08-14T14:28:56.874288Z"},"links":{"citing_paper":"/paper/1908.06130"},"observation_digest":"sha256:c4f61369bcc364eb2a66c39097692629080fcb2b09e524417e957e420ce7ecec","observation_id":"9a3c46b2-507c-4136-85dd-369b27cf26a6","resolution":{"observed_at":"2026-08-14T14:28:56.874288Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1502.01988","last_updated":"2015-10-21T17:51:11Z","snapshot_observed_at":"2026-08-14T23:01:03.935432Z","submitted_at":"2015-02-06T18:58:28Z","title":"Computational and Statistical Boundaries for Submatrix Localization in a Large Noisy Matrix","version":2},"cited_work":{"arxiv_id":"1502.01988","doi":null,"metadata_source":"pith","pith_arxiv_id":"1502.01988","snapshot_observed_at":"2026-08-14T14:28:57.207274Z","title":"Computational and Statistical Boundaries for Submatrix Localization in a Large Noisy Matrix","venue":"math.ST","work_id":"a1f0f447-6f50-4239-9d02-863e2276dd7e","year":2015},"citing_paper":{"arxiv_id":"1908.06130","last_updated":"2020-05-19T01:20:43Z","snapshot_observed_at":"2026-08-16T08:39:30.045828Z","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":2015,"source":"pdf_text","source_observed_at":"2026-08-14T14:28:56.914035Z"},"links":{"cited_paper":"/paper/1502.01988","citing_paper":"/paper/1908.06130"},"observation_digest":"sha256:98535eb2726c1070fd4a68d97f8eb4402347fb26f5a1a3306ff669632f3805c8","observation_id":"4b3bd3e1-858a-430d-8983-7724fc1ad705","resolution":{"observed_at":"2026-08-14T14:28:57.214203Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:28:57.021958Z","title":"Statistical and com- putational trade-offs in estimation of sparse principal comp onents","venue":null,"work_id":null,"year":1930},"citing_paper":{"arxiv_id":"1908.06130","last_updated":"2020-05-19T01:20:43Z","snapshot_observed_at":"2026-08-16T08:39:30.045828Z","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":2016,"source":"pdf_text","source_observed_at":"2026-08-14T14:28:57.021958Z"},"links":{"citing_paper":"/paper/1908.06130"},"observation_digest":"sha256:1b3e8245199ef56757fb5ea19d1e1820d63a081bcc70c7bd17f93036458ab81d","observation_id":"e8856904-c242-48a4-bc00-06fc7874ac7b","resolution":{"observed_at":"2026-08-14T14:28:57.021958Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1808.00921","last_updated":"2019-09-10T23:08:19Z","snapshot_observed_at":"2026-08-14T18:45:00.324715Z","submitted_at":"2018-08-02T17:12:21Z","title":"Algorithmic thresholds for tensor PCA","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.00921","snapshot_observed_at":"2026-08-14T14:28:56.892130Z","title":"Algorithmic thresholds for tensor pca","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-16T08:39:30.045828Z","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":2017,"source":"pdf_text","source_observed_at":"2026-08-14T14:28:56.892130Z"},"links":{"cited_paper":"/paper/1808.00921","citing_paper":"/paper/1908.06130"},"observation_digest":"sha256:acfea736113e7e943e8b2ea4229707f16cac123657f839f5f24d69e87bc30fdd","observation_id":"314bf52f-a548-4181-8765-e547005a49ea","resolution":{"observed_at":"2026-08-14T14:28:56.892130Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.06916","last_updated":"2019-06-01T17:05:34Z","snapshot_observed_at":"2026-08-14T17:14:35.091524Z","submitted_at":"2019-02-19T06:37:02Z","title":"Universality of Computational Lower Bounds for Submatrix Detection","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.06916","snapshot_observed_at":"2026-08-14T14:28:56.886555Z","title":"U niversality of computational lower bounds for submatrix detection","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"1908.06130","last_updated":"2020-05-19T01:20:43Z","snapshot_observed_at":"2026-08-16T08:39:30.045828Z","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":2018,"source":"pdf_text","source_observed_at":"2026-08-14T14:28:56.886555Z"},"links":{"cited_paper":"/paper/1902.06916","citing_paper":"/paper/1908.06130"},"observation_digest":"sha256:b6781859ea61c4f700a57e962b4859da9517f3a95b7943158570b92d540d780b","observation_id":"7d6b4a0b-8380-451a-bb8a-0d7b6a3e624a","resolution":{"observed_at":"2026-08-14T14:28:56.886555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.05424","last_updated":"2018-01-25T06:34:40Z","snapshot_observed_at":"2026-08-14T20:13:35.337455Z","submitted_at":"2017-11-15T06:23:43Z","title":"The landscape of the spiked tensor model","version":2},"cited_work":{"arxiv_id":"1711.05424","doi":null,"metadata_source":"pith","pith_arxiv_id":"1711.05424","snapshot_observed_at":"2026-08-14T14:28:57.230935Z","title":"The landscape of the spiked tensor model","venue":"math.ST","work_id":"c7e9e959-abc2-4e17-9397-887bec9fcaf5","year":2017},"citing_paper":{"arxiv_id":"1908.06130","last_updated":"2020-05-19T01:20:43Z","snapshot_observed_at":"2026-08-16T08:39:30.045828Z","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":2019,"source":"pdf_text","source_observed_at":"2026-08-14T14:28:56.908928Z"},"links":{"cited_paper":"/paper/1711.05424","citing_paper":"/paper/1908.06130"},"observation_digest":"sha256:e90c6c2b6c1aca59b3a81a07fe2e33803a05e05aa21baa5664fd3d8b7b2ea0b6","observation_id":"ea6833bc-e83e-435b-86a6-22bf5eb2874d","resolution":{"observed_at":"2026-08-14T14:28:57.237078Z","resolver_source":"local_arxiv","status":"verified_exact"},"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"}}],"paper":{"arxiv_id":"1908.06130","last_updated":"2020-05-19T01:20:43Z","latest_version":2,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-16T08:39:30.045828Z","submitted_at":"2019-08-08T22:14:09Z","title":"Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":3,"verified_fuzzy":11},"total_outbound_references":27},"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 27 of 27 outbound references and 1 inbound Pith citation observation for arXiv:1908.06130."}