{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:2DZR5THLZRBVTTIXFNYZO3DYAL","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":"b8e056550a2666ac7928141fbe4a464cf8c053ccf2c68b894687cf92fc29c60a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-11T18:01:38Z","title_canon_sha256":"af3a5cf77d029e3f4d6845619e97d296844578ce01b095596e09f44acc7f687c"},"schema_version":"1.0","source":{"id":"1205.2590","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2590","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2590v4","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2590","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"pith_short_12","alias_value":"2DZR5THLZRBV","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2DZR5THLZRBVTTIX","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2DZR5THL","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:633c5ade1f1c4179b1b3a897b4a77d49e2bec466543738b3b12018d06982ac41","target":"graph","created_at":"2026-05-18T00:58:18Z","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":"In this work, we study the minimum/stopping distance of array low-density parity-check (LDPC) codes. An array LDPC code is a quasi-cyclic LDPC code specified by two integers q and m, where q is an odd prime and m <= q. In the literature, the minimum/stopping distance of these codes (denoted by d(q,m) and h(q,m), respectively) has been thoroughly studied for m <= 5. Both exact results, for small values of q and m, and general (i.e., independent of q) bounds have been established. For m=6, the best known minimum distance upper bound, derived by Mittelholzer (IEEE Int. Symp. Inf. Theory, Jun./Jul","authors_text":"Eirik Rosnes, Marcel A. Ambroze, Martin tomlinson","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-11T18:01:38Z","title":"On the Minimum/Stopping Distance of Array Low-Density Parity-Check Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2590","kind":"arxiv","version":4},"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:39821718d4d522acc320a54bf012bf022e70f4ccd0cfe6d5f606a07ed1a6f533","target":"record","created_at":"2026-05-18T00:58:18Z","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":"b8e056550a2666ac7928141fbe4a464cf8c053ccf2c68b894687cf92fc29c60a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-11T18:01:38Z","title_canon_sha256":"af3a5cf77d029e3f4d6845619e97d296844578ce01b095596e09f44acc7f687c"},"schema_version":"1.0","source":{"id":"1205.2590","kind":"arxiv","version":4}},"canonical_sha256":"d0f31eccebcc4359cd172b71976c7802daffe820c68e75faa5530f56379b91b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0f31eccebcc4359cd172b71976c7802daffe820c68e75faa5530f56379b91b3","first_computed_at":"2026-05-18T00:58:18.235058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:18.235058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MXZsNsVbUZrSvQi4fNP/755pyndl5LYhz3sBFVZ9MLUXRnCmIH3sZCqK5D+Uo7nru2BakBsMtLTX0VDIIXucAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:18.235790Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.2590","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39821718d4d522acc320a54bf012bf022e70f4ccd0cfe6d5f606a07ed1a6f533","sha256:633c5ade1f1c4179b1b3a897b4a77d49e2bec466543738b3b12018d06982ac41"],"state_sha256":"9536fa1fb8a8ba08db53c393def22e20d48af4086bdb3441328701566b22b7db"}