{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OLH3BZIPFEUBEWNHVHCTVTRFEK","short_pith_number":"pith:OLH3BZIP","schema_version":"1.0","canonical_sha256":"72cfb0e50f29281259a7a9c53ace25229195a355ef83d9d99818febbc7c3a75d","source":{"kind":"arxiv","id":"1209.3460","version":1},"attestation_state":"computed","paper":{"title":"Expander-like Codes based on Finite Projective Geometry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. S. Adiga, Hrishikesh Sharma, Sachin Patkar, Swadesh Choudhary","submitted_at":"2012-09-16T04:41:22Z","abstract_excerpt":"We present a novel error correcting code and decoding algorithm which have construction similar to expander codes. The code is based on a bipartite graph derived from the subsumption relations of finite projective geometry, and Reed-Solomon codes as component codes. We use a modified version of well-known Zemor's decoding algorithm for expander codes, for decoding our codes. By derivation of geometric bounds rather than eigenvalue bounds, it has been proved that for practical values of the code rate, the random error correction capability of our codes is much better than those derived for prev"},"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":"1209.3460","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-16T04:41:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f0a452bfe9b1183e73a8550d343ca96790fbc847282e53b795e3a095f0978421","abstract_canon_sha256":"fcf0e3fc2ea19c51e2127a70aedd3af7f8c3d68ca8ac25760199f0b178797a3c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:30.925843Z","signature_b64":"zsHKcjb+NWGmZP2UnnZ+G24BiVl4wJ3md0eLTIQ7lhTp7W0HUZTuy/yY7go1ShVWfZIxxJqbYZxSVrkZaaXdDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72cfb0e50f29281259a7a9c53ace25229195a355ef83d9d99818febbc7c3a75d","last_reissued_at":"2026-05-18T03:45:30.925159Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:30.925159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Expander-like Codes based on Finite Projective Geometry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. S. Adiga, Hrishikesh Sharma, Sachin Patkar, Swadesh Choudhary","submitted_at":"2012-09-16T04:41:22Z","abstract_excerpt":"We present a novel error correcting code and decoding algorithm which have construction similar to expander codes. The code is based on a bipartite graph derived from the subsumption relations of finite projective geometry, and Reed-Solomon codes as component codes. We use a modified version of well-known Zemor's decoding algorithm for expander codes, for decoding our codes. By derivation of geometric bounds rather than eigenvalue bounds, it has been proved that for practical values of the code rate, the random error correction capability of our codes is much better than those derived for prev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.3460","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":"1209.3460","created_at":"2026-05-18T03:45:30.925256+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.3460v1","created_at":"2026-05-18T03:45:30.925256+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.3460","created_at":"2026-05-18T03:45:30.925256+00:00"},{"alias_kind":"pith_short_12","alias_value":"OLH3BZIPFEUB","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"OLH3BZIPFEUBEWNH","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"OLH3BZIP","created_at":"2026-05-18T12:27:16.716162+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/OLH3BZIPFEUBEWNHVHCTVTRFEK","json":"https://pith.science/pith/OLH3BZIPFEUBEWNHVHCTVTRFEK.json","graph_json":"https://pith.science/api/pith-number/OLH3BZIPFEUBEWNHVHCTVTRFEK/graph.json","events_json":"https://pith.science/api/pith-number/OLH3BZIPFEUBEWNHVHCTVTRFEK/events.json","paper":"https://pith.science/paper/OLH3BZIP"},"agent_actions":{"view_html":"https://pith.science/pith/OLH3BZIPFEUBEWNHVHCTVTRFEK","download_json":"https://pith.science/pith/OLH3BZIPFEUBEWNHVHCTVTRFEK.json","view_paper":"https://pith.science/paper/OLH3BZIP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.3460&json=true","fetch_graph":"https://pith.science/api/pith-number/OLH3BZIPFEUBEWNHVHCTVTRFEK/graph.json","fetch_events":"https://pith.science/api/pith-number/OLH3BZIPFEUBEWNHVHCTVTRFEK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OLH3BZIPFEUBEWNHVHCTVTRFEK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OLH3BZIPFEUBEWNHVHCTVTRFEK/action/storage_attestation","attest_author":"https://pith.science/pith/OLH3BZIPFEUBEWNHVHCTVTRFEK/action/author_attestation","sign_citation":"https://pith.science/pith/OLH3BZIPFEUBEWNHVHCTVTRFEK/action/citation_signature","submit_replication":"https://pith.science/pith/OLH3BZIPFEUBEWNHVHCTVTRFEK/action/replication_record"}},"created_at":"2026-05-18T03:45:30.925256+00:00","updated_at":"2026-05-18T03:45:30.925256+00:00"}