{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LA65BR2YFWARQVRVJTZCTPETVK","short_pith_number":"pith:LA65BR2Y","canonical_record":{"source":{"id":"1701.02292","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-09T18:29:36Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"695f7266a695c412e91e11ac1dd87b5165d13c11c081f2cecfb00ac6fee1a210","abstract_canon_sha256":"ed11887c88a96857ddc056a11603e7f15646fd653598592c369ddc626e043c73"},"schema_version":"1.0"},"canonical_sha256":"583dd0c7582d811856354cf229bc93aa9aefe9cc732c9f92dd8b11b69fb5fd06","source":{"kind":"arxiv","id":"1701.02292","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LA65BR2YFWARQVRVJTZCTPETVK","target":"record","payload":{"canonical_record":{"source":{"id":"1701.02292","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-09T18:29:36Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"695f7266a695c412e91e11ac1dd87b5165d13c11c081f2cecfb00ac6fee1a210","abstract_canon_sha256":"ed11887c88a96857ddc056a11603e7f15646fd653598592c369ddc626e043c73"},"schema_version":"1.0"},"canonical_sha256":"583dd0c7582d811856354cf229bc93aa9aefe9cc732c9f92dd8b11b69fb5fd06","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:48.073601Z","signature_b64":"Os9e5FdeS8nMd+QSYK4+N20/G9o2QE/+rZphBjvXbJRYIMzfN3S+A08s6Iiapt6aFWBZraVECJ6Mfjj+P/gnBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"583dd0c7582d811856354cf229bc93aa9aefe9cc732c9f92dd8b11b69fb5fd06","last_reissued_at":"2026-05-18T00:37:48.072866Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:48.072866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.02292","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:37:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kKtOHs5m28mHcZVyDwo+k6slZQuOow3TNPadrtT7rwWsshfzDL2/iTg5duraE+G92ud2fg5bVBYeg4VFWflXAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T15:04:06.816618Z"},"content_sha256":"5ccfacad0874aeb9e97edd173dc30e2b26a517bd902e9667274e2e3ad18f490b","schema_version":"1.0","event_id":"sha256:5ccfacad0874aeb9e97edd173dc30e2b26a517bd902e9667274e2e3ad18f490b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LA65BR2YFWARQVRVJTZCTPETVK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On short cycle enumeration in biregular bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Ian Blake, Shu Lin","submitted_at":"2017-01-09T18:29:36Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02292","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:37:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TZyFl/78006iJLzYlIgG9rZP8aKQqqlt8rrb6KEwLVsU4lJFDTIcIWs0I3PRsX3QS0MLwFDHAZHl4G8a3/aEBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T15:04:06.816955Z"},"content_sha256":"00efad1ea9df72c1476cc1e23291b2da953e09776d706b21789fef30fe94eef6","schema_version":"1.0","event_id":"sha256:00efad1ea9df72c1476cc1e23291b2da953e09776d706b21789fef30fe94eef6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LA65BR2YFWARQVRVJTZCTPETVK/bundle.json","state_url":"https://pith.science/pith/LA65BR2YFWARQVRVJTZCTPETVK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LA65BR2YFWARQVRVJTZCTPETVK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-27T15:04:06Z","links":{"resolver":"https://pith.science/pith/LA65BR2YFWARQVRVJTZCTPETVK","bundle":"https://pith.science/pith/LA65BR2YFWARQVRVJTZCTPETVK/bundle.json","state":"https://pith.science/pith/LA65BR2YFWARQVRVJTZCTPETVK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LA65BR2YFWARQVRVJTZCTPETVK/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kRF06Y9Wc9GbhwPOR5Ghh6h7EKkDtV+Ho+BqPapU0TYO5Sje8e0Jm6pHZAd5VWdzahYhXGKsMHxma1SgSsE/Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T15:04:06.818714Z","bundle_sha256":"cb0e1ebfeef9bccc3ceb46e802633f8da935248b627e8ab4b5cdc2517ae3e900"}}