{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KZQ53D63UZAV5KTI66U3VVOGWP","short_pith_number":"pith:KZQ53D63","schema_version":"1.0","canonical_sha256":"5661dd8fdba6415eaa68f7a9bad5c6b3ccacdd74439bb58b5d52427cc85e54ee","source":{"kind":"arxiv","id":"1509.02534","version":1},"attestation_state":"computed","paper":{"title":"Space-Time Hierarchical-Graph Based Cooperative Localization in Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hui Gao, Lajos Hanzo, Shaoshi Yang, Tiejun Lv, Xiaopeng Li","submitted_at":"2015-09-08T20:10:15Z","abstract_excerpt":"It has been shown that cooperative localization is capable of improving both the positioning accuracy and coverage in scenarios where the global positioning system (GPS) has a poor performance. However, due to its potentially excessive computational complexity, at the time of writing the application of cooperative localization remains limited in practice. In this paper, we address the efficient cooperative positioning problem in wireless sensor networks. A space-time hierarchical-graph based scheme exhibiting fast convergence is proposed for localizing the agent nodes. In contrast to conventio"},"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":"1509.02534","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-08T20:10:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b20c90874d4b8e8ed83eb83df14f5996cb77cee48f09e242c762bcf2ae07b5d9","abstract_canon_sha256":"2c2007f5a2085872cd6784229a812459644ac8f9ce610a91a2f82d1a6a31094c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:48.069200Z","signature_b64":"tsooBfBTokWvV2sFW66y2F5cOBAv01gkMIZnrO4GRH1/sq173u9FYoUGDvWT7z83uWyU2lNjK7HP90uOTHglBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5661dd8fdba6415eaa68f7a9bad5c6b3ccacdd74439bb58b5d52427cc85e54ee","last_reissued_at":"2026-05-18T01:22:48.068747Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:48.068747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Space-Time Hierarchical-Graph Based Cooperative Localization in Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hui Gao, Lajos Hanzo, Shaoshi Yang, Tiejun Lv, Xiaopeng Li","submitted_at":"2015-09-08T20:10:15Z","abstract_excerpt":"It has been shown that cooperative localization is capable of improving both the positioning accuracy and coverage in scenarios where the global positioning system (GPS) has a poor performance. However, due to its potentially excessive computational complexity, at the time of writing the application of cooperative localization remains limited in practice. In this paper, we address the efficient cooperative positioning problem in wireless sensor networks. A space-time hierarchical-graph based scheme exhibiting fast convergence is proposed for localizing the agent nodes. In contrast to conventio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02534","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":"1509.02534","created_at":"2026-05-18T01:22:48.068804+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.02534v1","created_at":"2026-05-18T01:22:48.068804+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02534","created_at":"2026-05-18T01:22:48.068804+00:00"},{"alias_kind":"pith_short_12","alias_value":"KZQ53D63UZAV","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KZQ53D63UZAV5KTI","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KZQ53D63","created_at":"2026-05-18T12:29:29.992203+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/KZQ53D63UZAV5KTI66U3VVOGWP","json":"https://pith.science/pith/KZQ53D63UZAV5KTI66U3VVOGWP.json","graph_json":"https://pith.science/api/pith-number/KZQ53D63UZAV5KTI66U3VVOGWP/graph.json","events_json":"https://pith.science/api/pith-number/KZQ53D63UZAV5KTI66U3VVOGWP/events.json","paper":"https://pith.science/paper/KZQ53D63"},"agent_actions":{"view_html":"https://pith.science/pith/KZQ53D63UZAV5KTI66U3VVOGWP","download_json":"https://pith.science/pith/KZQ53D63UZAV5KTI66U3VVOGWP.json","view_paper":"https://pith.science/paper/KZQ53D63","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.02534&json=true","fetch_graph":"https://pith.science/api/pith-number/KZQ53D63UZAV5KTI66U3VVOGWP/graph.json","fetch_events":"https://pith.science/api/pith-number/KZQ53D63UZAV5KTI66U3VVOGWP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KZQ53D63UZAV5KTI66U3VVOGWP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KZQ53D63UZAV5KTI66U3VVOGWP/action/storage_attestation","attest_author":"https://pith.science/pith/KZQ53D63UZAV5KTI66U3VVOGWP/action/author_attestation","sign_citation":"https://pith.science/pith/KZQ53D63UZAV5KTI66U3VVOGWP/action/citation_signature","submit_replication":"https://pith.science/pith/KZQ53D63UZAV5KTI66U3VVOGWP/action/replication_record"}},"created_at":"2026-05-18T01:22:48.068804+00:00","updated_at":"2026-05-18T01:22:48.068804+00:00"}