{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AC6ETWBKC4BDEQOQQHDSW5XNR3","short_pith_number":"pith:AC6ETWBK","canonical_record":{"source":{"id":"1908.11518","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-30T03:33:53Z","cross_cats_sorted":["cs.CC","cs.NA","math.NA"],"title_canon_sha256":"dd54347dd0ce78a27247af6fdfe9268c2ef8b91301c8a63b0fdd07a04fc37504","abstract_canon_sha256":"1c19838fe3558d750c07721db850ec13f48da7b0bd698e00f623f2bc6b0def66"},"schema_version":"1.0"},"canonical_sha256":"00bc49d82a17023241d081c72b76ed8ed9b270d0260bab410e662a4b759dc7f7","source":{"kind":"arxiv","id":"1908.11518","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.11518","created_at":"2026-07-05T01:55:42Z"},{"alias_kind":"arxiv_version","alias_value":"1908.11518v4","created_at":"2026-07-05T01:55:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.11518","created_at":"2026-07-05T01:55:42Z"},{"alias_kind":"pith_short_12","alias_value":"AC6ETWBKC4BD","created_at":"2026-07-05T01:55:42Z"},{"alias_kind":"pith_short_16","alias_value":"AC6ETWBKC4BDEQOQ","created_at":"2026-07-05T01:55:42Z"},{"alias_kind":"pith_short_8","alias_value":"AC6ETWBK","created_at":"2026-07-05T01:55:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AC6ETWBKC4BDEQOQQHDSW5XNR3","target":"record","payload":{"canonical_record":{"source":{"id":"1908.11518","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-30T03:33:53Z","cross_cats_sorted":["cs.CC","cs.NA","math.NA"],"title_canon_sha256":"dd54347dd0ce78a27247af6fdfe9268c2ef8b91301c8a63b0fdd07a04fc37504","abstract_canon_sha256":"1c19838fe3558d750c07721db850ec13f48da7b0bd698e00f623f2bc6b0def66"},"schema_version":"1.0"},"canonical_sha256":"00bc49d82a17023241d081c72b76ed8ed9b270d0260bab410e662a4b759dc7f7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:55:42.867806Z","signature_b64":"vypQtkJtnkUpCYz0t8HgrIyGABCiuaUuuyxh3ESDga3BKYc8WIV9fR8HJU+6NvW0QB3jJsAokjCl/ZWMMlMhDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00bc49d82a17023241d081c72b76ed8ed9b270d0260bab410e662a4b759dc7f7","last_reissued_at":"2026-07-05T01:55:42.867355Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:55:42.867355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.11518","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-05T01:55:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PxWVqZZ4KdRhigNTap8kBXlvYTj4VauRHOXw+OfdVzn9x00/xjlknCx9TlsWtrCn9aolEfAJUtO6vkDpDSqMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T18:44:52.199866Z"},"content_sha256":"b4cb0ff1203e54c1d1081159eed3ceecf8800879fb8b35bd41eba436e8a9aea6","schema_version":"1.0","event_id":"sha256:b4cb0ff1203e54c1d1081159eed3ceecf8800879fb8b35bd41eba436e8a9aea6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AC6ETWBKC4BDEQOQQHDSW5XNR3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inexact Proximal-Point Penalty Methods for Constrained Non-Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Qihang Lin, Runchao Ma, Yangyang Xu","submitted_at":"2019-08-30T03:33:53Z","abstract_excerpt":"In this paper, an inexact proximal-point penalty method is studied for constrained optimization problems, where the objective function is non-convex, and the constraint functions can also be non-convex. The proposed method approximately solves a sequence of subproblems, each of which is formed by adding to the original objective function a proximal term and quadratic penalty terms associated to the constraint functions. Under a weak-convexity assumption, each subproblem is made strongly convex and can be solved effectively to a required accuracy by an optimal gradient-based method. The computa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.11518","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/1908.11518/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-05T01:55:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eNVeunWyP/pLHwaSyX76aFMA/0uEv+Z4apV4BSv6MEsaZFVpsBI5rHVgxzXHdmOtbtl9Y76NZLFn+MUWRxNgAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T18:44:52.200873Z"},"content_sha256":"c12f57120f91f8855582d2f5b29deeffabb939efdac4d9699a7ad5f09c48ce4f","schema_version":"1.0","event_id":"sha256:c12f57120f91f8855582d2f5b29deeffabb939efdac4d9699a7ad5f09c48ce4f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AC6ETWBKC4BDEQOQQHDSW5XNR3/bundle.json","state_url":"https://pith.science/pith/AC6ETWBKC4BDEQOQQHDSW5XNR3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AC6ETWBKC4BDEQOQQHDSW5XNR3/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-13T18:44:52Z","links":{"resolver":"https://pith.science/pith/AC6ETWBKC4BDEQOQQHDSW5XNR3","bundle":"https://pith.science/pith/AC6ETWBKC4BDEQOQQHDSW5XNR3/bundle.json","state":"https://pith.science/pith/AC6ETWBKC4BDEQOQQHDSW5XNR3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AC6ETWBKC4BDEQOQQHDSW5XNR3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AC6ETWBKC4BDEQOQQHDSW5XNR3","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":"1c19838fe3558d750c07721db850ec13f48da7b0bd698e00f623f2bc6b0def66","cross_cats_sorted":["cs.CC","cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-30T03:33:53Z","title_canon_sha256":"dd54347dd0ce78a27247af6fdfe9268c2ef8b91301c8a63b0fdd07a04fc37504"},"schema_version":"1.0","source":{"id":"1908.11518","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.11518","created_at":"2026-07-05T01:55:42Z"},{"alias_kind":"arxiv_version","alias_value":"1908.11518v4","created_at":"2026-07-05T01:55:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.11518","created_at":"2026-07-05T01:55:42Z"},{"alias_kind":"pith_short_12","alias_value":"AC6ETWBKC4BD","created_at":"2026-07-05T01:55:42Z"},{"alias_kind":"pith_short_16","alias_value":"AC6ETWBKC4BDEQOQ","created_at":"2026-07-05T01:55:42Z"},{"alias_kind":"pith_short_8","alias_value":"AC6ETWBK","created_at":"2026-07-05T01:55:42Z"}],"graph_snapshots":[{"event_id":"sha256:c12f57120f91f8855582d2f5b29deeffabb939efdac4d9699a7ad5f09c48ce4f","target":"graph","created_at":"2026-07-05T01:55:42Z","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/1908.11518/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, an inexact proximal-point penalty method is studied for constrained optimization problems, where the objective function is non-convex, and the constraint functions can also be non-convex. The proposed method approximately solves a sequence of subproblems, each of which is formed by adding to the original objective function a proximal term and quadratic penalty terms associated to the constraint functions. Under a weak-convexity assumption, each subproblem is made strongly convex and can be solved effectively to a required accuracy by an optimal gradient-based method. The computa","authors_text":"Qihang Lin, Runchao Ma, Yangyang Xu","cross_cats":["cs.CC","cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-30T03:33:53Z","title":"Inexact Proximal-Point Penalty Methods for Constrained Non-Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.11518","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:b4cb0ff1203e54c1d1081159eed3ceecf8800879fb8b35bd41eba436e8a9aea6","target":"record","created_at":"2026-07-05T01:55:42Z","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":"1c19838fe3558d750c07721db850ec13f48da7b0bd698e00f623f2bc6b0def66","cross_cats_sorted":["cs.CC","cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-30T03:33:53Z","title_canon_sha256":"dd54347dd0ce78a27247af6fdfe9268c2ef8b91301c8a63b0fdd07a04fc37504"},"schema_version":"1.0","source":{"id":"1908.11518","kind":"arxiv","version":4}},"canonical_sha256":"00bc49d82a17023241d081c72b76ed8ed9b270d0260bab410e662a4b759dc7f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00bc49d82a17023241d081c72b76ed8ed9b270d0260bab410e662a4b759dc7f7","first_computed_at":"2026-07-05T01:55:42.867355Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:55:42.867355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vypQtkJtnkUpCYz0t8HgrIyGABCiuaUuuyxh3ESDga3BKYc8WIV9fR8HJU+6NvW0QB3jJsAokjCl/ZWMMlMhDw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:55:42.867806Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.11518","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4cb0ff1203e54c1d1081159eed3ceecf8800879fb8b35bd41eba436e8a9aea6","sha256:c12f57120f91f8855582d2f5b29deeffabb939efdac4d9699a7ad5f09c48ce4f"],"state_sha256":"6410d8d440229c6bb4722ea13a717bef29d23f9ddcb1236da377a2cd6ddc6628"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6JE/KtITMF18hq6hd/p6zgMhrRK8B2kJlxIQKOm9H5cdIAvm76erAEZVU55StM1bnjn2ANrtriW9W8CHViM4AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T18:44:52.217236Z","bundle_sha256":"5cdd3267a638090304585f38fc928fa748f6c4e998c99d417e92b4ba13633d95"}}