{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SRKGLYS3DVAT3WWKZ2SXTY635K","short_pith_number":"pith:SRKGLYS3","canonical_record":{"source":{"id":"1607.01996","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-07T12:58:08Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"7122accabef0b91ee012086dae60544bae606484f1a18fdac841a9fc7f175c9a","abstract_canon_sha256":"fcc3e36d8d9f1cd4ff2f305a025f46e1253564dae0d2334797799dd033d24c0a"},"schema_version":"1.0"},"canonical_sha256":"945465e25b1d413ddacacea579e3dbeaaa8c7352354c7bd8acc9a545bc61a2ae","source":{"kind":"arxiv","id":"1607.01996","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01996","created_at":"2026-05-18T01:11:22Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01996v1","created_at":"2026-05-18T01:11:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01996","created_at":"2026-05-18T01:11:22Z"},{"alias_kind":"pith_short_12","alias_value":"SRKGLYS3DVAT","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SRKGLYS3DVAT3WWK","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SRKGLYS3","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SRKGLYS3DVAT3WWKZ2SXTY635K","target":"record","payload":{"canonical_record":{"source":{"id":"1607.01996","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-07T12:58:08Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"7122accabef0b91ee012086dae60544bae606484f1a18fdac841a9fc7f175c9a","abstract_canon_sha256":"fcc3e36d8d9f1cd4ff2f305a025f46e1253564dae0d2334797799dd033d24c0a"},"schema_version":"1.0"},"canonical_sha256":"945465e25b1d413ddacacea579e3dbeaaa8c7352354c7bd8acc9a545bc61a2ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:22.838998Z","signature_b64":"b2G2qjEG1mYaf9GmN0fCHeSIebz07vyi+aiI23w6oa2n1pO2GTzhF2Q49k0f3GbvCo5QMpeumy3XnhdP680rBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"945465e25b1d413ddacacea579e3dbeaaa8c7352354c7bd8acc9a545bc61a2ae","last_reissued_at":"2026-05-18T01:11:22.838511Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:22.838511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.01996","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-18T01:11:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SWkWB8FwD4CRW81tjcQRpNFaubPT4rOOmL0ba+5pr60wUahSAiR7S3PUWM12XgurZOJfjNfFUKkj++40KLK8BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T02:32:45.836377Z"},"content_sha256":"c3cdecb5d6c77ee4404fde0a4d347e7519e726d4c2f82ba2d7cfd2cb19e26e17","schema_version":"1.0","event_id":"sha256:c3cdecb5d6c77ee4404fde0a4d347e7519e726d4c2f82ba2d7cfd2cb19e26e17"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SRKGLYS3DVAT3WWKZ2SXTY635K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing Access Mechanisms for QoS Provisioning in Hardware Constrained Dynamic Spectrum Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"George C.Alexandropoulos, Spyridon Vassilaras","submitted_at":"2016-07-07T12:58:08Z","abstract_excerpt":"One of the major challenges in Dynamic Spectrum Access (DSA) systems is to guarantee a required level of Quality of Service (QoS) to secondary users of the spectrum. In this paper, we propose efficient algorithms for deriving optimal policies for the sensing / transmitting trade-off in hardware-constrained DSA systems. Unlike previous approaches which seek to maximize mean data rate for the secondary users, the proposed algorithms derive policies which minimize the probability of excessive queuing delays. Large Deviations (LD) asymptotics are used to approximate the probability of interest and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01996","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-18T01:11:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S+EEDByk6gpFQdDRRB/ysECYQ+NLeset3v90RUXR6+z+VbfP8XcYtySW7gb7pYzTey5P271IoB+Wfwt7umOZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T02:32:45.836766Z"},"content_sha256":"9a7af215a7d85f3c040f66fd7f7adaa837f0f2a7ff4a077fc4c57d9f119bc006","schema_version":"1.0","event_id":"sha256:9a7af215a7d85f3c040f66fd7f7adaa837f0f2a7ff4a077fc4c57d9f119bc006"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SRKGLYS3DVAT3WWKZ2SXTY635K/bundle.json","state_url":"https://pith.science/pith/SRKGLYS3DVAT3WWKZ2SXTY635K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SRKGLYS3DVAT3WWKZ2SXTY635K/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-22T02:32:45Z","links":{"resolver":"https://pith.science/pith/SRKGLYS3DVAT3WWKZ2SXTY635K","bundle":"https://pith.science/pith/SRKGLYS3DVAT3WWKZ2SXTY635K/bundle.json","state":"https://pith.science/pith/SRKGLYS3DVAT3WWKZ2SXTY635K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SRKGLYS3DVAT3WWKZ2SXTY635K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SRKGLYS3DVAT3WWKZ2SXTY635K","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":"fcc3e36d8d9f1cd4ff2f305a025f46e1253564dae0d2334797799dd033d24c0a","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-07T12:58:08Z","title_canon_sha256":"7122accabef0b91ee012086dae60544bae606484f1a18fdac841a9fc7f175c9a"},"schema_version":"1.0","source":{"id":"1607.01996","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01996","created_at":"2026-05-18T01:11:22Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01996v1","created_at":"2026-05-18T01:11:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01996","created_at":"2026-05-18T01:11:22Z"},{"alias_kind":"pith_short_12","alias_value":"SRKGLYS3DVAT","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SRKGLYS3DVAT3WWK","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SRKGLYS3","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:9a7af215a7d85f3c040f66fd7f7adaa837f0f2a7ff4a077fc4c57d9f119bc006","target":"graph","created_at":"2026-05-18T01:11:22Z","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":"One of the major challenges in Dynamic Spectrum Access (DSA) systems is to guarantee a required level of Quality of Service (QoS) to secondary users of the spectrum. In this paper, we propose efficient algorithms for deriving optimal policies for the sensing / transmitting trade-off in hardware-constrained DSA systems. Unlike previous approaches which seek to maximize mean data rate for the secondary users, the proposed algorithms derive policies which minimize the probability of excessive queuing delays. Large Deviations (LD) asymptotics are used to approximate the probability of interest and","authors_text":"George C.Alexandropoulos, Spyridon Vassilaras","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-07T12:58:08Z","title":"Optimizing Access Mechanisms for QoS Provisioning in Hardware Constrained Dynamic Spectrum Access"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01996","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:c3cdecb5d6c77ee4404fde0a4d347e7519e726d4c2f82ba2d7cfd2cb19e26e17","target":"record","created_at":"2026-05-18T01:11:22Z","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":"fcc3e36d8d9f1cd4ff2f305a025f46e1253564dae0d2334797799dd033d24c0a","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-07T12:58:08Z","title_canon_sha256":"7122accabef0b91ee012086dae60544bae606484f1a18fdac841a9fc7f175c9a"},"schema_version":"1.0","source":{"id":"1607.01996","kind":"arxiv","version":1}},"canonical_sha256":"945465e25b1d413ddacacea579e3dbeaaa8c7352354c7bd8acc9a545bc61a2ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"945465e25b1d413ddacacea579e3dbeaaa8c7352354c7bd8acc9a545bc61a2ae","first_computed_at":"2026-05-18T01:11:22.838511Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:22.838511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b2G2qjEG1mYaf9GmN0fCHeSIebz07vyi+aiI23w6oa2n1pO2GTzhF2Q49k0f3GbvCo5QMpeumy3XnhdP680rBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:22.838998Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.01996","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3cdecb5d6c77ee4404fde0a4d347e7519e726d4c2f82ba2d7cfd2cb19e26e17","sha256:9a7af215a7d85f3c040f66fd7f7adaa837f0f2a7ff4a077fc4c57d9f119bc006"],"state_sha256":"fe226397b6c24ff74ca2299a21e0af78b1e8315b1cb0fb8c5cf9b3218293869c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Afz63SXmX59e0aAc3pws9KlGpmFNmn4sQDfFzcx7DOyx3Z5kA9bpCSdgqeM6E79MiXZl6rE9qY7VyL1d9OP1Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T02:32:45.838658Z","bundle_sha256":"1a25c4fe77a3ccb3f5c51d8a3b68d86c3da262dd11e9cad5742631be7476ca1e"}}