{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4HUNL26PEF5BRLPY42OLR723KQ","short_pith_number":"pith:4HUNL26P","canonical_record":{"source":{"id":"1408.2303","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-11T04:25:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f3cd5a3e648f11a844eb040aa0763d238cabba8dee5e09fd29fbaa8128c2fe40","abstract_canon_sha256":"2f74bba4b6ca011845452051153f1886ef13521555a14bbe4043f66e6319c59d"},"schema_version":"1.0"},"canonical_sha256":"e1e8d5ebcf217a18adf8e69cb8ff5b541fe8400f8d0e39a7c56f5ad77142de97","source":{"kind":"arxiv","id":"1408.2303","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2303","created_at":"2026-05-18T01:34:25Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2303v3","created_at":"2026-05-18T01:34:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2303","created_at":"2026-05-18T01:34:25Z"},{"alias_kind":"pith_short_12","alias_value":"4HUNL26PEF5B","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4HUNL26PEF5BRLPY","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4HUNL26P","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4HUNL26PEF5BRLPY42OLR723KQ","target":"record","payload":{"canonical_record":{"source":{"id":"1408.2303","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-11T04:25:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f3cd5a3e648f11a844eb040aa0763d238cabba8dee5e09fd29fbaa8128c2fe40","abstract_canon_sha256":"2f74bba4b6ca011845452051153f1886ef13521555a14bbe4043f66e6319c59d"},"schema_version":"1.0"},"canonical_sha256":"e1e8d5ebcf217a18adf8e69cb8ff5b541fe8400f8d0e39a7c56f5ad77142de97","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:25.640524Z","signature_b64":"z2HJinKWWQQgqA/cvCsOvSw3xUUqGPA0oa354Su4b/H9ru7TMIOWEf+9uhST9Tyf/EZL0Xxn13sXFo3mW1quBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1e8d5ebcf217a18adf8e69cb8ff5b541fe8400f8d0e39a7c56f5ad77142de97","last_reissued_at":"2026-05-18T01:34:25.640103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:25.640103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.2303","source_version":3,"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-18T01:34:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5zfF4RLUhywVaPEWhGlVG+yHTIsASM6z1XOX+c/JvHTmL7vQw8TNvyMGByVmHiw+j/oKxvOsjuN+tqZtjgb6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:31:38.779377Z"},"content_sha256":"6ebb3798ba75f3f2c36ee6976ee1f871918682d8df23e2cc785be4a83549b949","schema_version":"1.0","event_id":"sha256:6ebb3798ba75f3f2c36ee6976ee1f871918682d8df23e2cc785be4a83549b949"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4HUNL26PEF5BRLPY42OLR723KQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gabidulin Decoding via Minimal Bases of Linearized Polynomial Modules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anna-Lena Trautmann, Margreta Kuijper","submitted_at":"2014-08-11T04:25:52Z","abstract_excerpt":"We show how Gabidulin codes can be decoded via parametrization by using interpolation modules over the ring of linearized polynomials with composition. Our decoding algorithm computes a list of message words that correspond to all closest codewords to a given received word. This involves the computation of a minimal basis for the interpolation module that corresponds to the received word, followed by a search through the parametrization for valid message words. Our module-theoretic approach strengthens the link between Gabidulin decoding and Reed-Solomon decoding. Two subalgorithms are present"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2303","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"},"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-18T01:34:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9E2qOXfG5+sS6kiDk1a3sSfjpTVd2e5DCGlXC4hCd1GNuCm/LTqaWdClViayQF00v0KKDwRiDZ+9DjGfU5LXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:31:38.779761Z"},"content_sha256":"de7c7989edbad33ac534fff808aeb5ac96e4ac47877941c50ec223f157752123","schema_version":"1.0","event_id":"sha256:de7c7989edbad33ac534fff808aeb5ac96e4ac47877941c50ec223f157752123"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4HUNL26PEF5BRLPY42OLR723KQ/bundle.json","state_url":"https://pith.science/pith/4HUNL26PEF5BRLPY42OLR723KQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4HUNL26PEF5BRLPY42OLR723KQ/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-28T13:31:38Z","links":{"resolver":"https://pith.science/pith/4HUNL26PEF5BRLPY42OLR723KQ","bundle":"https://pith.science/pith/4HUNL26PEF5BRLPY42OLR723KQ/bundle.json","state":"https://pith.science/pith/4HUNL26PEF5BRLPY42OLR723KQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4HUNL26PEF5BRLPY42OLR723KQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4HUNL26PEF5BRLPY42OLR723KQ","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":"2f74bba4b6ca011845452051153f1886ef13521555a14bbe4043f66e6319c59d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-11T04:25:52Z","title_canon_sha256":"f3cd5a3e648f11a844eb040aa0763d238cabba8dee5e09fd29fbaa8128c2fe40"},"schema_version":"1.0","source":{"id":"1408.2303","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2303","created_at":"2026-05-18T01:34:25Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2303v3","created_at":"2026-05-18T01:34:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2303","created_at":"2026-05-18T01:34:25Z"},{"alias_kind":"pith_short_12","alias_value":"4HUNL26PEF5B","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4HUNL26PEF5BRLPY","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4HUNL26P","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:de7c7989edbad33ac534fff808aeb5ac96e4ac47877941c50ec223f157752123","target":"graph","created_at":"2026-05-18T01:34:25Z","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":"We show how Gabidulin codes can be decoded via parametrization by using interpolation modules over the ring of linearized polynomials with composition. Our decoding algorithm computes a list of message words that correspond to all closest codewords to a given received word. This involves the computation of a minimal basis for the interpolation module that corresponds to the received word, followed by a search through the parametrization for valid message words. Our module-theoretic approach strengthens the link between Gabidulin decoding and Reed-Solomon decoding. Two subalgorithms are present","authors_text":"Anna-Lena Trautmann, Margreta Kuijper","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-11T04:25:52Z","title":"Gabidulin Decoding via Minimal Bases of Linearized Polynomial Modules"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2303","kind":"arxiv","version":3},"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:6ebb3798ba75f3f2c36ee6976ee1f871918682d8df23e2cc785be4a83549b949","target":"record","created_at":"2026-05-18T01:34:25Z","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":"2f74bba4b6ca011845452051153f1886ef13521555a14bbe4043f66e6319c59d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-11T04:25:52Z","title_canon_sha256":"f3cd5a3e648f11a844eb040aa0763d238cabba8dee5e09fd29fbaa8128c2fe40"},"schema_version":"1.0","source":{"id":"1408.2303","kind":"arxiv","version":3}},"canonical_sha256":"e1e8d5ebcf217a18adf8e69cb8ff5b541fe8400f8d0e39a7c56f5ad77142de97","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1e8d5ebcf217a18adf8e69cb8ff5b541fe8400f8d0e39a7c56f5ad77142de97","first_computed_at":"2026-05-18T01:34:25.640103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:25.640103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z2HJinKWWQQgqA/cvCsOvSw3xUUqGPA0oa354Su4b/H9ru7TMIOWEf+9uhST9Tyf/EZL0Xxn13sXFo3mW1quBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:25.640524Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.2303","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ebb3798ba75f3f2c36ee6976ee1f871918682d8df23e2cc785be4a83549b949","sha256:de7c7989edbad33ac534fff808aeb5ac96e4ac47877941c50ec223f157752123"],"state_sha256":"a884b8aaa2ce82e7bfb0c7793e45f2475541ef8bf34ba2649ae69f6f3aac2a0d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SuR1OqE+ValiMsesmfnYyKMJRufMNbRjZTqyMSB3DCvbl7pPGuMef6kyxZNXzIcPCTwa1t+Gs/BsxEOGQTZ9Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:31:38.781714Z","bundle_sha256":"4cb3dfa387bf3ba31460930417487a2f4cfec7dc4d30e9af5272a3297f3eea94"}}