Pith. sign in

Paper Citation Record · LEDGER

Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2012.09720 v3

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-14T06:32:32.682623+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-10T20:04:15.429555Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-10T19:51:48.484611Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation b190860a-16ec-4e6b-b3e6-f8132d8bb49a · inbound

A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise cites this paper.

A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-10T20:04:15.429555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T20:04:15.429555Z digest=sha256:92ed73f818de1ee34ed24c104f6731f3afc78211bac6f38f2fbf75dad0cd21e4

Observation 3a8caa52-dc83-472f-aee5-c105567eed60 · inbound

Learning Noisy Halfspaces with a Margin: Massart is No Harder than Random cites this paper.

Learning Noisy Halfspaces with a Margin: Massart is No Harder than Random Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise

Reference 17

Resolution
verified exact
local_arxiv, observed 2026-08-10T19:51:48.490288Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-10T19:51:48.218549Z digest=sha256:f7d9eb61f4699f5574d600a5092d988c2b0bffc9ec8cb56b7981e261d0a10a42