Pith. sign in

Paper Citation Record · LEDGER

Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling

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

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

pith.paper-citation-record.v1
1412.7994 v5

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-12T06:34:41.77262+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-07T20:26:29.913987Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-05T23:39:43.449005Z

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 5c442ea2-9a06-403e-964f-1ea069751c05 · inbound

A Unified Framework for High-Dimensional Pure Root Lattices, Sphere Packing, and Cosmological Implications cites this paper.

A Unified Framework for High-Dimensional Pure Root Lattices, Sphere Packing, and Cosmological Implications Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-07T20:26:29.913987Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T20:26:29.913987Z digest=sha256:e7d833134f8963afb755b169bea7d506259a95b60591e869d0118facc87bca4a

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

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

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