{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JFMAC3OVDJ3VUJQJ5KNRCPQ2MY","short_pith_number":"pith:JFMAC3OV","canonical_record":{"source":{"id":"1404.6112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-24T13:10:05Z","cross_cats_sorted":[],"title_canon_sha256":"f5b3cde14d8c21934abc8fb9f38d05004de4df3d6a8943d0467fb0d6ace07d24","abstract_canon_sha256":"b5901e12254cb731d6ea8300a9dac1863c007f3946b6cff1a95106eeec280e71"},"schema_version":"1.0"},"canonical_sha256":"4958016dd51a775a2609ea9b113e1a6620b2afd02fc69ab29ebfc95c042c43ff","source":{"kind":"arxiv","id":"1404.6112","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6112","created_at":"2026-05-18T02:53:18Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6112v1","created_at":"2026-05-18T02:53:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6112","created_at":"2026-05-18T02:53:18Z"},{"alias_kind":"pith_short_12","alias_value":"JFMAC3OVDJ3V","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JFMAC3OVDJ3VUJQJ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JFMAC3OV","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JFMAC3OVDJ3VUJQJ5KNRCPQ2MY","target":"record","payload":{"canonical_record":{"source":{"id":"1404.6112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-24T13:10:05Z","cross_cats_sorted":[],"title_canon_sha256":"f5b3cde14d8c21934abc8fb9f38d05004de4df3d6a8943d0467fb0d6ace07d24","abstract_canon_sha256":"b5901e12254cb731d6ea8300a9dac1863c007f3946b6cff1a95106eeec280e71"},"schema_version":"1.0"},"canonical_sha256":"4958016dd51a775a2609ea9b113e1a6620b2afd02fc69ab29ebfc95c042c43ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:18.326722Z","signature_b64":"wxRFp2ZKsmn3tpPloelB0Yzrp5dY3izJnG6dd4Op1nnucX8I/Cu0lkABgiGbt7MUwRU8ApLOUq7UNN3Tb5oxDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4958016dd51a775a2609ea9b113e1a6620b2afd02fc69ab29ebfc95c042c43ff","last_reissued_at":"2026-05-18T02:53:18.326146Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:18.326146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.6112","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:53:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s70Lmvv+QTRPFTkuJLyUhYPNRtFAvZWcxEciFMj9r/VeemVVjMwDdY6gHGK4xcgInTJbJX13UW78COW9WakSCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:26:40.091294Z"},"content_sha256":"fb21b445611b7b146c12a154f054e165e58bde2a07eb98e45a83055ef6e88c4d","schema_version":"1.0","event_id":"sha256:fb21b445611b7b146c12a154f054e165e58bde2a07eb98e45a83055ef6e88c4d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JFMAC3OVDJ3VUJQJ5KNRCPQ2MY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cognitive Radio Networks with Probabilistic Relaying: 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":"2014-04-24T13:10:05Z","abstract_excerpt":"In this paper, we study and analyze fundamental throughput and 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. Moreover, admission control is introduced at the relay queue, whereby a PU's packet is admitted to the relay queue with an admission probability. The proposed policy introduces a fundamental tradeoff between the delays of the PU and SU. Consequ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6112","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:53:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E8RK07gVXvdLDvmFTRXBUVCSv6hX1n01k2t4xnQzRlBFXx0oTqP8O0OjEzJ0o0sNsROSBpK4weCzzKMutv/SCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:26:40.092018Z"},"content_sha256":"ede790c40d29d852fc4902fec261f27803f04ef32952c0cd7a13700a6c2fc17c","schema_version":"1.0","event_id":"sha256:ede790c40d29d852fc4902fec261f27803f04ef32952c0cd7a13700a6c2fc17c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JFMAC3OVDJ3VUJQJ5KNRCPQ2MY/bundle.json","state_url":"https://pith.science/pith/JFMAC3OVDJ3VUJQJ5KNRCPQ2MY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JFMAC3OVDJ3VUJQJ5KNRCPQ2MY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T13:26:40Z","links":{"resolver":"https://pith.science/pith/JFMAC3OVDJ3VUJQJ5KNRCPQ2MY","bundle":"https://pith.science/pith/JFMAC3OVDJ3VUJQJ5KNRCPQ2MY/bundle.json","state":"https://pith.science/pith/JFMAC3OVDJ3VUJQJ5KNRCPQ2MY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JFMAC3OVDJ3VUJQJ5KNRCPQ2MY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JFMAC3OVDJ3VUJQJ5KNRCPQ2MY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b5901e12254cb731d6ea8300a9dac1863c007f3946b6cff1a95106eeec280e71","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-24T13:10:05Z","title_canon_sha256":"f5b3cde14d8c21934abc8fb9f38d05004de4df3d6a8943d0467fb0d6ace07d24"},"schema_version":"1.0","source":{"id":"1404.6112","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6112","created_at":"2026-05-18T02:53:18Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6112v1","created_at":"2026-05-18T02:53:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6112","created_at":"2026-05-18T02:53:18Z"},{"alias_kind":"pith_short_12","alias_value":"JFMAC3OVDJ3V","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JFMAC3OVDJ3VUJQJ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JFMAC3OV","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:ede790c40d29d852fc4902fec261f27803f04ef32952c0cd7a13700a6c2fc17c","target":"graph","created_at":"2026-05-18T02:53:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper, we study and analyze fundamental throughput and 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. Moreover, admission control is introduced at the relay queue, whereby a PU's packet is admitted to the relay queue with an admission probability. The proposed policy introduces a fundamental tradeoff between the delays of the PU and SU. Consequ","authors_text":"Amr A. El-Sherif, Amr Mohamed, Mahmoud Ashour, Tamer ElBatt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-24T13:10:05Z","title":"Cognitive Radio Networks with Probabilistic Relaying: Stable Throughput and Delay Tradeoffs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6112","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fb21b445611b7b146c12a154f054e165e58bde2a07eb98e45a83055ef6e88c4d","target":"record","created_at":"2026-05-18T02:53:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b5901e12254cb731d6ea8300a9dac1863c007f3946b6cff1a95106eeec280e71","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-04-24T13:10:05Z","title_canon_sha256":"f5b3cde14d8c21934abc8fb9f38d05004de4df3d6a8943d0467fb0d6ace07d24"},"schema_version":"1.0","source":{"id":"1404.6112","kind":"arxiv","version":1}},"canonical_sha256":"4958016dd51a775a2609ea9b113e1a6620b2afd02fc69ab29ebfc95c042c43ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4958016dd51a775a2609ea9b113e1a6620b2afd02fc69ab29ebfc95c042c43ff","first_computed_at":"2026-05-18T02:53:18.326146Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:18.326146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wxRFp2ZKsmn3tpPloelB0Yzrp5dY3izJnG6dd4Op1nnucX8I/Cu0lkABgiGbt7MUwRU8ApLOUq7UNN3Tb5oxDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:18.326722Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.6112","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb21b445611b7b146c12a154f054e165e58bde2a07eb98e45a83055ef6e88c4d","sha256:ede790c40d29d852fc4902fec261f27803f04ef32952c0cd7a13700a6c2fc17c"],"state_sha256":"fd3c53a64663b093976e5f70e6c3b7dca3b8d05de6a5001cc9e3624fa01cb0a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HHQy4WMb/h4fgdsljYGZR4RLhrcP2K9vInM/iQMreQ+EBG3nWXPLaknv4yaET0K79WuG/G3zXgq9l8MUza5UBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T13:26:40.095578Z","bundle_sha256":"9c7c7c266927d855934e13713dba7a7b92178fecbf0f5074be3b587ebde85768"}}