{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PR5BPGXE3PHDKWEHTZTX42CG7C","short_pith_number":"pith:PR5BPGXE","schema_version":"1.0","canonical_sha256":"7c7a179ae4dbce3558879e677e6846f889298056c63b24a0e9d12bb3867bf846","source":{"kind":"arxiv","id":"2405.20883","version":1},"attestation_state":"computed","paper":{"title":"Scalable Distance-based Multi-Agent Relative State Estimation via Block Multiconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Fei Gao, Gongye Zaitian, Qianhao Wang, Tianyue Wu","submitted_at":"2024-05-31T14:55:44Z","abstract_excerpt":"This paper explores the distance-based relative state estimation problem in large-scale systems, which is hard to solve effectively due to its high-dimensionality and non-convexity. In this paper, we alleviate this inherent hardness to simultaneously achieve scalability and robustness of inference on this problem. Our idea is launched from a universal geometric formulation, called \\emph{generalized graph realization}, for the distance-based relative state estimation problem. Based on this formulation, we introduce two collaborative optimization models, one of which is convex and thus globally "},"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":"2405.20883","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-05-31T14:55:44Z","cross_cats_sorted":[],"title_canon_sha256":"a794ae85968e104856e8ea3f0e179043f4d1d8acb4c2295d2db4e0ea141afd9b","abstract_canon_sha256":"174fbe638f94a0b71ed9e23f20ed892945530ab0e75729a1ed00f9c87bd2c588"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:25:43.363080Z","signature_b64":"Kc1mga6ozIrjznNftjU7fwWLrHRh8TJKSw0IxFVqh4sWnJvrGMLokelwYmr9iINXXszbeDcIJadDJwH09qf3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c7a179ae4dbce3558879e677e6846f889298056c63b24a0e9d12bb3867bf846","last_reissued_at":"2026-07-05T08:25:43.362573Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:25:43.362573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Distance-based Multi-Agent Relative State Estimation via Block Multiconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Fei Gao, Gongye Zaitian, Qianhao Wang, Tianyue Wu","submitted_at":"2024-05-31T14:55:44Z","abstract_excerpt":"This paper explores the distance-based relative state estimation problem in large-scale systems, which is hard to solve effectively due to its high-dimensionality and non-convexity. In this paper, we alleviate this inherent hardness to simultaneously achieve scalability and robustness of inference on this problem. Our idea is launched from a universal geometric formulation, called \\emph{generalized graph realization}, for the distance-based relative state estimation problem. Based on this formulation, we introduce two collaborative optimization models, one of which is convex and thus globally "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.20883","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/2405.20883/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":"2405.20883","created_at":"2026-07-05T08:25:43.362638+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.20883v1","created_at":"2026-07-05T08:25:43.362638+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.20883","created_at":"2026-07-05T08:25:43.362638+00:00"},{"alias_kind":"pith_short_12","alias_value":"PR5BPGXE3PHD","created_at":"2026-07-05T08:25:43.362638+00:00"},{"alias_kind":"pith_short_16","alias_value":"PR5BPGXE3PHDKWEH","created_at":"2026-07-05T08:25:43.362638+00:00"},{"alias_kind":"pith_short_8","alias_value":"PR5BPGXE","created_at":"2026-07-05T08:25:43.362638+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.19827","citing_title":"High-Accuracy and Efficient DV-Hop Localization for IoT Using Hop Loss","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PR5BPGXE3PHDKWEHTZTX42CG7C","json":"https://pith.science/pith/PR5BPGXE3PHDKWEHTZTX42CG7C.json","graph_json":"https://pith.science/api/pith-number/PR5BPGXE3PHDKWEHTZTX42CG7C/graph.json","events_json":"https://pith.science/api/pith-number/PR5BPGXE3PHDKWEHTZTX42CG7C/events.json","paper":"https://pith.science/paper/PR5BPGXE"},"agent_actions":{"view_html":"https://pith.science/pith/PR5BPGXE3PHDKWEHTZTX42CG7C","download_json":"https://pith.science/pith/PR5BPGXE3PHDKWEHTZTX42CG7C.json","view_paper":"https://pith.science/paper/PR5BPGXE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.20883&json=true","fetch_graph":"https://pith.science/api/pith-number/PR5BPGXE3PHDKWEHTZTX42CG7C/graph.json","fetch_events":"https://pith.science/api/pith-number/PR5BPGXE3PHDKWEHTZTX42CG7C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PR5BPGXE3PHDKWEHTZTX42CG7C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PR5BPGXE3PHDKWEHTZTX42CG7C/action/storage_attestation","attest_author":"https://pith.science/pith/PR5BPGXE3PHDKWEHTZTX42CG7C/action/author_attestation","sign_citation":"https://pith.science/pith/PR5BPGXE3PHDKWEHTZTX42CG7C/action/citation_signature","submit_replication":"https://pith.science/pith/PR5BPGXE3PHDKWEHTZTX42CG7C/action/replication_record"}},"created_at":"2026-07-05T08:25:43.362638+00:00","updated_at":"2026-07-05T08:25:43.362638+00:00"}