{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SABJWKTSU2NZFWUQTWENRP4KAS","short_pith_number":"pith:SABJWKTS","schema_version":"1.0","canonical_sha256":"90029b2a72a69b92da909d88d8bf8a0494b32ff7f8b975a4ad9c45814cb87d0c","source":{"kind":"arxiv","id":"1601.01488","version":1},"attestation_state":"computed","paper":{"title":"Robust Successive Compute-and-Forward over Multi-User Multi-Relay Networks","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":"2016-01-07T11:19:07Z","abstract_excerpt":"This paper develops efficient Compute-and-forward (CMF) schemes in multi-user multi-relay networks. To solve the rank failure problem in CMF setups and to achieve full diversity of the network, we introduce two novel CMF methods, namely, extended CMF and successive CMF. The former, having low complexity, is based on recovering multiple equations at relays. The latter utilizes successive interference cancellation (SIC) to enhance the system performance compared to the state-of-the-art schemes. Both methods can be utilized in a network with different number of users, relays, and relay antennas, "},"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":"1601.01488","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-07T11:19:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3aee2dd20b54e88cff2fc377f3e63fa9d09c35daffb5cbc97d1efcb347ca1d29","abstract_canon_sha256":"5d604b99fdc1ebd279f6ee31edce57acb05153868730cdcd3fdb4a50c303f64f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:13.510084Z","signature_b64":"fg+B+0smotluk0Oqm0YfuzXsp3VEek1sD2Y1kqSjTkdFVyxdRSVIxeNeMm90lLWRkJlyTpJ3Lc9yOkjUjC9lCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90029b2a72a69b92da909d88d8bf8a0494b32ff7f8b975a4ad9c45814cb87d0c","last_reissued_at":"2026-05-18T01:23:13.509403Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:13.509403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Successive Compute-and-Forward over Multi-User Multi-Relay Networks","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":"2016-01-07T11:19:07Z","abstract_excerpt":"This paper develops efficient Compute-and-forward (CMF) schemes in multi-user multi-relay networks. To solve the rank failure problem in CMF setups and to achieve full diversity of the network, we introduce two novel CMF methods, namely, extended CMF and successive CMF. The former, having low complexity, is based on recovering multiple equations at relays. The latter utilizes successive interference cancellation (SIC) to enhance the system performance compared to the state-of-the-art schemes. Both methods can be utilized in a network with different number of users, relays, and relay antennas, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01488","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":"1601.01488","created_at":"2026-05-18T01:23:13.509505+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.01488v1","created_at":"2026-05-18T01:23:13.509505+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01488","created_at":"2026-05-18T01:23:13.509505+00:00"},{"alias_kind":"pith_short_12","alias_value":"SABJWKTSU2NZ","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SABJWKTSU2NZFWUQ","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SABJWKTS","created_at":"2026-05-18T12:30:44.179134+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/SABJWKTSU2NZFWUQTWENRP4KAS","json":"https://pith.science/pith/SABJWKTSU2NZFWUQTWENRP4KAS.json","graph_json":"https://pith.science/api/pith-number/SABJWKTSU2NZFWUQTWENRP4KAS/graph.json","events_json":"https://pith.science/api/pith-number/SABJWKTSU2NZFWUQTWENRP4KAS/events.json","paper":"https://pith.science/paper/SABJWKTS"},"agent_actions":{"view_html":"https://pith.science/pith/SABJWKTSU2NZFWUQTWENRP4KAS","download_json":"https://pith.science/pith/SABJWKTSU2NZFWUQTWENRP4KAS.json","view_paper":"https://pith.science/paper/SABJWKTS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.01488&json=true","fetch_graph":"https://pith.science/api/pith-number/SABJWKTSU2NZFWUQTWENRP4KAS/graph.json","fetch_events":"https://pith.science/api/pith-number/SABJWKTSU2NZFWUQTWENRP4KAS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SABJWKTSU2NZFWUQTWENRP4KAS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SABJWKTSU2NZFWUQTWENRP4KAS/action/storage_attestation","attest_author":"https://pith.science/pith/SABJWKTSU2NZFWUQTWENRP4KAS/action/author_attestation","sign_citation":"https://pith.science/pith/SABJWKTSU2NZFWUQTWENRP4KAS/action/citation_signature","submit_replication":"https://pith.science/pith/SABJWKTSU2NZFWUQTWENRP4KAS/action/replication_record"}},"created_at":"2026-05-18T01:23:13.509505+00:00","updated_at":"2026-05-18T01:23:13.509505+00:00"}