{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VSEX6QKUCCGHBJ4ULP26EKSZUS","short_pith_number":"pith:VSEX6QKU","schema_version":"1.0","canonical_sha256":"ac897f4154108c70a7945bf5e22a59a491d55d2a49faa6a851c073a87ef60616","source":{"kind":"arxiv","id":"1601.06468","version":2},"attestation_state":"computed","paper":{"title":"New Error Correcting Codes for Informed Receivers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emanuele Viterbo, Lakshmi Natarajan, Yi Hong","submitted_at":"2016-01-25T02:44:09Z","abstract_excerpt":"We construct error correcting codes for jointly transmitting a finite set of independent messages to an 'informed receiver' which has prior knowledge of the values of some subset of the messages as side information. The transmitter is oblivious to the message subset already known to the receiver and performs encoding in such a way that any possible side information can be used efficiently at the decoder. We construct and identify several families of algebraic error correcting codes for this problem using cyclic and maximum distance separable (MDS) codes. The proposed codes are of short block l"},"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":"1601.06468","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-25T02:44:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ed9baf826fce9adb39940318bf8d209277e9fc9b6584a70ef1dd948f6cff6b22","abstract_canon_sha256":"a97da8f99f66c9d2e40a85dc5d6739a939ea1ff6ac663a0165456886ea5d98f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:32.538248Z","signature_b64":"I4H9LFbRhdqgpbHH0GOw9w4dEmLTIO9s4CZiKsuHkGUMH9/Bv7PhFGXYRKqjLhrh5iUWDU5heINL1XpZ9V4gDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac897f4154108c70a7945bf5e22a59a491d55d2a49faa6a851c073a87ef60616","last_reissued_at":"2026-05-18T01:17:32.537472Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:32.537472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Error Correcting Codes for Informed Receivers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emanuele Viterbo, Lakshmi Natarajan, Yi Hong","submitted_at":"2016-01-25T02:44:09Z","abstract_excerpt":"We construct error correcting codes for jointly transmitting a finite set of independent messages to an 'informed receiver' which has prior knowledge of the values of some subset of the messages as side information. The transmitter is oblivious to the message subset already known to the receiver and performs encoding in such a way that any possible side information can be used efficiently at the decoder. We construct and identify several families of algebraic error correcting codes for this problem using cyclic and maximum distance separable (MDS) codes. The proposed codes are of short block l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06468","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":"1601.06468","created_at":"2026-05-18T01:17:32.537616+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.06468v2","created_at":"2026-05-18T01:17:32.537616+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06468","created_at":"2026-05-18T01:17:32.537616+00:00"},{"alias_kind":"pith_short_12","alias_value":"VSEX6QKUCCGH","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VSEX6QKUCCGHBJ4U","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VSEX6QKU","created_at":"2026-05-18T12:30:48.956258+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/VSEX6QKUCCGHBJ4ULP26EKSZUS","json":"https://pith.science/pith/VSEX6QKUCCGHBJ4ULP26EKSZUS.json","graph_json":"https://pith.science/api/pith-number/VSEX6QKUCCGHBJ4ULP26EKSZUS/graph.json","events_json":"https://pith.science/api/pith-number/VSEX6QKUCCGHBJ4ULP26EKSZUS/events.json","paper":"https://pith.science/paper/VSEX6QKU"},"agent_actions":{"view_html":"https://pith.science/pith/VSEX6QKUCCGHBJ4ULP26EKSZUS","download_json":"https://pith.science/pith/VSEX6QKUCCGHBJ4ULP26EKSZUS.json","view_paper":"https://pith.science/paper/VSEX6QKU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.06468&json=true","fetch_graph":"https://pith.science/api/pith-number/VSEX6QKUCCGHBJ4ULP26EKSZUS/graph.json","fetch_events":"https://pith.science/api/pith-number/VSEX6QKUCCGHBJ4ULP26EKSZUS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VSEX6QKUCCGHBJ4ULP26EKSZUS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VSEX6QKUCCGHBJ4ULP26EKSZUS/action/storage_attestation","attest_author":"https://pith.science/pith/VSEX6QKUCCGHBJ4ULP26EKSZUS/action/author_attestation","sign_citation":"https://pith.science/pith/VSEX6QKUCCGHBJ4ULP26EKSZUS/action/citation_signature","submit_replication":"https://pith.science/pith/VSEX6QKUCCGHBJ4ULP26EKSZUS/action/replication_record"}},"created_at":"2026-05-18T01:17:32.537616+00:00","updated_at":"2026-05-18T01:17:32.537616+00:00"}