Pith. sign in

Paper Citation Record · LEDGER

Validation of Quantum Elliptic Curve Point Addition Circuits

As of 8 August 2026, this Paper Citation Record lists 6 of 6 outbound references and 0 inbound Pith citation observations for arXiv:2506.03318.

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

pith.paper-citation-record.v1
2506.03318 v2

Coverage vector

measured 6 of 6 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T11:13:30.355834Z

measured 6 of 6 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+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

6 of 6 outbound references displayed

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

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 697295e4-9cb1-4aa6-b2c4-cee34359fa29 · outbound

This paper cites Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer.

Validation of Quantum Elliptic Curve Point Addition Circuits Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:13:32.101187Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:13:29.210697Z digest=sha256:0c7cb4c8c2ef226cf4549f57802d1e86c27a4ec9ed995f2bb255126388be3150

Observation cfc4b539-a4bb-4f53-b7c8-1524475185db · outbound

This paper cites How to compute a 256-bit elliptic curve private key with only 50 million toffoli gates, 2023.

Validation of Quantum Elliptic Curve Point Addition Circuits How to compute a 256-bit elliptic curve private key with only 50 million toffoli gates, 2023

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:13:31.738842Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:13:29.649619Z digest=sha256:4a3ca8a4afd45669e958321cb08c03564ece419de58cb605a6418516d7ece2e5

Observation 146fd9a0-32b1-4e83-8da2-c5f09b4ef058 · outbound

This paper cites Harrigan, Tanuj Khattar, Charles Yuan, Anurudh Peduri, Noureldin Yosri, Fionn D.

Validation of Quantum Elliptic Curve Point Addition Circuits Harrigan, Tanuj Khattar, Charles Yuan, Anurudh Peduri, Noureldin Yosri, Fionn D

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:13:31.421502Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:13:30.056479Z digest=sha256:d3b23bce77c0ed9908038003f97957c87b201fc08118b5d2f0132a862d0e754f

Observation 76f444fb-8de9-49e0-8481-b1ded5057bec · outbound

This paper cites Modular multiplication without trial division.

Validation of Quantum Elliptic Curve Point Addition Circuits Modular multiplication without trial division

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:13:31.170021Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:13:30.166063Z digest=sha256:8f51008dde54434a46d4711d90d46fe740502dbf4ffa9679d8349150057a4ebf

Observation 18e5cfd8-700e-4d38-a9a6-c216f0bfc841 · outbound

This paper cites Performance analysis of a repetition cat code architecture: Computing 256-bit elliptic curve logarithm in 9 hours with 126133 cat qubits.

Validation of Quantum Elliptic Curve Point Addition Circuits Performance analysis of a repetition cat code architecture: Computing 256-bit elliptic curve logarithm in 9 hours with 126133 cat qubits

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:13:30.963058Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:13:30.257616Z digest=sha256:259cba07e61cb0a90490e6ae69b8faf5a0f2e810658efae8beaf91ab30db43b8

Observation e0dda1ce-45c1-4770-bb09-5eb207ef4a63 · outbound

This paper cites Practical cryptography for developers: Elliptic curve cryptography (ecc).

Validation of Quantum Elliptic Curve Point Addition Circuits Practical cryptography for developers: Elliptic curve cryptography (ecc)

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:13:30.620081Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T11:13:30.355834Z digest=sha256:5e5634767deeb1752dfc1041410a58aac8861b99b2ea772117e534b87b32c4a8

Pith citing papers

No inbound Pith citation observations are available.