{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QJN7GV7YXYLWMMSLBTSDSVCXZ6","short_pith_number":"pith:QJN7GV7Y","canonical_record":{"source":{"id":"1808.04577","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-14T08:19:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"96685224b3b36044a8904fcf56361e098bc51f8f2f0b9957a94e72da1bd249bb","abstract_canon_sha256":"80b2de9536122b779524f7f70ec66b900f291bdb709c86ae4a06f0047414df5f"},"schema_version":"1.0"},"canonical_sha256":"825bf357f8be1766324b0ce4395457cfad59048b16d14865ebc0ab468dc88516","source":{"kind":"arxiv","id":"1808.04577","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04577","created_at":"2026-05-18T00:04:55Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04577v2","created_at":"2026-05-18T00:04:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04577","created_at":"2026-05-18T00:04:55Z"},{"alias_kind":"pith_short_12","alias_value":"QJN7GV7YXYLW","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QJN7GV7YXYLWMMSL","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QJN7GV7Y","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QJN7GV7YXYLWMMSLBTSDSVCXZ6","target":"record","payload":{"canonical_record":{"source":{"id":"1808.04577","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-14T08:19:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"96685224b3b36044a8904fcf56361e098bc51f8f2f0b9957a94e72da1bd249bb","abstract_canon_sha256":"80b2de9536122b779524f7f70ec66b900f291bdb709c86ae4a06f0047414df5f"},"schema_version":"1.0"},"canonical_sha256":"825bf357f8be1766324b0ce4395457cfad59048b16d14865ebc0ab468dc88516","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:55.080087Z","signature_b64":"myB7mReR6Rihwx6lXM66wcPw15wy9hEEie0AmCBhO2b9oDSoexzf0O740q1WKZM2Y7wEkQsCtLH/UiQTXG4hBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"825bf357f8be1766324b0ce4395457cfad59048b16d14865ebc0ab468dc88516","last_reissued_at":"2026-05-18T00:04:55.079395Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:55.079395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.04577","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-18T00:04:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fYdA1DYxuBUhO5tmlupVEWUQby2ytk0qIGjz9abYfMXuiLBcbCi7yfP0chRJX4/X1gd5+zam+GQxaBGrGB2fBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T09:38:38.543599Z"},"content_sha256":"459386cafcf6a9075e710ad929800410a8cf8c7e7a776df753127a989585c8f8","schema_version":"1.0","event_id":"sha256:459386cafcf6a9075e710ad929800410a8cf8c7e7a776df753127a989585c8f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QJN7GV7YXYLWMMSLBTSDSVCXZ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two constructions of optimal pairs of linear codes for resisting side channel and fault injection attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chengju Li, Claude Carlet, Sihem Mesnager","submitted_at":"2018-08-14T08:19:16Z","abstract_excerpt":"Direct sum masking (DSM) has been proposed as a counter-measure against side-channel attacks (SCA) and fault injection attacks (FIA), which are nowadays important domains of cryptanalysis. DSM needs two linear codes whose sum is direct and equals a whole space $\\Bbb F_q^n$. The minimum distance of the former code and the dual distance of the latter should be as large as possible, given their length and dimensions. But the implementation needs in practice to work with words obtained by appending, to each codeword $y$ of the latter code, the source word from which $y$ is the encoding.\n  Let $\\ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04577","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-18T00:04:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y4/TJY8GuzvuN4rouRtjqxG5CCAQluQF5+PUjmyJ1/8X4/suFqnZER+FjHjJgFUwClR2cBeNuMIiRBnIUr3EAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T09:38:38.543942Z"},"content_sha256":"9e7cd176fb7c09656e54e3ea13417939e8fad183fd8522b70e7d8430f63257ad","schema_version":"1.0","event_id":"sha256:9e7cd176fb7c09656e54e3ea13417939e8fad183fd8522b70e7d8430f63257ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QJN7GV7YXYLWMMSLBTSDSVCXZ6/bundle.json","state_url":"https://pith.science/pith/QJN7GV7YXYLWMMSLBTSDSVCXZ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QJN7GV7YXYLWMMSLBTSDSVCXZ6/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-07-06T09:38:38Z","links":{"resolver":"https://pith.science/pith/QJN7GV7YXYLWMMSLBTSDSVCXZ6","bundle":"https://pith.science/pith/QJN7GV7YXYLWMMSLBTSDSVCXZ6/bundle.json","state":"https://pith.science/pith/QJN7GV7YXYLWMMSLBTSDSVCXZ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QJN7GV7YXYLWMMSLBTSDSVCXZ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QJN7GV7YXYLWMMSLBTSDSVCXZ6","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":"80b2de9536122b779524f7f70ec66b900f291bdb709c86ae4a06f0047414df5f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-14T08:19:16Z","title_canon_sha256":"96685224b3b36044a8904fcf56361e098bc51f8f2f0b9957a94e72da1bd249bb"},"schema_version":"1.0","source":{"id":"1808.04577","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04577","created_at":"2026-05-18T00:04:55Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04577v2","created_at":"2026-05-18T00:04:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04577","created_at":"2026-05-18T00:04:55Z"},{"alias_kind":"pith_short_12","alias_value":"QJN7GV7YXYLW","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QJN7GV7YXYLWMMSL","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QJN7GV7Y","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:9e7cd176fb7c09656e54e3ea13417939e8fad183fd8522b70e7d8430f63257ad","target":"graph","created_at":"2026-05-18T00:04:55Z","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":"Direct sum masking (DSM) has been proposed as a counter-measure against side-channel attacks (SCA) and fault injection attacks (FIA), which are nowadays important domains of cryptanalysis. DSM needs two linear codes whose sum is direct and equals a whole space $\\Bbb F_q^n$. The minimum distance of the former code and the dual distance of the latter should be as large as possible, given their length and dimensions. But the implementation needs in practice to work with words obtained by appending, to each codeword $y$ of the latter code, the source word from which $y$ is the encoding.\n  Let $\\ma","authors_text":"Chengju Li, Claude Carlet, Sihem Mesnager","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-14T08:19:16Z","title":"Two constructions of optimal pairs of linear codes for resisting side channel and fault injection attacks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04577","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:459386cafcf6a9075e710ad929800410a8cf8c7e7a776df753127a989585c8f8","target":"record","created_at":"2026-05-18T00:04:55Z","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":"80b2de9536122b779524f7f70ec66b900f291bdb709c86ae4a06f0047414df5f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-14T08:19:16Z","title_canon_sha256":"96685224b3b36044a8904fcf56361e098bc51f8f2f0b9957a94e72da1bd249bb"},"schema_version":"1.0","source":{"id":"1808.04577","kind":"arxiv","version":2}},"canonical_sha256":"825bf357f8be1766324b0ce4395457cfad59048b16d14865ebc0ab468dc88516","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"825bf357f8be1766324b0ce4395457cfad59048b16d14865ebc0ab468dc88516","first_computed_at":"2026-05-18T00:04:55.079395Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:55.079395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"myB7mReR6Rihwx6lXM66wcPw15wy9hEEie0AmCBhO2b9oDSoexzf0O740q1WKZM2Y7wEkQsCtLH/UiQTXG4hBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:55.080087Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.04577","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:459386cafcf6a9075e710ad929800410a8cf8c7e7a776df753127a989585c8f8","sha256:9e7cd176fb7c09656e54e3ea13417939e8fad183fd8522b70e7d8430f63257ad"],"state_sha256":"bc7b12c0dd5a5805f29c22c2a1b17abfcd4b88afe5ebcec3fedb52d832146597"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T0/X+CEoJS3fK1WtS+1a2XWRV71zbzdNCBxJ7Tw1XkPKZtbnUwXrE+pxEeCGoGB86dyhdhnzvX6YJlAlYBzTDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T09:38:38.546046Z","bundle_sha256":"31b78d26b95fbe73d060fece39abe1eeb67d89d9bd593c67b9ef75ba7607a437"}}