{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IJPYIDHG6CWQARHSZDFGKC54JO","short_pith_number":"pith:IJPYIDHG","canonical_record":{"source":{"id":"1802.03504","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-10T02:35:06Z","cross_cats_sorted":[],"title_canon_sha256":"5723b6e88bd713ee472ec93413e10bbb2de4a9c49254b9dc4c9a869222422d9c","abstract_canon_sha256":"2de907db0f9d8735a0b5d5db1df2ccd5d11d24fb375a585f4febdaada74cc9f3"},"schema_version":"1.0"},"canonical_sha256":"425f840ce6f0ad0044f2c8ca650bbc4bacc0abb1f5a736f7f42616d2936c4f7d","source":{"kind":"arxiv","id":"1802.03504","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03504","created_at":"2026-05-17T23:40:36Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03504v3","created_at":"2026-05-17T23:40:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03504","created_at":"2026-05-17T23:40:36Z"},{"alias_kind":"pith_short_12","alias_value":"IJPYIDHG6CWQ","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IJPYIDHG6CWQARHS","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IJPYIDHG","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IJPYIDHG6CWQARHSZDFGKC54JO","target":"record","payload":{"canonical_record":{"source":{"id":"1802.03504","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-10T02:35:06Z","cross_cats_sorted":[],"title_canon_sha256":"5723b6e88bd713ee472ec93413e10bbb2de4a9c49254b9dc4c9a869222422d9c","abstract_canon_sha256":"2de907db0f9d8735a0b5d5db1df2ccd5d11d24fb375a585f4febdaada74cc9f3"},"schema_version":"1.0"},"canonical_sha256":"425f840ce6f0ad0044f2c8ca650bbc4bacc0abb1f5a736f7f42616d2936c4f7d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:36.612994Z","signature_b64":"3tanc/ZuVYQAqz3cQ1YEIOpAVFjtu0UZYUWnBfER9Vq7B8XGI4iq4P+5vLdmN6lyQbwBKfMowesDFyDbfbb7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"425f840ce6f0ad0044f2c8ca650bbc4bacc0abb1f5a736f7f42616d2936c4f7d","last_reissued_at":"2026-05-17T23:40:36.612494Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:36.612494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.03504","source_version":3,"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:40:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HvTQ5oalBLyXGBdT0oa9R5ugI58HSw3eGifmrh0sd8F+BiW50yjb0xtRekgarGeENfEnecIFpO+xGRID9obyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:17:47.289427Z"},"content_sha256":"3d1b3998fb44ab2633cfcab01b31f0406f1c12eac1d9c93106444f097385407e","schema_version":"1.0","event_id":"sha256:3d1b3998fb44ab2633cfcab01b31f0406f1c12eac1d9c93106444f097385407e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IJPYIDHG6CWQARHSZDFGKC54JO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite 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, Weiwei Kong","submitted_at":"2018-02-10T02:35:06Z","abstract_excerpt":"This paper analyzes the iteration-complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs. More specifically, the objective function is of the form $f + h$ where $f$ is a differentiable function whose gradient is Lipschitz continuous and $h$ is a closed convex function with bounded domain. The method, basically, consists of applying an accelerated inexact proximal point method for solving approximately a sequence of quadratic penalized subproblems associated to the linearly constrained problem. Each subproblem of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03504","kind":"arxiv","version":3},"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:40:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WOgpOrA4QY3BtwtuGw76PPnXyi4gZlsfmBM2kDgrC/DuGX0O13ckS2UXbmLNQZsibTFj7hqs9HgQHUVJyQejCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:17:47.290096Z"},"content_sha256":"f4855153e08047402799e11e96d9c0e5aa9aabe20d3b6a6e78008420c82f0b3c","schema_version":"1.0","event_id":"sha256:f4855153e08047402799e11e96d9c0e5aa9aabe20d3b6a6e78008420c82f0b3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IJPYIDHG6CWQARHSZDFGKC54JO/bundle.json","state_url":"https://pith.science/pith/IJPYIDHG6CWQARHSZDFGKC54JO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IJPYIDHG6CWQARHSZDFGKC54JO/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-11T06:17:47Z","links":{"resolver":"https://pith.science/pith/IJPYIDHG6CWQARHSZDFGKC54JO","bundle":"https://pith.science/pith/IJPYIDHG6CWQARHSZDFGKC54JO/bundle.json","state":"https://pith.science/pith/IJPYIDHG6CWQARHSZDFGKC54JO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IJPYIDHG6CWQARHSZDFGKC54JO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IJPYIDHG6CWQARHSZDFGKC54JO","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":"2de907db0f9d8735a0b5d5db1df2ccd5d11d24fb375a585f4febdaada74cc9f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-10T02:35:06Z","title_canon_sha256":"5723b6e88bd713ee472ec93413e10bbb2de4a9c49254b9dc4c9a869222422d9c"},"schema_version":"1.0","source":{"id":"1802.03504","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03504","created_at":"2026-05-17T23:40:36Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03504v3","created_at":"2026-05-17T23:40:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03504","created_at":"2026-05-17T23:40:36Z"},{"alias_kind":"pith_short_12","alias_value":"IJPYIDHG6CWQ","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IJPYIDHG6CWQARHS","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IJPYIDHG","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:f4855153e08047402799e11e96d9c0e5aa9aabe20d3b6a6e78008420c82f0b3c","target":"graph","created_at":"2026-05-17T23:40:36Z","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 analyzes the iteration-complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs. More specifically, the objective function is of the form $f + h$ where $f$ is a differentiable function whose gradient is Lipschitz continuous and $h$ is a closed convex function with bounded domain. The method, basically, consists of applying an accelerated inexact proximal point method for solving approximately a sequence of quadratic penalized subproblems associated to the linearly constrained problem. Each subproblem of","authors_text":"Jefferson G. Melo, Renato D.C. Monteiro, Weiwei Kong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-10T02:35:06Z","title":"Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03504","kind":"arxiv","version":3},"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:3d1b3998fb44ab2633cfcab01b31f0406f1c12eac1d9c93106444f097385407e","target":"record","created_at":"2026-05-17T23:40:36Z","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":"2de907db0f9d8735a0b5d5db1df2ccd5d11d24fb375a585f4febdaada74cc9f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-10T02:35:06Z","title_canon_sha256":"5723b6e88bd713ee472ec93413e10bbb2de4a9c49254b9dc4c9a869222422d9c"},"schema_version":"1.0","source":{"id":"1802.03504","kind":"arxiv","version":3}},"canonical_sha256":"425f840ce6f0ad0044f2c8ca650bbc4bacc0abb1f5a736f7f42616d2936c4f7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"425f840ce6f0ad0044f2c8ca650bbc4bacc0abb1f5a736f7f42616d2936c4f7d","first_computed_at":"2026-05-17T23:40:36.612494Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:36.612494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3tanc/ZuVYQAqz3cQ1YEIOpAVFjtu0UZYUWnBfER9Vq7B8XGI4iq4P+5vLdmN6lyQbwBKfMowesDFyDbfbb7BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:36.612994Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.03504","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d1b3998fb44ab2633cfcab01b31f0406f1c12eac1d9c93106444f097385407e","sha256:f4855153e08047402799e11e96d9c0e5aa9aabe20d3b6a6e78008420c82f0b3c"],"state_sha256":"c2fda1eb9625dac7b46440ba47db5f4b00c50210509a748a16585107748b25f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7+/eNdlYD36Mw8RLRLnD3IppU7axogMT0gHUjewAEgtDyZmuc1Bt6zUgNzsYYQ107Kgyo/vDO1IQ/WqFH4r0AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:17:47.293510Z","bundle_sha256":"66c667562b60a284d17c59789e35bd9ba33f440eb28f70f264575e52b9316d61"}}