{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:47KRANT5YZJ7O2KWUVL62MEKWQ","short_pith_number":"pith:47KRANT5","schema_version":"1.0","canonical_sha256":"e7d510367dc653f76956a557ed308ab436a539bc8870601e696e73e7ac0bb43a","source":{"kind":"arxiv","id":"1701.08373","version":1},"attestation_state":"computed","paper":{"title":"Integer-Forcing Message Recovering in Interference Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Behrooz Makki, Masoumeh Nasiri-Kenari, Mohsen Hejazi, Seyed Mohammad Azimi-Abarghouyi, Tommy Svensson","submitted_at":"2017-01-29T13:12:08Z","abstract_excerpt":"In this paper, we propose a scheme referred to as integer-forcing message recovering (IFMR) to enable receivers to recover their desirable messages in interference channels. Compared to the state-of-the- art integer-forcing linear receiver (IFLR), our proposed IFMR approach needs to decode considerably less number of messages. In our method, each receiver recovers independent linear integer combinations of the desirable messages each from two independent equations. We propose an efficient algorithm to sequentially find the equations and integer combinations with maximum rates. We evaluate the "},"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":"1701.08373","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-29T13:12:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"db75b7505dcc9c4c73a65e5ad15ccad300a1815c550d41a09a30ee3602a3237e","abstract_canon_sha256":"0ec7c7d943388c34ed5bfc99556a284b57ebc8fda5af24a56731a31524e3d77b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:54.367165Z","signature_b64":"YDfYsg6hE11KxQmztuUdq669dgDWoVrOgOZPg/aEeBCxHmy2/bgQv/ulg3+O4chp4qVF1vzXmESMtCRZ0+i4Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7d510367dc653f76956a557ed308ab436a539bc8870601e696e73e7ac0bb43a","last_reissued_at":"2026-05-18T00:51:54.366473Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:54.366473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Integer-Forcing Message Recovering in Interference Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Behrooz Makki, Masoumeh Nasiri-Kenari, Mohsen Hejazi, Seyed Mohammad Azimi-Abarghouyi, Tommy Svensson","submitted_at":"2017-01-29T13:12:08Z","abstract_excerpt":"In this paper, we propose a scheme referred to as integer-forcing message recovering (IFMR) to enable receivers to recover their desirable messages in interference channels. Compared to the state-of-the- art integer-forcing linear receiver (IFLR), our proposed IFMR approach needs to decode considerably less number of messages. In our method, each receiver recovers independent linear integer combinations of the desirable messages each from two independent equations. We propose an efficient algorithm to sequentially find the equations and integer combinations with maximum rates. We evaluate the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08373","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":"1701.08373","created_at":"2026-05-18T00:51:54.366585+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.08373v1","created_at":"2026-05-18T00:51:54.366585+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08373","created_at":"2026-05-18T00:51:54.366585+00:00"},{"alias_kind":"pith_short_12","alias_value":"47KRANT5YZJ7","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"47KRANT5YZJ7O2KW","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"47KRANT5","created_at":"2026-05-18T12:30:58.224056+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/47KRANT5YZJ7O2KWUVL62MEKWQ","json":"https://pith.science/pith/47KRANT5YZJ7O2KWUVL62MEKWQ.json","graph_json":"https://pith.science/api/pith-number/47KRANT5YZJ7O2KWUVL62MEKWQ/graph.json","events_json":"https://pith.science/api/pith-number/47KRANT5YZJ7O2KWUVL62MEKWQ/events.json","paper":"https://pith.science/paper/47KRANT5"},"agent_actions":{"view_html":"https://pith.science/pith/47KRANT5YZJ7O2KWUVL62MEKWQ","download_json":"https://pith.science/pith/47KRANT5YZJ7O2KWUVL62MEKWQ.json","view_paper":"https://pith.science/paper/47KRANT5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.08373&json=true","fetch_graph":"https://pith.science/api/pith-number/47KRANT5YZJ7O2KWUVL62MEKWQ/graph.json","fetch_events":"https://pith.science/api/pith-number/47KRANT5YZJ7O2KWUVL62MEKWQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/47KRANT5YZJ7O2KWUVL62MEKWQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/47KRANT5YZJ7O2KWUVL62MEKWQ/action/storage_attestation","attest_author":"https://pith.science/pith/47KRANT5YZJ7O2KWUVL62MEKWQ/action/author_attestation","sign_citation":"https://pith.science/pith/47KRANT5YZJ7O2KWUVL62MEKWQ/action/citation_signature","submit_replication":"https://pith.science/pith/47KRANT5YZJ7O2KWUVL62MEKWQ/action/replication_record"}},"created_at":"2026-05-18T00:51:54.366585+00:00","updated_at":"2026-05-18T00:51:54.366585+00:00"}