{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QJ7MFIODY7CLCA7AJUHNOZY2Y7","short_pith_number":"pith:QJ7MFIOD","schema_version":"1.0","canonical_sha256":"827ec2a1c3c7c4b103e04d0ed7671ac7d6eb4d29dcd84a90539643ca8be6edc3","source":{"kind":"arxiv","id":"1303.2830","version":1},"attestation_state":"computed","paper":{"title":"Almost sure convergence of a randomized algorithm for relative localization in sensor networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Chiara Ravazzi, Hideaki Ishii, Paolo Frasca, Roberto Tempo","submitted_at":"2013-03-12T10:36:53Z","abstract_excerpt":"This paper regards the relative localization problem in sensor networks. We study a randomized algorithm, which is based on input-driven consensus dynamics and involves pairwise \"gossip\" communications and updates. Due to the randomness of the updates, the state of this algorithm ergodically oscillates around a limit value. Exploiting the ergodicity of the dynamics, we show that the time-average of the state almost surely converges to the least-squares solution of the localization problem. Remarkably, the computation of the time-average does not require the sensors to share any common clock. H"},"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":"1303.2830","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-03-12T10:36:53Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b49708c4997c555bf42c3bdf3ed94d2f0926d1407afca544e6a3b3268b1d76aa","abstract_canon_sha256":"2d364afd5b48d3eeee54e17856259c6426bf3f40f14ec710a5a9563f88193c83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:07.893345Z","signature_b64":"ja1pTqxoNDn/6Q2tlZXkOQlgDXfeG+S1z/1N8Xc9VH8kJuioxYBkau15NxmLqkqeAz5mPECehjKwqcO5oBfyDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"827ec2a1c3c7c4b103e04d0ed7671ac7d6eb4d29dcd84a90539643ca8be6edc3","last_reissued_at":"2026-05-18T03:31:07.892634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:07.892634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost sure convergence of a randomized algorithm for relative localization in sensor networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Chiara Ravazzi, Hideaki Ishii, Paolo Frasca, Roberto Tempo","submitted_at":"2013-03-12T10:36:53Z","abstract_excerpt":"This paper regards the relative localization problem in sensor networks. We study a randomized algorithm, which is based on input-driven consensus dynamics and involves pairwise \"gossip\" communications and updates. Due to the randomness of the updates, the state of this algorithm ergodically oscillates around a limit value. Exploiting the ergodicity of the dynamics, we show that the time-average of the state almost surely converges to the least-squares solution of the localization problem. Remarkably, the computation of the time-average does not require the sensors to share any common clock. H"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2830","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":"1303.2830","created_at":"2026-05-18T03:31:07.892739+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.2830v1","created_at":"2026-05-18T03:31:07.892739+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2830","created_at":"2026-05-18T03:31:07.892739+00:00"},{"alias_kind":"pith_short_12","alias_value":"QJ7MFIODY7CL","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QJ7MFIODY7CLCA7A","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QJ7MFIOD","created_at":"2026-05-18T12:27:57.521954+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/QJ7MFIODY7CLCA7AJUHNOZY2Y7","json":"https://pith.science/pith/QJ7MFIODY7CLCA7AJUHNOZY2Y7.json","graph_json":"https://pith.science/api/pith-number/QJ7MFIODY7CLCA7AJUHNOZY2Y7/graph.json","events_json":"https://pith.science/api/pith-number/QJ7MFIODY7CLCA7AJUHNOZY2Y7/events.json","paper":"https://pith.science/paper/QJ7MFIOD"},"agent_actions":{"view_html":"https://pith.science/pith/QJ7MFIODY7CLCA7AJUHNOZY2Y7","download_json":"https://pith.science/pith/QJ7MFIODY7CLCA7AJUHNOZY2Y7.json","view_paper":"https://pith.science/paper/QJ7MFIOD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.2830&json=true","fetch_graph":"https://pith.science/api/pith-number/QJ7MFIODY7CLCA7AJUHNOZY2Y7/graph.json","fetch_events":"https://pith.science/api/pith-number/QJ7MFIODY7CLCA7AJUHNOZY2Y7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QJ7MFIODY7CLCA7AJUHNOZY2Y7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QJ7MFIODY7CLCA7AJUHNOZY2Y7/action/storage_attestation","attest_author":"https://pith.science/pith/QJ7MFIODY7CLCA7AJUHNOZY2Y7/action/author_attestation","sign_citation":"https://pith.science/pith/QJ7MFIODY7CLCA7AJUHNOZY2Y7/action/citation_signature","submit_replication":"https://pith.science/pith/QJ7MFIODY7CLCA7AJUHNOZY2Y7/action/replication_record"}},"created_at":"2026-05-18T03:31:07.892739+00:00","updated_at":"2026-05-18T03:31:07.892739+00:00"}