{"as_of":"2026-08-14T19:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:70e8804874a18de69b66d74720d937dad5887797a042cfbd20cc3a7f750899b1","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T20:04:15.429555Z","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-10T19:51:48.484611Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2012.09720","last_updated":"2021-11-08T18:19:54Z","snapshot_observed_at":"2026-08-14T17:27:40.854395Z","submitted_at":"2020-12-17T16:43:11Z","title":"Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.09720","snapshot_observed_at":"2026-08-10T20:04:15.429555Z","title":"Diakonikolas and D","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.09691","last_updated":"2025-01-16T17:44:18Z","snapshot_observed_at":"2026-08-10T19:42:45.405206Z","submitted_at":"2025-01-16T17:44:18Z","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-10T20:04:15.429555Z"},"links":{"cited_paper":"/paper/2012.09720","citing_paper":"/paper/2501.09691"},"observation_digest":"sha256:92ed73f818de1ee34ed24c104f6731f3afc78211bac6f38f2fbf75dad0cd21e4","observation_id":"b190860a-16ec-4e6b-b3e6-f8132d8bb49a","resolution":{"observed_at":"2026-08-10T20:04:15.429555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.09720","last_updated":"2021-11-08T18:19:54Z","snapshot_observed_at":"2026-08-14T17:27:40.854395Z","submitted_at":"2020-12-17T16:43:11Z","title":"Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise","version":3},"cited_work":{"arxiv_id":"2012.09720","doi":null,"metadata_source":"pith","pith_arxiv_id":"2012.09720","snapshot_observed_at":"2026-08-10T19:51:48.484611Z","title":"Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise","venue":"cs.LG","work_id":"3e0efe23-6ca8-4f6a-b7f8-4239f17affa2","year":2020},"citing_paper":{"arxiv_id":"2501.09851","last_updated":"2025-01-16T21:46:53Z","snapshot_observed_at":"2026-08-10T19:34:46.184365Z","submitted_at":"2025-01-16T21:46:53Z","title":"Learning Noisy Halfspaces with a Margin: Massart is No Harder than Random","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-10T19:51:48.218549Z"},"links":{"cited_paper":"/paper/2012.09720","citing_paper":"/paper/2501.09851"},"observation_digest":"sha256:f7d9eb61f4699f5574d600a5092d988c2b0bffc9ec8cb56b7981e261d0a10a42","observation_id":"3a8caa52-dc83-472f-aee5-c105567eed60","resolution":{"observed_at":"2026-08-10T19:51:48.490288Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2012.09720/citation-record","integrity":"/paper/2012.09720/integrity","json":"/paper/2012.09720/citation-record.json","paper":"/paper/2012.09720"},"outbound":[],"paper":{"arxiv_id":"2012.09720","last_updated":"2021-11-08T18:19:54Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T17:27:40.854395Z","submitted_at":"2020-12-17T16:43:11Z","title":"Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2012.09720."}