{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4AZDJPNW5SR7SFDQBZ343HGWVI","short_pith_number":"pith:4AZDJPNW","canonical_record":{"source":{"id":"1601.08227","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-01-29T19:30:36Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"4fd6c8ba5120946cdc5070c4cd903f748804c146e10a005c7b9a9c845d0dd98e","abstract_canon_sha256":"07c46a9db638522a919f71ffbd9c91ec66b61d24441dbfd284d779931a05672a"},"schema_version":"1.0"},"canonical_sha256":"e03234bdb6eca3f914700e77cd9cd6aa30c941b947352613e7dcf7169cd71855","source":{"kind":"arxiv","id":"1601.08227","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.08227","created_at":"2026-05-18T01:21:40Z"},{"alias_kind":"arxiv_version","alias_value":"1601.08227v1","created_at":"2026-05-18T01:21:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.08227","created_at":"2026-05-18T01:21:40Z"},{"alias_kind":"pith_short_12","alias_value":"4AZDJPNW5SR7","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4AZDJPNW5SR7SFDQ","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4AZDJPNW","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4AZDJPNW5SR7SFDQBZ343HGWVI","target":"record","payload":{"canonical_record":{"source":{"id":"1601.08227","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-01-29T19:30:36Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"4fd6c8ba5120946cdc5070c4cd903f748804c146e10a005c7b9a9c845d0dd98e","abstract_canon_sha256":"07c46a9db638522a919f71ffbd9c91ec66b61d24441dbfd284d779931a05672a"},"schema_version":"1.0"},"canonical_sha256":"e03234bdb6eca3f914700e77cd9cd6aa30c941b947352613e7dcf7169cd71855","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:40.046073Z","signature_b64":"kChd5t5nYUWmfeUCW/E1vU3nXMa0i7Q9mMGoSF5FxTRvb1kOi28sMoRpKNqYSI0dPbDkSluic7zfLiEssv+sAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e03234bdb6eca3f914700e77cd9cd6aa30c941b947352613e7dcf7169cd71855","last_reissued_at":"2026-05-18T01:21:40.045556Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:40.045556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.08227","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-18T01:21:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dNsZVjkl/TQuYhz7SJvRiFGbcAFGXVVXap9Bv9c5gf6ua7F4C5fMWeF9ctCSYEm0FfL6cReT/iGfsNdgj5X7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:54:55.031923Z"},"content_sha256":"8b097db6bad302c66084c4eeb50e105b1220da980c56b776e25a7725e018c9ad","schema_version":"1.0","event_id":"sha256:8b097db6bad302c66084c4eeb50e105b1220da980c56b776e25a7725e018c9ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4AZDJPNW5SR7SFDQBZ343HGWVI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using Reed-Solomon codes in the $\\left( U\\mid U+V\\right)$ construction and an application to cryptography","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Irene M\\'arquez-Corbella, Jean-Pierre Tillich","submitted_at":"2016-01-29T19:30:36Z","abstract_excerpt":"In this paper we present a modification of Reed-Solomon codes that beats the Guruwami-Sudan $1-\\sqrt{R}$ decoding radius of Reed-Solomon codes at low rates $R$. The idea is to choose Reed-Solomon codes $U$ and $V$ with appropriate rates in a $\\left( U\\mid U+V\\right)$ construction and to decode them with the Koetter-Vardy soft information decoder. We suggest to use a slightly more general version of these codes (but which has the same decoding performances as the $\\left( U\\mid U+V\\right)$-construction) for code-based cryptography, namely to build a McEliece scheme. The point is here that these "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.08227","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-18T01:21:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lHNb9ulQIPmr0YODtubPWATCJORCXqs6aYiQAZL6DZqTkIb2T5jljgHhXqtmpxJF44Rom8u8N7nQtS1DESDiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:54:55.032618Z"},"content_sha256":"7a907adb6df1f24c0a9f47373beb8559d03f4e5eb0697393198f094c17764e6a","schema_version":"1.0","event_id":"sha256:7a907adb6df1f24c0a9f47373beb8559d03f4e5eb0697393198f094c17764e6a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4AZDJPNW5SR7SFDQBZ343HGWVI/bundle.json","state_url":"https://pith.science/pith/4AZDJPNW5SR7SFDQBZ343HGWVI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4AZDJPNW5SR7SFDQBZ343HGWVI/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-07T07:54:55Z","links":{"resolver":"https://pith.science/pith/4AZDJPNW5SR7SFDQBZ343HGWVI","bundle":"https://pith.science/pith/4AZDJPNW5SR7SFDQBZ343HGWVI/bundle.json","state":"https://pith.science/pith/4AZDJPNW5SR7SFDQBZ343HGWVI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4AZDJPNW5SR7SFDQBZ343HGWVI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4AZDJPNW5SR7SFDQBZ343HGWVI","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":"07c46a9db638522a919f71ffbd9c91ec66b61d24441dbfd284d779931a05672a","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-01-29T19:30:36Z","title_canon_sha256":"4fd6c8ba5120946cdc5070c4cd903f748804c146e10a005c7b9a9c845d0dd98e"},"schema_version":"1.0","source":{"id":"1601.08227","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.08227","created_at":"2026-05-18T01:21:40Z"},{"alias_kind":"arxiv_version","alias_value":"1601.08227v1","created_at":"2026-05-18T01:21:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.08227","created_at":"2026-05-18T01:21:40Z"},{"alias_kind":"pith_short_12","alias_value":"4AZDJPNW5SR7","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4AZDJPNW5SR7SFDQ","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4AZDJPNW","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:7a907adb6df1f24c0a9f47373beb8559d03f4e5eb0697393198f094c17764e6a","target":"graph","created_at":"2026-05-18T01:21:40Z","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 present a modification of Reed-Solomon codes that beats the Guruwami-Sudan $1-\\sqrt{R}$ decoding radius of Reed-Solomon codes at low rates $R$. The idea is to choose Reed-Solomon codes $U$ and $V$ with appropriate rates in a $\\left( U\\mid U+V\\right)$ construction and to decode them with the Koetter-Vardy soft information decoder. We suggest to use a slightly more general version of these codes (but which has the same decoding performances as the $\\left( U\\mid U+V\\right)$-construction) for code-based cryptography, namely to build a McEliece scheme. The point is here that these ","authors_text":"Irene M\\'arquez-Corbella, Jean-Pierre Tillich","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-01-29T19:30:36Z","title":"Using Reed-Solomon codes in the $\\left( U\\mid U+V\\right)$ construction and an application to cryptography"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.08227","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:8b097db6bad302c66084c4eeb50e105b1220da980c56b776e25a7725e018c9ad","target":"record","created_at":"2026-05-18T01:21:40Z","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":"07c46a9db638522a919f71ffbd9c91ec66b61d24441dbfd284d779931a05672a","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-01-29T19:30:36Z","title_canon_sha256":"4fd6c8ba5120946cdc5070c4cd903f748804c146e10a005c7b9a9c845d0dd98e"},"schema_version":"1.0","source":{"id":"1601.08227","kind":"arxiv","version":1}},"canonical_sha256":"e03234bdb6eca3f914700e77cd9cd6aa30c941b947352613e7dcf7169cd71855","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e03234bdb6eca3f914700e77cd9cd6aa30c941b947352613e7dcf7169cd71855","first_computed_at":"2026-05-18T01:21:40.045556Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:40.045556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kChd5t5nYUWmfeUCW/E1vU3nXMa0i7Q9mMGoSF5FxTRvb1kOi28sMoRpKNqYSI0dPbDkSluic7zfLiEssv+sAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:40.046073Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.08227","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b097db6bad302c66084c4eeb50e105b1220da980c56b776e25a7725e018c9ad","sha256:7a907adb6df1f24c0a9f47373beb8559d03f4e5eb0697393198f094c17764e6a"],"state_sha256":"5ea9f9ee8adb566f8241b03fbb36f29c567ac7cdc76f7e0938c6d81336448a3a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HGVrDbXZgP6kwkfNO3uPaHaKrRZT1Mwaof5FyTjuRMLtvgUgHKiuVa2BnBAdwXChh/QivbZHzVVqp7BbJCNDAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T07:54:55.036221Z","bundle_sha256":"dcfe7a8c9b969942b6354a01546a675c277a146ba2c422f284236197cf664554"}}