{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:24HRGJK4ZCB2A2ZDF27OEIRMTP","short_pith_number":"pith:24HRGJK4","canonical_record":{"source":{"id":"2405.03233","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-05-06T07:42:33Z","cross_cats_sorted":[],"title_canon_sha256":"e759a0db7d459ae700c11e6e5cae46f6dc98093d27176f9c9a7c066e9e2fd678","abstract_canon_sha256":"ade6679f4c317afb1049584f0090b3081a9192efadce89e2bff490efd6116480"},"schema_version":"1.0"},"canonical_sha256":"d70f13255cc883a06b232ebee2222c9bd6185bd8cea217c55fa1a44ad59537e6","source":{"kind":"arxiv","id":"2405.03233","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.03233","created_at":"2026-07-05T10:41:46Z"},{"alias_kind":"arxiv_version","alias_value":"2405.03233v4","created_at":"2026-07-05T10:41:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.03233","created_at":"2026-07-05T10:41:46Z"},{"alias_kind":"pith_short_12","alias_value":"24HRGJK4ZCB2","created_at":"2026-07-05T10:41:46Z"},{"alias_kind":"pith_short_16","alias_value":"24HRGJK4ZCB2A2ZD","created_at":"2026-07-05T10:41:46Z"},{"alias_kind":"pith_short_8","alias_value":"24HRGJK4","created_at":"2026-07-05T10:41:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:24HRGJK4ZCB2A2ZDF27OEIRMTP","target":"record","payload":{"canonical_record":{"source":{"id":"2405.03233","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-05-06T07:42:33Z","cross_cats_sorted":[],"title_canon_sha256":"e759a0db7d459ae700c11e6e5cae46f6dc98093d27176f9c9a7c066e9e2fd678","abstract_canon_sha256":"ade6679f4c317afb1049584f0090b3081a9192efadce89e2bff490efd6116480"},"schema_version":"1.0"},"canonical_sha256":"d70f13255cc883a06b232ebee2222c9bd6185bd8cea217c55fa1a44ad59537e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:41:46.427536Z","signature_b64":"WYdhHLiuyeSdyAcSU6eaJdLaiZvGYn3BjW8qU6VOonwrqLLYI2MTWAcW3kSNTg/DPjnQQOouzIO0E0S6oFqFCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d70f13255cc883a06b232ebee2222c9bd6185bd8cea217c55fa1a44ad59537e6","last_reissued_at":"2026-07-05T10:41:46.427038Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:41:46.427038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.03233","source_version":4,"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-07-05T10:41:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FUn4pF+KYdt246woNUIQfuTr7CxNR/YXc6fqF8lTP24OiQsm/2215/aAhC6nwKx61NtxOPy66DEF7ACEk6UABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T08:11:44.458794Z"},"content_sha256":"7f20965cfdf00b8deac39d608bceaf80d0661d3a3f8834516a806809b95da693","schema_version":"1.0","event_id":"sha256:7f20965cfdf00b8deac39d608bceaf80d0661d3a3f8834516a806809b95da693"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:24HRGJK4ZCB2A2ZDF27OEIRMTP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ADMM for Nonconvex Optimization under Minimal Continuity Assumption","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ganzhao Yuan","submitted_at":"2024-05-06T07:42:33Z","abstract_excerpt":"This paper introduces a novel approach to solving multi-block nonconvex composite optimization problems through a proximal linearized Alternating Direction Method of Multipliers (ADMM). This method incorporates an Increasing Penalization and Decreasing Smoothing (IPDS) strategy. Distinguishing itself from existing ADMM-style algorithms, our approach (denoted IPDS-ADMM) imposes a less stringent condition, specifically requiring continuity in just one block of the objective function. IPDS-ADMM requires that the penalty increases and the smoothing parameter decreases, both at a controlled pace. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.03233","kind":"arxiv","version":4},"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/2405.03233/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"},"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-07-05T10:41:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5PRr3cgCZma9S8IJdLhPDBqqTPzzVk8aBwsc3EogrXsVLOhgoSyhK0P5Id/FwzSlRlf5Eagk9ILjhPGS6y4yAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T08:11:44.459363Z"},"content_sha256":"f3271b2dd0c36f8fbf7021e564eecc65ec1185884a6df13581fab6cdb3cde97e","schema_version":"1.0","event_id":"sha256:f3271b2dd0c36f8fbf7021e564eecc65ec1185884a6df13581fab6cdb3cde97e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/24HRGJK4ZCB2A2ZDF27OEIRMTP/bundle.json","state_url":"https://pith.science/pith/24HRGJK4ZCB2A2ZDF27OEIRMTP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/24HRGJK4ZCB2A2ZDF27OEIRMTP/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-08-05T08:11:44Z","links":{"resolver":"https://pith.science/pith/24HRGJK4ZCB2A2ZDF27OEIRMTP","bundle":"https://pith.science/pith/24HRGJK4ZCB2A2ZDF27OEIRMTP/bundle.json","state":"https://pith.science/pith/24HRGJK4ZCB2A2ZDF27OEIRMTP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/24HRGJK4ZCB2A2ZDF27OEIRMTP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:24HRGJK4ZCB2A2ZDF27OEIRMTP","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":"ade6679f4c317afb1049584f0090b3081a9192efadce89e2bff490efd6116480","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-05-06T07:42:33Z","title_canon_sha256":"e759a0db7d459ae700c11e6e5cae46f6dc98093d27176f9c9a7c066e9e2fd678"},"schema_version":"1.0","source":{"id":"2405.03233","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.03233","created_at":"2026-07-05T10:41:46Z"},{"alias_kind":"arxiv_version","alias_value":"2405.03233v4","created_at":"2026-07-05T10:41:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.03233","created_at":"2026-07-05T10:41:46Z"},{"alias_kind":"pith_short_12","alias_value":"24HRGJK4ZCB2","created_at":"2026-07-05T10:41:46Z"},{"alias_kind":"pith_short_16","alias_value":"24HRGJK4ZCB2A2ZD","created_at":"2026-07-05T10:41:46Z"},{"alias_kind":"pith_short_8","alias_value":"24HRGJK4","created_at":"2026-07-05T10:41:46Z"}],"graph_snapshots":[{"event_id":"sha256:f3271b2dd0c36f8fbf7021e564eecc65ec1185884a6df13581fab6cdb3cde97e","target":"graph","created_at":"2026-07-05T10:41:46Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2405.03233/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper introduces a novel approach to solving multi-block nonconvex composite optimization problems through a proximal linearized Alternating Direction Method of Multipliers (ADMM). This method incorporates an Increasing Penalization and Decreasing Smoothing (IPDS) strategy. Distinguishing itself from existing ADMM-style algorithms, our approach (denoted IPDS-ADMM) imposes a less stringent condition, specifically requiring continuity in just one block of the objective function. IPDS-ADMM requires that the penalty increases and the smoothing parameter decreases, both at a controlled pace. W","authors_text":"Ganzhao Yuan","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-05-06T07:42:33Z","title":"ADMM for Nonconvex Optimization under Minimal Continuity Assumption"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.03233","kind":"arxiv","version":4},"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:7f20965cfdf00b8deac39d608bceaf80d0661d3a3f8834516a806809b95da693","target":"record","created_at":"2026-07-05T10:41:46Z","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":"ade6679f4c317afb1049584f0090b3081a9192efadce89e2bff490efd6116480","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-05-06T07:42:33Z","title_canon_sha256":"e759a0db7d459ae700c11e6e5cae46f6dc98093d27176f9c9a7c066e9e2fd678"},"schema_version":"1.0","source":{"id":"2405.03233","kind":"arxiv","version":4}},"canonical_sha256":"d70f13255cc883a06b232ebee2222c9bd6185bd8cea217c55fa1a44ad59537e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d70f13255cc883a06b232ebee2222c9bd6185bd8cea217c55fa1a44ad59537e6","first_computed_at":"2026-07-05T10:41:46.427038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:41:46.427038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WYdhHLiuyeSdyAcSU6eaJdLaiZvGYn3BjW8qU6VOonwrqLLYI2MTWAcW3kSNTg/DPjnQQOouzIO0E0S6oFqFCg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:41:46.427536Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.03233","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f20965cfdf00b8deac39d608bceaf80d0661d3a3f8834516a806809b95da693","sha256:f3271b2dd0c36f8fbf7021e564eecc65ec1185884a6df13581fab6cdb3cde97e"],"state_sha256":"d16c09345064f3bfe706f2c6e3775c505d76421b5ef5692cc88612e460d720ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X8XlpAMIxMKwbeZnOOIA8pQ8yO7MDDR9ZNKUo1ieYZk8DMVvmcdnl4E3sb2qOc24P7lwL8EsJpqJj85AaxNEBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T08:11:44.471698Z","bundle_sha256":"96a0e50faf8003b6cc3b4962af5da88378ea025a02faf2fc65f99d415d8380d9"}}