Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-06-28T01:05:50.645155Z
Paper Citation Record · LEDGER
Towards Worst-case Hardness for Low-Noise LPN
As of 15 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2606.05834.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-14T06:32:32.682623+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
21 of 21 outbound references displayed
- verified exact15
- verified fuzzy0
- unresolved2
- parse uncertain0
- malformed identifier2
- metadata mismatch2
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 254d1df3-2a90-4b0d-8919-2ac7a64a0031 · outbound
This paper cites Hardness Amplification for (Sparse) LPN.
Towards Worst-case Hardness for Low-Noise LPN Hardness Amplification for (Sparse) LPN
Reference 1
- Resolution
- metadata mismatch
- local_arxiv, observed 2026-07-02T13:46:58.833143Z
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.
Observation 5e6fa5f6-abb0-48e8-afda-98378f5e2b0a · outbound
This paper cites Simplified and improved resolution lower bounds.
Towards Worst-case Hardness for Low-Noise LPN Simplified and improved resolution lower bounds
Reference 2
- Resolution
- malformed identifier
- doi_truncated, observed 2026-06-28T01:11:28.456669Z
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.
Observation 59abfa8a-59e6-45b2-a2cc-590b8239274c · outbound
This paper cites 23,doi:10.4230/LIPICS.ITCS.2026.23.
Towards Worst-case Hardness for Low-Noise LPN 23,doi:10.4230/LIPICS.ITCS.2026.23
Reference 3
- Resolution
- verified exact
- doi, observed 2026-06-28T01:11:28.461385Z
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.
Observation 68eb7646-e8bf-4a58-9b19-fefb43ae09bb · outbound
This paper cites 14 [BJMM12] Anja Becker, Antoine Joux, Alexander May, and Alexander Meurer.
Towards Worst-case Hardness for Low-Noise LPN 14 [BJMM12] Anja Becker, Antoine Joux, Alexander May, and Alexander Meurer
Reference 4
- Resolution
- verified exact
- doi, observed 2026-06-28T01:11:28.458692Z
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.
Observation d937a56f-876f-4465-85c9-96cc16f931a2 · outbound
This paper cites doi:10.1007/978-3-642-29011-4_31.
Towards Worst-case Hardness for Low-Noise LPN doi:10.1007/978-3-642-29011-4_31
Reference 5
- Resolution
- verified exact
- doi, observed 2026-06-28T01:11:28.460601Z
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.
Observation a60449b6-4907-4d94-9fd5-9912e6e09299 · outbound
This paper cites Worst-case hardness for LPN and cryptographic hashing via code smoothing.
Towards Worst-case Hardness for Low-Noise LPN Worst-case hardness for LPN and cryptographic hashing via code smoothing
Reference 6
- Resolution
- unresolved
- no resolver link, observed 2026-06-28T01:05:50.645155Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 87f2decc-05e8-41e2-bddb-afd0faa745ef · outbound
This paper cites [BM17] Leif Both and Alexander May.
Towards Worst-case Hardness for Low-Noise LPN [BM17] Leif Both and Alexander May
Reference 7
- Resolution
- malformed identifier
- no resolver link, observed 2026-06-28T01:05:50.645155Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation e1b09c0a-8a98-424a-9fb1-02e29741dec5 · outbound
This paper cites [BM18] Leif Both and Alexander May.
Towards Worst-case Hardness for Low-Noise LPN [BM18] Leif Both and Alexander May
Reference 8
- Resolution
- unresolved
- no resolver link, observed 2026-06-28T01:05:50.645155Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation e7d73bc4-4ba0-4242-8587-51b4c08ebe68 · outbound
This paper cites doi:10.1007/978-3-319-79063-3_2.
Towards Worst-case Hardness for Low-Noise LPN doi:10.1007/978-3-319-79063-3_2
Reference 9
- Resolution
- verified exact
- doi, observed 2026-06-28T01:11:28.479837Z
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.
Observation b18d8c77-1640-46f6-9dbd-2e8c813fb80d · outbound
This paper cites [DR25] Thomas Debris-Alazard and Nicolas Resch.
Towards Worst-case Hardness for Low-Noise LPN [DR25] Thomas Debris-Alazard and Nicolas Resch
Reference 10
- Resolution
- verified exact
- doi, observed 2026-06-28T01:11:28.477351Z
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.
Observation 98308c39-5ea2-4415-908c-2dca9994ca74 · outbound
This paper cites an unresolved cited work.
Towards Worst-case Hardness for Low-Noise LPN Unresolved cited work
Reference 11
- Resolution
- verified exact
- doi, observed 2026-06-28T01:11:28.481650Z
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.
Observation fbf7aeb8-d213-4878-b655-196dd9cdb96e · outbound
This paper cites The parity problem in the presence of noise, decoding random linear codes, and the subset sum problem.
Towards Worst-case Hardness for Low-Noise LPN The parity problem in the presence of noise, decoding random linear codes, and the subset sum problem
Reference 12
- Resolution
- verified exact
- doi, observed 2026-06-28T01:11:28.483769Z
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.
Observation 71b50f4b-d039-4ee5-ab7d-e7facc0d415d · outbound
This paper cites [MMT11] Alexander May, Alexander Meurer, and Enrico Thomae.
Towards Worst-case Hardness for Low-Noise LPN [MMT11] Alexander May, Alexander Meurer, and Enrico Thomae
Reference 13
- Resolution
- verified exact
- doi, observed 2026-06-28T01:11:28.485429Z
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.
Observation e1d0049f-fb09-4e67-bd8a-2c0daa4f0c8e · outbound
This paper cites doi:10.1007/978-3-642-25385-0_6.
Towards Worst-case Hardness for Low-Noise LPN doi:10.1007/978-3-642-25385-0_6
Reference 14
- Resolution
- verified exact
- doi, observed 2026-06-28T01:11:28.489341Z
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.
Observation 6c5a8abf-c4cf-4143-85ee-d636331715ae · outbound
This paper cites [PB25] Madhura Pathegama and Alexander Barg.
Towards Worst-case Hardness for Low-Noise LPN [PB25] Madhura Pathegama and Alexander Barg
Reference 15
- Resolution
- verified exact
- doi, observed 2026-06-28T01:11:28.487595Z
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.
Observation cc5fa87b-a01a-4e1c-9316-d94294022389 · outbound
This paper cites [Pei09] Chris Peikert.
Towards Worst-case Hardness for Low-Noise LPN [Pei09] Chris Peikert
Reference 16
- Resolution
- verified exact
- doi, observed 2026-06-28T01:11:28.465678Z
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.
Observation f1fb9db0-6078-4f83-b254-c0fdc9530dc2 · outbound
This paper cites Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing , pages =.
Towards Worst-case Hardness for Low-Noise LPN Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing , pages =
Reference 17
- Resolution
- metadata mismatch
- arxiv_id, observed 2026-06-28T01:11:28.488373Z
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.
Observation 0d85b6d7-534a-498b-a296-5912e589babc · outbound
This paper cites semanticscholar.org/CorpusID:8357564.
Towards Worst-case Hardness for Low-Noise LPN semanticscholar.org/CorpusID:8357564
Reference 18
- Resolution
- verified exact
- arxiv_id, observed 2026-06-28T01:11:28.473702Z
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.
Observation 0c277516-bb15-440f-8445-7fc46dd49e5c · outbound
This paper cites A method for finding codewords of small weight.
Towards Worst-case Hardness for Low-Noise LPN A method for finding codewords of small weight
Reference 19
- Resolution
- verified exact
- doi, observed 2026-06-28T01:11:28.483606Z
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.
Observation b2bf887c-02a3-45c2-85f5-397b51f06b08 · outbound
This paper cites [YZ21] Yu Yu and Jiang Zhang.
Towards Worst-case Hardness for Low-Noise LPN [YZ21] Yu Yu and Jiang Zhang
Reference 20
- Resolution
- verified exact
- doi, observed 2026-06-28T01:11:28.468293Z
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.
Observation 94aa2e75-635d-4af7-9c6b-49f5d09a4740 · outbound
This paper cites A Deferred Proof Fact 2.1.(Piling Up Lemma).LetX 1, X2,.
Towards Worst-case Hardness for Low-Noise LPN A Deferred Proof Fact 2.1.(Piling Up Lemma).LetX 1, X2,
Reference 21
- Resolution
- verified exact
- doi, observed 2026-06-28T01:11:28.490575Z
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.
Pith citing papers
No inbound Pith citation observations are available.