{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:M7ALDX767P3QZVHSAEIJPKP4IY","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":"525d05e2925024157d8002a78f4fc850e03c86c82ae795e8733caedabbede1d4","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-17T21:53:21Z","title_canon_sha256":"8d750ce19f0e9d510573ceb7e9e24a86e7ccbfef8c4155edb98b27bfee448e81"},"schema_version":"1.0","source":{"id":"1406.4547","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.4547","created_at":"2026-05-18T02:49:31Z"},{"alias_kind":"arxiv_version","alias_value":"1406.4547v1","created_at":"2026-05-18T02:49:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4547","created_at":"2026-05-18T02:49:31Z"},{"alias_kind":"pith_short_12","alias_value":"M7ALDX767P3Q","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"M7ALDX767P3QZVHS","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"M7ALDX76","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:23fc1446c683ec27e17e15eaa058cb63ce9f95d9de4c6585dd2ec215ac414a54","target":"graph","created_at":"2026-05-18T02:49:31Z","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":"We introduce {\\bf complementary information set codes} of higher-order. A binary linear code of length $tk$ and dimension $k$ is called a complementary information set code of order $t$ ($t$-CIS code for short) if it has $t$ pairwise disjoint information sets. The duals of such codes permit to reduce the cost of masking cryptographic algorithms against side-channel attacks. As in the case of codes for error correction, given the length and the dimension of a $t$-CIS code, we look for the highest possible minimum distance. In this paper, this new class of codes is investigated. The existence of","authors_text":"Claude Carlet, Finley Freibert, Jon-Lark Kim, Michael Kiermaier, Patrick Sol\\'e, Sylvain Guilley","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-17T21:53:21Z","title":"Higher-order CIS codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4547","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:7af6293cb390fa1f870135bd464e6307eb5193362c5d982c8c33e460cd2a040a","target":"record","created_at":"2026-05-18T02:49:31Z","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":"525d05e2925024157d8002a78f4fc850e03c86c82ae795e8733caedabbede1d4","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-17T21:53:21Z","title_canon_sha256":"8d750ce19f0e9d510573ceb7e9e24a86e7ccbfef8c4155edb98b27bfee448e81"},"schema_version":"1.0","source":{"id":"1406.4547","kind":"arxiv","version":1}},"canonical_sha256":"67c0b1dffefbf70cd4f2011097a9fc463eba23a86f0643d03eac96515e9f076f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67c0b1dffefbf70cd4f2011097a9fc463eba23a86f0643d03eac96515e9f076f","first_computed_at":"2026-05-18T02:49:31.272072Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:31.272072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z9Fmk4+BySEA/56z8cFuAEow3tUPPF7qCOvAl5JlC3FVsmJgjaEoUCRzL4y+nE5FtQdRNklhR2Oas1/e569sDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:31.272482Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.4547","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7af6293cb390fa1f870135bd464e6307eb5193362c5d982c8c33e460cd2a040a","sha256:23fc1446c683ec27e17e15eaa058cb63ce9f95d9de4c6585dd2ec215ac414a54"],"state_sha256":"a73577a71ceb2d5e4a9e10556a6febf9313e69dd295c727e4a78437e94006df6"}