{"as_of":"2026-08-16T17:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7f9d6b8dc0657c778655adb68d958825912f2b094a5cbde68dc2d6bb7ade6175","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T04:19:06.085725Z","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-05-24T15:09:36.732058Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":"1902.07324","doi":null,"metadata_source":"pith","pith_arxiv_id":"1902.07324","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Computational Hardness of Certifying Bounds on Constrained PCA Problems","venue":"cs.DS","work_id":"f90926af-7514-41c6-9822-158f7c49a602","year":2019},"citing_paper":{"arxiv_id":"1907.11636","last_updated":"2019-07-26T15:46:05Z","snapshot_observed_at":"2026-08-14T18:14:22.710933Z","submitted_at":"2019-07-26T15:46:05Z","title":"Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-24T15:08:21.512072Z"},"links":{"cited_paper":"/paper/1902.07324","citing_paper":"/paper/1907.11636"},"observation_digest":"sha256:387f48937d525fd82abc167085ae679ce627b42d3e004224fc00aef3849019cc","observation_id":"4367c907-ad14-43a7-85e2-e90230e5499e","resolution":{"observed_at":"2026-05-24T15:09:36.734392Z","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":{"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-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":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:31de3422299eb8a6430e9f7ecd6231ff8ea09aa716ec34c1dd1fb75176a585ba","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":{"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-16T04:19:06.085725Z","title":"The uniform hardcore lemma via ap- proximate bregman projections","venue":null,"work_id":null,"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":2018,"source":"pdf_text","source_observed_at":"2026-08-16T04:19:06.085725Z"},"links":{"cited_paper":"/paper/1902.07324","citing_paper":"/paper/2505.01990"},"observation_digest":"sha256:5b89d6238b9a86672aefabccf23b38cb1a154332f3067290f208dac98235fbba","observation_id":"9fb2e6eb-8255-4d68-8fb5-58e6cd0c3181","resolution":{"observed_at":"2026-08-16T04:19:06.085725Z","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-15T20:05:56.555467Z","title":"S., KUNISKY, D","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.13647","last_updated":"2025-06-16T16:08:30Z","snapshot_observed_at":"2026-08-15T19:55:33.077575Z","submitted_at":"2025-06-16T16:08:30Z","title":"Computational lower bounds in latent models: clustering, sparse-clustering, biclustering","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T20:05:56.555467Z"},"links":{"cited_paper":"/paper/1902.07324","citing_paper":"/paper/2506.13647"},"observation_digest":"sha256:a8b06030053a8c1d679a8c462aaec118cd7088d4c4c29b60be3ac6095076f91e","observation_id":"3e3a1c4d-f8ad-409a-860f-754ed419b63b","resolution":{"observed_at":"2026-08-15T20:05:56.555467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1902.07324/citation-record","integrity":"/paper/1902.07324/integrity","json":"/paper/1902.07324/citation-record.json","paper":"/paper/1902.07324"},"outbound":[],"paper":{"arxiv_id":"1902.07324","last_updated":"2019-04-06T04:46:25Z","latest_version":2,"primary_category":"cs.DS","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"},"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 4 inbound Pith citation observations for arXiv:1902.07324."}