{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZWYRUMGYQBERRY4NEWQS6RY6RX","short_pith_number":"pith:ZWYRUMGY","canonical_record":{"source":{"id":"1601.04059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-15T20:45:34Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"91b6b2d43e366558a857aefc76cc6e9a41e6cd103c01f05a700e2b35b5e6be6b","abstract_canon_sha256":"838168aec396ac5597094a3e9b97349dcdab63183e6e2c64e65c1bc5d7847869"},"schema_version":"1.0"},"canonical_sha256":"cdb11a30d8804918e38d25a12f471e8df8d6803fe67d0fee944062419d6b2550","source":{"kind":"arxiv","id":"1601.04059","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04059","created_at":"2026-05-18T00:47:15Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04059v1","created_at":"2026-05-18T00:47:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04059","created_at":"2026-05-18T00:47:15Z"},{"alias_kind":"pith_short_12","alias_value":"ZWYRUMGYQBER","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZWYRUMGYQBERRY4N","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZWYRUMGY","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZWYRUMGYQBERRY4NEWQS6RY6RX","target":"record","payload":{"canonical_record":{"source":{"id":"1601.04059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-15T20:45:34Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"91b6b2d43e366558a857aefc76cc6e9a41e6cd103c01f05a700e2b35b5e6be6b","abstract_canon_sha256":"838168aec396ac5597094a3e9b97349dcdab63183e6e2c64e65c1bc5d7847869"},"schema_version":"1.0"},"canonical_sha256":"cdb11a30d8804918e38d25a12f471e8df8d6803fe67d0fee944062419d6b2550","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:15.683651Z","signature_b64":"/AwahldeI2XnfAN680hmHprgMuShRp0RmYKKY77VW8nzAvREqQhLo+94mE0hIukWw8LwJHXyeNcV7Mim4Kp3Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdb11a30d8804918e38d25a12f471e8df8d6803fe67d0fee944062419d6b2550","last_reissued_at":"2026-05-18T00:47:15.683015Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:15.683015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.04059","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-18T00:47:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"csP72axrIKKs0Zj+Niqq097mZ49f44rvGYs1eJUGBC1OreN6w0bKpiATeVlgyDWAubNayz3au25rM6ZfxxVFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:38:40.115865Z"},"content_sha256":"b8f9d3bc452218c9e3096f189e9e819f15f7c1e1460e0bb9cd3b781f871bbd0a","schema_version":"1.0","event_id":"sha256:b8f9d3bc452218c9e3096f189e9e819f15f7c1e1460e0bb9cd3b781f871bbd0a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZWYRUMGYQBERRY4NEWQS6RY6RX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel and Distributed Methods for Nonconvex Optimization--Part II: Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"Francisco Facchinei, Gesualdo Scutari, Lorenzo Lampariello, Peiran Song, Stefania Sardellitti","submitted_at":"2016-01-15T20:45:34Z","abstract_excerpt":"In Part I of this paper, we proposed and analyzed a novel algorithmic framework for the minimization of a nonconvex (smooth) objective function, subject to nonconvex constraints, based on inner convex approximations. This Part II is devoted to the application of the framework to some resource allocation problems in communication networks. In particular, we consider two non-trivial case-study applications, namely: (generalizations of) i) the rate profile maximization in MIMO interference broadcast networks; and the ii) the max-min fair multicast multigroup beamforming problem in a multi-cell en"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04059","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-18T00:47:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kyQ2yo3lhkInGcyCXIEiVoQpCyUx5NpQwVKuDe0zCMYsS9TmDhMRvrnlT7+c0kGyxDXexboafNKUQsyIyqTIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:38:40.116235Z"},"content_sha256":"d74ab0d510117152ee8431f54650eaa3c0cee520f7362a7bdee6dc117020ef46","schema_version":"1.0","event_id":"sha256:d74ab0d510117152ee8431f54650eaa3c0cee520f7362a7bdee6dc117020ef46"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZWYRUMGYQBERRY4NEWQS6RY6RX/bundle.json","state_url":"https://pith.science/pith/ZWYRUMGYQBERRY4NEWQS6RY6RX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZWYRUMGYQBERRY4NEWQS6RY6RX/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-28T23:38:40Z","links":{"resolver":"https://pith.science/pith/ZWYRUMGYQBERRY4NEWQS6RY6RX","bundle":"https://pith.science/pith/ZWYRUMGYQBERRY4NEWQS6RY6RX/bundle.json","state":"https://pith.science/pith/ZWYRUMGYQBERRY4NEWQS6RY6RX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZWYRUMGYQBERRY4NEWQS6RY6RX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZWYRUMGYQBERRY4NEWQS6RY6RX","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":"838168aec396ac5597094a3e9b97349dcdab63183e6e2c64e65c1bc5d7847869","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-15T20:45:34Z","title_canon_sha256":"91b6b2d43e366558a857aefc76cc6e9a41e6cd103c01f05a700e2b35b5e6be6b"},"schema_version":"1.0","source":{"id":"1601.04059","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04059","created_at":"2026-05-18T00:47:15Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04059v1","created_at":"2026-05-18T00:47:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04059","created_at":"2026-05-18T00:47:15Z"},{"alias_kind":"pith_short_12","alias_value":"ZWYRUMGYQBER","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZWYRUMGYQBERRY4N","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZWYRUMGY","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:d74ab0d510117152ee8431f54650eaa3c0cee520f7362a7bdee6dc117020ef46","target":"graph","created_at":"2026-05-18T00:47:15Z","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 Part I of this paper, we proposed and analyzed a novel algorithmic framework for the minimization of a nonconvex (smooth) objective function, subject to nonconvex constraints, based on inner convex approximations. This Part II is devoted to the application of the framework to some resource allocation problems in communication networks. In particular, we consider two non-trivial case-study applications, namely: (generalizations of) i) the rate profile maximization in MIMO interference broadcast networks; and the ii) the max-min fair multicast multigroup beamforming problem in a multi-cell en","authors_text":"Francisco Facchinei, Gesualdo Scutari, Lorenzo Lampariello, Peiran Song, Stefania Sardellitti","cross_cats":["cs.DC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-15T20:45:34Z","title":"Parallel and Distributed Methods for Nonconvex Optimization--Part II: Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04059","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:b8f9d3bc452218c9e3096f189e9e819f15f7c1e1460e0bb9cd3b781f871bbd0a","target":"record","created_at":"2026-05-18T00:47:15Z","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":"838168aec396ac5597094a3e9b97349dcdab63183e6e2c64e65c1bc5d7847869","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-15T20:45:34Z","title_canon_sha256":"91b6b2d43e366558a857aefc76cc6e9a41e6cd103c01f05a700e2b35b5e6be6b"},"schema_version":"1.0","source":{"id":"1601.04059","kind":"arxiv","version":1}},"canonical_sha256":"cdb11a30d8804918e38d25a12f471e8df8d6803fe67d0fee944062419d6b2550","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdb11a30d8804918e38d25a12f471e8df8d6803fe67d0fee944062419d6b2550","first_computed_at":"2026-05-18T00:47:15.683015Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:15.683015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/AwahldeI2XnfAN680hmHprgMuShRp0RmYKKY77VW8nzAvREqQhLo+94mE0hIukWw8LwJHXyeNcV7Mim4Kp3Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:15.683651Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.04059","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8f9d3bc452218c9e3096f189e9e819f15f7c1e1460e0bb9cd3b781f871bbd0a","sha256:d74ab0d510117152ee8431f54650eaa3c0cee520f7362a7bdee6dc117020ef46"],"state_sha256":"0fc236515747f4b81f6e0b66dfc7ad54cbe0d1afa24987814bb83aabbbe74333"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/RGSqHpWB/SO+3dt1av8mZ+FhWS5PFa60vobzTllaYs0dbmGL5qn9Mj5edeZKwSS92dEkUU/0HqbKMJ0MWwyCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:38:40.118461Z","bundle_sha256":"03ac64a79a624a300934e904a674afa5975de184c0b55d53de5a79a48a63b4e5"}}