{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IIQE6HNOOKK7PSJBHRQJMO6TSI","short_pith_number":"pith:IIQE6HNO","schema_version":"1.0","canonical_sha256":"42204f1dae7295f7c9213c60963bd392207888f274ea16e8db0061fdb30d9b03","source":{"kind":"arxiv","id":"1408.1073","version":1},"attestation_state":"computed","paper":{"title":"In-Network Linear Regression with Arbitrarily Split Data Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Fran\\c{c}ois D. C\\^ot\\'e, Ioannis N. Psaromiligkos, Warren J. Gross","submitted_at":"2014-08-05T19:25:46Z","abstract_excerpt":"In this paper, we address the problem of how a network of agents can collaboratively fit a linear model when each agent only ever has an arbitrary summand of the regression data. This problem generalizes previously studied data-matrix-splitting scenarios, allowing for some agents to have more measurements of some features than of others and even have measurements that other agents have. We present a variable-centric framework for distributed optimization in a network, and use this framework to develop a proximal algorithm, based on the Douglas-Rachford method, that solves the problem."},"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":"1408.1073","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-05T19:25:46Z","cross_cats_sorted":[],"title_canon_sha256":"c4d00115f826be077bc579e313e144cea8ef1ae996ab22f3d82f889fec049539","abstract_canon_sha256":"942bc86a1e5a9bda393b36f53edac66067221b6526fd5e928742ab32f0d8c03d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:49.064865Z","signature_b64":"jfsSzy/+DjZVC9zyuStiPaLzj8LEl4wPdDy8anrgO62eazGN0JKX3L4l5QjbQZeykZu0JICRYG/C69sb21P4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42204f1dae7295f7c9213c60963bd392207888f274ea16e8db0061fdb30d9b03","last_reissued_at":"2026-05-18T02:45:49.064470Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:49.064470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"In-Network Linear Regression with Arbitrarily Split Data Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Fran\\c{c}ois D. C\\^ot\\'e, Ioannis N. Psaromiligkos, Warren J. Gross","submitted_at":"2014-08-05T19:25:46Z","abstract_excerpt":"In this paper, we address the problem of how a network of agents can collaboratively fit a linear model when each agent only ever has an arbitrary summand of the regression data. This problem generalizes previously studied data-matrix-splitting scenarios, allowing for some agents to have more measurements of some features than of others and even have measurements that other agents have. We present a variable-centric framework for distributed optimization in a network, and use this framework to develop a proximal algorithm, based on the Douglas-Rachford method, that solves the problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1073","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":"1408.1073","created_at":"2026-05-18T02:45:49.064536+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.1073v1","created_at":"2026-05-18T02:45:49.064536+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1073","created_at":"2026-05-18T02:45:49.064536+00:00"},{"alias_kind":"pith_short_12","alias_value":"IIQE6HNOOKK7","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IIQE6HNOOKK7PSJB","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IIQE6HNO","created_at":"2026-05-18T12:28:33.132498+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/IIQE6HNOOKK7PSJBHRQJMO6TSI","json":"https://pith.science/pith/IIQE6HNOOKK7PSJBHRQJMO6TSI.json","graph_json":"https://pith.science/api/pith-number/IIQE6HNOOKK7PSJBHRQJMO6TSI/graph.json","events_json":"https://pith.science/api/pith-number/IIQE6HNOOKK7PSJBHRQJMO6TSI/events.json","paper":"https://pith.science/paper/IIQE6HNO"},"agent_actions":{"view_html":"https://pith.science/pith/IIQE6HNOOKK7PSJBHRQJMO6TSI","download_json":"https://pith.science/pith/IIQE6HNOOKK7PSJBHRQJMO6TSI.json","view_paper":"https://pith.science/paper/IIQE6HNO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.1073&json=true","fetch_graph":"https://pith.science/api/pith-number/IIQE6HNOOKK7PSJBHRQJMO6TSI/graph.json","fetch_events":"https://pith.science/api/pith-number/IIQE6HNOOKK7PSJBHRQJMO6TSI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IIQE6HNOOKK7PSJBHRQJMO6TSI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IIQE6HNOOKK7PSJBHRQJMO6TSI/action/storage_attestation","attest_author":"https://pith.science/pith/IIQE6HNOOKK7PSJBHRQJMO6TSI/action/author_attestation","sign_citation":"https://pith.science/pith/IIQE6HNOOKK7PSJBHRQJMO6TSI/action/citation_signature","submit_replication":"https://pith.science/pith/IIQE6HNOOKK7PSJBHRQJMO6TSI/action/replication_record"}},"created_at":"2026-05-18T02:45:49.064536+00:00","updated_at":"2026-05-18T02:45:49.064536+00:00"}