{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:C4RFC5X3LMTEKAAGFNJWUGWQ4T","short_pith_number":"pith:C4RFC5X3","schema_version":"1.0","canonical_sha256":"17225176fb5b264500062b536a1ad0e4eb51811c99f90310ae5708d7a2d741a8","source":{"kind":"arxiv","id":"1801.02868","version":1},"attestation_state":"computed","paper":{"title":"Linear Codes for Broadcasting with Noisy Side Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lakshmi Natarajan, Suman Ghosh","submitted_at":"2018-01-09T10:29:10Z","abstract_excerpt":"We consider network coding for a noiseless broadcast channel where each receiver demands a subset of messages available at the transmitter and is equipped with noisy side information in the form an erroneous version of the message symbols it demands. We view the message symbols as elements from a finite field and assume that the number of symbol errors in the noisy side information is upper bounded by a known constant. This communication problem, which we refer to as 'broadcasting with noisy side information' (BNSI), has applications in the re-transmission phase of downlink networks. We derive"},"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":"1801.02868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-09T10:29:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4e506d0d055bf2ea6fea5530b81c9de0fe3922301fbcc4b77accb4855e7dacae","abstract_canon_sha256":"6c198a0ab2e1c6d02fa134195e6f3a09fa6a8f750e90461a13316abbf63b038a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:22.191866Z","signature_b64":"4s2ayHPMANa64yILcDtIQeUatA5KRpZq30YVfGkFFXT4OjmzGFhr8Ao4gN/ialrfT3mag46/tIrbxJQoKtILCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17225176fb5b264500062b536a1ad0e4eb51811c99f90310ae5708d7a2d741a8","last_reissued_at":"2026-05-18T00:26:22.191134Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:22.191134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Codes for Broadcasting with Noisy Side Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lakshmi Natarajan, Suman Ghosh","submitted_at":"2018-01-09T10:29:10Z","abstract_excerpt":"We consider network coding for a noiseless broadcast channel where each receiver demands a subset of messages available at the transmitter and is equipped with noisy side information in the form an erroneous version of the message symbols it demands. We view the message symbols as elements from a finite field and assume that the number of symbol errors in the noisy side information is upper bounded by a known constant. This communication problem, which we refer to as 'broadcasting with noisy side information' (BNSI), has applications in the re-transmission phase of downlink networks. We derive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02868","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":"1801.02868","created_at":"2026-05-18T00:26:22.191276+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.02868v1","created_at":"2026-05-18T00:26:22.191276+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02868","created_at":"2026-05-18T00:26:22.191276+00:00"},{"alias_kind":"pith_short_12","alias_value":"C4RFC5X3LMTE","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"C4RFC5X3LMTEKAAG","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"C4RFC5X3","created_at":"2026-05-18T12:32:16.446611+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/C4RFC5X3LMTEKAAGFNJWUGWQ4T","json":"https://pith.science/pith/C4RFC5X3LMTEKAAGFNJWUGWQ4T.json","graph_json":"https://pith.science/api/pith-number/C4RFC5X3LMTEKAAGFNJWUGWQ4T/graph.json","events_json":"https://pith.science/api/pith-number/C4RFC5X3LMTEKAAGFNJWUGWQ4T/events.json","paper":"https://pith.science/paper/C4RFC5X3"},"agent_actions":{"view_html":"https://pith.science/pith/C4RFC5X3LMTEKAAGFNJWUGWQ4T","download_json":"https://pith.science/pith/C4RFC5X3LMTEKAAGFNJWUGWQ4T.json","view_paper":"https://pith.science/paper/C4RFC5X3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.02868&json=true","fetch_graph":"https://pith.science/api/pith-number/C4RFC5X3LMTEKAAGFNJWUGWQ4T/graph.json","fetch_events":"https://pith.science/api/pith-number/C4RFC5X3LMTEKAAGFNJWUGWQ4T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C4RFC5X3LMTEKAAGFNJWUGWQ4T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C4RFC5X3LMTEKAAGFNJWUGWQ4T/action/storage_attestation","attest_author":"https://pith.science/pith/C4RFC5X3LMTEKAAGFNJWUGWQ4T/action/author_attestation","sign_citation":"https://pith.science/pith/C4RFC5X3LMTEKAAGFNJWUGWQ4T/action/citation_signature","submit_replication":"https://pith.science/pith/C4RFC5X3LMTEKAAGFNJWUGWQ4T/action/replication_record"}},"created_at":"2026-05-18T00:26:22.191276+00:00","updated_at":"2026-05-18T00:26:22.191276+00:00"}