{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:OJIPHFUI6CI3VSLX3JGWXGEY53","short_pith_number":"pith:OJIPHFUI","schema_version":"1.0","canonical_sha256":"7250f39688f091bac977da4d6b9898eef1f290414d770b02298b3f60b25f21d9","source":{"kind":"arxiv","id":"2506.11268","version":1},"attestation_state":"computed","paper":{"title":"Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hessam Mahdavifar, Mohsen Moradi, Sheida Rabeti","submitted_at":"2025-06-12T20:20:53Z","abstract_excerpt":"In this paper, we explore the design and analysis of regular bipartite graphs motivated by their application in low-density parity-check (LDPC) codes specifically with constrained girth and in the high-rate regime. We focus on the relation between the girth of the graph, and the size of the sets of variable and check nodes. We derive bounds on the size of the vertices in regular bipartite graphs, showing how the required number of check nodes grows with respect to the number of variable nodes as girth grows large. Furthermore, we present two constructions for bipartite graphs with girth $\\math"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2506.11268","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-06-12T20:20:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4c2c1c2c5fdd812f37b99c6b5c371a1b0cb7c7d161651f2656cb2ecfa8e0d941","abstract_canon_sha256":"146d4c9e42eeb2d68625bf23d7c5f01f900f301f8ad14b3955fb46ee5c9c1b57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:21:01.898531Z","signature_b64":"VK6zD9LjwHNfGGN8dfgB/eIsuI7ALfuh2mwaYArpFOIHTwB6ljI9ll4BTNFUr2HDSkZDSwIma2vcHxO/SmfoAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7250f39688f091bac977da4d6b9898eef1f290414d770b02298b3f60b25f21d9","last_reissued_at":"2026-07-05T11:21:01.898063Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:21:01.898063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hessam Mahdavifar, Mohsen Moradi, Sheida Rabeti","submitted_at":"2025-06-12T20:20:53Z","abstract_excerpt":"In this paper, we explore the design and analysis of regular bipartite graphs motivated by their application in low-density parity-check (LDPC) codes specifically with constrained girth and in the high-rate regime. We focus on the relation between the girth of the graph, and the size of the sets of variable and check nodes. We derive bounds on the size of the vertices in regular bipartite graphs, showing how the required number of check nodes grows with respect to the number of variable nodes as girth grows large. Furthermore, we present two constructions for bipartite graphs with girth $\\math"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.11268","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.11268/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2506.11268","created_at":"2026-07-05T11:21:01.898119+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.11268v1","created_at":"2026-07-05T11:21:01.898119+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.11268","created_at":"2026-07-05T11:21:01.898119+00:00"},{"alias_kind":"pith_short_12","alias_value":"OJIPHFUI6CI3","created_at":"2026-07-05T11:21:01.898119+00:00"},{"alias_kind":"pith_short_16","alias_value":"OJIPHFUI6CI3VSLX","created_at":"2026-07-05T11:21:01.898119+00:00"},{"alias_kind":"pith_short_8","alias_value":"OJIPHFUI","created_at":"2026-07-05T11:21:01.898119+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OJIPHFUI6CI3VSLX3JGWXGEY53","json":"https://pith.science/pith/OJIPHFUI6CI3VSLX3JGWXGEY53.json","graph_json":"https://pith.science/api/pith-number/OJIPHFUI6CI3VSLX3JGWXGEY53/graph.json","events_json":"https://pith.science/api/pith-number/OJIPHFUI6CI3VSLX3JGWXGEY53/events.json","paper":"https://pith.science/paper/OJIPHFUI"},"agent_actions":{"view_html":"https://pith.science/pith/OJIPHFUI6CI3VSLX3JGWXGEY53","download_json":"https://pith.science/pith/OJIPHFUI6CI3VSLX3JGWXGEY53.json","view_paper":"https://pith.science/paper/OJIPHFUI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.11268&json=true","fetch_graph":"https://pith.science/api/pith-number/OJIPHFUI6CI3VSLX3JGWXGEY53/graph.json","fetch_events":"https://pith.science/api/pith-number/OJIPHFUI6CI3VSLX3JGWXGEY53/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OJIPHFUI6CI3VSLX3JGWXGEY53/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OJIPHFUI6CI3VSLX3JGWXGEY53/action/storage_attestation","attest_author":"https://pith.science/pith/OJIPHFUI6CI3VSLX3JGWXGEY53/action/author_attestation","sign_citation":"https://pith.science/pith/OJIPHFUI6CI3VSLX3JGWXGEY53/action/citation_signature","submit_replication":"https://pith.science/pith/OJIPHFUI6CI3VSLX3JGWXGEY53/action/replication_record"}},"created_at":"2026-07-05T11:21:01.898119+00:00","updated_at":"2026-07-05T11:21:01.898119+00:00"}