{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WEJ3GOP2BOFQDFWTU5R2AMQ57W","short_pith_number":"pith:WEJ3GOP2","schema_version":"1.0","canonical_sha256":"b113b339fa0b8b0196d3a763a0321dfda4756deea3fffff9f5c1825e7a97119c","source":{"kind":"arxiv","id":"1703.08370","version":1},"attestation_state":"computed","paper":{"title":"A randomized primal distributed algorithm for partitioned and big-data non-convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.DC","authors_text":"Giuseppe Notarstefano, Ivano Notarnicola","submitted_at":"2017-03-24T11:43:51Z","abstract_excerpt":"In this paper we consider a distributed optimization scenario in which the aggregate objective function to minimize is partitioned, big-data and possibly non-convex. Specifically, we focus on a set-up in which the dimension of the decision variable depends on the network size as well as the number of local functions, but each local function handled by a node depends only on a (small) portion of the entire optimization variable. This problem set-up has been shown to appear in many interesting network application scenarios. As main paper contribution, we develop a simple, primal distributed algo"},"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":"1703.08370","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-03-24T11:43:51Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"037fb86c58305ca1f7b5e0a04603e1e3a0ab351155c5b805774fe4918ffac214","abstract_canon_sha256":"fcfc36fc8f40fb6044c93527d18c2e58030b438f23c806a6c297df742b4a4996"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:00.078256Z","signature_b64":"Kmo4XflxPMypLLuEsR7c/jU6q4nU1ojbxaU4riT1mcN0Wwy6ojp/ONgHYXkpFQHEX6j2SC2hSQTvQB3YjQlnCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b113b339fa0b8b0196d3a763a0321dfda4756deea3fffff9f5c1825e7a97119c","last_reissued_at":"2026-05-18T00:48:00.077815Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:00.077815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A randomized primal distributed algorithm for partitioned and big-data non-convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.DC","authors_text":"Giuseppe Notarstefano, Ivano Notarnicola","submitted_at":"2017-03-24T11:43:51Z","abstract_excerpt":"In this paper we consider a distributed optimization scenario in which the aggregate objective function to minimize is partitioned, big-data and possibly non-convex. Specifically, we focus on a set-up in which the dimension of the decision variable depends on the network size as well as the number of local functions, but each local function handled by a node depends only on a (small) portion of the entire optimization variable. This problem set-up has been shown to appear in many interesting network application scenarios. As main paper contribution, we develop a simple, primal distributed algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08370","kind":"arxiv","version":1},"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":"1703.08370","created_at":"2026-05-18T00:48:00.077877+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.08370v1","created_at":"2026-05-18T00:48:00.077877+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08370","created_at":"2026-05-18T00:48:00.077877+00:00"},{"alias_kind":"pith_short_12","alias_value":"WEJ3GOP2BOFQ","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WEJ3GOP2BOFQDFWT","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WEJ3GOP2","created_at":"2026-05-18T12:31:53.515858+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/WEJ3GOP2BOFQDFWTU5R2AMQ57W","json":"https://pith.science/pith/WEJ3GOP2BOFQDFWTU5R2AMQ57W.json","graph_json":"https://pith.science/api/pith-number/WEJ3GOP2BOFQDFWTU5R2AMQ57W/graph.json","events_json":"https://pith.science/api/pith-number/WEJ3GOP2BOFQDFWTU5R2AMQ57W/events.json","paper":"https://pith.science/paper/WEJ3GOP2"},"agent_actions":{"view_html":"https://pith.science/pith/WEJ3GOP2BOFQDFWTU5R2AMQ57W","download_json":"https://pith.science/pith/WEJ3GOP2BOFQDFWTU5R2AMQ57W.json","view_paper":"https://pith.science/paper/WEJ3GOP2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.08370&json=true","fetch_graph":"https://pith.science/api/pith-number/WEJ3GOP2BOFQDFWTU5R2AMQ57W/graph.json","fetch_events":"https://pith.science/api/pith-number/WEJ3GOP2BOFQDFWTU5R2AMQ57W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WEJ3GOP2BOFQDFWTU5R2AMQ57W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WEJ3GOP2BOFQDFWTU5R2AMQ57W/action/storage_attestation","attest_author":"https://pith.science/pith/WEJ3GOP2BOFQDFWTU5R2AMQ57W/action/author_attestation","sign_citation":"https://pith.science/pith/WEJ3GOP2BOFQDFWTU5R2AMQ57W/action/citation_signature","submit_replication":"https://pith.science/pith/WEJ3GOP2BOFQDFWTU5R2AMQ57W/action/replication_record"}},"created_at":"2026-05-18T00:48:00.077877+00:00","updated_at":"2026-05-18T00:48:00.077877+00:00"}