{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:DLACHUZE6JAZNIZAHG27X2SYC5","short_pith_number":"pith:DLACHUZE","schema_version":"1.0","canonical_sha256":"1ac023d324f24196a32039b5fbea58175fef5056c6f450a6909d11afdca033c1","source":{"kind":"arxiv","id":"1105.6224","version":1},"attestation_state":"computed","paper":{"title":"Upper and Lower Bounds on the Minimum Distance of Expander Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexey Frolov, Victor Zyablov","submitted_at":"2011-05-31T09:41:02Z","abstract_excerpt":"The minimum distance of expander codes over GF(q) is studied. A new upper bound on the minimum distance of expander codes is derived. The bound is shown to lie under the Varshamov-Gilbert (VG) bound while q >= 32. Lower bounds on the minimum distance of some families of expander codes are obtained. A lower bound on the minimum distance of low-density parity-check (LDPC) codes with a Reed--Solomon constituent code over GF(q) is obtained. The bound is shown to be very close to the VG bound and to lie above the upper bound for expander codes."},"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":"1105.6224","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-31T09:41:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"16a8d37c5553ad29eb55d0fc3e3973aaf18d87ec160633dbd9773b014293e6fc","abstract_canon_sha256":"f38fb0ee35baae415eaf2fe7b13c44e0fba6de5678f2d3c0cfd2ca96d28bca50"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:59.904663Z","signature_b64":"ghl2av9Wy6jGPrNazUH9oDuMNNUH4+Sdj8DdaZ3y65yrBTqrk41gxXtjG7p4Nibul7TGh3EDdxk9y3coPRW1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ac023d324f24196a32039b5fbea58175fef5056c6f450a6909d11afdca033c1","last_reissued_at":"2026-05-18T04:20:59.903977Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:59.903977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Upper and Lower Bounds on the Minimum Distance of Expander Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexey Frolov, Victor Zyablov","submitted_at":"2011-05-31T09:41:02Z","abstract_excerpt":"The minimum distance of expander codes over GF(q) is studied. A new upper bound on the minimum distance of expander codes is derived. The bound is shown to lie under the Varshamov-Gilbert (VG) bound while q >= 32. Lower bounds on the minimum distance of some families of expander codes are obtained. A lower bound on the minimum distance of low-density parity-check (LDPC) codes with a Reed--Solomon constituent code over GF(q) is obtained. The bound is shown to be very close to the VG bound and to lie above the upper bound for expander codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.6224","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":""},"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":"1105.6224","created_at":"2026-05-18T04:20:59.904089+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.6224v1","created_at":"2026-05-18T04:20:59.904089+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.6224","created_at":"2026-05-18T04:20:59.904089+00:00"},{"alias_kind":"pith_short_12","alias_value":"DLACHUZE6JAZ","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"DLACHUZE6JAZNIZA","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"DLACHUZE","created_at":"2026-05-18T12:26:26.731475+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/DLACHUZE6JAZNIZAHG27X2SYC5","json":"https://pith.science/pith/DLACHUZE6JAZNIZAHG27X2SYC5.json","graph_json":"https://pith.science/api/pith-number/DLACHUZE6JAZNIZAHG27X2SYC5/graph.json","events_json":"https://pith.science/api/pith-number/DLACHUZE6JAZNIZAHG27X2SYC5/events.json","paper":"https://pith.science/paper/DLACHUZE"},"agent_actions":{"view_html":"https://pith.science/pith/DLACHUZE6JAZNIZAHG27X2SYC5","download_json":"https://pith.science/pith/DLACHUZE6JAZNIZAHG27X2SYC5.json","view_paper":"https://pith.science/paper/DLACHUZE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.6224&json=true","fetch_graph":"https://pith.science/api/pith-number/DLACHUZE6JAZNIZAHG27X2SYC5/graph.json","fetch_events":"https://pith.science/api/pith-number/DLACHUZE6JAZNIZAHG27X2SYC5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DLACHUZE6JAZNIZAHG27X2SYC5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DLACHUZE6JAZNIZAHG27X2SYC5/action/storage_attestation","attest_author":"https://pith.science/pith/DLACHUZE6JAZNIZAHG27X2SYC5/action/author_attestation","sign_citation":"https://pith.science/pith/DLACHUZE6JAZNIZAHG27X2SYC5/action/citation_signature","submit_replication":"https://pith.science/pith/DLACHUZE6JAZNIZAHG27X2SYC5/action/replication_record"}},"created_at":"2026-05-18T04:20:59.904089+00:00","updated_at":"2026-05-18T04:20:59.904089+00:00"}