{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SMO4DT2STJJMANVLQNTN2N6DAF","short_pith_number":"pith:SMO4DT2S","canonical_record":{"source":{"id":"1801.07033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-22T10:41:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dcf53c7c4899f4b529e23053c759a064a7034cac78ba31aff0c668c253367dc5","abstract_canon_sha256":"2acaf62296f0b8ede476df6a9e197caf0a0a7d924529cdc914539c597fa38fe2"},"schema_version":"1.0"},"canonical_sha256":"931dc1cf529a52c036ab8366dd37c30159cfa6f89308a0720e0299b53d0010da","source":{"kind":"arxiv","id":"1801.07033","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07033","created_at":"2026-05-18T00:25:22Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07033v1","created_at":"2026-05-18T00:25:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07033","created_at":"2026-05-18T00:25:22Z"},{"alias_kind":"pith_short_12","alias_value":"SMO4DT2STJJM","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SMO4DT2STJJMANVL","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SMO4DT2S","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SMO4DT2STJJMANVLQNTN2N6DAF","target":"record","payload":{"canonical_record":{"source":{"id":"1801.07033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-22T10:41:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dcf53c7c4899f4b529e23053c759a064a7034cac78ba31aff0c668c253367dc5","abstract_canon_sha256":"2acaf62296f0b8ede476df6a9e197caf0a0a7d924529cdc914539c597fa38fe2"},"schema_version":"1.0"},"canonical_sha256":"931dc1cf529a52c036ab8366dd37c30159cfa6f89308a0720e0299b53d0010da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:22.431462Z","signature_b64":"LrIIbvgpsULnyEIsLEtD8MTLThJd2Piaznbm9yYctXAEl7ngfHPWP4wnNoRetQNBhDrfOrOISsbSZKgqoChUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"931dc1cf529a52c036ab8366dd37c30159cfa6f89308a0720e0299b53d0010da","last_reissued_at":"2026-05-18T00:25:22.430921Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:22.430921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.07033","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:25:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UFVNFRcsg0Hp94Vrk3gST2vaiEhR2Gnb3jb52UZHBJDgEtw6DPOjmXcXdza8+HF9HB6UwfkLk9P69yVmR8nPAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:00:54.042746Z"},"content_sha256":"e9244e4eab9904a6034c2953f2be775f6c4c11e80ab6ef15844d1baa1037b270","schema_version":"1.0","event_id":"sha256:e9244e4eab9904a6034c2953f2be775f6c4c11e80ab6ef15844d1baa1037b270"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SMO4DT2STJJMANVLQNTN2N6DAF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the List Decodability of Self-orthogonal Rank Metric Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Shu Liu","submitted_at":"2018-01-22T10:41:16Z","abstract_excerpt":"V. Guruswami and N. Resch prove that the list decodability of $\\mathbb{F}_q$-linear rank metric codes is as good as that of random rank metric codes in~\\cite{venkat2017}. Due to the potential applications of self-orthogonal rank metric codes, we focus on list decoding of them. In this paper, we prove that with high probability, an $\\F_q$-linear self-orthogonal rank metric code over $\\mathbb{F}_q^{n\\times m}$ of rate $R=(1-\\tau)(1-\\frac{n}{m}\\tau)-\\epsilon$ is shown to be list decodable up to fractional radius $\\tau\\in(0,1)$ and small $\\epsilon\\in(0,1)$ with list size depending on $\\tau$ and $q"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07033","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:25:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SBWPylrFt5wti2+tXeBlyA1k/0aRyaM4soBv14Js3ZUM4AganRJOL9J+HPuF1DwBzuc/xbIAS9/P1Qy6u0XHBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:00:54.043420Z"},"content_sha256":"0c19a67249f3d0ea17a4fe7380e5dffaa80289bc8ee684c8604166edb5a8ecc4","schema_version":"1.0","event_id":"sha256:0c19a67249f3d0ea17a4fe7380e5dffaa80289bc8ee684c8604166edb5a8ecc4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SMO4DT2STJJMANVLQNTN2N6DAF/bundle.json","state_url":"https://pith.science/pith/SMO4DT2STJJMANVLQNTN2N6DAF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SMO4DT2STJJMANVLQNTN2N6DAF/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-26T10:00:54Z","links":{"resolver":"https://pith.science/pith/SMO4DT2STJJMANVLQNTN2N6DAF","bundle":"https://pith.science/pith/SMO4DT2STJJMANVLQNTN2N6DAF/bundle.json","state":"https://pith.science/pith/SMO4DT2STJJMANVLQNTN2N6DAF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SMO4DT2STJJMANVLQNTN2N6DAF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SMO4DT2STJJMANVLQNTN2N6DAF","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":"2acaf62296f0b8ede476df6a9e197caf0a0a7d924529cdc914539c597fa38fe2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-22T10:41:16Z","title_canon_sha256":"dcf53c7c4899f4b529e23053c759a064a7034cac78ba31aff0c668c253367dc5"},"schema_version":"1.0","source":{"id":"1801.07033","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07033","created_at":"2026-05-18T00:25:22Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07033v1","created_at":"2026-05-18T00:25:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07033","created_at":"2026-05-18T00:25:22Z"},{"alias_kind":"pith_short_12","alias_value":"SMO4DT2STJJM","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SMO4DT2STJJMANVL","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SMO4DT2S","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:0c19a67249f3d0ea17a4fe7380e5dffaa80289bc8ee684c8604166edb5a8ecc4","target":"graph","created_at":"2026-05-18T00:25:22Z","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":"V. Guruswami and N. Resch prove that the list decodability of $\\mathbb{F}_q$-linear rank metric codes is as good as that of random rank metric codes in~\\cite{venkat2017}. Due to the potential applications of self-orthogonal rank metric codes, we focus on list decoding of them. In this paper, we prove that with high probability, an $\\F_q$-linear self-orthogonal rank metric code over $\\mathbb{F}_q^{n\\times m}$ of rate $R=(1-\\tau)(1-\\frac{n}{m}\\tau)-\\epsilon$ is shown to be list decodable up to fractional radius $\\tau\\in(0,1)$ and small $\\epsilon\\in(0,1)$ with list size depending on $\\tau$ and $q","authors_text":"Shu Liu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-22T10:41:16Z","title":"On the List Decodability of Self-orthogonal Rank Metric Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07033","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:e9244e4eab9904a6034c2953f2be775f6c4c11e80ab6ef15844d1baa1037b270","target":"record","created_at":"2026-05-18T00:25:22Z","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":"2acaf62296f0b8ede476df6a9e197caf0a0a7d924529cdc914539c597fa38fe2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-22T10:41:16Z","title_canon_sha256":"dcf53c7c4899f4b529e23053c759a064a7034cac78ba31aff0c668c253367dc5"},"schema_version":"1.0","source":{"id":"1801.07033","kind":"arxiv","version":1}},"canonical_sha256":"931dc1cf529a52c036ab8366dd37c30159cfa6f89308a0720e0299b53d0010da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"931dc1cf529a52c036ab8366dd37c30159cfa6f89308a0720e0299b53d0010da","first_computed_at":"2026-05-18T00:25:22.430921Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:22.430921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LrIIbvgpsULnyEIsLEtD8MTLThJd2Piaznbm9yYctXAEl7ngfHPWP4wnNoRetQNBhDrfOrOISsbSZKgqoChUDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:22.431462Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.07033","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9244e4eab9904a6034c2953f2be775f6c4c11e80ab6ef15844d1baa1037b270","sha256:0c19a67249f3d0ea17a4fe7380e5dffaa80289bc8ee684c8604166edb5a8ecc4"],"state_sha256":"7bd0efad161d8a5a888efa6dc555489c1261d0c3f058332d3d2db1a909b938e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Se3fKWfDUBQpexB3DKEg7naBgH4uAIpTdm6+TNd1TH/klUnC8HQ2iKj1hv1BVHrCko0JNCF9AJjS9anqbihPCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:00:54.047145Z","bundle_sha256":"d021ce7b6966295adc844b42e0acd59fe6475113423730553839b137c8799792"}}