{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VN27VGXOWK7NQW4SQ45QWCF5DM","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":"e6a749be003df183596145247e966e9ef286ea4463e4d78c695003053adc375d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-24T12:25:07Z","title_canon_sha256":"cb9a653ebc0a44457b90ec5278933f0d04c197fc20c10c401dfb2bd51954ce23"},"schema_version":"1.0","source":{"id":"1509.07337","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07337","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07337v1","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07337","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"pith_short_12","alias_value":"VN27VGXOWK7N","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VN27VGXOWK7NQW4S","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VN27VGXO","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:e67cc7eeab70e15ae3035c0038594289043e4984376533326214e50ead5f5dee","target":"graph","created_at":"2026-05-18T01:32:09Z","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":"Compared with classical block codes, efficient list decoding of rank-metric codes seems more difficult. Although the list decodability of random rank-metric codes and limits to list decodability have been completely determined, little work on efficient list decoding rank-metric codes has been done. The only known efficient list decoding of rank-metric codes $\\mC$ gives decoding radius up to the Singleton bound $1-R-\\Ge$ with positive rate $R$ when $\\rho(\\mC)$ is extremely small, i.e., $\\Theta(\\Ge^2)$ , where $\\rho(\\mC)$ denotes the ratio of the number of rows over the number of columns of $\\mC","authors_text":"Chaoping Xing, Chen Yuan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-24T12:25:07Z","title":"A new class of rank-metric codes and their list decoding beyond the unique decoding radius"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07337","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:7f821ed125bd0a0d1d1f99454c85cbc7dcdc5afd3c2579004d4fc110bec26f16","target":"record","created_at":"2026-05-18T01:32:09Z","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":"e6a749be003df183596145247e966e9ef286ea4463e4d78c695003053adc375d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-24T12:25:07Z","title_canon_sha256":"cb9a653ebc0a44457b90ec5278933f0d04c197fc20c10c401dfb2bd51954ce23"},"schema_version":"1.0","source":{"id":"1509.07337","kind":"arxiv","version":1}},"canonical_sha256":"ab75fa9aeeb2bed85b92873b0b08bd1b25879b2a337efbe8ea39afd36d205b28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab75fa9aeeb2bed85b92873b0b08bd1b25879b2a337efbe8ea39afd36d205b28","first_computed_at":"2026-05-18T01:32:09.271522Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:09.271522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"okCX7Pq9Z5sDaJvozHPgYmlA4WIkVpsSWytXJu+O1GO+C4Q0DOxL41CFQAvHZ8Kbtbbkk8p/+DZnuOJxMKrwBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:09.272150Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.07337","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f821ed125bd0a0d1d1f99454c85cbc7dcdc5afd3c2579004d4fc110bec26f16","sha256:e67cc7eeab70e15ae3035c0038594289043e4984376533326214e50ead5f5dee"],"state_sha256":"841f4080239e954cb597daff134a0237a15c8358382df6b1c07499a197d9e3a2"}