{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XCDCFR7QOTK3R5EYWFJWZREAJM","short_pith_number":"pith:XCDCFR7Q","schema_version":"1.0","canonical_sha256":"b88622c7f074d5b8f498b1536cc4804b267d15955b8541e4eb42f5c59340ae65","source":{"kind":"arxiv","id":"1302.3673","version":2},"attestation_state":"computed","paper":{"title":"Global Optimal Solutions to General Sensor Network Localization Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"David Y Gao, Ning Ruan","submitted_at":"2013-02-15T04:47:58Z","abstract_excerpt":"Sensor network localization problem is to determine the position of the sensor nodes in a network given pairwise distance measurements. Such problem can be formulated as a polynomial minimization via the least squares method. This paper presents a canonical duality theory for solving this challenging problem. It is shown that the nonconvex minimization problem can be reformulated as a concave maximization dual problem over a convex set in a symmetrical matrix space, and hence can be solved efficiently by combining a general (linear or quadratic) perturbation technique with existing optimizatio"},"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":"1302.3673","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-02-15T04:47:58Z","cross_cats_sorted":[],"title_canon_sha256":"917c44018c04ebec3c0f9a6434eeb69300a3484b7b5a2380cb95185d5f4c9f05","abstract_canon_sha256":"a128f74372e5eb865ccb8e816f23f7bc91e232b71b94f3745e14cf96482a8933"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:34.544449Z","signature_b64":"a7A9QQdCd99lW7mZo3LjmbNuYNL8mC6+An7j/LF31PU+mfgFpZ3eS5c0IZpLzjNkguh+Rhx92TWoY+NEHkKrCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b88622c7f074d5b8f498b1536cc4804b267d15955b8541e4eb42f5c59340ae65","last_reissued_at":"2026-05-18T03:06:34.543947Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:34.543947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Global Optimal Solutions to General Sensor Network Localization Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"David Y Gao, Ning Ruan","submitted_at":"2013-02-15T04:47:58Z","abstract_excerpt":"Sensor network localization problem is to determine the position of the sensor nodes in a network given pairwise distance measurements. Such problem can be formulated as a polynomial minimization via the least squares method. This paper presents a canonical duality theory for solving this challenging problem. It is shown that the nonconvex minimization problem can be reformulated as a concave maximization dual problem over a convex set in a symmetrical matrix space, and hence can be solved efficiently by combining a general (linear or quadratic) perturbation technique with existing optimizatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3673","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1302.3673","created_at":"2026-05-18T03:06:34.544021+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.3673v2","created_at":"2026-05-18T03:06:34.544021+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3673","created_at":"2026-05-18T03:06:34.544021+00:00"},{"alias_kind":"pith_short_12","alias_value":"XCDCFR7QOTK3","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XCDCFR7QOTK3R5EY","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XCDCFR7Q","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/XCDCFR7QOTK3R5EYWFJWZREAJM","json":"https://pith.science/pith/XCDCFR7QOTK3R5EYWFJWZREAJM.json","graph_json":"https://pith.science/api/pith-number/XCDCFR7QOTK3R5EYWFJWZREAJM/graph.json","events_json":"https://pith.science/api/pith-number/XCDCFR7QOTK3R5EYWFJWZREAJM/events.json","paper":"https://pith.science/paper/XCDCFR7Q"},"agent_actions":{"view_html":"https://pith.science/pith/XCDCFR7QOTK3R5EYWFJWZREAJM","download_json":"https://pith.science/pith/XCDCFR7QOTK3R5EYWFJWZREAJM.json","view_paper":"https://pith.science/paper/XCDCFR7Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.3673&json=true","fetch_graph":"https://pith.science/api/pith-number/XCDCFR7QOTK3R5EYWFJWZREAJM/graph.json","fetch_events":"https://pith.science/api/pith-number/XCDCFR7QOTK3R5EYWFJWZREAJM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XCDCFR7QOTK3R5EYWFJWZREAJM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XCDCFR7QOTK3R5EYWFJWZREAJM/action/storage_attestation","attest_author":"https://pith.science/pith/XCDCFR7QOTK3R5EYWFJWZREAJM/action/author_attestation","sign_citation":"https://pith.science/pith/XCDCFR7QOTK3R5EYWFJWZREAJM/action/citation_signature","submit_replication":"https://pith.science/pith/XCDCFR7QOTK3R5EYWFJWZREAJM/action/replication_record"}},"created_at":"2026-05-18T03:06:34.544021+00:00","updated_at":"2026-05-18T03:06:34.544021+00:00"}