{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:UN5ENK3V7BDZUPZUK6FAL62CKK","short_pith_number":"pith:UN5ENK3V","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"},"canonical_sha256":"a37a46ab75f8479a3f34578a05fb425294d923cf8051ec29c511f52b30231671","source":{"kind":"arxiv","id":"1206.3793","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3793","created_at":"2026-05-18T03:53:18Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3793v1","created_at":"2026-05-18T03:53:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3793","created_at":"2026-05-18T03:53:18Z"},{"alias_kind":"pith_short_12","alias_value":"UN5ENK3V7BDZ","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UN5ENK3V7BDZUPZU","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UN5ENK3V","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:UN5ENK3V7BDZUPZUK6FAL62CKK","target":"record","payload":{"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"},"canonical_sha256":"a37a46ab75f8479a3f34578a05fb425294d923cf8051ec29c511f52b30231671","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"},"source_kind":"arxiv","source_id":"1206.3793","source_version":1,"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-18T03:53:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D7VWHHtevYiZej1sFr9Iei7IkB94zaH+yiWz4JoMPvslnV6zqamXiJPXR1PfkdVu1UxGf/k5ef5LRkRIQN8HDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:08:26.370025Z"},"content_sha256":"35b8171c6a35f7bc30cac870ea92e878aa9f8dbda167d84f05e70b25be67ebc9","schema_version":"1.0","event_id":"sha256:35b8171c6a35f7bc30cac870ea92e878aa9f8dbda167d84f05e70b25be67ebc9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:UN5ENK3V7BDZUPZUK6FAL62CKK","target":"graph","payload":{"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"},"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-18T03:53:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ix6vrnmz9QjKY2WRLF0EMIzzR8HhEpCu+vKFI3m9rpLguchXdGZEfhP06oglRjaneSyMFAxuR1NB05ITvoTBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:08:26.370386Z"},"content_sha256":"f320254d0446fd92d2a2f24e29ca4727a1131f7af72059d0df67d1369cf9715a","schema_version":"1.0","event_id":"sha256:f320254d0446fd92d2a2f24e29ca4727a1131f7af72059d0df67d1369cf9715a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UN5ENK3V7BDZUPZUK6FAL62CKK/bundle.json","state_url":"https://pith.science/pith/UN5ENK3V7BDZUPZUK6FAL62CKK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UN5ENK3V7BDZUPZUK6FAL62CKK/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-06-03T00:08:26Z","links":{"resolver":"https://pith.science/pith/UN5ENK3V7BDZUPZUK6FAL62CKK","bundle":"https://pith.science/pith/UN5ENK3V7BDZUPZUK6FAL62CKK/bundle.json","state":"https://pith.science/pith/UN5ENK3V7BDZUPZUK6FAL62CKK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UN5ENK3V7BDZUPZUK6FAL62CKK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:UN5ENK3V7BDZUPZUK6FAL62CKK","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":"7c1fb11d23d48691a1a6a8d29116addcef1318bd578f34ffaecf24248bd51b7f","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.MA","submitted_at":"2012-06-17T21:19:45Z","title_canon_sha256":"db6e0def5bbc862cf156b8d932ad404dab426190789255e7aba8ad1f2b1f0977"},"schema_version":"1.0","source":{"id":"1206.3793","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3793","created_at":"2026-05-18T03:53:18Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3793v1","created_at":"2026-05-18T03:53:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3793","created_at":"2026-05-18T03:53:18Z"},{"alias_kind":"pith_short_12","alias_value":"UN5ENK3V7BDZ","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UN5ENK3V7BDZUPZU","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UN5ENK3V","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:f320254d0446fd92d2a2f24e29ca4727a1131f7af72059d0df67d1369cf9715a","target":"graph","created_at":"2026-05-18T03:53:18Z","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":"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","authors_text":"Chiara Ravazzi, Fabio Fagnani, Sophie M. Fosson","cross_cats":["cs.SY","math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.MA","submitted_at":"2012-06-17T21:19:45Z","title":"A distributed classification/estimation algorithm for sensor networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3793","kind":"arxiv","version":1},"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:35b8171c6a35f7bc30cac870ea92e878aa9f8dbda167d84f05e70b25be67ebc9","target":"record","created_at":"2026-05-18T03:53:18Z","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":"7c1fb11d23d48691a1a6a8d29116addcef1318bd578f34ffaecf24248bd51b7f","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.MA","submitted_at":"2012-06-17T21:19:45Z","title_canon_sha256":"db6e0def5bbc862cf156b8d932ad404dab426190789255e7aba8ad1f2b1f0977"},"schema_version":"1.0","source":{"id":"1206.3793","kind":"arxiv","version":1}},"canonical_sha256":"a37a46ab75f8479a3f34578a05fb425294d923cf8051ec29c511f52b30231671","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a37a46ab75f8479a3f34578a05fb425294d923cf8051ec29c511f52b30231671","first_computed_at":"2026-05-18T03:53:18.726898Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:18.726898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cpbmoFDhiqVuykMk/abvBHtvNUs1jdoAti9JXT8NKAsVeDIbmbfkSdQLP9ANGfvSpVLMhrBMWim3+8JdZTllCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:18.727566Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.3793","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35b8171c6a35f7bc30cac870ea92e878aa9f8dbda167d84f05e70b25be67ebc9","sha256:f320254d0446fd92d2a2f24e29ca4727a1131f7af72059d0df67d1369cf9715a"],"state_sha256":"57847e858b18bcff5bda066b3b901ddb8c48a9170dc2a6bb49b18eacc7b5996b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nh+mXYL2nbzegdXyhDPfDUR/6rdqf6XL7eijHcqAmulrrB6ovrLqI5/YQotRp4UrQXSd5GqHJsQzzh/9zAqBAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T00:08:26.372366Z","bundle_sha256":"4f9dfef58c1fbb988b1bfa6d2c3eb7645f01318c2f37fae8d845e0d406753618"}}