{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SFUSPDWB7NZSDE7GE6DZFEMSZQ","short_pith_number":"pith:SFUSPDWB","canonical_record":{"source":{"id":"1408.4728","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-20T17:07:40Z","cross_cats_sorted":[],"title_canon_sha256":"8f386e1ff6771f2e414dedd8d3803e3f466834773a3e4a109589b1bfd880bf46","abstract_canon_sha256":"5e8043fa06e1776726356290386eb40f183879537ad248d92abddcbd170c13f1"},"schema_version":"1.0"},"canonical_sha256":"9169278ec1fb732193e62787929192cc2611a1b910f10e2bea1bcf59d7934d9f","source":{"kind":"arxiv","id":"1408.4728","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.4728","created_at":"2026-05-18T01:31:46Z"},{"alias_kind":"arxiv_version","alias_value":"1408.4728v2","created_at":"2026-05-18T01:31:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4728","created_at":"2026-05-18T01:31:46Z"},{"alias_kind":"pith_short_12","alias_value":"SFUSPDWB7NZS","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SFUSPDWB7NZSDE7G","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SFUSPDWB","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SFUSPDWB7NZSDE7GE6DZFEMSZQ","target":"record","payload":{"canonical_record":{"source":{"id":"1408.4728","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-20T17:07:40Z","cross_cats_sorted":[],"title_canon_sha256":"8f386e1ff6771f2e414dedd8d3803e3f466834773a3e4a109589b1bfd880bf46","abstract_canon_sha256":"5e8043fa06e1776726356290386eb40f183879537ad248d92abddcbd170c13f1"},"schema_version":"1.0"},"canonical_sha256":"9169278ec1fb732193e62787929192cc2611a1b910f10e2bea1bcf59d7934d9f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:46.512469Z","signature_b64":"vUdZunNqizPT4/vs+VLFSY/Ku3Z8CFc7rmi0yNYB/K/iCsCsiOcSUtRo9qnDp48lf7L/GVpJUEQTs9PTl/udBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9169278ec1fb732193e62787929192cc2611a1b910f10e2bea1bcf59d7934d9f","last_reissued_at":"2026-05-18T01:31:46.512061Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:46.512061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.4728","source_version":2,"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:31:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9hArP1UPkUIJJMe1Kj1zQcX+p3xXX/bNloBZUz6phtFQ+SOC/pZpHSG8z/MGbdNyBBuN4VRm4tHrT5FbgXz0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:33:50.796091Z"},"content_sha256":"facb21590c08f6ad1a01e3afc0556f6b8fe39f98152fd0a0e9001a3b7b931605","schema_version":"1.0","event_id":"sha256:facb21590c08f6ad1a01e3afc0556f6b8fe39f98152fd0a0e9001a3b7b931605"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SFUSPDWB7NZSDE7GE6DZFEMSZQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simple and fast convex relaxation method for cooperative localization in sensor networks using range measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Cl\\'audia Soares, Jo\\~ao Gomes, Jo\\~ao Xavier","submitted_at":"2014-08-20T17:07:40Z","abstract_excerpt":"We address the sensor network localization problem given noisy range measurements between pairs of nodes. We approach the non-convex maximum-likelihood formulation via a known simple convex relaxation. We exploit its favorable optimization properties to the full to obtain an approach that: is completely distributed, has a simple implementation at each node, and capitalizes on an optimal gradient method to attain fast convergence. We offer a parallel but also an asynchronous flavor, both with theoretical convergence guarantees and iteration complexity analysis. Experimental results establish le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4728","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"},"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:31:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bv9FrEDERZX7HiUaGJnZuyUmjI1RwPRALM/OVPk+MzGCsSUjDsEKRy25dgVqzKOv5QfgWqjgU0Ihdg1MBUy4BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:33:50.796466Z"},"content_sha256":"daab76b5b8ae3dc1193711f15a5400d8a2b9ccfac3b3fc4d8e4617feb2ab15c3","schema_version":"1.0","event_id":"sha256:daab76b5b8ae3dc1193711f15a5400d8a2b9ccfac3b3fc4d8e4617feb2ab15c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SFUSPDWB7NZSDE7GE6DZFEMSZQ/bundle.json","state_url":"https://pith.science/pith/SFUSPDWB7NZSDE7GE6DZFEMSZQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SFUSPDWB7NZSDE7GE6DZFEMSZQ/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-31T01:33:50Z","links":{"resolver":"https://pith.science/pith/SFUSPDWB7NZSDE7GE6DZFEMSZQ","bundle":"https://pith.science/pith/SFUSPDWB7NZSDE7GE6DZFEMSZQ/bundle.json","state":"https://pith.science/pith/SFUSPDWB7NZSDE7GE6DZFEMSZQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SFUSPDWB7NZSDE7GE6DZFEMSZQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SFUSPDWB7NZSDE7GE6DZFEMSZQ","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":"5e8043fa06e1776726356290386eb40f183879537ad248d92abddcbd170c13f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-20T17:07:40Z","title_canon_sha256":"8f386e1ff6771f2e414dedd8d3803e3f466834773a3e4a109589b1bfd880bf46"},"schema_version":"1.0","source":{"id":"1408.4728","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.4728","created_at":"2026-05-18T01:31:46Z"},{"alias_kind":"arxiv_version","alias_value":"1408.4728v2","created_at":"2026-05-18T01:31:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4728","created_at":"2026-05-18T01:31:46Z"},{"alias_kind":"pith_short_12","alias_value":"SFUSPDWB7NZS","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SFUSPDWB7NZSDE7G","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SFUSPDWB","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:daab76b5b8ae3dc1193711f15a5400d8a2b9ccfac3b3fc4d8e4617feb2ab15c3","target":"graph","created_at":"2026-05-18T01:31:46Z","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":"We address the sensor network localization problem given noisy range measurements between pairs of nodes. We approach the non-convex maximum-likelihood formulation via a known simple convex relaxation. We exploit its favorable optimization properties to the full to obtain an approach that: is completely distributed, has a simple implementation at each node, and capitalizes on an optimal gradient method to attain fast convergence. We offer a parallel but also an asynchronous flavor, both with theoretical convergence guarantees and iteration complexity analysis. Experimental results establish le","authors_text":"Cl\\'audia Soares, Jo\\~ao Gomes, Jo\\~ao Xavier","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-20T17:07:40Z","title":"Simple and fast convex relaxation method for cooperative localization in sensor networks using range measurements"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4728","kind":"arxiv","version":2},"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:facb21590c08f6ad1a01e3afc0556f6b8fe39f98152fd0a0e9001a3b7b931605","target":"record","created_at":"2026-05-18T01:31:46Z","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":"5e8043fa06e1776726356290386eb40f183879537ad248d92abddcbd170c13f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-20T17:07:40Z","title_canon_sha256":"8f386e1ff6771f2e414dedd8d3803e3f466834773a3e4a109589b1bfd880bf46"},"schema_version":"1.0","source":{"id":"1408.4728","kind":"arxiv","version":2}},"canonical_sha256":"9169278ec1fb732193e62787929192cc2611a1b910f10e2bea1bcf59d7934d9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9169278ec1fb732193e62787929192cc2611a1b910f10e2bea1bcf59d7934d9f","first_computed_at":"2026-05-18T01:31:46.512061Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:46.512061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vUdZunNqizPT4/vs+VLFSY/Ku3Z8CFc7rmi0yNYB/K/iCsCsiOcSUtRo9qnDp48lf7L/GVpJUEQTs9PTl/udBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:46.512469Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.4728","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:facb21590c08f6ad1a01e3afc0556f6b8fe39f98152fd0a0e9001a3b7b931605","sha256:daab76b5b8ae3dc1193711f15a5400d8a2b9ccfac3b3fc4d8e4617feb2ab15c3"],"state_sha256":"c206a86bc2d83052cdd0fcc3f4361d365a8a1c97a9da089f31929c8a4a8f3e29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gWad3YX0q/gjkHOUVukL/10IqyB/qQIh/uO3gpvBH2BWvIVUpGdiYAAyPJ1w6NdORznkxJ7r9k4H2F2yMi35Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:33:50.798707Z","bundle_sha256":"38c74be478c445c779909d22b06c74abc02a6e8c5ec472034425fa80287a1d96"}}