{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:AIDLJ6PIYWX2XVF56O6XXQFCNY","short_pith_number":"pith:AIDLJ6PI","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"},"canonical_sha256":"0206b4f9e8c5afabd4bdf3bd7bc0a26e3880127bfb533587c1d549fd9aedb87e","source":{"kind":"arxiv","id":"1102.4711","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4711","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4711v3","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4711","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"AIDLJ6PIYWX2","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AIDLJ6PIYWX2XVF5","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AIDLJ6PI","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:AIDLJ6PIYWX2XVF56O6XXQFCNY","target":"record","payload":{"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"},"canonical_sha256":"0206b4f9e8c5afabd4bdf3bd7bc0a26e3880127bfb533587c1d549fd9aedb87e","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"},"source_kind":"arxiv","source_id":"1102.4711","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-18T00:58:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oca+tjephe6uZZHaD9ZtiwQQrLWnjN+K1I4uXPCzuO9lba7d9sQOTLSy46WZGM+Eend7opQpSR7TjtMoNZ4EBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:22:50.837859Z"},"content_sha256":"29f90a3918da06553041d30cbb5bbec6d8e67ca614c58514002bce65bf6b7b63","schema_version":"1.0","event_id":"sha256:29f90a3918da06553041d30cbb5bbec6d8e67ca614c58514002bce65bf6b7b63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:AIDLJ6PIYWX2XVF56O6XXQFCNY","target":"graph","payload":{"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"},"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-18T00:58:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gtXl47hLEePR6NJP6t4507RRSArFFpYQpRM5lP6NiUKlzXddsvshvWo9NKFduw3KPRBxrYgKh7VQQDwa15MEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:22:50.838196Z"},"content_sha256":"41209d4d9f2a282813f97db3435c794dad1b30f0b67430e6e6236972fe616fd7","schema_version":"1.0","event_id":"sha256:41209d4d9f2a282813f97db3435c794dad1b30f0b67430e6e6236972fe616fd7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AIDLJ6PIYWX2XVF56O6XXQFCNY/bundle.json","state_url":"https://pith.science/pith/AIDLJ6PIYWX2XVF56O6XXQFCNY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AIDLJ6PIYWX2XVF56O6XXQFCNY/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-06-05T12:22:50Z","links":{"resolver":"https://pith.science/pith/AIDLJ6PIYWX2XVF56O6XXQFCNY","bundle":"https://pith.science/pith/AIDLJ6PIYWX2XVF56O6XXQFCNY/bundle.json","state":"https://pith.science/pith/AIDLJ6PIYWX2XVF56O6XXQFCNY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AIDLJ6PIYWX2XVF56O6XXQFCNY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:AIDLJ6PIYWX2XVF56O6XXQFCNY","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":"e6442954ee577844a532a7103880f2cc997b50a378b2f0387a0247feb8f0fe64","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-23T10:52:48Z","title_canon_sha256":"e2539c1d2384cd16bca0c06399bba2be9b13b8f581ad24c026a456a2723ee3dd"},"schema_version":"1.0","source":{"id":"1102.4711","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4711","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4711v3","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4711","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"AIDLJ6PIYWX2","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AIDLJ6PIYWX2XVF5","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AIDLJ6PI","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:41209d4d9f2a282813f97db3435c794dad1b30f0b67430e6e6236972fe616fd7","target":"graph","created_at":"2026-05-18T00:58:19Z","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":"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 ","authors_text":"Enrico Paolini, Gianluigi Liva, Marco Chiani, Sandro Scalise","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-23T10:52:48Z","title":"Turbo Codes Based on Time-Variant Memory-1 Convolutional Codes over Fq"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4711","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:29f90a3918da06553041d30cbb5bbec6d8e67ca614c58514002bce65bf6b7b63","target":"record","created_at":"2026-05-18T00:58:19Z","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":"e6442954ee577844a532a7103880f2cc997b50a378b2f0387a0247feb8f0fe64","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-23T10:52:48Z","title_canon_sha256":"e2539c1d2384cd16bca0c06399bba2be9b13b8f581ad24c026a456a2723ee3dd"},"schema_version":"1.0","source":{"id":"1102.4711","kind":"arxiv","version":3}},"canonical_sha256":"0206b4f9e8c5afabd4bdf3bd7bc0a26e3880127bfb533587c1d549fd9aedb87e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0206b4f9e8c5afabd4bdf3bd7bc0a26e3880127bfb533587c1d549fd9aedb87e","first_computed_at":"2026-05-18T00:58:19.059867Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:19.059867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jLIuwrIoQPqIDF7mPIVOoYMrR3zUAIfH4vOt6PWf3QuWzmhXeXChyxBcaWr3s/tlZ+SuzFMAVrOqd/uHKAqsCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:19.060512Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.4711","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29f90a3918da06553041d30cbb5bbec6d8e67ca614c58514002bce65bf6b7b63","sha256:41209d4d9f2a282813f97db3435c794dad1b30f0b67430e6e6236972fe616fd7"],"state_sha256":"134425df40e2fab024a4a959b4d29bbfe24f2a75d4a01a05f38367931664fdce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vLS7xbx4Lt1gVXhDt7UCH6B90iwqX3YjrKwMoqvs90Bmcf3EP0Wv/Gv2ky3XX0RIdezZAnU6Er+zbt2sJ3GlBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:22:50.840163Z","bundle_sha256":"ad5bc5ab42e8c6ab5086c1220b5c1b9356c9322379ab91d889cd5bd37ad5c883"}}