{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BAO56OOOYOXXO27ZZEWG5DEVRT","short_pith_number":"pith:BAO56OOO","canonical_record":{"source":{"id":"1307.5613","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-07-22T07:56:25Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"f3423b1f3cfac7041f52a94a6fd0bda3c42aaf16fe88df9c10bcc7f380dfdc12","abstract_canon_sha256":"ccdf5989073c3c5085b4580ebae02ac1bf60fc2b9319cb6ab6509c86e505de75"},"schema_version":"1.0"},"canonical_sha256":"081ddf39cec3af776bf9c92c6e8c958cff56ed76d6b173c4c73b544c27c1a22f","source":{"kind":"arxiv","id":"1307.5613","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5613","created_at":"2026-05-18T02:30:47Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5613v2","created_at":"2026-05-18T02:30:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5613","created_at":"2026-05-18T02:30:47Z"},{"alias_kind":"pith_short_12","alias_value":"BAO56OOOYOXX","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"BAO56OOOYOXXO27Z","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"BAO56OOO","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BAO56OOOYOXXO27ZZEWG5DEVRT","target":"record","payload":{"canonical_record":{"source":{"id":"1307.5613","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-07-22T07:56:25Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"f3423b1f3cfac7041f52a94a6fd0bda3c42aaf16fe88df9c10bcc7f380dfdc12","abstract_canon_sha256":"ccdf5989073c3c5085b4580ebae02ac1bf60fc2b9319cb6ab6509c86e505de75"},"schema_version":"1.0"},"canonical_sha256":"081ddf39cec3af776bf9c92c6e8c958cff56ed76d6b173c4c73b544c27c1a22f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:47.717300Z","signature_b64":"6YXMk7qCXJ2XREOo9sEPc3bxiy9B6hvEJXIh1PkOixt2qTfdK6saBUGo48OFlR+Ub/IKb0SUswItwliLZq7/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"081ddf39cec3af776bf9c92c6e8c958cff56ed76d6b173c4c73b544c27c1a22f","last_reissued_at":"2026-05-18T02:30:47.716831Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:47.716831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.5613","source_version":2,"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:30:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JasCTC24YR9doGzFPafNGSxV6hB5HZGGy+5Jpx+FLlUB+k2ybnD5Hs2ONeJzToHTDbu5lqTtVtJYv8ZrwSYmBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:35:53.199593Z"},"content_sha256":"9dfa8f5d2118738a103ad531dc87537e037a7dfbb8b488e49aae226262e5d048","schema_version":"1.0","event_id":"sha256:9dfa8f5d2118738a103ad531dc87537e037a7dfbb8b488e49aae226262e5d048"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BAO56OOOYOXXO27ZZEWG5DEVRT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Primary-Secondary user Cooperation Policies in Cognitive Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.NI","authors_text":"Evangelia Matskani, Iordanis Koutsopoulos, Leandros Tassiulas, Leonidas Georgiadis, Nestor Chatzidiamantis","submitted_at":"2013-07-22T07:56:25Z","abstract_excerpt":"In cognitive radio networks, secondary users (SUs) may cooperate with the primary user (PU), so that the success probability of PU transmissions are improved, while SUs obtain more transmission opportunities. Thus, SUs have to take intelligent decisions on whether to cooperate or not and with what power level, in order to maximize their throughput subject to average power constraints. Cooperation policies in this framework require the solution of a constrained Markov decision problem with infinite state space. In our work, we restrict attention to the class of stationary policies that take ran"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5613","kind":"arxiv","version":2},"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:30:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7M5InvY9gMVpxrY0/3RHnjkwjUvFBbqRYe1hC79agXn9vmfmvujE0wwqJNeQnZa8ST21HBFwUBiwcVds7u9/AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:35:53.200300Z"},"content_sha256":"3b46173ace43a43bd68b00636ac017e94ee73ecd2e02aff10694b69129fd0097","schema_version":"1.0","event_id":"sha256:3b46173ace43a43bd68b00636ac017e94ee73ecd2e02aff10694b69129fd0097"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BAO56OOOYOXXO27ZZEWG5DEVRT/bundle.json","state_url":"https://pith.science/pith/BAO56OOOYOXXO27ZZEWG5DEVRT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BAO56OOOYOXXO27ZZEWG5DEVRT/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-27T18:35:53Z","links":{"resolver":"https://pith.science/pith/BAO56OOOYOXXO27ZZEWG5DEVRT","bundle":"https://pith.science/pith/BAO56OOOYOXXO27ZZEWG5DEVRT/bundle.json","state":"https://pith.science/pith/BAO56OOOYOXXO27ZZEWG5DEVRT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BAO56OOOYOXXO27ZZEWG5DEVRT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BAO56OOOYOXXO27ZZEWG5DEVRT","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":"ccdf5989073c3c5085b4580ebae02ac1bf60fc2b9319cb6ab6509c86e505de75","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-07-22T07:56:25Z","title_canon_sha256":"f3423b1f3cfac7041f52a94a6fd0bda3c42aaf16fe88df9c10bcc7f380dfdc12"},"schema_version":"1.0","source":{"id":"1307.5613","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5613","created_at":"2026-05-18T02:30:47Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5613v2","created_at":"2026-05-18T02:30:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5613","created_at":"2026-05-18T02:30:47Z"},{"alias_kind":"pith_short_12","alias_value":"BAO56OOOYOXX","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"BAO56OOOYOXXO27Z","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"BAO56OOO","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:3b46173ace43a43bd68b00636ac017e94ee73ecd2e02aff10694b69129fd0097","target":"graph","created_at":"2026-05-18T02:30:47Z","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 cognitive radio networks, secondary users (SUs) may cooperate with the primary user (PU), so that the success probability of PU transmissions are improved, while SUs obtain more transmission opportunities. Thus, SUs have to take intelligent decisions on whether to cooperate or not and with what power level, in order to maximize their throughput subject to average power constraints. Cooperation policies in this framework require the solution of a constrained Markov decision problem with infinite state space. In our work, we restrict attention to the class of stationary policies that take ran","authors_text":"Evangelia Matskani, Iordanis Koutsopoulos, Leandros Tassiulas, Leonidas Georgiadis, Nestor Chatzidiamantis","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-07-22T07:56:25Z","title":"Optimal Primary-Secondary user Cooperation Policies in Cognitive Radio Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5613","kind":"arxiv","version":2},"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:9dfa8f5d2118738a103ad531dc87537e037a7dfbb8b488e49aae226262e5d048","target":"record","created_at":"2026-05-18T02:30:47Z","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":"ccdf5989073c3c5085b4580ebae02ac1bf60fc2b9319cb6ab6509c86e505de75","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-07-22T07:56:25Z","title_canon_sha256":"f3423b1f3cfac7041f52a94a6fd0bda3c42aaf16fe88df9c10bcc7f380dfdc12"},"schema_version":"1.0","source":{"id":"1307.5613","kind":"arxiv","version":2}},"canonical_sha256":"081ddf39cec3af776bf9c92c6e8c958cff56ed76d6b173c4c73b544c27c1a22f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"081ddf39cec3af776bf9c92c6e8c958cff56ed76d6b173c4c73b544c27c1a22f","first_computed_at":"2026-05-18T02:30:47.716831Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:47.716831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6YXMk7qCXJ2XREOo9sEPc3bxiy9B6hvEJXIh1PkOixt2qTfdK6saBUGo48OFlR+Ub/IKb0SUswItwliLZq7/AA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:47.717300Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.5613","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9dfa8f5d2118738a103ad531dc87537e037a7dfbb8b488e49aae226262e5d048","sha256:3b46173ace43a43bd68b00636ac017e94ee73ecd2e02aff10694b69129fd0097"],"state_sha256":"4d7c73f4e92277a7311ee4619bc4ed46399ab37d913a17f9bd8c81d669d56716"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iQSbS7DCWPiuGF6bCisewTsj8KQYvdrj5KkTMmi1eyP/mkk0WoXs8PHXryOev6YDyujRIVPZHNM3gd/V+xRXBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:35:53.203747Z","bundle_sha256":"798ac17be158d89fd2d7010be9d5689760bd8584b6ee52591d269cc75c546a0c"}}