{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:66JAILMXOQRFCRTDDW5UK5ESBQ","short_pith_number":"pith:66JAILMX","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"},"canonical_sha256":"f792042d9774225146631dbb4574920c134d37006b18f03589567f2e6f941914","source":{"kind":"arxiv","id":"1103.4873","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.4873","created_at":"2026-05-18T04:25:48Z"},{"alias_kind":"arxiv_version","alias_value":"1103.4873v1","created_at":"2026-05-18T04:25:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4873","created_at":"2026-05-18T04:25:48Z"},{"alias_kind":"pith_short_12","alias_value":"66JAILMXOQRF","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"66JAILMXOQRFCRTD","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"66JAILMX","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:66JAILMXOQRFCRTDDW5UK5ESBQ","target":"record","payload":{"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"},"canonical_sha256":"f792042d9774225146631dbb4574920c134d37006b18f03589567f2e6f941914","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"},"source_kind":"arxiv","source_id":"1103.4873","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-18T04:25:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xvjDT1mQguGLeNX5KRZSleULCCwMo/PUnXIAxPWokdfL8Y9SuVgtOUruZJ0SWu9AuAWDeEVkKaWJuSC2vWlcDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T18:45:13.871675Z"},"content_sha256":"2552735a2a7168d321cb2887521de8da3b6ca7a3bc683b64aa03d502659c6301","schema_version":"1.0","event_id":"sha256:2552735a2a7168d321cb2887521de8da3b6ca7a3bc683b64aa03d502659c6301"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:66JAILMXOQRFCRTDDW5UK5ESBQ","target":"graph","payload":{"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"},"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-18T04:25:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"29XC9YGxStc3MoocTJ0XAR8TdBWKYv1PjNpmkTkNDeD6JpJPB+Fb6heemetgblEY0YkQ1wf+8aVxvm94K9PTCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T18:45:13.872032Z"},"content_sha256":"e52195bd3a3b1506fb65dd679619084f225b130bede7551498e893294d05cd73","schema_version":"1.0","event_id":"sha256:e52195bd3a3b1506fb65dd679619084f225b130bede7551498e893294d05cd73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/66JAILMXOQRFCRTDDW5UK5ESBQ/bundle.json","state_url":"https://pith.science/pith/66JAILMXOQRFCRTDDW5UK5ESBQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/66JAILMXOQRFCRTDDW5UK5ESBQ/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-19T18:45:13Z","links":{"resolver":"https://pith.science/pith/66JAILMXOQRFCRTDDW5UK5ESBQ","bundle":"https://pith.science/pith/66JAILMXOQRFCRTDDW5UK5ESBQ/bundle.json","state":"https://pith.science/pith/66JAILMXOQRFCRTDDW5UK5ESBQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/66JAILMXOQRFCRTDDW5UK5ESBQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:66JAILMXOQRFCRTDDW5UK5ESBQ","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":"720ede5217d0786d6d2d86fc45bbf849e07e4375fb8f2614770ac35555863b39","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-03-24T20:44:55Z","title_canon_sha256":"dc427ae010f39191dedc513e9ee48b208822982e1468505452debde05e4c0613"},"schema_version":"1.0","source":{"id":"1103.4873","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.4873","created_at":"2026-05-18T04:25:48Z"},{"alias_kind":"arxiv_version","alias_value":"1103.4873v1","created_at":"2026-05-18T04:25:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4873","created_at":"2026-05-18T04:25:48Z"},{"alias_kind":"pith_short_12","alias_value":"66JAILMXOQRF","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"66JAILMXOQRFCRTD","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"66JAILMX","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:e52195bd3a3b1506fb65dd679619084f225b130bede7551498e893294d05cd73","target":"graph","created_at":"2026-05-18T04:25:48Z","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 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","authors_text":"Ahmad R. Sharafat, Saeedeh Parsaeefard","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-03-24T20:44:55Z","title":"Robust Spectrum Sharing via Worst Case Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.4873","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:2552735a2a7168d321cb2887521de8da3b6ca7a3bc683b64aa03d502659c6301","target":"record","created_at":"2026-05-18T04:25:48Z","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":"720ede5217d0786d6d2d86fc45bbf849e07e4375fb8f2614770ac35555863b39","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-03-24T20:44:55Z","title_canon_sha256":"dc427ae010f39191dedc513e9ee48b208822982e1468505452debde05e4c0613"},"schema_version":"1.0","source":{"id":"1103.4873","kind":"arxiv","version":1}},"canonical_sha256":"f792042d9774225146631dbb4574920c134d37006b18f03589567f2e6f941914","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f792042d9774225146631dbb4574920c134d37006b18f03589567f2e6f941914","first_computed_at":"2026-05-18T04:25:48.494901Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:25:48.494901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lMBSudIIxbJ/tdPdqGA/DJMPzY2XwozZh2G0Z37JtMCCeDy67XwkjifgpskbGgVhsxoE2bqdStRrQulciUt3BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:25:48.495566Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.4873","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2552735a2a7168d321cb2887521de8da3b6ca7a3bc683b64aa03d502659c6301","sha256:e52195bd3a3b1506fb65dd679619084f225b130bede7551498e893294d05cd73"],"state_sha256":"81415b08d986b226d614bb5ce7fbcf459f922e3d03d9ca8e1a4ae39ee7c7475b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ITmKhNrX/ECmsplFc/HBLpkYOejmx43ItYw5ud60fGpUVXgCCaSsTF9zLKg+tJrXOMqce9U5TAqEJwCjDYvDDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T18:45:13.874171Z","bundle_sha256":"e6abfa94e8e816a215e60e9b8acac05602301c3af72c79e430da67a1072fb174"}}