{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ATV4RJYLCUD6QD2M2INKLMHIPX","short_pith_number":"pith:ATV4RJYL","canonical_record":{"source":{"id":"1807.02481","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-06T16:48:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"addf6bef3e069a39ce2257e7d718b79ee2195685e6a913c1090abdf8bb132668","abstract_canon_sha256":"fc6ce70d6f5ce9ead56802551ecb53e2550227b4b7d2421c8dfe9b9337b86af2"},"schema_version":"1.0"},"canonical_sha256":"04ebc8a70b1507e80f4cd21aa5b0e87df83932303ca3422b5da76c1d870a9ca0","source":{"kind":"arxiv","id":"1807.02481","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.02481","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"arxiv_version","alias_value":"1807.02481v2","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02481","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"pith_short_12","alias_value":"ATV4RJYLCUD6","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ATV4RJYLCUD6QD2M","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ATV4RJYL","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ATV4RJYLCUD6QD2M2INKLMHIPX","target":"record","payload":{"canonical_record":{"source":{"id":"1807.02481","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-06T16:48:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"addf6bef3e069a39ce2257e7d718b79ee2195685e6a913c1090abdf8bb132668","abstract_canon_sha256":"fc6ce70d6f5ce9ead56802551ecb53e2550227b4b7d2421c8dfe9b9337b86af2"},"schema_version":"1.0"},"canonical_sha256":"04ebc8a70b1507e80f4cd21aa5b0e87df83932303ca3422b5da76c1d870a9ca0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:16.453227Z","signature_b64":"KSF5uT6M+8GJ7NXSk2GbEDsDE54j75IBk1QPea8+i9y5F3CglmT6s2RCZg/9avAq6YXulG9x0yFk2QEMUB5GCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04ebc8a70b1507e80f4cd21aa5b0e87df83932303ca3422b5da76c1d870a9ca0","last_reissued_at":"2026-05-18T00:10:16.452580Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:16.452580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.02481","source_version":2,"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:10:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mZGq6B7Vhbb/AnjI1tbPbgosleyu0G9+wV1GxHB9K43CzLicWscflbavG7z8yu6hQJwEhw6ssD+r9sa0QiJwAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:40:46.574636Z"},"content_sha256":"876f9e96983b4b77e007393c2104ef2cbd75512482d6fd0e260a835bbe2b97c2","schema_version":"1.0","event_id":"sha256:876f9e96983b4b77e007393c2104ef2cbd75512482d6fd0e260a835bbe2b97c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ATV4RJYLCUD6QD2M2INKLMHIPX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Design of Low-Complexity Convolutional Codes over GF(q)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Catherine Douillard, Charbel Abdel Nour, Joumana Farah, Rami Klaimi","submitted_at":"2018-07-06T16:48:33Z","abstract_excerpt":"This paper proposes a new family of recursive systematic convolutional codes, defined in the non-binary domain over different Galois fields GF(q) and intended to be used as component codes for the design of non-binary turbo codes. A general framework for the design of the best codes over different GF(q) is described. The designed codes offer better performance than the non-binary convolutional codes found in the literature. They also outperform their binary counterparts when combined with their corresponding QAM modulation or with lower order modulations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02481","kind":"arxiv","version":2},"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:10:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TkIBVESOHw0EDfDk1YMEsGHOWyAszLiXvpZQsEvQ5U2vB2pFJx0ZVOLJp9FboOZd35VsvWgxndFtxPfPNwiAAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:40:46.574982Z"},"content_sha256":"b39a04a5b376d4ebf5aa13d56aeab9eb55bbad6f1344c20591ecc6e6e8b8652b","schema_version":"1.0","event_id":"sha256:b39a04a5b376d4ebf5aa13d56aeab9eb55bbad6f1344c20591ecc6e6e8b8652b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ATV4RJYLCUD6QD2M2INKLMHIPX/bundle.json","state_url":"https://pith.science/pith/ATV4RJYLCUD6QD2M2INKLMHIPX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ATV4RJYLCUD6QD2M2INKLMHIPX/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-20T08:40:46Z","links":{"resolver":"https://pith.science/pith/ATV4RJYLCUD6QD2M2INKLMHIPX","bundle":"https://pith.science/pith/ATV4RJYLCUD6QD2M2INKLMHIPX/bundle.json","state":"https://pith.science/pith/ATV4RJYLCUD6QD2M2INKLMHIPX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ATV4RJYLCUD6QD2M2INKLMHIPX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ATV4RJYLCUD6QD2M2INKLMHIPX","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":"fc6ce70d6f5ce9ead56802551ecb53e2550227b4b7d2421c8dfe9b9337b86af2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-06T16:48:33Z","title_canon_sha256":"addf6bef3e069a39ce2257e7d718b79ee2195685e6a913c1090abdf8bb132668"},"schema_version":"1.0","source":{"id":"1807.02481","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.02481","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"arxiv_version","alias_value":"1807.02481v2","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02481","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"pith_short_12","alias_value":"ATV4RJYLCUD6","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ATV4RJYLCUD6QD2M","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ATV4RJYL","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:b39a04a5b376d4ebf5aa13d56aeab9eb55bbad6f1344c20591ecc6e6e8b8652b","target":"graph","created_at":"2026-05-18T00:10:16Z","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":"This paper proposes a new family of recursive systematic convolutional codes, defined in the non-binary domain over different Galois fields GF(q) and intended to be used as component codes for the design of non-binary turbo codes. A general framework for the design of the best codes over different GF(q) is described. The designed codes offer better performance than the non-binary convolutional codes found in the literature. They also outperform their binary counterparts when combined with their corresponding QAM modulation or with lower order modulations.","authors_text":"Catherine Douillard, Charbel Abdel Nour, Joumana Farah, Rami Klaimi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-06T16:48:33Z","title":"Design of Low-Complexity Convolutional Codes over GF(q)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02481","kind":"arxiv","version":2},"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:876f9e96983b4b77e007393c2104ef2cbd75512482d6fd0e260a835bbe2b97c2","target":"record","created_at":"2026-05-18T00:10:16Z","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":"fc6ce70d6f5ce9ead56802551ecb53e2550227b4b7d2421c8dfe9b9337b86af2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-06T16:48:33Z","title_canon_sha256":"addf6bef3e069a39ce2257e7d718b79ee2195685e6a913c1090abdf8bb132668"},"schema_version":"1.0","source":{"id":"1807.02481","kind":"arxiv","version":2}},"canonical_sha256":"04ebc8a70b1507e80f4cd21aa5b0e87df83932303ca3422b5da76c1d870a9ca0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04ebc8a70b1507e80f4cd21aa5b0e87df83932303ca3422b5da76c1d870a9ca0","first_computed_at":"2026-05-18T00:10:16.452580Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:16.452580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KSF5uT6M+8GJ7NXSk2GbEDsDE54j75IBk1QPea8+i9y5F3CglmT6s2RCZg/9avAq6YXulG9x0yFk2QEMUB5GCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:16.453227Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.02481","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:876f9e96983b4b77e007393c2104ef2cbd75512482d6fd0e260a835bbe2b97c2","sha256:b39a04a5b376d4ebf5aa13d56aeab9eb55bbad6f1344c20591ecc6e6e8b8652b"],"state_sha256":"dd2f361b2322dd2651ddef530c3f7f4cd229e8925ad2a00091665b1edc8b8d60"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yNquEzPLiWqrRkxmyld92lVDEgE9Zcy4K6oTaIKlpB/Gi8Gz4CojNyC1rFgJ/w7HTfPNIOJ6zDayLmKSUaa0Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T08:40:46.576914Z","bundle_sha256":"18f3d1ef6acceffa0ed1511c8532b4843e28545e90c4f29068a2dfe98ed47eba"}}