{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:22KRIMVZTAIMERO56UETSIUBPS","short_pith_number":"pith:22KRIMVZ","schema_version":"1.0","canonical_sha256":"d6951432b99810c245ddf5093922817cb5a64f4d88084a14205b369b4c9d5181","source":{"kind":"arxiv","id":"1201.3059","version":1},"attestation_state":"computed","paper":{"title":"Delay Sensitive Communications over Cognitive Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.SY","authors_text":"Feng Wang, Jianwei Huang, Yuping Zhao","submitted_at":"2012-01-15T05:41:19Z","abstract_excerpt":"Supporting the quality of service of unlicensed users in cognitive radio networks is very challenging, mainly due to dynamic resource availability because of the licensed users' activities. In this paper, we study the optimal admission control and channel allocation decisions in cognitive overlay networks in order to support delay sensitive communications of unlicensed users. We formulate it as a Markov decision process problem, and solve it by transforming the original formulation into a stochastic shortest path problem. We then propose a simple heuristic control policy, which includes a thre"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1201.3059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-01-15T05:41:19Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"9a9a1ab3247d606883ea56d54eb4b2b20d121f384d5882864fcb3feda284001e","abstract_canon_sha256":"5f6e530b320d89027fb7cade53308f5657244e6513cc3c633dd7747e351a44ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:32.361814Z","signature_b64":"r6bwoGupeuhD9+vbIz3zS26Cvivc3jJRvufwQVqaeH/0smUFkfGQx081ubo8UQEyVM5O4qS4lAw3kqi4i1fIDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6951432b99810c245ddf5093922817cb5a64f4d88084a14205b369b4c9d5181","last_reissued_at":"2026-05-18T04:04:32.361057Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:32.361057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Delay Sensitive Communications over Cognitive Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.SY","authors_text":"Feng Wang, Jianwei Huang, Yuping Zhao","submitted_at":"2012-01-15T05:41:19Z","abstract_excerpt":"Supporting the quality of service of unlicensed users in cognitive radio networks is very challenging, mainly due to dynamic resource availability because of the licensed users' activities. In this paper, we study the optimal admission control and channel allocation decisions in cognitive overlay networks in order to support delay sensitive communications of unlicensed users. We formulate it as a Markov decision process problem, and solve it by transforming the original formulation into a stochastic shortest path problem. We then propose a simple heuristic control policy, which includes a thre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3059","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1201.3059","created_at":"2026-05-18T04:04:32.361143+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.3059v1","created_at":"2026-05-18T04:04:32.361143+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3059","created_at":"2026-05-18T04:04:32.361143+00:00"},{"alias_kind":"pith_short_12","alias_value":"22KRIMVZTAIM","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"22KRIMVZTAIMERO5","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"22KRIMVZ","created_at":"2026-05-18T12:26:50.516681+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/22KRIMVZTAIMERO56UETSIUBPS","json":"https://pith.science/pith/22KRIMVZTAIMERO56UETSIUBPS.json","graph_json":"https://pith.science/api/pith-number/22KRIMVZTAIMERO56UETSIUBPS/graph.json","events_json":"https://pith.science/api/pith-number/22KRIMVZTAIMERO56UETSIUBPS/events.json","paper":"https://pith.science/paper/22KRIMVZ"},"agent_actions":{"view_html":"https://pith.science/pith/22KRIMVZTAIMERO56UETSIUBPS","download_json":"https://pith.science/pith/22KRIMVZTAIMERO56UETSIUBPS.json","view_paper":"https://pith.science/paper/22KRIMVZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.3059&json=true","fetch_graph":"https://pith.science/api/pith-number/22KRIMVZTAIMERO56UETSIUBPS/graph.json","fetch_events":"https://pith.science/api/pith-number/22KRIMVZTAIMERO56UETSIUBPS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/22KRIMVZTAIMERO56UETSIUBPS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/22KRIMVZTAIMERO56UETSIUBPS/action/storage_attestation","attest_author":"https://pith.science/pith/22KRIMVZTAIMERO56UETSIUBPS/action/author_attestation","sign_citation":"https://pith.science/pith/22KRIMVZTAIMERO56UETSIUBPS/action/citation_signature","submit_replication":"https://pith.science/pith/22KRIMVZTAIMERO56UETSIUBPS/action/replication_record"}},"created_at":"2026-05-18T04:04:32.361143+00:00","updated_at":"2026-05-18T04:04:32.361143+00:00"}