{"_canonicalization":{"envelope_id":"axm_ + sha256(envelope minus {signature, axiom_id, anchors})","envelope_signature":"ed25519(envelope minus {signature, axiom_id})","json":"sort_keys=True, separators=(',',':'), ensure_ascii=False, allow_nan=False, utf-8","leaf_hash":"sha256(0x00 || canonical_json(envelope_full))","seal_signature":"ed25519(seal minus {signature, sig_algorithm})"},"axiom_id":"axm_a1ed52fcb339d8564cdbc74da960d40fe1af3a19b0619614cdcb5317fded4a2c","bitcoin_anchor":{"bitcoin_attestations":[],"calendar_attestations":[],"ots_url":"","stamped_at":"","status":"pending_next_stamp"},"envelope":{"anchors":[{"chain":"crovia.axiom_graph","height":0,"merkle_proof":"spider_arxiv_retraction_v1","root_at_anchor":"spider_arxiv_retraction_v1"}],"axiom_id":"axm_a1ed52fcb339d8564cdbc74da960d40fe1af3a19b0619614cdcb5317fded4a2c","axiom_type":"AX.OBS","body":{"axiom_subtype":"research.arxiv_retraction.v1","category":"research","fingerprint":"651d82d5cff5cd5ad29731fedba1fbc2de95a3a14efab150cc1d4213c0b16b8a","published":"2026-06-10T14:17:08Z","receipt_hash":"651d82d5cff5cd5ad29731fedba1fbc2de95a3a14efab150cc1d4213c0b16b8a","schema":"spider.research.arxiv_retraction.v1","spider":"arxiv_retraction","spider_record":{"axiom_subtype":"research.arxiv_retraction.v1","category":"research","decision_hint":"POSITIVE","envelope_target":"AX.OBS","fingerprint":"651d82d5cff5cd5ad29731fedba1fbc2de95a3a14efab150cc1d4213c0b16b8a","observed_at":"2026-06-23T05:54:07.496614Z","parent_run_hash":"5aa40f87be3fe044b106b71291eabc8ead88c427dae8df5d21c37f7911112a12","published":"2026-06-10T14:17:08Z","runtime_version":"0.1.0","schema":"spider.research.arxiv_retraction.v1","source_status":200,"source_url":"http://export.arxiv.org/api/query?search_query=cat:cs.LG+AND+%28abs:withdrawn+OR+abs:retracted%29&max_results=20&sortBy=submittedDate&sortOrder=descending","spider":"arxiv_retraction","summary_excerpt":"Low-rank optimal transport (OT) mitigates the quadratic scaling of classical solvers, yet existing approaches rely heavily on first-order mirror-descent updates that require careful hyperparameter tuning and ignore the optimization landscape's curvature. To address these limitations, we propose a unified Riemannian geometric framework for low-rank OT, modeling balanced and unbalanced rank-$r$ positive factored couplings as novel smooth embedded submanifolds of the positive orthant. By equipping these manifolds with the Fisher-Rao product metric, we derive tractable formulations for Riemannian projectors, retractions, and Hessian-vector products. Our cost-agnostic framework seamlessly extends to linear OT, Gromov-Wasserstein (GW), fused GW, and their unbalanced counterparts. For balanced OT, our geometric ingredients are computed via efficient conjugate-gradient and iterative Bregman updates. For the unbalanced OT, our operations elegantly reduce to closed-form scalings, completely elim","title":"A Riemannian Approach to Low-Rank Optimal Transport","url":"https://arxiv.org/pdf/2606.12120v2","vendor":"arxiv"},"summary":"Low-rank optimal transport (OT) mitigates the quadratic scaling of classical solvers, yet existing approaches rely heavily on first-order mirror-descent updates that require careful hyperparameter tuning and ignore the optimization landscape's curvature. To address these limitations, we propose a unified Riemannian geometric framework for low-rank OT, modeling balanced and unbalanced rank-$r$ positive factored couplings as novel smooth embedded submanifolds of the positive orthant. By equipping these manifolds with the Fisher-Rao product metric, we derive tractable formulations for Riemannian projectors, retractions, and Hessian-vector products. Our cost-agnostic framework seamlessly extends to linear OT, Gromov-Wasserstein (GW), fused GW, and their unbalanced counterparts. For balanced OT, our geometric ingredients are computed via efficient conjugate-gradient and iterative Bregman updates. For the unbalanced OT, our operations elegantly reduce to closed-form scalings, completely elim","title":"A Riemannian Approach to Low-Rank Optimal Transport","vendor":"arxiv"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-06-23T05:54:07Z","notes":"Spider arxiv_retraction (research) research.arxiv_retraction.v1","object":{"captured_by":"crovia.spider.arxiv_retraction","primary_source_url":"https://arxiv.org/pdf/2606.12120v2"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:606ab3e781a977361291882c8ff5c29a605f810baa9d64234b622d61945ec55667b24e012e06e826b898a3c5196c04e3682648154683de46098f666cf197b20b","signer":"crovia.substrate","subject":{"observed_at":"2026-06-23T05:54:07Z","source_collector":"spider:arxiv_retraction","target_id":"https://arxiv.org/pdf/2606.12120v2"},"tsa":{"authority":"crovia.substrate.bootstrap","rfc3161_token":"{\"kind\":\"crovia.bootstrap.tsa\",\"source_jsonl\":\"/opt/crovia/spider/data/research/arxiv_retraction_v1.jsonl\",\"source_seal_merkle_root\":\"spider_arxiv_retraction_v1\",\"upgrade_path\":\"Sessione H \\u2014 OpenTimestamps weekly anchor\"}"},"zk_mode":"clear","zk_proof":null},"ledger":{"leaf_hash":"8e524f84fc774cc33ff20932332198bb60c35362ed50176f5121053fda6d2400","leaf_index":241114,"ledger_path":"/opt/crovia/substrate/axiom_ledger.jsonl"},"merkle_proof":{"hash_alg":"sha256","leaf_prefix":"0x00","node_prefix":"0x01","odd_leaf_rule":"duplicate_last","path":[{"sibling":"d7bd1387da861945ae59b7ec61e2567001c1ad1932f55af708ea9b7b38df0e51","side":"right"},{"sibling":"efd12c5453b82ae052267e60210c82bf8f8575bdbf3c6ff589ab2804b0ef38ef","side":"left"},{"sibling":"2052c5988d9129f23f159e2b929ed5de523400c4011cb3efd3bc59838ed9ec82","side":"right"},{"sibling":"51358d1d5f5b0cea17d916fd9b961677888a2fdd768d878c1894ae8a8e952dc8","side":"left"},{"sibling":"510852d058b61715d621ec2f2e642f9324f1da2c8d97c48c1fb38ef0662d1eba","side":"left"},{"sibling":"9ddf4d4e62871b7b91b404ec66f8dc97f2dbd13160499ff0244174d6112575ee","side":"right"},{"sibling":"ac00a5b87bd062a3e32914bf26f6c6d95ec3dd935857ca4179de00c9ef7899e8","side":"left"},{"sibling":"44f146585efcc319743e0391baf03a68911abab40952701f82d25b817c9ffca5","side":"left"},{"sibling":"4a95601b6f7da1b2907d5f5701dac4344da73cb5185d03d84fb3a8324b07d40d","side":"left"},{"sibling":"ef58c215f521eb9d7cf13d6eab3c830b42897d036b5d754714b02f96b01e88b4","side":"right"},{"sibling":"f229236af6c533409ea4443e4967e4e145f4a5c63ffdaf22ec290666d3496ff8","side":"left"},{"sibling":"2f8979aa68b81a78cd2034e1fd02e22cb71de5fecfa58acae20d2393d1be8556","side":"left"},{"sibling":"dc006cb569510cc5030759ea38318db133d09292c5016d187b95b78b7735f1f8","side":"right"},{"sibling":"3a42039065acac6d3e4088ec61d9c116ecf7a26c7b7163d23da8fd0b3362e038","side":"left"},{"sibling":"a116bb92f9b0350491155b470acc86d006c33ec558759e49e56614a54c39f242","side":"right"},{"sibling":"a04392fb9f2a3a620840e3b3fecd93d12e6d224e481c162389d8ae64e7194599","side":"left"},{"sibling":"c300cf0154c136afc09b1702a0be98f4ba5b6dc5cf57e8cc714ec1eaf4196eff","side":"left"},{"sibling":"d841ad93efda0869e5eb97678f348f03f5caab4353e05ff4bf18f47fb945b822","side":"left"}]},"schema":"crovia.axiom_proof.v1","seal":{"first_collector_run_id":"","first_receipt_hash":"","jsonl_path":"/opt/crovia/substrate/axiom_ledger.jsonl","key_id":"430895f101d38164","last_collector_run_id":"","last_receipt_hash":"","leaf_count":241122,"merkle_root":"7a906c6a26ff6c6feabc2feaba6a1a70c515e6fd72a38c779293b0f78ff291c4","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260622T183701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-06-23T06:25:25Z","sig_algorithm":"ed25519","signature":"5576b1d56d5dbb0d96c780fa3ca0940d805c8de95c6251bc87297f0be058aa5e37eb53a6aa1b601381f489f093842cf674b28737ed8e46ce3a49814b5e57290c","signer_version":"1.1.0"},"trust_root":{"key_id":"430895f101d38164","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","signature_algorithm":"ed25519","url":"/registry/canon/TRUST_ROOT.md"},"verifier":{"spec":"/registry/canon/AXIOM_RECEIPT_v1.md","url":"/v/axm_a1ed52fcb339d8564cdbc74da960d40fe1af3a19b0619614cdcb5317fded4a2c"}}