{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LA65BR2YFWARQVRVJTZCTPETVK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ed11887c88a96857ddc056a11603e7f15646fd653598592c369ddc626e043c73","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-09T18:29:36Z","title_canon_sha256":"695f7266a695c412e91e11ac1dd87b5165d13c11c081f2cecfb00ac6fee1a210"},"schema_version":"1.0","source":{"id":"1701.02292","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02292","created_at":"2026-05-18T00:37:48Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02292v2","created_at":"2026-05-18T00:37:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02292","created_at":"2026-05-18T00:37:48Z"},{"alias_kind":"pith_short_12","alias_value":"LA65BR2YFWAR","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LA65BR2YFWARQVRV","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LA65BR2Y","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:00efad1ea9df72c1476cc1e23291b2da953e09776d706b21789fef30fe94eef6","target":"graph","created_at":"2026-05-18T00:37:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"A number of recent works have used a variety of combinatorial constructions to derive Tanner graphs for LDPC codes and some of these have been shown to perform well in terms of their probability of error curves and error floors. Such graphs are bipartite and many of these constructions yield biregular graphs where the degree of left vertices is a constant $c+1$ and that of the right vertices is a constant $d+1$. Such graphs are termed $(c+1,d+1)$ biregular bipartite graphs here. One property of interest in such work is the girth of the graph and the number of short cycles in the graph, cycles ","authors_text":"Ian Blake, Shu Lin","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-09T18:29:36Z","title":"On short cycle enumeration in biregular bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02292","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5ccfacad0874aeb9e97edd173dc30e2b26a517bd902e9667274e2e3ad18f490b","target":"record","created_at":"2026-05-18T00:37:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ed11887c88a96857ddc056a11603e7f15646fd653598592c369ddc626e043c73","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-09T18:29:36Z","title_canon_sha256":"695f7266a695c412e91e11ac1dd87b5165d13c11c081f2cecfb00ac6fee1a210"},"schema_version":"1.0","source":{"id":"1701.02292","kind":"arxiv","version":2}},"canonical_sha256":"583dd0c7582d811856354cf229bc93aa9aefe9cc732c9f92dd8b11b69fb5fd06","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"583dd0c7582d811856354cf229bc93aa9aefe9cc732c9f92dd8b11b69fb5fd06","first_computed_at":"2026-05-18T00:37:48.072866Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:48.072866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Os9e5FdeS8nMd+QSYK4+N20/G9o2QE/+rZphBjvXbJRYIMzfN3S+A08s6Iiapt6aFWBZraVECJ6Mfjj+P/gnBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:48.073601Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.02292","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ccfacad0874aeb9e97edd173dc30e2b26a517bd902e9667274e2e3ad18f490b","sha256:00efad1ea9df72c1476cc1e23291b2da953e09776d706b21789fef30fe94eef6"],"state_sha256":"a919973c0f414bbae9aff92fcaa7d381bfb847117a0b427c931578157a16e02b"}