{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AMJAWDH57ZFLQRXL67EGQ6WLGY","short_pith_number":"pith:AMJAWDH5","canonical_record":{"source":{"id":"1801.07839","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-24T02:21:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2c69fc43eff892eaaa9652d876762e8df2711776a33f7187fe8dcf316902ed00","abstract_canon_sha256":"2f49f8fb4b1876ea23f3ed4e377f9a7a7cfb9cf98f7e8504e6c5fd9a88d5deb4"},"schema_version":"1.0"},"canonical_sha256":"03120b0cfdfe4ab846ebf7c8687acb36362c2c3cdb4984957bd96f77f5b623f4","source":{"kind":"arxiv","id":"1801.07839","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07839","created_at":"2026-07-05T01:54:25Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07839v4","created_at":"2026-07-05T01:54:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07839","created_at":"2026-07-05T01:54:25Z"},{"alias_kind":"pith_short_12","alias_value":"AMJAWDH57ZFL","created_at":"2026-07-05T01:54:25Z"},{"alias_kind":"pith_short_16","alias_value":"AMJAWDH57ZFLQRXL","created_at":"2026-07-05T01:54:25Z"},{"alias_kind":"pith_short_8","alias_value":"AMJAWDH5","created_at":"2026-07-05T01:54:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AMJAWDH57ZFLQRXL67EGQ6WLGY","target":"record","payload":{"canonical_record":{"source":{"id":"1801.07839","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-24T02:21:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2c69fc43eff892eaaa9652d876762e8df2711776a33f7187fe8dcf316902ed00","abstract_canon_sha256":"2f49f8fb4b1876ea23f3ed4e377f9a7a7cfb9cf98f7e8504e6c5fd9a88d5deb4"},"schema_version":"1.0"},"canonical_sha256":"03120b0cfdfe4ab846ebf7c8687acb36362c2c3cdb4984957bd96f77f5b623f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:54:25.004484Z","signature_b64":"n0oigDXLv+WilWPVTMLAetx09ysj9blO0Atc6UP2LHUVyM0mGXITuSUNOayTF8UEvkombmii6DWt9DdtlvpMAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03120b0cfdfe4ab846ebf7c8687acb36362c2c3cdb4984957bd96f77f5b623f4","last_reissued_at":"2026-07-05T01:54:25.004053Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:54:25.004053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.07839","source_version":4,"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-07-05T01:54:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zKPVcKDyS/Nxn8iBPDuIfbuejQf9SWErzthUICrhw8bdZAp4scK9rgCHOD0a6kiOwN2r4zqZvUPCeYUcmaVOCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T13:27:57.976443Z"},"content_sha256":"56913da32dc61ae62c54804a3c223b0a4b777ecf918d6f0ec5cd527a53f3df46","schema_version":"1.0","event_id":"sha256:56913da32dc61ae62c54804a3c223b0a4b777ecf918d6f0ec5cd527a53f3df46"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AMJAWDH57ZFLQRXL67EGQ6WLGY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved list-decodability of random linear binary codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mary Wootters, Ray Li","submitted_at":"2018-01-24T02:21:53Z","abstract_excerpt":"There has been a great deal of work establishing that random linear codes are as list-decodable as uniformly random codes, in the sense that a random linear binary code of rate $1 - H(p) - \\epsilon$ is $(p,O(1/\\epsilon))$-list-decodable with high probability. In this work, we show that such codes are $(p, H(p)/\\epsilon + 2)$-list-decodable with high probability, for any $p \\in (0, 1/2)$ and $\\epsilon > 0$. In addition to improving the constant in known list-size bounds, our argument, which is quite simple, works simultaneously for all values of $p$, while previous works obtaining $L = O(1/\\eps"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07839","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1801.07839/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:54:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PYsOU1fX2iqq6YaPtVRtz0fZdxeHtrPzmANNzTWgqnZFV8avWIkeHHMjHMQV5X+tufP44ahhMXcSTIutpjUlAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T13:27:57.976987Z"},"content_sha256":"838f6f16f1b8977380c264347c6b16d5b6362fbaf50d53b4659fdd8961751485","schema_version":"1.0","event_id":"sha256:838f6f16f1b8977380c264347c6b16d5b6362fbaf50d53b4659fdd8961751485"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AMJAWDH57ZFLQRXL67EGQ6WLGY/bundle.json","state_url":"https://pith.science/pith/AMJAWDH57ZFLQRXL67EGQ6WLGY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AMJAWDH57ZFLQRXL67EGQ6WLGY/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-08-05T13:27:57Z","links":{"resolver":"https://pith.science/pith/AMJAWDH57ZFLQRXL67EGQ6WLGY","bundle":"https://pith.science/pith/AMJAWDH57ZFLQRXL67EGQ6WLGY/bundle.json","state":"https://pith.science/pith/AMJAWDH57ZFLQRXL67EGQ6WLGY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AMJAWDH57ZFLQRXL67EGQ6WLGY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AMJAWDH57ZFLQRXL67EGQ6WLGY","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":"2f49f8fb4b1876ea23f3ed4e377f9a7a7cfb9cf98f7e8504e6c5fd9a88d5deb4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-24T02:21:53Z","title_canon_sha256":"2c69fc43eff892eaaa9652d876762e8df2711776a33f7187fe8dcf316902ed00"},"schema_version":"1.0","source":{"id":"1801.07839","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07839","created_at":"2026-07-05T01:54:25Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07839v4","created_at":"2026-07-05T01:54:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07839","created_at":"2026-07-05T01:54:25Z"},{"alias_kind":"pith_short_12","alias_value":"AMJAWDH57ZFL","created_at":"2026-07-05T01:54:25Z"},{"alias_kind":"pith_short_16","alias_value":"AMJAWDH57ZFLQRXL","created_at":"2026-07-05T01:54:25Z"},{"alias_kind":"pith_short_8","alias_value":"AMJAWDH5","created_at":"2026-07-05T01:54:25Z"}],"graph_snapshots":[{"event_id":"sha256:838f6f16f1b8977380c264347c6b16d5b6362fbaf50d53b4659fdd8961751485","target":"graph","created_at":"2026-07-05T01:54:25Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1801.07839/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"There has been a great deal of work establishing that random linear codes are as list-decodable as uniformly random codes, in the sense that a random linear binary code of rate $1 - H(p) - \\epsilon$ is $(p,O(1/\\epsilon))$-list-decodable with high probability. In this work, we show that such codes are $(p, H(p)/\\epsilon + 2)$-list-decodable with high probability, for any $p \\in (0, 1/2)$ and $\\epsilon > 0$. In addition to improving the constant in known list-size bounds, our argument, which is quite simple, works simultaneously for all values of $p$, while previous works obtaining $L = O(1/\\eps","authors_text":"Mary Wootters, Ray Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-24T02:21:53Z","title":"Improved list-decodability of random linear binary codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07839","kind":"arxiv","version":4},"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:56913da32dc61ae62c54804a3c223b0a4b777ecf918d6f0ec5cd527a53f3df46","target":"record","created_at":"2026-07-05T01:54:25Z","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":"2f49f8fb4b1876ea23f3ed4e377f9a7a7cfb9cf98f7e8504e6c5fd9a88d5deb4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-24T02:21:53Z","title_canon_sha256":"2c69fc43eff892eaaa9652d876762e8df2711776a33f7187fe8dcf316902ed00"},"schema_version":"1.0","source":{"id":"1801.07839","kind":"arxiv","version":4}},"canonical_sha256":"03120b0cfdfe4ab846ebf7c8687acb36362c2c3cdb4984957bd96f77f5b623f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03120b0cfdfe4ab846ebf7c8687acb36362c2c3cdb4984957bd96f77f5b623f4","first_computed_at":"2026-07-05T01:54:25.004053Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:54:25.004053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n0oigDXLv+WilWPVTMLAetx09ysj9blO0Atc6UP2LHUVyM0mGXITuSUNOayTF8UEvkombmii6DWt9DdtlvpMAw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:54:25.004484Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.07839","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56913da32dc61ae62c54804a3c223b0a4b777ecf918d6f0ec5cd527a53f3df46","sha256:838f6f16f1b8977380c264347c6b16d5b6362fbaf50d53b4659fdd8961751485"],"state_sha256":"99182e7c76a162b54271abd56870c6c19494941a41e5edb289db9765210637cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/O7fGTqsCC8K6qPsleZNn9IRgcfCV8xV7fby5mzzFp//I3xqCwRGHWhwZMZ9muHjdOUiqwSA/FDvfavNVm+qBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T13:27:57.983291Z","bundle_sha256":"734376204bff9a229f0f64502b4bbc78c6bfb43b8f8f9dd51db1abd3b577a6d4"}}