{"paper":{"title":"Determinant Maximization via Matroid Intersection Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Brown, Aditi Laddha, Madhusudhan Pittu, Mohit Singh, Prasad Tetali","submitted_at":"2022-07-09T18:30:17Z","abstract_excerpt":"Determinant maximization problem gives a general framework that models problems arising in as diverse fields as statistics \\cite{pukelsheim2006optimal}, convex geometry \\cite{Khachiyan1996}, fair allocations\\linebreak \\cite{anari2016nash}, combinatorics \\cite{AnariGV18}, spectral graph theory \\cite{nikolov2019proportional}, network design, and random processes \\cite{kulesza2012determinantal}. In an instance of a determinant maximization problem, we are given a collection of vectors $U=\\{v_1,\\ldots, v_n\\} \\subset \\RR^d$, and a goal is to pick a subset $S\\subseteq U$ of given vectors to maximize"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.04318","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/2207.04318/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"}