{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UN5ENK3V7BDZUPZUK6FAL62CKK","short_pith_number":"pith:UN5ENK3V","schema_version":"1.0","canonical_sha256":"a37a46ab75f8479a3f34578a05fb425294d923cf8051ec29c511f52b30231671","source":{"kind":"arxiv","id":"1206.3793","version":1},"attestation_state":"computed","paper":{"title":"A distributed classification/estimation algorithm for sensor networks","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"cs.MA","authors_text":"Chiara Ravazzi, Fabio Fagnani, Sophie M. Fosson","submitted_at":"2012-06-17T21:19:45Z","abstract_excerpt":"In this paper, we address the problem of simultaneous classification and estimation of hidden parameters in a sensor network with communications constraints. In particular, we consider a network of noisy sensors which measure a common scalar unknown parameter. We assume that a fraction of the nodes represent faulty sensors, whose measurements are poorly reliable. The goal for each node is to simultaneously identify its class (faulty or non-faulty) and estimate the common parameter.\n  We propose a novel cooperative iterative algorithm which copes with the communication constraints imposed by th"},"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":"1206.3793","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.MA","submitted_at":"2012-06-17T21:19:45Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"db6e0def5bbc862cf156b8d932ad404dab426190789255e7aba8ad1f2b1f0977","abstract_canon_sha256":"7c1fb11d23d48691a1a6a8d29116addcef1318bd578f34ffaecf24248bd51b7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:18.727566Z","signature_b64":"cpbmoFDhiqVuykMk/abvBHtvNUs1jdoAti9JXT8NKAsVeDIbmbfkSdQLP9ANGfvSpVLMhrBMWim3+8JdZTllCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a37a46ab75f8479a3f34578a05fb425294d923cf8051ec29c511f52b30231671","last_reissued_at":"2026-05-18T03:53:18.726898Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:18.726898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A distributed classification/estimation algorithm for sensor networks","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"cs.MA","authors_text":"Chiara Ravazzi, Fabio Fagnani, Sophie M. Fosson","submitted_at":"2012-06-17T21:19:45Z","abstract_excerpt":"In this paper, we address the problem of simultaneous classification and estimation of hidden parameters in a sensor network with communications constraints. In particular, we consider a network of noisy sensors which measure a common scalar unknown parameter. We assume that a fraction of the nodes represent faulty sensors, whose measurements are poorly reliable. The goal for each node is to simultaneously identify its class (faulty or non-faulty) and estimate the common parameter.\n  We propose a novel cooperative iterative algorithm which copes with the communication constraints imposed by th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3793","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":"1206.3793","created_at":"2026-05-18T03:53:18.726995+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.3793v1","created_at":"2026-05-18T03:53:18.726995+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3793","created_at":"2026-05-18T03:53:18.726995+00:00"},{"alias_kind":"pith_short_12","alias_value":"UN5ENK3V7BDZ","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"UN5ENK3V7BDZUPZU","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"UN5ENK3V","created_at":"2026-05-18T12:27:23.164592+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/UN5ENK3V7BDZUPZUK6FAL62CKK","json":"https://pith.science/pith/UN5ENK3V7BDZUPZUK6FAL62CKK.json","graph_json":"https://pith.science/api/pith-number/UN5ENK3V7BDZUPZUK6FAL62CKK/graph.json","events_json":"https://pith.science/api/pith-number/UN5ENK3V7BDZUPZUK6FAL62CKK/events.json","paper":"https://pith.science/paper/UN5ENK3V"},"agent_actions":{"view_html":"https://pith.science/pith/UN5ENK3V7BDZUPZUK6FAL62CKK","download_json":"https://pith.science/pith/UN5ENK3V7BDZUPZUK6FAL62CKK.json","view_paper":"https://pith.science/paper/UN5ENK3V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.3793&json=true","fetch_graph":"https://pith.science/api/pith-number/UN5ENK3V7BDZUPZUK6FAL62CKK/graph.json","fetch_events":"https://pith.science/api/pith-number/UN5ENK3V7BDZUPZUK6FAL62CKK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UN5ENK3V7BDZUPZUK6FAL62CKK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UN5ENK3V7BDZUPZUK6FAL62CKK/action/storage_attestation","attest_author":"https://pith.science/pith/UN5ENK3V7BDZUPZUK6FAL62CKK/action/author_attestation","sign_citation":"https://pith.science/pith/UN5ENK3V7BDZUPZUK6FAL62CKK/action/citation_signature","submit_replication":"https://pith.science/pith/UN5ENK3V7BDZUPZUK6FAL62CKK/action/replication_record"}},"created_at":"2026-05-18T03:53:18.726995+00:00","updated_at":"2026-05-18T03:53:18.726995+00:00"}