Paper Citation Record · LEDGER

Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations

As of 15 August 2026, this Paper Citation Record lists 10 of 10 outbound references and 1 inbound Pith citation observation for arXiv:2411.12512.

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

pith.paper-citation-record.v1
2411.12512 v1

Coverage vector

measured 10 of 10 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-12T17:36:43.795826Z

measured 11 of 11 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-15T06:32:42.880941+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T04:24:23.495397Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-07T04:24:28.892814Z

Reference resolution

10 of 10 outbound references displayed

verified exact1
verified fuzzy0
unresolved7
parse uncertain0
malformed identifier0
metadata mismatch2

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 6f62d59a-1ea9-4673-a74f-27d8477d21db · outbound

This paper cites Cryptography from Learning Pa rity with Noise.

Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations Cryptography from Learning Pa rity with Noise

Reference 342

Resolution: unresolved; no resolver link, observed 2026-08-12T17:36:43.787225Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fabd1726-cfd7-4037-bad9-f14a8c418f0c · outbound

This paper cites Continuous LWE is as Hard as LWE and Applications to Learning Gaussian Mixtures.

Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations Continuous LWE is as Hard as LWE and Applications to Learning Gaussian Mixtures

Reference 1002

Resolution: unresolved; no resolver link, observed 2026-08-12T17:36:43.767609Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7e131bbe-a04e-4181-81b1-c8a5a2922ac5 · outbound

This paper cites A Time-Space Lower Bound for a Large Class of Lea rning Problems.

Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations A Time-Space Lower Bound for a Large Class of Lea rning Problems

Reference 1075

Resolution: metadata mismatch; raw_fallback, observed 2026-08-12T17:36:43.958241Z

Source-reported events for the cited work

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

Observation 831d9079-61df-44b9-b550-b40097c400f2 · outbound

This paper cites Equivalence of Approximate Message Passing and Low-Degree Polynomials in Rank-One Matrix Estimation.

Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations Equivalence of Approximate Message Passing and Low-Degree Polynomials in Rank-One Matrix Estimation

Reference 1566

Resolution: unresolved; no resolver link, observed 2026-08-12T17:36:43.772362Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0d3422fd-1c6f-4905-997f-89858e37aebc · outbound

This paper cites An improved algorithm for learning sparse parities in the presence of noise.

Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations An improved algorithm for learning sparse parities in the presence of noise

Reference 2002

Resolution: verified exact; doi, observed 2026-08-12T17:36:43.832265Z

Source-reported events for the cited work

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

Observation 85fa3172-cdd2-431f-a6be-0d3d1977fc09 · outbound

This paper cites Detection of Dense Subhypergraphs by Low-Degree Polynomials.

Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations Detection of Dense Subhypergraphs by Low-Degree Polynomials

Reference 2012

Resolution: unresolved; no resolver link, observed 2026-08-12T17:36:43.756866Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 13752d00-8cb9-4093-92cd-c4e9942a4f92 · outbound

This paper cites Public-key cryptosystems from the w orst-case shortest vector problem: ex- tended abstract.

Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations Public-key cryptosystems from the w orst-case shortest vector problem: ex- tended abstract

Reference 2014

Resolution: unresolved; no resolver link, observed 2026-08-12T17:36:43.782638Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b8d6b243-9906-422f-864a-973e5a659767 · outbound

This paper cites Mult i-party Homomorphic Secret Sharing and Sublinear MPC from Sparse LPN.

Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations Mult i-party Homomorphic Secret Sharing and Sublinear MPC from Sparse LPN

Reference 2020

Resolution: metadata mismatch; raw_fallback, observed 2026-08-12T17:36:44.269438Z

Source-reported events for the cited work

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

Observation 9ae4780c-b4a5-4f8f-a39b-a871d3608a21 · outbound

This paper cites Algorithms and certiﬁcates for Boolean CSP refutation: smoothed is no harder than random.

Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations Algorithms and certiﬁcates for Boolean CSP refutation: smoothed is no harder than random

Reference 2021

Resolution: unresolved; no resolver link, observed 2026-08-12T17:36:43.763012Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8e696cab-53ee-4a3a-876c-69de0542c6f4 · outbound

This paper cites Precise Error Rates for Computationally Efficient Testing.

Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations Precise Error Rates for Computationally Efficient Testing

Reference 2023

Resolution: unresolved; no resolver link, observed 2026-08-12T17:36:43.778071Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

Observation ac17c1da-afb1-4357-ae43-ec66bac437d3 · inbound

Computational Complexity of Statistics: New Insights from Low-Degree Polynomials cites this paper.

Computational Complexity of Statistics: New Insights from Low-Degree Polynomials Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations

Reference 2005

Resolution: verified exact; local_arxiv, observed 2026-08-07T04:24:28.896781Z

Source-reported events for the cited work

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