{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:66JAILMXOQRFCRTDDW5UK5ESBQ","short_pith_number":"pith:66JAILMX","schema_version":"1.0","canonical_sha256":"f792042d9774225146631dbb4574920c134d37006b18f03589567f2e6f941914","source":{"kind":"arxiv","id":"1103.4873","version":1},"attestation_state":"computed","paper":{"title":"Robust Spectrum Sharing via Worst Case Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ahmad R. Sharafat, Saeedeh Parsaeefard","submitted_at":"2011-03-24T20:44:55Z","abstract_excerpt":"This paper considers non-cooperative and fully-distributed power-allocation for secondary-users (SUs) in spectrum-sharing environments when normalized-interference to each secondary-user is uncertain. We model each uncertain parameter by the sum of its nominal (estimated) value and a bounded additive error in a convex set, and show that the allocated power always converges to its equilibrium, called robust Nash equilibrium (RNE). In the case of a bounded and symmetric uncertainty set, we show that the power allocation problem for each SU is simplified, and can be solved in a distributed manner"},"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":"1103.4873","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-03-24T20:44:55Z","cross_cats_sorted":[],"title_canon_sha256":"dc427ae010f39191dedc513e9ee48b208822982e1468505452debde05e4c0613","abstract_canon_sha256":"720ede5217d0786d6d2d86fc45bbf849e07e4375fb8f2614770ac35555863b39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:48.495566Z","signature_b64":"lMBSudIIxbJ/tdPdqGA/DJMPzY2XwozZh2G0Z37JtMCCeDy67XwkjifgpskbGgVhsxoE2bqdStRrQulciUt3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f792042d9774225146631dbb4574920c134d37006b18f03589567f2e6f941914","last_reissued_at":"2026-05-18T04:25:48.494901Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:48.494901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Spectrum Sharing via Worst Case Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ahmad R. Sharafat, Saeedeh Parsaeefard","submitted_at":"2011-03-24T20:44:55Z","abstract_excerpt":"This paper considers non-cooperative and fully-distributed power-allocation for secondary-users (SUs) in spectrum-sharing environments when normalized-interference to each secondary-user is uncertain. We model each uncertain parameter by the sum of its nominal (estimated) value and a bounded additive error in a convex set, and show that the allocated power always converges to its equilibrium, called robust Nash equilibrium (RNE). In the case of a bounded and symmetric uncertainty set, we show that the power allocation problem for each SU is simplified, and can be solved in a distributed manner"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.4873","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":"1103.4873","created_at":"2026-05-18T04:25:48.495006+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.4873v1","created_at":"2026-05-18T04:25:48.495006+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4873","created_at":"2026-05-18T04:25:48.495006+00:00"},{"alias_kind":"pith_short_12","alias_value":"66JAILMXOQRF","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"66JAILMXOQRFCRTD","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"66JAILMX","created_at":"2026-05-18T12:26:22.705136+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/66JAILMXOQRFCRTDDW5UK5ESBQ","json":"https://pith.science/pith/66JAILMXOQRFCRTDDW5UK5ESBQ.json","graph_json":"https://pith.science/api/pith-number/66JAILMXOQRFCRTDDW5UK5ESBQ/graph.json","events_json":"https://pith.science/api/pith-number/66JAILMXOQRFCRTDDW5UK5ESBQ/events.json","paper":"https://pith.science/paper/66JAILMX"},"agent_actions":{"view_html":"https://pith.science/pith/66JAILMXOQRFCRTDDW5UK5ESBQ","download_json":"https://pith.science/pith/66JAILMXOQRFCRTDDW5UK5ESBQ.json","view_paper":"https://pith.science/paper/66JAILMX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.4873&json=true","fetch_graph":"https://pith.science/api/pith-number/66JAILMXOQRFCRTDDW5UK5ESBQ/graph.json","fetch_events":"https://pith.science/api/pith-number/66JAILMXOQRFCRTDDW5UK5ESBQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/66JAILMXOQRFCRTDDW5UK5ESBQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/66JAILMXOQRFCRTDDW5UK5ESBQ/action/storage_attestation","attest_author":"https://pith.science/pith/66JAILMXOQRFCRTDDW5UK5ESBQ/action/author_attestation","sign_citation":"https://pith.science/pith/66JAILMXOQRFCRTDDW5UK5ESBQ/action/citation_signature","submit_replication":"https://pith.science/pith/66JAILMXOQRFCRTDDW5UK5ESBQ/action/replication_record"}},"created_at":"2026-05-18T04:25:48.495006+00:00","updated_at":"2026-05-18T04:25:48.495006+00:00"}