{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LABTWV7GXQIFZCR2FMHNHTXLFC","short_pith_number":"pith:LABTWV7G","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"},"canonical_sha256":"58033b57e6bc105c8a3a2b0ed3ceeb28932a9db89626dc08de560141462799b1","source":{"kind":"arxiv","id":"1611.06673","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06673","created_at":"2026-05-18T00:57:33Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06673v1","created_at":"2026-05-18T00:57:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06673","created_at":"2026-05-18T00:57:33Z"},{"alias_kind":"pith_short_12","alias_value":"LABTWV7GXQIF","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LABTWV7GXQIFZCR2","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LABTWV7G","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LABTWV7GXQIFZCR2FMHNHTXLFC","target":"record","payload":{"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"},"canonical_sha256":"58033b57e6bc105c8a3a2b0ed3ceeb28932a9db89626dc08de560141462799b1","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"},"source_kind":"arxiv","source_id":"1611.06673","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:57:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pUJeEgvzKmuitYWUssOSQ14SdbzxPqyvZF3Ou546Ha4FcE5I2ae5Di4N0SgBgocUrPhDpDaCdBbQArclib12CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:20:12.709114Z"},"content_sha256":"ecf14429a54129a3d65fcd89acfb62275fa58e38090ae7f1fb40b80fcd540908","schema_version":"1.0","event_id":"sha256:ecf14429a54129a3d65fcd89acfb62275fa58e38090ae7f1fb40b80fcd540908"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LABTWV7GXQIFZCR2FMHNHTXLFC","target":"graph","payload":{"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"},"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:57:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iJd/22JBbH3P3+eHN1c9XXwECUnHXe+wZ/vr0/INWua5sau0lzokKy3GyE0rpg24OmZITBwALntTutC4R20qBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:20:12.709740Z"},"content_sha256":"cd220c8831da1388888c22029c0fef66803906db60f738982404054e0217f696","schema_version":"1.0","event_id":"sha256:cd220c8831da1388888c22029c0fef66803906db60f738982404054e0217f696"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LABTWV7GXQIFZCR2FMHNHTXLFC/bundle.json","state_url":"https://pith.science/pith/LABTWV7GXQIFZCR2FMHNHTXLFC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LABTWV7GXQIFZCR2FMHNHTXLFC/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-07T17:20:12Z","links":{"resolver":"https://pith.science/pith/LABTWV7GXQIFZCR2FMHNHTXLFC","bundle":"https://pith.science/pith/LABTWV7GXQIFZCR2FMHNHTXLFC/bundle.json","state":"https://pith.science/pith/LABTWV7GXQIFZCR2FMHNHTXLFC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LABTWV7GXQIFZCR2FMHNHTXLFC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LABTWV7GXQIFZCR2FMHNHTXLFC","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":"804a9c5be69e7d68cbfd4c57d67e3ad6efb66baec3a855f6a9cc2ca5abc2d4f9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-21T07:46:00Z","title_canon_sha256":"57be520ad6e0fc93a85363f6d3dcf86cf1b8b19e3ebd1e67d8d52e71bf2f7f52"},"schema_version":"1.0","source":{"id":"1611.06673","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06673","created_at":"2026-05-18T00:57:33Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06673v1","created_at":"2026-05-18T00:57:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06673","created_at":"2026-05-18T00:57:33Z"},{"alias_kind":"pith_short_12","alias_value":"LABTWV7GXQIF","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LABTWV7GXQIFZCR2","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LABTWV7G","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:cd220c8831da1388888c22029c0fef66803906db60f738982404054e0217f696","target":"graph","created_at":"2026-05-18T00:57:33Z","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 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","authors_text":"Chaoping Xing, Lingfei Jin, Xiande Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-21T07:46:00Z","title":"On the List-Decodability of Random Self-Orthogonal Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06673","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:ecf14429a54129a3d65fcd89acfb62275fa58e38090ae7f1fb40b80fcd540908","target":"record","created_at":"2026-05-18T00:57:33Z","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":"804a9c5be69e7d68cbfd4c57d67e3ad6efb66baec3a855f6a9cc2ca5abc2d4f9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-21T07:46:00Z","title_canon_sha256":"57be520ad6e0fc93a85363f6d3dcf86cf1b8b19e3ebd1e67d8d52e71bf2f7f52"},"schema_version":"1.0","source":{"id":"1611.06673","kind":"arxiv","version":1}},"canonical_sha256":"58033b57e6bc105c8a3a2b0ed3ceeb28932a9db89626dc08de560141462799b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58033b57e6bc105c8a3a2b0ed3ceeb28932a9db89626dc08de560141462799b1","first_computed_at":"2026-05-18T00:57:33.195877Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:33.195877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rZiSv+Za6F8jaNEfe7TJMP/BI/WUYuAL7o02ubviQA7rHntLhvI1kLApNlJ662XSy2NhKPcqTZ4VubtSYf6jAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:33.196511Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.06673","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ecf14429a54129a3d65fcd89acfb62275fa58e38090ae7f1fb40b80fcd540908","sha256:cd220c8831da1388888c22029c0fef66803906db60f738982404054e0217f696"],"state_sha256":"4da257bab498bee82aefc8853ca2f56ba4a2684edff67a33ff4224f598e478fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v68BCf59TVvodiwspwt6BUFdXFEYdUTaOKI5vi83nhK4w3WCIqTW7VqyPY12tKMbf33ClSHT6WtpnSID7L9EBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:20:12.713248Z","bundle_sha256":"50604e464d2429bb2fcd3840d3c913df07c8dce10a01a2e8919422ab90c36d83"}}