{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XHUJ2B34GFJLLCMC56VVXMKJ7Q","short_pith_number":"pith:XHUJ2B34","schema_version":"1.0","canonical_sha256":"b9e89d077c3152b58982efab5bb149fc03ac55c89e22b75ac18d849c3d0d9b48","source":{"kind":"arxiv","id":"1309.2031","version":1},"attestation_state":"computed","paper":{"title":"Cooperative Wireless Sensor Network Positioning via Implicit Convex Feasibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Erik G. Str\\\"om, Luba Tetruashvili, Mohammad Reza Gholami, Yair Censor","submitted_at":"2013-09-09T02:18:01Z","abstract_excerpt":"We propose a distributed positioning algorithm to estimate the unknown positions of a number of target nodes, given distance measurements between target nodes and between target nodes and a number of reference nodes at known positions. Based on a geometric interpretation, we formulate the positioning problem as an implicit convex feasibility problem in which some of the sets depend on the unknown target positions, and apply a parallel projection onto convex sets approach to estimate the unknown target node positions. The proposed technique is suitable for parallel implementation in which every"},"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":"1309.2031","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-09T02:18:01Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"c039e8dee2a53e97d53860708fc0e18fe6aee29a46477bc8fd4a9fa59dd16ce8","abstract_canon_sha256":"bf73deddcd9ca8bb941ca3c4bb0bfb5a85e9dcf232d5f317bca5d483b6270990"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:50.562537Z","signature_b64":"0m1ORM+Tj7Gf+b5uoHh8rMHp9xN6Hs99meTPVQWN7K6zTaGf2IdUVJlfiG4NgsFFdp5xBFCIdrFunjACJetoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9e89d077c3152b58982efab5bb149fc03ac55c89e22b75ac18d849c3d0d9b48","last_reissued_at":"2026-05-18T00:45:50.561939Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:50.561939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cooperative Wireless Sensor Network Positioning via Implicit Convex Feasibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Erik G. Str\\\"om, Luba Tetruashvili, Mohammad Reza Gholami, Yair Censor","submitted_at":"2013-09-09T02:18:01Z","abstract_excerpt":"We propose a distributed positioning algorithm to estimate the unknown positions of a number of target nodes, given distance measurements between target nodes and between target nodes and a number of reference nodes at known positions. Based on a geometric interpretation, we formulate the positioning problem as an implicit convex feasibility problem in which some of the sets depend on the unknown target positions, and apply a parallel projection onto convex sets approach to estimate the unknown target node positions. The proposed technique is suitable for parallel implementation in which every"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2031","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":"1309.2031","created_at":"2026-05-18T00:45:50.562023+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.2031v1","created_at":"2026-05-18T00:45:50.562023+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2031","created_at":"2026-05-18T00:45:50.562023+00:00"},{"alias_kind":"pith_short_12","alias_value":"XHUJ2B34GFJL","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XHUJ2B34GFJLLCMC","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XHUJ2B34","created_at":"2026-05-18T12:28:06.772260+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/XHUJ2B34GFJLLCMC56VVXMKJ7Q","json":"https://pith.science/pith/XHUJ2B34GFJLLCMC56VVXMKJ7Q.json","graph_json":"https://pith.science/api/pith-number/XHUJ2B34GFJLLCMC56VVXMKJ7Q/graph.json","events_json":"https://pith.science/api/pith-number/XHUJ2B34GFJLLCMC56VVXMKJ7Q/events.json","paper":"https://pith.science/paper/XHUJ2B34"},"agent_actions":{"view_html":"https://pith.science/pith/XHUJ2B34GFJLLCMC56VVXMKJ7Q","download_json":"https://pith.science/pith/XHUJ2B34GFJLLCMC56VVXMKJ7Q.json","view_paper":"https://pith.science/paper/XHUJ2B34","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.2031&json=true","fetch_graph":"https://pith.science/api/pith-number/XHUJ2B34GFJLLCMC56VVXMKJ7Q/graph.json","fetch_events":"https://pith.science/api/pith-number/XHUJ2B34GFJLLCMC56VVXMKJ7Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XHUJ2B34GFJLLCMC56VVXMKJ7Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XHUJ2B34GFJLLCMC56VVXMKJ7Q/action/storage_attestation","attest_author":"https://pith.science/pith/XHUJ2B34GFJLLCMC56VVXMKJ7Q/action/author_attestation","sign_citation":"https://pith.science/pith/XHUJ2B34GFJLLCMC56VVXMKJ7Q/action/citation_signature","submit_replication":"https://pith.science/pith/XHUJ2B34GFJLLCMC56VVXMKJ7Q/action/replication_record"}},"created_at":"2026-05-18T00:45:50.562023+00:00","updated_at":"2026-05-18T00:45:50.562023+00:00"}