{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PLCFDVE6MBNHN6TTTYHNYF4WAR","short_pith_number":"pith:PLCFDVE6","schema_version":"1.0","canonical_sha256":"7ac451d49e605a76fa739e0edc17960479a01b82e7067c91b18742ecdafd59be","source":{"kind":"arxiv","id":"1805.11698","version":3},"attestation_state":"computed","paper":{"title":"Coded Computation Against Distributed Straggling Channel Decoders in the Cloud for Gaussian Uplink Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cong Ling, Jinwen Shi, J\\\"org Kliewer, Osvaldo Simeone","submitted_at":"2018-05-29T20:26:54Z","abstract_excerpt":"The uplink of a Cloud Radio Access Network (CRAN) architecture is studied, where decoding at the cloud takes place at distributed decoding processors. To mitigate the impact of straggling decoders in the cloud, the cloud re-encodes the received frames via a linear code before distributing them to the decoding processors. Focusing on Gaussian channels, and assuming the use of lattice codes at the users, in this paper the maximum user rate is derived such that all the servers can reliably recover the linear combinations of the messages corresponding to the employed linear code at the cloud. Furt"},"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":"1805.11698","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-29T20:26:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0933fd1a9f58b5db66afa9272bc6e2762a0cf1915e9451dca73719002c06d6b5","abstract_canon_sha256":"e30289027fd0e53abafe818ec5fd00659b1f1d335ecd83d11d0398120eb66ced"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:54.170110Z","signature_b64":"LieL6uiFXDQdkWCecNJroCT2xPZ87qnwN9EyYIdeRl4UCpxr0e5BGZTU1lbN/CoUIZdbHL9vzvQ3qovKmgvDCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ac451d49e605a76fa739e0edc17960479a01b82e7067c91b18742ecdafd59be","last_reissued_at":"2026-05-18T00:10:54.169418Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:54.169418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coded Computation Against Distributed Straggling Channel Decoders in the Cloud for Gaussian Uplink Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cong Ling, Jinwen Shi, J\\\"org Kliewer, Osvaldo Simeone","submitted_at":"2018-05-29T20:26:54Z","abstract_excerpt":"The uplink of a Cloud Radio Access Network (CRAN) architecture is studied, where decoding at the cloud takes place at distributed decoding processors. To mitigate the impact of straggling decoders in the cloud, the cloud re-encodes the received frames via a linear code before distributing them to the decoding processors. Focusing on Gaussian channels, and assuming the use of lattice codes at the users, in this paper the maximum user rate is derived such that all the servers can reliably recover the linear combinations of the messages corresponding to the employed linear code at the cloud. Furt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11698","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":"1805.11698","created_at":"2026-05-18T00:10:54.169517+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.11698v3","created_at":"2026-05-18T00:10:54.169517+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11698","created_at":"2026-05-18T00:10:54.169517+00:00"},{"alias_kind":"pith_short_12","alias_value":"PLCFDVE6MBNH","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"PLCFDVE6MBNHN6TT","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"PLCFDVE6","created_at":"2026-05-18T12:32:46.962924+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/PLCFDVE6MBNHN6TTTYHNYF4WAR","json":"https://pith.science/pith/PLCFDVE6MBNHN6TTTYHNYF4WAR.json","graph_json":"https://pith.science/api/pith-number/PLCFDVE6MBNHN6TTTYHNYF4WAR/graph.json","events_json":"https://pith.science/api/pith-number/PLCFDVE6MBNHN6TTTYHNYF4WAR/events.json","paper":"https://pith.science/paper/PLCFDVE6"},"agent_actions":{"view_html":"https://pith.science/pith/PLCFDVE6MBNHN6TTTYHNYF4WAR","download_json":"https://pith.science/pith/PLCFDVE6MBNHN6TTTYHNYF4WAR.json","view_paper":"https://pith.science/paper/PLCFDVE6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.11698&json=true","fetch_graph":"https://pith.science/api/pith-number/PLCFDVE6MBNHN6TTTYHNYF4WAR/graph.json","fetch_events":"https://pith.science/api/pith-number/PLCFDVE6MBNHN6TTTYHNYF4WAR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PLCFDVE6MBNHN6TTTYHNYF4WAR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PLCFDVE6MBNHN6TTTYHNYF4WAR/action/storage_attestation","attest_author":"https://pith.science/pith/PLCFDVE6MBNHN6TTTYHNYF4WAR/action/author_attestation","sign_citation":"https://pith.science/pith/PLCFDVE6MBNHN6TTTYHNYF4WAR/action/citation_signature","submit_replication":"https://pith.science/pith/PLCFDVE6MBNHN6TTTYHNYF4WAR/action/replication_record"}},"created_at":"2026-05-18T00:10:54.169517+00:00","updated_at":"2026-05-18T00:10:54.169517+00:00"}