{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:5ND6Z53LLUHI4UO5LEKIYWCDDR","short_pith_number":"pith:5ND6Z53L","schema_version":"1.0","canonical_sha256":"eb47ecf76b5d0e8e51dd59148c58431c5e325a3f0d322048e8670fb64204c4d1","source":{"kind":"arxiv","id":"1202.0338","version":1},"attestation_state":"computed","paper":{"title":"Algebraic List-decoding of Subspace Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Vardy, Hessam Mahdavifar","submitted_at":"2012-02-02T02:01:54Z","abstract_excerpt":"Subspace codes were introduced in order to correct errors and erasures for randomized network coding, in the case where network topology is unknown (the noncoherent case). Subspace codes are indeed collections of subspaces of a certain vector space over a finite field. The Koetter-Kschischang construction of subspace codes are similar to Reed-Solomon codes in that codewords are obtained by evaluating certain (linearized) polynomials. In this paper, we consider the problem of list-decoding the Koetter-Kschischang subspace codes. In a sense, we are able to achieve for these codes what Sudan was "},"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":"1202.0338","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-02T02:01:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c3ebe401e9a6ecbeb59c2c0077cedcb5d099ca75e26e0f6652b449932ceccfa1","abstract_canon_sha256":"7f0f7126127462cd1280cdc4144f378e4942160dd1b5a6b7f614095895636252"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:18.668928Z","signature_b64":"3RIqR5QjzPqN+GoIPZOx1sUa01yqUXfIVE4RpEYVFGztLGDFSrNZEh2yoOP+UiezfRqrh/Fq2yMy5RJ3CeyIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb47ecf76b5d0e8e51dd59148c58431c5e325a3f0d322048e8670fb64204c4d1","last_reissued_at":"2026-05-18T04:03:18.668280Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:18.668280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algebraic List-decoding of Subspace Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Vardy, Hessam Mahdavifar","submitted_at":"2012-02-02T02:01:54Z","abstract_excerpt":"Subspace codes were introduced in order to correct errors and erasures for randomized network coding, in the case where network topology is unknown (the noncoherent case). Subspace codes are indeed collections of subspaces of a certain vector space over a finite field. The Koetter-Kschischang construction of subspace codes are similar to Reed-Solomon codes in that codewords are obtained by evaluating certain (linearized) polynomials. In this paper, we consider the problem of list-decoding the Koetter-Kschischang subspace codes. In a sense, we are able to achieve for these codes what Sudan was "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0338","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":"1202.0338","created_at":"2026-05-18T04:03:18.668397+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.0338v1","created_at":"2026-05-18T04:03:18.668397+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0338","created_at":"2026-05-18T04:03:18.668397+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ND6Z53LLUHI","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ND6Z53LLUHI4UO5","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ND6Z53L","created_at":"2026-05-18T12:26:56.085431+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/5ND6Z53LLUHI4UO5LEKIYWCDDR","json":"https://pith.science/pith/5ND6Z53LLUHI4UO5LEKIYWCDDR.json","graph_json":"https://pith.science/api/pith-number/5ND6Z53LLUHI4UO5LEKIYWCDDR/graph.json","events_json":"https://pith.science/api/pith-number/5ND6Z53LLUHI4UO5LEKIYWCDDR/events.json","paper":"https://pith.science/paper/5ND6Z53L"},"agent_actions":{"view_html":"https://pith.science/pith/5ND6Z53LLUHI4UO5LEKIYWCDDR","download_json":"https://pith.science/pith/5ND6Z53LLUHI4UO5LEKIYWCDDR.json","view_paper":"https://pith.science/paper/5ND6Z53L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.0338&json=true","fetch_graph":"https://pith.science/api/pith-number/5ND6Z53LLUHI4UO5LEKIYWCDDR/graph.json","fetch_events":"https://pith.science/api/pith-number/5ND6Z53LLUHI4UO5LEKIYWCDDR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ND6Z53LLUHI4UO5LEKIYWCDDR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ND6Z53LLUHI4UO5LEKIYWCDDR/action/storage_attestation","attest_author":"https://pith.science/pith/5ND6Z53LLUHI4UO5LEKIYWCDDR/action/author_attestation","sign_citation":"https://pith.science/pith/5ND6Z53LLUHI4UO5LEKIYWCDDR/action/citation_signature","submit_replication":"https://pith.science/pith/5ND6Z53LLUHI4UO5LEKIYWCDDR/action/replication_record"}},"created_at":"2026-05-18T04:03:18.668397+00:00","updated_at":"2026-05-18T04:03:18.668397+00:00"}