Paper Citation Record · LEDGER

Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs

As of 20 August 2026, this Paper Citation Record lists 22 of 22 outbound references and 0 inbound Pith citation observations for arXiv:2506.11268.

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

pith.paper-citation-record.v1
2506.11268 v1

Coverage vector

measured 22 of 22 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T04:22:44.453705Z

measured 22 of 22 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-20T06:33:59.587034+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

22 of 22 outbound references displayed

verified exact1
verified fuzzy19
unresolved2
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 566d934a-02bb-450e-8bf7-1db40c6c9f8b · outbound

This paper cites Good error-correcting codes based on very sparse matrices,.

Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs Good error-correcting codes based on very sparse matrices,

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:47.532403Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 352a3678-1671-47d5-98a9-ba34927a33c9 · outbound

This paper cites The capacity of low-density parity- check codes under message-passing decoding,.

Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs The capacity of low-density parity- check codes under message-passing decoding,

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:47.376716Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation cd2590f1-9c7d-4de0-9a24-92b6a275cdea · outbound

This paper cites Low-density parity-check codes,.

Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs Low-density parity-check codes,

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-07T04:22:42.798513Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2b71a17b-a139-4ad8-a5f9-6645d5719d5b · outbound

This paper cites A Survey on Trapping Sets and Stopping Sets.

Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs A Survey on Trapping Sets and Stopping Sets

Reference 4

Resolution: verified exact; local_arxiv, observed 2026-08-07T04:22:44.669359Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 975436c4-11a3-4d36-893b-943dca819eed · outbound

This paper cites A unifying framework to construct QC-LDPC tanner graphs of desired girth,.

Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs A unifying framework to construct QC-LDPC tanner graphs of desired girth,

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:47.219023Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation bb5225d7-229a-4822-842e-65d4b562f773 · outbound

This paper cites Quasi-cyclic LDPC codes: Influence of proto-and tanner-graph structure on minimum Hamming distance upper bounds,.

Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs Quasi-cyclic LDPC codes: Influence of proto-and tanner-graph structure on minimum Hamming distance upper bounds,

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:47.065585Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation bfeec916-22f7-4e48-9485-428fa99eb442 · outbound

This paper cites Quasi-Cyclic low-density parity-check codes with girth larger than12,.

Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs Quasi-Cyclic low-density parity-check codes with girth larger than12,

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:46.928938Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation fbc722d3-0858-4c18-abdc-f2c0ed6451b2 · outbound

This paper cites Efficient search of girth-optimal QC-LDPC codes,.

Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs Efficient search of girth-optimal QC-LDPC codes,

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:46.770741Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 2f47fae6-3941-4a0f-966d-2cf959e4c661 · outbound

This paper cites A family of cubical graphs,.

Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs A family of cubical graphs,

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:46.626386Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 50f406e1-d266-4bf1-9466-79e305269bc5 · outbound

This paper cites The Moore bound for irregular graphs,.

Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs The Moore bound for irregular graphs,

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:46.475525Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 96780499-b6f2-4a8c-bede-52f6b3917437 · outbound

This paper cites Extremal problems in graph theory,.

Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs Extremal problems in graph theory,

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:46.311491Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 4b47a6b8-0217-4759-ad62-606be060e75f · outbound

This paper cites De Caen and L.

Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs De Caen and L

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:46.170524Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 88be4d5e-e125-466e-a855-d3f893b1972f · outbound

This paper cites Graphs without cycles of even length,.

Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs Graphs without cycles of even length,

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:46.005232Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation fcb12ffc-efda-4c0e-881c-9842e5e86aed · outbound

This paper cites High-Rate Fair-Density Parity-Check Codes.

Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs High-Rate Fair-Density Parity-Check Codes

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-07T04:22:43.842536Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4fe78a45-ad49-4720-b2d9-9f2ad27aeb9e · outbound

This paper cites Constructions for cubic graphs with large girth,.

Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs Constructions for cubic graphs with large girth,

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:45.856274Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation d890a4cc-1354-423d-bbf3-d89b6871b984 · outbound

This paper cites Graphs of prescribed girth and bi-degree,.

Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs Graphs of prescribed girth and bi-degree,

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:45.712560Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 72929819-1412-4712-aa1e-e283e8cfd9ff · outbound

This paper cites Progressive edge-growth tanner graphs,.

Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs Progressive edge-growth tanner graphs,

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:45.495080Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation c37321b1-6aa1-43d8-b334-bbb03c0ca8d6 · outbound

This paper cites A recursive approach to low complexity codes,.

Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs A recursive approach to low complexity codes,

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:45.351711Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 1bbe5929-797d-4637-bb06-a76403cdf195 · outbound

This paper cites On sets of integers which contain no three terms in arithmetical progression,.

Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs On sets of integers which contain no three terms in arithmetical progression,

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:45.237035Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 06b4fe9b-89a5-45b9-9775-68631f49b251 · outbound

This paper cites Sequences containing no 3-term arithmetic progres- sions,.

Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs Sequences containing no 3-term arithmetic progres- sions,

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:45.082163Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 8a3dd31c-5bd8-4e99-893e-e8791a86f418 · outbound

This paper cites Finding large 3-free sets i: The small n case,.

Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs Finding large 3-free sets i: The small n case,

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:44.968092Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation b8eb6753-a041-4fb3-89b5-0a48730348df · outbound

This paper cites On sets of integers which contain no three terms in arithmetical progression,.

Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs On sets of integers which contain no three terms in arithmetical progression,

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:44.847775Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Pith citing papers

No inbound Pith citation observations are available.