{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:MC7KWNJQL64XDSFUZ3TJEZ27N4","short_pith_number":"pith:MC7KWNJQ","canonical_record":{"source":{"id":"1107.5523","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-27T16:30:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"84f95eb2347dae66e041023ef5a19dd899f881319298c5be9dbbce2eddcaf006","abstract_canon_sha256":"1f784f359a6be0e84ad0673b6863a80cc8dd83d990f0494ec42a897dd96bceb9"},"schema_version":"1.0"},"canonical_sha256":"60beab35305fb971c8b4cee692675f6f0aedd8c8d998c51b6d1e9ec013ab1a62","source":{"kind":"arxiv","id":"1107.5523","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.5523","created_at":"2026-05-18T03:54:06Z"},{"alias_kind":"arxiv_version","alias_value":"1107.5523v4","created_at":"2026-05-18T03:54:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5523","created_at":"2026-05-18T03:54:06Z"},{"alias_kind":"pith_short_12","alias_value":"MC7KWNJQL64X","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MC7KWNJQL64XDSFU","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MC7KWNJQ","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:MC7KWNJQL64XDSFUZ3TJEZ27N4","target":"record","payload":{"canonical_record":{"source":{"id":"1107.5523","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-27T16:30:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"84f95eb2347dae66e041023ef5a19dd899f881319298c5be9dbbce2eddcaf006","abstract_canon_sha256":"1f784f359a6be0e84ad0673b6863a80cc8dd83d990f0494ec42a897dd96bceb9"},"schema_version":"1.0"},"canonical_sha256":"60beab35305fb971c8b4cee692675f6f0aedd8c8d998c51b6d1e9ec013ab1a62","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:06.124535Z","signature_b64":"CxVWdjpE0miwuhtFREZ6gep4wx2iuKB9V8kuQlUr+czfbEZs/uW8WcMNykSDgEsX4iREXsjr/vIlp20lvUxmBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60beab35305fb971c8b4cee692675f6f0aedd8c8d998c51b6d1e9ec013ab1a62","last_reissued_at":"2026-05-18T03:54:06.123834Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:06.123834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.5523","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:54:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HLjvgSgfo2uZxs20Rx/7eQh2UpEzrrSi/tZ0afT2Ui7cWSLRrW1/EdtA3aakTGuAi2/QfBWaVj3z1yj7W/SVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:29:02.150020Z"},"content_sha256":"7c84d5469522eab30d1538e84eaedbe17b747e0491a5388747b29a1b3ca0ff6a","schema_version":"1.0","event_id":"sha256:7c84d5469522eab30d1538e84eaedbe17b747e0491a5388747b29a1b3ca0ff6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:MC7KWNJQL64XDSFUZ3TJEZ27N4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Algebraic Approach for Decoding Spread Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Elisa Gorla, Felice Manganiello, Joachim Rosenthal","submitted_at":"2011-07-27T16:30:53Z","abstract_excerpt":"In this paper we study spread codes: a family of constant-dimension codes for random linear network coding. In other words, the codewords are full-rank matrices of size (k x n) with entries in a finite field F_q. Spread codes are a family of optimal codes with maximal minimum distance. We give a minimum-distance decoding algorithm which requires O((n-k)k^3) operations over an extension field F_{q^k}. Our algorithm is more efficient than the previous ones in the literature, when the dimension k of the codewords is small with respect to n. The decoding algorithm takes advantage of the algebraic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5523","kind":"arxiv","version":4},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:54:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rDfPsbb/MTTVv8Jxu0CGB95OAXguMT/TL7mVKLc+cq/QQUlDtcEbV2MD6mKo0BgiN0fWMkza4u3xvGBPd3FsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:29:02.150654Z"},"content_sha256":"ff05cf8d4c5642e50a5a6f8aed54e210488eea0dd5add6c3eb03a2ec4ac86001","schema_version":"1.0","event_id":"sha256:ff05cf8d4c5642e50a5a6f8aed54e210488eea0dd5add6c3eb03a2ec4ac86001"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MC7KWNJQL64XDSFUZ3TJEZ27N4/bundle.json","state_url":"https://pith.science/pith/MC7KWNJQL64XDSFUZ3TJEZ27N4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MC7KWNJQL64XDSFUZ3TJEZ27N4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T20:29:02Z","links":{"resolver":"https://pith.science/pith/MC7KWNJQL64XDSFUZ3TJEZ27N4","bundle":"https://pith.science/pith/MC7KWNJQL64XDSFUZ3TJEZ27N4/bundle.json","state":"https://pith.science/pith/MC7KWNJQL64XDSFUZ3TJEZ27N4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MC7KWNJQL64XDSFUZ3TJEZ27N4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:MC7KWNJQL64XDSFUZ3TJEZ27N4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1f784f359a6be0e84ad0673b6863a80cc8dd83d990f0494ec42a897dd96bceb9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-27T16:30:53Z","title_canon_sha256":"84f95eb2347dae66e041023ef5a19dd899f881319298c5be9dbbce2eddcaf006"},"schema_version":"1.0","source":{"id":"1107.5523","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.5523","created_at":"2026-05-18T03:54:06Z"},{"alias_kind":"arxiv_version","alias_value":"1107.5523v4","created_at":"2026-05-18T03:54:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5523","created_at":"2026-05-18T03:54:06Z"},{"alias_kind":"pith_short_12","alias_value":"MC7KWNJQL64X","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MC7KWNJQL64XDSFU","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MC7KWNJQ","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:ff05cf8d4c5642e50a5a6f8aed54e210488eea0dd5add6c3eb03a2ec4ac86001","target":"graph","created_at":"2026-05-18T03:54:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper we study spread codes: a family of constant-dimension codes for random linear network coding. In other words, the codewords are full-rank matrices of size (k x n) with entries in a finite field F_q. Spread codes are a family of optimal codes with maximal minimum distance. We give a minimum-distance decoding algorithm which requires O((n-k)k^3) operations over an extension field F_{q^k}. Our algorithm is more efficient than the previous ones in the literature, when the dimension k of the codewords is small with respect to n. The decoding algorithm takes advantage of the algebraic ","authors_text":"Elisa Gorla, Felice Manganiello, Joachim Rosenthal","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-27T16:30:53Z","title":"An Algebraic Approach for Decoding Spread Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5523","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7c84d5469522eab30d1538e84eaedbe17b747e0491a5388747b29a1b3ca0ff6a","target":"record","created_at":"2026-05-18T03:54:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1f784f359a6be0e84ad0673b6863a80cc8dd83d990f0494ec42a897dd96bceb9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-27T16:30:53Z","title_canon_sha256":"84f95eb2347dae66e041023ef5a19dd899f881319298c5be9dbbce2eddcaf006"},"schema_version":"1.0","source":{"id":"1107.5523","kind":"arxiv","version":4}},"canonical_sha256":"60beab35305fb971c8b4cee692675f6f0aedd8c8d998c51b6d1e9ec013ab1a62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60beab35305fb971c8b4cee692675f6f0aedd8c8d998c51b6d1e9ec013ab1a62","first_computed_at":"2026-05-18T03:54:06.123834Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:06.123834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CxVWdjpE0miwuhtFREZ6gep4wx2iuKB9V8kuQlUr+czfbEZs/uW8WcMNykSDgEsX4iREXsjr/vIlp20lvUxmBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:06.124535Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.5523","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c84d5469522eab30d1538e84eaedbe17b747e0491a5388747b29a1b3ca0ff6a","sha256:ff05cf8d4c5642e50a5a6f8aed54e210488eea0dd5add6c3eb03a2ec4ac86001"],"state_sha256":"ec91cdae41b6d758d3f81f67ab264080c4a9ac3094167cfcb6212d8ad20d068c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yz3oxd5+500dbd7Ls4tge5rjNTROFEH9+Veoj8nWi7mhe7Cs4rfe4b31tdvDlzCC1JZJdnske6L2aIpk6Ld6DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:29:02.154447Z","bundle_sha256":"7390466af06d70e9d2e7f9802ebd48d64d4a92be8c8759ad0cad9c19144e83e6"}}