{"as_of":"2026-08-08T18:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:20876dd35e8f502086c01777480867cf8ae0f5e8f9f7f1d66183d7296e0c4b8b","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-08T06:32:00.761636+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-07T15:01:15.558111Z","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-07T15:01:18.301211Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2005.10817","last_updated":"2021-03-22T17:38:04Z","snapshot_observed_at":"2026-07-06T09:22:23.803339Z","submitted_at":"2020-05-21T17:51:30Z","title":"Computationally efficient sparse clustering","version":3},"cited_work":{"arxiv_id":"2005.10817","doi":null,"metadata_source":"pith","pith_arxiv_id":"2005.10817","snapshot_observed_at":"2026-08-07T15:01:18.301211Z","title":"Computationally efficient sparse clustering","venue":"math.ST","work_id":"651523a1-baa4-4080-b1be-c76cca938483","year":2020},"citing_paper":{"arxiv_id":"2505.17360","last_updated":"2025-05-23T00:30:55Z","snapshot_observed_at":"2026-08-07T14:46:15.051323Z","submitted_at":"2025-05-23T00:30:55Z","title":"The Quasi-Polynomial Low-Degree Conjecture is False","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-07T15:01:15.558111Z"},"links":{"cited_paper":"/paper/2005.10817","citing_paper":"/paper/2505.17360"},"observation_digest":"sha256:f5f451d82b7cebc606b5ea305179fc12a15615b045ff466028e2e2a4e87a4ef7","observation_id":"055bab6a-99c7-4542-bf34-e120b15093af","resolution":{"observed_at":"2026-08-07T15:01:18.372131Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2005.10817/citation-record","integrity":"/paper/2005.10817/integrity","json":"/paper/2005.10817/citation-record.json","paper":"/paper/2005.10817"},"outbound":[],"paper":{"arxiv_id":"2005.10817","last_updated":"2021-03-22T17:38:04Z","latest_version":3,"primary_category":"math.ST","snapshot_observed_at":"2026-07-06T09:22:23.803339Z","submitted_at":"2020-05-21T17:51:30Z","title":"Computationally efficient sparse clustering"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2005.10817."}