{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YLYSSEDFBHPV5B5QLIBYBL4ZRU","short_pith_number":"pith:YLYSSEDF","canonical_record":{"source":{"id":"1811.11378","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-28T04:25:17Z","cross_cats_sorted":[],"title_canon_sha256":"a65044e14f0945e4cc177689f02e05c96555c810d1f8884a096c7f681580c786","abstract_canon_sha256":"5d9d8a00d211fbaec64e755500a09de5234222662278149b431a9e0a35108c5b"},"schema_version":"1.0"},"canonical_sha256":"c2f129106509df5e87b05a0380af998d07c1eefd28ff5bac249b702f78523eb6","source":{"kind":"arxiv","id":"1811.11378","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11378","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11378v2","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11378","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"YLYSSEDFBHPV","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YLYSSEDFBHPV5B5Q","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YLYSSEDF","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YLYSSEDFBHPV5B5QLIBYBL4ZRU","target":"record","payload":{"canonical_record":{"source":{"id":"1811.11378","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-28T04:25:17Z","cross_cats_sorted":[],"title_canon_sha256":"a65044e14f0945e4cc177689f02e05c96555c810d1f8884a096c7f681580c786","abstract_canon_sha256":"5d9d8a00d211fbaec64e755500a09de5234222662278149b431a9e0a35108c5b"},"schema_version":"1.0"},"canonical_sha256":"c2f129106509df5e87b05a0380af998d07c1eefd28ff5bac249b702f78523eb6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:56.848787Z","signature_b64":"vYHEdECd1tR5k/WRxuZwU9NelkMPbsAaGNafoyHm7LylEHPJ4C/wR5sBsr9itjbARKE4KDpqiZsjVJ4NhOcrAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2f129106509df5e87b05a0380af998d07c1eefd28ff5bac249b702f78523eb6","last_reissued_at":"2026-05-17T23:57:56.848117Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:56.848117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.11378","source_version":2,"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-17T23:57:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r+r6EQwD/g32fOCZje/NQlq0S102fJUulJYs006BoAJFGRG2wZaw5g+y49uzHE/y5tWR+UGDk6OJ4DzOafBrDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T07:06:55.142374Z"},"content_sha256":"34ce5663c352c0e9902754950fc31fbdf23aafe295371b864b382ba1740710fb","schema_version":"1.0","event_id":"sha256:34ce5663c352c0e9902754950fc31fbdf23aafe295371b864b382ba1740710fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YLYSSEDFBHPV5B5QLIBYBL4ZRU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Doubly Accelerated Inexact Proximal Point Method for Nonconvex Composite Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jiaming Liang, Renato D.C. Monteiro","submitted_at":"2018-11-28T04:25:17Z","abstract_excerpt":"This paper describes and establishes the iteration-complexity of a doubly accelerated inexact proximal point (D-AIPP) method for solving the nonconvex composite minimization problem whose objective function is of the form $f+h$ where $f$ is a (possibly nonconvex) differentiable function whose gradient is Lipschitz continuous and $h$ is a closed convex function with bounded domain. D-AIPP performs two types of iterations, namely, inner and outer ones. Its outer iterations correspond to the ones of the accelerated inexact proximal point scheme. Its inner iterations are the ones performed by an a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11378","kind":"arxiv","version":2},"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-17T23:57:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6QoSlSshHLVfY9FnqPj84+ocUlVR8mFuIErWNvT2+wlBV8exSD9421dHrFm9wCZ4Cfl6lZ50n9KgzYUuxpzDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T07:06:55.142825Z"},"content_sha256":"7bbc980be2479ee3c8fc560fccc2932d4394bdfec08544351851319e88c3d0f1","schema_version":"1.0","event_id":"sha256:7bbc980be2479ee3c8fc560fccc2932d4394bdfec08544351851319e88c3d0f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YLYSSEDFBHPV5B5QLIBYBL4ZRU/bundle.json","state_url":"https://pith.science/pith/YLYSSEDFBHPV5B5QLIBYBL4ZRU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YLYSSEDFBHPV5B5QLIBYBL4ZRU/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-16T07:06:55Z","links":{"resolver":"https://pith.science/pith/YLYSSEDFBHPV5B5QLIBYBL4ZRU","bundle":"https://pith.science/pith/YLYSSEDFBHPV5B5QLIBYBL4ZRU/bundle.json","state":"https://pith.science/pith/YLYSSEDFBHPV5B5QLIBYBL4ZRU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YLYSSEDFBHPV5B5QLIBYBL4ZRU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YLYSSEDFBHPV5B5QLIBYBL4ZRU","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":"5d9d8a00d211fbaec64e755500a09de5234222662278149b431a9e0a35108c5b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-28T04:25:17Z","title_canon_sha256":"a65044e14f0945e4cc177689f02e05c96555c810d1f8884a096c7f681580c786"},"schema_version":"1.0","source":{"id":"1811.11378","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11378","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11378v2","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11378","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"YLYSSEDFBHPV","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YLYSSEDFBHPV5B5Q","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YLYSSEDF","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:7bbc980be2479ee3c8fc560fccc2932d4394bdfec08544351851319e88c3d0f1","target":"graph","created_at":"2026-05-17T23:57:56Z","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 describes and establishes the iteration-complexity of a doubly accelerated inexact proximal point (D-AIPP) method for solving the nonconvex composite minimization problem whose objective function is of the form $f+h$ where $f$ is a (possibly nonconvex) differentiable function whose gradient is Lipschitz continuous and $h$ is a closed convex function with bounded domain. D-AIPP performs two types of iterations, namely, inner and outer ones. Its outer iterations correspond to the ones of the accelerated inexact proximal point scheme. Its inner iterations are the ones performed by an a","authors_text":"Jiaming Liang, Renato D.C. Monteiro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-28T04:25:17Z","title":"A Doubly Accelerated Inexact Proximal Point Method for Nonconvex Composite Optimization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11378","kind":"arxiv","version":2},"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:34ce5663c352c0e9902754950fc31fbdf23aafe295371b864b382ba1740710fb","target":"record","created_at":"2026-05-17T23:57:56Z","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":"5d9d8a00d211fbaec64e755500a09de5234222662278149b431a9e0a35108c5b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-28T04:25:17Z","title_canon_sha256":"a65044e14f0945e4cc177689f02e05c96555c810d1f8884a096c7f681580c786"},"schema_version":"1.0","source":{"id":"1811.11378","kind":"arxiv","version":2}},"canonical_sha256":"c2f129106509df5e87b05a0380af998d07c1eefd28ff5bac249b702f78523eb6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2f129106509df5e87b05a0380af998d07c1eefd28ff5bac249b702f78523eb6","first_computed_at":"2026-05-17T23:57:56.848117Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:56.848117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vYHEdECd1tR5k/WRxuZwU9NelkMPbsAaGNafoyHm7LylEHPJ4C/wR5sBsr9itjbARKE4KDpqiZsjVJ4NhOcrAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:56.848787Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.11378","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34ce5663c352c0e9902754950fc31fbdf23aafe295371b864b382ba1740710fb","sha256:7bbc980be2479ee3c8fc560fccc2932d4394bdfec08544351851319e88c3d0f1"],"state_sha256":"16b39b0e659a85340c952bd02334425b0e86be5872e898caa33b148b2a13af4f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RzWjy6ap1S97fGN+Rp8EplQbY2ubj8m5G+ihRKFk0RwgkeRzq7MhWodLBj/TLCoOiT8Ul5YeQ1nVy8VpZxwZBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T07:06:55.147968Z","bundle_sha256":"4ee3fcd9dc81eaef1933f50b696d32c1ba672608a62f6dbaab97160cc21530d3"}}