{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:AIDLJ6PIYWX2XVF56O6XXQFCNY","short_pith_number":"pith:AIDLJ6PI","schema_version":"1.0","canonical_sha256":"0206b4f9e8c5afabd4bdf3bd7bc0a26e3880127bfb533587c1d549fd9aedb87e","source":{"kind":"arxiv","id":"1102.4711","version":3},"attestation_state":"computed","paper":{"title":"Turbo Codes Based on Time-Variant Memory-1 Convolutional Codes over Fq","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Enrico Paolini, Gianluigi Liva, Marco Chiani, Sandro Scalise","submitted_at":"2011-02-23T10:52:48Z","abstract_excerpt":"Two classes of turbo codes over high-order finite fields are introduced. The codes are derived from a particular protograph sub-ensemble of the (dv=2,dc=3) low-density parity-check code ensemble. A first construction is derived as a parallel concatenation of two non-binary, time-variant accumulators. The second construction is based on the serial concatenation of a non-binary, time-variant differentiator and of a non-binary, time-variant accumulator, and provides a highly-structured flexible encoding scheme for (dv=2,dc=4) ensemble codes. A cycle graph representation is provided. The proposed "},"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.4711","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-23T10:52:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e2539c1d2384cd16bca0c06399bba2be9b13b8f581ad24c026a456a2723ee3dd","abstract_canon_sha256":"e6442954ee577844a532a7103880f2cc997b50a378b2f0387a0247feb8f0fe64"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:19.060512Z","signature_b64":"jLIuwrIoQPqIDF7mPIVOoYMrR3zUAIfH4vOt6PWf3QuWzmhXeXChyxBcaWr3s/tlZ+SuzFMAVrOqd/uHKAqsCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0206b4f9e8c5afabd4bdf3bd7bc0a26e3880127bfb533587c1d549fd9aedb87e","last_reissued_at":"2026-05-18T00:58:19.059867Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:19.059867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Turbo Codes Based on Time-Variant Memory-1 Convolutional Codes over Fq","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Enrico Paolini, Gianluigi Liva, Marco Chiani, Sandro Scalise","submitted_at":"2011-02-23T10:52:48Z","abstract_excerpt":"Two classes of turbo codes over high-order finite fields are introduced. The codes are derived from a particular protograph sub-ensemble of the (dv=2,dc=3) low-density parity-check code ensemble. A first construction is derived as a parallel concatenation of two non-binary, time-variant accumulators. The second construction is based on the serial concatenation of a non-binary, time-variant differentiator and of a non-binary, time-variant accumulator, and provides a highly-structured flexible encoding scheme for (dv=2,dc=4) ensemble codes. A cycle graph representation is provided. The proposed "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4711","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.4711","created_at":"2026-05-18T00:58:19.059969+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.4711v3","created_at":"2026-05-18T00:58:19.059969+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4711","created_at":"2026-05-18T00:58:19.059969+00:00"},{"alias_kind":"pith_short_12","alias_value":"AIDLJ6PIYWX2","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"AIDLJ6PIYWX2XVF5","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"AIDLJ6PI","created_at":"2026-05-18T12:26:24.575870+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/AIDLJ6PIYWX2XVF56O6XXQFCNY","json":"https://pith.science/pith/AIDLJ6PIYWX2XVF56O6XXQFCNY.json","graph_json":"https://pith.science/api/pith-number/AIDLJ6PIYWX2XVF56O6XXQFCNY/graph.json","events_json":"https://pith.science/api/pith-number/AIDLJ6PIYWX2XVF56O6XXQFCNY/events.json","paper":"https://pith.science/paper/AIDLJ6PI"},"agent_actions":{"view_html":"https://pith.science/pith/AIDLJ6PIYWX2XVF56O6XXQFCNY","download_json":"https://pith.science/pith/AIDLJ6PIYWX2XVF56O6XXQFCNY.json","view_paper":"https://pith.science/paper/AIDLJ6PI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.4711&json=true","fetch_graph":"https://pith.science/api/pith-number/AIDLJ6PIYWX2XVF56O6XXQFCNY/graph.json","fetch_events":"https://pith.science/api/pith-number/AIDLJ6PIYWX2XVF56O6XXQFCNY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AIDLJ6PIYWX2XVF56O6XXQFCNY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AIDLJ6PIYWX2XVF56O6XXQFCNY/action/storage_attestation","attest_author":"https://pith.science/pith/AIDLJ6PIYWX2XVF56O6XXQFCNY/action/author_attestation","sign_citation":"https://pith.science/pith/AIDLJ6PIYWX2XVF56O6XXQFCNY/action/citation_signature","submit_replication":"https://pith.science/pith/AIDLJ6PIYWX2XVF56O6XXQFCNY/action/replication_record"}},"created_at":"2026-05-18T00:58:19.059969+00:00","updated_at":"2026-05-18T00:58:19.059969+00:00"}