{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:NTRP7DAUC3NVFAQWMQJK5U5KPG","short_pith_number":"pith:NTRP7DAU","schema_version":"1.0","canonical_sha256":"6ce2ff8c1416db5282166412aed3aa798a4f0481d448f7e34de6d1921ab96c18","source":{"kind":"arxiv","id":"1102.3126","version":3},"attestation_state":"computed","paper":{"title":"Reduced-Complexity Collaborative Decoding of Interleaved Reed-Solomon and Gabidulin Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hans Kurzweil, Johannes B. Huber, Mathis Seidl","submitted_at":"2011-02-15T17:00:01Z","abstract_excerpt":"An alternative method for collaborative decoding of interleaved Reed-Solomon codes as well as Gabidulin codes for the case of high interleaving degree is proposed. As an example of application, simulation results are presented for a concatenated coding scheme using polar codes as inner codes."},"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":"1102.3126","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-15T17:00:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"923c3fead005e286e9ac5165cd26a6a88b915370d7936a7f2f5f59e9b1028975","abstract_canon_sha256":"f4ea6f68558d415ca1661f14006d39afdbf95857cb2dad71b70ba6acbcd1f5f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:19.116823Z","signature_b64":"hg0iEzo2Bjbxl0AZ8Vb+VonkWGYXp+uuXQI/jSLDHakyAhoyCtYC1SBhqhsYHIBhfSkL80W4a9G3oklfwYjUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ce2ff8c1416db5282166412aed3aa798a4f0481d448f7e34de6d1921ab96c18","last_reissued_at":"2026-05-18T00:58:19.116291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:19.116291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reduced-Complexity Collaborative Decoding of Interleaved Reed-Solomon and Gabidulin Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hans Kurzweil, Johannes B. Huber, Mathis Seidl","submitted_at":"2011-02-15T17:00:01Z","abstract_excerpt":"An alternative method for collaborative decoding of interleaved Reed-Solomon codes as well as Gabidulin codes for the case of high interleaving degree is proposed. As an example of application, simulation results are presented for a concatenated coding scheme using polar codes as inner codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3126","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1102.3126","created_at":"2026-05-18T00:58:19.116385+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.3126v3","created_at":"2026-05-18T00:58:19.116385+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3126","created_at":"2026-05-18T00:58:19.116385+00:00"},{"alias_kind":"pith_short_12","alias_value":"NTRP7DAUC3NV","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"NTRP7DAUC3NVFAQW","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"NTRP7DAU","created_at":"2026-05-18T12:26:37.096874+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/NTRP7DAUC3NVFAQWMQJK5U5KPG","json":"https://pith.science/pith/NTRP7DAUC3NVFAQWMQJK5U5KPG.json","graph_json":"https://pith.science/api/pith-number/NTRP7DAUC3NVFAQWMQJK5U5KPG/graph.json","events_json":"https://pith.science/api/pith-number/NTRP7DAUC3NVFAQWMQJK5U5KPG/events.json","paper":"https://pith.science/paper/NTRP7DAU"},"agent_actions":{"view_html":"https://pith.science/pith/NTRP7DAUC3NVFAQWMQJK5U5KPG","download_json":"https://pith.science/pith/NTRP7DAUC3NVFAQWMQJK5U5KPG.json","view_paper":"https://pith.science/paper/NTRP7DAU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.3126&json=true","fetch_graph":"https://pith.science/api/pith-number/NTRP7DAUC3NVFAQWMQJK5U5KPG/graph.json","fetch_events":"https://pith.science/api/pith-number/NTRP7DAUC3NVFAQWMQJK5U5KPG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NTRP7DAUC3NVFAQWMQJK5U5KPG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NTRP7DAUC3NVFAQWMQJK5U5KPG/action/storage_attestation","attest_author":"https://pith.science/pith/NTRP7DAUC3NVFAQWMQJK5U5KPG/action/author_attestation","sign_citation":"https://pith.science/pith/NTRP7DAUC3NVFAQWMQJK5U5KPG/action/citation_signature","submit_replication":"https://pith.science/pith/NTRP7DAUC3NVFAQWMQJK5U5KPG/action/replication_record"}},"created_at":"2026-05-18T00:58:19.116385+00:00","updated_at":"2026-05-18T00:58:19.116385+00:00"}