{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KZ5ZCYTUJQW6QSSQMCLH65IA23","short_pith_number":"pith:KZ5ZCYTU","schema_version":"1.0","canonical_sha256":"567b9162744c2de84a5060967f7500d6e49f80eb6086ae77b1979bc630d85147","source":{"kind":"arxiv","id":"1301.2165","version":1},"attestation_state":"computed","paper":{"title":"List Decoding of Lifted Gabidulin Codes via the Pl\\\"ucker Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anna-Lena Trautmann, Joachim Rosenthal, Natalia Silberstein","submitted_at":"2013-01-10T15:43:04Z","abstract_excerpt":"Codes in the Grassmannian have recently found an application in random network coding. All the codewords in such codes are subspaces of $\\F_q^n$ with a given dimension.\n  In this paper, we consider the problem of list decoding of a certain family of codes in the Grassmannian, called lifted Gabidulin codes.\n  For this purpose we use the Pl\\\"ucker embedding of the Grassmannian. We describe a way of representing a subset of the Pl\\\"ucker coordinates of lifted Gabidulin codes as linear block codes. The union of the parity-check equations of these block codes and the equations which arise from the "},"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.2165","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-10T15:43:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fb5915a23ad11a4ddd0a1c6cd2affe77adceb3485a17dbae74473ba49f46f03b","abstract_canon_sha256":"316eee27416cd371cc4bda57537ce11777430b445b1c1b70b087fb420b0a464b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:30.003140Z","signature_b64":"DoiiNimVRMq4XYMhXbICFPSIW5fEDrupijCvMZPmAtVyNFRIP9kTMymFgl9ae8j5lqxyKiBjWaI1Tji+TJUnAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"567b9162744c2de84a5060967f7500d6e49f80eb6086ae77b1979bc630d85147","last_reissued_at":"2026-05-18T02:49:30.002700Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:30.002700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"List Decoding of Lifted Gabidulin Codes via the Pl\\\"ucker Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anna-Lena Trautmann, Joachim Rosenthal, Natalia Silberstein","submitted_at":"2013-01-10T15:43:04Z","abstract_excerpt":"Codes in the Grassmannian have recently found an application in random network coding. All the codewords in such codes are subspaces of $\\F_q^n$ with a given dimension.\n  In this paper, we consider the problem of list decoding of a certain family of codes in the Grassmannian, called lifted Gabidulin codes.\n  For this purpose we use the Pl\\\"ucker embedding of the Grassmannian. We describe a way of representing a subset of the Pl\\\"ucker coordinates of lifted Gabidulin codes as linear block codes. The union of the parity-check equations of these block codes and the equations which arise from the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2165","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.2165","created_at":"2026-05-18T02:49:30.002764+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.2165v1","created_at":"2026-05-18T02:49:30.002764+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2165","created_at":"2026-05-18T02:49:30.002764+00:00"},{"alias_kind":"pith_short_12","alias_value":"KZ5ZCYTUJQW6","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"KZ5ZCYTUJQW6QSSQ","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"KZ5ZCYTU","created_at":"2026-05-18T12:27:51.066281+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/KZ5ZCYTUJQW6QSSQMCLH65IA23","json":"https://pith.science/pith/KZ5ZCYTUJQW6QSSQMCLH65IA23.json","graph_json":"https://pith.science/api/pith-number/KZ5ZCYTUJQW6QSSQMCLH65IA23/graph.json","events_json":"https://pith.science/api/pith-number/KZ5ZCYTUJQW6QSSQMCLH65IA23/events.json","paper":"https://pith.science/paper/KZ5ZCYTU"},"agent_actions":{"view_html":"https://pith.science/pith/KZ5ZCYTUJQW6QSSQMCLH65IA23","download_json":"https://pith.science/pith/KZ5ZCYTUJQW6QSSQMCLH65IA23.json","view_paper":"https://pith.science/paper/KZ5ZCYTU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.2165&json=true","fetch_graph":"https://pith.science/api/pith-number/KZ5ZCYTUJQW6QSSQMCLH65IA23/graph.json","fetch_events":"https://pith.science/api/pith-number/KZ5ZCYTUJQW6QSSQMCLH65IA23/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KZ5ZCYTUJQW6QSSQMCLH65IA23/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KZ5ZCYTUJQW6QSSQMCLH65IA23/action/storage_attestation","attest_author":"https://pith.science/pith/KZ5ZCYTUJQW6QSSQMCLH65IA23/action/author_attestation","sign_citation":"https://pith.science/pith/KZ5ZCYTUJQW6QSSQMCLH65IA23/action/citation_signature","submit_replication":"https://pith.science/pith/KZ5ZCYTUJQW6QSSQMCLH65IA23/action/replication_record"}},"created_at":"2026-05-18T02:49:30.002764+00:00","updated_at":"2026-05-18T02:49:30.002764+00:00"}