{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LN2LABNV4JPPSU4EL47GJFCH36","short_pith_number":"pith:LN2LABNV","schema_version":"1.0","canonical_sha256":"5b74b005b5e25ef953845f3e649447df9c545e4ba1b31311e3ca61883b6dc90f","source":{"kind":"arxiv","id":"1903.07792","version":1},"attestation_state":"computed","paper":{"title":"Differentially Private Consensus-Based Distributed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.SI","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Can Karakus, Mehrdad Showkatbakhsh, Suhas Diggavi","submitted_at":"2019-03-19T02:06:10Z","abstract_excerpt":"Data privacy is an important concern in learning, when datasets contain sensitive information about individuals. This paper considers consensus-based distributed optimization under data privacy constraints. Consensus-based optimization consists of a set of computational nodes arranged in a graph, each having a local objective that depends on their local data, where in every step nodes take a linear combination of their neighbors' messages, as well as taking a new gradient step. Since the algorithm requires exchanging messages that depend on local data, private information gets leaked at every "},"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":"1903.07792","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-19T02:06:10Z","cross_cats_sorted":["cs.CR","cs.SI","math.OC","stat.ML"],"title_canon_sha256":"e77c34866f34b85361d5bbe895cc39740d7adab2f7d2dcbd385baa46a788bfea","abstract_canon_sha256":"5d8c03cd5d1a01566b9fcaacfce9fd0c80be793b03c2e40127b01590f010fa1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:53.930985Z","signature_b64":"6jLqDd7liOgjHP9rJzOCE6yxiGKXNO5d1GOm4YcwaH4OMcU1p13D39GtaKmL0wlS/y7K0ioFqjHsWC9B1NoSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b74b005b5e25ef953845f3e649447df9c545e4ba1b31311e3ca61883b6dc90f","last_reissued_at":"2026-05-17T23:50:53.930099Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:53.930099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Differentially Private Consensus-Based Distributed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.SI","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Can Karakus, Mehrdad Showkatbakhsh, Suhas Diggavi","submitted_at":"2019-03-19T02:06:10Z","abstract_excerpt":"Data privacy is an important concern in learning, when datasets contain sensitive information about individuals. This paper considers consensus-based distributed optimization under data privacy constraints. Consensus-based optimization consists of a set of computational nodes arranged in a graph, each having a local objective that depends on their local data, where in every step nodes take a linear combination of their neighbors' messages, as well as taking a new gradient step. Since the algorithm requires exchanging messages that depend on local data, private information gets leaked at every "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07792","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":"1903.07792","created_at":"2026-05-17T23:50:53.930254+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.07792v1","created_at":"2026-05-17T23:50:53.930254+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07792","created_at":"2026-05-17T23:50:53.930254+00:00"},{"alias_kind":"pith_short_12","alias_value":"LN2LABNV4JPP","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LN2LABNV4JPPSU4E","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LN2LABNV","created_at":"2026-05-18T12:33:21.387695+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/LN2LABNV4JPPSU4EL47GJFCH36","json":"https://pith.science/pith/LN2LABNV4JPPSU4EL47GJFCH36.json","graph_json":"https://pith.science/api/pith-number/LN2LABNV4JPPSU4EL47GJFCH36/graph.json","events_json":"https://pith.science/api/pith-number/LN2LABNV4JPPSU4EL47GJFCH36/events.json","paper":"https://pith.science/paper/LN2LABNV"},"agent_actions":{"view_html":"https://pith.science/pith/LN2LABNV4JPPSU4EL47GJFCH36","download_json":"https://pith.science/pith/LN2LABNV4JPPSU4EL47GJFCH36.json","view_paper":"https://pith.science/paper/LN2LABNV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.07792&json=true","fetch_graph":"https://pith.science/api/pith-number/LN2LABNV4JPPSU4EL47GJFCH36/graph.json","fetch_events":"https://pith.science/api/pith-number/LN2LABNV4JPPSU4EL47GJFCH36/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LN2LABNV4JPPSU4EL47GJFCH36/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LN2LABNV4JPPSU4EL47GJFCH36/action/storage_attestation","attest_author":"https://pith.science/pith/LN2LABNV4JPPSU4EL47GJFCH36/action/author_attestation","sign_citation":"https://pith.science/pith/LN2LABNV4JPPSU4EL47GJFCH36/action/citation_signature","submit_replication":"https://pith.science/pith/LN2LABNV4JPPSU4EL47GJFCH36/action/replication_record"}},"created_at":"2026-05-17T23:50:53.930254+00:00","updated_at":"2026-05-17T23:50:53.930254+00:00"}