{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZKIVFAFJDDBPUA6XIA5YNCIEBS","short_pith_number":"pith:ZKIVFAFJ","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"},"canonical_sha256":"ca915280a918c2fa03d7403b8689040cbe0746ea42c4d74a76c0f3fbe3f0ae2f","source":{"kind":"arxiv","id":"1607.04798","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04798","created_at":"2026-05-18T01:10:56Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04798v1","created_at":"2026-05-18T01:10:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04798","created_at":"2026-05-18T01:10:56Z"},{"alias_kind":"pith_short_12","alias_value":"ZKIVFAFJDDBP","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZKIVFAFJDDBPUA6X","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZKIVFAFJ","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZKIVFAFJDDBPUA6XIA5YNCIEBS","target":"record","payload":{"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"},"canonical_sha256":"ca915280a918c2fa03d7403b8689040cbe0746ea42c4d74a76c0f3fbe3f0ae2f","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"},"source_kind":"arxiv","source_id":"1607.04798","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:10:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uo3gRpMlACadfSOoyQGt74vTYzE/fhcYu3O36bYl8WQ4YM+LP53tbnv+WY60U5wIIYo29qr3ormB2kCvvduPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:08:00.185425Z"},"content_sha256":"9ee662f15097bec9d4cfffb6e2ccf735997e937b61ddf074e65e3fb7dbd458f0","schema_version":"1.0","event_id":"sha256:9ee662f15097bec9d4cfffb6e2ccf735997e937b61ddf074e65e3fb7dbd458f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZKIVFAFJDDBPUA6XIA5YNCIEBS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:10:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NJY8KORHLAbvgQbYXysHxZpf1gP2FbRsqLV6HmDMP6ruXIIHduSdXn2+oSHcclpkhlW07W3ckYKO3DR/NUXNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:08:00.186096Z"},"content_sha256":"ce5f8ace47a6fd409f8132d9af43381d31f655aa48b8f1f83490a753fd3bf752","schema_version":"1.0","event_id":"sha256:ce5f8ace47a6fd409f8132d9af43381d31f655aa48b8f1f83490a753fd3bf752"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZKIVFAFJDDBPUA6XIA5YNCIEBS/bundle.json","state_url":"https://pith.science/pith/ZKIVFAFJDDBPUA6XIA5YNCIEBS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZKIVFAFJDDBPUA6XIA5YNCIEBS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T08:08:00Z","links":{"resolver":"https://pith.science/pith/ZKIVFAFJDDBPUA6XIA5YNCIEBS","bundle":"https://pith.science/pith/ZKIVFAFJDDBPUA6XIA5YNCIEBS/bundle.json","state":"https://pith.science/pith/ZKIVFAFJDDBPUA6XIA5YNCIEBS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZKIVFAFJDDBPUA6XIA5YNCIEBS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZKIVFAFJDDBPUA6XIA5YNCIEBS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0bc284ef35c9163db67fa129a8f66cc001f2e6f2f9f2d9f55c59ba030fa89e8d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-16T20:02:37Z","title_canon_sha256":"d4078692b101860c250c08d00d782be5c4467ecd4f3a68aa6cb82168d89ca04e"},"schema_version":"1.0","source":{"id":"1607.04798","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04798","created_at":"2026-05-18T01:10:56Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04798v1","created_at":"2026-05-18T01:10:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04798","created_at":"2026-05-18T01:10:56Z"},{"alias_kind":"pith_short_12","alias_value":"ZKIVFAFJDDBP","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZKIVFAFJDDBPUA6X","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZKIVFAFJ","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:ce5f8ace47a6fd409f8132d9af43381d31f655aa48b8f1f83490a753fd3bf752","target":"graph","created_at":"2026-05-18T01:10:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Anders Hansson, Carsten Fritsche, Emre \\\"Ozkan, Fredrik Gustafsson, Sina Khoshfetrat Pakazad","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-16T20:02:37Z","title":"Distributed Localization of Tree-structured Scattered Sensor Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04798","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9ee662f15097bec9d4cfffb6e2ccf735997e937b61ddf074e65e3fb7dbd458f0","target":"record","created_at":"2026-05-18T01:10:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0bc284ef35c9163db67fa129a8f66cc001f2e6f2f9f2d9f55c59ba030fa89e8d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-16T20:02:37Z","title_canon_sha256":"d4078692b101860c250c08d00d782be5c4467ecd4f3a68aa6cb82168d89ca04e"},"schema_version":"1.0","source":{"id":"1607.04798","kind":"arxiv","version":1}},"canonical_sha256":"ca915280a918c2fa03d7403b8689040cbe0746ea42c4d74a76c0f3fbe3f0ae2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca915280a918c2fa03d7403b8689040cbe0746ea42c4d74a76c0f3fbe3f0ae2f","first_computed_at":"2026-05-18T01:10:56.601144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:56.601144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q9YlbajmgCERQuUXpah71G5TRWjrQgGiDN4ReQR5UIhwkJAZ18L0JCflrQVcDOCHArakQ2Eci1yUKSPDCDe+AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:56.601615Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.04798","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ee662f15097bec9d4cfffb6e2ccf735997e937b61ddf074e65e3fb7dbd458f0","sha256:ce5f8ace47a6fd409f8132d9af43381d31f655aa48b8f1f83490a753fd3bf752"],"state_sha256":"0af01a4885f7379acacae64feaa8611fb1aad17936010e80a5b1538b66ca9cca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rBVpVTMdBO+wkc4bzZazGCbCFmlRb6dHR+c9dCDEJhFrzp307BHlHJn26yfcfoG184xshVrzXP9PBOE2Og6yBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:08:00.189469Z","bundle_sha256":"be8c31aef59e7e2626a6cec195a8b24b84d4698308573875a6b805ff513971b9"}}