{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:C5OPDBI4SMZSNC2XPPSR2VBOC6","short_pith_number":"pith:C5OPDBI4","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"},"canonical_sha256":"175cf1851c9333268b577be51d542e17b442695325ad1962557a903b96cec091","source":{"kind":"arxiv","id":"1602.00382","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00382","created_at":"2026-05-18T01:01:51Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00382v3","created_at":"2026-05-18T01:01:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00382","created_at":"2026-05-18T01:01:51Z"},{"alias_kind":"pith_short_12","alias_value":"C5OPDBI4SMZS","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C5OPDBI4SMZSNC2X","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C5OPDBI4","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:C5OPDBI4SMZSNC2XPPSR2VBOC6","target":"record","payload":{"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"},"canonical_sha256":"175cf1851c9333268b577be51d542e17b442695325ad1962557a903b96cec091","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"},"source_kind":"arxiv","source_id":"1602.00382","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:01:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"116cvtGh1DldNDhope92ePQSbyzrYtujieinaquDkO/iXT/Tl3AgApoNn+uTM2t/hXuztlNzZ4pPDhWBTo8WDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:37:56.117664Z"},"content_sha256":"b2e14940547ac5b71b21afde9b3c3dc5c054f129c18e8907e14ee3146a14a3e9","schema_version":"1.0","event_id":"sha256:b2e14940547ac5b71b21afde9b3c3dc5c054f129c18e8907e14ee3146a14a3e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:C5OPDBI4SMZSNC2XPPSR2VBOC6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:01:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bk2sIRciKcK5AvoI51i/McrwzCHIdIrZqVk/Pw+jnF0MTKZWKvN8i+hVg1akVdxx1/ftDc9WbQNMHZlxM/DICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:37:56.118336Z"},"content_sha256":"e90b7dd593ac2fa906bcd1ed1a242c96f1f025d182b6b68153f534896d68a476","schema_version":"1.0","event_id":"sha256:e90b7dd593ac2fa906bcd1ed1a242c96f1f025d182b6b68153f534896d68a476"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C5OPDBI4SMZSNC2XPPSR2VBOC6/bundle.json","state_url":"https://pith.science/pith/C5OPDBI4SMZSNC2XPPSR2VBOC6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C5OPDBI4SMZSNC2XPPSR2VBOC6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T17:37:56Z","links":{"resolver":"https://pith.science/pith/C5OPDBI4SMZSNC2XPPSR2VBOC6","bundle":"https://pith.science/pith/C5OPDBI4SMZSNC2XPPSR2VBOC6/bundle.json","state":"https://pith.science/pith/C5OPDBI4SMZSNC2XPPSR2VBOC6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C5OPDBI4SMZSNC2XPPSR2VBOC6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:C5OPDBI4SMZSNC2XPPSR2VBOC6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a0730cb80d621fa9918a16b8e55927f760f9ce7a31882a1c0e9f4012fbce6756","cross_cats_sorted":["cs.IT","math.IT","math.PR","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-01T03:47:09Z","title_canon_sha256":"3f3789c53f2df34a49c43d1f97c951407e4850b5c2b0a920bc5c6c9086b0863d"},"schema_version":"1.0","source":{"id":"1602.00382","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00382","created_at":"2026-05-18T01:01:51Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00382v3","created_at":"2026-05-18T01:01:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00382","created_at":"2026-05-18T01:01:51Z"},{"alias_kind":"pith_short_12","alias_value":"C5OPDBI4SMZS","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C5OPDBI4SMZSNC2X","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C5OPDBI4","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:e90b7dd593ac2fa906bcd1ed1a242c96f1f025d182b6b68153f534896d68a476","target":"graph","created_at":"2026-05-18T01:01:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Anit Kumar Sahu, H. Vincent Poor, Jose' M. F. Moura, Soummya Kar","cross_cats":["cs.IT","math.IT","math.PR","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-01T03:47:09Z","title":"Distributed Constrained Recursive Nonlinear Least-Squares Estimation: Algorithms and Asymptotics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00382","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b2e14940547ac5b71b21afde9b3c3dc5c054f129c18e8907e14ee3146a14a3e9","target":"record","created_at":"2026-05-18T01:01:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a0730cb80d621fa9918a16b8e55927f760f9ce7a31882a1c0e9f4012fbce6756","cross_cats_sorted":["cs.IT","math.IT","math.PR","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-01T03:47:09Z","title_canon_sha256":"3f3789c53f2df34a49c43d1f97c951407e4850b5c2b0a920bc5c6c9086b0863d"},"schema_version":"1.0","source":{"id":"1602.00382","kind":"arxiv","version":3}},"canonical_sha256":"175cf1851c9333268b577be51d542e17b442695325ad1962557a903b96cec091","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"175cf1851c9333268b577be51d542e17b442695325ad1962557a903b96cec091","first_computed_at":"2026-05-18T01:01:51.983306Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:51.983306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3e8KOTh2IUntIoYK5dMnqu3Hmlb8cmUXuscIHvQR3ORJxye+pX3N3LusdLv/nK0hAyRc2M4qWNvoQSgOYJM6Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:51.984116Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.00382","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2e14940547ac5b71b21afde9b3c3dc5c054f129c18e8907e14ee3146a14a3e9","sha256:e90b7dd593ac2fa906bcd1ed1a242c96f1f025d182b6b68153f534896d68a476"],"state_sha256":"30c6c7f0f448772f50266334bcaf49066da247676711f10b01d85d9893eb9ccc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xBzBX3YjUNCp1tecfQuXK+FUOA7lkqIG/+bbCHqbH6ECN6SIDFryNnqo+w3WY/xFQuyb+VNX11tjMfn+m4hfDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:37:56.122146Z","bundle_sha256":"074ee3159c41bfe40a07c76452612048c69305d199ac2c434d4705b673ceb2ac"}}