{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QK74GI5HUFN44G6DSFG42FHVKJ","short_pith_number":"pith:QK74GI5H","schema_version":"1.0","canonical_sha256":"82bfc323a7a15bce1bc3914dcd14f5525614f9fc6e11ae13acf1c0f4dca38a35","source":{"kind":"arxiv","id":"1503.01955","version":1},"attestation_state":"computed","paper":{"title":"Linear-time list recovery of high-rate expander codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Brett Hemenway, Mary Wootters","submitted_at":"2015-03-06T13:55:10Z","abstract_excerpt":"We show that expander codes, when properly instantiated, are high-rate list recoverable codes with linear-time list recovery algorithms. List recoverable codes have been useful recently in constructing efficiently list-decodable codes, as well as explicit constructions of matrices for compressive sensing and group testing. Previous list recoverable codes with linear-time decoding algorithms have all had rate at most 1/2; in contrast, our codes can have rate $1 - \\epsilon$ for any $\\epsilon > 0$. We can plug our high-rate codes into a construction of Meir (2014) to obtain linear-time list recov"},"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":"1503.01955","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-06T13:55:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ece898a3fda73de1d74e864dec99510860f3c881c8a4f8b676f39c3e99ce5a14","abstract_canon_sha256":"6085382efd95fb05c975f56970b86d98eac40c1035bc53038d487e4f7595fcd8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:27.198938Z","signature_b64":"ZNnaIPsIZntrf09lYcDGGS8T7auKtRMbCDFiMPVzQjJSLwkZfPC6Q4tMRYix09iUMsBBrMBSb5CIbwdtbjtqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82bfc323a7a15bce1bc3914dcd14f5525614f9fc6e11ae13acf1c0f4dca38a35","last_reissued_at":"2026-05-18T02:25:27.198270Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:27.198270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear-time list recovery of high-rate expander codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Brett Hemenway, Mary Wootters","submitted_at":"2015-03-06T13:55:10Z","abstract_excerpt":"We show that expander codes, when properly instantiated, are high-rate list recoverable codes with linear-time list recovery algorithms. List recoverable codes have been useful recently in constructing efficiently list-decodable codes, as well as explicit constructions of matrices for compressive sensing and group testing. Previous list recoverable codes with linear-time decoding algorithms have all had rate at most 1/2; in contrast, our codes can have rate $1 - \\epsilon$ for any $\\epsilon > 0$. We can plug our high-rate codes into a construction of Meir (2014) to obtain linear-time list recov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01955","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":"1503.01955","created_at":"2026-05-18T02:25:27.198385+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.01955v1","created_at":"2026-05-18T02:25:27.198385+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01955","created_at":"2026-05-18T02:25:27.198385+00:00"},{"alias_kind":"pith_short_12","alias_value":"QK74GI5HUFN4","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QK74GI5HUFN44G6D","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QK74GI5H","created_at":"2026-05-18T12:29:37.295048+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/QK74GI5HUFN44G6DSFG42FHVKJ","json":"https://pith.science/pith/QK74GI5HUFN44G6DSFG42FHVKJ.json","graph_json":"https://pith.science/api/pith-number/QK74GI5HUFN44G6DSFG42FHVKJ/graph.json","events_json":"https://pith.science/api/pith-number/QK74GI5HUFN44G6DSFG42FHVKJ/events.json","paper":"https://pith.science/paper/QK74GI5H"},"agent_actions":{"view_html":"https://pith.science/pith/QK74GI5HUFN44G6DSFG42FHVKJ","download_json":"https://pith.science/pith/QK74GI5HUFN44G6DSFG42FHVKJ.json","view_paper":"https://pith.science/paper/QK74GI5H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.01955&json=true","fetch_graph":"https://pith.science/api/pith-number/QK74GI5HUFN44G6DSFG42FHVKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/QK74GI5HUFN44G6DSFG42FHVKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QK74GI5HUFN44G6DSFG42FHVKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QK74GI5HUFN44G6DSFG42FHVKJ/action/storage_attestation","attest_author":"https://pith.science/pith/QK74GI5HUFN44G6DSFG42FHVKJ/action/author_attestation","sign_citation":"https://pith.science/pith/QK74GI5HUFN44G6DSFG42FHVKJ/action/citation_signature","submit_replication":"https://pith.science/pith/QK74GI5HUFN44G6DSFG42FHVKJ/action/replication_record"}},"created_at":"2026-05-18T02:25:27.198385+00:00","updated_at":"2026-05-18T02:25:27.198385+00:00"}