{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WKHFBOODRFII5BWDAPOSSBXXN2","short_pith_number":"pith:WKHFBOOD","schema_version":"1.0","canonical_sha256":"b28e50b9c389508e86c303dd2906f76e9d638e3cef15fdd7f4053923d6502836","source":{"kind":"arxiv","id":"1801.03259","version":6},"attestation_state":"computed","paper":{"title":"Asymptotically Optimal Scheduling for Compute-and-Forward","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Asaf Cohen, Omer Gurewitz, Ori Shmuel","submitted_at":"2018-01-10T08:03:28Z","abstract_excerpt":"Consider a Compute and Forward (CF) relay network with $L$ users and a single relay. The relay tries to decode a linear function of the transmitted signals. For such a network, letting all $L$ users transmit simultaneously, especially when $L$ is large, causes a significant degradation in the rate in which the relay is able to decode. In fact, the rate goes to zero very fast with $L$. Therefore, in each transmission phase only a fixed number of users should transmit, i.e., users should be scheduled.\n  In this work, we examine the problem of scheduling for CF and lay the foundations for identif"},"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":"1801.03259","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-10T08:03:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"59f86fa3fe83ff5a56a34dd2487fc3b02e404ebbd34f4ae4815e0dd5a3ec63f3","abstract_canon_sha256":"052a2f3217a7dce7369527c940370b495c91b1050ddc5f63a380e241b3f19be1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:30.255587Z","signature_b64":"3iTQWXsH0ZSbdKXfbJOk1iM/tREuvbQEHHQnedKkoSZTxT76MlT4lUSH5G2g76jT03P1Wf2WmC5gbPRPmTTnBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b28e50b9c389508e86c303dd2906f76e9d638e3cef15fdd7f4053923d6502836","last_reissued_at":"2026-05-18T00:01:30.255104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:30.255104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotically Optimal Scheduling for Compute-and-Forward","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Asaf Cohen, Omer Gurewitz, Ori Shmuel","submitted_at":"2018-01-10T08:03:28Z","abstract_excerpt":"Consider a Compute and Forward (CF) relay network with $L$ users and a single relay. The relay tries to decode a linear function of the transmitted signals. For such a network, letting all $L$ users transmit simultaneously, especially when $L$ is large, causes a significant degradation in the rate in which the relay is able to decode. In fact, the rate goes to zero very fast with $L$. Therefore, in each transmission phase only a fixed number of users should transmit, i.e., users should be scheduled.\n  In this work, we examine the problem of scheduling for CF and lay the foundations for identif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03259","kind":"arxiv","version":6},"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":"1801.03259","created_at":"2026-05-18T00:01:30.255179+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.03259v6","created_at":"2026-05-18T00:01:30.255179+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03259","created_at":"2026-05-18T00:01:30.255179+00:00"},{"alias_kind":"pith_short_12","alias_value":"WKHFBOODRFII","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"WKHFBOODRFII5BWD","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"WKHFBOOD","created_at":"2026-05-18T12:32:59.047623+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/WKHFBOODRFII5BWDAPOSSBXXN2","json":"https://pith.science/pith/WKHFBOODRFII5BWDAPOSSBXXN2.json","graph_json":"https://pith.science/api/pith-number/WKHFBOODRFII5BWDAPOSSBXXN2/graph.json","events_json":"https://pith.science/api/pith-number/WKHFBOODRFII5BWDAPOSSBXXN2/events.json","paper":"https://pith.science/paper/WKHFBOOD"},"agent_actions":{"view_html":"https://pith.science/pith/WKHFBOODRFII5BWDAPOSSBXXN2","download_json":"https://pith.science/pith/WKHFBOODRFII5BWDAPOSSBXXN2.json","view_paper":"https://pith.science/paper/WKHFBOOD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.03259&json=true","fetch_graph":"https://pith.science/api/pith-number/WKHFBOODRFII5BWDAPOSSBXXN2/graph.json","fetch_events":"https://pith.science/api/pith-number/WKHFBOODRFII5BWDAPOSSBXXN2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WKHFBOODRFII5BWDAPOSSBXXN2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WKHFBOODRFII5BWDAPOSSBXXN2/action/storage_attestation","attest_author":"https://pith.science/pith/WKHFBOODRFII5BWDAPOSSBXXN2/action/author_attestation","sign_citation":"https://pith.science/pith/WKHFBOODRFII5BWDAPOSSBXXN2/action/citation_signature","submit_replication":"https://pith.science/pith/WKHFBOODRFII5BWDAPOSSBXXN2/action/replication_record"}},"created_at":"2026-05-18T00:01:30.255179+00:00","updated_at":"2026-05-18T00:01:30.255179+00:00"}