{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AVSFJEKME7MRX7UQ7LJXEV5DOA","short_pith_number":"pith:AVSFJEKM","schema_version":"1.0","canonical_sha256":"056454914c27d91bfe90fad37257a3703e80d143e01f1ebce5198a538e2732d4","source":{"kind":"arxiv","id":"2408.14018","version":1},"attestation_state":"computed","paper":{"title":"Quantum Speedups for Approximating the John Ellipsoid","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Junwei Yu, Xiaoyu Li, Zhao Song","submitted_at":"2024-08-26T05:06:39Z","abstract_excerpt":"In 1948, Fritz John proposed a theorem stating that every convex body has a unique maximal volume inscribed ellipsoid, known as the John ellipsoid. The John ellipsoid has become fundamental in mathematics, with extensive applications in high-dimensional sampling, linear programming, and machine learning. Designing faster algorithms to compute the John ellipsoid is therefore an important and emerging problem. In [Cohen, Cousins, Lee, Yang COLT 2019], they established an algorithm for approximating the John ellipsoid for a symmetric convex polytope defined by a matrix $A \\in \\mathbb{R}^{n \\times"},"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":"2408.14018","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-08-26T05:06:39Z","cross_cats_sorted":[],"title_canon_sha256":"5ec29a729f2101340124fc2ce31554606df8d986a8f37241c690ec7461543341","abstract_canon_sha256":"ccdc3c9abe90f920e3b151027c2cac326b0f4298434a60c8ec9f4a43bc23aa8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:59:14.995968Z","signature_b64":"oBnj10kNe72424ZNhCQmTpcT9UBZ/caM52hC8SrIyaoNJpzDUlXrul/Irfw5FoyoAqMJ0SWUAbeOOZlFsFlDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"056454914c27d91bfe90fad37257a3703e80d143e01f1ebce5198a538e2732d4","last_reissued_at":"2026-07-05T08:59:14.995464Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:59:14.995464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Speedups for Approximating the John Ellipsoid","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Junwei Yu, Xiaoyu Li, Zhao Song","submitted_at":"2024-08-26T05:06:39Z","abstract_excerpt":"In 1948, Fritz John proposed a theorem stating that every convex body has a unique maximal volume inscribed ellipsoid, known as the John ellipsoid. The John ellipsoid has become fundamental in mathematics, with extensive applications in high-dimensional sampling, linear programming, and machine learning. Designing faster algorithms to compute the John ellipsoid is therefore an important and emerging problem. In [Cohen, Cousins, Lee, Yang COLT 2019], they established an algorithm for approximating the John ellipsoid for a symmetric convex polytope defined by a matrix $A \\in \\mathbb{R}^{n \\times"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.14018","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/2408.14018/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":"2408.14018","created_at":"2026-07-05T08:59:14.995525+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.14018v1","created_at":"2026-07-05T08:59:14.995525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.14018","created_at":"2026-07-05T08:59:14.995525+00:00"},{"alias_kind":"pith_short_12","alias_value":"AVSFJEKME7MR","created_at":"2026-07-05T08:59:14.995525+00:00"},{"alias_kind":"pith_short_16","alias_value":"AVSFJEKME7MRX7UQ","created_at":"2026-07-05T08:59:14.995525+00:00"},{"alias_kind":"pith_short_8","alias_value":"AVSFJEKM","created_at":"2026-07-05T08:59:14.995525+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.00688","citing_title":"High-Order Matching for One-Step Shortcut Diffusion Models","ref_index":45,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AVSFJEKME7MRX7UQ7LJXEV5DOA","json":"https://pith.science/pith/AVSFJEKME7MRX7UQ7LJXEV5DOA.json","graph_json":"https://pith.science/api/pith-number/AVSFJEKME7MRX7UQ7LJXEV5DOA/graph.json","events_json":"https://pith.science/api/pith-number/AVSFJEKME7MRX7UQ7LJXEV5DOA/events.json","paper":"https://pith.science/paper/AVSFJEKM"},"agent_actions":{"view_html":"https://pith.science/pith/AVSFJEKME7MRX7UQ7LJXEV5DOA","download_json":"https://pith.science/pith/AVSFJEKME7MRX7UQ7LJXEV5DOA.json","view_paper":"https://pith.science/paper/AVSFJEKM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.14018&json=true","fetch_graph":"https://pith.science/api/pith-number/AVSFJEKME7MRX7UQ7LJXEV5DOA/graph.json","fetch_events":"https://pith.science/api/pith-number/AVSFJEKME7MRX7UQ7LJXEV5DOA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AVSFJEKME7MRX7UQ7LJXEV5DOA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AVSFJEKME7MRX7UQ7LJXEV5DOA/action/storage_attestation","attest_author":"https://pith.science/pith/AVSFJEKME7MRX7UQ7LJXEV5DOA/action/author_attestation","sign_citation":"https://pith.science/pith/AVSFJEKME7MRX7UQ7LJXEV5DOA/action/citation_signature","submit_replication":"https://pith.science/pith/AVSFJEKME7MRX7UQ7LJXEV5DOA/action/replication_record"}},"created_at":"2026-07-05T08:59:14.995525+00:00","updated_at":"2026-07-05T08:59:14.995525+00:00"}