{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LRIHQIMLXKW3TJI24VFJNWTNYD","short_pith_number":"pith:LRIHQIML","canonical_record":{"source":{"id":"1606.07760","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-06-24T16:45:08Z","cross_cats_sorted":[],"title_canon_sha256":"30ae4b27794be279d646e9839b50c30e87d4468ae3055c742e060b517e9e252f","abstract_canon_sha256":"bdaed09e21c412c9d21b6edc9bceae5c0ecfabd8cf33f726d41353733b687fad"},"schema_version":"1.0"},"canonical_sha256":"5c5078218bbaadb9a51ae54a96da6dc0ed4193e735019e3d6d2247ab3eb45af3","source":{"kind":"arxiv","id":"1606.07760","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.07760","created_at":"2026-05-18T00:46:22Z"},{"alias_kind":"arxiv_version","alias_value":"1606.07760v2","created_at":"2026-05-18T00:46:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07760","created_at":"2026-05-18T00:46:22Z"},{"alias_kind":"pith_short_12","alias_value":"LRIHQIMLXKW3","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LRIHQIMLXKW3TJI2","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LRIHQIML","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LRIHQIMLXKW3TJI24VFJNWTNYD","target":"record","payload":{"canonical_record":{"source":{"id":"1606.07760","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-06-24T16:45:08Z","cross_cats_sorted":[],"title_canon_sha256":"30ae4b27794be279d646e9839b50c30e87d4468ae3055c742e060b517e9e252f","abstract_canon_sha256":"bdaed09e21c412c9d21b6edc9bceae5c0ecfabd8cf33f726d41353733b687fad"},"schema_version":"1.0"},"canonical_sha256":"5c5078218bbaadb9a51ae54a96da6dc0ed4193e735019e3d6d2247ab3eb45af3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:22.550333Z","signature_b64":"Ug7JCRI+1m9EsCnIRhT0REN7uFnk1o9uMCtJmzN3tr+hCzV7Dfm9dWFZH7f1RHDizYLWvxLDv3Ze3tzFJ4c7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c5078218bbaadb9a51ae54a96da6dc0ed4193e735019e3d6d2247ab3eb45af3","last_reissued_at":"2026-05-18T00:46:22.549918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:22.549918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.07760","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:46:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UXw1qsWDLFFonKHdJ/m/NGJ4NhPhdYTK4dC/QdBdnX86PAx1gnP8wZSEa3eZgmq1UlmhnBSB7YxOJ+44SqmODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T20:10:21.346838Z"},"content_sha256":"d443271f7b997ffc1e194daaee5629b28300d9456305e3442e5141640467b117","schema_version":"1.0","event_id":"sha256:d443271f7b997ffc1e194daaee5629b28300d9456305e3442e5141640467b117"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LRIHQIMLXKW3TJI24VFJNWTNYD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial-Time Key Recovery Attack on the Faure-Loidreau Scheme based on Gabidulin Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Ayoub Otmani, Herv\\'e Tal\\'e Kalachi, Philippe Gaborit","submitted_at":"2016-06-24T16:45:08Z","abstract_excerpt":"Encryption schemes based on the rank metric lead to small public key sizes of order of few thousands bytes which represents a very attractive feature compared to Hamming metric-based encryption schemes where public key sizes are of order of hundreds of thousands bytes even with additional structures like the cyclicity. The main tool for building public key encryption schemes in rank metric is the McEliece encryption setting used with the family of Gabidulin codes. Since the original scheme proposed in 1991 by Gabidulin, Paramonov and Tretjakov, many systems have been proposed based on differen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07760","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:46:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FxQQy4mLc5EaYUd0myLB6fqXEsP4qSFrOZtulWCt4xnIPxKcmVQu/9Orus3Ouje3WI621upvOslUqxWwsi6WDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T20:10:21.347576Z"},"content_sha256":"439cad2f50ac3fc1971ec90933cc7c1294ea01d527bd9d2ca818f1882104472c","schema_version":"1.0","event_id":"sha256:439cad2f50ac3fc1971ec90933cc7c1294ea01d527bd9d2ca818f1882104472c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LRIHQIMLXKW3TJI24VFJNWTNYD/bundle.json","state_url":"https://pith.science/pith/LRIHQIMLXKW3TJI24VFJNWTNYD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LRIHQIMLXKW3TJI24VFJNWTNYD/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-11T20:10:21Z","links":{"resolver":"https://pith.science/pith/LRIHQIMLXKW3TJI24VFJNWTNYD","bundle":"https://pith.science/pith/LRIHQIMLXKW3TJI24VFJNWTNYD/bundle.json","state":"https://pith.science/pith/LRIHQIMLXKW3TJI24VFJNWTNYD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LRIHQIMLXKW3TJI24VFJNWTNYD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LRIHQIMLXKW3TJI24VFJNWTNYD","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":"bdaed09e21c412c9d21b6edc9bceae5c0ecfabd8cf33f726d41353733b687fad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-06-24T16:45:08Z","title_canon_sha256":"30ae4b27794be279d646e9839b50c30e87d4468ae3055c742e060b517e9e252f"},"schema_version":"1.0","source":{"id":"1606.07760","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.07760","created_at":"2026-05-18T00:46:22Z"},{"alias_kind":"arxiv_version","alias_value":"1606.07760v2","created_at":"2026-05-18T00:46:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07760","created_at":"2026-05-18T00:46:22Z"},{"alias_kind":"pith_short_12","alias_value":"LRIHQIMLXKW3","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LRIHQIMLXKW3TJI2","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LRIHQIML","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:439cad2f50ac3fc1971ec90933cc7c1294ea01d527bd9d2ca818f1882104472c","target":"graph","created_at":"2026-05-18T00:46:22Z","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":"Encryption schemes based on the rank metric lead to small public key sizes of order of few thousands bytes which represents a very attractive feature compared to Hamming metric-based encryption schemes where public key sizes are of order of hundreds of thousands bytes even with additional structures like the cyclicity. The main tool for building public key encryption schemes in rank metric is the McEliece encryption setting used with the family of Gabidulin codes. Since the original scheme proposed in 1991 by Gabidulin, Paramonov and Tretjakov, many systems have been proposed based on differen","authors_text":"Ayoub Otmani, Herv\\'e Tal\\'e Kalachi, Philippe Gaborit","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-06-24T16:45:08Z","title":"Polynomial-Time Key Recovery Attack on the Faure-Loidreau Scheme based on Gabidulin Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07760","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:d443271f7b997ffc1e194daaee5629b28300d9456305e3442e5141640467b117","target":"record","created_at":"2026-05-18T00:46:22Z","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":"bdaed09e21c412c9d21b6edc9bceae5c0ecfabd8cf33f726d41353733b687fad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-06-24T16:45:08Z","title_canon_sha256":"30ae4b27794be279d646e9839b50c30e87d4468ae3055c742e060b517e9e252f"},"schema_version":"1.0","source":{"id":"1606.07760","kind":"arxiv","version":2}},"canonical_sha256":"5c5078218bbaadb9a51ae54a96da6dc0ed4193e735019e3d6d2247ab3eb45af3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c5078218bbaadb9a51ae54a96da6dc0ed4193e735019e3d6d2247ab3eb45af3","first_computed_at":"2026-05-18T00:46:22.549918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:22.549918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ug7JCRI+1m9EsCnIRhT0REN7uFnk1o9uMCtJmzN3tr+hCzV7Dfm9dWFZH7f1RHDizYLWvxLDv3Ze3tzFJ4c7Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:22.550333Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.07760","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d443271f7b997ffc1e194daaee5629b28300d9456305e3442e5141640467b117","sha256:439cad2f50ac3fc1971ec90933cc7c1294ea01d527bd9d2ca818f1882104472c"],"state_sha256":"ebcc9c9db2044e5055b0bc8b29d2d89d604b2bf9f4807a3b7440ce5c37ddf1e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"teelJ3QwYTmGAtfPTs70FWKi3r9ZJ7zlbEZRiOJssp15tw81KAnYmalG/c3HL2dYvkVxGMF4LU2geHY3Gs+oAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T20:10:21.351610Z","bundle_sha256":"e1aebd2ad03a64be2cbfc7aae799f1a1323ff48bfc77a7e5ab0adade52bfed10"}}