{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:MZHQH47ZRNTNVVY2SLYZ7ASRVH","short_pith_number":"pith:MZHQH47Z","schema_version":"1.0","canonical_sha256":"664f03f3f98b66dad71a92f19f8251a9e58a573deda3dd039e345ea14a8ed535","source":{"kind":"arxiv","id":"0909.4601","version":3},"attestation_state":"computed","paper":{"title":"Rank Metric Decoder Architectures for Random Linear Network Coding with Error Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bruce W. Suter, Maximilien Gadouleau, Ning Chen, Ying Wang, Zhiyuan Yan","submitted_at":"2009-09-25T04:20:29Z","abstract_excerpt":"While random linear network coding is a powerful tool for disseminating information in communication networks, it is highly susceptible to errors caused by various sources. Due to error propagation, errors greatly deteriorate the throughput of network coding and seriously undermine both reliability and security of data. Hence error control for network coding is vital. Recently, constant-dimension codes (CDCs), especially K\\\"otter-Kschischang (KK) codes, have been proposed for error control in random linear network coding. KK codes can also be constructed from Gabidulin codes, an important clas"},"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":"0909.4601","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-09-25T04:20:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a5aff72d035b919da060ddefaf8f3f7a59763651897579fca9ee5d58b19c2a99","abstract_canon_sha256":"d6f3afd65611999f934a2d751b8c8b9207f96dd217570ca799d3ae353433d0a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:11.230402Z","signature_b64":"MDj/uljE1zeDBTm3fIbEEh0KW7ocjWlQVMHhJ1BK58KBxrbC+nlzQpc3gTWdXe8DR6sh6HHujKIStuszH8pzAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"664f03f3f98b66dad71a92f19f8251a9e58a573deda3dd039e345ea14a8ed535","last_reissued_at":"2026-05-18T00:59:11.229814Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:11.229814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rank Metric Decoder Architectures for Random Linear Network Coding with Error Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bruce W. Suter, Maximilien Gadouleau, Ning Chen, Ying Wang, Zhiyuan Yan","submitted_at":"2009-09-25T04:20:29Z","abstract_excerpt":"While random linear network coding is a powerful tool for disseminating information in communication networks, it is highly susceptible to errors caused by various sources. Due to error propagation, errors greatly deteriorate the throughput of network coding and seriously undermine both reliability and security of data. Hence error control for network coding is vital. Recently, constant-dimension codes (CDCs), especially K\\\"otter-Kschischang (KK) codes, have been proposed for error control in random linear network coding. KK codes can also be constructed from Gabidulin codes, an important clas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.4601","kind":"arxiv","version":3},"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":"0909.4601","created_at":"2026-05-18T00:59:11.229904+00:00"},{"alias_kind":"arxiv_version","alias_value":"0909.4601v3","created_at":"2026-05-18T00:59:11.229904+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.4601","created_at":"2026-05-18T00:59:11.229904+00:00"},{"alias_kind":"pith_short_12","alias_value":"MZHQH47ZRNTN","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"MZHQH47ZRNTNVVY2","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"MZHQH47Z","created_at":"2026-05-18T12:26:00.592388+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/MZHQH47ZRNTNVVY2SLYZ7ASRVH","json":"https://pith.science/pith/MZHQH47ZRNTNVVY2SLYZ7ASRVH.json","graph_json":"https://pith.science/api/pith-number/MZHQH47ZRNTNVVY2SLYZ7ASRVH/graph.json","events_json":"https://pith.science/api/pith-number/MZHQH47ZRNTNVVY2SLYZ7ASRVH/events.json","paper":"https://pith.science/paper/MZHQH47Z"},"agent_actions":{"view_html":"https://pith.science/pith/MZHQH47ZRNTNVVY2SLYZ7ASRVH","download_json":"https://pith.science/pith/MZHQH47ZRNTNVVY2SLYZ7ASRVH.json","view_paper":"https://pith.science/paper/MZHQH47Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0909.4601&json=true","fetch_graph":"https://pith.science/api/pith-number/MZHQH47ZRNTNVVY2SLYZ7ASRVH/graph.json","fetch_events":"https://pith.science/api/pith-number/MZHQH47ZRNTNVVY2SLYZ7ASRVH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MZHQH47ZRNTNVVY2SLYZ7ASRVH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MZHQH47ZRNTNVVY2SLYZ7ASRVH/action/storage_attestation","attest_author":"https://pith.science/pith/MZHQH47ZRNTNVVY2SLYZ7ASRVH/action/author_attestation","sign_citation":"https://pith.science/pith/MZHQH47ZRNTNVVY2SLYZ7ASRVH/action/citation_signature","submit_replication":"https://pith.science/pith/MZHQH47ZRNTNVVY2SLYZ7ASRVH/action/replication_record"}},"created_at":"2026-05-18T00:59:11.229904+00:00","updated_at":"2026-05-18T00:59:11.229904+00:00"}