{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZKIVFAFJDDBPUA6XIA5YNCIEBS","short_pith_number":"pith:ZKIVFAFJ","schema_version":"1.0","canonical_sha256":"ca915280a918c2fa03d7403b8689040cbe0746ea42c4d74a76c0f3fbe3f0ae2f","source":{"kind":"arxiv","id":"1607.04798","version":1},"attestation_state":"computed","paper":{"title":"Distributed Localization of Tree-structured Scattered Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anders Hansson, Carsten Fritsche, Emre \\\"Ozkan, Fredrik Gustafsson, Sina Khoshfetrat Pakazad","submitted_at":"2016-07-16T20:02:37Z","abstract_excerpt":"Many of the distributed localization algorithms are based on relaxed optimization formulations of the localization problem. These algorithms commonly rely on first-order optimization methods, and hence may require many iterations or communications among computational agents. Furthermore, some of these distributed algorithms put a considerable computational demand on the agents. In this paper, we show that for tree-structured scattered sensor networks, which are networks that their inter-sensor range measurement graphs have few edges (few range measurements among sensors) and can be represented"},"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":"1607.04798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-16T20:02:37Z","cross_cats_sorted":[],"title_canon_sha256":"d4078692b101860c250c08d00d782be5c4467ecd4f3a68aa6cb82168d89ca04e","abstract_canon_sha256":"0bc284ef35c9163db67fa129a8f66cc001f2e6f2f9f2d9f55c59ba030fa89e8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:56.601615Z","signature_b64":"Q9YlbajmgCERQuUXpah71G5TRWjrQgGiDN4ReQR5UIhwkJAZ18L0JCflrQVcDOCHArakQ2Eci1yUKSPDCDe+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca915280a918c2fa03d7403b8689040cbe0746ea42c4d74a76c0f3fbe3f0ae2f","last_reissued_at":"2026-05-18T01:10:56.601144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:56.601144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Localization of Tree-structured Scattered Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anders Hansson, Carsten Fritsche, Emre \\\"Ozkan, Fredrik Gustafsson, Sina Khoshfetrat Pakazad","submitted_at":"2016-07-16T20:02:37Z","abstract_excerpt":"Many of the distributed localization algorithms are based on relaxed optimization formulations of the localization problem. These algorithms commonly rely on first-order optimization methods, and hence may require many iterations or communications among computational agents. Furthermore, some of these distributed algorithms put a considerable computational demand on the agents. In this paper, we show that for tree-structured scattered sensor networks, which are networks that their inter-sensor range measurement graphs have few edges (few range measurements among sensors) and can be represented"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04798","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":"1607.04798","created_at":"2026-05-18T01:10:56.601206+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.04798v1","created_at":"2026-05-18T01:10:56.601206+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04798","created_at":"2026-05-18T01:10:56.601206+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZKIVFAFJDDBP","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZKIVFAFJDDBPUA6X","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZKIVFAFJ","created_at":"2026-05-18T12:30:53.716459+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/ZKIVFAFJDDBPUA6XIA5YNCIEBS","json":"https://pith.science/pith/ZKIVFAFJDDBPUA6XIA5YNCIEBS.json","graph_json":"https://pith.science/api/pith-number/ZKIVFAFJDDBPUA6XIA5YNCIEBS/graph.json","events_json":"https://pith.science/api/pith-number/ZKIVFAFJDDBPUA6XIA5YNCIEBS/events.json","paper":"https://pith.science/paper/ZKIVFAFJ"},"agent_actions":{"view_html":"https://pith.science/pith/ZKIVFAFJDDBPUA6XIA5YNCIEBS","download_json":"https://pith.science/pith/ZKIVFAFJDDBPUA6XIA5YNCIEBS.json","view_paper":"https://pith.science/paper/ZKIVFAFJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.04798&json=true","fetch_graph":"https://pith.science/api/pith-number/ZKIVFAFJDDBPUA6XIA5YNCIEBS/graph.json","fetch_events":"https://pith.science/api/pith-number/ZKIVFAFJDDBPUA6XIA5YNCIEBS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZKIVFAFJDDBPUA6XIA5YNCIEBS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZKIVFAFJDDBPUA6XIA5YNCIEBS/action/storage_attestation","attest_author":"https://pith.science/pith/ZKIVFAFJDDBPUA6XIA5YNCIEBS/action/author_attestation","sign_citation":"https://pith.science/pith/ZKIVFAFJDDBPUA6XIA5YNCIEBS/action/citation_signature","submit_replication":"https://pith.science/pith/ZKIVFAFJDDBPUA6XIA5YNCIEBS/action/replication_record"}},"created_at":"2026-05-18T01:10:56.601206+00:00","updated_at":"2026-05-18T01:10:56.601206+00:00"}