{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6TLIMNEQMAOESZPIJ5GYLS5RG5","short_pith_number":"pith:6TLIMNEQ","canonical_record":{"source":{"id":"1705.07229","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-20T00:17:56Z","cross_cats_sorted":[],"title_canon_sha256":"2334e161791958faf6d2c0ae97b8bef9a440d243ba61b2cb49a309a868393fda","abstract_canon_sha256":"d01751f89aab6908f74d06114e11725bcbb6a307f5e514d48b2d9b648dbf7002"},"schema_version":"1.0"},"canonical_sha256":"f4d6863490601c4965e84f4d85cbb137790b45f0e4987407240f19f4dba21424","source":{"kind":"arxiv","id":"1705.07229","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07229","created_at":"2026-05-18T00:44:06Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07229v1","created_at":"2026-05-18T00:44:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07229","created_at":"2026-05-18T00:44:06Z"},{"alias_kind":"pith_short_12","alias_value":"6TLIMNEQMAOE","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6TLIMNEQMAOESZPI","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6TLIMNEQ","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6TLIMNEQMAOESZPIJ5GYLS5RG5","target":"record","payload":{"canonical_record":{"source":{"id":"1705.07229","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-20T00:17:56Z","cross_cats_sorted":[],"title_canon_sha256":"2334e161791958faf6d2c0ae97b8bef9a440d243ba61b2cb49a309a868393fda","abstract_canon_sha256":"d01751f89aab6908f74d06114e11725bcbb6a307f5e514d48b2d9b648dbf7002"},"schema_version":"1.0"},"canonical_sha256":"f4d6863490601c4965e84f4d85cbb137790b45f0e4987407240f19f4dba21424","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:06.264650Z","signature_b64":"aaGvoJmiWwaux6GFxEj0M8uffhfoMyZGrStCj+dQ67T6Xuw7jTwAiIKEmOPp4uDFVQ+yyjOxwizUv7zcdJpIDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4d6863490601c4965e84f4d85cbb137790b45f0e4987407240f19f4dba21424","last_reissued_at":"2026-05-18T00:44:06.263974Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:06.263974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.07229","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:44:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tczdTE4mnEs6+3Qc1rDH+p+dVYCns00yoDnXGtVtRAin9jPzo/r2a4RMU1/FhqYFPzCDCbdoTFKnGSIRtzhMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:46:06.866966Z"},"content_sha256":"4ea8b4aa8a2f45ce788af49279248721011fe2c1b9f17d6a210571c8c26658d8","schema_version":"1.0","event_id":"sha256:4ea8b4aa8a2f45ce788af49279248721011fe2c1b9f17d6a210571c8c26658d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6TLIMNEQMAOESZPIJ5GYLS5RG5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iteration-complexity of a Jacobi-type non-Euclidean ADMM for multi-block linearly constrained nonconvex programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jefferson G. Melo, Renato D. C. Monteiro","submitted_at":"2017-05-20T00:17:56Z","abstract_excerpt":"This paper establishes the iteration-complexity of a Jacobi-type non-Euclidean proximal alternating direction method of multipliers (ADMM) for solving multi-block linearly constrained nonconvex programs. The subproblems of this ADMM variant can be solved in parallel and hence the method has great potential to solve large scale multi-block linearly constrained nonconvex programs. Moreover, our analysis allows the Lagrange multiplier to be updated with a relaxation parameter in the interval (0, 2)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07229","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:44:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jkLRnfnM4eqB8FdxyICc+ZfLJ0Tx4dfYHtL7dXrPcE4xg+Pqy8a9LdQy2WzJDVeLA8vhiTTtNBP/0GV8ZQE3Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:46:06.867298Z"},"content_sha256":"f8ac8ca6df68474b7a3d1f93f6ff0d102de64c782283ff894f4efae576a7d840","schema_version":"1.0","event_id":"sha256:f8ac8ca6df68474b7a3d1f93f6ff0d102de64c782283ff894f4efae576a7d840"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6TLIMNEQMAOESZPIJ5GYLS5RG5/bundle.json","state_url":"https://pith.science/pith/6TLIMNEQMAOESZPIJ5GYLS5RG5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6TLIMNEQMAOESZPIJ5GYLS5RG5/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-06-04T06:46:06Z","links":{"resolver":"https://pith.science/pith/6TLIMNEQMAOESZPIJ5GYLS5RG5","bundle":"https://pith.science/pith/6TLIMNEQMAOESZPIJ5GYLS5RG5/bundle.json","state":"https://pith.science/pith/6TLIMNEQMAOESZPIJ5GYLS5RG5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6TLIMNEQMAOESZPIJ5GYLS5RG5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6TLIMNEQMAOESZPIJ5GYLS5RG5","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":"d01751f89aab6908f74d06114e11725bcbb6a307f5e514d48b2d9b648dbf7002","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-20T00:17:56Z","title_canon_sha256":"2334e161791958faf6d2c0ae97b8bef9a440d243ba61b2cb49a309a868393fda"},"schema_version":"1.0","source":{"id":"1705.07229","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07229","created_at":"2026-05-18T00:44:06Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07229v1","created_at":"2026-05-18T00:44:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07229","created_at":"2026-05-18T00:44:06Z"},{"alias_kind":"pith_short_12","alias_value":"6TLIMNEQMAOE","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6TLIMNEQMAOESZPI","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6TLIMNEQ","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:f8ac8ca6df68474b7a3d1f93f6ff0d102de64c782283ff894f4efae576a7d840","target":"graph","created_at":"2026-05-18T00:44:06Z","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":"This paper establishes the iteration-complexity of a Jacobi-type non-Euclidean proximal alternating direction method of multipliers (ADMM) for solving multi-block linearly constrained nonconvex programs. The subproblems of this ADMM variant can be solved in parallel and hence the method has great potential to solve large scale multi-block linearly constrained nonconvex programs. Moreover, our analysis allows the Lagrange multiplier to be updated with a relaxation parameter in the interval (0, 2).","authors_text":"Jefferson G. Melo, Renato D. C. Monteiro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-20T00:17:56Z","title":"Iteration-complexity of a Jacobi-type non-Euclidean ADMM for multi-block linearly constrained nonconvex programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07229","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:4ea8b4aa8a2f45ce788af49279248721011fe2c1b9f17d6a210571c8c26658d8","target":"record","created_at":"2026-05-18T00:44:06Z","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":"d01751f89aab6908f74d06114e11725bcbb6a307f5e514d48b2d9b648dbf7002","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-20T00:17:56Z","title_canon_sha256":"2334e161791958faf6d2c0ae97b8bef9a440d243ba61b2cb49a309a868393fda"},"schema_version":"1.0","source":{"id":"1705.07229","kind":"arxiv","version":1}},"canonical_sha256":"f4d6863490601c4965e84f4d85cbb137790b45f0e4987407240f19f4dba21424","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4d6863490601c4965e84f4d85cbb137790b45f0e4987407240f19f4dba21424","first_computed_at":"2026-05-18T00:44:06.263974Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:06.263974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aaGvoJmiWwaux6GFxEj0M8uffhfoMyZGrStCj+dQ67T6Xuw7jTwAiIKEmOPp4uDFVQ+yyjOxwizUv7zcdJpIDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:06.264650Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07229","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ea8b4aa8a2f45ce788af49279248721011fe2c1b9f17d6a210571c8c26658d8","sha256:f8ac8ca6df68474b7a3d1f93f6ff0d102de64c782283ff894f4efae576a7d840"],"state_sha256":"a32f5471c32be7004b3683e4181a4315388b6dc58f2f207926f2ecf9b88646d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tpWn4fLm1KgAO5jV3cPhl6E+Kb/BTd9Hvvyk1oKU0mceyVlkKb1r7MsIPRVJLDE2YTVzoq2iT6a+H369pj/eDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:46:06.869258Z","bundle_sha256":"5a018c90326c11e2d7e376ad7e978679f4d416708f66fc93deb080ed63dde9aa"}}