{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EIQZWZUTF2TB7PWOR7QC4Y23YK","short_pith_number":"pith:EIQZWZUT","schema_version":"1.0","canonical_sha256":"22219b66932ea61fbece8fe02e635bc2b2ad1ee3da92e8648bfd2f26062b256c","source":{"kind":"arxiv","id":"1301.6117","version":1},"attestation_state":"computed","paper":{"title":"Higher genus universally decodable matrices (UDMG)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David Grant, Mahesh K. Varanasi, Steve Limburg","submitted_at":"2013-01-25T18:39:39Z","abstract_excerpt":"We introduce the notion of Universally Decodable Matrices of Genus g (UDMG), which for g=0 reduces to the notion of Universally Decodable Matrices (UDM) introduced in [8]. A UDMG is a set of L matrices over a finite field, each with K rows, and a linear independence condition satisfied by collections of K+g columns formed from the initial segments of the matrices. We consider the mathematical structure of UDMGs and their relation to linear vector codes. We then give a construction of UDMG based on curves of genus g over the finite field, which is a natural generalization of the UDM constructed"},"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":"1301.6117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-25T18:39:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2385778b6408e07e50e0216e1cd7bba441dbafe009c9a77c0b6a31771103c1c2","abstract_canon_sha256":"1361a35a5032ad6753fc2d378c68e08a58474e47c9b5327e36bf742d5d628060"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:27.052760Z","signature_b64":"ZGbk9hc0N72VmJ/TWBxJc2sT2KK7lF3lv06e6mVbGwSFiMqpxc21MMgAnZaGeuIhfL+KTTFFdMB6sJ8J9H31DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22219b66932ea61fbece8fe02e635bc2b2ad1ee3da92e8648bfd2f26062b256c","last_reissued_at":"2026-05-18T03:35:27.052062Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:27.052062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Higher genus universally decodable matrices (UDMG)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David Grant, Mahesh K. Varanasi, Steve Limburg","submitted_at":"2013-01-25T18:39:39Z","abstract_excerpt":"We introduce the notion of Universally Decodable Matrices of Genus g (UDMG), which for g=0 reduces to the notion of Universally Decodable Matrices (UDM) introduced in [8]. A UDMG is a set of L matrices over a finite field, each with K rows, and a linear independence condition satisfied by collections of K+g columns formed from the initial segments of the matrices. We consider the mathematical structure of UDMGs and their relation to linear vector codes. We then give a construction of UDMG based on curves of genus g over the finite field, which is a natural generalization of the UDM constructed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6117","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":"1301.6117","created_at":"2026-05-18T03:35:27.052176+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.6117v1","created_at":"2026-05-18T03:35:27.052176+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6117","created_at":"2026-05-18T03:35:27.052176+00:00"},{"alias_kind":"pith_short_12","alias_value":"EIQZWZUTF2TB","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EIQZWZUTF2TB7PWO","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EIQZWZUT","created_at":"2026-05-18T12:27:43.054852+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/EIQZWZUTF2TB7PWOR7QC4Y23YK","json":"https://pith.science/pith/EIQZWZUTF2TB7PWOR7QC4Y23YK.json","graph_json":"https://pith.science/api/pith-number/EIQZWZUTF2TB7PWOR7QC4Y23YK/graph.json","events_json":"https://pith.science/api/pith-number/EIQZWZUTF2TB7PWOR7QC4Y23YK/events.json","paper":"https://pith.science/paper/EIQZWZUT"},"agent_actions":{"view_html":"https://pith.science/pith/EIQZWZUTF2TB7PWOR7QC4Y23YK","download_json":"https://pith.science/pith/EIQZWZUTF2TB7PWOR7QC4Y23YK.json","view_paper":"https://pith.science/paper/EIQZWZUT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.6117&json=true","fetch_graph":"https://pith.science/api/pith-number/EIQZWZUTF2TB7PWOR7QC4Y23YK/graph.json","fetch_events":"https://pith.science/api/pith-number/EIQZWZUTF2TB7PWOR7QC4Y23YK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EIQZWZUTF2TB7PWOR7QC4Y23YK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EIQZWZUTF2TB7PWOR7QC4Y23YK/action/storage_attestation","attest_author":"https://pith.science/pith/EIQZWZUTF2TB7PWOR7QC4Y23YK/action/author_attestation","sign_citation":"https://pith.science/pith/EIQZWZUTF2TB7PWOR7QC4Y23YK/action/citation_signature","submit_replication":"https://pith.science/pith/EIQZWZUTF2TB7PWOR7QC4Y23YK/action/replication_record"}},"created_at":"2026-05-18T03:35:27.052176+00:00","updated_at":"2026-05-18T03:35:27.052176+00:00"}