{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:XCYEJAM7QXNL2K6KCSPQHYLQ3B","short_pith_number":"pith:XCYEJAM7","schema_version":"1.0","canonical_sha256":"b8b044819f85dabd2bca149f03e170d84eac263de937177a4cee56a1d1934fd0","source":{"kind":"arxiv","id":"2308.02278","version":1},"attestation_state":"computed","paper":{"title":"Blessing of High-Order Dimensionality: from Non-Convex to Convex Optimization for Sensor Network Localization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jiayu Zhang, Mingyu Lei, Yinyu Ye","submitted_at":"2023-08-04T12:08:23Z","abstract_excerpt":"This paper investigates the Sensor Network Localization (SNL) problem, which seeks to determine sensor locations based on known anchor locations and partially given anchors-sensors and sensors-sensors distances. Two primary methods for solving the SNL problem are analyzed: the low-dimensional method that directly minimizes a loss function, and the high-dimensional semi-definite relaxation (SDR) method that reformulates the SNL problem as an SDP (semi-definite programming) problem. The paper primarily focuses on the intrinsic non-convexity of the loss function of the low-dimensional method, whi"},"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":"2308.02278","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-08-04T12:08:23Z","cross_cats_sorted":[],"title_canon_sha256":"a06c8559f1b95c84f1122b7e2b001761a25f7b7a9eacb5b25bb228562fc0b334","abstract_canon_sha256":"e5d04d5201a0230f14557ed4dc2f8ab4f664c9227ae5c65cde12016f75a58394"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:39:07.154041Z","signature_b64":"YOEABSS7eWTeTN4yWKoijsv1BfIwJNAWcsm0gWaQ862vaMkvBDsR+CgqMaEcz3gapHRSwxdvmjCEeharzol2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8b044819f85dabd2bca149f03e170d84eac263de937177a4cee56a1d1934fd0","last_reissued_at":"2026-07-05T06:39:07.153558Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:39:07.153558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Blessing of High-Order Dimensionality: from Non-Convex to Convex Optimization for Sensor Network Localization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jiayu Zhang, Mingyu Lei, Yinyu Ye","submitted_at":"2023-08-04T12:08:23Z","abstract_excerpt":"This paper investigates the Sensor Network Localization (SNL) problem, which seeks to determine sensor locations based on known anchor locations and partially given anchors-sensors and sensors-sensors distances. Two primary methods for solving the SNL problem are analyzed: the low-dimensional method that directly minimizes a loss function, and the high-dimensional semi-definite relaxation (SDR) method that reformulates the SNL problem as an SDP (semi-definite programming) problem. The paper primarily focuses on the intrinsic non-convexity of the loss function of the low-dimensional method, whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.02278","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.02278/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2308.02278","created_at":"2026-07-05T06:39:07.153621+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.02278v1","created_at":"2026-07-05T06:39:07.153621+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.02278","created_at":"2026-07-05T06:39:07.153621+00:00"},{"alias_kind":"pith_short_12","alias_value":"XCYEJAM7QXNL","created_at":"2026-07-05T06:39:07.153621+00:00"},{"alias_kind":"pith_short_16","alias_value":"XCYEJAM7QXNL2K6K","created_at":"2026-07-05T06:39:07.153621+00:00"},{"alias_kind":"pith_short_8","alias_value":"XCYEJAM7","created_at":"2026-07-05T06:39:07.153621+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2508.00091","citing_title":"Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness","ref_index":90,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XCYEJAM7QXNL2K6KCSPQHYLQ3B","json":"https://pith.science/pith/XCYEJAM7QXNL2K6KCSPQHYLQ3B.json","graph_json":"https://pith.science/api/pith-number/XCYEJAM7QXNL2K6KCSPQHYLQ3B/graph.json","events_json":"https://pith.science/api/pith-number/XCYEJAM7QXNL2K6KCSPQHYLQ3B/events.json","paper":"https://pith.science/paper/XCYEJAM7"},"agent_actions":{"view_html":"https://pith.science/pith/XCYEJAM7QXNL2K6KCSPQHYLQ3B","download_json":"https://pith.science/pith/XCYEJAM7QXNL2K6KCSPQHYLQ3B.json","view_paper":"https://pith.science/paper/XCYEJAM7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.02278&json=true","fetch_graph":"https://pith.science/api/pith-number/XCYEJAM7QXNL2K6KCSPQHYLQ3B/graph.json","fetch_events":"https://pith.science/api/pith-number/XCYEJAM7QXNL2K6KCSPQHYLQ3B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XCYEJAM7QXNL2K6KCSPQHYLQ3B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XCYEJAM7QXNL2K6KCSPQHYLQ3B/action/storage_attestation","attest_author":"https://pith.science/pith/XCYEJAM7QXNL2K6KCSPQHYLQ3B/action/author_attestation","sign_citation":"https://pith.science/pith/XCYEJAM7QXNL2K6KCSPQHYLQ3B/action/citation_signature","submit_replication":"https://pith.science/pith/XCYEJAM7QXNL2K6KCSPQHYLQ3B/action/replication_record"}},"created_at":"2026-07-05T06:39:07.153621+00:00","updated_at":"2026-07-05T06:39:07.153621+00:00"}