{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7RIHPPYKTKKHSX5A7EDQC6BMPP","short_pith_number":"pith:7RIHPPYK","schema_version":"1.0","canonical_sha256":"fc5077bf0a9a94795fa0f90701782c7bdb9cd983ac1a829b1c30b7c53dd92174","source":{"kind":"arxiv","id":"1408.4100","version":1},"attestation_state":"computed","paper":{"title":"On the Ice-Wine Problem: Recovering Linear Combination of Codewords over the Gaussian Multiple Access Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hamid Behroozi, Shahab Ghasemi-Goojani","submitted_at":"2014-08-18T19:12:30Z","abstract_excerpt":"In this paper, we consider the Ice-Wine problem: Two transmitters send their messages over the Gaussian Multiple-Access Channel (MAC) and a receiver aims to recover a linear combination of codewords. The best known achievable rate-region for this problem is due to [1],[2] as $R_{i}\\leq\\frac{1}{2}\\log\\left(\\frac{1}{2}+{\\rm SNR}\\right)$ $(i=1,2)$. In this paper, we design a novel scheme using lattice codes and show that the rate region of this problem can be improved. The main difference between our proposed scheme with known schemes in [1],[2] is that instead of recovering the sum of codewords "},"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":"1408.4100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-18T19:12:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ad10fe9c38383a54c4c702d3f4c44cd4804cc737f2e50f6996d801edb52c0f2f","abstract_canon_sha256":"ac5ce725ca1106106b19a03ae68c30392076e9934bc43731eae4413ed81df1d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:57.223729Z","signature_b64":"KLHCXUqC0TszXPR1pLH+cBNSbZkFdY07Wr5b0GkbUVS72GyPvMusFDoseYDgHV1iMqjQNRera754ZzcIhoJPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc5077bf0a9a94795fa0f90701782c7bdb9cd983ac1a829b1c30b7c53dd92174","last_reissued_at":"2026-05-18T02:44:57.223151Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:57.223151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Ice-Wine Problem: Recovering Linear Combination of Codewords over the Gaussian Multiple Access Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hamid Behroozi, Shahab Ghasemi-Goojani","submitted_at":"2014-08-18T19:12:30Z","abstract_excerpt":"In this paper, we consider the Ice-Wine problem: Two transmitters send their messages over the Gaussian Multiple-Access Channel (MAC) and a receiver aims to recover a linear combination of codewords. The best known achievable rate-region for this problem is due to [1],[2] as $R_{i}\\leq\\frac{1}{2}\\log\\left(\\frac{1}{2}+{\\rm SNR}\\right)$ $(i=1,2)$. In this paper, we design a novel scheme using lattice codes and show that the rate region of this problem can be improved. The main difference between our proposed scheme with known schemes in [1],[2] is that instead of recovering the sum of codewords "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4100","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":"1408.4100","created_at":"2026-05-18T02:44:57.223235+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.4100v1","created_at":"2026-05-18T02:44:57.223235+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4100","created_at":"2026-05-18T02:44:57.223235+00:00"},{"alias_kind":"pith_short_12","alias_value":"7RIHPPYKTKKH","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7RIHPPYKTKKHSX5A","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7RIHPPYK","created_at":"2026-05-18T12:28:19.803747+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/7RIHPPYKTKKHSX5A7EDQC6BMPP","json":"https://pith.science/pith/7RIHPPYKTKKHSX5A7EDQC6BMPP.json","graph_json":"https://pith.science/api/pith-number/7RIHPPYKTKKHSX5A7EDQC6BMPP/graph.json","events_json":"https://pith.science/api/pith-number/7RIHPPYKTKKHSX5A7EDQC6BMPP/events.json","paper":"https://pith.science/paper/7RIHPPYK"},"agent_actions":{"view_html":"https://pith.science/pith/7RIHPPYKTKKHSX5A7EDQC6BMPP","download_json":"https://pith.science/pith/7RIHPPYKTKKHSX5A7EDQC6BMPP.json","view_paper":"https://pith.science/paper/7RIHPPYK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.4100&json=true","fetch_graph":"https://pith.science/api/pith-number/7RIHPPYKTKKHSX5A7EDQC6BMPP/graph.json","fetch_events":"https://pith.science/api/pith-number/7RIHPPYKTKKHSX5A7EDQC6BMPP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7RIHPPYKTKKHSX5A7EDQC6BMPP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7RIHPPYKTKKHSX5A7EDQC6BMPP/action/storage_attestation","attest_author":"https://pith.science/pith/7RIHPPYKTKKHSX5A7EDQC6BMPP/action/author_attestation","sign_citation":"https://pith.science/pith/7RIHPPYKTKKHSX5A7EDQC6BMPP/action/citation_signature","submit_replication":"https://pith.science/pith/7RIHPPYKTKKHSX5A7EDQC6BMPP/action/replication_record"}},"created_at":"2026-05-18T02:44:57.223235+00:00","updated_at":"2026-05-18T02:44:57.223235+00:00"}