{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DXK3RESK4A5LTNHYNWCWUAQOL6","short_pith_number":"pith:DXK3RESK","canonical_record":{"source":{"id":"1810.02859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-10-05T19:27:07Z","cross_cats_sorted":[],"title_canon_sha256":"ec8ccb7ca3460ee80e86afbede1038f1aa084c2cc1c45ac169caff3336fab0d5","abstract_canon_sha256":"8eb3c9f32896f78649cc72824c77403bef1fe8b7b56b1901455c63f042651902"},"schema_version":"1.0"},"canonical_sha256":"1dd5b8924ae03ab9b4f86d856a020e5fa1729f67d73023053b195c32abd4b924","source":{"kind":"arxiv","id":"1810.02859","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02859","created_at":"2026-05-18T00:04:00Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02859v1","created_at":"2026-05-18T00:04:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02859","created_at":"2026-05-18T00:04:00Z"},{"alias_kind":"pith_short_12","alias_value":"DXK3RESK4A5L","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DXK3RESK4A5LTNHY","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DXK3RESK","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DXK3RESK4A5LTNHYNWCWUAQOL6","target":"record","payload":{"canonical_record":{"source":{"id":"1810.02859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-10-05T19:27:07Z","cross_cats_sorted":[],"title_canon_sha256":"ec8ccb7ca3460ee80e86afbede1038f1aa084c2cc1c45ac169caff3336fab0d5","abstract_canon_sha256":"8eb3c9f32896f78649cc72824c77403bef1fe8b7b56b1901455c63f042651902"},"schema_version":"1.0"},"canonical_sha256":"1dd5b8924ae03ab9b4f86d856a020e5fa1729f67d73023053b195c32abd4b924","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:00.126752Z","signature_b64":"03Lsp/Zuoehj81bflaxyi1p1SoXfzyt/GCfFKAHUCDJmlbFYKIj9F4WUJAWRci6BF3HSVuhvRhDfYOI3BKNMBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dd5b8924ae03ab9b4f86d856a020e5fa1729f67d73023053b195c32abd4b924","last_reissued_at":"2026-05-18T00:04:00.125975Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:00.125975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.02859","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:04:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EagGdG4RRGz325zPJ6tlgAUc9blaBgVTYvog/89Hta7SJkBUV+bUC4VZVfR0Cspn0RhNgtUe0bKW7N1z8T/hDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T09:17:16.010293Z"},"content_sha256":"30551c4dd7f7a6431fabe1cbf57e6236e59c1cd6229b5679c59e8c10b74932eb","schema_version":"1.0","event_id":"sha256:30551c4dd7f7a6431fabe1cbf57e6236e59c1cd6229b5679c59e8c10b74932eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DXK3RESK4A5LTNHYNWCWUAQOL6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient ZF-WF Strategy for Sum-Rate Maximization of MU-MISO Cognitive Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Lucas Claudino, Taufik Abrao","submitted_at":"2018-10-05T19:27:07Z","abstract_excerpt":"This article presents an efficient quasi-optimal sum rate (SR) maximization technique based on zero-forcing water-filling (ZFWF) algorithm directly applied to cognitive radio networks (CRNs). We have defined the non-convexity nature of the optimization problem in the context of CRNs while we have offered all necessary conditions to solve the related SR maximization problem, which considers power limit at cognitive transmitter and interference levels at primary users (PUs) and secondary users (SUs). A general expression capable to determine the optimal number of users as a function of the main "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02859","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:04:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1raKtfxNb0q5XuAZ8V6rMtawcN9nyxJX76hJCJ1Inqs1ZeuPc/RrE6t2faQHlkTVrb1gDXumNLTXFu5N+JWuBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T09:17:16.010655Z"},"content_sha256":"196b269c4529f1b5ef1ee69e65899383e05ca8af13484051c54966e9eeca11f2","schema_version":"1.0","event_id":"sha256:196b269c4529f1b5ef1ee69e65899383e05ca8af13484051c54966e9eeca11f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DXK3RESK4A5LTNHYNWCWUAQOL6/bundle.json","state_url":"https://pith.science/pith/DXK3RESK4A5LTNHYNWCWUAQOL6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DXK3RESK4A5LTNHYNWCWUAQOL6/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-29T09:17:16Z","links":{"resolver":"https://pith.science/pith/DXK3RESK4A5LTNHYNWCWUAQOL6","bundle":"https://pith.science/pith/DXK3RESK4A5LTNHYNWCWUAQOL6/bundle.json","state":"https://pith.science/pith/DXK3RESK4A5LTNHYNWCWUAQOL6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DXK3RESK4A5LTNHYNWCWUAQOL6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DXK3RESK4A5LTNHYNWCWUAQOL6","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":"8eb3c9f32896f78649cc72824c77403bef1fe8b7b56b1901455c63f042651902","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-10-05T19:27:07Z","title_canon_sha256":"ec8ccb7ca3460ee80e86afbede1038f1aa084c2cc1c45ac169caff3336fab0d5"},"schema_version":"1.0","source":{"id":"1810.02859","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02859","created_at":"2026-05-18T00:04:00Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02859v1","created_at":"2026-05-18T00:04:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02859","created_at":"2026-05-18T00:04:00Z"},{"alias_kind":"pith_short_12","alias_value":"DXK3RESK4A5L","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DXK3RESK4A5LTNHY","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DXK3RESK","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:196b269c4529f1b5ef1ee69e65899383e05ca8af13484051c54966e9eeca11f2","target":"graph","created_at":"2026-05-18T00:04:00Z","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 article presents an efficient quasi-optimal sum rate (SR) maximization technique based on zero-forcing water-filling (ZFWF) algorithm directly applied to cognitive radio networks (CRNs). We have defined the non-convexity nature of the optimization problem in the context of CRNs while we have offered all necessary conditions to solve the related SR maximization problem, which considers power limit at cognitive transmitter and interference levels at primary users (PUs) and secondary users (SUs). A general expression capable to determine the optimal number of users as a function of the main ","authors_text":"Lucas Claudino, Taufik Abrao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-10-05T19:27:07Z","title":"Efficient ZF-WF Strategy for Sum-Rate Maximization of MU-MISO Cognitive Radio Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02859","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:30551c4dd7f7a6431fabe1cbf57e6236e59c1cd6229b5679c59e8c10b74932eb","target":"record","created_at":"2026-05-18T00:04:00Z","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":"8eb3c9f32896f78649cc72824c77403bef1fe8b7b56b1901455c63f042651902","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-10-05T19:27:07Z","title_canon_sha256":"ec8ccb7ca3460ee80e86afbede1038f1aa084c2cc1c45ac169caff3336fab0d5"},"schema_version":"1.0","source":{"id":"1810.02859","kind":"arxiv","version":1}},"canonical_sha256":"1dd5b8924ae03ab9b4f86d856a020e5fa1729f67d73023053b195c32abd4b924","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1dd5b8924ae03ab9b4f86d856a020e5fa1729f67d73023053b195c32abd4b924","first_computed_at":"2026-05-18T00:04:00.125975Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:00.125975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"03Lsp/Zuoehj81bflaxyi1p1SoXfzyt/GCfFKAHUCDJmlbFYKIj9F4WUJAWRci6BF3HSVuhvRhDfYOI3BKNMBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:00.126752Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.02859","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30551c4dd7f7a6431fabe1cbf57e6236e59c1cd6229b5679c59e8c10b74932eb","sha256:196b269c4529f1b5ef1ee69e65899383e05ca8af13484051c54966e9eeca11f2"],"state_sha256":"4c91c062094ca6c620f77aa2560c4366b6ddc3ead897ae4affa6517ea924d202"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vLeEgPk3MAOwwGcxSab/NiKIfcpv1DMqSwmXxnvEzQwvjfLddYJPtK9Oc671m5oXfypNGAW5zdbNj7dykkZxBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T09:17:16.013014Z","bundle_sha256":"73e62d683b850d0b6db741f82b9ddc2c0f7dbe21e52b75b9833a21c07f6caf0a"}}