{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6OLFJCX2MSU3MTYJJ4QK67B5OH","short_pith_number":"pith:6OLFJCX2","schema_version":"1.0","canonical_sha256":"f396548afa64a9b64f094f20af7c3d71f4ff0c4d7990bca06bc456b5c1c345d3","source":{"kind":"arxiv","id":"1805.08460","version":1},"attestation_state":"computed","paper":{"title":"Distributed Partitioned Big-Data Optimization via Asynchronous Dual Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Giuseppe Notarstefano, Ivano Notarnicola, Ruggero Carli","submitted_at":"2018-05-22T08:58:11Z","abstract_excerpt":"In this paper we consider a novel partitioned framework for distributed optimization in peer-to-peer networks. In several important applications the agents of a network have to solve an optimization problem with two key features: (i) the dimension of the decision variable depends on the network size, and (ii) cost function and constraints have a sparsity structure related to the communication graph. For this class of problems a straightforward application of existing consensus methods would show two inefficiencies: poor scalability and redundancy of shared information. We propose an asynchrono"},"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":"1805.08460","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-05-22T08:58:11Z","cross_cats_sorted":[],"title_canon_sha256":"fd02654604f85859019788221678373a51e4e1e7c22e2980dc7e6507591319bb","abstract_canon_sha256":"aea69ef7663e269d6be5f7a9a2269d80ea2941ccfaddf48b619ecaca49570f3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:26.395045Z","signature_b64":"a3xQFrJTaQKgDc4auaX6jq3ebolJ01Fv3LRN0QMAUQpQnEI4N6gyv1sUxpmC8VeG52Cbs1C3Q0ZYrlP18oH8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f396548afa64a9b64f094f20af7c3d71f4ff0c4d7990bca06bc456b5c1c345d3","last_reissued_at":"2026-05-18T00:15:26.394373Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:26.394373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Partitioned Big-Data Optimization via Asynchronous Dual Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Giuseppe Notarstefano, Ivano Notarnicola, Ruggero Carli","submitted_at":"2018-05-22T08:58:11Z","abstract_excerpt":"In this paper we consider a novel partitioned framework for distributed optimization in peer-to-peer networks. In several important applications the agents of a network have to solve an optimization problem with two key features: (i) the dimension of the decision variable depends on the network size, and (ii) cost function and constraints have a sparsity structure related to the communication graph. For this class of problems a straightforward application of existing consensus methods would show two inefficiencies: poor scalability and redundancy of shared information. We propose an asynchrono"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08460","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":"1805.08460","created_at":"2026-05-18T00:15:26.394493+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.08460v1","created_at":"2026-05-18T00:15:26.394493+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08460","created_at":"2026-05-18T00:15:26.394493+00:00"},{"alias_kind":"pith_short_12","alias_value":"6OLFJCX2MSU3","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"6OLFJCX2MSU3MTYJ","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"6OLFJCX2","created_at":"2026-05-18T12:32:11.075285+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/6OLFJCX2MSU3MTYJJ4QK67B5OH","json":"https://pith.science/pith/6OLFJCX2MSU3MTYJJ4QK67B5OH.json","graph_json":"https://pith.science/api/pith-number/6OLFJCX2MSU3MTYJJ4QK67B5OH/graph.json","events_json":"https://pith.science/api/pith-number/6OLFJCX2MSU3MTYJJ4QK67B5OH/events.json","paper":"https://pith.science/paper/6OLFJCX2"},"agent_actions":{"view_html":"https://pith.science/pith/6OLFJCX2MSU3MTYJJ4QK67B5OH","download_json":"https://pith.science/pith/6OLFJCX2MSU3MTYJJ4QK67B5OH.json","view_paper":"https://pith.science/paper/6OLFJCX2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.08460&json=true","fetch_graph":"https://pith.science/api/pith-number/6OLFJCX2MSU3MTYJJ4QK67B5OH/graph.json","fetch_events":"https://pith.science/api/pith-number/6OLFJCX2MSU3MTYJJ4QK67B5OH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6OLFJCX2MSU3MTYJJ4QK67B5OH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6OLFJCX2MSU3MTYJJ4QK67B5OH/action/storage_attestation","attest_author":"https://pith.science/pith/6OLFJCX2MSU3MTYJJ4QK67B5OH/action/author_attestation","sign_citation":"https://pith.science/pith/6OLFJCX2MSU3MTYJJ4QK67B5OH/action/citation_signature","submit_replication":"https://pith.science/pith/6OLFJCX2MSU3MTYJJ4QK67B5OH/action/replication_record"}},"created_at":"2026-05-18T00:15:26.394493+00:00","updated_at":"2026-05-18T00:15:26.394493+00:00"}