{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BXFP4BX6EZ6MVDBLGEOEI4NVTG","short_pith_number":"pith:BXFP4BX6","schema_version":"1.0","canonical_sha256":"0dcafe06fe267cca8c2b311c4471b59995b5b3d6ab2d287258b5df79b4a448de","source":{"kind":"arxiv","id":"1804.00106","version":1},"attestation_state":"computed","paper":{"title":"On Equivalence and Computational Efficiency of the Major Relaxation Methods for Minimum Ellipsoid Containing the Intersection of Ellipsoids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Xiaojing Shen, Yunmin Zhu, Zhiguo Wang","submitted_at":"2018-03-31T02:26:23Z","abstract_excerpt":"This paper investigates the problem on the minimum ellipsoid containing the intersection of multiple ellipsoids, which has been extensively applied to information science, target tracking and data fusion etc. There are three major relaxation methods involving SDP relaxation, S-procedure relaxation and bounding ellipsoid relaxation, which are derived by different ideas or viewpoints. However, it is unclear for the interrelationships among these methods. This paper reveals the equivalence among the three relaxation methods by three stages. Firstly, the SDP relaxation method can be equivalently s"},"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":"1804.00106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-31T02:26:23Z","cross_cats_sorted":[],"title_canon_sha256":"23e4d94167d9bc7994cf8a53fdd2b411874c13bccd191816e1a771b1f5a78641","abstract_canon_sha256":"3bfa1102f275024ae3e4e1169f076236e4acaa29aa2c6c9fdf9bf847e33d63c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:38.363417Z","signature_b64":"RXX1iqvbjkfgSGhFVbrrB9OPCaCMq1v08krf+ioBfxTu/Fh+kpU5NFLLkZWeicZoX360vswe+/CMoyczS+wcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0dcafe06fe267cca8c2b311c4471b59995b5b3d6ab2d287258b5df79b4a448de","last_reissued_at":"2026-05-18T00:19:38.362912Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:38.362912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Equivalence and Computational Efficiency of the Major Relaxation Methods for Minimum Ellipsoid Containing the Intersection of Ellipsoids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Xiaojing Shen, Yunmin Zhu, Zhiguo Wang","submitted_at":"2018-03-31T02:26:23Z","abstract_excerpt":"This paper investigates the problem on the minimum ellipsoid containing the intersection of multiple ellipsoids, which has been extensively applied to information science, target tracking and data fusion etc. There are three major relaxation methods involving SDP relaxation, S-procedure relaxation and bounding ellipsoid relaxation, which are derived by different ideas or viewpoints. However, it is unclear for the interrelationships among these methods. This paper reveals the equivalence among the three relaxation methods by three stages. Firstly, the SDP relaxation method can be equivalently s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00106","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.00106","created_at":"2026-05-18T00:19:38.362984+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.00106v1","created_at":"2026-05-18T00:19:38.362984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00106","created_at":"2026-05-18T00:19:38.362984+00:00"},{"alias_kind":"pith_short_12","alias_value":"BXFP4BX6EZ6M","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BXFP4BX6EZ6MVDBL","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BXFP4BX6","created_at":"2026-05-18T12:32:16.446611+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/BXFP4BX6EZ6MVDBLGEOEI4NVTG","json":"https://pith.science/pith/BXFP4BX6EZ6MVDBLGEOEI4NVTG.json","graph_json":"https://pith.science/api/pith-number/BXFP4BX6EZ6MVDBLGEOEI4NVTG/graph.json","events_json":"https://pith.science/api/pith-number/BXFP4BX6EZ6MVDBLGEOEI4NVTG/events.json","paper":"https://pith.science/paper/BXFP4BX6"},"agent_actions":{"view_html":"https://pith.science/pith/BXFP4BX6EZ6MVDBLGEOEI4NVTG","download_json":"https://pith.science/pith/BXFP4BX6EZ6MVDBLGEOEI4NVTG.json","view_paper":"https://pith.science/paper/BXFP4BX6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.00106&json=true","fetch_graph":"https://pith.science/api/pith-number/BXFP4BX6EZ6MVDBLGEOEI4NVTG/graph.json","fetch_events":"https://pith.science/api/pith-number/BXFP4BX6EZ6MVDBLGEOEI4NVTG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BXFP4BX6EZ6MVDBLGEOEI4NVTG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BXFP4BX6EZ6MVDBLGEOEI4NVTG/action/storage_attestation","attest_author":"https://pith.science/pith/BXFP4BX6EZ6MVDBLGEOEI4NVTG/action/author_attestation","sign_citation":"https://pith.science/pith/BXFP4BX6EZ6MVDBLGEOEI4NVTG/action/citation_signature","submit_replication":"https://pith.science/pith/BXFP4BX6EZ6MVDBLGEOEI4NVTG/action/replication_record"}},"created_at":"2026-05-18T00:19:38.362984+00:00","updated_at":"2026-05-18T00:19:38.362984+00:00"}