Pith. sign in

Paper Citation Record · LEDGER

One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time

As of 12 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2608.03220.

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

pith.paper-citation-record.v1
2608.03220 v1

Coverage vector

measured 17 of 17 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-05T23:39:43.073563Z

measured 17 of 17 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-12T06:34:41.77262+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

17 of 17 outbound references displayed

  • verified exact9
  • verified fuzzy1
  • unresolved3
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch4

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 77e8a09d-7d70-40cc-8532-cef12c859960 · outbound

This paper cites Fine- grained hardness of CVP(P) – everything that we can prove (and nothing else).

One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time Fine- grained hardness of CVP(P) – everything that we can prove (and nothing else)

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T23:39:43.489779Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-05T23:39:42.893369Z digest=sha256:36afc9497077049a96d70b7b5981006c1ffe9acb3dd92ccfe273cdb9c84032ff

Observation aef1b63d-3915-4d73-b9db-dc4e5d02a6af · outbound

This paper cites an unresolved cited work.

One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time Unresolved cited work

Reference 4

Resolution
verified exact
doi, observed 2026-08-05T23:39:43.229197Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-05T23:39:42.907868Z digest=sha256:b6954ec805afb266e8b0c663f6b60a9060c71cb25147b65a9155121fb9f6aee7

Observation 4f30122b-2b5f-4996-8bd5-e5ad508216ba · outbound

This paper cites an unresolved cited work.

One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time Unresolved cited work

Reference 5

Resolution
verified exact
doi, observed 2026-08-05T23:39:43.212820Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-05T23:39:43.016924Z digest=sha256:1bcf70f31af8a394b5ce797ea49671ca2a31967f949e43f38864936830c2aad9

Observation 1092c05d-ca54-44e3-8184-c922b943609b · outbound

This paper cites [DRS14] Daniel Dadush, Oded Regev, and Noah Stephens-Davidowitz.

One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time [DRS14] Daniel Dadush, Oded Regev, and Noah Stephens-Davidowitz

Reference 10

Resolution
verified exact
doi, observed 2026-08-05T23:39:43.167932Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-05T23:39:43.040878Z digest=sha256:1b63bc701f8e110a4a3416b35904c07bce78851fef94271c1d5938ff102f4651

Observation 5a8bff85-ace6-4ac3-b8c9-cb22bd1c403f · outbound

This paper cites 26 [GPV08] Craig Gentry, Chris Peikert, and Vinod Vaikuntanathan.

One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time 26 [GPV08] Craig Gentry, Chris Peikert, and Vinod Vaikuntanathan

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-05T23:39:43.051164Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T23:39:43.051164Z digest=sha256:50c10066499e5422a17a3b6f9ee69afadfc0b7beab241eed2e2d47f496f3f164

Observation 52bacc4f-30f7-4f28-943a-e727016061c6 · outbound

This paper cites Solving the Shortest Vector Problem in $2^{0.6039n}$ Time via Mid-point Hessian.

One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time Solving the Shortest Vector Problem in $2^{0.6039n}$ Time via Mid-point Hessian

Reference 13

Resolution
verified exact
local_arxiv, observed 2026-08-05T23:39:43.274323Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-05T23:39:43.055614Z digest=sha256:71bd66ebc5ed18872e1b54b5b8d5a35f45f56b8654892d1a20c0ec7f18703b19

Observation 7194fe4f-994a-48f2-8986-66c396e98029 · outbound

This paper cites Just take the average! an embarrassingly simple 2 n-time algorithm for SVP (and CVP).

One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time Just take the average! an embarrassingly simple 2 n-time algorithm for SVP (and CVP)

Reference 39

Resolution
verified exact
doi, observed 2026-08-05T23:39:43.198630Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-05T23:39:43.021889Z digest=sha256:c64211a1d80456225d9d0d64fa7b0b5b431c37bcc1c62dba7967b59ca4cc52fa

Observation 9acb4076-1a0d-40cf-b0f0-92316fc22122 · outbound

This paper cites [MV13] Daniele Micciancio and Panagiotis Voulgaris.

One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time [MV13] Daniele Micciancio and Panagiotis Voulgaris

Reference 2007

Resolution
unresolved
no resolver link, observed 2026-08-05T23:39:43.059873Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T23:39:43.059873Z digest=sha256:cff106ab9d2078f83a736c19b5b9ad0aca72d18c2f5078f8179c7e5bd98efb50

Observation 2a43a848-fd65-48df-a6d0-8c367f3cce46 · outbound

This paper cites [PS26] Amaury Pouly and Yixin Shen.

One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time [PS26] Amaury Pouly and Yixin Shen

Reference 2009

Resolution
verified exact
doi, observed 2026-08-05T23:39:43.127920Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-05T23:39:43.069142Z digest=sha256:ef04e874df15c8939ba37b0256bfa055b99796e83f71d16d2ad84389e9165f35

Observation fc9ab3e1-4c7b-4695-928a-c932d7490164 · outbound

This paper cites Classical Hardness of Learning with Errors.

One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time Classical Hardness of Learning with Errors

Reference 2013

Resolution
metadata mismatch
local_arxiv, observed 2026-08-05T23:39:43.430965Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-05T23:39:43.026716Z digest=sha256:38fbaec69b935f0306468a414915f599980a96ca0669a17c30902f35a161c971

Observation ffbd6501-d373-43ce-b6aa-b8e0e83d2dc7 · outbound

This paper cites Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling.

One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling

Reference 2015

Resolution
metadata mismatch
local_arxiv, observed 2026-08-05T23:39:43.454744Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-05T23:39:42.903360Z digest=sha256:0bbd2b7aea729565820fff7747e8def65174e727745df057b61db059365131e4

Observation 1990094a-ea3d-4b86-99bd-373a8c1be3eb · outbound

This paper cites [SZ24] Naser Talebizadeh Sardari and Masoud Zargar.

One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time [SZ24] Naser Talebizadeh Sardari and Masoud Zargar

Reference 2016

Resolution
verified exact
doi, observed 2026-08-05T23:39:43.112213Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-05T23:39:43.073563Z digest=sha256:c9dd1e55223086b3b747f6f2e6e42308532ae3e8f2c1b365b0282bf15cc5ffc5

Observation 23c855f7-6ba3-4530-a7fe-4c92fdfd5e30 · outbound

This paper cites [CDLP13] Kai-Min Chung, Daniel Dadush, Feng-Hao Liu, and Chris Peikert.

One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time [CDLP13] Kai-Min Chung, Daniel Dadush, Feng-Hao Liu, and Chris Peikert

Reference 2018

Resolution
verified exact
doi, observed 2026-08-05T23:39:43.183484Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-05T23:39:43.031417Z digest=sha256:0d73756809cfe9d261beec4ccbcb113d6693ff30d3c3af486ee4a705a62b8356

Observation d4ece076-837b-4632-95d5-50aca4c9eaef · outbound

This paper cites On the extreme zeros of Jacobi polynomials.

One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time On the extreme zeros of Jacobi polynomials

Reference 2020

Resolution
metadata mismatch
local_arxiv, observed 2026-08-05T23:39:43.252432Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-05T23:39:43.064145Z digest=sha256:139354c374d0fa30e23874fbab067f322810c1780db42ee1a432a4c6a2d29921

Observation ed0b84dd-9c1d-4261-a2eb-52d2a76b7767 · outbound

This paper cites [GFH26] Yiming Gao, Yansong Feng, and Honggang Hu.

One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time [GFH26] Yiming Gao, Yansong Feng, and Honggang Hu

Reference 2023

Resolution
verified exact
doi, observed 2026-08-05T23:39:43.153218Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-05T23:39:43.046443Z digest=sha256:de5fbffbd9f39b027e47c645915807d4ca538bec4cb5e92585da8c7dc5bbc570

Observation 77658ccd-ad4a-4c2f-9129-39698c686470 · outbound

This paper cites Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding.

One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding

Reference 2025

Resolution
unresolved
no resolver link, observed 2026-08-05T23:39:42.898145Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T23:39:42.898145Z digest=sha256:e4344b3ceeab0307e768650a19f13b4dffe62da070a643dcfe6bda9b3a429b82

Observation 82319287-fa41-4363-b054-eea12ee299e0 · outbound

This paper cites Quantum algorithm for Discrete Gaussian Sampling.

One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time Quantum algorithm for Discrete Gaussian Sampling

Reference 2026

Resolution
metadata mismatch
local_arxiv, observed 2026-08-05T23:39:43.406715Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-05T23:39:43.036060Z digest=sha256:0693e24211d84abb17cce655936f12a5937b343e73cc250580f33512406f663a

Pith citing papers

No inbound Pith citation observations are available.