{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OEJPU34LMNMXW73GPQX4FBLANT","short_pith_number":"pith:OEJPU34L","schema_version":"1.0","canonical_sha256":"7112fa6f8b63597b7f667c2fc285606cfba240c93247abc0f829483844f33988","source":{"kind":"arxiv","id":"1407.4504","version":2},"attestation_state":"computed","paper":{"title":"Hybrid Random/Deterministic Parallel Algorithms for Nonconvex Big Data Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DC","authors_text":"Amir Daneshmand, Francisco Facchinei, Gesualdo Scutari, Vyacheslav Kungurtsev","submitted_at":"2014-07-16T21:42:34Z","abstract_excerpt":"We propose a decomposition framework for the parallel optimization of the sum of a differentiable {(possibly nonconvex)} function and a nonsmooth (possibly nonseparable), convex one. The latter term is usually employed to enforce structure in the solution, typically sparsity. The main contribution of this work is a novel \\emph{parallel, hybrid random/deterministic} decomposition scheme wherein, at each iteration, a subset of (block) variables is updated at the same time by minimizing local convex approximations of the original nonconvex function. To tackle with huge-scale problems, the (block)"},"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":"1407.4504","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-16T21:42:34Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"6579cd3c0771fdee4bb91d6872bf2e1302db3567773acf6ea0d61c43f94af33f","abstract_canon_sha256":"d14c559e5aa1d8517eeb4e5afa95ed2c46fd860afe966668186caff064da4ebc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:31:44.424672Z","signature_b64":"aXmrw7xtHBrkUyEH1hdgZU07naSxSfGykgm39So1qCmcc/qGShym+1uBTFxAWP5ii0GgkkFpsMY4SnUqVrw5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7112fa6f8b63597b7f667c2fc285606cfba240c93247abc0f829483844f33988","last_reissued_at":"2026-07-05T06:31:44.424252Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:31:44.424252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hybrid Random/Deterministic Parallel Algorithms for Nonconvex Big Data Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DC","authors_text":"Amir Daneshmand, Francisco Facchinei, Gesualdo Scutari, Vyacheslav Kungurtsev","submitted_at":"2014-07-16T21:42:34Z","abstract_excerpt":"We propose a decomposition framework for the parallel optimization of the sum of a differentiable {(possibly nonconvex)} function and a nonsmooth (possibly nonseparable), convex one. The latter term is usually employed to enforce structure in the solution, typically sparsity. The main contribution of this work is a novel \\emph{parallel, hybrid random/deterministic} decomposition scheme wherein, at each iteration, a subset of (block) variables is updated at the same time by minimizing local convex approximations of the original nonconvex function. To tackle with huge-scale problems, the (block)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4504","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1407.4504/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.4504","created_at":"2026-07-05T06:31:44.424304+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.4504v2","created_at":"2026-07-05T06:31:44.424304+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4504","created_at":"2026-07-05T06:31:44.424304+00:00"},{"alias_kind":"pith_short_12","alias_value":"OEJPU34LMNMX","created_at":"2026-07-05T06:31:44.424304+00:00"},{"alias_kind":"pith_short_16","alias_value":"OEJPU34LMNMXW73G","created_at":"2026-07-05T06:31:44.424304+00:00"},{"alias_kind":"pith_short_8","alias_value":"OEJPU34L","created_at":"2026-07-05T06:31:44.424304+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/OEJPU34LMNMXW73GPQX4FBLANT","json":"https://pith.science/pith/OEJPU34LMNMXW73GPQX4FBLANT.json","graph_json":"https://pith.science/api/pith-number/OEJPU34LMNMXW73GPQX4FBLANT/graph.json","events_json":"https://pith.science/api/pith-number/OEJPU34LMNMXW73GPQX4FBLANT/events.json","paper":"https://pith.science/paper/OEJPU34L"},"agent_actions":{"view_html":"https://pith.science/pith/OEJPU34LMNMXW73GPQX4FBLANT","download_json":"https://pith.science/pith/OEJPU34LMNMXW73GPQX4FBLANT.json","view_paper":"https://pith.science/paper/OEJPU34L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.4504&json=true","fetch_graph":"https://pith.science/api/pith-number/OEJPU34LMNMXW73GPQX4FBLANT/graph.json","fetch_events":"https://pith.science/api/pith-number/OEJPU34LMNMXW73GPQX4FBLANT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OEJPU34LMNMXW73GPQX4FBLANT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OEJPU34LMNMXW73GPQX4FBLANT/action/storage_attestation","attest_author":"https://pith.science/pith/OEJPU34LMNMXW73GPQX4FBLANT/action/author_attestation","sign_citation":"https://pith.science/pith/OEJPU34LMNMXW73GPQX4FBLANT/action/citation_signature","submit_replication":"https://pith.science/pith/OEJPU34LMNMXW73GPQX4FBLANT/action/replication_record"}},"created_at":"2026-07-05T06:31:44.424304+00:00","updated_at":"2026-07-05T06:31:44.424304+00:00"}