{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:443OXKYA6VRG4KFNXM23CA6SK7","short_pith_number":"pith:443OXKYA","canonical_record":{"source":{"id":"1410.2419","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-10-09T10:45:28Z","cross_cats_sorted":[],"title_canon_sha256":"803312865b88812908d2be58795a85745f5a4637181da8754a18fc43562a2179","abstract_canon_sha256":"1d46cce148f82d10d675c0feb187b9eb035201ff1de032432a3a29429cd0cc03"},"schema_version":"1.0"},"canonical_sha256":"e736ebab00f5626e28adbb35b103d257f79cf2a37b79301626f0b7cae0d5839b","source":{"kind":"arxiv","id":"1410.2419","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.2419","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"arxiv_version","alias_value":"1410.2419v1","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2419","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"pith_short_12","alias_value":"443OXKYA6VRG","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"443OXKYA6VRG4KFN","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"443OXKYA","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:443OXKYA6VRG4KFNXM23CA6SK7","target":"record","payload":{"canonical_record":{"source":{"id":"1410.2419","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-10-09T10:45:28Z","cross_cats_sorted":[],"title_canon_sha256":"803312865b88812908d2be58795a85745f5a4637181da8754a18fc43562a2179","abstract_canon_sha256":"1d46cce148f82d10d675c0feb187b9eb035201ff1de032432a3a29429cd0cc03"},"schema_version":"1.0"},"canonical_sha256":"e736ebab00f5626e28adbb35b103d257f79cf2a37b79301626f0b7cae0d5839b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:11.388824Z","signature_b64":"aTTrkh6sDKLINSGRngs2qoeshz4uG2WaLvPXSG1+g72MuFDIdzUH4L4AtlNTNAkGt0OZbYXkzQgh54WJ1ipJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e736ebab00f5626e28adbb35b103d257f79cf2a37b79301626f0b7cae0d5839b","last_reissued_at":"2026-05-18T00:58:11.388211Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:11.388211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.2419","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-18T00:58:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dUfKwvcqdn+4TP/OLYzgqTYts8mPlOQAEt3GqhRjESFkYV/W3gET+xQCPogUunwU2OO3oAvNX6Lp4HcYCO6nBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:49:25.681416Z"},"content_sha256":"312336fb37ccaa5ad25778d761e8ec58348bb66384d4e7612dabe316c4447e65","schema_version":"1.0","event_id":"sha256:312336fb37ccaa5ad25778d761e8ec58348bb66384d4e7612dabe316c4447e65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:443OXKYA6VRG4KFNXM23CA6SK7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Stable Throughput of Cooperative Cognitive Radio Networks with Finite Relaying Buffer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Adel M. Elmahdy, Amr El-Keyi, Karim G. Seddik, Tamer ElBatt","submitted_at":"2014-10-09T10:45:28Z","abstract_excerpt":"In this paper, we study the problem of cooperative communications in cognitive radio systems where the secondary user has limited relaying room for the overheard primary packets. More specifically, we characterize the stable throughput region of a cognitive radio network with a finite relaying buffer at the secondary user. Towards this objective, we formulate a constrained optimization problem for maximizing the secondary user throughput while guaranteeing the stability of the primary user queue. We consider a general cooperation policy where the packet admission and queue selection probabilit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2419","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-18T00:58:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6G1QQADSL1nI69DiO/1weYOZSJqVRHKKEluLhQSbClmipEelbLGmZpl9asLEZcMhogzmCadUDXudO0MA7xLbDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:49:25.681779Z"},"content_sha256":"b469d09aa5b9ae8a4f0d8219de4c89ce9ecbd4fd7b6888bdcb2e858d409a293c","schema_version":"1.0","event_id":"sha256:b469d09aa5b9ae8a4f0d8219de4c89ce9ecbd4fd7b6888bdcb2e858d409a293c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/443OXKYA6VRG4KFNXM23CA6SK7/bundle.json","state_url":"https://pith.science/pith/443OXKYA6VRG4KFNXM23CA6SK7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/443OXKYA6VRG4KFNXM23CA6SK7/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-06-10T21:49:25Z","links":{"resolver":"https://pith.science/pith/443OXKYA6VRG4KFNXM23CA6SK7","bundle":"https://pith.science/pith/443OXKYA6VRG4KFNXM23CA6SK7/bundle.json","state":"https://pith.science/pith/443OXKYA6VRG4KFNXM23CA6SK7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/443OXKYA6VRG4KFNXM23CA6SK7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:443OXKYA6VRG4KFNXM23CA6SK7","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":"1d46cce148f82d10d675c0feb187b9eb035201ff1de032432a3a29429cd0cc03","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-10-09T10:45:28Z","title_canon_sha256":"803312865b88812908d2be58795a85745f5a4637181da8754a18fc43562a2179"},"schema_version":"1.0","source":{"id":"1410.2419","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.2419","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"arxiv_version","alias_value":"1410.2419v1","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2419","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"pith_short_12","alias_value":"443OXKYA6VRG","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"443OXKYA6VRG4KFN","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"443OXKYA","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:b469d09aa5b9ae8a4f0d8219de4c89ce9ecbd4fd7b6888bdcb2e858d409a293c","target":"graph","created_at":"2026-05-18T00:58:11Z","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 the problem of cooperative communications in cognitive radio systems where the secondary user has limited relaying room for the overheard primary packets. More specifically, we characterize the stable throughput region of a cognitive radio network with a finite relaying buffer at the secondary user. Towards this objective, we formulate a constrained optimization problem for maximizing the secondary user throughput while guaranteeing the stability of the primary user queue. We consider a general cooperation policy where the packet admission and queue selection probabilit","authors_text":"Adel M. Elmahdy, Amr El-Keyi, Karim G. Seddik, Tamer ElBatt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-10-09T10:45:28Z","title":"On the Stable Throughput of Cooperative Cognitive Radio Networks with Finite Relaying Buffer"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2419","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:312336fb37ccaa5ad25778d761e8ec58348bb66384d4e7612dabe316c4447e65","target":"record","created_at":"2026-05-18T00:58:11Z","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":"1d46cce148f82d10d675c0feb187b9eb035201ff1de032432a3a29429cd0cc03","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-10-09T10:45:28Z","title_canon_sha256":"803312865b88812908d2be58795a85745f5a4637181da8754a18fc43562a2179"},"schema_version":"1.0","source":{"id":"1410.2419","kind":"arxiv","version":1}},"canonical_sha256":"e736ebab00f5626e28adbb35b103d257f79cf2a37b79301626f0b7cae0d5839b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e736ebab00f5626e28adbb35b103d257f79cf2a37b79301626f0b7cae0d5839b","first_computed_at":"2026-05-18T00:58:11.388211Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:11.388211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aTTrkh6sDKLINSGRngs2qoeshz4uG2WaLvPXSG1+g72MuFDIdzUH4L4AtlNTNAkGt0OZbYXkzQgh54WJ1ipJCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:11.388824Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.2419","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:312336fb37ccaa5ad25778d761e8ec58348bb66384d4e7612dabe316c4447e65","sha256:b469d09aa5b9ae8a4f0d8219de4c89ce9ecbd4fd7b6888bdcb2e858d409a293c"],"state_sha256":"3b60d7a350a3c579018dcaf6262a99bd7bc48dffa0f2a0990d0f6768f59cbc91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YK3h4qyJWR1juye+vNgXWXyc9onS33WZJvnp3JMcpwOJ6q/zaNAuJ5KiQr9fJjh+dImY+mTJDPzPqGdyEtGFBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T21:49:25.683803Z","bundle_sha256":"cfd34f1e655a3040d1645b5bd01a1b27c8e4675bff9b8d4f7ffb72537b989407"}}