{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SNUEBGNUKRF2WA63E5KOVBPXFW","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":"ff6f8b0ed22392ef02ab4efec04e20d85c26f95bb8edb1a2663dcd0c2dc07980","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-01T08:01:41Z","title_canon_sha256":"f41bda860f592a0a9ae004abdf72429a0d58b6a873c1b02280a24cbc024a6350"},"schema_version":"1.0","source":{"id":"1702.00153","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.00153","created_at":"2026-05-18T00:51:35Z"},{"alias_kind":"arxiv_version","alias_value":"1702.00153v1","created_at":"2026-05-18T00:51:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00153","created_at":"2026-05-18T00:51:35Z"},{"alias_kind":"pith_short_12","alias_value":"SNUEBGNUKRF2","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SNUEBGNUKRF2WA63","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SNUEBGNU","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:3be28ad7697ae5aa3c5b1418855b41873303d4c76001b90efac6c5083d9b991d","target":"graph","created_at":"2026-05-18T00:51:35Z","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":"Generalized quasi-cyclic (GQC) codes form a natural generalization of quasi-cyclic (QC) codes. They are viewed here as mixed alphabet codes over a family of ring alphabets. Decomposing these rings into local rings by the Chinese Remainder Theorem yields a decomposition of GQC codes into a sum of concatenated codes. This decomposition leads to a trace formula, a minimum distance bound, and to a criteria for the GQC code to be self-dual or to be linear complementary dual (LCD). Explicit long GQC codes that are LCD, but not QC, are exhibited.","authors_text":"Buket \\\"Ozkaya, Cem G\\\"uneri, Elif Sa\\c{c}{\\i}kara, Ferruh \\\"Ozbudak, Patrick Sol\\'e, Zahra Sepasdar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-01T08:01:41Z","title":"Structure and Performance of Generalized Quasi-Cyclic Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00153","kind":"arxiv","version":1},"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:4a564e9a80f3e2f20fb10e96c01bd80f2c4cda241a023624e0c2bbb6e6b48cb6","target":"record","created_at":"2026-05-18T00:51:35Z","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":"ff6f8b0ed22392ef02ab4efec04e20d85c26f95bb8edb1a2663dcd0c2dc07980","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-01T08:01:41Z","title_canon_sha256":"f41bda860f592a0a9ae004abdf72429a0d58b6a873c1b02280a24cbc024a6350"},"schema_version":"1.0","source":{"id":"1702.00153","kind":"arxiv","version":1}},"canonical_sha256":"93684099b4544bab03db2754ea85f72dbdbe0404554b4e1da43b7eac5b7a0905","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93684099b4544bab03db2754ea85f72dbdbe0404554b4e1da43b7eac5b7a0905","first_computed_at":"2026-05-18T00:51:35.073850Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:35.073850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cagIdAcgm2OLIA2lzEBuSOUP4F8UmOKBaZJBsDTlDUFOl8NV7fdEI2yZHMQBJwyJBsHJKy04L9xRmgnJUh8oBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:35.074194Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.00153","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a564e9a80f3e2f20fb10e96c01bd80f2c4cda241a023624e0c2bbb6e6b48cb6","sha256:3be28ad7697ae5aa3c5b1418855b41873303d4c76001b90efac6c5083d9b991d"],"state_sha256":"3e694e036bbdda2a48d0171a827edfd3fa8d7b508edf692512b3c2b7d4b7b231"}