{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5ZHGXHWARD3D726CEYL5R2NEXR","short_pith_number":"pith:5ZHGXHWA","canonical_record":{"source":{"id":"1703.01267","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-03T17:50:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f725b54157a8ab343506180a8b9fb9831035859eb21fa576767831e42887982c","abstract_canon_sha256":"662b3754fbbe3edbe849ebc09af942236c6da21281311511f54d902af4965660"},"schema_version":"1.0"},"canonical_sha256":"ee4e6b9ec088f63febc22617d8e9a4bc738adcbd981de9fc2121b9368aaab721","source":{"kind":"arxiv","id":"1703.01267","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.01267","created_at":"2026-05-18T00:05:56Z"},{"alias_kind":"arxiv_version","alias_value":"1703.01267v3","created_at":"2026-05-18T00:05:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01267","created_at":"2026-05-18T00:05:56Z"},{"alias_kind":"pith_short_12","alias_value":"5ZHGXHWARD3D","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"5ZHGXHWARD3D726C","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"5ZHGXHWA","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5ZHGXHWARD3D726CEYL5R2NEXR","target":"record","payload":{"canonical_record":{"source":{"id":"1703.01267","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-03T17:50:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f725b54157a8ab343506180a8b9fb9831035859eb21fa576767831e42887982c","abstract_canon_sha256":"662b3754fbbe3edbe849ebc09af942236c6da21281311511f54d902af4965660"},"schema_version":"1.0"},"canonical_sha256":"ee4e6b9ec088f63febc22617d8e9a4bc738adcbd981de9fc2121b9368aaab721","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:56.767544Z","signature_b64":"a54mr4f9JBbTN0wmHKz8cn/2vD7MwcwHtj/vjgggvYm5gDxoQvWzAf5MtPOppJ6KzjqA9GX0qD+euY1o0AUVBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee4e6b9ec088f63febc22617d8e9a4bc738adcbd981de9fc2121b9368aaab721","last_reissued_at":"2026-05-18T00:05:56.767008Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:56.767008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.01267","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:05:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"14tm7vbywRTmJqmsMo9CtW6Z6flbM+C75qUnBIcvoEwgMBrlAKPmsf/Br2D9j324KfAo0LnH6s7KLiOdDiejDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:57:30.696602Z"},"content_sha256":"e6482164fb6451ec9d0f71f642afb3fece2173e12c8353bc630792bcef2529b3","schema_version":"1.0","event_id":"sha256:e6482164fb6451ec9d0f71f642afb3fece2173e12c8353bc630792bcef2529b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5ZHGXHWARD3D726CEYL5R2NEXR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On squares of cyclic codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ignacio Cascudo","submitted_at":"2017-03-03T17:50:04Z","abstract_excerpt":"The square $C^{*2}$ of a linear error correcting code $C$ is the linear code spanned by the component-wise products of every pair of (non-necessarily distinct) words in $C$. Squares of codes have gained attention for several applications mainly in the area of cryptography, and typically in those applications one is concerned about some of the parameters (dimension, minimum distance) of both $C^{*2}$ and $C$. In this paper, motivated mostly by the study of this problem in the case of linear codes defined over the binary field, squares of cyclic codes are considered. General results on the minim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01267","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:05:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lItdJgWX16maqe2dhZCSFtm6saXee+MA6xm2UcbVS7oudPEgrwlvsGKfO/CcHUNVo5hAy9/fkZHbB9RZ0cIXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:57:30.697255Z"},"content_sha256":"d3f2201cc5be0d71d8febc8793d613946d95b1e59d8cfb968ccc7037edd458d4","schema_version":"1.0","event_id":"sha256:d3f2201cc5be0d71d8febc8793d613946d95b1e59d8cfb968ccc7037edd458d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ZHGXHWARD3D726CEYL5R2NEXR/bundle.json","state_url":"https://pith.science/pith/5ZHGXHWARD3D726CEYL5R2NEXR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ZHGXHWARD3D726CEYL5R2NEXR/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-04T22:57:30Z","links":{"resolver":"https://pith.science/pith/5ZHGXHWARD3D726CEYL5R2NEXR","bundle":"https://pith.science/pith/5ZHGXHWARD3D726CEYL5R2NEXR/bundle.json","state":"https://pith.science/pith/5ZHGXHWARD3D726CEYL5R2NEXR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ZHGXHWARD3D726CEYL5R2NEXR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5ZHGXHWARD3D726CEYL5R2NEXR","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":"662b3754fbbe3edbe849ebc09af942236c6da21281311511f54d902af4965660","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-03T17:50:04Z","title_canon_sha256":"f725b54157a8ab343506180a8b9fb9831035859eb21fa576767831e42887982c"},"schema_version":"1.0","source":{"id":"1703.01267","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.01267","created_at":"2026-05-18T00:05:56Z"},{"alias_kind":"arxiv_version","alias_value":"1703.01267v3","created_at":"2026-05-18T00:05:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01267","created_at":"2026-05-18T00:05:56Z"},{"alias_kind":"pith_short_12","alias_value":"5ZHGXHWARD3D","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"5ZHGXHWARD3D726C","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"5ZHGXHWA","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:d3f2201cc5be0d71d8febc8793d613946d95b1e59d8cfb968ccc7037edd458d4","target":"graph","created_at":"2026-05-18T00:05:56Z","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":"The square $C^{*2}$ of a linear error correcting code $C$ is the linear code spanned by the component-wise products of every pair of (non-necessarily distinct) words in $C$. Squares of codes have gained attention for several applications mainly in the area of cryptography, and typically in those applications one is concerned about some of the parameters (dimension, minimum distance) of both $C^{*2}$ and $C$. In this paper, motivated mostly by the study of this problem in the case of linear codes defined over the binary field, squares of cyclic codes are considered. General results on the minim","authors_text":"Ignacio Cascudo","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-03T17:50:04Z","title":"On squares of cyclic codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01267","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:e6482164fb6451ec9d0f71f642afb3fece2173e12c8353bc630792bcef2529b3","target":"record","created_at":"2026-05-18T00:05:56Z","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":"662b3754fbbe3edbe849ebc09af942236c6da21281311511f54d902af4965660","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-03T17:50:04Z","title_canon_sha256":"f725b54157a8ab343506180a8b9fb9831035859eb21fa576767831e42887982c"},"schema_version":"1.0","source":{"id":"1703.01267","kind":"arxiv","version":3}},"canonical_sha256":"ee4e6b9ec088f63febc22617d8e9a4bc738adcbd981de9fc2121b9368aaab721","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee4e6b9ec088f63febc22617d8e9a4bc738adcbd981de9fc2121b9368aaab721","first_computed_at":"2026-05-18T00:05:56.767008Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:56.767008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a54mr4f9JBbTN0wmHKz8cn/2vD7MwcwHtj/vjgggvYm5gDxoQvWzAf5MtPOppJ6KzjqA9GX0qD+euY1o0AUVBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:56.767544Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.01267","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6482164fb6451ec9d0f71f642afb3fece2173e12c8353bc630792bcef2529b3","sha256:d3f2201cc5be0d71d8febc8793d613946d95b1e59d8cfb968ccc7037edd458d4"],"state_sha256":"3b25823d92a6467c7d59aebe323a886939fd8391301e443973a535f05d514d47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lV/aWdMGoMC3GZgudFImYCe1OgxjtfOSX+EY0kskg4CUjCzRipXdsOE08RBJ2su5N325L9C8hwtclTSgPGwcCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:57:30.700820Z","bundle_sha256":"5a86e322bf3fc141cdb4e9a3d0f7ee152044c504831b331dff287b0fd623f35c"}}