{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:32E5PKT2IMMMPPTLJU53SVNHNH","short_pith_number":"pith:32E5PKT2","schema_version":"1.0","canonical_sha256":"de89d7aa7a4318c7be6b4d3bb955a769dedd83b8f50b72fe23a67d3a57151114","source":{"kind":"arxiv","id":"2506.05974","version":1},"attestation_state":"computed","paper":{"title":"A Proximal Variable Smoothing for Minimization of Nonlinearly Composite Nonsmooth Function -- Maxmin Dispersion and MIMO Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"math.OC","authors_text":"Isao Yamada, Keita Kume","submitted_at":"2025-06-06T10:57:40Z","abstract_excerpt":"We propose a proximal variable smoothing algorithm for a nonsmooth optimization problem whose cost function is the sum of three functions including a weakly convex composite function. The proposed algorithm has a single-loop structure inspired by a proximal gradient-type method. More precisely, the proposed algorithm consists of two steps: (i) a gradient descent of a time-varying smoothed surrogate function designed partially with the Moreau envelope of the weakly convex function; (ii) an application of the proximity operator of the remaining function not covered by the smoothed surrogate func"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2506.05974","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-06T10:57:40Z","cross_cats_sorted":["eess.SP"],"title_canon_sha256":"2cfa429cab7c77afee8d74f1d82c18d584a77c488127f395cd3b7263ae09f86b","abstract_canon_sha256":"547665b394e2c6ff7b3bcbc4d419888a99fb9672b56feee29d4bb54c369b38b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:17:14.053903Z","signature_b64":"ZAmoKGXlCZ1ptNCaMadqW3IEc34DNS7rhrLhGXlOjWcddl1EN+Eu+EQ8l8+sDX7K6HwvrVSDSo6U/eeAT7nQDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de89d7aa7a4318c7be6b4d3bb955a769dedd83b8f50b72fe23a67d3a57151114","last_reissued_at":"2026-07-05T11:17:14.053401Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:17:14.053401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Proximal Variable Smoothing for Minimization of Nonlinearly Composite Nonsmooth Function -- Maxmin Dispersion and MIMO Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"math.OC","authors_text":"Isao Yamada, Keita Kume","submitted_at":"2025-06-06T10:57:40Z","abstract_excerpt":"We propose a proximal variable smoothing algorithm for a nonsmooth optimization problem whose cost function is the sum of three functions including a weakly convex composite function. The proposed algorithm has a single-loop structure inspired by a proximal gradient-type method. More precisely, the proposed algorithm consists of two steps: (i) a gradient descent of a time-varying smoothed surrogate function designed partially with the Moreau envelope of the weakly convex function; (ii) an application of the proximity operator of the remaining function not covered by the smoothed surrogate func"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.05974","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.05974/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2506.05974","created_at":"2026-07-05T11:17:14.053467+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.05974v1","created_at":"2026-07-05T11:17:14.053467+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.05974","created_at":"2026-07-05T11:17:14.053467+00:00"},{"alias_kind":"pith_short_12","alias_value":"32E5PKT2IMMM","created_at":"2026-07-05T11:17:14.053467+00:00"},{"alias_kind":"pith_short_16","alias_value":"32E5PKT2IMMMPPTL","created_at":"2026-07-05T11:17:14.053467+00:00"},{"alias_kind":"pith_short_8","alias_value":"32E5PKT2","created_at":"2026-07-05T11:17:14.053467+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.07686","citing_title":"A DC Composite Optimization via Variable Smoothing for Robust Phase Retrieval with Nonconvex Loss Functions","ref_index":51,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/32E5PKT2IMMMPPTLJU53SVNHNH","json":"https://pith.science/pith/32E5PKT2IMMMPPTLJU53SVNHNH.json","graph_json":"https://pith.science/api/pith-number/32E5PKT2IMMMPPTLJU53SVNHNH/graph.json","events_json":"https://pith.science/api/pith-number/32E5PKT2IMMMPPTLJU53SVNHNH/events.json","paper":"https://pith.science/paper/32E5PKT2"},"agent_actions":{"view_html":"https://pith.science/pith/32E5PKT2IMMMPPTLJU53SVNHNH","download_json":"https://pith.science/pith/32E5PKT2IMMMPPTLJU53SVNHNH.json","view_paper":"https://pith.science/paper/32E5PKT2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.05974&json=true","fetch_graph":"https://pith.science/api/pith-number/32E5PKT2IMMMPPTLJU53SVNHNH/graph.json","fetch_events":"https://pith.science/api/pith-number/32E5PKT2IMMMPPTLJU53SVNHNH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/32E5PKT2IMMMPPTLJU53SVNHNH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/32E5PKT2IMMMPPTLJU53SVNHNH/action/storage_attestation","attest_author":"https://pith.science/pith/32E5PKT2IMMMPPTLJU53SVNHNH/action/author_attestation","sign_citation":"https://pith.science/pith/32E5PKT2IMMMPPTLJU53SVNHNH/action/citation_signature","submit_replication":"https://pith.science/pith/32E5PKT2IMMMPPTLJU53SVNHNH/action/replication_record"}},"created_at":"2026-07-05T11:17:14.053467+00:00","updated_at":"2026-07-05T11:17:14.053467+00:00"}