{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:F2UIFDPGHIGBPAQ72FAPPLMWYX","short_pith_number":"pith:F2UIFDPG","canonical_record":{"source":{"id":"1805.07336","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-18T17:37:50Z","cross_cats_sorted":[],"title_canon_sha256":"c894a00efd7a5404ba4ad20bf3b4f6845a8c12411102e313199eeed522dec4a1","abstract_canon_sha256":"5e9f01924d4d9e83af678c2a73afc109cb79c2fca67c02b191cb7c7a2544dcde"},"schema_version":"1.0"},"canonical_sha256":"2ea8828de63a0c17821fd140f7ad96c5c8a646bc542e11fa5e0b2e5c6d759b57","source":{"kind":"arxiv","id":"1805.07336","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07336","created_at":"2026-05-18T00:15:38Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07336v1","created_at":"2026-05-18T00:15:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07336","created_at":"2026-05-18T00:15:38Z"},{"alias_kind":"pith_short_12","alias_value":"F2UIFDPGHIGB","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"F2UIFDPGHIGBPAQ7","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"F2UIFDPG","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:F2UIFDPGHIGBPAQ72FAPPLMWYX","target":"record","payload":{"canonical_record":{"source":{"id":"1805.07336","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-18T17:37:50Z","cross_cats_sorted":[],"title_canon_sha256":"c894a00efd7a5404ba4ad20bf3b4f6845a8c12411102e313199eeed522dec4a1","abstract_canon_sha256":"5e9f01924d4d9e83af678c2a73afc109cb79c2fca67c02b191cb7c7a2544dcde"},"schema_version":"1.0"},"canonical_sha256":"2ea8828de63a0c17821fd140f7ad96c5c8a646bc542e11fa5e0b2e5c6d759b57","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:38.510912Z","signature_b64":"ynZ6ijsQcnJi3CM7hfnHZc1xIqKTywAoikCMv65YX02DueYViurixQtA1h2Gv6NNfXshv/2PWt0yQvcZhOg2Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ea8828de63a0c17821fd140f7ad96c5c8a646bc542e11fa5e0b2e5c6d759b57","last_reissued_at":"2026-05-18T00:15:38.510282Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:38.510282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.07336","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:15:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TOol7gtVHaxJF3+yXuUEm7/lw2KzSlKRLOCBvDJ9+Hklbjv0UjytScS/ebcQHR0EtwQyfLnXy9IMg4M1fu6DBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:49:54.515096Z"},"content_sha256":"8da5cfd2af45ab6a13f9c54b7944820c51c32a134ee34a509cf3f46dbff74fb3","schema_version":"1.0","event_id":"sha256:8da5cfd2af45ab6a13f9c54b7944820c51c32a134ee34a509cf3f46dbff74fb3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:F2UIFDPGHIGBPAQ72FAPPLMWYX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Partially Inexact Alternating Direction Method of Multipliers and its Iteration-Complexity Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jefferson G. Melo, Max L.N. Goncalves, Vando A. Adona","submitted_at":"2018-05-18T17:37:50Z","abstract_excerpt":"This paper proposes a partially inexact alternating direction method of multipliers for computing approximate solution of a linearly constrained convex optimization problem. This method allows its first subproblem to be solved inexactly using a relative approximate criterion, whereas a proximal term is added to its second subproblem in order to simplify it. A stepsize parameter is included in the updating rule of the Lagrangian multiplier to improve its computational performance.\n  Pointwise and ergodic interation-complexity bounds for the proposed method are established. To the best of our kn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07336","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:15:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rz7GoMNfj26PfcIk8kdP2+Dunk9Yogc1zjPVNJM697brwhbBiYEZ/rZ2QflTFndlbkqMaclaFAgccXv/dg8FCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:49:54.515801Z"},"content_sha256":"c460291c816c1136d3e94bf50cc959dbad1903127e784416cb49245ce2b73115","schema_version":"1.0","event_id":"sha256:c460291c816c1136d3e94bf50cc959dbad1903127e784416cb49245ce2b73115"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F2UIFDPGHIGBPAQ72FAPPLMWYX/bundle.json","state_url":"https://pith.science/pith/F2UIFDPGHIGBPAQ72FAPPLMWYX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F2UIFDPGHIGBPAQ72FAPPLMWYX/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-11T00:49:54Z","links":{"resolver":"https://pith.science/pith/F2UIFDPGHIGBPAQ72FAPPLMWYX","bundle":"https://pith.science/pith/F2UIFDPGHIGBPAQ72FAPPLMWYX/bundle.json","state":"https://pith.science/pith/F2UIFDPGHIGBPAQ72FAPPLMWYX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F2UIFDPGHIGBPAQ72FAPPLMWYX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:F2UIFDPGHIGBPAQ72FAPPLMWYX","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":"5e9f01924d4d9e83af678c2a73afc109cb79c2fca67c02b191cb7c7a2544dcde","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-18T17:37:50Z","title_canon_sha256":"c894a00efd7a5404ba4ad20bf3b4f6845a8c12411102e313199eeed522dec4a1"},"schema_version":"1.0","source":{"id":"1805.07336","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07336","created_at":"2026-05-18T00:15:38Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07336v1","created_at":"2026-05-18T00:15:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07336","created_at":"2026-05-18T00:15:38Z"},{"alias_kind":"pith_short_12","alias_value":"F2UIFDPGHIGB","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"F2UIFDPGHIGBPAQ7","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"F2UIFDPG","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:c460291c816c1136d3e94bf50cc959dbad1903127e784416cb49245ce2b73115","target":"graph","created_at":"2026-05-18T00:15:38Z","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 proposes a partially inexact alternating direction method of multipliers for computing approximate solution of a linearly constrained convex optimization problem. This method allows its first subproblem to be solved inexactly using a relative approximate criterion, whereas a proximal term is added to its second subproblem in order to simplify it. A stepsize parameter is included in the updating rule of the Lagrangian multiplier to improve its computational performance.\n  Pointwise and ergodic interation-complexity bounds for the proposed method are established. To the best of our kn","authors_text":"Jefferson G. Melo, Max L.N. Goncalves, Vando A. Adona","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-18T17:37:50Z","title":"A Partially Inexact Alternating Direction Method of Multipliers and its Iteration-Complexity Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07336","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:8da5cfd2af45ab6a13f9c54b7944820c51c32a134ee34a509cf3f46dbff74fb3","target":"record","created_at":"2026-05-18T00:15:38Z","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":"5e9f01924d4d9e83af678c2a73afc109cb79c2fca67c02b191cb7c7a2544dcde","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-18T17:37:50Z","title_canon_sha256":"c894a00efd7a5404ba4ad20bf3b4f6845a8c12411102e313199eeed522dec4a1"},"schema_version":"1.0","source":{"id":"1805.07336","kind":"arxiv","version":1}},"canonical_sha256":"2ea8828de63a0c17821fd140f7ad96c5c8a646bc542e11fa5e0b2e5c6d759b57","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ea8828de63a0c17821fd140f7ad96c5c8a646bc542e11fa5e0b2e5c6d759b57","first_computed_at":"2026-05-18T00:15:38.510282Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:38.510282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ynZ6ijsQcnJi3CM7hfnHZc1xIqKTywAoikCMv65YX02DueYViurixQtA1h2Gv6NNfXshv/2PWt0yQvcZhOg2Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:38.510912Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.07336","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8da5cfd2af45ab6a13f9c54b7944820c51c32a134ee34a509cf3f46dbff74fb3","sha256:c460291c816c1136d3e94bf50cc959dbad1903127e784416cb49245ce2b73115"],"state_sha256":"4b27dea5035d90aa02d9b1f1dd94fb959c5f6d1966937691dc77f6ee618d2503"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M7QF58lsUR1j0fBwCFEuZIQCQLfTFBtNP24u6fDvWYAemeAqsqxvCNUpBGa352zlCR11661TDrIpGM4FgztkCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T00:49:54.519967Z","bundle_sha256":"191ec804636e1574c8dadb461acff8aebb9f19b2264485cafdb96b3ef953f4f2"}}