{"total":14,"rows":[{"id":"2509.18383","title":"G\\\"odel Test: Can Large Language Models Solve Easy Conjectures?","created":"2025-09-22","cited_by_count":5,"area":null},{"id":"2405.13994","title":"Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint","created":"2024-05-22","cited_by_count":3,"area":null},{"id":"2602.20578","title":"Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets","created":"2026-02-24","cited_by_count":3,"area":null},{"id":"2312.14299","title":"Fairness in Submodular Maximization over a Matroid Constraint","created":"2023-12-21","cited_by_count":2,"area":null},{"id":"2401.09251","title":"Bridging the Gap Between General and Down-Closed Convex Sets in Submodular Maximization","created":"2024-01-17","cited_by_count":1,"area":null},{"id":"2405.18754","title":"GIST: Greedy Independent Set Thresholding for Max-Min Diversification with Submodular Utility","created":"2024-05-29","cited_by_count":1,"area":null},{"id":"2510.21128","title":"A Unified Approach to Submodular Maximization Under Noise","created":"2025-10-24","cited_by_count":1,"area":null},{"id":"2511.12097","title":"Sparse by Rule: Probability-Based N:M Pruning for Spiking Neural Networks","created":"2025-11-15","cited_by_count":1,"area":null},{"id":"2601.00611","title":"Stronger Approximation Guarantees for Non-Monotone {\\gamma}-Weakly DR-Submodular Maximization","created":"2026-01-02","cited_by_count":1,"area":null},{"id":"2609.02145","title":"Online Non-Monotone DR-Submodular Maximization Matching the Offline $0.401$ Factor","created":"2026-09-02","cited_by_count":1,"area":null},{"id":"2410.08578","title":"Logarithmic Regret for Unconstrained Submodular Maximization Stochastic Bandit","created":"2024-10-11","cited_by_count":0,"area":null},{"id":"2511.02254","title":"Fast Approximation Algorithm for Non-Monotone DR-submodular Maximization under Size Constraint","created":"2025-11-04","cited_by_count":0,"area":null},{"id":"2605.07902","title":"Curvature Beyond Positivity: Greedy Guarantees for Arbitrary Submodular Functions","created":"2026-05-08","cited_by_count":0,"area":null},{"id":"2610.18514","title":"Approximating Optimal Policies in Heterogeneous Asynchronous Multi-player Bandits","created":"2026-10-13","cited_by_count":0,"area":null}],"next_cursor":null}