Pith. sign in

Paper Citation Record · LEDGER

Lowering Connectivity Requirements For Bivariate Bicycle Codes Using Morphing Circuits

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

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

pith.paper-citation-record.v1
2407.16336 v3

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-12T06:34:41.77262+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-12T04:28:05.729743Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-07-03T01:07:30.456021Z

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 4b4f93a7-b024-4051-afa5-dc5822efc8d7 · inbound

Operator algebra and algorithmic construction of boundaries and defects in (2+1)D topological Pauli stabilizer codes cites this paper.

Operator algebra and algorithmic construction of boundaries and defects in (2+1)D topological Pauli stabilizer codes Lowering Connectivity Requirements For Bivariate Bicycle Codes Using Morphing Circuits

Reference 121

Resolution
verified exact
arxiv_id, observed 2026-05-23T18:43:19.037924Z

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-05-23T18:41:14.926900Z digest=sha256:ad4b414780b37f59b3ec85e6b49a781d934bfc25f4bc54163be2d440c11b9a12

Observation 0435cf3b-9287-4a2b-867f-b0e505883dc3 · inbound

Transversal Logical Clifford gates on rotated surface codes with reconfigurable neutral atom arrays cites this paper.

Transversal Logical Clifford gates on rotated surface codes with reconfigurable neutral atom arrays Lowering Connectivity Requirements For Bivariate Bicycle Codes Using Morphing Circuits

Reference 41

Resolution
unresolved
no resolver link, observed 2026-08-12T04:28:05.729743Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-12T04:28:05.729743Z digest=sha256:a9305fe452375189384670970a88780fc63fb751f93d234403cc1ab932c13574

Observation 08183b5c-8bce-47ac-abdc-44b3921735a2 · inbound

Diamond Circuits for Surface Codes cites this paper.

Diamond Circuits for Surface Codes Lowering Connectivity Requirements For Bivariate Bicycle Codes Using Morphing Circuits

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-07T18:23:40.684318Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T18:23:40.684318Z digest=sha256:c3b67c997c848e86cec347625824e1cc59c59b7862d237061d05c5d2c14ae40f

Observation 70b65f1e-cc90-4dd6-a94a-833e97c250e7 · inbound

Geometry-induced correlated noise in qLDPC syndrome extraction cites this paper.

Geometry-induced correlated noise in qLDPC syndrome extraction Lowering Connectivity Requirements For Bivariate Bicycle Codes Using Morphing Circuits

Reference 43

Resolution
verified exact
arxiv_id, observed 2026-05-13T22:13:20.957455Z

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-05-13T22:08:43.050338Z digest=sha256:a319f290b221907b219d5683f6ca0d3dfd6d3bbe5a66ef4fd334b31ca692f2da

Observation b806b7f2-e1c8-465c-aa33-f221ff9387e3 · inbound

The dynamic 4.8.8 Floquet code cites this paper.

The dynamic 4.8.8 Floquet code Lowering Connectivity Requirements For Bivariate Bicycle Codes Using Morphing Circuits

Reference 17

Resolution
verified exact
arxiv_id, observed 2026-07-03T01:07:30.457438Z

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-06-27T16:48:32.905893Z digest=sha256:270549da5ac7d81eae92b879e44f2bd0ef4f4112f56f82afca3861686455dfef

Observation 82eb7875-2443-4e8e-9412-534af35d0ad8 · inbound

Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search cites this paper.

Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search Lowering Connectivity Requirements For Bivariate Bicycle Codes Using Morphing Circuits

Reference 31

Resolution
unresolved
no resolver link, observed 2026-08-11T23:22:37.671803Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T23:22:37.671803Z digest=sha256:5f1e458d3bfb8397e7abc8a4a6a7e04860def5277c4bb9d4a04bee7dff8361c2