| { |
| "conference": "SODA_2026", |
| "paper_count": 142, |
| "question_count": 290, |
| "papers": [ |
| { |
| "paper_id": "-approximation_algorithm_general", |
| "title": "A $(2 + \\epsilon)$-approximation algorithm for the general scheduling problem in quasipolynomial time", |
| "num_questions": 3, |
| "source_dag_sha256": "bf876eb0802a3e273c941fcd2ec2c8a08e83a62c795cd17c862d02db1a723b85" |
| }, |
| { |
| "paper_id": "algebraic_closure_matrix", |
| "title": "Algebraic Closure of Matrix Sets Recognized by 1-VASS", |
| "num_questions": 0, |
| "source_dag_sha256": "5c80f4bb8cd457556e40e30188fe2e89df73ccd916ec08fef7fcf8d901eb95a7" |
| }, |
| { |
| "paper_id": "algorithmic_improvements_list", |
| "title": "Algorithmic Improvements to List Decoding of Folded Reed-Solomon Codes", |
| "num_questions": 2, |
| "source_dag_sha256": "d215f4ecc399ad6f533947dbc0695fbf10c633066638e1214aaabfcf0e8afccf" |
| }, |
| { |
| "paper_id": "algorithms_lower_bounds", |
| "title": "Algorithms and Lower Bounds for the Maximum Overlap of Two Polygons Under Translation", |
| "num_questions": 2, |
| "source_dag_sha256": "7cb8a7874f853bc7d065e063f3653449eeed8065b1aa6fe80328af4b75c331d3" |
| }, |
| { |
| "paper_id": "almost_perfect_discrete", |
| "title": "(Almost) Perfect Discrete Iterative Load Balancing", |
| "num_questions": 1, |
| "source_dag_sha256": "72315c15bd3cc777b17451b24128ab7ed34c4049bb38f6adad8fee34a47cd77b" |
| }, |
| { |
| "paper_id": "approaching_optimality_solving", |
| "title": "Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure", |
| "num_questions": 3, |
| "source_dag_sha256": "daa65fdc195d1fa686167c0a75af3413e621d4e8a3f6e7d82eab966e19d08cdf" |
| }, |
| { |
| "paper_id": "approximate_counting_permutation", |
| "title": "Approximate Counting of Permutation Patterns", |
| "num_questions": 1, |
| "source_dag_sha256": "ff33c620e64e58514abbac48e636874fdc16a3d745dd2f4bb2673e02e08c0502" |
| }, |
| { |
| "paper_id": "approximate_light_spanners", |
| "title": "Approximate Light Spanners in Planar Graphs", |
| "num_questions": 2, |
| "source_dag_sha256": "2adb952c328af79b999d89fb417058697990dacc9a448f60f1b983dde8896ac8" |
| }, |
| { |
| "paper_id": "approximately_dominating_sets", |
| "title": "Approximately Dominating Sets in Elections", |
| "num_questions": 1, |
| "source_dag_sha256": "9a4fda9ea00b3f26581b0f9ab55eb9ec84226c58ffb67219212ec95180a8f0cd" |
| }, |
| { |
| "paper_id": "approximating_matroid_basis", |
| "title": "Approximating Matroid Basis Testing for Partition Matroids using Budget-In-Expectation", |
| "num_questions": 2, |
| "source_dag_sha256": "f25017eb0c0cc5e5fcea865253916bfa8c53a034787b0963d75967311c7bbb3e" |
| }, |
| { |
| "paper_id": "balls_bins_infinite", |
| "title": "Balls and Bins and the Infinite Process with Random Deletions", |
| "num_questions": 2, |
| "source_dag_sha256": "baafa772032fe7197a4284f5a9d3063aba3c5c3cfba1addb0dcd57f3e1ae78cc" |
| }, |
| { |
| "paper_id": "better-than-2_approximation_directed", |
| "title": "A Better-Than-2 Approximation for the Directed Tree Augmentation Problem", |
| "num_questions": 3, |
| "source_dag_sha256": "f8695354a0ba703f6a6b2aa4a80db6b8153221714ec33fa925109693f078cfc5" |
| }, |
| { |
| "paper_id": "block_size_matter", |
| "title": "Does block size matter in randomized block Krylov low-rank approximation?", |
| "num_questions": 3, |
| "source_dag_sha256": "76c94b133e39458cdf811f5376dc90b2ce6aaad04bb83119378f2082d2ce923b" |
| }, |
| { |
| "paper_id": "braiding_vineyards", |
| "title": "Braiding Vineyards", |
| "num_questions": 2, |
| "source_dag_sha256": "6473f734d2a07d3207e4c1f61b6581d346a5e9afd907901c81add8fac29f92a0" |
| }, |
| { |
| "paper_id": "broader_view_clustering", |
| "title": "A Broader View on Clustering under Cluster-Aware Norm Objectives", |
| "num_questions": 2, |
| "source_dag_sha256": "f3cf4ff8034023fab019339f5b8add8f02aea066c3cef975579dcd73e3e3dca7" |
| }, |
| { |
| "paper_id": "burling_graphs_graphs", |
| "title": "BURLING GRAPHS IN GRAPHS WITH LARGE CHROMATIC NUMBER", |
| "num_questions": 0, |
| "source_dag_sha256": "eaddae67ef4009938c95b99913296b4afe2d94df37959045e403b8013583c03e" |
| }, |
| { |
| "paper_id": "catching_rats_h-minor-free", |
| "title": "Catching Rats in $H$-minor-free Graphs", |
| "num_questions": 3, |
| "source_dag_sha256": "c6529fa5affdc94ee243889d3f5622f46f10773fc6b213fd0a9302ed848a92fc" |
| }, |
| { |
| "paper_id": "cell-probe_lower_bounds", |
| "title": "Cell-Probe Lower Bounds via Semi-Random CSP Refutation: Simplified and the Odd-Locality Case", |
| "num_questions": 3, |
| "source_dag_sha256": "f8ff06c892e922f73cd1d4c39282bbc02edc8fb4df76107d47769ab8c79b5361" |
| }, |
| { |
| "paper_id": "centered_colorings_minor-closed", |
| "title": "CENTERED COLORINGS IN MINOR-CLOSED GRAPH CLASSES", |
| "num_questions": 3, |
| "source_dag_sha256": "9e3ff907b7e173415536e3bd6aa05d49fdb35155d837f5748002e75c646aa8c8" |
| }, |
| { |
| "paper_id": "cfg_dnnf_admit", |
| "title": "#CFG and #DNNF admit FPRAS", |
| "num_questions": 2, |
| "source_dag_sha256": "f78a33ee44c305fe1fc40726de26191bb1a2c83ebe9a22a9b313cc547de3085f" |
| }, |
| { |
| "paper_id": "classification_long-refinement_graphs", |
| "title": "A Classification of Long-Refinement Graphs for Colour Refinement", |
| "num_questions": 2, |
| "source_dag_sha256": "a0712b2fd749ad3eb85ec2e50d01fd1774f65eba1634664c5574d8284d078fc1" |
| }, |
| { |
| "paper_id": "coloring_3-colorable_graphs", |
| "title": "Coloring 3-Colorable Graphs with Low Threshold Rank", |
| "num_questions": 2, |
| "source_dag_sha256": "9df9ba0aeb0bf22512b197834d8d1033db8a09748727424619eb3b2ed65070f5" |
| }, |
| { |
| "paper_id": "combinatorial_philosopher_inequalities", |
| "title": "Combinatorial Philosopher Inequalities", |
| "num_questions": 3, |
| "source_dag_sha256": "1430bc6e034667456d21954d76eecee560dbbe3447834ef783818854722926c8" |
| }, |
| { |
| "paper_id": "communication_complexity_combinatorial", |
| "title": "The Communication Complexity of Combinatorial Auctions with Additional Succinct Bidders", |
| "num_questions": 3, |
| "source_dag_sha256": "ca6db54df37b817988e0b2029c30df11503d3a6696f9638d9494f6b33df7ba5f" |
| }, |
| { |
| "paper_id": "comparison_theorems_mixing", |
| "title": "Comparison Theorems for the Mixing Times of Systematic and Random Scan Dynamics", |
| "num_questions": 3, |
| "source_dag_sha256": "e200123c6aa8b1d9000c2d2ac28d06cef5f0ef208d7fd91467c462290989f1d6" |
| }, |
| { |
| "paper_id": "compatibility_fairness_nash", |
| "title": "Compatibility of Fairness and Nash Welfare under Subadditive Valuations", |
| "num_questions": 3, |
| "source_dag_sha256": "7f470f6922ce777f28ee0e11eb67387ec5e8385c8b31b7cdda09a6568bf532a0" |
| }, |
| { |
| "paper_id": "complexity_skolem_problem", |
| "title": "On the Complexity of the Skolem Problem at Low Orders", |
| "num_questions": 3, |
| "source_dag_sha256": "6bc655ea355511bc15b7e3ed73c7b47d0fa380d32d5974f32a32688a41ef8e3c" |
| }, |
| { |
| "paper_id": "computation_schrijver_kernels", |
| "title": "On the Computation of Schrijver’s Kernels", |
| "num_questions": 0, |
| "source_dag_sha256": "eadd06809cc3c425be64c347ea04935bfd633b0cbdd6da6348fc4dc359f6b6e6" |
| }, |
| { |
| "paper_id": "computational_complexity_property", |
| "title": "Computational Complexity in Property Testing", |
| "num_questions": 1, |
| "source_dag_sha256": "14519e018e882973cd83d448f9dcf956151aa41e449375678652a9865b19a774" |
| }, |
| { |
| "paper_id": "contract_design_sequential", |
| "title": "Contract Design for Sequential Actions", |
| "num_questions": 1, |
| "source_dag_sha256": "90a413de2146cf59bb26019ddb9a883a9660f1591c30b9bded1729281e61f0a8" |
| }, |
| { |
| "paper_id": "covering_euclidean_plane", |
| "title": "Covering the Euclidean Plane by a Pair of Trees", |
| "num_questions": 3, |
| "source_dag_sha256": "12c4f546c4a6dedb42bb712a05bfddef92ac0a70aae7015ec11da16b7487d5de" |
| }, |
| { |
| "paper_id": "csp_approach_graph", |
| "title": "A CSP approach to Graph Sandwich Problems", |
| "num_questions": 0, |
| "source_dag_sha256": "07a6f9d48b0a9747a0a6cdf464d1e6124bc6b5a98eff1b747ee9005842638d1f" |
| }, |
| { |
| "paper_id": "derandomizing_pseudopolynomial_algorithms", |
| "title": "Derandomizing Pseudopolynomial Algorithms for Subset Sum", |
| "num_questions": 2, |
| "source_dag_sha256": "fec1591d67ea657262d1dc59f295a9800820cfb6c51c7bf91d128a679ff3c679" |
| }, |
| { |
| "paper_id": "deterministic_dynamic_edge", |
| "title": "Deterministic Dynamic Edge Colouring", |
| "num_questions": 1, |
| "source_dag_sha256": "380769133dbd6a1c2ebd333e88d2056e50ca7e8dd3044e864b54668ab6f1e361" |
| }, |
| { |
| "paper_id": "deterministic_polylogarithmic_competitive", |
| "title": "A Deterministic Polylogarithmic Competitive Algorithm for Matching with Delays", |
| "num_questions": 3, |
| "source_dag_sha256": "98cf7d22157ae375cf17dc31087c5f862d9c5419c6f01d8ba8882d5a10f4fa64" |
| }, |
| { |
| "paper_id": "deterministically_finding_element", |
| "title": "ON DETERMINISTICALLY FINDING AN ELEMENT OF HIGH ORDER MODULO A COMPOSITE", |
| "num_questions": 3, |
| "source_dag_sha256": "cadfb791c01cab6fea3343ea08b3d431d9bfe3984e778a42653c5e7d1ac932ef" |
| }, |
| { |
| "paper_id": "dichotomy_orderings", |
| "title": "Dichotomy for orderings?", |
| "num_questions": 0, |
| "source_dag_sha256": "79cb192fbe8f942b6a5fdc48aabdce335f83210910d41ed51df542923bf969ab" |
| }, |
| { |
| "paper_id": "differentially_private_algorithms", |
| "title": "Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More", |
| "num_questions": 3, |
| "source_dag_sha256": "bca94265671587627a433f4b68f7459d2fb08f4bd81f009effeb0f2d3d29e67e" |
| }, |
| { |
| "paper_id": "differentially_private_quasi-concave", |
| "title": "Differentially Private Quasi-Concave Optimization: Bypassing the Lower Bound and Application to Geometric Problems", |
| "num_questions": 3, |
| "source_dag_sha256": "35eab707c39e9d48400219a53478cb7d06896a52e950f716ab9ddf75237bb5fc" |
| }, |
| { |
| "paper_id": "directed_disjoint_paths", |
| "title": "The Directed Disjoint Paths Problem with Congestion", |
| "num_questions": 2, |
| "source_dag_sha256": "01849c7af9004a598e6d7fa8be2aed914bd1dc85412083ef398634f38e5128d6" |
| }, |
| { |
| "paper_id": "disjoint_paths_expanders", |
| "title": "Disjoint Paths in Expanders in Deterministic Almost-Linear Time via Hypergraph Perfect Matching", |
| "num_questions": 1, |
| "source_dag_sha256": "011494752958c77234a2a5a85fc00127a5de5190049c23eb1b39719f6e67c208" |
| }, |
| { |
| "paper_id": "distributed_interactive_proofs", |
| "title": "Distributed Interactive Proofs for Planarity with Log-Star Communication", |
| "num_questions": 2, |
| "source_dag_sha256": "e02cd2d29b6370b4ddec860c832e2269c9efcb11f09168c9c8659f8a7e1f940d" |
| }, |
| { |
| "paper_id": "downward_self-reducibility_total", |
| "title": "Downward self-reducibility in the total function polynomial hierarchy", |
| "num_questions": 1, |
| "source_dag_sha256": "035a4515f05dc0bda3c5f57f11f3a4e35a405054d3b97890809216c59c488daf" |
| }, |
| { |
| "paper_id": "dynamic_3d_convex", |
| "title": "Dynamic 3D Convex Hulls Revisited and Applications", |
| "num_questions": 0, |
| "source_dag_sha256": "569e3c4d1604dca34ccf30f323b674176d6150798b1bfc04f7a780f3a3747d19" |
| }, |
| { |
| "paper_id": "dynamic_connectivity_expected", |
| "title": "Dynamic Connectivity with Expected Polylogarithmic Worst-Case Update Time", |
| "num_questions": 2, |
| "source_dag_sha256": "f05e56d7051ab06a0bda011a7b70ae8cccdf464bc9f1c9b0932789ad49712f7d" |
| }, |
| { |
| "paper_id": "edge_expansion_random", |
| "title": "ON THE EDGE EXPANSION OF RANDOM POLYTOPES", |
| "num_questions": 3, |
| "source_dag_sha256": "1b4df151ad06a414ae1d312a3763e0d59d2607c0e26281c32af6cca35fae3762" |
| }, |
| { |
| "paper_id": "efficient_online_random", |
| "title": "Efficient Online Random Sampling via Randomness Recycling", |
| "num_questions": 3, |
| "source_dag_sha256": "fcb28c2654d0acc0a48b8df91d7e47abf183ae811ea5e780a049f815254731ea" |
| }, |
| { |
| "paper_id": "efficiently_constructing_sparse", |
| "title": "Efficiently Constructing Sparse Navigable Graphs", |
| "num_questions": 3, |
| "source_dag_sha256": "fec0c7cd8bf1678d0f2d50f710b23311ce8fc7f371bf94ae077494fa33f5ad46" |
| }, |
| { |
| "paper_id": "erd_s-p_sa", |
| "title": "The Erdős-Pósa property for circle graphs as vertex-minors", |
| "num_questions": 3, |
| "source_dag_sha256": "0062d55c721b3897e71289dd5b3caa264b03c9c9f4a00049e5eff44f75e23c63" |
| }, |
| { |
| "paper_id": "evasive_sets_twisted", |
| "title": "Evasive sets, twisted varieties, and container-clique trees", |
| "num_questions": 3, |
| "source_dag_sha256": "c56369c9ec36da99818c2a2a12ac1a2ee0b9c9ff91b76977055c81eccc9870b9" |
| }, |
| { |
| "paper_id": "excluding_line_minor", |
| "title": "Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance Measure", |
| "num_questions": 3, |
| "source_dag_sha256": "a65a96dc8d50dc4e11ba5b57ddfa700cfb3f6a73348a5acf5d6e07a4c0dc4226" |
| }, |
| { |
| "paper_id": "existence_fair_efficient", |
| "title": "Existence of Fair and Efficient Allocation of Indivisible Chores", |
| "num_questions": 0, |
| "source_dag_sha256": "f8db068dd0b11556e91a88782f2fa23204fb376dafb0e3b834a7afc2fd31451e" |
| }, |
| { |
| "paper_id": "expander_pruning_polylogarithmic", |
| "title": "Expander Pruning with Polylogarithmic Worst-Case Recourse and Update Time", |
| "num_questions": 3, |
| "source_dag_sha256": "cfb2303f2df9120895a5ccf4134801595176b5ec1efedac7922a28f3b12fe3c2" |
| }, |
| { |
| "paper_id": "explicit_min-wise_hash", |
| "title": "Explicit Min-wise Hash Families with Optimal Size", |
| "num_questions": 1, |
| "source_dag_sha256": "2385fd2ab3dc8d5f58ddb604987f8a8165bf5d024c351d6c2827888147536116" |
| }, |
| { |
| "paper_id": "extended_vc-dimension_radon", |
| "title": "Extended VC-dimension, and Radon and Tverberg type theorems for unions of convex sets", |
| "num_questions": 2, |
| "source_dag_sha256": "ac3a348d4823b83f090fda7f4ccd8fcec689ffaa5e0a4ff1bc218d7858352061" |
| }, |
| { |
| "paper_id": "faster_algorithms_packing", |
| "title": "Faster algorithms for packing forests in graphs and related problems", |
| "num_questions": 3, |
| "source_dag_sha256": "3e72bdf9dafaa7c64a95c4e5705accec37bf6bc9bec6f0a034018d5d03bee7e6" |
| }, |
| { |
| "paper_id": "faster_estimation_average", |
| "title": "Faster Estimation of the Average Degree of a Graph Using Random Edges and Structural Queries", |
| "num_questions": 3, |
| "source_dag_sha256": "44116dda9f643a3a11d86a3bea881a3afce09c3f0f497091d3534386a941135f" |
| }, |
| { |
| "paper_id": "faster_negative-weight_shortest", |
| "title": "Faster Negative-Weight Shortest Paths and Directed Low-Diameter Decompositions", |
| "num_questions": 2, |
| "source_dag_sha256": "b314130ab569e44ba80540067af914a381e3bb4513e1e6c8251330d35db1202c" |
| }, |
| { |
| "paper_id": "faster_negative_length", |
| "title": "Faster negative length shortest paths by bootstrapping hop reducers", |
| "num_questions": 3, |
| "source_dag_sha256": "e0ec2ce4316794505059f43381988b4ea50e1508e0ea2337f22365a1cb3351bb" |
| }, |
| { |
| "paper_id": "feature_selection_junta", |
| "title": "Feature Selection and Junta Testing are Statistically Equivalent", |
| "num_questions": 3, |
| "source_dag_sha256": "1dc73df0d12074751ede7866564be0a78c24ccb140431c42f3960fa0ade8f0ac" |
| }, |
| { |
| "paper_id": "few_good_choices", |
| "title": "A FEW GOOD CHOICES", |
| "num_questions": 3, |
| "source_dag_sha256": "355c7f4ee506db667a09c959251c229fa235f38361d6e091cc926e61dfaffd6a" |
| }, |
| { |
| "paper_id": "finding_sparse_induced", |
| "title": "Finding sparse induced subgraphs on graphs of bounded induced matching treewidth", |
| "num_questions": 2, |
| "source_dag_sha256": "c8f34a00d5b0a97832041bf9adfb9ccc58347f2ea46c5ed3f45ebc487b4b8224" |
| }, |
| { |
| "paper_id": "finite_pinwheel_scheduling", |
| "title": "Finite Pinwheel Scheduling: the k-Visits Problem", |
| "num_questions": 2, |
| "source_dag_sha256": "bb848e70791718c8023b4318a5f42b3a7bf2a6b75eec38c85c0e4266eb5d42d9" |
| }, |
| { |
| "paper_id": "generating_pivot_gray", |
| "title": "Generating pivot Gray codes for spanning trees of complete graphs in constant amortized time", |
| "num_questions": 1, |
| "source_dag_sha256": "405ba1d4fe3fe042aa3e858f32260fd4a7ecea650bf2f4309d4b1cd267638e99" |
| }, |
| { |
| "paper_id": "halfspaces_hard_test", |
| "title": "Halfspaces are hard to test with relative error", |
| "num_questions": 3, |
| "source_dag_sha256": "30183848095a315e81d27c9e2c113f061de0448c8d85da9baf5fe0136fe13b1f" |
| }, |
| { |
| "paper_id": "hallucinating_flows_optimal", |
| "title": "Hallucinating Flows for Optimal Mechanisms", |
| "num_questions": 2, |
| "source_dag_sha256": "cfd612b24e5b60611caaf1ee4b6f3ead099e024b5552c7568e09a272fe9b5605" |
| }, |
| { |
| "paper_id": "hardness_approximation_shortest", |
| "title": "Hardness of Approximation for Shortest Path with Vector Costs", |
| "num_questions": 1, |
| "source_dag_sha256": "ac1400ab6aa4113356416407de47c247eac3dd7fce7bb8793fc4ff125bb1cd0f" |
| }, |
| { |
| "paper_id": "history-independent_load_balancing", |
| "title": "History-Independent Load Balancing", |
| "num_questions": 0, |
| "source_dag_sha256": "c136d5d33d8546b5900d0de5a8890400c256907c0936e24b736d099c0eb70470" |
| }, |
| { |
| "paper_id": "improved_additive_approximation", |
| "title": "Improved Additive Approximation Algorithms for APSP", |
| "num_questions": 3, |
| "source_dag_sha256": "326358319788cd136da03aa67babaefb561c55788ed4adf87eafcacb632d8449" |
| }, |
| { |
| "paper_id": "improved_approximation_ranking", |
| "title": "Improved Approximation for Ranking on General Graphs", |
| "num_questions": 2, |
| "source_dag_sha256": "317f8fb28a1864dc40ba63f1fe82465b372e9d8e693a5a0e4adfa0494ac0fd98" |
| }, |
| { |
| "paper_id": "improved_online_algorithms", |
| "title": "Improved Online Algorithms for Inventory Management Problems with Holding and Delay Costs: Riding the Wave Makes Things Simpler, Stronger, & More General", |
| "num_questions": 0, |
| "source_dag_sha256": "1d979140bfd8b88b13eac7804ae4f68b1bf9e779f2cd9f6f4a3587a1c1b47bfe" |
| }, |
| { |
| "paper_id": "interaction_between_skew-representability", |
| "title": "Interaction between skew-representability, tensor products, extension properties, and rank inequalities", |
| "num_questions": 3, |
| "source_dag_sha256": "d367e96797ac9a18c1bfa2463b2caf60414fd39637157a2e58dcd281d3eb76ad" |
| }, |
| { |
| "paper_id": "k-sum_hardness_implies", |
| "title": "k-SUM Hardness Implies Treewidth-SETH", |
| "num_questions": 2, |
| "source_dag_sha256": "df4d71bc17c4cc86c9a982ac5300c7e89ef31771a16043e54b848d470859c784" |
| }, |
| { |
| "paper_id": "language_generation_limit", |
| "title": "Language Generation in the Limit: Noise, Loss, and Feedback", |
| "num_questions": 1, |
| "source_dag_sha256": "f7416c692729e268dc2312e649530194d4e54ebd73a6a8c1176d29ee86330159" |
| }, |
| { |
| "paper_id": "learning_echo_chamber", |
| "title": "Learning in an Echo Chamber: Online Learning with Replay Adversary", |
| "num_questions": 1, |
| "source_dag_sha256": "d401129db110a1c7818a33ddd0a0ff62a4fa42a51822423487539ed0e06e1191" |
| }, |
| { |
| "paper_id": "likelihood_existence_average", |
| "title": "Likelihood of the Existence of Average Justified Representation", |
| "num_questions": 3, |
| "source_dag_sha256": "8994a7619a64051e0422e991ef365c025dfa9115001e559ceac8080fcb289239" |
| }, |
| { |
| "paper_id": "lines_crossing_pairwise", |
| "title": "On Lines Crossing Pairwise Intersecting Convex Sets in Three Dimensions", |
| "num_questions": 1, |
| "source_dag_sha256": "6e2efa9b5e6b96d61621b9a19fef0a4b4bbc5c76b28bd7bc2d17a62e41978985" |
| }, |
| { |
| "paper_id": "listing_faces_polytopes", |
| "title": "LISTING FACES OF POLYTOPES", |
| "num_questions": 2, |
| "source_dag_sha256": "1a9fa00f9339e87be7c6101dbc547c962b692bebb12d249a65f2319049d57f79" |
| }, |
| { |
| "paper_id": "local_gibbs_sampling", |
| "title": "LOCAL GIBBS SAMPLING BEYOND LOCAL UNIFORMITY", |
| "num_questions": 1, |
| "source_dag_sha256": "44487d32d1ec9b4229f6e7d59373fceda79bfc8d5347741307a6663a449ca210" |
| }, |
| { |
| "paper_id": "low-sensitivity_matching_sampling", |
| "title": "Low-Sensitivity Matching via Sampling from Gibbs Distributions", |
| "num_questions": 3, |
| "source_dag_sha256": "700d07a04ebba60cd6c60774ee5c015c5b23d1646e14e889528bf858662c9152" |
| }, |
| { |
| "paper_id": "lower_bounds_csp", |
| "title": "Lower Bounds for CSP Hierarchies Through Ideal Reduction", |
| "num_questions": 1, |
| "source_dag_sha256": "e2142da58c439979078677007b2f898c384dce6f653bcb5faa5b61bee7395df5" |
| }, |
| { |
| "paper_id": "lower_bounds_universal", |
| "title": "LOWER BOUNDS FOR THE UNIVERSAL TSP ON THE PLANE", |
| "num_questions": 1, |
| "source_dag_sha256": "d8cb04b3899b30fadfc81df18355916b44050fddfc88b7fad7aa7b4927943c48" |
| }, |
| { |
| "paper_id": "matroids_equitable", |
| "title": "Matroids are Equitable*", |
| "num_questions": 3, |
| "source_dag_sha256": "7c1478cd33b02279d06d68a6f095e9b229b75af6809bcea5b7bf8b8f3fca1212" |
| }, |
| { |
| "paper_id": "max_bisection_harder", |
| "title": "MAX BISECTION might be harder to approximate than MAX CUT", |
| "num_questions": 1, |
| "source_dag_sha256": "c54e91b6fc54d181fe28acecd9502367acc84d80f47f70106ecf3e5ec9cca1e1" |
| }, |
| { |
| "paper_id": "near-complete_resolution_exponential-time", |
| "title": "A Near-Complete Resolution of the Exponential-Time Complexity of $k$-opt for the Traveling Salesman Problem", |
| "num_questions": 0, |
| "source_dag_sha256": "d905c7dd99b917fd5d1639c07833284038b2118b2cb3d05fec9179fcafaa34c9" |
| }, |
| { |
| "paper_id": "near-linear_time_subhypergraph", |
| "title": "Near-linear time subhypergraph counting in bounded degeneracy hypergraphs", |
| "num_questions": 3, |
| "source_dag_sha256": "185195fa8b6512d8c9befca7032a15437106543d4916dd68bf09c7b38fc61aaa" |
| }, |
| { |
| "paper_id": "nearly_optimal_bounds", |
| "title": "Nearly Optimal Bounds for Stochastic Online Sorting", |
| "num_questions": 0, |
| "source_dag_sha256": "10dda461424cad79704b19879a499ab4d83412888112bcc1f794df3bf6819063" |
| }, |
| { |
| "paper_id": "nearly_tight_bounds", |
| "title": "Nearly Tight Bounds for the Online Sorting Problem", |
| "num_questions": 2, |
| "source_dag_sha256": "6807fb6cb3d2fa58551748a9e541b9fafd44d00300b6fd8d15e742cb29a25a4d" |
| }, |
| { |
| "paper_id": "nearly_tight_sample", |
| "title": "Nearly Tight Sample Complexity for Matroid Online Contention Resolution", |
| "num_questions": 3, |
| "source_dag_sha256": "511cb59c2b443c2c98fe9bf6d2c934c2e4d5d250be25807e5fca57333a033261" |
| }, |
| { |
| "paper_id": "networked_information_aggregation", |
| "title": "Networked Information Aggregation via Machine Learning", |
| "num_questions": 3, |
| "source_dag_sha256": "c097fcb5f1d998b4715feed03dbcff8f9388eab79aea58002038686d96c6c4fc" |
| }, |
| { |
| "paper_id": "new_oracles_labeling", |
| "title": "New Oracles and Labeling Schemes for Vertex Cut Queries", |
| "num_questions": 3, |
| "source_dag_sha256": "15b00eb2160ab4464465876169916052f5d662f9b4f949a117a800bb7345e3df" |
| }, |
| { |
| "paper_id": "online_3-taxi_general", |
| "title": "Online 3-Taxi on General Metrics", |
| "num_questions": 2, |
| "source_dag_sha256": "273a596f2f328680c386dc012df2666f006d5ea38410be462720c45b8a87ad6e" |
| }, |
| { |
| "paper_id": "online_conformal_prediction", |
| "title": "Online Conformal Prediction with Efficiency Guarantees", |
| "num_questions": 3, |
| "source_dag_sha256": "4370d96c5bb6535118610fd6ad79852531bb17e4be1a7aed233640f17870ce4c" |
| }, |
| { |
| "paper_id": "online_joint_replenishment", |
| "title": "Online Joint Replenishment Problem with Arbitrary Holding and Backlog Costs", |
| "num_questions": 1, |
| "source_dag_sha256": "f670ba6ca6337176cd5d83a8552e34ea1e127699c0a8b8afe29eb00d8c20c153" |
| }, |
| { |
| "paper_id": "online_orthogonal_vectors", |
| "title": "Online Orthogonal Vectors Revisited", |
| "num_questions": 2, |
| "source_dag_sha256": "0347a6dde2d773a6240aaada59ae978ae597f5b70fa640b6dde85e82cbd40256" |
| }, |
| { |
| "paper_id": "online_proportional_apportionment", |
| "title": "Online Proportional Apportionment", |
| "num_questions": 3, |
| "source_dag_sha256": "965aad5b410f0dc4c865f7aa678756483b19cb25d2b8d58f3eb2b1e831faf4de" |
| }, |
| { |
| "paper_id": "optimal_density_bound", |
| "title": "An Optimal Density Bound for Discretized Point Patrolling", |
| "num_questions": 3, |
| "source_dag_sha256": "974116a270452ec7aaf4ce79f3ce3c684c8bb43b809eda028ba55ce5feb1eb9d" |
| }, |
| { |
| "paper_id": "optimal_random_access", |
| "title": "Optimal Random Access and Conditional Lower Bounds for 2D Compressed Strings", |
| "num_questions": 0, |
| "source_dag_sha256": "83ae5e9d9c77efda2a63128ebc4a51b572be1322bf784dfad7bc0242a035c245" |
| }, |
| { |
| "paper_id": "optimal_rounding_two-stage", |
| "title": "Optimal Rounding for Two-Stage Bipartite Matching", |
| "num_questions": 3, |
| "source_dag_sha256": "5ca3c3c7eda4b1db51cc28870998fe18981eefa9e3933b7b6ed4a339586d71e1" |
| }, |
| { |
| "paper_id": "optimal_type-dependent_liquid", |
| "title": "Optimal Type-Dependent Liquid Welfare Guarantees for Autobidding Agents with Budgets", |
| "num_questions": 1, |
| "source_dag_sha256": "2d5eb18547532ab2791ecc078bf2d10a584b94afee840737e3a3e7a24b5f0e65" |
| }, |
| { |
| "paper_id": "parameterized_linear_formulation", |
| "title": "A parameterized linear formulation of the integer hull", |
| "num_questions": 3, |
| "source_dag_sha256": "c13dd499e7d15edb72fd0660a29bf174593c20f59a6c48dbea4138fe826f4c33" |
| }, |
| { |
| "paper_id": "peeling_rotten_potatoes", |
| "title": "Peeling Rotten Potatoes for a Faster Approximation of Convex Cover", |
| "num_questions": 3, |
| "source_dag_sha256": "70ee07178b97965efb5545afc26a92dedad63354c7b9c777a640c9ac8986e5e3" |
| }, |
| { |
| "paper_id": "perfect_matchings_random", |
| "title": "PERFECT MATCHINGS IN RANDOM SPARSIFICATIONS OF DENSE HYPERGRAPHS", |
| "num_questions": 2, |
| "source_dag_sha256": "4b2966beb738398d1c64b46f36c68fc9fd6df77597bd54afa0ab2975f5af31f3" |
| }, |
| { |
| "paper_id": "phase_transition_sinkhorn-knopp", |
| "title": "PHASE TRANSITION OF THE SINKHORN-KNOPP ALGORITHM", |
| "num_questions": 3, |
| "source_dag_sha256": "fb7d4ebfab9712e609340d41fd57ee0cd833a21d63ea3be22b1cfcc39b5e8db6" |
| }, |
| { |
| "paper_id": "polynomial-time_classical_simulation", |
| "title": "Polynomial-Time Classical Simulation of Noisy Quantum Circuits with Naturally Fault-Tolerant Gates", |
| "num_questions": 2, |
| "source_dag_sha256": "880980d0ef86f3ff36b2a7818685b509c2ba3cc2b889f4520589ff07c5f509f1" |
| }, |
| { |
| "paper_id": "post-quantum_lower_bound", |
| "title": "A Post-Quantum Lower Bound for the Distributed Lovász Local Lemma", |
| "num_questions": 0, |
| "source_dag_sha256": "ec071721a14289ef5722b79fa22e0e80a564583e70c5815866def7af39406124" |
| }, |
| { |
| "paper_id": "power_matching_online", |
| "title": "The Power of Matching for Online Fractional Hedonic Games", |
| "num_questions": 3, |
| "source_dag_sha256": "e317440cc44afd2f2a8367c7987680f9b2b38ff5b0ef289533d192c66163d5c0" |
| }, |
| { |
| "paper_id": "problems_optimization_computational", |
| "title": "PROBLEMS FROM OPTIMIZATION AND COMPUTATIONAL ALGEBRA EQUIVALENT TO HILBERT’S NULLSTELLENSATZ", |
| "num_questions": 2, |
| "source_dag_sha256": "80e00474a114719064992c8a987755bebaeba2bc139d70d60d68ae023feec824" |
| }, |
| { |
| "paper_id": "prophet_inequality_samples", |
| "title": "Prophet Inequality from Samples: Is the More the Merrier?", |
| "num_questions": 2, |
| "source_dag_sha256": "4474f6ebcb63451595437362d9a457450d3d8d2ef32dcb624cf4e0926ff20aae" |
| }, |
| { |
| "paper_id": "quantum_advantage_solving", |
| "title": "Quantum Advantage via Solving Multivariate Polynomials", |
| "num_questions": 3, |
| "source_dag_sha256": "a1ee4ce9cdf8dca9a08544934ccde254141f5a1e551f7398c61a637013b13e33" |
| }, |
| { |
| "paper_id": "quantum_chromatic_gap", |
| "title": "On the quantum chromatic gap", |
| "num_questions": 0, |
| "source_dag_sha256": "f77843a14fb97ef0934b6f2ef3cc114162e8051e9e9e60347b5a5fd4b5ffe662" |
| }, |
| { |
| "paper_id": "quantum_state_preparation", |
| "title": "Quantum State Preparation with Optimal T-Count", |
| "num_questions": 3, |
| "source_dag_sha256": "d61b06f6248607c8fd42df69ba54c9a81f16ae801058557b19c03e8ec96c17e2" |
| }, |
| { |
| "paper_id": "quasi-polynomial_bound_minimal", |
| "title": "A quasi-polynomial bound for the minimal excluded minors for a surface", |
| "num_questions": 2, |
| "source_dag_sha256": "2dd4cd40de317a9eed32941fdeb976951de1f82c6a58dfcf89c5d76f94c1ceb6" |
| }, |
| { |
| "paper_id": "rapid_mixing_glauber", |
| "title": "Rapid Mixing of Glauber Dynamics for Monotone Systems via Entropic Independence", |
| "num_questions": 3, |
| "source_dag_sha256": "face6dfad4e0d04bb6c78c344e310b2b2611610474e6a21f113da66c7f6515fe" |
| }, |
| { |
| "paper_id": "recognizing_leaf_powers", |
| "title": "Recognizing Leaf Powers and Pairwise Compatibility Graphs is NP-Complete", |
| "num_questions": 2, |
| "source_dag_sha256": "f5980e4647a2e3c09816f83bc543e2e51b827f63303c71d59c2ae9fe95567741" |
| }, |
| { |
| "paper_id": "robust_equilibria_shared", |
| "title": "Robust Equilibria in Shared Resource Allocation via Strengthening Border’s Theorem", |
| "num_questions": 3, |
| "source_dag_sha256": "7226ee267da41f4e99762b9bd1e98caad660cdef5a9b3cff3796e10a4062376e" |
| }, |
| { |
| "paper_id": "rumour_spreading_depends", |
| "title": "RUMOUR SPREADING DEPENDS ON THE LATENT GEOMETRY AND DEGREE DISTRIBUTION IN SOCIAL NETWORK MODELS", |
| "num_questions": 3, |
| "source_dag_sha256": "43bb472d8db00c3a448c3bcb7e579c5cec10fd14236a805b1565a198522ddee1" |
| }, |
| { |
| "paper_id": "selfish_local_online", |
| "title": "Selfish, Local and Online Scheduling via Vector Fitting", |
| "num_questions": 3, |
| "source_dag_sha256": "102b5fa072aad4f5827814dab3b6c45ca482b0a1b75b3c1fed38769a05d0545c" |
| }, |
| { |
| "paper_id": "separations_between_oblivious", |
| "title": "Separations between Oblivious and Adaptive Adversaries for Natural Dynamic Graph Problems", |
| "num_questions": 3, |
| "source_dag_sha256": "53b671260d0ee7fdfc52c6c9a3863f054d00974e557239948f54d876e66442f5" |
| }, |
| { |
| "paper_id": "short_circuit_walks", |
| "title": "Short circuit walks in fixed dimension", |
| "num_questions": 2, |
| "source_dag_sha256": "02c5da9b4caf82fea87eec711a207498b613483370f7d7028e39860db36f42f7" |
| }, |
| { |
| "paper_id": "shortcuts_transitive-closure_spanners", |
| "title": "Shortcuts and Transitive-Closure Spanners Approximation", |
| "num_questions": 3, |
| "source_dag_sha256": "40f3111f73e8c793f69cf77dbf826edc4a1e59fa04f8c1bd920a523bd267d2f2" |
| }, |
| { |
| "paper_id": "simple_fast_reduction", |
| "title": "A Simple and Fast Reduction from Gomory-Hu Trees to Polylog Maxflows", |
| "num_questions": 1, |
| "source_dag_sha256": "3dd84e41650bf93ff501155f1df61e03ebbffe37b6c4854d7d9f212955ebb47c" |
| }, |
| { |
| "paper_id": "smooth_trade-off_tensor", |
| "title": "Smooth Trade-off for Tensor PCA via Sharp Bounds for Kikuchi Matrices", |
| "num_questions": 1, |
| "source_dag_sha256": "72a671cbd97e64a3b22abcfe4d8f5b98a562c9a7e7b11849f05d4ea084b02d80" |
| }, |
| { |
| "paper_id": "space-efficient_k-mismatch_text", |
| "title": "Space-Efficient $k$-Mismatch Text Indexes", |
| "num_questions": 1, |
| "source_dag_sha256": "448e7b462c6aa5bb8ef9c8b8a0aca88b832d88485507d8d8f3b50c02d1d88804" |
| }, |
| { |
| "paper_id": "sparsifying_cayley_graphs", |
| "title": "Sparsifying Cayley Graphs on Every Group", |
| "num_questions": 2, |
| "source_dag_sha256": "ba170b7c00bfd793abfb92dd8773e88a6de7d93166bd42a22b03396951ba9eb2" |
| }, |
| { |
| "paper_id": "sparsifying_sums_positive", |
| "title": "Sparsifying Sums of Positive Semidefinite Matrices", |
| "num_questions": 3, |
| "source_dag_sha256": "9e24f4732b6a771b90f1b5277c4e6258bd5bdaf7766393e299658b0c537d7024" |
| }, |
| { |
| "paper_id": "strongly_polynomial_parallel", |
| "title": "Strongly Polynomial Parallel Work-Depth Tradeoffs for Directed SSSP", |
| "num_questions": 3, |
| "source_dag_sha256": "1de96b6068069adce2c7b02e33315737d7b50b3a61a9e5c4178943e215e3833e" |
| }, |
| { |
| "paper_id": "sublinear_metric_steiner", |
| "title": "Sublinear Metric Steiner Forest via Maximal Independent Set", |
| "num_questions": 3, |
| "source_dag_sha256": "42ad6d1b6f32e20c6b7dfa3e7360b3cff9f527ec4c3b4a982efe69961afc0123" |
| }, |
| { |
| "paper_id": "succinct_dynamic_rank", |
| "title": "Succinct Dynamic Rank/Select: Bypassing the Tree-Structure Bottleneck", |
| "num_questions": 2, |
| "source_dag_sha256": "1594670813fcfc2d43bd3b6defc60d0499ca3bccd4c20977d0377379ee05889a" |
| }, |
| { |
| "paper_id": "tight_differentially_private", |
| "title": "Tight Differentially Private PCA via Matrix Coherence", |
| "num_questions": 2, |
| "source_dag_sha256": "05dfdc6eae40c588cd97f3dd9bab2520df51c05ad9f1c4169cd7c09d261afcfb" |
| }, |
| { |
| "paper_id": "time-biased_random_walks", |
| "title": "Time-Biased Random Walks and Robustness of Expanders", |
| "num_questions": 1, |
| "source_dag_sha256": "6ed8f8aeb1da66af289bf5de9390e89b1d5689460bfdf93038eac170f2f66cf2" |
| }, |
| { |
| "paper_id": "tree_covers_size", |
| "title": "Tree covers of size 2 for the Euclidean plane", |
| "num_questions": 3, |
| "source_dag_sha256": "f6ec129d7f6e108a37c4121108b945e68ef22e27a554687dafbe9a13035219aa" |
| }, |
| { |
| "paper_id": "tree_embedding_high", |
| "title": "Tree Embedding in High Dimensions: Dynamic and Massively Parallel", |
| "num_questions": 1, |
| "source_dag_sha256": "300fd4aed137dcfe9f66fd7f1c140bacf530ad1dc356461fd3ea4b41cddcbe20" |
| }, |
| { |
| "paper_id": "truly_subcubic_combinatorial", |
| "title": "A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection", |
| "num_questions": 3, |
| "source_dag_sha256": "e9fbeb451ccfea73aa481b1a3f57c8d6245e5faead450d1938f44d5d8952fc1f" |
| }, |
| { |
| "paper_id": "unbounded_error_correcting", |
| "title": "Unbounded Error Correcting Codes", |
| "num_questions": 2, |
| "source_dag_sha256": "16b83f2dd5a104e59c67852c7869d60ce18940b0eb982c3117e808a5b58a3c16" |
| }, |
| { |
| "paper_id": "unconditional_lower_bound", |
| "title": "An unconditional lower bound for the active-set method in convex quadratic maximization", |
| "num_questions": 3, |
| "source_dag_sha256": "b878596eeb059ec703b8cb3fd342e5e093b7763f95cd21a1afa3c65446214a28" |
| }, |
| { |
| "paper_id": "universal_connection_schedules", |
| "title": "Universal Connection Schedules for Reconfigurable Networking", |
| "num_questions": 3, |
| "source_dag_sha256": "c1349eff0d6bfcaf23b6c94b6e96728c725c68893867b3a07b0b28aa4776b2a7" |
| }, |
| { |
| "paper_id": "vizing_theorem_deterministic", |
| "title": "Vizing’s Theorem in Deterministic Almost-Linear Time", |
| "num_questions": 2, |
| "source_dag_sha256": "06a02c5c7e1a6cbfd6ce91043ab7b7b6dbe0e57e34b743be46299d5637dcedd8" |
| }, |
| { |
| "paper_id": "weighted_k-server_admits", |
| "title": "Weighted $k$-Server Admits an Exponentially Competitive Algorithm", |
| "num_questions": 1, |
| "source_dag_sha256": "706d707b7a834758ec6123a26359015cf6289a56cc5d2c66df1fb40cd94f5337" |
| }, |
| { |
| "paper_id": "weighted_pseudorandom_generators", |
| "title": "Weighted Pseudorandom Generators for Read-Once Branching Programs via Weighted Pseudorandom Reductions", |
| "num_questions": 2, |
| "source_dag_sha256": "141757d9fd4b897ebca19e762f69eb94f84828a77fed5656172d90559fa7c47c" |
| }, |
| { |
| "paper_id": "well-separated_pair_decomposition", |
| "title": "A well-separated pair decomposition for low density graphs", |
| "num_questions": 1, |
| "source_dag_sha256": "479feffc4c761a2e22f3ba65d11384d5146ac773d13d2bf1ded1fe722bac11b0" |
| }, |
| { |
| "paper_id": "you_almost_beat", |
| "title": "You (Almost) Can’t Beat Brute Force for 3-Matroid Intersection", |
| "num_questions": 1, |
| "source_dag_sha256": "fa397e8fdd26deee1a4c2cc85325662f6a11f1c5a67628255a4fa976e91e1d31" |
| } |
| ], |
| "removed_big_number_questions": 41 |
| } |
|
|
