{"as_of":"2026-08-20T06:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8ec19d9a1cc833a9c96d53bf0c98e26e54d1184bd8715ae4e1c0f9b889a2a40c","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:22:44.453705Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.11268/citation-record","integrity":"/paper/2506.11268/integrity","json":"/paper/2506.11268/citation-record.json","paper":"/paper/2506.11268"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:47.469421Z","title":"Good error-correcting codes based on very sparse matrices,","venue":null,"work_id":"d6611770-6e63-4c53-8b48-1d5b997855d6","year":1999},"citing_paper":{"arxiv_id":"2506.11268","last_updated":"2025-06-12T20:20:53Z","snapshot_observed_at":"2026-08-19T21:16:40.958356Z","submitted_at":"2025-06-12T20:20:53Z","title":"Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:42.700083Z"},"links":{"citing_paper":"/paper/2506.11268"},"observation_digest":"sha256:1edd04e76d14bac39ae981eef1e17a02e8b16c9476df6423a8ab61461ba828f8","observation_id":"566d934a-02bb-450e-8bf7-1db40c6c9f8b","resolution":{"observed_at":"2026-08-07T04:22:47.532403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:47.301361Z","title":"The capacity of low-density parity- check codes under message-passing decoding,","venue":null,"work_id":"fadc52f3-57f2-45e2-ab4f-a77aa8730e42","year":2001},"citing_paper":{"arxiv_id":"2506.11268","last_updated":"2025-06-12T20:20:53Z","snapshot_observed_at":"2026-08-19T21:16:40.958356Z","submitted_at":"2025-06-12T20:20:53Z","title":"Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:42.738473Z"},"links":{"citing_paper":"/paper/2506.11268"},"observation_digest":"sha256:8c44bc97d2c6a28109267b7ee4b51fa79210732e6aa698e11cda4fc25a0b7d3d","observation_id":"352a3678-1671-47d5-98a9-ba34927a33c9","resolution":{"observed_at":"2026-08-07T04:22:47.376716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:42.798513Z","title":"Low-density parity-check codes,","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2506.11268","last_updated":"2025-06-12T20:20:53Z","snapshot_observed_at":"2026-08-19T21:16:40.958356Z","submitted_at":"2025-06-12T20:20:53Z","title":"Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:42.798513Z"},"links":{"citing_paper":"/paper/2506.11268"},"observation_digest":"sha256:2bfe40c340635117587812f8f490b044aeaf3e3af318035284012da0173b8878","observation_id":"cd2590f1-9c7d-4de0-9a24-92b6a275cdea","resolution":{"observed_at":"2026-08-07T04:22:42.798513Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1705.05996","last_updated":"2017-05-17T03:28:19Z","snapshot_observed_at":"2026-08-14T21:00:11.748983Z","submitted_at":"2017-05-17T03:28:19Z","title":"A Survey on Trapping Sets and Stopping Sets","version":1},"cited_work":{"arxiv_id":"1705.05996","doi":null,"metadata_source":"pith","pith_arxiv_id":"1705.05996","snapshot_observed_at":"2026-08-07T04:22:44.584815Z","title":"A Survey on Trapping Sets and Stopping Sets","venue":"cs.IT","work_id":"b16f0e9a-1b63-4c89-9711-1df931071c56","year":2017},"citing_paper":{"arxiv_id":"2506.11268","last_updated":"2025-06-12T20:20:53Z","snapshot_observed_at":"2026-08-19T21:16:40.958356Z","submitted_at":"2025-06-12T20:20:53Z","title":"Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:42.884134Z"},"links":{"cited_paper":"/paper/1705.05996","citing_paper":"/paper/2506.11268"},"observation_digest":"sha256:b4efc260d42c04cee137aa05e509b49688710ac6846d01d5d464e407473b6de5","observation_id":"2b71a17b-a139-4ad8-a5f9-6645d5719d5b","resolution":{"observed_at":"2026-08-07T04:22:44.669359Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:47.155167Z","title":"A unifying framework to construct QC-LDPC tanner graphs of desired girth,","venue":null,"work_id":"31ec671b-2b7c-4ee6-bb94-78c9b85bbf6d","year":2022},"citing_paper":{"arxiv_id":"2506.11268","last_updated":"2025-06-12T20:20:53Z","snapshot_observed_at":"2026-08-19T21:16:40.958356Z","submitted_at":"2025-06-12T20:20:53Z","title":"Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:42.958374Z"},"links":{"citing_paper":"/paper/2506.11268"},"observation_digest":"sha256:5050daeca6a611ae99e486f5c5be6a8e06d91088a48c88e4a431140ce15af241","observation_id":"975436c4-11a3-4d36-893b-943dca819eed","resolution":{"observed_at":"2026-08-07T04:22:47.219023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:47.003457Z","title":"Quasi-cyclic LDPC codes: Influence of proto-and tanner-graph structure on minimum Hamming distance upper bounds,","venue":null,"work_id":"8226a74c-ec29-4249-a747-194b1244311e","year":2012},"citing_paper":{"arxiv_id":"2506.11268","last_updated":"2025-06-12T20:20:53Z","snapshot_observed_at":"2026-08-19T21:16:40.958356Z","submitted_at":"2025-06-12T20:20:53Z","title":"Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:43.048531Z"},"links":{"citing_paper":"/paper/2506.11268"},"observation_digest":"sha256:f0c741d527f51576232a2ec3411ea04344941574d932ee3f322beab38328c9cc","observation_id":"bb5225d7-229a-4822-842e-65d4b562f773","resolution":{"observed_at":"2026-08-07T04:22:47.065585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:46.852742Z","title":"Quasi-Cyclic low-density parity-check codes with girth larger than12,","venue":null,"work_id":"b04ad9d6-7774-42b3-84a0-fe290216236e","year":2007},"citing_paper":{"arxiv_id":"2506.11268","last_updated":"2025-06-12T20:20:53Z","snapshot_observed_at":"2026-08-19T21:16:40.958356Z","submitted_at":"2025-06-12T20:20:53Z","title":"Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:43.153312Z"},"links":{"citing_paper":"/paper/2506.11268"},"observation_digest":"sha256:bae560d5233ca2d7e5355d3d3e7a8d9a0dd8ca410aeec77b75ca8cb4d9a0e761","observation_id":"bfeec916-22f7-4e48-9485-428fa99eb442","resolution":{"observed_at":"2026-08-07T04:22:46.928938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:46.717081Z","title":"Efficient search of girth-optimal QC-LDPC codes,","venue":null,"work_id":"da16b53c-0be0-4093-914e-14b5c12d182f","year":2016},"citing_paper":{"arxiv_id":"2506.11268","last_updated":"2025-06-12T20:20:53Z","snapshot_observed_at":"2026-08-19T21:16:40.958356Z","submitted_at":"2025-06-12T20:20:53Z","title":"Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:43.238095Z"},"links":{"citing_paper":"/paper/2506.11268"},"observation_digest":"sha256:3a75b748cf11885145829b83cfe5832ba406d2225a0de08b5ede593c312e6f99","observation_id":"fbc722d3-0858-4c18-abdc-f2c0ed6451b2","resolution":{"observed_at":"2026-08-07T04:22:46.770741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:46.538668Z","title":"A family of cubical graphs,","venue":null,"work_id":"ae0678af-a842-4e3b-9845-8c816cf16539","year":1947},"citing_paper":{"arxiv_id":"2506.11268","last_updated":"2025-06-12T20:20:53Z","snapshot_observed_at":"2026-08-19T21:16:40.958356Z","submitted_at":"2025-06-12T20:20:53Z","title":"Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:43.346697Z"},"links":{"citing_paper":"/paper/2506.11268"},"observation_digest":"sha256:c53e723279a8f312e1050d245fa7a55a6d3220441ecb1534da17c36a56ad4c62","observation_id":"2f47fae6-3941-4a0f-966d-2cf959e4c661","resolution":{"observed_at":"2026-08-07T04:22:46.626386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:46.398811Z","title":"The Moore bound for irregular graphs,","venue":null,"work_id":"cccd7c34-bcdd-4cf5-9cd2-8172bb41fbcc","year":2002},"citing_paper":{"arxiv_id":"2506.11268","last_updated":"2025-06-12T20:20:53Z","snapshot_observed_at":"2026-08-19T21:16:40.958356Z","submitted_at":"2025-06-12T20:20:53Z","title":"Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:43.428323Z"},"links":{"citing_paper":"/paper/2506.11268"},"observation_digest":"sha256:a87278a21bb3d891e723fe20c2e631f33bd1b92369b67e13b10b5a9f1eee843a","observation_id":"50f406e1-d266-4bf1-9466-79e305269bc5","resolution":{"observed_at":"2026-08-07T04:22:46.475525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:46.241381Z","title":"Extremal problems in graph theory,","venue":null,"work_id":"85ecc33b-75d7-4619-96cf-a3496dac9473","year":1964},"citing_paper":{"arxiv_id":"2506.11268","last_updated":"2025-06-12T20:20:53Z","snapshot_observed_at":"2026-08-19T21:16:40.958356Z","submitted_at":"2025-06-12T20:20:53Z","title":"Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:43.533521Z"},"links":{"citing_paper":"/paper/2506.11268"},"observation_digest":"sha256:6e7931ef88551730b843a5e29a9092e848904bba2e92efeb00c5beef39b8d598","observation_id":"96780499-b6f2-4a8c-bede-52f6b3917437","resolution":{"observed_at":"2026-08-07T04:22:46.311491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:46.087756Z","title":"De Caen and L","venue":null,"work_id":"c77e8c03-26ee-440f-aece-6404575bf660","year":1991},"citing_paper":{"arxiv_id":"2506.11268","last_updated":"2025-06-12T20:20:53Z","snapshot_observed_at":"2026-08-19T21:16:40.958356Z","submitted_at":"2025-06-12T20:20:53Z","title":"Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:43.645707Z"},"links":{"citing_paper":"/paper/2506.11268"},"observation_digest":"sha256:dbcccf316cbf3d9c7a06a1cb447655ae8cbe72de01701aada8fd7505bde01611","observation_id":"4b47a6b8-0217-4759-ad62-606be060e75f","resolution":{"observed_at":"2026-08-07T04:22:46.170524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:45.921847Z","title":"Graphs without cycles of even length,","venue":null,"work_id":"809e4fac-58ce-4e71-aff6-e587ad45c222","year":2001},"citing_paper":{"arxiv_id":"2506.11268","last_updated":"2025-06-12T20:20:53Z","snapshot_observed_at":"2026-08-19T21:16:40.958356Z","submitted_at":"2025-06-12T20:20:53Z","title":"Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:43.735233Z"},"links":{"citing_paper":"/paper/2506.11268"},"observation_digest":"sha256:5d5d1b1efc0e909f53bccb1e41107b1a93eff84621f3f858522e4519e1d38253","observation_id":"88be4d5e-e125-466e-a855-d3f893b1972f","resolution":{"observed_at":"2026-08-07T04:22:46.005232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.06814","last_updated":"2024-02-09T22:38:47Z","snapshot_observed_at":"2026-08-19T20:52:22.618634Z","submitted_at":"2024-02-09T22:38:47Z","title":"High-Rate Fair-Density Parity-Check Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.06814","snapshot_observed_at":"2026-08-07T04:22:43.842536Z","title":"High-rate fair-density parity-check codes,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.11268","last_updated":"2025-06-12T20:20:53Z","snapshot_observed_at":"2026-08-19T21:16:40.958356Z","submitted_at":"2025-06-12T20:20:53Z","title":"Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:43.842536Z"},"links":{"cited_paper":"/paper/2402.06814","citing_paper":"/paper/2506.11268"},"observation_digest":"sha256:fe36bbe994a2a6ab954cb95612e77249b389ac55ef4e6fa1a86e372a127ce6fc","observation_id":"fcb12ffc-efda-4c0e-881c-9842e5e86aed","resolution":{"observed_at":"2026-08-07T04:22:43.842536Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:45.782408Z","title":"Constructions for cubic graphs with large girth,","venue":null,"work_id":"e5c8a443-89fd-4655-9269-ce17f067a659","year":1998},"citing_paper":{"arxiv_id":"2506.11268","last_updated":"2025-06-12T20:20:53Z","snapshot_observed_at":"2026-08-19T21:16:40.958356Z","submitted_at":"2025-06-12T20:20:53Z","title":"Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:43.921280Z"},"links":{"citing_paper":"/paper/2506.11268"},"observation_digest":"sha256:b71d7cb102694086f798df223cdf1dd41579a0952eb6f8dd7f367c450818ae60","observation_id":"4fe78a45-ad49-4720-b2d9-9f2ad27aeb9e","resolution":{"observed_at":"2026-08-07T04:22:45.856274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:45.616208Z","title":"Graphs of prescribed girth and bi-degree,","venue":null,"work_id":"7fac7a13-9a67-4f5f-9807-c74063b066e5","year":1995},"citing_paper":{"arxiv_id":"2506.11268","last_updated":"2025-06-12T20:20:53Z","snapshot_observed_at":"2026-08-19T21:16:40.958356Z","submitted_at":"2025-06-12T20:20:53Z","title":"Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:43.993418Z"},"links":{"citing_paper":"/paper/2506.11268"},"observation_digest":"sha256:044c205f2b391a16bc726dcb275b82c287d7d9ec7be2482cd14694aebfe0b53c","observation_id":"d890a4cc-1354-423d-bbf3-d89b6871b984","resolution":{"observed_at":"2026-08-07T04:22:45.712560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:45.431358Z","title":"Progressive edge-growth tanner graphs,","venue":null,"work_id":"9a648191-dfae-4018-902b-83ca103fd9a2","year":2001},"citing_paper":{"arxiv_id":"2506.11268","last_updated":"2025-06-12T20:20:53Z","snapshot_observed_at":"2026-08-19T21:16:40.958356Z","submitted_at":"2025-06-12T20:20:53Z","title":"Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:44.036139Z"},"links":{"citing_paper":"/paper/2506.11268"},"observation_digest":"sha256:89c102fbe098bfa5372030aac51d341039b8e8d89c16cf16748e359d8c670458","observation_id":"72929819-1412-4712-aa1e-e283e8cfd9ff","resolution":{"observed_at":"2026-08-07T04:22:45.495080Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:45.305446Z","title":"A recursive approach to low complexity codes,","venue":null,"work_id":"3a7df121-5e61-49aa-b233-be94c3f797bd","year":1981},"citing_paper":{"arxiv_id":"2506.11268","last_updated":"2025-06-12T20:20:53Z","snapshot_observed_at":"2026-08-19T21:16:40.958356Z","submitted_at":"2025-06-12T20:20:53Z","title":"Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:44.136665Z"},"links":{"citing_paper":"/paper/2506.11268"},"observation_digest":"sha256:bf265f55fbe3c83fe8665f02d25746a3facf6dc8434cb7e4db9282c08ab92786","observation_id":"c37321b1-6aa1-43d8-b334-bbb03c0ca8d6","resolution":{"observed_at":"2026-08-07T04:22:45.351711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:45.151131Z","title":"On sets of integers which contain no three terms in arithmetical progression,","venue":null,"work_id":"f590bcd8-91e2-43b1-a13a-371039ff16b0","year":1946},"citing_paper":{"arxiv_id":"2506.11268","last_updated":"2025-06-12T20:20:53Z","snapshot_observed_at":"2026-08-19T21:16:40.958356Z","submitted_at":"2025-06-12T20:20:53Z","title":"Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:44.210604Z"},"links":{"citing_paper":"/paper/2506.11268"},"observation_digest":"sha256:2f621b26451ee5d88802c917841d25d063de5c0059bd5ac68fac3cb6100c4917","observation_id":"1bbe5929-797d-4637-bb06-a76403cdf195","resolution":{"observed_at":"2026-08-07T04:22:45.237035Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:45.038388Z","title":"Sequences containing no 3-term arithmetic progres- sions,","venue":null,"work_id":"c2dd39f1-bce3-4f1d-846d-8cad0b9128a5","year":2012},"citing_paper":{"arxiv_id":"2506.11268","last_updated":"2025-06-12T20:20:53Z","snapshot_observed_at":"2026-08-19T21:16:40.958356Z","submitted_at":"2025-06-12T20:20:53Z","title":"Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:44.282690Z"},"links":{"citing_paper":"/paper/2506.11268"},"observation_digest":"sha256:db0f5c8721513dae61e61c7f4b7528e992eb1553e651724717e9a89864b6cd7d","observation_id":"06b4fe9b-89a5-45b9-9775-68631f49b251","resolution":{"observed_at":"2026-08-07T04:22:45.082163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:44.892075Z","title":"Finding large 3-free sets i: The small n case,","venue":null,"work_id":"69152eff-4634-41e3-98c9-031cb8bdd198","year":2008},"citing_paper":{"arxiv_id":"2506.11268","last_updated":"2025-06-12T20:20:53Z","snapshot_observed_at":"2026-08-19T21:16:40.958356Z","submitted_at":"2025-06-12T20:20:53Z","title":"Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:44.358266Z"},"links":{"citing_paper":"/paper/2506.11268"},"observation_digest":"sha256:147aebc52c2874b1d2056c4411342b5bb2c3a2a1e96d8beb9b9ee33c516efe65","observation_id":"8a3dd31c-5bd8-4e99-893e-e8791a86f418","resolution":{"observed_at":"2026-08-07T04:22:44.968092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:44.763645Z","title":"On sets of integers which contain no three terms in arithmetical progression,","venue":null,"work_id":"6a10483e-f5d2-4633-bf8c-093dfbd0e0fc","year":1942},"citing_paper":{"arxiv_id":"2506.11268","last_updated":"2025-06-12T20:20:53Z","snapshot_observed_at":"2026-08-19T21:16:40.958356Z","submitted_at":"2025-06-12T20:20:53Z","title":"Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:44.453705Z"},"links":{"citing_paper":"/paper/2506.11268"},"observation_digest":"sha256:55e750fb78f7e69e649f1d7f11b2d4859a95e1f2c8f7215c31bf888ab1584811","observation_id":"b8eb6753-a041-4fb3-89b5-0a48730348df","resolution":{"observed_at":"2026-08-07T04:22:44.847775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.11268","last_updated":"2025-06-12T20:20:53Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-19T21:16:40.958356Z","submitted_at":"2025-06-12T20:20:53Z","title":"Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":1,"verified_fuzzy":19},"total_outbound_references":22},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"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."}