{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FL7VHTQV25Q3PZOIBCKIE3FFG3","short_pith_number":"pith:FL7VHTQV","canonical_record":{"source":{"id":"1404.1113","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-03T22:41:43Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"14574c5d2d5a347e4338ea83a42ec0b377dea7a4b909dd423289767a02f0bd30","abstract_canon_sha256":"f0d055619cb65532f55e5a5123683e4dc549f2998846e7f728dd388620550343"},"schema_version":"1.0"},"canonical_sha256":"2aff53ce15d761b7e5c80894826ca536c4cf74221e12dd1c730ccaa47daa63ae","source":{"kind":"arxiv","id":"1404.1113","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1113","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1113v3","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1113","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"pith_short_12","alias_value":"FL7VHTQV25Q3","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FL7VHTQV25Q3PZOI","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FL7VHTQV","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FL7VHTQV25Q3PZOIBCKIE3FFG3","target":"record","payload":{"canonical_record":{"source":{"id":"1404.1113","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-03T22:41:43Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"14574c5d2d5a347e4338ea83a42ec0b377dea7a4b909dd423289767a02f0bd30","abstract_canon_sha256":"f0d055619cb65532f55e5a5123683e4dc549f2998846e7f728dd388620550343"},"schema_version":"1.0"},"canonical_sha256":"2aff53ce15d761b7e5c80894826ca536c4cf74221e12dd1c730ccaa47daa63ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:02.781709Z","signature_b64":"KZ3+sTeKXnvqoRt2z/o6z5Lv4wYGrlNqURDXO+V3EZm2Ht2yWMqYtHkAy35Q8UYzvIcWyDOgKSQIifbsktitDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2aff53ce15d761b7e5c80894826ca536c4cf74221e12dd1c730ccaa47daa63ae","last_reissued_at":"2026-05-18T02:48:02.781082Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:02.781082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.1113","source_version":3,"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:48:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HLau35iFquVHGDtnBqv1zufPjgUxWzn44TfMeCkuPaqN0evn5uXRzXXRfps6giX0A/6KJldRJ3XEq8VPFEDKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:43:03.803871Z"},"content_sha256":"1fe19f9366bb4976c0e7778b9eae74cd7791a70464410c1aa188fe648717fcfb","schema_version":"1.0","event_id":"sha256:1fe19f9366bb4976c0e7778b9eae74cd7791a70464410c1aa188fe648717fcfb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FL7VHTQV25Q3PZOIBCKIE3FFG3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interference-Based Optimal Power-Efficient Access Scheme for Cognitive Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed El Shafie, Ahmed H. Anwar, Amr Mohamed, Mohsen Guizani, Tamer ElBatt","submitted_at":"2014-04-03T22:41:43Z","abstract_excerpt":"In this paper, we propose a new optimization-based access strategy of multipacket reception (MPR) channel for multiple secondary users (SUs) accessing the primary user (PU) spectrum opportunistically. We devise an analytical model that realizes the multipacket access strategy of SUs that maximizes the throughput of individual backlogged SUs subject to queue stability of the PU. All the network receiving nodes have MPR capability. We aim at maximizing the throughput of the individual SUs such that the PU's queue is maintained stable. Moreover, we are interested in providing an energy-efficient "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1113","kind":"arxiv","version":3},"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:48:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l03CX5iVDzCmsZqcjZcwSqLsOKu6XBVg189bksMZZPfE9ypefUIjCfH6auQF8eGyPFLMk0SxqagaV4QP7oJSBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:43:03.804519Z"},"content_sha256":"0326e2e6509ce13a160ba6a83bddb298190afcff79b207f1c694450ecb4f4c4b","schema_version":"1.0","event_id":"sha256:0326e2e6509ce13a160ba6a83bddb298190afcff79b207f1c694450ecb4f4c4b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FL7VHTQV25Q3PZOIBCKIE3FFG3/bundle.json","state_url":"https://pith.science/pith/FL7VHTQV25Q3PZOIBCKIE3FFG3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FL7VHTQV25Q3PZOIBCKIE3FFG3/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-25T16:43:03Z","links":{"resolver":"https://pith.science/pith/FL7VHTQV25Q3PZOIBCKIE3FFG3","bundle":"https://pith.science/pith/FL7VHTQV25Q3PZOIBCKIE3FFG3/bundle.json","state":"https://pith.science/pith/FL7VHTQV25Q3PZOIBCKIE3FFG3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FL7VHTQV25Q3PZOIBCKIE3FFG3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FL7VHTQV25Q3PZOIBCKIE3FFG3","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":"f0d055619cb65532f55e5a5123683e4dc549f2998846e7f728dd388620550343","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-03T22:41:43Z","title_canon_sha256":"14574c5d2d5a347e4338ea83a42ec0b377dea7a4b909dd423289767a02f0bd30"},"schema_version":"1.0","source":{"id":"1404.1113","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1113","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1113v3","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1113","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"pith_short_12","alias_value":"FL7VHTQV25Q3","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FL7VHTQV25Q3PZOI","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FL7VHTQV","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:0326e2e6509ce13a160ba6a83bddb298190afcff79b207f1c694450ecb4f4c4b","target":"graph","created_at":"2026-05-18T02:48:02Z","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 propose a new optimization-based access strategy of multipacket reception (MPR) channel for multiple secondary users (SUs) accessing the primary user (PU) spectrum opportunistically. We devise an analytical model that realizes the multipacket access strategy of SUs that maximizes the throughput of individual backlogged SUs subject to queue stability of the PU. All the network receiving nodes have MPR capability. We aim at maximizing the throughput of the individual SUs such that the PU's queue is maintained stable. Moreover, we are interested in providing an energy-efficient ","authors_text":"Ahmed El Shafie, Ahmed H. Anwar, Amr Mohamed, Mohsen Guizani, Tamer ElBatt","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-03T22:41:43Z","title":"Interference-Based Optimal Power-Efficient Access Scheme for Cognitive Radio Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1113","kind":"arxiv","version":3},"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:1fe19f9366bb4976c0e7778b9eae74cd7791a70464410c1aa188fe648717fcfb","target":"record","created_at":"2026-05-18T02:48:02Z","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":"f0d055619cb65532f55e5a5123683e4dc549f2998846e7f728dd388620550343","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-03T22:41:43Z","title_canon_sha256":"14574c5d2d5a347e4338ea83a42ec0b377dea7a4b909dd423289767a02f0bd30"},"schema_version":"1.0","source":{"id":"1404.1113","kind":"arxiv","version":3}},"canonical_sha256":"2aff53ce15d761b7e5c80894826ca536c4cf74221e12dd1c730ccaa47daa63ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2aff53ce15d761b7e5c80894826ca536c4cf74221e12dd1c730ccaa47daa63ae","first_computed_at":"2026-05-18T02:48:02.781082Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:02.781082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KZ3+sTeKXnvqoRt2z/o6z5Lv4wYGrlNqURDXO+V3EZm2Ht2yWMqYtHkAy35Q8UYzvIcWyDOgKSQIifbsktitDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:02.781709Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.1113","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1fe19f9366bb4976c0e7778b9eae74cd7791a70464410c1aa188fe648717fcfb","sha256:0326e2e6509ce13a160ba6a83bddb298190afcff79b207f1c694450ecb4f4c4b"],"state_sha256":"be4269b840b8d9924843bd032b6d9a6cd3b0d7489160f92b1856febd241b4964"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xn+4WNbp1LyAXGc3owvm2xWmxEuacUu5iFpoDDB0VkIh+zcPnKM7iRnVGiqoyNA+tQk/4mHFeiRSu5NNbbz8Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:43:03.808543Z","bundle_sha256":"780d196bd3b65a12898a90946ca5308a4a3196bdca74e80765754c6c8e17057b"}}