{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:2QSFI7SE4BO7MYISQ52TUF3TTF","short_pith_number":"pith:2QSFI7SE","canonical_record":{"source":{"id":"1011.1566","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-06T15:38:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3c705cf311ba61db2a274dbc49ff4f427855306d0b34fe726c4ad3540a1a39d7","abstract_canon_sha256":"17266be62137716e1cb06b4ec1a97efd65920b3a7ea5815fc3092b50a39bc60b"},"schema_version":"1.0"},"canonical_sha256":"d424547e44e05df6611287753a1773996966aaf8821926e83b641c085bffa798","source":{"kind":"arxiv","id":"1011.1566","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.1566","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"arxiv_version","alias_value":"1011.1566v2","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1566","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"pith_short_12","alias_value":"2QSFI7SE4BO7","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"2QSFI7SE4BO7MYIS","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"2QSFI7SE","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:2QSFI7SE4BO7MYISQ52TUF3TTF","target":"record","payload":{"canonical_record":{"source":{"id":"1011.1566","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-06T15:38:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3c705cf311ba61db2a274dbc49ff4f427855306d0b34fe726c4ad3540a1a39d7","abstract_canon_sha256":"17266be62137716e1cb06b4ec1a97efd65920b3a7ea5815fc3092b50a39bc60b"},"schema_version":"1.0"},"canonical_sha256":"d424547e44e05df6611287753a1773996966aaf8821926e83b641c085bffa798","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:37.464004Z","signature_b64":"aLdwCbcZTLvYbHwb/GimkhOJq74YVvK+/8eniRwTyvOhKK38Jjx1SckT9YFwGJkwYbUkkUKTxVX1YSh5IUN7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d424547e44e05df6611287753a1773996966aaf8821926e83b641c085bffa798","last_reissued_at":"2026-05-18T02:23:37.463498Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:37.463498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.1566","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-18T02:23:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hv7Z0fl6YJQ3P9X7TF6FICnqgw3a+bTjo1906xaZrjsiVqodQl77yhjlNVpGL0avJRCYwbQhMH2S4LhMI7oODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:19:32.057858Z"},"content_sha256":"f980c17f13fa42ad734c1c8bb1d70c37b8e05eb1571fde7ad269ace9988ebede","schema_version":"1.0","event_id":"sha256:f980c17f13fa42ad734c1c8bb1d70c37b8e05eb1571fde7ad269ace9988ebede"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:2QSFI7SE4BO7MYISQ52TUF3TTF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Rate-Maximization Game Under Bounded Channel Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amod J.G. Anandkumar, Animashree Anandkumar, Jonathon A. Chambers, Sangarapillai Lambotharan","submitted_at":"2010-11-06T15:38:54Z","abstract_excerpt":"We consider the problem of decentralized power allocation for competitive rate-maximization in a frequency-selective Gaussian interference channel under bounded channel uncertainty. We formulate a distribution-free robust framework for the rate-maximization game. We present the robust-optimization equilibrium for this game and derive sufficient conditions for its existence and uniqueness. We show that an iterative waterfilling algorithm converges to this equilibrium under certain sufficient conditions. We analyse the social properties of the equilibrium under varying channel uncertainty bounds"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1566","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-18T02:23:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3j3sPQiw+OsGaPZXAsEutz67xtfWMOKQHmyZIUgQBV6jWzQmnnZFetlv3NfkhCOVHaA/VVkQs39inMvMxoVIDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:19:32.058274Z"},"content_sha256":"43656acc410b04c22f7678975e407f60fc6b41989366a36615415a3307ff44a6","schema_version":"1.0","event_id":"sha256:43656acc410b04c22f7678975e407f60fc6b41989366a36615415a3307ff44a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2QSFI7SE4BO7MYISQ52TUF3TTF/bundle.json","state_url":"https://pith.science/pith/2QSFI7SE4BO7MYISQ52TUF3TTF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2QSFI7SE4BO7MYISQ52TUF3TTF/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-27T14:19:32Z","links":{"resolver":"https://pith.science/pith/2QSFI7SE4BO7MYISQ52TUF3TTF","bundle":"https://pith.science/pith/2QSFI7SE4BO7MYISQ52TUF3TTF/bundle.json","state":"https://pith.science/pith/2QSFI7SE4BO7MYISQ52TUF3TTF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2QSFI7SE4BO7MYISQ52TUF3TTF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:2QSFI7SE4BO7MYISQ52TUF3TTF","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":"17266be62137716e1cb06b4ec1a97efd65920b3a7ea5815fc3092b50a39bc60b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-06T15:38:54Z","title_canon_sha256":"3c705cf311ba61db2a274dbc49ff4f427855306d0b34fe726c4ad3540a1a39d7"},"schema_version":"1.0","source":{"id":"1011.1566","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.1566","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"arxiv_version","alias_value":"1011.1566v2","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1566","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"pith_short_12","alias_value":"2QSFI7SE4BO7","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"2QSFI7SE4BO7MYIS","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"2QSFI7SE","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:43656acc410b04c22f7678975e407f60fc6b41989366a36615415a3307ff44a6","target":"graph","created_at":"2026-05-18T02:23:37Z","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":"We consider the problem of decentralized power allocation for competitive rate-maximization in a frequency-selective Gaussian interference channel under bounded channel uncertainty. We formulate a distribution-free robust framework for the rate-maximization game. We present the robust-optimization equilibrium for this game and derive sufficient conditions for its existence and uniqueness. We show that an iterative waterfilling algorithm converges to this equilibrium under certain sufficient conditions. We analyse the social properties of the equilibrium under varying channel uncertainty bounds","authors_text":"Amod J.G. Anandkumar, Animashree Anandkumar, Jonathon A. Chambers, Sangarapillai Lambotharan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-06T15:38:54Z","title":"Robust Rate-Maximization Game Under Bounded Channel Uncertainty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1566","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:f980c17f13fa42ad734c1c8bb1d70c37b8e05eb1571fde7ad269ace9988ebede","target":"record","created_at":"2026-05-18T02:23:37Z","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":"17266be62137716e1cb06b4ec1a97efd65920b3a7ea5815fc3092b50a39bc60b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-06T15:38:54Z","title_canon_sha256":"3c705cf311ba61db2a274dbc49ff4f427855306d0b34fe726c4ad3540a1a39d7"},"schema_version":"1.0","source":{"id":"1011.1566","kind":"arxiv","version":2}},"canonical_sha256":"d424547e44e05df6611287753a1773996966aaf8821926e83b641c085bffa798","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d424547e44e05df6611287753a1773996966aaf8821926e83b641c085bffa798","first_computed_at":"2026-05-18T02:23:37.463498Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:37.463498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aLdwCbcZTLvYbHwb/GimkhOJq74YVvK+/8eniRwTyvOhKK38Jjx1SckT9YFwGJkwYbUkkUKTxVX1YSh5IUN7BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:37.464004Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.1566","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f980c17f13fa42ad734c1c8bb1d70c37b8e05eb1571fde7ad269ace9988ebede","sha256:43656acc410b04c22f7678975e407f60fc6b41989366a36615415a3307ff44a6"],"state_sha256":"022cad6d6c34b4c37a1bb0305cdf696bef4f1323495291f1c3b59d9d4de1aa0c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pGhF4+jjoDN7DW2Nmq6J0MM+SZCSTNRXQbAMWj6cGuCHlir3bUAOMb3Qotq0HGUY1CmEfLPH0poNmg5VYE0fAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:19:32.061030Z","bundle_sha256":"48395475574997140fe95e533b511cc7628a13a4ac94b0c53cf21bd580e1a9b4"}}