{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JRCRM6HNMXFTDHCQ6DGPOEJTPN","short_pith_number":"pith:JRCRM6HN","canonical_record":{"source":{"id":"1501.05421","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-01-22T08:34:53Z","cross_cats_sorted":[],"title_canon_sha256":"73349ee6ff9a5cdd0f6c34b43755ff4c8e45a6d2331004e9ee17c209aa0153b2","abstract_canon_sha256":"eeb83624db937f15ebb41e4a7ac1046e894ea7f23722c77d51224ce27f17a3d6"},"schema_version":"1.0"},"canonical_sha256":"4c451678ed65cb319c50f0ccf711337b649b6c4222f6f3af67addcf1dfb634cc","source":{"kind":"arxiv","id":"1501.05421","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05421","created_at":"2026-05-18T00:41:46Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05421v1","created_at":"2026-05-18T00:41:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05421","created_at":"2026-05-18T00:41:46Z"},{"alias_kind":"pith_short_12","alias_value":"JRCRM6HNMXFT","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JRCRM6HNMXFTDHCQ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JRCRM6HN","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JRCRM6HNMXFTDHCQ6DGPOEJTPN","target":"record","payload":{"canonical_record":{"source":{"id":"1501.05421","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-01-22T08:34:53Z","cross_cats_sorted":[],"title_canon_sha256":"73349ee6ff9a5cdd0f6c34b43755ff4c8e45a6d2331004e9ee17c209aa0153b2","abstract_canon_sha256":"eeb83624db937f15ebb41e4a7ac1046e894ea7f23722c77d51224ce27f17a3d6"},"schema_version":"1.0"},"canonical_sha256":"4c451678ed65cb319c50f0ccf711337b649b6c4222f6f3af67addcf1dfb634cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:46.752780Z","signature_b64":"LfjGq/AR3skwDhEGHxDFWw6MxbgVE6DgqpAKBT8/dqJUK+iy+EKyCx46k1qlHyb42ndGLUQa7yuF7dCBcDwAAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c451678ed65cb319c50f0ccf711337b649b6c4222f6f3af67addcf1dfb634cc","last_reissued_at":"2026-05-18T00:41:46.752279Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:46.752279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.05421","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:41:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ktCA4DrmERTkuy8ZpvE8vnVUwY72/kyARPA0Yuvn1FeCr/neOYYGyC4eFiNT4u42e+PjiJhEpY3m4zR0lnPSDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:57:51.694050Z"},"content_sha256":"fdf6235353be3ea4caae50e592c43a2292fc61c6072f8b5b402036aa4b5c3b54","schema_version":"1.0","event_id":"sha256:fdf6235353be3ea4caae50e592c43a2292fc61c6072f8b5b402036aa4b5c3b54"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JRCRM6HNMXFTDHCQ6DGPOEJTPN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Queueing Analysis for Preemptive Transmission in Underlay Cognitive Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Hongli Xu, Jie Hu, Liusheng Huang, Long Chen","submitted_at":"2015-01-22T08:34:53Z","abstract_excerpt":"In many cognitive radio applications, there are multiple types of message queues. Existing queueing analysis works in underlay CR networks failed to discuss packets heterogeneity. Therefore high priority packets with impatient waiting time that have preemptive transmission opportunities over low class are investigated. We model the system behavior as a M/M/1+GI queue which is represented by a two dimensional state transition graph. The reneging probability of high priority packets and the average waiting time in two-class priority queues is analyzed. Simulation results demonstrate that the ave"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05421","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:41:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r/S9Cnnj/2lQMpwnmRZ/jAQi0ttdDvDBvCW+LpIQjc8TR3RsvSjdU7knF1DWBGy42AQf/kjo1W4oz88JAz07Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:57:51.694412Z"},"content_sha256":"5390d715165596de08dea8ba65acc3736a9a9d65f3f6ad44913ec1175e6441cb","schema_version":"1.0","event_id":"sha256:5390d715165596de08dea8ba65acc3736a9a9d65f3f6ad44913ec1175e6441cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JRCRM6HNMXFTDHCQ6DGPOEJTPN/bundle.json","state_url":"https://pith.science/pith/JRCRM6HNMXFTDHCQ6DGPOEJTPN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JRCRM6HNMXFTDHCQ6DGPOEJTPN/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-30T06:57:51Z","links":{"resolver":"https://pith.science/pith/JRCRM6HNMXFTDHCQ6DGPOEJTPN","bundle":"https://pith.science/pith/JRCRM6HNMXFTDHCQ6DGPOEJTPN/bundle.json","state":"https://pith.science/pith/JRCRM6HNMXFTDHCQ6DGPOEJTPN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JRCRM6HNMXFTDHCQ6DGPOEJTPN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JRCRM6HNMXFTDHCQ6DGPOEJTPN","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":"eeb83624db937f15ebb41e4a7ac1046e894ea7f23722c77d51224ce27f17a3d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-01-22T08:34:53Z","title_canon_sha256":"73349ee6ff9a5cdd0f6c34b43755ff4c8e45a6d2331004e9ee17c209aa0153b2"},"schema_version":"1.0","source":{"id":"1501.05421","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05421","created_at":"2026-05-18T00:41:46Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05421v1","created_at":"2026-05-18T00:41:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05421","created_at":"2026-05-18T00:41:46Z"},{"alias_kind":"pith_short_12","alias_value":"JRCRM6HNMXFT","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JRCRM6HNMXFTDHCQ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JRCRM6HN","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:5390d715165596de08dea8ba65acc3736a9a9d65f3f6ad44913ec1175e6441cb","target":"graph","created_at":"2026-05-18T00:41:46Z","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 many cognitive radio applications, there are multiple types of message queues. Existing queueing analysis works in underlay CR networks failed to discuss packets heterogeneity. Therefore high priority packets with impatient waiting time that have preemptive transmission opportunities over low class are investigated. We model the system behavior as a M/M/1+GI queue which is represented by a two dimensional state transition graph. The reneging probability of high priority packets and the average waiting time in two-class priority queues is analyzed. Simulation results demonstrate that the ave","authors_text":"Hongli Xu, Jie Hu, Liusheng Huang, Long Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-01-22T08:34:53Z","title":"Queueing Analysis for Preemptive Transmission in Underlay Cognitive Radio Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05421","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:fdf6235353be3ea4caae50e592c43a2292fc61c6072f8b5b402036aa4b5c3b54","target":"record","created_at":"2026-05-18T00:41:46Z","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":"eeb83624db937f15ebb41e4a7ac1046e894ea7f23722c77d51224ce27f17a3d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-01-22T08:34:53Z","title_canon_sha256":"73349ee6ff9a5cdd0f6c34b43755ff4c8e45a6d2331004e9ee17c209aa0153b2"},"schema_version":"1.0","source":{"id":"1501.05421","kind":"arxiv","version":1}},"canonical_sha256":"4c451678ed65cb319c50f0ccf711337b649b6c4222f6f3af67addcf1dfb634cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c451678ed65cb319c50f0ccf711337b649b6c4222f6f3af67addcf1dfb634cc","first_computed_at":"2026-05-18T00:41:46.752279Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:46.752279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LfjGq/AR3skwDhEGHxDFWw6MxbgVE6DgqpAKBT8/dqJUK+iy+EKyCx46k1qlHyb42ndGLUQa7yuF7dCBcDwAAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:46.752780Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.05421","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fdf6235353be3ea4caae50e592c43a2292fc61c6072f8b5b402036aa4b5c3b54","sha256:5390d715165596de08dea8ba65acc3736a9a9d65f3f6ad44913ec1175e6441cb"],"state_sha256":"8302f6235f752d98f3cdaba879397f4be7ec754af1b7fa5a06d6fe1d54293bba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1BP3thLY6dkJ1esM2QdMt13j4PqiXxulJ3WVF0zteNFl82/kIVxQEoMjUoEkss5lk3jUCf6axSr3nGQJOv/YAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:57:51.696339Z","bundle_sha256":"aa3910c3bc4c204912a0535b16bee456122a00174446ab1cfea6e5ba23a51655"}}