{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3HMNO4MB7Y7JSXWPCS2HWV6W2P","short_pith_number":"pith:3HMNO4MB","schema_version":"1.0","canonical_sha256":"d9d8d77181fe3e995ecf14b47b57d6d3d2e01fff316afe1be5e34fe32f2ec834","source":{"kind":"arxiv","id":"1108.5881","version":2},"attestation_state":"computed","paper":{"title":"Spread Decoding in Extension Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anna-Lena Trautmann, Felice Manganiello","submitted_at":"2011-08-30T08:55:28Z","abstract_excerpt":"A spread code is a set of vector spaces of a fixed dimension over a finite field Fq with certain properties used for random network coding. It can be constructed in different ways which lead to different decoding algorithms. In this work we present a new representation of spread codes with a minimum distance decoding algorithm which is efficient when the codewords, the received space and the error space have small dimension."},"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":"1108.5881","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-30T08:55:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a1c242d1e196d0ef73118cacab62e7ff4ad17bc0231399e8ad3d36cae2a82b4c","abstract_canon_sha256":"b76ea645afd27a056449d546b4862f6143547bcbe27de9e33e67204f65985f86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:30.160538Z","signature_b64":"FPrE45npkPg9VXl/Ik5B1KQRZ+DygxLzSrt9ualudYdDUyAPHXLMxTz8WcqNEY8m8ns+jA3QJdm/IMDrDfbRBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9d8d77181fe3e995ecf14b47b57d6d3d2e01fff316afe1be5e34fe32f2ec834","last_reissued_at":"2026-05-18T02:49:30.160055Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:30.160055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spread Decoding in Extension Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anna-Lena Trautmann, Felice Manganiello","submitted_at":"2011-08-30T08:55:28Z","abstract_excerpt":"A spread code is a set of vector spaces of a fixed dimension over a finite field Fq with certain properties used for random network coding. It can be constructed in different ways which lead to different decoding algorithms. In this work we present a new representation of spread codes with a minimum distance decoding algorithm which is efficient when the codewords, the received space and the error space have small dimension."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5881","kind":"arxiv","version":2},"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":"1108.5881","created_at":"2026-05-18T02:49:30.160126+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.5881v2","created_at":"2026-05-18T02:49:30.160126+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5881","created_at":"2026-05-18T02:49:30.160126+00:00"},{"alias_kind":"pith_short_12","alias_value":"3HMNO4MB7Y7J","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"3HMNO4MB7Y7JSXWP","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"3HMNO4MB","created_at":"2026-05-18T12:26:18.847500+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/3HMNO4MB7Y7JSXWPCS2HWV6W2P","json":"https://pith.science/pith/3HMNO4MB7Y7JSXWPCS2HWV6W2P.json","graph_json":"https://pith.science/api/pith-number/3HMNO4MB7Y7JSXWPCS2HWV6W2P/graph.json","events_json":"https://pith.science/api/pith-number/3HMNO4MB7Y7JSXWPCS2HWV6W2P/events.json","paper":"https://pith.science/paper/3HMNO4MB"},"agent_actions":{"view_html":"https://pith.science/pith/3HMNO4MB7Y7JSXWPCS2HWV6W2P","download_json":"https://pith.science/pith/3HMNO4MB7Y7JSXWPCS2HWV6W2P.json","view_paper":"https://pith.science/paper/3HMNO4MB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.5881&json=true","fetch_graph":"https://pith.science/api/pith-number/3HMNO4MB7Y7JSXWPCS2HWV6W2P/graph.json","fetch_events":"https://pith.science/api/pith-number/3HMNO4MB7Y7JSXWPCS2HWV6W2P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3HMNO4MB7Y7JSXWPCS2HWV6W2P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3HMNO4MB7Y7JSXWPCS2HWV6W2P/action/storage_attestation","attest_author":"https://pith.science/pith/3HMNO4MB7Y7JSXWPCS2HWV6W2P/action/author_attestation","sign_citation":"https://pith.science/pith/3HMNO4MB7Y7JSXWPCS2HWV6W2P/action/citation_signature","submit_replication":"https://pith.science/pith/3HMNO4MB7Y7JSXWPCS2HWV6W2P/action/replication_record"}},"created_at":"2026-05-18T02:49:30.160126+00:00","updated_at":"2026-05-18T02:49:30.160126+00:00"}