{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:J2X2X7T6NA5XBNITZW72OFIW25","short_pith_number":"pith:J2X2X7T6","canonical_record":{"source":{"id":"0803.1323","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-03-09T21:22:19Z","cross_cats_sorted":["cs.GT","math.IT"],"title_canon_sha256":"46108ec962c65693a57a283c8429ebb3cf83a599f3b5a496b48ece3bb48ede2b","abstract_canon_sha256":"2790cc9e1c959b9881c3dee0c902161756fb8dceea7375db97f5ed512a38c1bc"},"schema_version":"1.0"},"canonical_sha256":"4eafabfe7e683b70b513cdbfa71516d75a0e3a4717ff14232a5ad54dd74f1fdf","source":{"kind":"arxiv","id":"0803.1323","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0803.1323","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"0803.1323v2","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0803.1323","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"J2X2X7T6NA5X","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"J2X2X7T6NA5XBNIT","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"J2X2X7T6","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:J2X2X7T6NA5XBNITZW72OFIW25","target":"record","payload":{"canonical_record":{"source":{"id":"0803.1323","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-03-09T21:22:19Z","cross_cats_sorted":["cs.GT","math.IT"],"title_canon_sha256":"46108ec962c65693a57a283c8429ebb3cf83a599f3b5a496b48ece3bb48ede2b","abstract_canon_sha256":"2790cc9e1c959b9881c3dee0c902161756fb8dceea7375db97f5ed512a38c1bc"},"schema_version":"1.0"},"canonical_sha256":"4eafabfe7e683b70b513cdbfa71516d75a0e3a4717ff14232a5ad54dd74f1fdf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:11.893551Z","signature_b64":"wMFZXiJif5HuTjHWLKSESG7R2QlM/6nQ9nbihZI1efK3db3hQ3SLACABui6d2RrSxXIRt624YNauO7+W2y7nDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4eafabfe7e683b70b513cdbfa71516d75a0e3a4717ff14232a5ad54dd74f1fdf","last_reissued_at":"2026-05-18T00:59:11.892709Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:11.892709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0803.1323","source_version":2,"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:59:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PaWhbsItRIQJG8ReoWVb6HLwk7miSPSivR4fRNkd2VqCQJ7QNjuEtC2hAskLrXuG90faWmKQZ1vAMW3FNoMfAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:27:43.001234Z"},"content_sha256":"eb69eeadb09adbe81706e7c15bd83901e0deb172547ca07f87e79a395c5100af","schema_version":"1.0","event_id":"sha256:eb69eeadb09adbe81706e7c15bd83901e0deb172547ca07f87e79a395c5100af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:J2X2X7T6NA5XBNITZW72OFIW25","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Game Theoretic Framework for Decentralized Power Allocation in IDMA Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","math.IT"],"primary_cat":"cs.IT","authors_text":"Laura Cottatellucci, Merouane Debbah, Samir Medina Perlaza","submitted_at":"2008-03-09T21:22:19Z","abstract_excerpt":"In this contribution we present a decentralized power allocation algorithm for the uplink interleave division multiple access (IDMA) channel. Within the proposed optimal strategy for power allocation, each user aims at selfishly maximizing its own utility function. An iterative chip by chip (CBC) decoder at the receiver and a rational selfish behavior of all the users according to a classical game-theoretical framework are the underlying assumptions of this work. This approach leads to a power allocation based on a channel inversion policy where the optimal power level is set locally at each t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0803.1323","kind":"arxiv","version":2},"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:59:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JeIR+xrB/JhkElkfLQ9NgGjSE6yQTlLoHkLKLAhCQVdGkyDCAZizC73xMmogEoEo4P6femIDwu1WUwXHdOUrDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:27:43.001637Z"},"content_sha256":"ba81cbdd170fa292faf97a5302f1585d1299a531366d07af0d7d8068760ffa71","schema_version":"1.0","event_id":"sha256:ba81cbdd170fa292faf97a5302f1585d1299a531366d07af0d7d8068760ffa71"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J2X2X7T6NA5XBNITZW72OFIW25/bundle.json","state_url":"https://pith.science/pith/J2X2X7T6NA5XBNITZW72OFIW25/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J2X2X7T6NA5XBNITZW72OFIW25/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-04T18:27:43Z","links":{"resolver":"https://pith.science/pith/J2X2X7T6NA5XBNITZW72OFIW25","bundle":"https://pith.science/pith/J2X2X7T6NA5XBNITZW72OFIW25/bundle.json","state":"https://pith.science/pith/J2X2X7T6NA5XBNITZW72OFIW25/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J2X2X7T6NA5XBNITZW72OFIW25/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:J2X2X7T6NA5XBNITZW72OFIW25","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":"2790cc9e1c959b9881c3dee0c902161756fb8dceea7375db97f5ed512a38c1bc","cross_cats_sorted":["cs.GT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-03-09T21:22:19Z","title_canon_sha256":"46108ec962c65693a57a283c8429ebb3cf83a599f3b5a496b48ece3bb48ede2b"},"schema_version":"1.0","source":{"id":"0803.1323","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0803.1323","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"0803.1323v2","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0803.1323","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"J2X2X7T6NA5X","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"J2X2X7T6NA5XBNIT","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"J2X2X7T6","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:ba81cbdd170fa292faf97a5302f1585d1299a531366d07af0d7d8068760ffa71","target":"graph","created_at":"2026-05-18T00:59:11Z","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 contribution we present a decentralized power allocation algorithm for the uplink interleave division multiple access (IDMA) channel. Within the proposed optimal strategy for power allocation, each user aims at selfishly maximizing its own utility function. An iterative chip by chip (CBC) decoder at the receiver and a rational selfish behavior of all the users according to a classical game-theoretical framework are the underlying assumptions of this work. This approach leads to a power allocation based on a channel inversion policy where the optimal power level is set locally at each t","authors_text":"Laura Cottatellucci, Merouane Debbah, Samir Medina Perlaza","cross_cats":["cs.GT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-03-09T21:22:19Z","title":"A Game Theoretic Framework for Decentralized Power Allocation in IDMA Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0803.1323","kind":"arxiv","version":2},"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:eb69eeadb09adbe81706e7c15bd83901e0deb172547ca07f87e79a395c5100af","target":"record","created_at":"2026-05-18T00:59:11Z","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":"2790cc9e1c959b9881c3dee0c902161756fb8dceea7375db97f5ed512a38c1bc","cross_cats_sorted":["cs.GT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-03-09T21:22:19Z","title_canon_sha256":"46108ec962c65693a57a283c8429ebb3cf83a599f3b5a496b48ece3bb48ede2b"},"schema_version":"1.0","source":{"id":"0803.1323","kind":"arxiv","version":2}},"canonical_sha256":"4eafabfe7e683b70b513cdbfa71516d75a0e3a4717ff14232a5ad54dd74f1fdf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4eafabfe7e683b70b513cdbfa71516d75a0e3a4717ff14232a5ad54dd74f1fdf","first_computed_at":"2026-05-18T00:59:11.892709Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:11.892709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wMFZXiJif5HuTjHWLKSESG7R2QlM/6nQ9nbihZI1efK3db3hQ3SLACABui6d2RrSxXIRt624YNauO7+W2y7nDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:11.893551Z","signed_message":"canonical_sha256_bytes"},"source_id":"0803.1323","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb69eeadb09adbe81706e7c15bd83901e0deb172547ca07f87e79a395c5100af","sha256:ba81cbdd170fa292faf97a5302f1585d1299a531366d07af0d7d8068760ffa71"],"state_sha256":"8eb64def3b158a693565405ea3c06ca3eb8fd3e1fa0ffce0d84cca5c12c3f093"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dqeaP2KweQcLEPiUGs/0H8Q4i714BzoIyQA0QEwpvyIOPv1AW8gio2AZse4wlbrqFiBqt0CWHiHgRqgYa9paDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T18:27:43.004504Z","bundle_sha256":"cc410eb78ffa7a1c454937cf699e35ef27e12cd6e0ebfc5dd7076df55089c517"}}