{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:M6KFZ565XI664EXNXIWCHK3VQC","short_pith_number":"pith:M6KFZ565","schema_version":"1.0","canonical_sha256":"67945cf7ddba3dee12edba2c23ab7580ac8516bb57ccc753386f2f290e32cd1b","source":{"kind":"arxiv","id":"1803.03224","version":1},"attestation_state":"computed","paper":{"title":"Distributed Maximum Likelihood using Dynamic Average Consensus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jemin George","submitted_at":"2018-03-08T17:45:14Z","abstract_excerpt":"This paper presents the formulation and analysis of a novel distributed maximum likelihood algorithm that utilizes a first-order optimization scheme. The proposed approach utilizes a static average consensus algorithm to reach agreement on the initial condition to the iterative optimization scheme and a dynamic average consensus algorithm to reach agreement on the gradient direction. The current distributed algorithm is guaranteed to exponentially recover the performance of the centralized algorithm. Though the current formulation focuses on maximum likelihood algorithm built on first-order me"},"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":"1803.03224","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-08T17:45:14Z","cross_cats_sorted":[],"title_canon_sha256":"95ce590bbdf2b0556437e1f636a66d8a3e2b2ffa7f70714a1a9919c5a7cc3fb4","abstract_canon_sha256":"8124d39bc3005246302387cbeb5db1cd2d3680110d07523b25a822cfc85623db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:44.080498Z","signature_b64":"onundQBSZa7GfcXsLNRtiK3Gjpq7Loib8DbmCUuqek8qQbVmXeQ620jqeUHwXV/zC0sler08TT/+is5s4/+pAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67945cf7ddba3dee12edba2c23ab7580ac8516bb57ccc753386f2f290e32cd1b","last_reissued_at":"2026-05-18T00:21:44.079745Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:44.079745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Maximum Likelihood using Dynamic Average Consensus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jemin George","submitted_at":"2018-03-08T17:45:14Z","abstract_excerpt":"This paper presents the formulation and analysis of a novel distributed maximum likelihood algorithm that utilizes a first-order optimization scheme. The proposed approach utilizes a static average consensus algorithm to reach agreement on the initial condition to the iterative optimization scheme and a dynamic average consensus algorithm to reach agreement on the gradient direction. The current distributed algorithm is guaranteed to exponentially recover the performance of the centralized algorithm. Though the current formulation focuses on maximum likelihood algorithm built on first-order me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03224","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":"1803.03224","created_at":"2026-05-18T00:21:44.079875+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.03224v1","created_at":"2026-05-18T00:21:44.079875+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03224","created_at":"2026-05-18T00:21:44.079875+00:00"},{"alias_kind":"pith_short_12","alias_value":"M6KFZ565XI66","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"M6KFZ565XI664EXN","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"M6KFZ565","created_at":"2026-05-18T12:32:37.024351+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/M6KFZ565XI664EXNXIWCHK3VQC","json":"https://pith.science/pith/M6KFZ565XI664EXNXIWCHK3VQC.json","graph_json":"https://pith.science/api/pith-number/M6KFZ565XI664EXNXIWCHK3VQC/graph.json","events_json":"https://pith.science/api/pith-number/M6KFZ565XI664EXNXIWCHK3VQC/events.json","paper":"https://pith.science/paper/M6KFZ565"},"agent_actions":{"view_html":"https://pith.science/pith/M6KFZ565XI664EXNXIWCHK3VQC","download_json":"https://pith.science/pith/M6KFZ565XI664EXNXIWCHK3VQC.json","view_paper":"https://pith.science/paper/M6KFZ565","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.03224&json=true","fetch_graph":"https://pith.science/api/pith-number/M6KFZ565XI664EXNXIWCHK3VQC/graph.json","fetch_events":"https://pith.science/api/pith-number/M6KFZ565XI664EXNXIWCHK3VQC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M6KFZ565XI664EXNXIWCHK3VQC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M6KFZ565XI664EXNXIWCHK3VQC/action/storage_attestation","attest_author":"https://pith.science/pith/M6KFZ565XI664EXNXIWCHK3VQC/action/author_attestation","sign_citation":"https://pith.science/pith/M6KFZ565XI664EXNXIWCHK3VQC/action/citation_signature","submit_replication":"https://pith.science/pith/M6KFZ565XI664EXNXIWCHK3VQC/action/replication_record"}},"created_at":"2026-05-18T00:21:44.079875+00:00","updated_at":"2026-05-18T00:21:44.079875+00:00"}