Pith. sign in

Paper Citation Record · LEDGER

Polylog-time- and constant-space-overhead fault-tolerant quantum computation with quantum low-density parity-check codes

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

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

pith.paper-citation-record.v1
2411.03683 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

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 6 of 6 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-05T23:50:30.099803Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-18T05:20:54.507287Z

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 ec91c455-5708-4eeb-8c98-b459e113767d · inbound

Automorphism gadgets in homological product codes cites this paper.

Automorphism gadgets in homological product codes Polylog-time- and constant-space-overhead fault-tolerant quantum computation with quantum low-density parity-check codes

Reference 84

Resolution
unresolved
no resolver link, observed 2026-08-05T23:50:18.442551Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T23:50:18.442551Z digest=sha256:0773ecd62c909ad208f4aed0f5cbbd6ad6dc8c62384cd1ec2be1699f9969bdcc

Observation 0e76ccd8-7e4f-4894-8be6-aa0f46db0743 · inbound

Parity-Aware Byte-Pair Encoding: Improving Cross-lingual Fairness in Tokenization cites this paper.

Parity-Aware Byte-Pair Encoding: Improving Cross-lingual Fairness in Tokenization Polylog-time- and constant-space-overhead fault-tolerant quantum computation with quantum low-density parity-check codes

Reference 1996

Resolution
unresolved
no resolver link, observed 2026-08-05T23:50:30.099803Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T23:50:30.099803Z digest=sha256:77b3a06def9a4d096c10b15ea42e519aeb14de668c468f0af5da9053ef30b347

Observation 389608c3-9b99-45c5-b8ec-72ef468b93bc · inbound

Degeneracy Cutting: A Local and Efficient Post-Processing for Belief Propagation Decoding of Quantum Low-Density Parity-Check Codes cites this paper.

Degeneracy Cutting: A Local and Efficient Post-Processing for Belief Propagation Decoding of Quantum Low-Density Parity-Check Codes Polylog-time- and constant-space-overhead fault-tolerant quantum computation with quantum low-density parity-check codes

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-04T10:47:12.096051Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T10:47:12.096051Z digest=sha256:5945753524e6a5df43152c31432123f2ccbb7966d7e26b5573ea0447c2a50fd9

Observation e942205c-60bf-48d0-9956-6fc5857ee3cf · inbound

Accelerating Fault-Tolerant Quantum Computation with Good qLDPC Codes cites this paper.

Accelerating Fault-Tolerant Quantum Computation with Good qLDPC Codes Polylog-time- and constant-space-overhead fault-tolerant quantum computation with quantum low-density parity-check codes

Reference 45

Resolution
verified exact
arxiv_id, observed 2026-05-18T05:20:54.509736Z

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-05-18T05:16:35.002960Z digest=sha256:93f4fcd8930287c5751000af10edcdee6529a20dfcc6d11affca849c7ee3512b

Observation 47c24c09-87ed-46b1-ae9c-0ce2e749ab18 · inbound

Proof of a finite threshold for the union-find decoder cites this paper.

Proof of a finite threshold for the union-find decoder Polylog-time- and constant-space-overhead fault-tolerant quantum computation with quantum low-density parity-check codes

Reference 7

Resolution
verified exact
arxiv_id, observed 2026-05-15T20:16:34.800423Z

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-05-15T20:12:10.149451Z digest=sha256:7dbb88369328f76a92b3538472664f408110123ae363062769b1d23f2435e662

Observation d521c796-5f5e-4fc8-bf8e-4845d68a3df2 · inbound

Distilling Magic States in the Bicycle Architecture cites this paper.

Distilling Magic States in the Bicycle Architecture Polylog-time- and constant-space-overhead fault-tolerant quantum computation with quantum low-density parity-check codes

Reference 2024

Resolution
unresolved
no resolver link, observed 2026-08-02T21:27:59.589101Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T21:27:59.589101Z digest=sha256:c125cd457b1bb569558cfa2e0bd06d21975018f8b3f2fc0e5dfdb9aad29e3303