{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HWE2EWH77V2EU3BQEQMBZLR3V7","short_pith_number":"pith:HWE2EWH7","canonical_record":{"source":{"id":"1407.3556","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-14T08:08:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ccd9b265f1267dc5df0c82e256797eec69ebb7465ac5b1c0a30c23bc1aa84efb","abstract_canon_sha256":"11ce51023ad66de19ff19e4c2881bf3ec4c8af8ed36f9185d9d99ac6efe3ee3d"},"schema_version":"1.0"},"canonical_sha256":"3d89a258fffd744a6c3024181cae3bafe9ca30d1049f624d35f694ec1eee6d94","source":{"kind":"arxiv","id":"1407.3556","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3556","created_at":"2026-05-18T00:10:14Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3556v2","created_at":"2026-05-18T00:10:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3556","created_at":"2026-05-18T00:10:14Z"},{"alias_kind":"pith_short_12","alias_value":"HWE2EWH77V2E","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HWE2EWH77V2EU3BQ","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HWE2EWH7","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HWE2EWH77V2EU3BQEQMBZLR3V7","target":"record","payload":{"canonical_record":{"source":{"id":"1407.3556","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-14T08:08:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ccd9b265f1267dc5df0c82e256797eec69ebb7465ac5b1c0a30c23bc1aa84efb","abstract_canon_sha256":"11ce51023ad66de19ff19e4c2881bf3ec4c8af8ed36f9185d9d99ac6efe3ee3d"},"schema_version":"1.0"},"canonical_sha256":"3d89a258fffd744a6c3024181cae3bafe9ca30d1049f624d35f694ec1eee6d94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:14.373172Z","signature_b64":"whJrUoCJXjo4SEi36VoWCjB4+lyC65cz+7OJCrSwxcHSGLByexRzxwWOWGsnnj8yFngqqVsFdlFGVM3qaKdLCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d89a258fffd744a6c3024181cae3bafe9ca30d1049f624d35f694ec1eee6d94","last_reissued_at":"2026-05-18T00:10:14.372659Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:14.372659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.3556","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:10:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jImTHQzF9uCBKQBKeMUbg9gohzeO2ZQJWbXpdb13WQFOk65NiTJV5Z8wJBBwANOGsK+N07RvMsSLCF8AKwZPBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:18:38.240469Z"},"content_sha256":"98a92ac306a0ae3937a9bdb88a2d31ea7181f8bc17a553b401af91ecb64d3973","schema_version":"1.0","event_id":"sha256:98a92ac306a0ae3937a9bdb88a2d31ea7181f8bc17a553b401af91ecb64d3973"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HWE2EWH77V2EU3BQEQMBZLR3V7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Spectrum Management in Two-User Interference Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Himanshu Gupta, Navid Hamedazimi","submitted_at":"2014-07-14T08:08:56Z","abstract_excerpt":"In this work, we address the problem of optimal spectrum management in continuous frequency domain in multiuser interference channels. The objective is to maximize the weighted sum of user capacities. Our main results are as follows: (i) For frequency-selective channels, we prove that in an optimal solution, each user uses maximum power; this result also generalizes to the cases where the objective is to maximize the weighted product (i.e., proportional fairness) of user capacities. (ii) For the special case of two users in flat channels, we solve the problem optimally."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3556","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:10:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kfz216u5gRcQINXepYUVtkdeYx7vmC6RuHzaPlgks2xOUyuNtK2LagNYMBc4OgeLXI7zmnYfyDVVrdXuKI2IDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:18:38.241031Z"},"content_sha256":"a7f3b12484a4e6d098a304b8b8eff367ee3fb43188abaed336f4809521e2d8c1","schema_version":"1.0","event_id":"sha256:a7f3b12484a4e6d098a304b8b8eff367ee3fb43188abaed336f4809521e2d8c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HWE2EWH77V2EU3BQEQMBZLR3V7/bundle.json","state_url":"https://pith.science/pith/HWE2EWH77V2EU3BQEQMBZLR3V7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HWE2EWH77V2EU3BQEQMBZLR3V7/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-07T16:18:38Z","links":{"resolver":"https://pith.science/pith/HWE2EWH77V2EU3BQEQMBZLR3V7","bundle":"https://pith.science/pith/HWE2EWH77V2EU3BQEQMBZLR3V7/bundle.json","state":"https://pith.science/pith/HWE2EWH77V2EU3BQEQMBZLR3V7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HWE2EWH77V2EU3BQEQMBZLR3V7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HWE2EWH77V2EU3BQEQMBZLR3V7","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":"11ce51023ad66de19ff19e4c2881bf3ec4c8af8ed36f9185d9d99ac6efe3ee3d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-14T08:08:56Z","title_canon_sha256":"ccd9b265f1267dc5df0c82e256797eec69ebb7465ac5b1c0a30c23bc1aa84efb"},"schema_version":"1.0","source":{"id":"1407.3556","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3556","created_at":"2026-05-18T00:10:14Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3556v2","created_at":"2026-05-18T00:10:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3556","created_at":"2026-05-18T00:10:14Z"},{"alias_kind":"pith_short_12","alias_value":"HWE2EWH77V2E","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HWE2EWH77V2EU3BQ","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HWE2EWH7","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:a7f3b12484a4e6d098a304b8b8eff367ee3fb43188abaed336f4809521e2d8c1","target":"graph","created_at":"2026-05-18T00:10:14Z","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 work, we address the problem of optimal spectrum management in continuous frequency domain in multiuser interference channels. The objective is to maximize the weighted sum of user capacities. Our main results are as follows: (i) For frequency-selective channels, we prove that in an optimal solution, each user uses maximum power; this result also generalizes to the cases where the objective is to maximize the weighted product (i.e., proportional fairness) of user capacities. (ii) For the special case of two users in flat channels, we solve the problem optimally.","authors_text":"Himanshu Gupta, Navid Hamedazimi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-14T08:08:56Z","title":"Optimal Spectrum Management in Two-User Interference Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3556","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:98a92ac306a0ae3937a9bdb88a2d31ea7181f8bc17a553b401af91ecb64d3973","target":"record","created_at":"2026-05-18T00:10:14Z","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":"11ce51023ad66de19ff19e4c2881bf3ec4c8af8ed36f9185d9d99ac6efe3ee3d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-14T08:08:56Z","title_canon_sha256":"ccd9b265f1267dc5df0c82e256797eec69ebb7465ac5b1c0a30c23bc1aa84efb"},"schema_version":"1.0","source":{"id":"1407.3556","kind":"arxiv","version":2}},"canonical_sha256":"3d89a258fffd744a6c3024181cae3bafe9ca30d1049f624d35f694ec1eee6d94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d89a258fffd744a6c3024181cae3bafe9ca30d1049f624d35f694ec1eee6d94","first_computed_at":"2026-05-18T00:10:14.372659Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:14.372659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"whJrUoCJXjo4SEi36VoWCjB4+lyC65cz+7OJCrSwxcHSGLByexRzxwWOWGsnnj8yFngqqVsFdlFGVM3qaKdLCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:14.373172Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.3556","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98a92ac306a0ae3937a9bdb88a2d31ea7181f8bc17a553b401af91ecb64d3973","sha256:a7f3b12484a4e6d098a304b8b8eff367ee3fb43188abaed336f4809521e2d8c1"],"state_sha256":"e055cf5fbf5d253994809cef1db7e9ccaba5248d554100f2b41f5b7e2ebe7fcf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y2uveRSeWayisL4WmSW3XSUOqT9uVTf3ueIg7KWPlsm78fFzg2IIrIVNiW8vFg9LlwbazG8mJH8sLyLXH9AvAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T16:18:38.244265Z","bundle_sha256":"c7f2affc62b09b9691f3d78980e228c83519c1b10e742bb193b55e70d32b1c92"}}