{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GRVV33JMIDXUE5SSI4PTA3MWBD","short_pith_number":"pith:GRVV33JM","schema_version":"1.0","canonical_sha256":"346b5ded2c40ef427652471f306d9608f682030fbed3fef0666aa984ba2929c5","source":{"kind":"arxiv","id":"1504.01207","version":2},"attestation_state":"computed","paper":{"title":"Localization in mobile networks via virtual convex hulls","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Sam Safavi, Usman A. Khan","submitted_at":"2015-04-06T05:15:19Z","abstract_excerpt":"In this paper, we develop a \\textit{distributed} algorithm to localize an arbitrary number of agents moving in a bounded region of interest. We assume that the network contains \\textit{at least one} agent with known location (hereinafter referred to as an anchor), and each agent measures a noisy version of its motion and the distances to the nearby agents. We provide a~\\emph{geometric approach}, which allows each agent to: (i) continually update the distances to the locations where it has exchanged information with the other nodes in the past; and (ii) measure the distance between a neighbor a"},"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":"1504.01207","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-04-06T05:15:19Z","cross_cats_sorted":[],"title_canon_sha256":"e22295f694fc114738fa8ea92fd55c29e871bc282c6235ea9a93fe8a1aef4463","abstract_canon_sha256":"adcafc26b02c1889e40c3cea945c185c0445da02828405f4e3974cc9a678e8c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:24.035568Z","signature_b64":"4vFMe4fH5nU0SE0Xmd/g/wdCjHCuc34808ChT8gpokRPIO9hr7WZSIvJaD8O/DVX3zL4kn5WeMwlaQuK/StvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"346b5ded2c40ef427652471f306d9608f682030fbed3fef0666aa984ba2929c5","last_reissued_at":"2026-05-18T00:52:24.034922Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:24.034922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Localization in mobile networks via virtual convex hulls","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Sam Safavi, Usman A. Khan","submitted_at":"2015-04-06T05:15:19Z","abstract_excerpt":"In this paper, we develop a \\textit{distributed} algorithm to localize an arbitrary number of agents moving in a bounded region of interest. We assume that the network contains \\textit{at least one} agent with known location (hereinafter referred to as an anchor), and each agent measures a noisy version of its motion and the distances to the nearby agents. We provide a~\\emph{geometric approach}, which allows each agent to: (i) continually update the distances to the locations where it has exchanged information with the other nodes in the past; and (ii) measure the distance between a neighbor a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01207","kind":"arxiv","version":2},"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":"1504.01207","created_at":"2026-05-18T00:52:24.035008+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.01207v2","created_at":"2026-05-18T00:52:24.035008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01207","created_at":"2026-05-18T00:52:24.035008+00:00"},{"alias_kind":"pith_short_12","alias_value":"GRVV33JMIDXU","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GRVV33JMIDXUE5SS","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GRVV33JM","created_at":"2026-05-18T12:29:22.688609+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/GRVV33JMIDXUE5SSI4PTA3MWBD","json":"https://pith.science/pith/GRVV33JMIDXUE5SSI4PTA3MWBD.json","graph_json":"https://pith.science/api/pith-number/GRVV33JMIDXUE5SSI4PTA3MWBD/graph.json","events_json":"https://pith.science/api/pith-number/GRVV33JMIDXUE5SSI4PTA3MWBD/events.json","paper":"https://pith.science/paper/GRVV33JM"},"agent_actions":{"view_html":"https://pith.science/pith/GRVV33JMIDXUE5SSI4PTA3MWBD","download_json":"https://pith.science/pith/GRVV33JMIDXUE5SSI4PTA3MWBD.json","view_paper":"https://pith.science/paper/GRVV33JM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.01207&json=true","fetch_graph":"https://pith.science/api/pith-number/GRVV33JMIDXUE5SSI4PTA3MWBD/graph.json","fetch_events":"https://pith.science/api/pith-number/GRVV33JMIDXUE5SSI4PTA3MWBD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GRVV33JMIDXUE5SSI4PTA3MWBD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GRVV33JMIDXUE5SSI4PTA3MWBD/action/storage_attestation","attest_author":"https://pith.science/pith/GRVV33JMIDXUE5SSI4PTA3MWBD/action/author_attestation","sign_citation":"https://pith.science/pith/GRVV33JMIDXUE5SSI4PTA3MWBD/action/citation_signature","submit_replication":"https://pith.science/pith/GRVV33JMIDXUE5SSI4PTA3MWBD/action/replication_record"}},"created_at":"2026-05-18T00:52:24.035008+00:00","updated_at":"2026-05-18T00:52:24.035008+00:00"}