{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NDBXAE4QYCEK7TS5KFGIQOMDZ5","short_pith_number":"pith:NDBXAE4Q","schema_version":"1.0","canonical_sha256":"68c3701390c088afce5d514c883983cf7c26c4ee09ed3d1ed9575d4f1e1f9e04","source":{"kind":"arxiv","id":"1701.06969","version":2},"attestation_state":"computed","paper":{"title":"Error correction based on partial information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Barg, Itzhak Tamo, Min Ye","submitted_at":"2017-01-24T16:33:32Z","abstract_excerpt":"We consider the decoding of linear and array codes from errors when we are only allowed to download a part of the codeword. More specifically, suppose that we have encoded $k$ data symbols using an $(n,k)$ code with code length $n$ and dimension $k.$ During storage, some of the codeword coordinates might be corrupted by errors. We aim to recover the original data by reading the corrupted codeword with a limit on the transmitting bandwidth, namely, we can only download an $\\alpha$ proportion of the corrupted codeword. For a given $\\alpha,$ our objective is to design a code and a decoding scheme"},"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":"1701.06969","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-24T16:33:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"51e9f674a01b17a1500b52af4fcd8456676f13887efdc317375031589acde093","abstract_canon_sha256":"0b3aedbe49f2df045b6b5329ead78012c01ec930b5d8e9ecb64f2ffdabacce2c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:50.379006Z","signature_b64":"1qpm6A8GfyhFH2ARX438hJ9uurwIC6F70maHRTD4WRto0xZWiWn2O4KvSUrATq+DnUtuy1bg1ol87AB14oPpBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68c3701390c088afce5d514c883983cf7c26c4ee09ed3d1ed9575d4f1e1f9e04","last_reissued_at":"2026-05-18T00:03:50.378413Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:50.378413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Error correction based on partial information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Barg, Itzhak Tamo, Min Ye","submitted_at":"2017-01-24T16:33:32Z","abstract_excerpt":"We consider the decoding of linear and array codes from errors when we are only allowed to download a part of the codeword. More specifically, suppose that we have encoded $k$ data symbols using an $(n,k)$ code with code length $n$ and dimension $k.$ During storage, some of the codeword coordinates might be corrupted by errors. We aim to recover the original data by reading the corrupted codeword with a limit on the transmitting bandwidth, namely, we can only download an $\\alpha$ proportion of the corrupted codeword. For a given $\\alpha,$ our objective is to design a code and a decoding scheme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06969","kind":"arxiv","version":2},"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":"1701.06969","created_at":"2026-05-18T00:03:50.378528+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.06969v2","created_at":"2026-05-18T00:03:50.378528+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06969","created_at":"2026-05-18T00:03:50.378528+00:00"},{"alias_kind":"pith_short_12","alias_value":"NDBXAE4QYCEK","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NDBXAE4QYCEK7TS5","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NDBXAE4Q","created_at":"2026-05-18T12:31:31.346846+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/NDBXAE4QYCEK7TS5KFGIQOMDZ5","json":"https://pith.science/pith/NDBXAE4QYCEK7TS5KFGIQOMDZ5.json","graph_json":"https://pith.science/api/pith-number/NDBXAE4QYCEK7TS5KFGIQOMDZ5/graph.json","events_json":"https://pith.science/api/pith-number/NDBXAE4QYCEK7TS5KFGIQOMDZ5/events.json","paper":"https://pith.science/paper/NDBXAE4Q"},"agent_actions":{"view_html":"https://pith.science/pith/NDBXAE4QYCEK7TS5KFGIQOMDZ5","download_json":"https://pith.science/pith/NDBXAE4QYCEK7TS5KFGIQOMDZ5.json","view_paper":"https://pith.science/paper/NDBXAE4Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.06969&json=true","fetch_graph":"https://pith.science/api/pith-number/NDBXAE4QYCEK7TS5KFGIQOMDZ5/graph.json","fetch_events":"https://pith.science/api/pith-number/NDBXAE4QYCEK7TS5KFGIQOMDZ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NDBXAE4QYCEK7TS5KFGIQOMDZ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NDBXAE4QYCEK7TS5KFGIQOMDZ5/action/storage_attestation","attest_author":"https://pith.science/pith/NDBXAE4QYCEK7TS5KFGIQOMDZ5/action/author_attestation","sign_citation":"https://pith.science/pith/NDBXAE4QYCEK7TS5KFGIQOMDZ5/action/citation_signature","submit_replication":"https://pith.science/pith/NDBXAE4QYCEK7TS5KFGIQOMDZ5/action/replication_record"}},"created_at":"2026-05-18T00:03:50.378528+00:00","updated_at":"2026-05-18T00:03:50.378528+00:00"}