{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PJCRSNCBY5AKNTHGMSQPKTB3OW","short_pith_number":"pith:PJCRSNCB","schema_version":"1.0","canonical_sha256":"7a45193441c740a6cce664a0f54c3b75b338a7aeb68c68dd40db57dd664231ec","source":{"kind":"arxiv","id":"2411.03617","version":1},"attestation_state":"computed","paper":{"title":"Efficient Data-Driven Leverage Score Sampling Algorithm for the Minimum Volume Covering Ellipsoid Problem in Big Data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"math.OC","authors_text":"Ali Eshragh, Bishnu Lamichhane, Elizabeth Harris, Elizabeth Stojanovski, Jordan Shaw-Carmody","submitted_at":"2024-11-06T02:21:11Z","abstract_excerpt":"The Minimum Volume Covering Ellipsoid (MVCE) problem, characterised by $n$ observations in $d$ dimensions where $n \\gg d$, can be computationally very expensive in the big data regime. We apply methods from randomised numerical linear algebra to develop a data-driven leverage score sampling algorithm for solving MVCE, and establish theoretical error bounds and a convergence guarantee. Assuming the leverage scores follow a power law decay, we show that the computational complexity of computing the approximation for MVCE is reduced from $\\mathcal{O}(nd^2)$ to $\\mathcal{O}(nd + \\text{poly}(d))$, "},"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":"2411.03617","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-11-06T02:21:11Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"5868cce5d63bd11cc21dbde016f554e6d2deb5761a2a9607835e7ccbf3d3a8ce","abstract_canon_sha256":"e2b6cbe69a4f60261e11647ad66d802198c032178e8612fd710b3de89a21b2c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:31:53.114268Z","signature_b64":"RRA27+K0zvzibuhxe+rwVg2JfpKSVfqnN3JPrC0ORYf+xioD+F2Mrb8pzwYoYNgC1PgOxw8WWJgTy/9NYrBqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a45193441c740a6cce664a0f54c3b75b338a7aeb68c68dd40db57dd664231ec","last_reissued_at":"2026-07-05T09:31:53.113765Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:31:53.113765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Data-Driven Leverage Score Sampling Algorithm for the Minimum Volume Covering Ellipsoid Problem in Big Data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"math.OC","authors_text":"Ali Eshragh, Bishnu Lamichhane, Elizabeth Harris, Elizabeth Stojanovski, Jordan Shaw-Carmody","submitted_at":"2024-11-06T02:21:11Z","abstract_excerpt":"The Minimum Volume Covering Ellipsoid (MVCE) problem, characterised by $n$ observations in $d$ dimensions where $n \\gg d$, can be computationally very expensive in the big data regime. We apply methods from randomised numerical linear algebra to develop a data-driven leverage score sampling algorithm for solving MVCE, and establish theoretical error bounds and a convergence guarantee. Assuming the leverage scores follow a power law decay, we show that the computational complexity of computing the approximation for MVCE is reduced from $\\mathcal{O}(nd^2)$ to $\\mathcal{O}(nd + \\text{poly}(d))$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.03617","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/2411.03617/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":"2411.03617","created_at":"2026-07-05T09:31:53.113825+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.03617v1","created_at":"2026-07-05T09:31:53.113825+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.03617","created_at":"2026-07-05T09:31:53.113825+00:00"},{"alias_kind":"pith_short_12","alias_value":"PJCRSNCBY5AK","created_at":"2026-07-05T09:31:53.113825+00:00"},{"alias_kind":"pith_short_16","alias_value":"PJCRSNCBY5AKNTHG","created_at":"2026-07-05T09:31:53.113825+00:00"},{"alias_kind":"pith_short_8","alias_value":"PJCRSNCB","created_at":"2026-07-05T09:31:53.113825+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/PJCRSNCBY5AKNTHGMSQPKTB3OW","json":"https://pith.science/pith/PJCRSNCBY5AKNTHGMSQPKTB3OW.json","graph_json":"https://pith.science/api/pith-number/PJCRSNCBY5AKNTHGMSQPKTB3OW/graph.json","events_json":"https://pith.science/api/pith-number/PJCRSNCBY5AKNTHGMSQPKTB3OW/events.json","paper":"https://pith.science/paper/PJCRSNCB"},"agent_actions":{"view_html":"https://pith.science/pith/PJCRSNCBY5AKNTHGMSQPKTB3OW","download_json":"https://pith.science/pith/PJCRSNCBY5AKNTHGMSQPKTB3OW.json","view_paper":"https://pith.science/paper/PJCRSNCB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.03617&json=true","fetch_graph":"https://pith.science/api/pith-number/PJCRSNCBY5AKNTHGMSQPKTB3OW/graph.json","fetch_events":"https://pith.science/api/pith-number/PJCRSNCBY5AKNTHGMSQPKTB3OW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PJCRSNCBY5AKNTHGMSQPKTB3OW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PJCRSNCBY5AKNTHGMSQPKTB3OW/action/storage_attestation","attest_author":"https://pith.science/pith/PJCRSNCBY5AKNTHGMSQPKTB3OW/action/author_attestation","sign_citation":"https://pith.science/pith/PJCRSNCBY5AKNTHGMSQPKTB3OW/action/citation_signature","submit_replication":"https://pith.science/pith/PJCRSNCBY5AKNTHGMSQPKTB3OW/action/replication_record"}},"created_at":"2026-07-05T09:31:53.113825+00:00","updated_at":"2026-07-05T09:31:53.113825+00:00"}