{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7DKOTVX67J7ARGIORQGGEU7UXU","short_pith_number":"pith:7DKOTVX6","canonical_record":{"source":{"id":"1702.07737","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-24T19:21:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b59983511404e56543f36ecc4f5439909dfab31308ba60db4eff4845e5048ea6","abstract_canon_sha256":"8b1e15e1d3cecb5574aad0cdd74763c1b02caa6593a01a94ecae6b0322b4fbef"},"schema_version":"1.0"},"canonical_sha256":"f8d4e9d6fefa7e08990e8c0c6253f4bd0b41fbf7faae151f56543eb852e2e416","source":{"kind":"arxiv","id":"1702.07737","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07737","created_at":"2026-05-18T00:39:12Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07737v2","created_at":"2026-05-18T00:39:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07737","created_at":"2026-05-18T00:39:12Z"},{"alias_kind":"pith_short_12","alias_value":"7DKOTVX67J7A","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"7DKOTVX67J7ARGIO","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"7DKOTVX6","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7DKOTVX67J7ARGIORQGGEU7UXU","target":"record","payload":{"canonical_record":{"source":{"id":"1702.07737","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-24T19:21:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b59983511404e56543f36ecc4f5439909dfab31308ba60db4eff4845e5048ea6","abstract_canon_sha256":"8b1e15e1d3cecb5574aad0cdd74763c1b02caa6593a01a94ecae6b0322b4fbef"},"schema_version":"1.0"},"canonical_sha256":"f8d4e9d6fefa7e08990e8c0c6253f4bd0b41fbf7faae151f56543eb852e2e416","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:12.658334Z","signature_b64":"OD2tYtrCS2ArZtWDT6xkPZciNmg+/BMTUcEnET36fJe3qq64ucC6VVZYcKg897PVNmKmpttJ3FMHPS6MMXSMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8d4e9d6fefa7e08990e8c0c6253f4bd0b41fbf7faae151f56543eb852e2e416","last_reissued_at":"2026-05-18T00:39:12.657808Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:12.657808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.07737","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:39:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZEARpD5KBx9mJUEq46CPdi04lyzAyX0+y7Q6pge9FsmmNME6ylCvisLHMSmQikwac58sLY5bopka6Qmj0b7xDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:08:50.643939Z"},"content_sha256":"e1459d7d30e4fde3eb8ed4ab12a972b1a4949a6fc3e17da2b740ad3e137ba6d5","schema_version":"1.0","event_id":"sha256:e1459d7d30e4fde3eb8ed4ab12a972b1a4949a6fc3e17da2b740ad3e137ba6d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7DKOTVX67J7ARGIORQGGEU7UXU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decoding Generalized Reed-Solomon Codes and Its Application to RLCE Encryption Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Yongge Wang","submitted_at":"2017-02-24T19:21:20Z","abstract_excerpt":"This paper compares the efficiency of various algorithms for implementing quantum resistant public key encryption scheme RLCE on 64-bit CPUs. By optimizing various algorithms for polynomial and matrix operations over finite fields, we obtained several interesting (or even surprising) results. For example, it is well known (e.g., Moenck 1976 \\cite{moenck1976practical}) that Karatsuba's algorithm outperforms classical polynomial multiplication algorithm from the degree 15 and above (practically, Karatsuba's algorithm only outperforms classical polynomial multiplication algorithm from the degree "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07737","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:39:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6XPV49D4+DWGMI3S6VVj8J1NJx49OZTW4s6a1a/OwmkrnDRqyPp3WgyT9zH8lTrw77eJsah0m0u8gA56Wk8jDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:08:50.644658Z"},"content_sha256":"37addde77e727fad8149a8a4c9c8683acd875f49971a7d476910dd3e8f5d3195","schema_version":"1.0","event_id":"sha256:37addde77e727fad8149a8a4c9c8683acd875f49971a7d476910dd3e8f5d3195"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7DKOTVX67J7ARGIORQGGEU7UXU/bundle.json","state_url":"https://pith.science/pith/7DKOTVX67J7ARGIORQGGEU7UXU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7DKOTVX67J7ARGIORQGGEU7UXU/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-08T03:08:50Z","links":{"resolver":"https://pith.science/pith/7DKOTVX67J7ARGIORQGGEU7UXU","bundle":"https://pith.science/pith/7DKOTVX67J7ARGIORQGGEU7UXU/bundle.json","state":"https://pith.science/pith/7DKOTVX67J7ARGIORQGGEU7UXU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7DKOTVX67J7ARGIORQGGEU7UXU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7DKOTVX67J7ARGIORQGGEU7UXU","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":"8b1e15e1d3cecb5574aad0cdd74763c1b02caa6593a01a94ecae6b0322b4fbef","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-24T19:21:20Z","title_canon_sha256":"b59983511404e56543f36ecc4f5439909dfab31308ba60db4eff4845e5048ea6"},"schema_version":"1.0","source":{"id":"1702.07737","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07737","created_at":"2026-05-18T00:39:12Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07737v2","created_at":"2026-05-18T00:39:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07737","created_at":"2026-05-18T00:39:12Z"},{"alias_kind":"pith_short_12","alias_value":"7DKOTVX67J7A","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"7DKOTVX67J7ARGIO","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"7DKOTVX6","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:37addde77e727fad8149a8a4c9c8683acd875f49971a7d476910dd3e8f5d3195","target":"graph","created_at":"2026-05-18T00:39:12Z","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":"This paper compares the efficiency of various algorithms for implementing quantum resistant public key encryption scheme RLCE on 64-bit CPUs. By optimizing various algorithms for polynomial and matrix operations over finite fields, we obtained several interesting (or even surprising) results. For example, it is well known (e.g., Moenck 1976 \\cite{moenck1976practical}) that Karatsuba's algorithm outperforms classical polynomial multiplication algorithm from the degree 15 and above (practically, Karatsuba's algorithm only outperforms classical polynomial multiplication algorithm from the degree ","authors_text":"Yongge Wang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-24T19:21:20Z","title":"Decoding Generalized Reed-Solomon Codes and Its Application to RLCE Encryption Schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07737","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:e1459d7d30e4fde3eb8ed4ab12a972b1a4949a6fc3e17da2b740ad3e137ba6d5","target":"record","created_at":"2026-05-18T00:39:12Z","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":"8b1e15e1d3cecb5574aad0cdd74763c1b02caa6593a01a94ecae6b0322b4fbef","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-24T19:21:20Z","title_canon_sha256":"b59983511404e56543f36ecc4f5439909dfab31308ba60db4eff4845e5048ea6"},"schema_version":"1.0","source":{"id":"1702.07737","kind":"arxiv","version":2}},"canonical_sha256":"f8d4e9d6fefa7e08990e8c0c6253f4bd0b41fbf7faae151f56543eb852e2e416","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8d4e9d6fefa7e08990e8c0c6253f4bd0b41fbf7faae151f56543eb852e2e416","first_computed_at":"2026-05-18T00:39:12.657808Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:12.657808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OD2tYtrCS2ArZtWDT6xkPZciNmg+/BMTUcEnET36fJe3qq64ucC6VVZYcKg897PVNmKmpttJ3FMHPS6MMXSMDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:12.658334Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.07737","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1459d7d30e4fde3eb8ed4ab12a972b1a4949a6fc3e17da2b740ad3e137ba6d5","sha256:37addde77e727fad8149a8a4c9c8683acd875f49971a7d476910dd3e8f5d3195"],"state_sha256":"e8efbf61119e1d25c4441f7d3772b17e4eb53f6c7465869d250782872cc68343"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q7Rt7z7udzCp/pgp9XZcw4N4gcCXfWqfL4zKSqls1Rgn5ngHkrxOpcxjbpm1Y5DoFE4/x20zbv+bEQ5QnM0/DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T03:08:50.648425Z","bundle_sha256":"3301d7a4f5a8a38ff8fe71f355d93bdfc17b088f5806f11c5aa6aa0a8c0fd154"}}