{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TGXLSC4PAXYORAFLIZTU3R6GHL","short_pith_number":"pith:TGXLSC4P","canonical_record":{"source":{"id":"1412.8375","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-12-29T15:48:07Z","cross_cats_sorted":[],"title_canon_sha256":"647938214f33d2806be90bef338602356b8b158fca3f616d2744939484f77c59","abstract_canon_sha256":"2fba946489205d0c4a010099d5ec0cad82bd770770dac515f9366506c975fe89"},"schema_version":"1.0"},"canonical_sha256":"99aeb90b8f05f0e880ab46674dc7c63ad731b1ea9c5feb4a076292208917d143","source":{"kind":"arxiv","id":"1412.8375","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.8375","created_at":"2026-05-18T02:30:23Z"},{"alias_kind":"arxiv_version","alias_value":"1412.8375v1","created_at":"2026-05-18T02:30:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8375","created_at":"2026-05-18T02:30:23Z"},{"alias_kind":"pith_short_12","alias_value":"TGXLSC4PAXYO","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TGXLSC4PAXYORAFL","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TGXLSC4P","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TGXLSC4PAXYORAFLIZTU3R6GHL","target":"record","payload":{"canonical_record":{"source":{"id":"1412.8375","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-12-29T15:48:07Z","cross_cats_sorted":[],"title_canon_sha256":"647938214f33d2806be90bef338602356b8b158fca3f616d2744939484f77c59","abstract_canon_sha256":"2fba946489205d0c4a010099d5ec0cad82bd770770dac515f9366506c975fe89"},"schema_version":"1.0"},"canonical_sha256":"99aeb90b8f05f0e880ab46674dc7c63ad731b1ea9c5feb4a076292208917d143","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:23.394542Z","signature_b64":"9Udapnh3Mn5LbeQGNtc/R3krKMqTLZJzaUuCz29xzAgZtjCDiyUCb8wDO48egVYD4oaX9X9UaIJBYj3VfQIjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99aeb90b8f05f0e880ab46674dc7c63ad731b1ea9c5feb4a076292208917d143","last_reissued_at":"2026-05-18T02:30:23.394065Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:23.394065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.8375","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-18T02:30:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5T/d17lHnx1W/z9375hDw4dIR/d/rGEIan6WLaNpELK7f58hI6tZUpaAjaGBAxR3JAcpI9jDVmBup9hbYr/GDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:30:27.621129Z"},"content_sha256":"96cb385b3c77820f88f907bfc8c6a2f11dcf6e0dc20aacab52cf83cfa1f3ba5c","schema_version":"1.0","event_id":"sha256:96cb385b3c77820f88f907bfc8c6a2f11dcf6e0dc20aacab52cf83cfa1f3ba5c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TGXLSC4PAXYORAFLIZTU3R6GHL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cross-Layer Scheduling for OFDMA-based Cognitive Radio Systems with Delay and Security Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Bo Yang, Cailian Chen, Fan Wu, Liang Xue, Xingzheng Zhu, Xinping Guan","submitted_at":"2014-12-29T15:48:07Z","abstract_excerpt":"This paper considers the resource allocation problem in an Orthogonal Frequency Division Multiple Access (OFDMA) based cognitive radio (CR) network, where the CR base station adopts full overlay scheme to transmit both private and open information to multiple users with average delay and power constraints. A stochastic optimization problem is formulated to develop flow control and radio resource allocation in order to maximize the long-term system throughput of open and private information in CR system and ensure the stability of primary system. The corresponding optimal condition for employin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8375","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-18T02:30:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O0KQDjudxQImH/dGTEajPl/XCZyY9O/lGmcWQGyBwXFZr7wfEGsWac30OaCSloxjY72riMr1l9q+TzWqiAPeDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:30:27.621812Z"},"content_sha256":"8530e61dad688cb7f471bb361ba9a7f198c9f4d3c75b70fcbe51dac8d259939c","schema_version":"1.0","event_id":"sha256:8530e61dad688cb7f471bb361ba9a7f198c9f4d3c75b70fcbe51dac8d259939c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TGXLSC4PAXYORAFLIZTU3R6GHL/bundle.json","state_url":"https://pith.science/pith/TGXLSC4PAXYORAFLIZTU3R6GHL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TGXLSC4PAXYORAFLIZTU3R6GHL/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-26T04:30:27Z","links":{"resolver":"https://pith.science/pith/TGXLSC4PAXYORAFLIZTU3R6GHL","bundle":"https://pith.science/pith/TGXLSC4PAXYORAFLIZTU3R6GHL/bundle.json","state":"https://pith.science/pith/TGXLSC4PAXYORAFLIZTU3R6GHL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TGXLSC4PAXYORAFLIZTU3R6GHL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TGXLSC4PAXYORAFLIZTU3R6GHL","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":"2fba946489205d0c4a010099d5ec0cad82bd770770dac515f9366506c975fe89","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-12-29T15:48:07Z","title_canon_sha256":"647938214f33d2806be90bef338602356b8b158fca3f616d2744939484f77c59"},"schema_version":"1.0","source":{"id":"1412.8375","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.8375","created_at":"2026-05-18T02:30:23Z"},{"alias_kind":"arxiv_version","alias_value":"1412.8375v1","created_at":"2026-05-18T02:30:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8375","created_at":"2026-05-18T02:30:23Z"},{"alias_kind":"pith_short_12","alias_value":"TGXLSC4PAXYO","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TGXLSC4PAXYORAFL","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TGXLSC4P","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:8530e61dad688cb7f471bb361ba9a7f198c9f4d3c75b70fcbe51dac8d259939c","target":"graph","created_at":"2026-05-18T02:30:23Z","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":"This paper considers the resource allocation problem in an Orthogonal Frequency Division Multiple Access (OFDMA) based cognitive radio (CR) network, where the CR base station adopts full overlay scheme to transmit both private and open information to multiple users with average delay and power constraints. A stochastic optimization problem is formulated to develop flow control and radio resource allocation in order to maximize the long-term system throughput of open and private information in CR system and ensure the stability of primary system. The corresponding optimal condition for employin","authors_text":"Bo Yang, Cailian Chen, Fan Wu, Liang Xue, Xingzheng Zhu, Xinping Guan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-12-29T15:48:07Z","title":"Cross-Layer Scheduling for OFDMA-based Cognitive Radio Systems with Delay and Security Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8375","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:96cb385b3c77820f88f907bfc8c6a2f11dcf6e0dc20aacab52cf83cfa1f3ba5c","target":"record","created_at":"2026-05-18T02:30:23Z","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":"2fba946489205d0c4a010099d5ec0cad82bd770770dac515f9366506c975fe89","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-12-29T15:48:07Z","title_canon_sha256":"647938214f33d2806be90bef338602356b8b158fca3f616d2744939484f77c59"},"schema_version":"1.0","source":{"id":"1412.8375","kind":"arxiv","version":1}},"canonical_sha256":"99aeb90b8f05f0e880ab46674dc7c63ad731b1ea9c5feb4a076292208917d143","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99aeb90b8f05f0e880ab46674dc7c63ad731b1ea9c5feb4a076292208917d143","first_computed_at":"2026-05-18T02:30:23.394065Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:23.394065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9Udapnh3Mn5LbeQGNtc/R3krKMqTLZJzaUuCz29xzAgZtjCDiyUCb8wDO48egVYD4oaX9X9UaIJBYj3VfQIjDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:23.394542Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.8375","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96cb385b3c77820f88f907bfc8c6a2f11dcf6e0dc20aacab52cf83cfa1f3ba5c","sha256:8530e61dad688cb7f471bb361ba9a7f198c9f4d3c75b70fcbe51dac8d259939c"],"state_sha256":"501d40bd70d4dc11941d79e3542cbff2e7493a275f2a4b401617a551ac96cfd5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a6vjf795CTtJ43kSGk01BIFPgya3FOR1aXdSNlz3ROt3/qYLKxiYB5cZK+ouebP9b39Hho0gdRv3xiKayJ5oCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:30:27.625637Z","bundle_sha256":"88d8482503977b31b0ec55c3eae3b036b04fbf2f9a08581bc85e269e7d89d2bf"}}