{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LABTWV7GXQIFZCR2FMHNHTXLFC","short_pith_number":"pith:LABTWV7G","schema_version":"1.0","canonical_sha256":"58033b57e6bc105c8a3a2b0ed3ceeb28932a9db89626dc08de560141462799b1","source":{"kind":"arxiv","id":"1611.06673","version":1},"attestation_state":"computed","paper":{"title":"On the List-Decodability of Random Self-Orthogonal Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chaoping Xing, Lingfei Jin, Xiande Zhang","submitted_at":"2016-11-21T07:46:00Z","abstract_excerpt":"In 2011, Guruswami-H{\\aa}stad-Kopparty \\cite{Gru} showed that the list-decodability of random linear codes is as good as that of general random codes. In the present paper, we further strengthen the result by showing that the list-decodability of random {\\it Euclidean self-orthogonal} codes is as good as that of general random codes as well, i.e., achieves the classical Gilbert-Varshamov bound. Specifically, we show that, for any fixed finite field $\\F_q$, error fraction $\\delta\\in (0,1-1/q)$ satisfying $1-H_q(\\delta)\\le \\frac12$ and small $\\epsilon>0$, with high probability a random Euclidean"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1611.06673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-21T07:46:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"57be520ad6e0fc93a85363f6d3dcf86cf1b8b19e3ebd1e67d8d52e71bf2f7f52","abstract_canon_sha256":"804a9c5be69e7d68cbfd4c57d67e3ad6efb66baec3a855f6a9cc2ca5abc2d4f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:33.196511Z","signature_b64":"rZiSv+Za6F8jaNEfe7TJMP/BI/WUYuAL7o02ubviQA7rHntLhvI1kLApNlJ662XSy2NhKPcqTZ4VubtSYf6jAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58033b57e6bc105c8a3a2b0ed3ceeb28932a9db89626dc08de560141462799b1","last_reissued_at":"2026-05-18T00:57:33.195877Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:33.195877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the List-Decodability of Random Self-Orthogonal Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chaoping Xing, Lingfei Jin, Xiande Zhang","submitted_at":"2016-11-21T07:46:00Z","abstract_excerpt":"In 2011, Guruswami-H{\\aa}stad-Kopparty \\cite{Gru} showed that the list-decodability of random linear codes is as good as that of general random codes. In the present paper, we further strengthen the result by showing that the list-decodability of random {\\it Euclidean self-orthogonal} codes is as good as that of general random codes as well, i.e., achieves the classical Gilbert-Varshamov bound. Specifically, we show that, for any fixed finite field $\\F_q$, error fraction $\\delta\\in (0,1-1/q)$ satisfying $1-H_q(\\delta)\\le \\frac12$ and small $\\epsilon>0$, with high probability a random Euclidean"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06673","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1611.06673","created_at":"2026-05-18T00:57:33.195977+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.06673v1","created_at":"2026-05-18T00:57:33.195977+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06673","created_at":"2026-05-18T00:57:33.195977+00:00"},{"alias_kind":"pith_short_12","alias_value":"LABTWV7GXQIF","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LABTWV7GXQIFZCR2","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LABTWV7G","created_at":"2026-05-18T12:30:29.479603+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LABTWV7GXQIFZCR2FMHNHTXLFC","json":"https://pith.science/pith/LABTWV7GXQIFZCR2FMHNHTXLFC.json","graph_json":"https://pith.science/api/pith-number/LABTWV7GXQIFZCR2FMHNHTXLFC/graph.json","events_json":"https://pith.science/api/pith-number/LABTWV7GXQIFZCR2FMHNHTXLFC/events.json","paper":"https://pith.science/paper/LABTWV7G"},"agent_actions":{"view_html":"https://pith.science/pith/LABTWV7GXQIFZCR2FMHNHTXLFC","download_json":"https://pith.science/pith/LABTWV7GXQIFZCR2FMHNHTXLFC.json","view_paper":"https://pith.science/paper/LABTWV7G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.06673&json=true","fetch_graph":"https://pith.science/api/pith-number/LABTWV7GXQIFZCR2FMHNHTXLFC/graph.json","fetch_events":"https://pith.science/api/pith-number/LABTWV7GXQIFZCR2FMHNHTXLFC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LABTWV7GXQIFZCR2FMHNHTXLFC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LABTWV7GXQIFZCR2FMHNHTXLFC/action/storage_attestation","attest_author":"https://pith.science/pith/LABTWV7GXQIFZCR2FMHNHTXLFC/action/author_attestation","sign_citation":"https://pith.science/pith/LABTWV7GXQIFZCR2FMHNHTXLFC/action/citation_signature","submit_replication":"https://pith.science/pith/LABTWV7GXQIFZCR2FMHNHTXLFC/action/replication_record"}},"created_at":"2026-05-18T00:57:33.195977+00:00","updated_at":"2026-05-18T00:57:33.195977+00:00"}