{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:V2ABABVX4KCYNPL2JUYHHPTR5L","short_pith_number":"pith:V2ABABVX","canonical_record":{"source":{"id":"1211.2487","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-12T01:15:30Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"b5a4609486a25bdc2f12b1d4dd7772cf2b13a80375ac80bdf16df1092aaa6a14","abstract_canon_sha256":"98c7b79057c4696b408183f4ad45844e1e5e1d0fb60f94f6944ca649979f0910"},"schema_version":"1.0"},"canonical_sha256":"ae801006b7e28586bd7a4d3073be71eae872419c018018ee9b84841874f63439","source":{"kind":"arxiv","id":"1211.2487","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2487","created_at":"2026-05-18T03:41:03Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2487v1","created_at":"2026-05-18T03:41:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2487","created_at":"2026-05-18T03:41:03Z"},{"alias_kind":"pith_short_12","alias_value":"V2ABABVX4KCY","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"V2ABABVX4KCYNPL2","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"V2ABABVX","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:V2ABABVX4KCYNPL2JUYHHPTR5L","target":"record","payload":{"canonical_record":{"source":{"id":"1211.2487","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-12T01:15:30Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"b5a4609486a25bdc2f12b1d4dd7772cf2b13a80375ac80bdf16df1092aaa6a14","abstract_canon_sha256":"98c7b79057c4696b408183f4ad45844e1e5e1d0fb60f94f6944ca649979f0910"},"schema_version":"1.0"},"canonical_sha256":"ae801006b7e28586bd7a4d3073be71eae872419c018018ee9b84841874f63439","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:03.190841Z","signature_b64":"zqVVrCXjibBJzXTKMT6wMNE9G06Z/THmY/0BeWBLmzai58zj7mEAqDOzX63HY3lglhHPgMRkiAnAepDDeQBDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae801006b7e28586bd7a4d3073be71eae872419c018018ee9b84841874f63439","last_reissued_at":"2026-05-18T03:41:03.190355Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:03.190355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.2487","source_version":1,"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-18T03:41:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kYm2v36u1OZeC3AkwR14Y6yZQmqabhAGjtrgOyBC/0vkAfy2wvf+Pzqp1Eh2wFGOMEtDUK8UTuKMLATTtmkmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:29:48.335969Z"},"content_sha256":"c39d37713d1ca75ee3ba9922d92e5554935e58d409eb64e8882706fa47b7097b","schema_version":"1.0","event_id":"sha256:c39d37713d1ca75ee3ba9922d92e5554935e58d409eb64e8882706fa47b7097b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:V2ABABVX4KCYNPL2JUYHHPTR5L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Power Control and Interference Management in Dense Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Ehsan Karamad, Jerry Chow, Raviraj Adve","submitted_at":"2012-11-12T01:15:30Z","abstract_excerpt":"We address the problem of interference management and power control in terms of maximization of a general utility function. For the utility functions under consideration, we propose a power control algorithm based on a fixed-point iteration; further, we prove local convergence of the algorithm in the neighborhood of the optimal power vector. Our algorithm has several benefits over the previously studied works in the literature: first, the algorithm can be applied to problems other than network utility maximization (NUM), e.g., power control in a relay network; second, for a network with $N$ wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2487","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"},"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-18T03:41:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NziLIa9TnghRvnacFYEZlyf2+QZ+6ZTG1o9RFNuMfYc3BOmrDqKZ5TTmwaC6DWAF1+xYY47d9HIKieF4qLIuCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:29:48.336328Z"},"content_sha256":"ee09b8286716249c6be1aadca26a9b9c88d8d420ffce37a8684baa5c5fdf6e3d","schema_version":"1.0","event_id":"sha256:ee09b8286716249c6be1aadca26a9b9c88d8d420ffce37a8684baa5c5fdf6e3d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V2ABABVX4KCYNPL2JUYHHPTR5L/bundle.json","state_url":"https://pith.science/pith/V2ABABVX4KCYNPL2JUYHHPTR5L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V2ABABVX4KCYNPL2JUYHHPTR5L/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-04T06:29:48Z","links":{"resolver":"https://pith.science/pith/V2ABABVX4KCYNPL2JUYHHPTR5L","bundle":"https://pith.science/pith/V2ABABVX4KCYNPL2JUYHHPTR5L/bundle.json","state":"https://pith.science/pith/V2ABABVX4KCYNPL2JUYHHPTR5L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V2ABABVX4KCYNPL2JUYHHPTR5L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:V2ABABVX4KCYNPL2JUYHHPTR5L","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":"98c7b79057c4696b408183f4ad45844e1e5e1d0fb60f94f6944ca649979f0910","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-12T01:15:30Z","title_canon_sha256":"b5a4609486a25bdc2f12b1d4dd7772cf2b13a80375ac80bdf16df1092aaa6a14"},"schema_version":"1.0","source":{"id":"1211.2487","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2487","created_at":"2026-05-18T03:41:03Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2487v1","created_at":"2026-05-18T03:41:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2487","created_at":"2026-05-18T03:41:03Z"},{"alias_kind":"pith_short_12","alias_value":"V2ABABVX4KCY","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"V2ABABVX4KCYNPL2","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"V2ABABVX","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:ee09b8286716249c6be1aadca26a9b9c88d8d420ffce37a8684baa5c5fdf6e3d","target":"graph","created_at":"2026-05-18T03:41:03Z","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 address the problem of interference management and power control in terms of maximization of a general utility function. For the utility functions under consideration, we propose a power control algorithm based on a fixed-point iteration; further, we prove local convergence of the algorithm in the neighborhood of the optimal power vector. Our algorithm has several benefits over the previously studied works in the literature: first, the algorithm can be applied to problems other than network utility maximization (NUM), e.g., power control in a relay network; second, for a network with $N$ wi","authors_text":"Ehsan Karamad, Jerry Chow, Raviraj Adve","cross_cats":["math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-12T01:15:30Z","title":"Power Control and Interference Management in Dense Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2487","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:c39d37713d1ca75ee3ba9922d92e5554935e58d409eb64e8882706fa47b7097b","target":"record","created_at":"2026-05-18T03:41:03Z","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":"98c7b79057c4696b408183f4ad45844e1e5e1d0fb60f94f6944ca649979f0910","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-12T01:15:30Z","title_canon_sha256":"b5a4609486a25bdc2f12b1d4dd7772cf2b13a80375ac80bdf16df1092aaa6a14"},"schema_version":"1.0","source":{"id":"1211.2487","kind":"arxiv","version":1}},"canonical_sha256":"ae801006b7e28586bd7a4d3073be71eae872419c018018ee9b84841874f63439","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae801006b7e28586bd7a4d3073be71eae872419c018018ee9b84841874f63439","first_computed_at":"2026-05-18T03:41:03.190355Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:03.190355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zqVVrCXjibBJzXTKMT6wMNE9G06Z/THmY/0BeWBLmzai58zj7mEAqDOzX63HY3lglhHPgMRkiAnAepDDeQBDDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:03.190841Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.2487","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c39d37713d1ca75ee3ba9922d92e5554935e58d409eb64e8882706fa47b7097b","sha256:ee09b8286716249c6be1aadca26a9b9c88d8d420ffce37a8684baa5c5fdf6e3d"],"state_sha256":"8aebe7db9b13aba97f0fdc257ef55a28fb932a0a26d38122bf48fa59d300cffe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZImOvYjR52UREEEzdTM2WAtsViU/MXG+UXDTwpWAeaiZUNAseOGjcB88TdH6phYj8mxAkCL60QkYRIjS8mHoCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:29:48.338336Z","bundle_sha256":"e0c123bab185e058b98d4239d5c7c0240744a69cecf32011e10f943a86990411"}}