{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5BKMSU7T5J26TVQAC5CQNAZCEV","short_pith_number":"pith:5BKMSU7T","canonical_record":{"source":{"id":"1401.2693","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-13T01:18:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"766fcb849c6f786c4aec8a5aa81ac410e5d9801873b4a58fbff0f5f3a1f6e018","abstract_canon_sha256":"a91578d43fad3e357f3119c6781aa787e702324b23e96a628ec9fba5108198a0"},"schema_version":"1.0"},"canonical_sha256":"e854c953f3ea75e9d6001745068322254e2cae78f8f1c41378aeb08cc5749f77","source":{"kind":"arxiv","id":"1401.2693","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2693","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2693v2","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2693","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"pith_short_12","alias_value":"5BKMSU7T5J26","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5BKMSU7T5J26TVQA","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5BKMSU7T","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5BKMSU7T5J26TVQAC5CQNAZCEV","target":"record","payload":{"canonical_record":{"source":{"id":"1401.2693","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-13T01:18:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"766fcb849c6f786c4aec8a5aa81ac410e5d9801873b4a58fbff0f5f3a1f6e018","abstract_canon_sha256":"a91578d43fad3e357f3119c6781aa787e702324b23e96a628ec9fba5108198a0"},"schema_version":"1.0"},"canonical_sha256":"e854c953f3ea75e9d6001745068322254e2cae78f8f1c41378aeb08cc5749f77","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:23.869643Z","signature_b64":"KO7jAYjyWK1LAllypqv7zoEkj7qrN+ULNUMCmqgf5qL1cYxJVwbr36mEAIrH4+miPVF35qMaxBB8/T20CbXXAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e854c953f3ea75e9d6001745068322254e2cae78f8f1c41378aeb08cc5749f77","last_reissued_at":"2026-05-18T03:01:23.868991Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:23.868991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.2693","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-18T03:01:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6fXlei3HAh+tPlgkoUmNZlWOGE/IDtOKeiyXUk+eIFg35roBnz266oPUOeE0eH3hlzWI+FuFOHy/hQGEZ8omBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:35:48.446374Z"},"content_sha256":"92c43a72145c37e04a56ad99bff9d34a93dc833e228cfcb291057418ca1af4fa","schema_version":"1.0","event_id":"sha256:92c43a72145c37e04a56ad99bff9d34a93dc833e228cfcb291057418ca1af4fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5BKMSU7T5J26TVQAC5CQNAZCEV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On List-decodability of Random Rank Metric Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Yang Ding","submitted_at":"2014-01-13T01:18:04Z","abstract_excerpt":"In the present paper, we consider list decoding for both random rank metric codes and random linear rank metric codes. Firstly, we show that, for arbitrary $0<R<1$ and $\\epsilon>0$ ($\\epsilon$ and $R$ are independent), if $0<\\frac{n}{m}\\leq \\epsilon$, then with high probability a random rank metric code in $F_{q}^{m\\times n}$ of rate $R$ can be list-decoded up to a fraction $(1-R-\\epsilon)$ of rank errors with constant list size $L$ satisfying $L\\leq O(1/\\epsilon)$. Moreover, if $\\frac{n}{m}\\geq\\Theta_R(\\epsilon)$, any rank metric code in $F_{q}^{m\\times n}$ with rate $R$ and decoding radius $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2693","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-18T03:01:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F9Mfno1agLT0DFDKlL4xbEN4hMbJBtHWNtSFmvJDGzkHyWzbc+Tu6BMNK/P1ocmfvCcYl7CqCEl8ECdsmYNcBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:35:48.447043Z"},"content_sha256":"c46636b4f6edc3a3531599114164242eb98461e09629c25b4eb45cc2a62d934e","schema_version":"1.0","event_id":"sha256:c46636b4f6edc3a3531599114164242eb98461e09629c25b4eb45cc2a62d934e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5BKMSU7T5J26TVQAC5CQNAZCEV/bundle.json","state_url":"https://pith.science/pith/5BKMSU7T5J26TVQAC5CQNAZCEV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5BKMSU7T5J26TVQAC5CQNAZCEV/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-05-27T16:35:48Z","links":{"resolver":"https://pith.science/pith/5BKMSU7T5J26TVQAC5CQNAZCEV","bundle":"https://pith.science/pith/5BKMSU7T5J26TVQAC5CQNAZCEV/bundle.json","state":"https://pith.science/pith/5BKMSU7T5J26TVQAC5CQNAZCEV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5BKMSU7T5J26TVQAC5CQNAZCEV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5BKMSU7T5J26TVQAC5CQNAZCEV","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":"a91578d43fad3e357f3119c6781aa787e702324b23e96a628ec9fba5108198a0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-13T01:18:04Z","title_canon_sha256":"766fcb849c6f786c4aec8a5aa81ac410e5d9801873b4a58fbff0f5f3a1f6e018"},"schema_version":"1.0","source":{"id":"1401.2693","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2693","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2693v2","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2693","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"pith_short_12","alias_value":"5BKMSU7T5J26","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5BKMSU7T5J26TVQA","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5BKMSU7T","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:c46636b4f6edc3a3531599114164242eb98461e09629c25b4eb45cc2a62d934e","target":"graph","created_at":"2026-05-18T03:01:23Z","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 the present paper, we consider list decoding for both random rank metric codes and random linear rank metric codes. Firstly, we show that, for arbitrary $0<R<1$ and $\\epsilon>0$ ($\\epsilon$ and $R$ are independent), if $0<\\frac{n}{m}\\leq \\epsilon$, then with high probability a random rank metric code in $F_{q}^{m\\times n}$ of rate $R$ can be list-decoded up to a fraction $(1-R-\\epsilon)$ of rank errors with constant list size $L$ satisfying $L\\leq O(1/\\epsilon)$. Moreover, if $\\frac{n}{m}\\geq\\Theta_R(\\epsilon)$, any rank metric code in $F_{q}^{m\\times n}$ with rate $R$ and decoding radius $","authors_text":"Yang Ding","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-13T01:18:04Z","title":"On List-decodability of Random Rank Metric Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2693","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:92c43a72145c37e04a56ad99bff9d34a93dc833e228cfcb291057418ca1af4fa","target":"record","created_at":"2026-05-18T03:01:23Z","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":"a91578d43fad3e357f3119c6781aa787e702324b23e96a628ec9fba5108198a0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-13T01:18:04Z","title_canon_sha256":"766fcb849c6f786c4aec8a5aa81ac410e5d9801873b4a58fbff0f5f3a1f6e018"},"schema_version":"1.0","source":{"id":"1401.2693","kind":"arxiv","version":2}},"canonical_sha256":"e854c953f3ea75e9d6001745068322254e2cae78f8f1c41378aeb08cc5749f77","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e854c953f3ea75e9d6001745068322254e2cae78f8f1c41378aeb08cc5749f77","first_computed_at":"2026-05-18T03:01:23.868991Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:23.868991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KO7jAYjyWK1LAllypqv7zoEkj7qrN+ULNUMCmqgf5qL1cYxJVwbr36mEAIrH4+miPVF35qMaxBB8/T20CbXXAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:23.869643Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.2693","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92c43a72145c37e04a56ad99bff9d34a93dc833e228cfcb291057418ca1af4fa","sha256:c46636b4f6edc3a3531599114164242eb98461e09629c25b4eb45cc2a62d934e"],"state_sha256":"0a2f25dcc118e1377583d3384fc9b45e4a9bdd5f9faba446d86c68aaf5b77633"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mshRRQaKK3MjRXJafp29i2MPxaUI1ZgiJfqRo2sOpjv2U6J1I0BFIfv3n9BVJblCps6A3mE1JkricHJQPGZAAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:35:48.450633Z","bundle_sha256":"a471d1bf96677e9db0e49c71398b723b9e9ce0906ba795bd0e5348e1be9126eb"}}