{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BDVT7YVRBPG6B77AFWKMIG4XXU","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":"a6cd4d8a57353bca3e914b70afba26f09e03ac041f803629eed9ffa7758c0d48","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-09T19:08:45Z","title_canon_sha256":"0cc9b787dcaaa024b9b78d9c6d3b144c02ff9a3b7c34c25e6e979e41b21fd9b0"},"schema_version":"1.0","source":{"id":"1401.2120","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2120","created_at":"2026-05-18T03:02:47Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2120v1","created_at":"2026-05-18T03:02:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2120","created_at":"2026-05-18T03:02:47Z"},{"alias_kind":"pith_short_12","alias_value":"BDVT7YVRBPG6","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BDVT7YVRBPG6B77A","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BDVT7YVR","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:e52ed69ba409fbfdd12e23ad8cb4d28fb8699377c22565ffc609b68d9ae1597e","target":"graph","created_at":"2026-05-18T03:02:47Z","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":"Two upper bounds on the minimum distance of type-1 quasi-cyclic low-density parity-check (QC LDPC) codes are derived. The necessary condition is given for the minimum code distance of such codes to grow linearly with the code length.","authors_text":"Alexey Frolov, Pavel Rybin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-09T19:08:45Z","title":"Upper Bounds on the Minimum Distance of Quasi-Cyclic LDPC codes Revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2120","kind":"arxiv","version":1},"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:efefcd827496fe132f5ffbb17d25d8c7911e825420bfe7fca828b4da0a3c7b7c","target":"record","created_at":"2026-05-18T03:02:47Z","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":"a6cd4d8a57353bca3e914b70afba26f09e03ac041f803629eed9ffa7758c0d48","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-09T19:08:45Z","title_canon_sha256":"0cc9b787dcaaa024b9b78d9c6d3b144c02ff9a3b7c34c25e6e979e41b21fd9b0"},"schema_version":"1.0","source":{"id":"1401.2120","kind":"arxiv","version":1}},"canonical_sha256":"08eb3fe2b10bcde0ffe02d94c41b97bd3dc44083fb5d51ed7a4f47f70232a606","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08eb3fe2b10bcde0ffe02d94c41b97bd3dc44083fb5d51ed7a4f47f70232a606","first_computed_at":"2026-05-18T03:02:47.432859Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:47.432859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S4lLoZO90rRXZPsKK05HewYoaSx7Eff3xS3vYmsNECAlDXyDHUo9fZfcI8atG18PANNF3dtLoIsQ57IB55K5Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:47.433565Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.2120","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:efefcd827496fe132f5ffbb17d25d8c7911e825420bfe7fca828b4da0a3c7b7c","sha256:e52ed69ba409fbfdd12e23ad8cb4d28fb8699377c22565ffc609b68d9ae1597e"],"state_sha256":"a9cd47229a3e72ce652141bddfb9ae736d92830552996df0bdb3ed2dd8ce3411"}