{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QK7PUXRAYL5XSDTQCADUMGJUXE","short_pith_number":"pith:QK7PUXRA","canonical_record":{"source":{"id":"1407.4171","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-15T23:43:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4c726dd5190be65f41bcd735453887c1f33c4a5002daa7fb0c1e7e0a13c2f932","abstract_canon_sha256":"29f35c1f6489fb002c43f035532d15e8bf269b3acb49890a9815cf7d30f2103a"},"schema_version":"1.0"},"canonical_sha256":"82befa5e20c2fb790e701007461934b93c281980cbefd9e7974b2b1d81b22ae6","source":{"kind":"arxiv","id":"1407.4171","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4171","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4171v1","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4171","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"pith_short_12","alias_value":"QK7PUXRAYL5X","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QK7PUXRAYL5XSDTQ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QK7PUXRA","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QK7PUXRAYL5XSDTQCADUMGJUXE","target":"record","payload":{"canonical_record":{"source":{"id":"1407.4171","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-15T23:43:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4c726dd5190be65f41bcd735453887c1f33c4a5002daa7fb0c1e7e0a13c2f932","abstract_canon_sha256":"29f35c1f6489fb002c43f035532d15e8bf269b3acb49890a9815cf7d30f2103a"},"schema_version":"1.0"},"canonical_sha256":"82befa5e20c2fb790e701007461934b93c281980cbefd9e7974b2b1d81b22ae6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:41.244864Z","signature_b64":"KXfH1sEDsPI6LDEZ0MZe4DYO1DTiTPNFdIVbUAm54PEBQAefcEKhdmDBpnwGIQIXKmAWp5LeaYJiLp2RfafpDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82befa5e20c2fb790e701007461934b93c281980cbefd9e7974b2b1d81b22ae6","last_reissued_at":"2026-05-18T00:58:41.244289Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:41.244289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.4171","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:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7dckJWldufBbRKfsmoOod1CuV4028iTMLCzPp6hzSN+J8g2r9Uia6dlY1vN8SpbcVcgMuIT76PcLYVjjdLzcBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:35:46.129034Z"},"content_sha256":"8ac22263a02a299da37167acfaff7fc5e5b18b4f932ca7132adf87fe555c4d9d","schema_version":"1.0","event_id":"sha256:8ac22263a02a299da37167acfaff7fc5e5b18b4f932ca7132adf87fe555c4d9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QK7PUXRAYL5XSDTQCADUMGJUXE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Effective Capacity in Cognitive Radio Broadcast Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"J\\\"urgen Peissig, Marwan Hammouda, Sami Akin","submitted_at":"2014-07-15T23:43:37Z","abstract_excerpt":"In this paper, we investigate effective capacity by modeling a cognitive radio broadcast channel with one secondary transmitter (ST) and two secondary receivers (SRs) under quality-of-service constraints and interference power limitations. We initially describe three different cooperative channel sensing strategies with different hard-decision combining algorithms at the ST, namely OR, Majority, and AND rules. Since the channel sensing occurs with possible errors, we consider a combined interference power constraint by which the transmission power of the secondary users (SUs) is bounded when t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4171","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:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yQglDPFjQjM22yR3VGzwORqNmolLOId7tW+r2jSgYxA3aocnmCOO0BlJ437e6SeWk5frYNDBvvyudU6l5A/ADQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:35:46.129697Z"},"content_sha256":"c6eac5f7fbe110ca7ef84ebed3da66b9c7960d6ce465edfdcbdcbce33e0857bb","schema_version":"1.0","event_id":"sha256:c6eac5f7fbe110ca7ef84ebed3da66b9c7960d6ce465edfdcbdcbce33e0857bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QK7PUXRAYL5XSDTQCADUMGJUXE/bundle.json","state_url":"https://pith.science/pith/QK7PUXRAYL5XSDTQCADUMGJUXE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QK7PUXRAYL5XSDTQCADUMGJUXE/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-07T21:35:46Z","links":{"resolver":"https://pith.science/pith/QK7PUXRAYL5XSDTQCADUMGJUXE","bundle":"https://pith.science/pith/QK7PUXRAYL5XSDTQCADUMGJUXE/bundle.json","state":"https://pith.science/pith/QK7PUXRAYL5XSDTQCADUMGJUXE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QK7PUXRAYL5XSDTQCADUMGJUXE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QK7PUXRAYL5XSDTQCADUMGJUXE","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":"29f35c1f6489fb002c43f035532d15e8bf269b3acb49890a9815cf7d30f2103a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-15T23:43:37Z","title_canon_sha256":"4c726dd5190be65f41bcd735453887c1f33c4a5002daa7fb0c1e7e0a13c2f932"},"schema_version":"1.0","source":{"id":"1407.4171","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4171","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4171v1","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4171","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"pith_short_12","alias_value":"QK7PUXRAYL5X","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QK7PUXRAYL5XSDTQ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QK7PUXRA","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:c6eac5f7fbe110ca7ef84ebed3da66b9c7960d6ce465edfdcbdcbce33e0857bb","target":"graph","created_at":"2026-05-18T00:58:41Z","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 investigate effective capacity by modeling a cognitive radio broadcast channel with one secondary transmitter (ST) and two secondary receivers (SRs) under quality-of-service constraints and interference power limitations. We initially describe three different cooperative channel sensing strategies with different hard-decision combining algorithms at the ST, namely OR, Majority, and AND rules. Since the channel sensing occurs with possible errors, we consider a combined interference power constraint by which the transmission power of the secondary users (SUs) is bounded when t","authors_text":"J\\\"urgen Peissig, Marwan Hammouda, Sami Akin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-15T23:43:37Z","title":"Effective Capacity in Cognitive Radio Broadcast Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4171","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:8ac22263a02a299da37167acfaff7fc5e5b18b4f932ca7132adf87fe555c4d9d","target":"record","created_at":"2026-05-18T00:58:41Z","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":"29f35c1f6489fb002c43f035532d15e8bf269b3acb49890a9815cf7d30f2103a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-15T23:43:37Z","title_canon_sha256":"4c726dd5190be65f41bcd735453887c1f33c4a5002daa7fb0c1e7e0a13c2f932"},"schema_version":"1.0","source":{"id":"1407.4171","kind":"arxiv","version":1}},"canonical_sha256":"82befa5e20c2fb790e701007461934b93c281980cbefd9e7974b2b1d81b22ae6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"82befa5e20c2fb790e701007461934b93c281980cbefd9e7974b2b1d81b22ae6","first_computed_at":"2026-05-18T00:58:41.244289Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:41.244289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KXfH1sEDsPI6LDEZ0MZe4DYO1DTiTPNFdIVbUAm54PEBQAefcEKhdmDBpnwGIQIXKmAWp5LeaYJiLp2RfafpDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:41.244864Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.4171","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ac22263a02a299da37167acfaff7fc5e5b18b4f932ca7132adf87fe555c4d9d","sha256:c6eac5f7fbe110ca7ef84ebed3da66b9c7960d6ce465edfdcbdcbce33e0857bb"],"state_sha256":"3bdcc45247b649da90a91fe96ea60be6c09b166c391e748c9f656b7a054781c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2qzD43aH4F5FriXxE1XEc9ioQPCTRzQA/mp/EO8F4GsJijNdY1dqc+2dlieH1PVBTJad1J7zQmNePvUKL4B8Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T21:35:46.133513Z","bundle_sha256":"e4aa22c846e03bcc12b7b87a71671eb95a6ffc6c7e315aaf937bf186d966a3cd"}}