{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QK74GI5HUFN44G6DSFG42FHVKJ","short_pith_number":"pith:QK74GI5H","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"},"canonical_sha256":"82bfc323a7a15bce1bc3914dcd14f5525614f9fc6e11ae13acf1c0f4dca38a35","source":{"kind":"arxiv","id":"1503.01955","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01955","created_at":"2026-05-18T02:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01955v1","created_at":"2026-05-18T02:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01955","created_at":"2026-05-18T02:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"QK74GI5HUFN4","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QK74GI5HUFN44G6D","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QK74GI5H","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QK74GI5HUFN44G6DSFG42FHVKJ","target":"record","payload":{"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"},"canonical_sha256":"82bfc323a7a15bce1bc3914dcd14f5525614f9fc6e11ae13acf1c0f4dca38a35","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"},"source_kind":"arxiv","source_id":"1503.01955","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-18T02:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ibb0Bjvdaw+stamx8GK5VWgBkSwUEvBu5d5/Ee9wwmbmTzLoVF6QE9epxNGaAxjPFxUlu0nTkG+2THGIUhMQAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:13:41.527797Z"},"content_sha256":"41366baf9210dade79a5f96ebb8b896b82b4740f3610b2d010fce4f5bf3d5324","schema_version":"1.0","event_id":"sha256:41366baf9210dade79a5f96ebb8b896b82b4740f3610b2d010fce4f5bf3d5324"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QK74GI5HUFN44G6DSFG42FHVKJ","target":"graph","payload":{"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"},"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-18T02:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CP29UfAHxe/XwpvNwU0pkIeIrKPl9jm4njFVWxUgOgshbHfNn4lYZ0PRLlW0SadWYxxyND9d5HvqX2A7QUD5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:13:41.528148Z"},"content_sha256":"efb8742a7290b3dc85b52aa9964d496ddc42815618f938ec8e58d594e0aa7b05","schema_version":"1.0","event_id":"sha256:efb8742a7290b3dc85b52aa9964d496ddc42815618f938ec8e58d594e0aa7b05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QK74GI5HUFN44G6DSFG42FHVKJ/bundle.json","state_url":"https://pith.science/pith/QK74GI5HUFN44G6DSFG42FHVKJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QK74GI5HUFN44G6DSFG42FHVKJ/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-05T09:13:41Z","links":{"resolver":"https://pith.science/pith/QK74GI5HUFN44G6DSFG42FHVKJ","bundle":"https://pith.science/pith/QK74GI5HUFN44G6DSFG42FHVKJ/bundle.json","state":"https://pith.science/pith/QK74GI5HUFN44G6DSFG42FHVKJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QK74GI5HUFN44G6DSFG42FHVKJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QK74GI5HUFN44G6DSFG42FHVKJ","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":"6085382efd95fb05c975f56970b86d98eac40c1035bc53038d487e4f7595fcd8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-06T13:55:10Z","title_canon_sha256":"ece898a3fda73de1d74e864dec99510860f3c881c8a4f8b676f39c3e99ce5a14"},"schema_version":"1.0","source":{"id":"1503.01955","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01955","created_at":"2026-05-18T02:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01955v1","created_at":"2026-05-18T02:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01955","created_at":"2026-05-18T02:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"QK74GI5HUFN4","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QK74GI5HUFN44G6D","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QK74GI5H","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:efb8742a7290b3dc85b52aa9964d496ddc42815618f938ec8e58d594e0aa7b05","target":"graph","created_at":"2026-05-18T02:25:27Z","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":"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","authors_text":"Brett Hemenway, Mary Wootters","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-06T13:55:10Z","title":"Linear-time list recovery of high-rate expander codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01955","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:41366baf9210dade79a5f96ebb8b896b82b4740f3610b2d010fce4f5bf3d5324","target":"record","created_at":"2026-05-18T02:25:27Z","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":"6085382efd95fb05c975f56970b86d98eac40c1035bc53038d487e4f7595fcd8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-06T13:55:10Z","title_canon_sha256":"ece898a3fda73de1d74e864dec99510860f3c881c8a4f8b676f39c3e99ce5a14"},"schema_version":"1.0","source":{"id":"1503.01955","kind":"arxiv","version":1}},"canonical_sha256":"82bfc323a7a15bce1bc3914dcd14f5525614f9fc6e11ae13acf1c0f4dca38a35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"82bfc323a7a15bce1bc3914dcd14f5525614f9fc6e11ae13acf1c0f4dca38a35","first_computed_at":"2026-05-18T02:25:27.198270Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:27.198270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZNnaIPsIZntrf09lYcDGGS8T7auKtRMbCDFiMPVzQjJSLwkZfPC6Q4tMRYix09iUMsBBrMBSb5CIbwdtbjtqAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:27.198938Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.01955","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41366baf9210dade79a5f96ebb8b896b82b4740f3610b2d010fce4f5bf3d5324","sha256:efb8742a7290b3dc85b52aa9964d496ddc42815618f938ec8e58d594e0aa7b05"],"state_sha256":"779a131a638a06e27be3acb45935801016a2ddf96df396e5836df47b6caae1d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L+wp35XEuBqNf8UoFPRTvFVgA+xjW836AXAssk2e0Iqn7TtGSE4PYK0bAceQVMYt2zkxtgTiHKzecMj58E9xCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T09:13:41.530307Z","bundle_sha256":"c2c5eef139dc919e27cde0b10567158bd6289837ea6513d5c0a460bdf48ac8de"}}