{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LNX4P3I4N3277K5WC3CNUEZX4S","short_pith_number":"pith:LNX4P3I4","canonical_record":{"source":{"id":"1712.04767","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-13T13:53:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6019ff85759594f27a9a9496775e3157405352920a9eebce3b863d01408a1235","abstract_canon_sha256":"a09904fe5ca8cb1d86a7ec87e2dc15b1924b2cd20a0e38417b87e154788a1402"},"schema_version":"1.0"},"canonical_sha256":"5b6fc7ed1c6ef5ffabb616c4da1337e4a43d6ada41e3b641c3f9d33da26aa07f","source":{"kind":"arxiv","id":"1712.04767","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.04767","created_at":"2026-05-18T00:28:03Z"},{"alias_kind":"arxiv_version","alias_value":"1712.04767v1","created_at":"2026-05-18T00:28:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04767","created_at":"2026-05-18T00:28:03Z"},{"alias_kind":"pith_short_12","alias_value":"LNX4P3I4N327","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LNX4P3I4N3277K5W","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LNX4P3I4","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LNX4P3I4N3277K5WC3CNUEZX4S","target":"record","payload":{"canonical_record":{"source":{"id":"1712.04767","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-13T13:53:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6019ff85759594f27a9a9496775e3157405352920a9eebce3b863d01408a1235","abstract_canon_sha256":"a09904fe5ca8cb1d86a7ec87e2dc15b1924b2cd20a0e38417b87e154788a1402"},"schema_version":"1.0"},"canonical_sha256":"5b6fc7ed1c6ef5ffabb616c4da1337e4a43d6ada41e3b641c3f9d33da26aa07f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:03.545919Z","signature_b64":"7kwU0EaDzbQPLgmUhtbwLQPtBfpxS+Jm1+r/EFD9XMkcWEA+I3jRkW5N0eer9lacSDkZGbTGADMidyyWgvYmDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b6fc7ed1c6ef5ffabb616c4da1337e4a43d6ada41e3b641c3f9d33da26aa07f","last_reissued_at":"2026-05-18T00:28:03.545065Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:03.545065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.04767","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:28:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qu7dUnAGdLDXeCDHj/+J+Nipfe5QGlrVc913LUYE38NaO6uiNzcTp2qwt9PKuplfaUZj0hI0qOQJNlKS8NzqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:52:41.386265Z"},"content_sha256":"76cec8213ebff8b984f3fcc2842e6b178b698c5ec928071f6bedf66b09d50228","schema_version":"1.0","event_id":"sha256:76cec8213ebff8b984f3fcc2842e6b178b698c5ec928071f6bedf66b09d50228"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LNX4P3I4N3277K5WC3CNUEZX4S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Penalty Dual Decomposition Method For Nonsmooth Nonconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mingyi Hong, Qingjiang Shi, Tsung-Hui Chang, Xiao Fu","submitted_at":"2017-12-13T13:53:46Z","abstract_excerpt":"Many contemporary signal processing, machine learning and wireless communication applications can be formulated as nonconvex nonsmooth optimization problems. Often there is a lack of efficient algorithms for these problems, especially when the optimization variables are nonlinearly coupled in some nonconvex constraints. In this work, we propose an algorithm named penalty dual decomposition (PDD) for these difficult problems and discuss its various applications. The PDD is a double-loop iterative algorithm. Its inner iterations is used to inexactly solve a nonconvex nonsmooth augmented Lagrangi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04767","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:28:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C+AvVjC4vSFUEiJztCBHetOtDhpX0VFDRCkMp5H4naEjdD5OCQUIzlVH7DgUAxD236jL6OlpFbmIAyoTCFpEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:52:41.386960Z"},"content_sha256":"16a05ab1c56ea9523abe50b439e2f4adab9cfdb7bfdc6e38483fc0b226f3e24d","schema_version":"1.0","event_id":"sha256:16a05ab1c56ea9523abe50b439e2f4adab9cfdb7bfdc6e38483fc0b226f3e24d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LNX4P3I4N3277K5WC3CNUEZX4S/bundle.json","state_url":"https://pith.science/pith/LNX4P3I4N3277K5WC3CNUEZX4S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LNX4P3I4N3277K5WC3CNUEZX4S/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-27T02:52:41Z","links":{"resolver":"https://pith.science/pith/LNX4P3I4N3277K5WC3CNUEZX4S","bundle":"https://pith.science/pith/LNX4P3I4N3277K5WC3CNUEZX4S/bundle.json","state":"https://pith.science/pith/LNX4P3I4N3277K5WC3CNUEZX4S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LNX4P3I4N3277K5WC3CNUEZX4S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LNX4P3I4N3277K5WC3CNUEZX4S","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":"a09904fe5ca8cb1d86a7ec87e2dc15b1924b2cd20a0e38417b87e154788a1402","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-13T13:53:46Z","title_canon_sha256":"6019ff85759594f27a9a9496775e3157405352920a9eebce3b863d01408a1235"},"schema_version":"1.0","source":{"id":"1712.04767","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.04767","created_at":"2026-05-18T00:28:03Z"},{"alias_kind":"arxiv_version","alias_value":"1712.04767v1","created_at":"2026-05-18T00:28:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04767","created_at":"2026-05-18T00:28:03Z"},{"alias_kind":"pith_short_12","alias_value":"LNX4P3I4N327","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LNX4P3I4N3277K5W","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LNX4P3I4","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:16a05ab1c56ea9523abe50b439e2f4adab9cfdb7bfdc6e38483fc0b226f3e24d","target":"graph","created_at":"2026-05-18T00:28: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":"Many contemporary signal processing, machine learning and wireless communication applications can be formulated as nonconvex nonsmooth optimization problems. Often there is a lack of efficient algorithms for these problems, especially when the optimization variables are nonlinearly coupled in some nonconvex constraints. In this work, we propose an algorithm named penalty dual decomposition (PDD) for these difficult problems and discuss its various applications. The PDD is a double-loop iterative algorithm. Its inner iterations is used to inexactly solve a nonconvex nonsmooth augmented Lagrangi","authors_text":"Mingyi Hong, Qingjiang Shi, Tsung-Hui Chang, Xiao Fu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-13T13:53:46Z","title":"Penalty Dual Decomposition Method For Nonsmooth Nonconvex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04767","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:76cec8213ebff8b984f3fcc2842e6b178b698c5ec928071f6bedf66b09d50228","target":"record","created_at":"2026-05-18T00:28: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":"a09904fe5ca8cb1d86a7ec87e2dc15b1924b2cd20a0e38417b87e154788a1402","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-13T13:53:46Z","title_canon_sha256":"6019ff85759594f27a9a9496775e3157405352920a9eebce3b863d01408a1235"},"schema_version":"1.0","source":{"id":"1712.04767","kind":"arxiv","version":1}},"canonical_sha256":"5b6fc7ed1c6ef5ffabb616c4da1337e4a43d6ada41e3b641c3f9d33da26aa07f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b6fc7ed1c6ef5ffabb616c4da1337e4a43d6ada41e3b641c3f9d33da26aa07f","first_computed_at":"2026-05-18T00:28:03.545065Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:03.545065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7kwU0EaDzbQPLgmUhtbwLQPtBfpxS+Jm1+r/EFD9XMkcWEA+I3jRkW5N0eer9lacSDkZGbTGADMidyyWgvYmDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:03.545919Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.04767","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76cec8213ebff8b984f3fcc2842e6b178b698c5ec928071f6bedf66b09d50228","sha256:16a05ab1c56ea9523abe50b439e2f4adab9cfdb7bfdc6e38483fc0b226f3e24d"],"state_sha256":"1569c32cab06c9e3b5a9ba99e509ca2c8fe427cc366367b845fa7076a8f65a77"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wai/+EpWbqkSZsZEMU4nxJnniTLu+HJC4vvk9JDLrGAvmDsY7lld5fPUHxDbmEg7ivaZyjjK5azETfutH2huDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:52:41.390811Z","bundle_sha256":"2e006e1b5033989bf96f96f25b1df1dd71c225c01124638062ae3ee6eca2e140"}}