{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KGYICDQNSUKDJPP55AQNDXZVRI","short_pith_number":"pith:KGYICDQN","canonical_record":{"source":{"id":"1410.4754","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-10-17T15:15:37Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"bca2f8fc8684e2533972f2c26dd81b9ced7bee8ce603c968d11bf859cc9be5ef","abstract_canon_sha256":"76e8ae9ec6e3e3061f589dda5098f3fb4c1fcecad6253cd551922b5a0ebd5588"},"schema_version":"1.0"},"canonical_sha256":"51b0810e0d951434bdfde820d1df358a3ca5426d4a325d7ebb573276b43ea8c7","source":{"kind":"arxiv","id":"1410.4754","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4754","created_at":"2026-05-18T01:22:52Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4754v2","created_at":"2026-05-18T01:22:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4754","created_at":"2026-05-18T01:22:52Z"},{"alias_kind":"pith_short_12","alias_value":"KGYICDQNSUKD","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KGYICDQNSUKDJPP5","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KGYICDQN","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KGYICDQNSUKDJPP55AQNDXZVRI","target":"record","payload":{"canonical_record":{"source":{"id":"1410.4754","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-10-17T15:15:37Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"bca2f8fc8684e2533972f2c26dd81b9ced7bee8ce603c968d11bf859cc9be5ef","abstract_canon_sha256":"76e8ae9ec6e3e3061f589dda5098f3fb4c1fcecad6253cd551922b5a0ebd5588"},"schema_version":"1.0"},"canonical_sha256":"51b0810e0d951434bdfde820d1df358a3ca5426d4a325d7ebb573276b43ea8c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:52.364954Z","signature_b64":"zn57m3nYqEql6F72h+Vms3HoHHLKTZU2xUMnI99NVc+pzNP4ySFNm2ZQX/d9sm8eDb8HHQKCZxlPi4Lu2cNmDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51b0810e0d951434bdfde820d1df358a3ca5426d4a325d7ebb573276b43ea8c7","last_reissued_at":"2026-05-18T01:22:52.364435Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:52.364435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.4754","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-18T01:22:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oAW9t5gE3My1PdXAPWmodgx9pGfzylTYReyL9JMPkETdsLucN67/k+8A2qBtF7Y+k4BgXPk8eOtgbKbVSNxhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:56:34.445129Z"},"content_sha256":"6320872bf352b83e2ee60d20cb91335c84a802a29991121928d59d4b3cbeb804","schema_version":"1.0","event_id":"sha256:6320872bf352b83e2ee60d20cb91335c84a802a29991121928d59d4b3cbeb804"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KGYICDQNSUKDJPP55AQNDXZVRI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel and Distributed Methods for Nonconvex Optimization-Part I: Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.MA","authors_text":"Francisco Facchinei, Gesualdo Scutari, Lorenzo Lampariello, Peiran Song","submitted_at":"2014-10-17T15:15:37Z","abstract_excerpt":"In this two-part paper, we propose a general algorithmic framework for the minimization of a nonconvex smooth function subject to nonconvex smooth constraints. The algorithm solves a sequence of (separable) strongly convex problems and mantains feasibility at each iteration. Convergence to a stationary solution of the original nonconvex optimization is established. Our framework is very general and flexible; it unifies several existing Successive Convex Approximation (SCA)-based algorithms such as (proximal) gradient or Newton type methods, block coordinate (parallel) descent schemes, differen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4754","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-18T01:22:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wxFIciHSWsoW672/z3Is+OwafUJV9eq4GxR0hE/D/0WZkwkh5wWor4LRijgATdsJOk8U+rW9JWCH40cgcRpeAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:56:34.445531Z"},"content_sha256":"f098a12ddff7e4b5da49ecb03566d31f541f33427774769667208be154325365","schema_version":"1.0","event_id":"sha256:f098a12ddff7e4b5da49ecb03566d31f541f33427774769667208be154325365"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KGYICDQNSUKDJPP55AQNDXZVRI/bundle.json","state_url":"https://pith.science/pith/KGYICDQNSUKDJPP55AQNDXZVRI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KGYICDQNSUKDJPP55AQNDXZVRI/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-05T06:56:34Z","links":{"resolver":"https://pith.science/pith/KGYICDQNSUKDJPP55AQNDXZVRI","bundle":"https://pith.science/pith/KGYICDQNSUKDJPP55AQNDXZVRI/bundle.json","state":"https://pith.science/pith/KGYICDQNSUKDJPP55AQNDXZVRI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KGYICDQNSUKDJPP55AQNDXZVRI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KGYICDQNSUKDJPP55AQNDXZVRI","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":"76e8ae9ec6e3e3061f589dda5098f3fb4c1fcecad6253cd551922b5a0ebd5588","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-10-17T15:15:37Z","title_canon_sha256":"bca2f8fc8684e2533972f2c26dd81b9ced7bee8ce603c968d11bf859cc9be5ef"},"schema_version":"1.0","source":{"id":"1410.4754","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4754","created_at":"2026-05-18T01:22:52Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4754v2","created_at":"2026-05-18T01:22:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4754","created_at":"2026-05-18T01:22:52Z"},{"alias_kind":"pith_short_12","alias_value":"KGYICDQNSUKD","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KGYICDQNSUKDJPP5","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KGYICDQN","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:f098a12ddff7e4b5da49ecb03566d31f541f33427774769667208be154325365","target":"graph","created_at":"2026-05-18T01:22:52Z","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":"In this two-part paper, we propose a general algorithmic framework for the minimization of a nonconvex smooth function subject to nonconvex smooth constraints. The algorithm solves a sequence of (separable) strongly convex problems and mantains feasibility at each iteration. Convergence to a stationary solution of the original nonconvex optimization is established. Our framework is very general and flexible; it unifies several existing Successive Convex Approximation (SCA)-based algorithms such as (proximal) gradient or Newton type methods, block coordinate (parallel) descent schemes, differen","authors_text":"Francisco Facchinei, Gesualdo Scutari, Lorenzo Lampariello, Peiran Song","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-10-17T15:15:37Z","title":"Parallel and Distributed Methods for Nonconvex Optimization-Part I: Theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4754","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:6320872bf352b83e2ee60d20cb91335c84a802a29991121928d59d4b3cbeb804","target":"record","created_at":"2026-05-18T01:22:52Z","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":"76e8ae9ec6e3e3061f589dda5098f3fb4c1fcecad6253cd551922b5a0ebd5588","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-10-17T15:15:37Z","title_canon_sha256":"bca2f8fc8684e2533972f2c26dd81b9ced7bee8ce603c968d11bf859cc9be5ef"},"schema_version":"1.0","source":{"id":"1410.4754","kind":"arxiv","version":2}},"canonical_sha256":"51b0810e0d951434bdfde820d1df358a3ca5426d4a325d7ebb573276b43ea8c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51b0810e0d951434bdfde820d1df358a3ca5426d4a325d7ebb573276b43ea8c7","first_computed_at":"2026-05-18T01:22:52.364435Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:52.364435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zn57m3nYqEql6F72h+Vms3HoHHLKTZU2xUMnI99NVc+pzNP4ySFNm2ZQX/d9sm8eDb8HHQKCZxlPi4Lu2cNmDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:52.364954Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.4754","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6320872bf352b83e2ee60d20cb91335c84a802a29991121928d59d4b3cbeb804","sha256:f098a12ddff7e4b5da49ecb03566d31f541f33427774769667208be154325365"],"state_sha256":"e386e2ea5f045418d5643f2e5531df88b824cee2e729e33fca44b50962b275d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+BG3WR0wg953lTkin7Z95CuwjDanGuExU4aVg97kuvXq3GPG1/DnAZbXR5SYUwumOHHz0OJ0wDzZlTZ5SO2yDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T06:56:34.448076Z","bundle_sha256":"9b5c829d354c69a047e5692c04ab28d37a31bea9e122e1702740719d418d3afc"}}