{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CD6RSW4E4BEMRBFH5MZJL4IOOR","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":"d1c0bc6461c689155dc534737a5dd00a7e7764284b1a976f99353b749bed664c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-17T18:09:40Z","title_canon_sha256":"c466c32dcccaec827526bf1408075e699485ef484bbd0386ccf0a7b9a97fec94"},"schema_version":"1.0","source":{"id":"1509.05351","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05351","created_at":"2026-05-18T01:32:44Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05351v1","created_at":"2026-05-18T01:32:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05351","created_at":"2026-05-18T01:32:44Z"},{"alias_kind":"pith_short_12","alias_value":"CD6RSW4E4BEM","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CD6RSW4E4BEMRBFH","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CD6RSW4E","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:6284598349b3e741ddc70e5ca66c409a1700086b692c25f74258b57b88398e86","target":"graph","created_at":"2026-05-18T01:32:44Z","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":"Let $r,s,t$ be three positive integers and $\\mathcal{C}$ be a binary linear code of lenght $r+s+t$. We say that $\\mathcal{C}$ is a triple cyclic code of lenght $(r,s,t)$ over $\\mathbb{Z}_2$ if the set of coordinates can be partitioned into three parts that any cyclic shift of the coordinates of the parts leaves invariant the code. These codes can be considered as $\\mathbb{Z}_2[x]$-submodules of $\\frac{\\mathbb{Z}_2[x]}{\\langle x^r-1\\rangle}\\times\\frac{\\mathbb{Z}_2[x]}{\\langle x^s-1\\rangle}\\times\\frac{\\mathbb{Z}_2[x]}{\\langle x^t-1\\rangle}$. We give the minimal generating sets of this kind of co","authors_text":"Hojjat Mostafanasab","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-17T18:09:40Z","title":"Triple cyclic codes over $\\mathbb{Z}_2$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05351","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:49512545207e746c1b1dbf46e522ea8eeb28a3e37e12bd5808a0f5200dc23336","target":"record","created_at":"2026-05-18T01:32:44Z","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":"d1c0bc6461c689155dc534737a5dd00a7e7764284b1a976f99353b749bed664c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-17T18:09:40Z","title_canon_sha256":"c466c32dcccaec827526bf1408075e699485ef484bbd0386ccf0a7b9a97fec94"},"schema_version":"1.0","source":{"id":"1509.05351","kind":"arxiv","version":1}},"canonical_sha256":"10fd195b84e048c884a7eb3295f10e744beeaffc75e35afbcb9d276e4e1bb580","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10fd195b84e048c884a7eb3295f10e744beeaffc75e35afbcb9d276e4e1bb580","first_computed_at":"2026-05-18T01:32:44.115635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:44.115635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GeNE8APCLKzIrDy4GXXoC2iFsEYQu9eclUXfJ8MTB4SRFmaUrl+YtlpsNidnOnZbuKMh/3v6UP0AFo1eOZLGCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:44.116369Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.05351","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49512545207e746c1b1dbf46e522ea8eeb28a3e37e12bd5808a0f5200dc23336","sha256:6284598349b3e741ddc70e5ca66c409a1700086b692c25f74258b57b88398e86"],"state_sha256":"85ddf09f5381c48d8130a2d152993ad14b5972522c4bf03055be872c1fc900fd"}