{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4YAQ4PEYUAELPYU53ENV5EL2R7","short_pith_number":"pith:4YAQ4PEY","canonical_record":{"source":{"id":"1301.1026","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-01-06T16:56:53Z","cross_cats_sorted":[],"title_canon_sha256":"b96c6070a34285ca15da6876a8fdf44f5867a0089d04cac7e49c313a36b5bfd1","abstract_canon_sha256":"c8418a289720bab10d46360bd23459028b061a4dacb3b33e2b45eb974da72488"},"schema_version":"1.0"},"canonical_sha256":"e6010e3c98a008b7e29dd91b5e917a8fd32b447085e3ad5b89a321998bfb2ac5","source":{"kind":"arxiv","id":"1301.1026","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.1026","created_at":"2026-05-18T03:37:06Z"},{"alias_kind":"arxiv_version","alias_value":"1301.1026v1","created_at":"2026-05-18T03:37:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1026","created_at":"2026-05-18T03:37:06Z"},{"alias_kind":"pith_short_12","alias_value":"4YAQ4PEYUAEL","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4YAQ4PEYUAELPYU5","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4YAQ4PEY","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4YAQ4PEYUAELPYU53ENV5EL2R7","target":"record","payload":{"canonical_record":{"source":{"id":"1301.1026","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-01-06T16:56:53Z","cross_cats_sorted":[],"title_canon_sha256":"b96c6070a34285ca15da6876a8fdf44f5867a0089d04cac7e49c313a36b5bfd1","abstract_canon_sha256":"c8418a289720bab10d46360bd23459028b061a4dacb3b33e2b45eb974da72488"},"schema_version":"1.0"},"canonical_sha256":"e6010e3c98a008b7e29dd91b5e917a8fd32b447085e3ad5b89a321998bfb2ac5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:06.963560Z","signature_b64":"/fNPqB0yiwO/yrAupscDEPZv9qBaUwYOXVD1Q+zwN34qk1bUu0fQZ261oguUjEYYzbfD8NLg8nHjyKb4zlWlBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6010e3c98a008b7e29dd91b5e917a8fd32b447085e3ad5b89a321998bfb2ac5","last_reissued_at":"2026-05-18T03:37:06.962809Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:06.962809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.1026","source_version":1,"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-18T03:37:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P0wR0gPXgotEWdNrwq2Kq9E5J5zAVc5OcRkyyUd+12trHokyXEJYpF9xcTsasLE+1ffW5m8Sj2iwJ5jOBbVwDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T09:27:51.621267Z"},"content_sha256":"7198fe7bac493e9da96a4acb2d110dfa4b7051139f1a72f33a073f400280a0db","schema_version":"1.0","event_id":"sha256:7198fe7bac493e9da96a4acb2d110dfa4b7051139f1a72f33a073f400280a0db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4YAQ4PEYUAELPYU53ENV5EL2R7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the complexity of the Rank Syndrome Decoding problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Julien Schrek, Olivier Ruatta, Philippe Gaborit","submitted_at":"2013-01-06T16:56:53Z","abstract_excerpt":"In this paper we propose two new generic attacks on the Rank Syndrome Decoding (RSD) problem\n  Let $C$ be a random $[n,k]$ rank code over $GF(q^m)$ and let $y=x+e$ be a received word such that $x \\in C$ and the $Rank(e)=r$. The first attack is combinatorial and permits to recover an error $e$ of rank weight $r$ in $min(O((n-k)^3m^3q^{r\\lfloor\\frac{km}{n}\\rfloor}, O((n-k)^3m^3q^{(r-1)\\lfloor\\frac{(k+1)m}{n}\\rfloor}))$ operations on $GF(q)$. This attack dramatically improves on previous attack by introducing the length $n$ of the code in the exponent of the complexity, which was not the case in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1026","kind":"arxiv","version":1},"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-18T03:37:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hwNrH29fUXSEKq2Kv2G2lbSAn+9n43M0un/zUkbOWhEhdbcu62ml1yYyJ8Rh+RxXA6OP2vu95tklPdoTIVPMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T09:27:51.621653Z"},"content_sha256":"9a28a84e4d360c9ed599a5f18ed11c2ca6169874634d78fc37ac0458e8f0428e","schema_version":"1.0","event_id":"sha256:9a28a84e4d360c9ed599a5f18ed11c2ca6169874634d78fc37ac0458e8f0428e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4YAQ4PEYUAELPYU53ENV5EL2R7/bundle.json","state_url":"https://pith.science/pith/4YAQ4PEYUAELPYU53ENV5EL2R7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4YAQ4PEYUAELPYU53ENV5EL2R7/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-25T09:27:51Z","links":{"resolver":"https://pith.science/pith/4YAQ4PEYUAELPYU53ENV5EL2R7","bundle":"https://pith.science/pith/4YAQ4PEYUAELPYU53ENV5EL2R7/bundle.json","state":"https://pith.science/pith/4YAQ4PEYUAELPYU53ENV5EL2R7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4YAQ4PEYUAELPYU53ENV5EL2R7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4YAQ4PEYUAELPYU53ENV5EL2R7","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":"c8418a289720bab10d46360bd23459028b061a4dacb3b33e2b45eb974da72488","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-01-06T16:56:53Z","title_canon_sha256":"b96c6070a34285ca15da6876a8fdf44f5867a0089d04cac7e49c313a36b5bfd1"},"schema_version":"1.0","source":{"id":"1301.1026","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.1026","created_at":"2026-05-18T03:37:06Z"},{"alias_kind":"arxiv_version","alias_value":"1301.1026v1","created_at":"2026-05-18T03:37:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1026","created_at":"2026-05-18T03:37:06Z"},{"alias_kind":"pith_short_12","alias_value":"4YAQ4PEYUAEL","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4YAQ4PEYUAELPYU5","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4YAQ4PEY","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:9a28a84e4d360c9ed599a5f18ed11c2ca6169874634d78fc37ac0458e8f0428e","target":"graph","created_at":"2026-05-18T03:37:06Z","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":"In this paper we propose two new generic attacks on the Rank Syndrome Decoding (RSD) problem\n  Let $C$ be a random $[n,k]$ rank code over $GF(q^m)$ and let $y=x+e$ be a received word such that $x \\in C$ and the $Rank(e)=r$. The first attack is combinatorial and permits to recover an error $e$ of rank weight $r$ in $min(O((n-k)^3m^3q^{r\\lfloor\\frac{km}{n}\\rfloor}, O((n-k)^3m^3q^{(r-1)\\lfloor\\frac{(k+1)m}{n}\\rfloor}))$ operations on $GF(q)$. This attack dramatically improves on previous attack by introducing the length $n$ of the code in the exponent of the complexity, which was not the case in ","authors_text":"Julien Schrek, Olivier Ruatta, Philippe Gaborit","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-01-06T16:56:53Z","title":"On the complexity of the Rank Syndrome Decoding problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1026","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:7198fe7bac493e9da96a4acb2d110dfa4b7051139f1a72f33a073f400280a0db","target":"record","created_at":"2026-05-18T03:37:06Z","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":"c8418a289720bab10d46360bd23459028b061a4dacb3b33e2b45eb974da72488","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-01-06T16:56:53Z","title_canon_sha256":"b96c6070a34285ca15da6876a8fdf44f5867a0089d04cac7e49c313a36b5bfd1"},"schema_version":"1.0","source":{"id":"1301.1026","kind":"arxiv","version":1}},"canonical_sha256":"e6010e3c98a008b7e29dd91b5e917a8fd32b447085e3ad5b89a321998bfb2ac5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6010e3c98a008b7e29dd91b5e917a8fd32b447085e3ad5b89a321998bfb2ac5","first_computed_at":"2026-05-18T03:37:06.962809Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:06.962809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/fNPqB0yiwO/yrAupscDEPZv9qBaUwYOXVD1Q+zwN34qk1bUu0fQZ261oguUjEYYzbfD8NLg8nHjyKb4zlWlBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:06.963560Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.1026","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7198fe7bac493e9da96a4acb2d110dfa4b7051139f1a72f33a073f400280a0db","sha256:9a28a84e4d360c9ed599a5f18ed11c2ca6169874634d78fc37ac0458e8f0428e"],"state_sha256":"2cf9d6e4a2c3d318e4af395a6253bdcc15948bceef0e5a335845d5adc1395d51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"avqrfIowo2WHV3odX+d4ysjUL8fTRkibcYgNgmR5N0P7KTnZzsyayVYWWAvZchB26UtPnhxHnapie5dPIac+Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T09:27:51.623635Z","bundle_sha256":"7b84e51b76d84fd28991cf81d1d12d3a9c01e4e5b88c27fb0b22a7dc123359f5"}}