{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:A73N2UI7AHHE2TGZKQRZ3ZFGPD","short_pith_number":"pith:A73N2UI7","schema_version":"1.0","canonical_sha256":"07f6dd511f01ce4d4cd954239de4a678ee8654fa9f927d58a9dbbc6962506fd5","source":{"kind":"arxiv","id":"1701.04900","version":2},"attestation_state":"computed","paper":{"title":"Asynchronous Parallel Algorithms for Nonconvex Big-Data Optimization. Part II: Complexity and Numerical Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Francisco Facchinei, Gesualdo Scutari, Loris Cannelli, Vyacheslav Kungurtsev","submitted_at":"2017-01-17T23:30:56Z","abstract_excerpt":"We present complexity and numerical results for a new asynchronous parallel algorithmic method for the minimization of the sum of a smooth nonconvex function and a convex nonsmooth regularizer, subject to both convex and nonconvex constraints. The proposed method hinges on successive convex approximation techniques and a novel probabilistic model that captures key elements of modern computational architectures and asynchronous implementations in a more faithful way than state-of-the-art models. In the companion paper we provided a detailed description on the probabilistic model and gave conver"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1701.04900","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-17T23:30:56Z","cross_cats_sorted":[],"title_canon_sha256":"219b61557dc836348c1e0b55d60dfa411e8c2166dedf11a9a5ec319965af0547","abstract_canon_sha256":"4c2be1c46e350aac7c3c93f07465771c625f4ac54d36a65c5a89d4c1a9cf8db5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:29.181017Z","signature_b64":"llMBeY9DADepawqs1+F6DvJSw4H72ESiV0c41aLAw7zUvTztvN4y7dClK29riTgKDGEzouNBZWWU+edPUb5nAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07f6dd511f01ce4d4cd954239de4a678ee8654fa9f927d58a9dbbc6962506fd5","last_reissued_at":"2026-05-18T00:52:29.180591Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:29.180591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asynchronous Parallel Algorithms for Nonconvex Big-Data Optimization. Part II: Complexity and Numerical Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Francisco Facchinei, Gesualdo Scutari, Loris Cannelli, Vyacheslav Kungurtsev","submitted_at":"2017-01-17T23:30:56Z","abstract_excerpt":"We present complexity and numerical results for a new asynchronous parallel algorithmic method for the minimization of the sum of a smooth nonconvex function and a convex nonsmooth regularizer, subject to both convex and nonconvex constraints. The proposed method hinges on successive convex approximation techniques and a novel probabilistic model that captures key elements of modern computational architectures and asynchronous implementations in a more faithful way than state-of-the-art models. In the companion paper we provided a detailed description on the probabilistic model and gave conver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04900","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.04900","created_at":"2026-05-18T00:52:29.180657+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.04900v2","created_at":"2026-05-18T00:52:29.180657+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04900","created_at":"2026-05-18T00:52:29.180657+00:00"},{"alias_kind":"pith_short_12","alias_value":"A73N2UI7AHHE","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"A73N2UI7AHHE2TGZ","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"A73N2UI7","created_at":"2026-05-18T12:31:05.417338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A73N2UI7AHHE2TGZKQRZ3ZFGPD","json":"https://pith.science/pith/A73N2UI7AHHE2TGZKQRZ3ZFGPD.json","graph_json":"https://pith.science/api/pith-number/A73N2UI7AHHE2TGZKQRZ3ZFGPD/graph.json","events_json":"https://pith.science/api/pith-number/A73N2UI7AHHE2TGZKQRZ3ZFGPD/events.json","paper":"https://pith.science/paper/A73N2UI7"},"agent_actions":{"view_html":"https://pith.science/pith/A73N2UI7AHHE2TGZKQRZ3ZFGPD","download_json":"https://pith.science/pith/A73N2UI7AHHE2TGZKQRZ3ZFGPD.json","view_paper":"https://pith.science/paper/A73N2UI7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.04900&json=true","fetch_graph":"https://pith.science/api/pith-number/A73N2UI7AHHE2TGZKQRZ3ZFGPD/graph.json","fetch_events":"https://pith.science/api/pith-number/A73N2UI7AHHE2TGZKQRZ3ZFGPD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A73N2UI7AHHE2TGZKQRZ3ZFGPD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A73N2UI7AHHE2TGZKQRZ3ZFGPD/action/storage_attestation","attest_author":"https://pith.science/pith/A73N2UI7AHHE2TGZKQRZ3ZFGPD/action/author_attestation","sign_citation":"https://pith.science/pith/A73N2UI7AHHE2TGZKQRZ3ZFGPD/action/citation_signature","submit_replication":"https://pith.science/pith/A73N2UI7AHHE2TGZKQRZ3ZFGPD/action/replication_record"}},"created_at":"2026-05-18T00:52:29.180657+00:00","updated_at":"2026-05-18T00:52:29.180657+00:00"}