{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4IAI24NPNGZYC57TRFO47ZL3CF","short_pith_number":"pith:4IAI24NP","schema_version":"1.0","canonical_sha256":"e2008d71af69b38177f3895dcfe57b114f851679f4062803cd015eea90efc39d","source":{"kind":"arxiv","id":"1305.5222","version":1},"attestation_state":"computed","paper":{"title":"A Game Theory Interpretation for Multiple Access in Cognitive Radio Networks with Random Number of Secondary Users","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.GT","authors_text":"Abdallah Shami, Oscar Filio Rodriguez, Serguei Primak, Valeri Kontorovich","submitted_at":"2013-05-22T18:34:55Z","abstract_excerpt":"In this paper a new multiple access algorithm for cognitive radio networks based on game theory is presented. We address the problem of a multiple access system where the number of users and their types are unknown. In order to do this, the framework is modelled as a non-cooperative Poisson game in which all the players are unaware of the total number of devices participating (population uncertainty). We propose a scheme where failed attempts to transmit (collisions) are penalized. In terms of this, we calculate the optimum penalization in mixed strategies. The proposed scheme conveys to a Nas"},"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":"1305.5222","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-05-22T18:34:55Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"5b5ecc31060c9d67b6419ab1e7f5962eb9569216451064a1d299e3ab0b6289aa","abstract_canon_sha256":"fa80a5d4afc1df2f5782b1bf7a0c4604d2d98fbec39dcf754848fcd60828fc70"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:05.298200Z","signature_b64":"aESV4N0wqlsPy11k9Cp26DqCEAtoGJlAXg1acJ7yHHdsg40iUYdOUdkX78vYktOwctxqcYdsn58MdfVRPB2sBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2008d71af69b38177f3895dcfe57b114f851679f4062803cd015eea90efc39d","last_reissued_at":"2026-05-18T03:25:05.297625Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:05.297625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Game Theory Interpretation for Multiple Access in Cognitive Radio Networks with Random Number of Secondary Users","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.GT","authors_text":"Abdallah Shami, Oscar Filio Rodriguez, Serguei Primak, Valeri Kontorovich","submitted_at":"2013-05-22T18:34:55Z","abstract_excerpt":"In this paper a new multiple access algorithm for cognitive radio networks based on game theory is presented. We address the problem of a multiple access system where the number of users and their types are unknown. In order to do this, the framework is modelled as a non-cooperative Poisson game in which all the players are unaware of the total number of devices participating (population uncertainty). We propose a scheme where failed attempts to transmit (collisions) are penalized. In terms of this, we calculate the optimum penalization in mixed strategies. The proposed scheme conveys to a Nas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5222","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":"1305.5222","created_at":"2026-05-18T03:25:05.297733+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.5222v1","created_at":"2026-05-18T03:25:05.297733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5222","created_at":"2026-05-18T03:25:05.297733+00:00"},{"alias_kind":"pith_short_12","alias_value":"4IAI24NPNGZY","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4IAI24NPNGZYC57T","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4IAI24NP","created_at":"2026-05-18T12:27:34.582898+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/4IAI24NPNGZYC57TRFO47ZL3CF","json":"https://pith.science/pith/4IAI24NPNGZYC57TRFO47ZL3CF.json","graph_json":"https://pith.science/api/pith-number/4IAI24NPNGZYC57TRFO47ZL3CF/graph.json","events_json":"https://pith.science/api/pith-number/4IAI24NPNGZYC57TRFO47ZL3CF/events.json","paper":"https://pith.science/paper/4IAI24NP"},"agent_actions":{"view_html":"https://pith.science/pith/4IAI24NPNGZYC57TRFO47ZL3CF","download_json":"https://pith.science/pith/4IAI24NPNGZYC57TRFO47ZL3CF.json","view_paper":"https://pith.science/paper/4IAI24NP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.5222&json=true","fetch_graph":"https://pith.science/api/pith-number/4IAI24NPNGZYC57TRFO47ZL3CF/graph.json","fetch_events":"https://pith.science/api/pith-number/4IAI24NPNGZYC57TRFO47ZL3CF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4IAI24NPNGZYC57TRFO47ZL3CF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4IAI24NPNGZYC57TRFO47ZL3CF/action/storage_attestation","attest_author":"https://pith.science/pith/4IAI24NPNGZYC57TRFO47ZL3CF/action/author_attestation","sign_citation":"https://pith.science/pith/4IAI24NPNGZYC57TRFO47ZL3CF/action/citation_signature","submit_replication":"https://pith.science/pith/4IAI24NPNGZYC57TRFO47ZL3CF/action/replication_record"}},"created_at":"2026-05-18T03:25:05.297733+00:00","updated_at":"2026-05-18T03:25:05.297733+00:00"}