{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:LQARDP5VNNNSP6R7KUVGDQUS6J","short_pith_number":"pith:LQARDP5V","canonical_record":{"source":{"id":"1108.3754","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-18T14:02:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8aa6ed0c7de0af1943bf38ff58c78bf6688ebbc6b82adb52c1a9623a85a2e02c","abstract_canon_sha256":"337912aa408d48ea33b59d8ecc41d47672bec2102d104bfff09b48fa1021bb01"},"schema_version":"1.0"},"canonical_sha256":"5c0111bfb56b5b27fa3f552a61c292f267aff71487c782749b1b27d03819cae3","source":{"kind":"arxiv","id":"1108.3754","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.3754","created_at":"2026-05-18T03:54:47Z"},{"alias_kind":"arxiv_version","alias_value":"1108.3754v2","created_at":"2026-05-18T03:54:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3754","created_at":"2026-05-18T03:54:47Z"},{"alias_kind":"pith_short_12","alias_value":"LQARDP5VNNNS","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LQARDP5VNNNSP6R7","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LQARDP5V","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:LQARDP5VNNNSP6R7KUVGDQUS6J","target":"record","payload":{"canonical_record":{"source":{"id":"1108.3754","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-18T14:02:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8aa6ed0c7de0af1943bf38ff58c78bf6688ebbc6b82adb52c1a9623a85a2e02c","abstract_canon_sha256":"337912aa408d48ea33b59d8ecc41d47672bec2102d104bfff09b48fa1021bb01"},"schema_version":"1.0"},"canonical_sha256":"5c0111bfb56b5b27fa3f552a61c292f267aff71487c782749b1b27d03819cae3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:47.906498Z","signature_b64":"vvLumMoz5X65zNjMILY5y5lvz10+mZ/KX4LFNte2aII/cfWPqsCp/Vov402SJCgLdu5QeEPj0P4Hn3xyH2HEBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c0111bfb56b5b27fa3f552a61c292f267aff71487c782749b1b27d03819cae3","last_reissued_at":"2026-05-18T03:54:47.905658Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:47.905658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.3754","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-18T03:54:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J3FT5N9I4VO8f3hgcus1MSCF77VGLXAW1C2fmu+1rxjsqicsmkCFSUX6Uyhg7Z8wDnIdrTLJKSjH3IqWb+r1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:52:03.520462Z"},"content_sha256":"5ea4b44c7f60460c81bdf2032722874a3d1d18d8d29b6e18984624e781f81dff","schema_version":"1.0","event_id":"sha256:5ea4b44c7f60460c81bdf2032722874a3d1d18d8d29b6e18984624e781f81dff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:LQARDP5VNNNSP6R7KUVGDQUS6J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Quasi-Cyclic Codes as a Generalization of Cyclic Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christophe Chabot (LJK), Guillaume Quintin (INRIA Saclay - Ile de France, LIX), Morgan Barbier (INRIA Saclay - Ile de France","submitted_at":"2011-08-18T14:02:57Z","abstract_excerpt":"In this article we see quasi-cyclic codes as block cyclic codes. We generalize some properties of cyclic codes to quasi-cyclic ones such as generator polynomials and ideals. Indeed we show a one-to-one correspondence between l-quasi-cyclic codes of length m and ideals of M_l(Fq)[X]/(X^m-1). This permits to construct new classes of codes, namely quasi-BCH and quasi-evaluation codes. We study the parameters of such codes and propose a decoding algorithm up to half the designed minimum distance. We even found one new quasi-cyclic code with better parameters than known [189, 11, 125]_F4 and 48 der"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3754","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-18T03:54:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jrKzuV4qzzdCQoQxKyqNcZjdWy+KOxIolH3X0PEDQl9i7sU7p7l90yuYPHwqwZPXiGu2LVWJIB4H55r43zGHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:52:03.520813Z"},"content_sha256":"6f62853f35e9fe6920211c56fb66eda189405e896d58666bd7ce4d3c5d7a22a7","schema_version":"1.0","event_id":"sha256:6f62853f35e9fe6920211c56fb66eda189405e896d58666bd7ce4d3c5d7a22a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LQARDP5VNNNSP6R7KUVGDQUS6J/bundle.json","state_url":"https://pith.science/pith/LQARDP5VNNNSP6R7KUVGDQUS6J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LQARDP5VNNNSP6R7KUVGDQUS6J/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-03T05:52:03Z","links":{"resolver":"https://pith.science/pith/LQARDP5VNNNSP6R7KUVGDQUS6J","bundle":"https://pith.science/pith/LQARDP5VNNNSP6R7KUVGDQUS6J/bundle.json","state":"https://pith.science/pith/LQARDP5VNNNSP6R7KUVGDQUS6J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LQARDP5VNNNSP6R7KUVGDQUS6J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:LQARDP5VNNNSP6R7KUVGDQUS6J","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":"337912aa408d48ea33b59d8ecc41d47672bec2102d104bfff09b48fa1021bb01","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-18T14:02:57Z","title_canon_sha256":"8aa6ed0c7de0af1943bf38ff58c78bf6688ebbc6b82adb52c1a9623a85a2e02c"},"schema_version":"1.0","source":{"id":"1108.3754","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.3754","created_at":"2026-05-18T03:54:47Z"},{"alias_kind":"arxiv_version","alias_value":"1108.3754v2","created_at":"2026-05-18T03:54:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3754","created_at":"2026-05-18T03:54:47Z"},{"alias_kind":"pith_short_12","alias_value":"LQARDP5VNNNS","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LQARDP5VNNNSP6R7","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LQARDP5V","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:6f62853f35e9fe6920211c56fb66eda189405e896d58666bd7ce4d3c5d7a22a7","target":"graph","created_at":"2026-05-18T03:54:47Z","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":"In this article we see quasi-cyclic codes as block cyclic codes. We generalize some properties of cyclic codes to quasi-cyclic ones such as generator polynomials and ideals. Indeed we show a one-to-one correspondence between l-quasi-cyclic codes of length m and ideals of M_l(Fq)[X]/(X^m-1). This permits to construct new classes of codes, namely quasi-BCH and quasi-evaluation codes. We study the parameters of such codes and propose a decoding algorithm up to half the designed minimum distance. We even found one new quasi-cyclic code with better parameters than known [189, 11, 125]_F4 and 48 der","authors_text":"Christophe Chabot (LJK), Guillaume Quintin (INRIA Saclay - Ile de France, LIX), Morgan Barbier (INRIA Saclay - Ile de France","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-18T14:02:57Z","title":"On Quasi-Cyclic Codes as a Generalization of Cyclic Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3754","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:5ea4b44c7f60460c81bdf2032722874a3d1d18d8d29b6e18984624e781f81dff","target":"record","created_at":"2026-05-18T03:54:47Z","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":"337912aa408d48ea33b59d8ecc41d47672bec2102d104bfff09b48fa1021bb01","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-18T14:02:57Z","title_canon_sha256":"8aa6ed0c7de0af1943bf38ff58c78bf6688ebbc6b82adb52c1a9623a85a2e02c"},"schema_version":"1.0","source":{"id":"1108.3754","kind":"arxiv","version":2}},"canonical_sha256":"5c0111bfb56b5b27fa3f552a61c292f267aff71487c782749b1b27d03819cae3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c0111bfb56b5b27fa3f552a61c292f267aff71487c782749b1b27d03819cae3","first_computed_at":"2026-05-18T03:54:47.905658Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:47.905658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vvLumMoz5X65zNjMILY5y5lvz10+mZ/KX4LFNte2aII/cfWPqsCp/Vov402SJCgLdu5QeEPj0P4Hn3xyH2HEBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:47.906498Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.3754","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ea4b44c7f60460c81bdf2032722874a3d1d18d8d29b6e18984624e781f81dff","sha256:6f62853f35e9fe6920211c56fb66eda189405e896d58666bd7ce4d3c5d7a22a7"],"state_sha256":"11f180030070264c40bbe1af92135ab7e0edf9d792aeebf47943e6a8cd78e040"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rMRdKwTuRqb719roFKtxcX0NDU5bYNVuJN/3b7hkGwAs7GAuyU25s3R62IX+e0XPm3L1QWyIZY/EA28vplNhCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:52:03.522978Z","bundle_sha256":"5323b5590fcb6f602e05c087bcbdd903cf5c8e1947065969a2121065283f2533"}}