{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:DLACHUZE6JAZNIZAHG27X2SYC5","short_pith_number":"pith:DLACHUZE","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"},"canonical_sha256":"1ac023d324f24196a32039b5fbea58175fef5056c6f450a6909d11afdca033c1","source":{"kind":"arxiv","id":"1105.6224","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.6224","created_at":"2026-05-18T04:20:59Z"},{"alias_kind":"arxiv_version","alias_value":"1105.6224v1","created_at":"2026-05-18T04:20:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.6224","created_at":"2026-05-18T04:20:59Z"},{"alias_kind":"pith_short_12","alias_value":"DLACHUZE6JAZ","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DLACHUZE6JAZNIZA","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DLACHUZE","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:DLACHUZE6JAZNIZAHG27X2SYC5","target":"record","payload":{"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"},"canonical_sha256":"1ac023d324f24196a32039b5fbea58175fef5056c6f450a6909d11afdca033c1","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"},"source_kind":"arxiv","source_id":"1105.6224","source_version":1,"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-18T04:20:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p3T+6u1Ddw7XNMDzOTJALYI5RSnQvap+jXo1gydLNAppHqA3uAHKW0rp9nOtKOkAwfjTO5G6aHIeZgNkGdtYDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T19:58:09.112776Z"},"content_sha256":"ce1f2ccd0415596bc8e23ef3b4309b9f849b1b2971df4918115e45b1d1f3cbe2","schema_version":"1.0","event_id":"sha256:ce1f2ccd0415596bc8e23ef3b4309b9f849b1b2971df4918115e45b1d1f3cbe2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:DLACHUZE6JAZNIZAHG27X2SYC5","target":"graph","payload":{"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"},"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-18T04:20:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SjOzORx1YhuYne6fO67uCeTm2o8m31WO5GqbgoZTRjqk9TvbSjzo7sPyvawIdUoc/F2ObilLI1ryjfEZAuOeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T19:58:09.113115Z"},"content_sha256":"b14027b0a7471171a8f6ab0400390d485830033a50af81372f6e9b7cb4499775","schema_version":"1.0","event_id":"sha256:b14027b0a7471171a8f6ab0400390d485830033a50af81372f6e9b7cb4499775"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DLACHUZE6JAZNIZAHG27X2SYC5/bundle.json","state_url":"https://pith.science/pith/DLACHUZE6JAZNIZAHG27X2SYC5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DLACHUZE6JAZNIZAHG27X2SYC5/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-28T19:58:09Z","links":{"resolver":"https://pith.science/pith/DLACHUZE6JAZNIZAHG27X2SYC5","bundle":"https://pith.science/pith/DLACHUZE6JAZNIZAHG27X2SYC5/bundle.json","state":"https://pith.science/pith/DLACHUZE6JAZNIZAHG27X2SYC5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DLACHUZE6JAZNIZAHG27X2SYC5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:DLACHUZE6JAZNIZAHG27X2SYC5","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":"f38fb0ee35baae415eaf2fe7b13c44e0fba6de5678f2d3c0cfd2ca96d28bca50","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-31T09:41:02Z","title_canon_sha256":"16a8d37c5553ad29eb55d0fc3e3973aaf18d87ec160633dbd9773b014293e6fc"},"schema_version":"1.0","source":{"id":"1105.6224","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.6224","created_at":"2026-05-18T04:20:59Z"},{"alias_kind":"arxiv_version","alias_value":"1105.6224v1","created_at":"2026-05-18T04:20:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.6224","created_at":"2026-05-18T04:20:59Z"},{"alias_kind":"pith_short_12","alias_value":"DLACHUZE6JAZ","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DLACHUZE6JAZNIZA","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DLACHUZE","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:b14027b0a7471171a8f6ab0400390d485830033a50af81372f6e9b7cb4499775","target":"graph","created_at":"2026-05-18T04:20:59Z","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":"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.","authors_text":"Alexey Frolov, Victor Zyablov","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-31T09:41:02Z","title":"Upper and Lower Bounds on the Minimum Distance of Expander Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.6224","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:ce1f2ccd0415596bc8e23ef3b4309b9f849b1b2971df4918115e45b1d1f3cbe2","target":"record","created_at":"2026-05-18T04:20:59Z","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":"f38fb0ee35baae415eaf2fe7b13c44e0fba6de5678f2d3c0cfd2ca96d28bca50","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-31T09:41:02Z","title_canon_sha256":"16a8d37c5553ad29eb55d0fc3e3973aaf18d87ec160633dbd9773b014293e6fc"},"schema_version":"1.0","source":{"id":"1105.6224","kind":"arxiv","version":1}},"canonical_sha256":"1ac023d324f24196a32039b5fbea58175fef5056c6f450a6909d11afdca033c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ac023d324f24196a32039b5fbea58175fef5056c6f450a6909d11afdca033c1","first_computed_at":"2026-05-18T04:20:59.903977Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:59.903977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ghl2av9Wy6jGPrNazUH9oDuMNNUH4+Sdj8DdaZ3y65yrBTqrk41gxXtjG7p4Nibul7TGh3EDdxk9y3coPRW1CA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:59.904663Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.6224","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce1f2ccd0415596bc8e23ef3b4309b9f849b1b2971df4918115e45b1d1f3cbe2","sha256:b14027b0a7471171a8f6ab0400390d485830033a50af81372f6e9b7cb4499775"],"state_sha256":"d149805e162b0f4cc1b497f147d17b0ee78937e382bfbddcf4986546007e28ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sr41esVgREkYy7H+9Szu4gmRjRo7tX3AN0RkwcSh5P5um25EFbO+BhJrXOIFjp6iMXtCH37ehhVz/6so95JyAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T19:58:09.114977Z","bundle_sha256":"2bb672c730088c1a7c279f080858e4522dc86d7183302ec380602c3fd7964a0e"}}