{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JUVSGHJWKNECNM5VGFMLFP2EGK","short_pith_number":"pith:JUVSGHJW","schema_version":"1.0","canonical_sha256":"4d2b231d36534826b3b53158b2bf443291e714acb042f5d5d40266abd16afa80","source":{"kind":"arxiv","id":"1501.04797","version":1},"attestation_state":"computed","paper":{"title":"Solving Shift Register Problems over Skew Polynomial Rings using Module Minimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Johan S. R. Nielsen, Sven Puchinger, Vladimir Sidorenko, Wenhui Li","submitted_at":"2015-01-20T13:07:59Z","abstract_excerpt":"For many algebraic codes the main part of decoding can be reduced to a shift register synthesis problem. In this paper we present an approach for solving generalised shift register problems over skew polynomial rings which occur in error and erasure decoding of $\\ell$-Interleaved Gabidulin codes. The algorithm is based on module minimisation and has time complexity $O(\\ell \\mu^2)$ where $\\mu$ measures the size of the input problem."},"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":"1501.04797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-20T13:07:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"19ee0c1b8d3bb55fe258847ec244a9e091dfa8fca04479688c80776c98bc5d36","abstract_canon_sha256":"0611e2e6917ec824a206f2f44114b337ac819e28030a441a3b07b3b4fbbfd91f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:02.248164Z","signature_b64":"qIPKsgQUopDWOqHMwiT/FlzSFHQo2OeOfJ0rk4hjr4Nb79RLljk/tx7Bwhs4ECBPaFojCmSNWJspRs+zCEX2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d2b231d36534826b3b53158b2bf443291e714acb042f5d5d40266abd16afa80","last_reissued_at":"2026-05-18T02:29:02.247717Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:02.247717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Shift Register Problems over Skew Polynomial Rings using Module Minimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Johan S. R. Nielsen, Sven Puchinger, Vladimir Sidorenko, Wenhui Li","submitted_at":"2015-01-20T13:07:59Z","abstract_excerpt":"For many algebraic codes the main part of decoding can be reduced to a shift register synthesis problem. In this paper we present an approach for solving generalised shift register problems over skew polynomial rings which occur in error and erasure decoding of $\\ell$-Interleaved Gabidulin codes. The algorithm is based on module minimisation and has time complexity $O(\\ell \\mu^2)$ where $\\mu$ measures the size of the input problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04797","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":"1501.04797","created_at":"2026-05-18T02:29:02.247784+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.04797v1","created_at":"2026-05-18T02:29:02.247784+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04797","created_at":"2026-05-18T02:29:02.247784+00:00"},{"alias_kind":"pith_short_12","alias_value":"JUVSGHJWKNEC","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JUVSGHJWKNECNM5V","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JUVSGHJW","created_at":"2026-05-18T12:29:27.538025+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/JUVSGHJWKNECNM5VGFMLFP2EGK","json":"https://pith.science/pith/JUVSGHJWKNECNM5VGFMLFP2EGK.json","graph_json":"https://pith.science/api/pith-number/JUVSGHJWKNECNM5VGFMLFP2EGK/graph.json","events_json":"https://pith.science/api/pith-number/JUVSGHJWKNECNM5VGFMLFP2EGK/events.json","paper":"https://pith.science/paper/JUVSGHJW"},"agent_actions":{"view_html":"https://pith.science/pith/JUVSGHJWKNECNM5VGFMLFP2EGK","download_json":"https://pith.science/pith/JUVSGHJWKNECNM5VGFMLFP2EGK.json","view_paper":"https://pith.science/paper/JUVSGHJW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.04797&json=true","fetch_graph":"https://pith.science/api/pith-number/JUVSGHJWKNECNM5VGFMLFP2EGK/graph.json","fetch_events":"https://pith.science/api/pith-number/JUVSGHJWKNECNM5VGFMLFP2EGK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JUVSGHJWKNECNM5VGFMLFP2EGK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JUVSGHJWKNECNM5VGFMLFP2EGK/action/storage_attestation","attest_author":"https://pith.science/pith/JUVSGHJWKNECNM5VGFMLFP2EGK/action/author_attestation","sign_citation":"https://pith.science/pith/JUVSGHJWKNECNM5VGFMLFP2EGK/action/citation_signature","submit_replication":"https://pith.science/pith/JUVSGHJWKNECNM5VGFMLFP2EGK/action/replication_record"}},"created_at":"2026-05-18T02:29:02.247784+00:00","updated_at":"2026-05-18T02:29:02.247784+00:00"}