{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YIAXCAFH6M5ZBGLVFVILPCNPUU","short_pith_number":"pith:YIAXCAFH","canonical_record":{"source":{"id":"1609.03194","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-11T18:57:13Z","cross_cats_sorted":[],"title_canon_sha256":"4753305a3f5b9bf8bcbd4e42c84c50777e281040ce1638fa0ddd08ce81975a14","abstract_canon_sha256":"61200dbf3e8cae47d9496d01fee48bf0feeb85f039c08a964bf91bf315366638"},"schema_version":"1.0"},"canonical_sha256":"c2017100a7f33b9099752d50b789afa50424a5819c132f922ce1ace71288f5ae","source":{"kind":"arxiv","id":"1609.03194","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03194","created_at":"2026-05-17T23:58:50Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03194v3","created_at":"2026-05-17T23:58:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03194","created_at":"2026-05-17T23:58:50Z"},{"alias_kind":"pith_short_12","alias_value":"YIAXCAFH6M5Z","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YIAXCAFH6M5ZBGLV","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YIAXCAFH","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YIAXCAFH6M5ZBGLVFVILPCNPUU","target":"record","payload":{"canonical_record":{"source":{"id":"1609.03194","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-11T18:57:13Z","cross_cats_sorted":[],"title_canon_sha256":"4753305a3f5b9bf8bcbd4e42c84c50777e281040ce1638fa0ddd08ce81975a14","abstract_canon_sha256":"61200dbf3e8cae47d9496d01fee48bf0feeb85f039c08a964bf91bf315366638"},"schema_version":"1.0"},"canonical_sha256":"c2017100a7f33b9099752d50b789afa50424a5819c132f922ce1ace71288f5ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:50.478414Z","signature_b64":"WXGjy44+1ROcNAELrk7mFNKd5HIdBbWVGzBZTd7Gsx9D8ItyI+hiOcBG26H9s3aRvq17njK6T2btz4hHxZSVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2017100a7f33b9099752d50b789afa50424a5819c132f922ce1ace71288f5ae","last_reissued_at":"2026-05-17T23:58:50.477874Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:50.477874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.03194","source_version":3,"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-17T23:58:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G4TU5cLrvWWwHiLVxMkdoaruRH7D/gCZ2YMibZQx4kAqVT1pYoATmOEuL34xS80LHl6RfCt3GRbTnk3o3y35BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:43:26.447711Z"},"content_sha256":"18dd48da418c06dc80c241043695bf070d28298ddaf9de094efe9f4371531406","schema_version":"1.0","event_id":"sha256:18dd48da418c06dc80c241043695bf070d28298ddaf9de094efe9f4371531406"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YIAXCAFH6M5ZBGLVFVILPCNPUU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network Utility Maximization Revisited: Three Issues and Their Resolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Akhil P T, Rajesh Sundaresan","submitted_at":"2016-09-11T18:57:13Z","abstract_excerpt":"Distributed and iterative network utility maximization algorithms, such as the primal-dual algorithms or the network-user decomposition algorithms, often involve trajectories where the iterates may be infeasible, convergence to the optimal points of relaxed problems different from the original, or convergence to local maxima. In this paper, we highlight the three issues with iterative algorithms. We then propose a distributed and iterative algorithm that does not suffer from the three issues. In particular, we assert the feasibility of the algorithm's iterates at all times, convergence to the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03194","kind":"arxiv","version":3},"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-17T23:58:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aiO+ZRdFjrE4TEij3X3a39Z0BbHMUFR/WgJYNGiRFuALrqRdNuMLPxU6RnTGlaaXUwS3Y22v+m66Uys4HVvcBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:43:26.448413Z"},"content_sha256":"c33b9b3306e94cb91f8cc37324c877911d72176a447f9b8405a99e4d4c3fed2e","schema_version":"1.0","event_id":"sha256:c33b9b3306e94cb91f8cc37324c877911d72176a447f9b8405a99e4d4c3fed2e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YIAXCAFH6M5ZBGLVFVILPCNPUU/bundle.json","state_url":"https://pith.science/pith/YIAXCAFH6M5ZBGLVFVILPCNPUU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YIAXCAFH6M5ZBGLVFVILPCNPUU/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-29T14:43:26Z","links":{"resolver":"https://pith.science/pith/YIAXCAFH6M5ZBGLVFVILPCNPUU","bundle":"https://pith.science/pith/YIAXCAFH6M5ZBGLVFVILPCNPUU/bundle.json","state":"https://pith.science/pith/YIAXCAFH6M5ZBGLVFVILPCNPUU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YIAXCAFH6M5ZBGLVFVILPCNPUU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YIAXCAFH6M5ZBGLVFVILPCNPUU","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":"61200dbf3e8cae47d9496d01fee48bf0feeb85f039c08a964bf91bf315366638","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-11T18:57:13Z","title_canon_sha256":"4753305a3f5b9bf8bcbd4e42c84c50777e281040ce1638fa0ddd08ce81975a14"},"schema_version":"1.0","source":{"id":"1609.03194","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03194","created_at":"2026-05-17T23:58:50Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03194v3","created_at":"2026-05-17T23:58:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03194","created_at":"2026-05-17T23:58:50Z"},{"alias_kind":"pith_short_12","alias_value":"YIAXCAFH6M5Z","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YIAXCAFH6M5ZBGLV","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YIAXCAFH","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:c33b9b3306e94cb91f8cc37324c877911d72176a447f9b8405a99e4d4c3fed2e","target":"graph","created_at":"2026-05-17T23:58:50Z","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":"Distributed and iterative network utility maximization algorithms, such as the primal-dual algorithms or the network-user decomposition algorithms, often involve trajectories where the iterates may be infeasible, convergence to the optimal points of relaxed problems different from the original, or convergence to local maxima. In this paper, we highlight the three issues with iterative algorithms. We then propose a distributed and iterative algorithm that does not suffer from the three issues. In particular, we assert the feasibility of the algorithm's iterates at all times, convergence to the ","authors_text":"Akhil P T, Rajesh Sundaresan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-11T18:57:13Z","title":"Network Utility Maximization Revisited: Three Issues and Their Resolution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03194","kind":"arxiv","version":3},"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:18dd48da418c06dc80c241043695bf070d28298ddaf9de094efe9f4371531406","target":"record","created_at":"2026-05-17T23:58:50Z","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":"61200dbf3e8cae47d9496d01fee48bf0feeb85f039c08a964bf91bf315366638","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-11T18:57:13Z","title_canon_sha256":"4753305a3f5b9bf8bcbd4e42c84c50777e281040ce1638fa0ddd08ce81975a14"},"schema_version":"1.0","source":{"id":"1609.03194","kind":"arxiv","version":3}},"canonical_sha256":"c2017100a7f33b9099752d50b789afa50424a5819c132f922ce1ace71288f5ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2017100a7f33b9099752d50b789afa50424a5819c132f922ce1ace71288f5ae","first_computed_at":"2026-05-17T23:58:50.477874Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:50.477874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WXGjy44+1ROcNAELrk7mFNKd5HIdBbWVGzBZTd7Gsx9D8ItyI+hiOcBG26H9s3aRvq17njK6T2btz4hHxZSVAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:50.478414Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.03194","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18dd48da418c06dc80c241043695bf070d28298ddaf9de094efe9f4371531406","sha256:c33b9b3306e94cb91f8cc37324c877911d72176a447f9b8405a99e4d4c3fed2e"],"state_sha256":"718b71d07b2816a9dc2f035816ab668dedbc17d6e46318ca95cb478a03c8f490"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vSU/IgkqV70a8JQ8CHLTqQf0smT1etmz9C3wziHYbc/86HuyZp3nluJ+MlhVhGEe4z3IwrMheG7sdoIZDc8rAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T14:43:26.452063Z","bundle_sha256":"0a2b4f191b489f1e83347c2276e1a794b118540a599946815525b7862ef99a51"}}