{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7DVVABICZT2L3V7KEJOJ25J7A5","short_pith_number":"pith:7DVVABIC","canonical_record":{"source":{"id":"1603.09530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-03-31T11:24:11Z","cross_cats_sorted":[],"title_canon_sha256":"a7440ecf6127e7d2e94cac5cebb41d5b425e7c7f599ce8971957e6f5d47b4eb7","abstract_canon_sha256":"71c065ce138b0deeb9357edb8141beb5c77bc41265d032f25daa686ce3e7d70d"},"schema_version":"1.0"},"canonical_sha256":"f8eb500502ccf4bdd7ea225c9d753f07677fe70b373e6781bc2d5a9d98a8eed3","source":{"kind":"arxiv","id":"1603.09530","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.09530","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"arxiv_version","alias_value":"1603.09530v1","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09530","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"pith_short_12","alias_value":"7DVVABICZT2L","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7DVVABICZT2L3V7K","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7DVVABIC","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7DVVABICZT2L3V7KEJOJ25J7A5","target":"record","payload":{"canonical_record":{"source":{"id":"1603.09530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-03-31T11:24:11Z","cross_cats_sorted":[],"title_canon_sha256":"a7440ecf6127e7d2e94cac5cebb41d5b425e7c7f599ce8971957e6f5d47b4eb7","abstract_canon_sha256":"71c065ce138b0deeb9357edb8141beb5c77bc41265d032f25daa686ce3e7d70d"},"schema_version":"1.0"},"canonical_sha256":"f8eb500502ccf4bdd7ea225c9d753f07677fe70b373e6781bc2d5a9d98a8eed3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:49.737332Z","signature_b64":"3Hvsw7WQ83n37Cq01kVvNmjIDaVcKm+3IPnhe64Zw5sC/VT0NniMR3XiEc/2HYeC30QDv76TJYIg9W62kWgOCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8eb500502ccf4bdd7ea225c9d753f07677fe70b373e6781bc2d5a9d98a8eed3","last_reissued_at":"2026-05-18T00:57:49.736672Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:49.736672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.09530","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:57:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"21rNcdtLHN/ugmwjYP6I53cZ5SCj0u9+dD2WAfyWOFrm4N3HWsc5rga6BsLwv7kRvPUTsijKVXxKIv21dUiaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:04:36.891958Z"},"content_sha256":"cf4f83b6d82a8253db96a3130973cafee2f9ff99d07eac1c0145e7df5e922e7b","schema_version":"1.0","event_id":"sha256:cf4f83b6d82a8253db96a3130973cafee2f9ff99d07eac1c0145e7df5e922e7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7DVVABICZT2L3V7KEJOJ25J7A5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Optimizing Cooperative Cognitive User Performance under Primary QoS Constraints","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":"2016-03-31T11:24:11Z","abstract_excerpt":"We study the problem of optimizing the performance of cognitive radio users with opportunistic real-time applications subject to primary users quality-of-service (QoS) constraints. Two constrained optimization problems are formulated; the first problem is maximizing the secondary user throughput while the second problem is minimizing the secondary user average delay, subject to a common constraint on the primary user average delay. In spite of the complexity of the optimization problems, due to their non-convexity, we transform the first problem into a set of linear programs and the second pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09530","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:57:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kNyeFW+wgr0+EibeJdCFXr3NizV2urn+h9Jw1PaACulRNoN4aj9EhIXD3PQyCHu+VbxQ/tnkaOwBZ/BkHLK1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:04:36.892544Z"},"content_sha256":"cf0979b619730f7d517e50af00f314dc2ba8c9a476817600e26847f5d3bc281d","schema_version":"1.0","event_id":"sha256:cf0979b619730f7d517e50af00f314dc2ba8c9a476817600e26847f5d3bc281d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7DVVABICZT2L3V7KEJOJ25J7A5/bundle.json","state_url":"https://pith.science/pith/7DVVABICZT2L3V7KEJOJ25J7A5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7DVVABICZT2L3V7KEJOJ25J7A5/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-11T02:04:36Z","links":{"resolver":"https://pith.science/pith/7DVVABICZT2L3V7KEJOJ25J7A5","bundle":"https://pith.science/pith/7DVVABICZT2L3V7KEJOJ25J7A5/bundle.json","state":"https://pith.science/pith/7DVVABICZT2L3V7KEJOJ25J7A5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7DVVABICZT2L3V7KEJOJ25J7A5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7DVVABICZT2L3V7KEJOJ25J7A5","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":"71c065ce138b0deeb9357edb8141beb5c77bc41265d032f25daa686ce3e7d70d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-03-31T11:24:11Z","title_canon_sha256":"a7440ecf6127e7d2e94cac5cebb41d5b425e7c7f599ce8971957e6f5d47b4eb7"},"schema_version":"1.0","source":{"id":"1603.09530","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.09530","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"arxiv_version","alias_value":"1603.09530v1","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09530","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"pith_short_12","alias_value":"7DVVABICZT2L","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7DVVABICZT2L3V7K","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7DVVABIC","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:cf0979b619730f7d517e50af00f314dc2ba8c9a476817600e26847f5d3bc281d","target":"graph","created_at":"2026-05-18T00:57:49Z","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":"We study the problem of optimizing the performance of cognitive radio users with opportunistic real-time applications subject to primary users quality-of-service (QoS) constraints. Two constrained optimization problems are formulated; the first problem is maximizing the secondary user throughput while the second problem is minimizing the secondary user average delay, subject to a common constraint on the primary user average delay. In spite of the complexity of the optimization problems, due to their non-convexity, we transform the first problem into a set of linear programs and the second pro","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":"2016-03-31T11:24:11Z","title":"On Optimizing Cooperative Cognitive User Performance under Primary QoS Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09530","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:cf4f83b6d82a8253db96a3130973cafee2f9ff99d07eac1c0145e7df5e922e7b","target":"record","created_at":"2026-05-18T00:57:49Z","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":"71c065ce138b0deeb9357edb8141beb5c77bc41265d032f25daa686ce3e7d70d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-03-31T11:24:11Z","title_canon_sha256":"a7440ecf6127e7d2e94cac5cebb41d5b425e7c7f599ce8971957e6f5d47b4eb7"},"schema_version":"1.0","source":{"id":"1603.09530","kind":"arxiv","version":1}},"canonical_sha256":"f8eb500502ccf4bdd7ea225c9d753f07677fe70b373e6781bc2d5a9d98a8eed3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8eb500502ccf4bdd7ea225c9d753f07677fe70b373e6781bc2d5a9d98a8eed3","first_computed_at":"2026-05-18T00:57:49.736672Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:49.736672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3Hvsw7WQ83n37Cq01kVvNmjIDaVcKm+3IPnhe64Zw5sC/VT0NniMR3XiEc/2HYeC30QDv76TJYIg9W62kWgOCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:49.737332Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.09530","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf4f83b6d82a8253db96a3130973cafee2f9ff99d07eac1c0145e7df5e922e7b","sha256:cf0979b619730f7d517e50af00f314dc2ba8c9a476817600e26847f5d3bc281d"],"state_sha256":"be779949d3ecb5981737e941273c130458052f879598257efad997a71f8dc925"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j3yQGT2AkNCcGU/ZgEpK4UWIymvDmaAknxt0BiuEzS/yonFsLMCtxpsfqSw6P06TH0PAylVdMjNL5+k2W+E+Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T02:04:36.896185Z","bundle_sha256":"8732e86b10b77cefdd4f265bb23d1d5b05931582fbfa812db1d40b22658d5a0c"}}