{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:N6OPBW74MDADU2OJEGPOL3RD7P","short_pith_number":"pith:N6OPBW74","schema_version":"1.0","canonical_sha256":"6f9cf0dbfc60c03a69c9219ee5ee23fbca08d1200493905e6c8acf0279b16d8c","source":{"kind":"arxiv","id":"1605.01105","version":3},"attestation_state":"computed","paper":{"title":"Communication Cost for Updating Linear Functions when Message Updates are Sparse: Connections to Maximally Recoverable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Muriel Medard, N. Prakash","submitted_at":"2016-05-03T22:20:30Z","abstract_excerpt":"We consider a communication problem in which an update of the source message needs to be conveyed to one or more distant receivers that are interested in maintaining specific linear functions of the source message. The setting is one in which the updates are sparse in nature, and where neither the source nor the receiver(s) is aware of the exact {\\em difference vector}, but only know the amount of sparsity that is present in the difference-vector. Under this setting, we are interested in devising linear encoding and decoding schemes that minimize the communication cost involved. We show that t"},"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":"1605.01105","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-03T22:20:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"38467d4853f550899d54054078178cf4fa388465e24074c5bdbf99ad2476a1c3","abstract_canon_sha256":"e4d12346a316111363335630bc7f70c1e6be41da8bfffa9b33c43a9aa48da898"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:57.994113Z","signature_b64":"uJ4GWVCh9ODmwJdBpT06ox4YaPA/IfvSR6GJBleFAYqaT17JMn//Cxd/4ERxu4gVACox83l+B5VXJ2MsenowDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f9cf0dbfc60c03a69c9219ee5ee23fbca08d1200493905e6c8acf0279b16d8c","last_reissued_at":"2026-05-18T00:08:57.993339Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:57.993339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication Cost for Updating Linear Functions when Message Updates are Sparse: Connections to Maximally Recoverable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Muriel Medard, N. Prakash","submitted_at":"2016-05-03T22:20:30Z","abstract_excerpt":"We consider a communication problem in which an update of the source message needs to be conveyed to one or more distant receivers that are interested in maintaining specific linear functions of the source message. The setting is one in which the updates are sparse in nature, and where neither the source nor the receiver(s) is aware of the exact {\\em difference vector}, but only know the amount of sparsity that is present in the difference-vector. Under this setting, we are interested in devising linear encoding and decoding schemes that minimize the communication cost involved. We show that t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01105","kind":"arxiv","version":3},"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":"1605.01105","created_at":"2026-05-18T00:08:57.993465+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.01105v3","created_at":"2026-05-18T00:08:57.993465+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01105","created_at":"2026-05-18T00:08:57.993465+00:00"},{"alias_kind":"pith_short_12","alias_value":"N6OPBW74MDAD","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"N6OPBW74MDADU2OJ","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"N6OPBW74","created_at":"2026-05-18T12:30:32.724797+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/N6OPBW74MDADU2OJEGPOL3RD7P","json":"https://pith.science/pith/N6OPBW74MDADU2OJEGPOL3RD7P.json","graph_json":"https://pith.science/api/pith-number/N6OPBW74MDADU2OJEGPOL3RD7P/graph.json","events_json":"https://pith.science/api/pith-number/N6OPBW74MDADU2OJEGPOL3RD7P/events.json","paper":"https://pith.science/paper/N6OPBW74"},"agent_actions":{"view_html":"https://pith.science/pith/N6OPBW74MDADU2OJEGPOL3RD7P","download_json":"https://pith.science/pith/N6OPBW74MDADU2OJEGPOL3RD7P.json","view_paper":"https://pith.science/paper/N6OPBW74","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.01105&json=true","fetch_graph":"https://pith.science/api/pith-number/N6OPBW74MDADU2OJEGPOL3RD7P/graph.json","fetch_events":"https://pith.science/api/pith-number/N6OPBW74MDADU2OJEGPOL3RD7P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N6OPBW74MDADU2OJEGPOL3RD7P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N6OPBW74MDADU2OJEGPOL3RD7P/action/storage_attestation","attest_author":"https://pith.science/pith/N6OPBW74MDADU2OJEGPOL3RD7P/action/author_attestation","sign_citation":"https://pith.science/pith/N6OPBW74MDADU2OJEGPOL3RD7P/action/citation_signature","submit_replication":"https://pith.science/pith/N6OPBW74MDADU2OJEGPOL3RD7P/action/replication_record"}},"created_at":"2026-05-18T00:08:57.993465+00:00","updated_at":"2026-05-18T00:08:57.993465+00:00"}