{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4IAI24NPNGZYC57TRFO47ZL3CF","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":"fa80a5d4afc1df2f5782b1bf7a0c4604d2d98fbec39dcf754848fcd60828fc70","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-05-22T18:34:55Z","title_canon_sha256":"5b5ecc31060c9d67b6419ab1e7f5962eb9569216451064a1d299e3ab0b6289aa"},"schema_version":"1.0","source":{"id":"1305.5222","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.5222","created_at":"2026-05-18T03:25:05Z"},{"alias_kind":"arxiv_version","alias_value":"1305.5222v1","created_at":"2026-05-18T03:25:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5222","created_at":"2026-05-18T03:25:05Z"},{"alias_kind":"pith_short_12","alias_value":"4IAI24NPNGZY","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4IAI24NPNGZYC57T","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4IAI24NP","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:9b64cec2c59e819a52678d9f44d7e39d30a272750c0b22d02d9f13d9c101b862","target":"graph","created_at":"2026-05-18T03:25:05Z","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":"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","authors_text":"Abdallah Shami, Oscar Filio Rodriguez, Serguei Primak, Valeri Kontorovich","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-05-22T18:34:55Z","title":"A Game Theory Interpretation for Multiple Access in Cognitive Radio Networks with Random Number of Secondary Users"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5222","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:2c55e3dd868a0e712b1c33777378ceccc61aec2c9cc7cc1f21ab6559231b83b9","target":"record","created_at":"2026-05-18T03:25:05Z","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":"fa80a5d4afc1df2f5782b1bf7a0c4604d2d98fbec39dcf754848fcd60828fc70","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-05-22T18:34:55Z","title_canon_sha256":"5b5ecc31060c9d67b6419ab1e7f5962eb9569216451064a1d299e3ab0b6289aa"},"schema_version":"1.0","source":{"id":"1305.5222","kind":"arxiv","version":1}},"canonical_sha256":"e2008d71af69b38177f3895dcfe57b114f851679f4062803cd015eea90efc39d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2008d71af69b38177f3895dcfe57b114f851679f4062803cd015eea90efc39d","first_computed_at":"2026-05-18T03:25:05.297625Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:05.297625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aESV4N0wqlsPy11k9Cp26DqCEAtoGJlAXg1acJ7yHHdsg40iUYdOUdkX78vYktOwctxqcYdsn58MdfVRPB2sBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:05.298200Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.5222","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c55e3dd868a0e712b1c33777378ceccc61aec2c9cc7cc1f21ab6559231b83b9","sha256:9b64cec2c59e819a52678d9f44d7e39d30a272750c0b22d02d9f13d9c101b862"],"state_sha256":"8702d6d6a4e262a7d52f64de7afdc3f857b49202239c729e7cef1ff5b5e3e2b6"}