{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2M46AH4O3FB7N5QC4GF4E2AHT7","short_pith_number":"pith:2M46AH4O","schema_version":"1.0","canonical_sha256":"d339e01f8ed943f6f602e18bc268079fc5b43316012a4242a7e98659f0199761","source":{"kind":"arxiv","id":"1309.1200","version":2},"attestation_state":"computed","paper":{"title":"Cooperative Access in Cognitive Radio Networks: Stable Throughput and Delay Tradeoffs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Amr A. El-Sherif, Amr Mohamed, Mahmoud Ashour, Tamer ElBatt","submitted_at":"2013-09-04T22:32:58Z","abstract_excerpt":"In this paper, we study and analyze fundamental throughput-delay tradeoffs in cooperative multiple access for cognitive radio systems. We focus on the class of randomized cooperative policies, whereby the secondary user (SU) serves either the queue of its own data or the queue of the primary user (PU) relayed data with certain service probabilities. The proposed policy opens room for trading the PU delay for enhanced SU delay. Towards this objective, stability conditions for the queues involved in the system are derived. Furthermore, a moment generating function approach is employed to derive "},"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":"1309.1200","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-09-04T22:32:58Z","cross_cats_sorted":[],"title_canon_sha256":"b4cedd29f6e3f426b15d5044f94b576c3558d2fb4febf12ca7065306e684885b","abstract_canon_sha256":"9029e938c6dc40ec6c6350152be9db1a9664e8d9ad66976767ca8465b77b069f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:16.900491Z","signature_b64":"UFjSSXqlNOMAQKDTLJLij7y0O1HJEnp4BAEaQUmQVlQlNCQkiUPIEullVo2UBYzMGhBKLoJm2uyGe13P3+MTCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d339e01f8ed943f6f602e18bc268079fc5b43316012a4242a7e98659f0199761","last_reissued_at":"2026-05-18T00:58:16.899830Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:16.899830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cooperative Access in Cognitive Radio Networks: Stable Throughput and Delay Tradeoffs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Amr A. El-Sherif, Amr Mohamed, Mahmoud Ashour, Tamer ElBatt","submitted_at":"2013-09-04T22:32:58Z","abstract_excerpt":"In this paper, we study and analyze fundamental throughput-delay tradeoffs in cooperative multiple access for cognitive radio systems. We focus on the class of randomized cooperative policies, whereby the secondary user (SU) serves either the queue of its own data or the queue of the primary user (PU) relayed data with certain service probabilities. The proposed policy opens room for trading the PU delay for enhanced SU delay. Towards this objective, stability conditions for the queues involved in the system are derived. Furthermore, a moment generating function approach is employed to derive "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1200","kind":"arxiv","version":2},"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":"1309.1200","created_at":"2026-05-18T00:58:16.899951+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.1200v2","created_at":"2026-05-18T00:58:16.899951+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1200","created_at":"2026-05-18T00:58:16.899951+00:00"},{"alias_kind":"pith_short_12","alias_value":"2M46AH4O3FB7","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"2M46AH4O3FB7N5QC","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"2M46AH4O","created_at":"2026-05-18T12:27:30.460161+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/2M46AH4O3FB7N5QC4GF4E2AHT7","json":"https://pith.science/pith/2M46AH4O3FB7N5QC4GF4E2AHT7.json","graph_json":"https://pith.science/api/pith-number/2M46AH4O3FB7N5QC4GF4E2AHT7/graph.json","events_json":"https://pith.science/api/pith-number/2M46AH4O3FB7N5QC4GF4E2AHT7/events.json","paper":"https://pith.science/paper/2M46AH4O"},"agent_actions":{"view_html":"https://pith.science/pith/2M46AH4O3FB7N5QC4GF4E2AHT7","download_json":"https://pith.science/pith/2M46AH4O3FB7N5QC4GF4E2AHT7.json","view_paper":"https://pith.science/paper/2M46AH4O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.1200&json=true","fetch_graph":"https://pith.science/api/pith-number/2M46AH4O3FB7N5QC4GF4E2AHT7/graph.json","fetch_events":"https://pith.science/api/pith-number/2M46AH4O3FB7N5QC4GF4E2AHT7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2M46AH4O3FB7N5QC4GF4E2AHT7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2M46AH4O3FB7N5QC4GF4E2AHT7/action/storage_attestation","attest_author":"https://pith.science/pith/2M46AH4O3FB7N5QC4GF4E2AHT7/action/author_attestation","sign_citation":"https://pith.science/pith/2M46AH4O3FB7N5QC4GF4E2AHT7/action/citation_signature","submit_replication":"https://pith.science/pith/2M46AH4O3FB7N5QC4GF4E2AHT7/action/replication_record"}},"created_at":"2026-05-18T00:58:16.899951+00:00","updated_at":"2026-05-18T00:58:16.899951+00:00"}