{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:C5OPDBI4SMZSNC2XPPSR2VBOC6","short_pith_number":"pith:C5OPDBI4","schema_version":"1.0","canonical_sha256":"175cf1851c9333268b577be51d542e17b442695325ad1962557a903b96cec091","source":{"kind":"arxiv","id":"1602.00382","version":3},"attestation_state":"computed","paper":{"title":"Distributed Constrained Recursive Nonlinear Least-Squares Estimation: Algorithms and Asymptotics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.PR","math.ST","stat.TH"],"primary_cat":"math.OC","authors_text":"Anit Kumar Sahu, H. Vincent Poor, Jose' M. F. Moura, Soummya Kar","submitted_at":"2016-02-01T03:47:09Z","abstract_excerpt":"This paper focuses on the problem of recursive nonlinear least squares parameter estimation in multi-agent networks, in which the individual agents observe sequentially over time an independent and identically distributed (i.i.d.) time-series consisting of a nonlinear function of the true but unknown parameter corrupted by noise. A distributed recursive estimator of the \\emph{consensus} + \\emph{innovations} type, namely $\\mathcal{CIWNLS}$, is proposed, in which the agents update their parameter estimates at each observation sampling epoch in a collaborative way by simultaneously processing the"},"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":"1602.00382","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-01T03:47:09Z","cross_cats_sorted":["cs.IT","math.IT","math.PR","math.ST","stat.TH"],"title_canon_sha256":"3f3789c53f2df34a49c43d1f97c951407e4850b5c2b0a920bc5c6c9086b0863d","abstract_canon_sha256":"a0730cb80d621fa9918a16b8e55927f760f9ce7a31882a1c0e9f4012fbce6756"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:51.984116Z","signature_b64":"3e8KOTh2IUntIoYK5dMnqu3Hmlb8cmUXuscIHvQR3ORJxye+pX3N3LusdLv/nK0hAyRc2M4qWNvoQSgOYJM6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"175cf1851c9333268b577be51d542e17b442695325ad1962557a903b96cec091","last_reissued_at":"2026-05-18T01:01:51.983306Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:51.983306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Constrained Recursive Nonlinear Least-Squares Estimation: Algorithms and Asymptotics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.PR","math.ST","stat.TH"],"primary_cat":"math.OC","authors_text":"Anit Kumar Sahu, H. Vincent Poor, Jose' M. F. Moura, Soummya Kar","submitted_at":"2016-02-01T03:47:09Z","abstract_excerpt":"This paper focuses on the problem of recursive nonlinear least squares parameter estimation in multi-agent networks, in which the individual agents observe sequentially over time an independent and identically distributed (i.i.d.) time-series consisting of a nonlinear function of the true but unknown parameter corrupted by noise. A distributed recursive estimator of the \\emph{consensus} + \\emph{innovations} type, namely $\\mathcal{CIWNLS}$, is proposed, in which the agents update their parameter estimates at each observation sampling epoch in a collaborative way by simultaneously processing the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00382","kind":"arxiv","version":3},"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":"1602.00382","created_at":"2026-05-18T01:01:51.983464+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.00382v3","created_at":"2026-05-18T01:01:51.983464+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00382","created_at":"2026-05-18T01:01:51.983464+00:00"},{"alias_kind":"pith_short_12","alias_value":"C5OPDBI4SMZS","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"C5OPDBI4SMZSNC2X","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"C5OPDBI4","created_at":"2026-05-18T12:30:09.641336+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/C5OPDBI4SMZSNC2XPPSR2VBOC6","json":"https://pith.science/pith/C5OPDBI4SMZSNC2XPPSR2VBOC6.json","graph_json":"https://pith.science/api/pith-number/C5OPDBI4SMZSNC2XPPSR2VBOC6/graph.json","events_json":"https://pith.science/api/pith-number/C5OPDBI4SMZSNC2XPPSR2VBOC6/events.json","paper":"https://pith.science/paper/C5OPDBI4"},"agent_actions":{"view_html":"https://pith.science/pith/C5OPDBI4SMZSNC2XPPSR2VBOC6","download_json":"https://pith.science/pith/C5OPDBI4SMZSNC2XPPSR2VBOC6.json","view_paper":"https://pith.science/paper/C5OPDBI4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.00382&json=true","fetch_graph":"https://pith.science/api/pith-number/C5OPDBI4SMZSNC2XPPSR2VBOC6/graph.json","fetch_events":"https://pith.science/api/pith-number/C5OPDBI4SMZSNC2XPPSR2VBOC6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C5OPDBI4SMZSNC2XPPSR2VBOC6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C5OPDBI4SMZSNC2XPPSR2VBOC6/action/storage_attestation","attest_author":"https://pith.science/pith/C5OPDBI4SMZSNC2XPPSR2VBOC6/action/author_attestation","sign_citation":"https://pith.science/pith/C5OPDBI4SMZSNC2XPPSR2VBOC6/action/citation_signature","submit_replication":"https://pith.science/pith/C5OPDBI4SMZSNC2XPPSR2VBOC6/action/replication_record"}},"created_at":"2026-05-18T01:01:51.983464+00:00","updated_at":"2026-05-18T01:01:51.983464+00:00"}