{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UD4JVA5B7TWCJ6XGVH6JNKHMVX","short_pith_number":"pith:UD4JVA5B","canonical_record":{"source":{"id":"1710.11516","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-31T14:42:39Z","cross_cats_sorted":[],"title_canon_sha256":"ebdb80049debe151a7d21eb0ea0919642e43f2b1a7e83bd32cbcb25499c5533c","abstract_canon_sha256":"cb664993d42898866aa98d4fb27c8c691c1c08326067bd119712f1fc840f12c4"},"schema_version":"1.0"},"canonical_sha256":"a0f89a83a1fcec24fae6a9fc96a8ecadc5be561e9dc3d5c4f8d05ca59ecda6f5","source":{"kind":"arxiv","id":"1710.11516","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.11516","created_at":"2026-05-18T00:31:37Z"},{"alias_kind":"arxiv_version","alias_value":"1710.11516v1","created_at":"2026-05-18T00:31:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11516","created_at":"2026-05-18T00:31:37Z"},{"alias_kind":"pith_short_12","alias_value":"UD4JVA5B7TWC","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UD4JVA5B7TWCJ6XG","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UD4JVA5B","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UD4JVA5B7TWCJ6XGVH6JNKHMVX","target":"record","payload":{"canonical_record":{"source":{"id":"1710.11516","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-31T14:42:39Z","cross_cats_sorted":[],"title_canon_sha256":"ebdb80049debe151a7d21eb0ea0919642e43f2b1a7e83bd32cbcb25499c5533c","abstract_canon_sha256":"cb664993d42898866aa98d4fb27c8c691c1c08326067bd119712f1fc840f12c4"},"schema_version":"1.0"},"canonical_sha256":"a0f89a83a1fcec24fae6a9fc96a8ecadc5be561e9dc3d5c4f8d05ca59ecda6f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:37.088988Z","signature_b64":"LTHuGtChXV2UKH6cUErEQBRgPn8FEdpqOREp5tbmaPLuHc4zsgGBkx9D+2fajlj/wmdKAjLG3vNpIVaEZiV1BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0f89a83a1fcec24fae6a9fc96a8ecadc5be561e9dc3d5c4f8d05ca59ecda6f5","last_reissued_at":"2026-05-18T00:31:37.088379Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:37.088379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.11516","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-18T00:31:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"adCoBjOwcInqBHxAw2RNON0B/iuwu7ZCRjKqqA8qnEOZdNB/0btvXy1NRNAsqWSrxZUaikLAdUNLt6/Hvw7FAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:12:21.564721Z"},"content_sha256":"1db49c2c91657d957bd4d2f73078695d2fce600f1fae2c964bd1a816e9cdf17f","schema_version":"1.0","event_id":"sha256:1db49c2c91657d957bd4d2f73078695d2fce600f1fae2c964bd1a816e9cdf17f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UD4JVA5B7TWCJ6XGVH6JNKHMVX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the List-Decodability of Random Linear Rank-Metric Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Nicolas Resch, Venkatesan Guruswami","submitted_at":"2017-10-31T14:42:39Z","abstract_excerpt":"The list-decodability of random linear rank-metric codes is shown to match that of random rank-metric codes. Specifically, an $\\mathbb{F}_q$-linear rank-metric code over $\\mathbb{F}_q^{m \\times n}$ of rate $R = (1-\\rho)(1-\\frac{n}{m}\\rho)-\\varepsilon$ is shown to be (with high probability) list-decodable up to fractional radius $\\rho \\in (0,1)$ with lists of size at most $\\frac{C_{\\rho,q}}{\\varepsilon}$, where $C_{\\rho,q}$ is a constant depending only on $\\rho$ and $q$. This matches the bound for random rank-metric codes (up to constant factors). The proof adapts the approach of Guruswami, H\\a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11516","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-18T00:31:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b1m6s80cGw99xZap5zoZn29Wds8havjIXQdLmg3UVEcQJGSyPHw6f0SnQvJtybfArdP3g/YCMe9wT+fAw4+KCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:12:21.565402Z"},"content_sha256":"b084c6cc576cf6618231fe102a1191d9a9fb9d64116621e8a29c8b0d415545cf","schema_version":"1.0","event_id":"sha256:b084c6cc576cf6618231fe102a1191d9a9fb9d64116621e8a29c8b0d415545cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UD4JVA5B7TWCJ6XGVH6JNKHMVX/bundle.json","state_url":"https://pith.science/pith/UD4JVA5B7TWCJ6XGVH6JNKHMVX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UD4JVA5B7TWCJ6XGVH6JNKHMVX/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-09T09:12:21Z","links":{"resolver":"https://pith.science/pith/UD4JVA5B7TWCJ6XGVH6JNKHMVX","bundle":"https://pith.science/pith/UD4JVA5B7TWCJ6XGVH6JNKHMVX/bundle.json","state":"https://pith.science/pith/UD4JVA5B7TWCJ6XGVH6JNKHMVX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UD4JVA5B7TWCJ6XGVH6JNKHMVX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UD4JVA5B7TWCJ6XGVH6JNKHMVX","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":"cb664993d42898866aa98d4fb27c8c691c1c08326067bd119712f1fc840f12c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-31T14:42:39Z","title_canon_sha256":"ebdb80049debe151a7d21eb0ea0919642e43f2b1a7e83bd32cbcb25499c5533c"},"schema_version":"1.0","source":{"id":"1710.11516","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.11516","created_at":"2026-05-18T00:31:37Z"},{"alias_kind":"arxiv_version","alias_value":"1710.11516v1","created_at":"2026-05-18T00:31:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11516","created_at":"2026-05-18T00:31:37Z"},{"alias_kind":"pith_short_12","alias_value":"UD4JVA5B7TWC","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UD4JVA5B7TWCJ6XG","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UD4JVA5B","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:b084c6cc576cf6618231fe102a1191d9a9fb9d64116621e8a29c8b0d415545cf","target":"graph","created_at":"2026-05-18T00:31:37Z","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":"The list-decodability of random linear rank-metric codes is shown to match that of random rank-metric codes. Specifically, an $\\mathbb{F}_q$-linear rank-metric code over $\\mathbb{F}_q^{m \\times n}$ of rate $R = (1-\\rho)(1-\\frac{n}{m}\\rho)-\\varepsilon$ is shown to be (with high probability) list-decodable up to fractional radius $\\rho \\in (0,1)$ with lists of size at most $\\frac{C_{\\rho,q}}{\\varepsilon}$, where $C_{\\rho,q}$ is a constant depending only on $\\rho$ and $q$. This matches the bound for random rank-metric codes (up to constant factors). The proof adapts the approach of Guruswami, H\\a","authors_text":"Nicolas Resch, Venkatesan Guruswami","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-31T14:42:39Z","title":"On the List-Decodability of Random Linear Rank-Metric Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11516","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:1db49c2c91657d957bd4d2f73078695d2fce600f1fae2c964bd1a816e9cdf17f","target":"record","created_at":"2026-05-18T00:31:37Z","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":"cb664993d42898866aa98d4fb27c8c691c1c08326067bd119712f1fc840f12c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-31T14:42:39Z","title_canon_sha256":"ebdb80049debe151a7d21eb0ea0919642e43f2b1a7e83bd32cbcb25499c5533c"},"schema_version":"1.0","source":{"id":"1710.11516","kind":"arxiv","version":1}},"canonical_sha256":"a0f89a83a1fcec24fae6a9fc96a8ecadc5be561e9dc3d5c4f8d05ca59ecda6f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0f89a83a1fcec24fae6a9fc96a8ecadc5be561e9dc3d5c4f8d05ca59ecda6f5","first_computed_at":"2026-05-18T00:31:37.088379Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:37.088379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LTHuGtChXV2UKH6cUErEQBRgPn8FEdpqOREp5tbmaPLuHc4zsgGBkx9D+2fajlj/wmdKAjLG3vNpIVaEZiV1BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:37.088988Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.11516","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1db49c2c91657d957bd4d2f73078695d2fce600f1fae2c964bd1a816e9cdf17f","sha256:b084c6cc576cf6618231fe102a1191d9a9fb9d64116621e8a29c8b0d415545cf"],"state_sha256":"15df348ee15c7aee002789a3a8c57deae3496ef54574a550e0ec5d7b1f7b2d3b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y0jJ4I/mc21mEBwGjtdWNqswnLijPk4GSEzpt8zlb1RjKzuSiRVCh2BAM7oEfM5J0unLqkl1sShGta397wy8Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T09:12:21.569271Z","bundle_sha256":"f7d9c97cba3c18c49ea645eabcac792c76669a2a256542e07bb9c559b4419994"}}