{
  "updated": "2026-11-16",
  "papers": [
    {
      "id": "heydt-sparse-2022",
      "title": "Distributed domination on sparse graph classes",
      "authors": "Ozan Heydt; Simeon Kublenz; Patrice Ossona de Mendez; Sebastian Siebertz; Alexandre Vigny",
      "year": 2022,
      "venue": "arXiv 2022; European Journal of Combinatorics 2025",
      "url": "https://arxiv.org/abs/2207.02669",
      "surveySection": 1,
      "doi": "10.1016/j.ejc.2023.103773"
    },
    {
      "id": "chang-minor-2023",
      "title": "Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications",
      "authors": "Yi-Jun Chang",
      "year": 2023,
      "venue": "PODC 2023",
      "url": "https://arxiv.org/abs/2304.04699",
      "surveySection": 2,
      "doi": "10.1145/3583668.3594604"
    },
    {
      "id": "agrawal-supported-2022",
      "title": "Recurrent Problems in the LOCAL model",
      "authors": "Akanksha Agrawal; John Augustine; David Peleg; Srikkanth Ramachandran",
      "year": 2022,
      "venue": "arXiv 2022; OPODIS 2023",
      "url": "https://arxiv.org/abs/2212.14542",
      "surveySection": 3,
      "notes": "The later conference title is Local Recurrent Problems in the SUPPORTED Model."
    },
    {
      "id": "dory-arboricity-2022",
      "title": "Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs",
      "authors": "Michal Dory; Mohsen Ghaffari; Saeed Ilchi",
      "year": 2022,
      "venue": "PODC 2022; Distributed Computing 2024",
      "url": "https://arxiv.org/abs/2206.05174",
      "surveySection": 4,
      "doi": "10.1007/s00446-023-00447-z"
    },
    {
      "id": "chang-su-2022",
      "title": "Narrowing the LOCAL–CONGEST Gaps in Sparse Networks via Expander Decompositions",
      "authors": "Yi-Jun Chang; Hsin-Hao Su",
      "year": 2022,
      "venue": "PODC 2022",
      "url": "https://arxiv.org/abs/2205.08093",
      "surveySection": 5,
      "doi": "10.1145/3519270.3538423"
    },
    {
      "id": "heydt-planar-2021",
      "title": "Local planar domination revisited",
      "authors": "Ozan Heydt; Sebastian Siebertz; Alexandre Vigny",
      "year": 2021,
      "venue": "arXiv 2021; SIROCCO 2022",
      "url": "https://arxiv.org/abs/2111.14506v1",
      "surveySection": 6,
      "notes": "Historical 20-approximation from the preprint; later work gives 11 + ε.",
      "doi": "10.1007/978-3-031-09993-9_9"
    },
    {
      "id": "morgan-arboricity-2021",
      "title": "Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs: Simpler, Faster, and Combinatorial",
      "authors": "Adir Morgan; Shay Solomon; Nicole Wein",
      "year": 2021,
      "venue": "DISC 2021",
      "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.33",
      "surveySection": 7,
      "doi": "10.4230/LIPIcs.DISC.2021.33"
    },
    {
      "id": "bonamy-outerplanar-2021",
      "title": "A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs",
      "authors": "Marthe Bonamy; Linda Cook; Carla Groenland; Alexandra Wesolek",
      "year": 2021,
      "venue": "DISC 2021",
      "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.13",
      "surveySection": 8,
      "doi": "10.4230/LIPIcs.DISC.2021.13"
    },
    {
      "id": "kublenz-expansion-2020",
      "title": "Constant Round Distributed Domination on Graph Classes with Bounded Expansion",
      "authors": "Simeon Kublenz; Sebastian Siebertz; Alexandre Vigny",
      "year": 2020,
      "venue": "arXiv 2020; SIROCCO 2021",
      "url": "https://arxiv.org/abs/2012.02701",
      "surveySection": 9,
      "doi": "10.1007/978-3-030-79527-6_19"
    },
    {
      "id": "alipour-futuhi-2020",
      "title": "On Distributed Algorithms for Minimum Dominating Set problem, from theory to application",
      "authors": "Sharareh Alipour; Ehsan Futuhi; Shayan Karimi",
      "year": 2020,
      "venue": "arXiv",
      "url": "https://arxiv.org/abs/2012.04883",
      "surveySection": 10,
      "notes": "Theorem 2.1 checked in arXiv v2. Ratios 32 and 16 apply to m = 0, with no isolated vertices; the presented algorithm uses random tie-breaking."
    },
    {
      "id": "alipour-jafari-2020",
      "title": "A LOCAL Constant Approximation Factor Algorithm for Minimum Dominating Set of Certain Planar Graphs",
      "authors": "Sharareh Alipour; Amir Jafari",
      "year": 2020,
      "venue": "SPAA 2020",
      "url": "https://doi.org/10.1145/3350755.3400217",
      "surveySection": 11,
      "notes": "Primary SPAA author-talk abstract specifies planar graphs without 4-cycles and a randomized algorithm. This is more precise than the survey summary.",
      "doi": "10.1145/3350755.3400217"
    },
    {
      "id": "amiri-beyond-2017",
      "title": "Distributed Dominating Set Approximations beyond Planar Graphs",
      "authors": "Saeed Akhoondian Amiri; Stefan Schmid; Sebastian Siebertz",
      "year": 2017,
      "venue": "arXiv 2017; ACM TALG 2019",
      "url": "https://arxiv.org/abs/1705.09617",
      "surveySection": 12,
      "doi": "10.1145/3326170"
    },
    {
      "id": "czygrinow-minor-2018",
      "title": "Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs",
      "authors": "Andrzej Czygrinow; Michał Hańćkowiak; Wojciech Wawrzyniak; Marcin Witkowski",
      "year": 2018,
      "venue": "ISAAC 2018",
      "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.22",
      "surveySection": 13,
      "doi": "10.4230/LIPIcs.ISAAC.2018.22"
    },
    {
      "id": "amiri-distance-2017",
      "title": "Distributed Domination on Graph Classes of Bounded Expansion",
      "authors": "Saeed Akhoondian Amiri; Patrice Ossona de Mendez; Roman Rabinovich; Sebastian Siebertz",
      "year": 2017,
      "venue": "arXiv 2017; SPAA 2018",
      "url": "https://arxiv.org/abs/1702.02848",
      "surveySection": 14,
      "doi": "10.1145/3210377.3210383"
    },
    {
      "id": "bansal-umboh-2017",
      "title": "Tight approximation bounds for dominating set on graphs of bounded arboricity",
      "authors": "Nikhil Bansal; Seeun William Umboh",
      "year": 2017,
      "venue": "Information Processing Letters",
      "url": "https://doi.org/10.1016/j.ipl.2017.01.011",
      "surveySection": 15,
      "notes": "Centralized LP rounding result. The distributed consequence needs an additional distributed LP algorithm; not indexed as a standalone distributed algorithm.",
      "doi": "10.1016/j.ipl.2017.01.011"
    },
    {
      "id": "czygrinow-two-dom-2017",
      "title": "Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs",
      "authors": "Andrzej Czygrinow; Michał Hańćkowiak; Edyta Szymańska; Wojciech Wawrzyniak; Marcin Witkowski",
      "year": 2017,
      "venue": "Theoretical Computer Science",
      "url": "https://www.sciencedirect.com/science/article/pii/S0304397516307071",
      "surveySection": 16,
      "doi": "10.1016/j.tcs.2016.12.001"
    },
    {
      "id": "amiri-genus-2016",
      "title": "A Local Constant Factor MDS Approximation for Bounded Genus Graphs",
      "authors": "Saeed Akhoondian Amiri; Stefan Schmid; Sebastian Siebertz",
      "year": 2016,
      "venue": "PODC 2016",
      "url": "https://schmiste.github.io/podc16.pdf",
      "surveySection": 17,
      "doi": "10.1145/2933057.2933084"
    },
    {
      "id": "wawrzyniak-anonymous-2015",
      "title": "A local approximation algorithm for minimum dominating set problem in anonymous planar networks",
      "authors": "Wojciech Wawrzyniak",
      "year": 2015,
      "venue": "Distributed Computing",
      "url": "https://link.springer.com/article/10.1007/s00446-015-0247-6",
      "surveySection": 18,
      "notes": "Journal guarantee is 694. Some earlier citations quote 636 from the preliminary version.",
      "doi": "10.1007/s00446-015-0247-6"
    },
    {
      "id": "wawrzyniak-52-2014",
      "title": "A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs",
      "authors": "Wojciech Wawrzyniak",
      "year": 2014,
      "venue": "Information Processing Letters",
      "url": "https://www.sciencedirect.com/science/article/abs/pii/S0020019013002767",
      "surveySection": 19,
      "doi": "10.1016/j.ipl.2013.11.008"
    },
    {
      "id": "czygrinow-k-tuple-2014",
      "title": "Distributed Local Approximation of the Minimum k-Tuple Dominating Set in Planar Graphs",
      "authors": "Andrzej Czygrinow; Michał Hańćkowiak; Edyta Szymańska; Wojciech Wawrzyniak; Marcin Witkowski",
      "year": 2014,
      "venue": "OPODIS 2014",
      "url": "https://link.springer.com/chapter/10.1007/978-3-319-14472-6_4",
      "surveySection": 20,
      "notes": "The paper’s definition requires k neighbors in D only for vertices outside D.",
      "doi": "10.1007/978-3-319-14472-6_4"
    },
    {
      "id": "hilke-planar-lower-2014",
      "title": "Local Approximability of Minimum Dominating Set on Planar Graphs",
      "authors": "Miikka Hilke; Christoph Lenzen; Jukka Suomela",
      "year": 2014,
      "venue": "PODC 2014 (brief announcement)",
      "url": "https://arxiv.org/abs/1402.2549",
      "surveySection": 21,
      "doi": "10.1145/2611462.2611504"
    },
    {
      "id": "wawrzyniak-anonymous-2013",
      "title": "Brief announcement: a local approximation algorithm for MDS problem in anonymous planar networks",
      "authors": "Wojciech Wawrzyniak",
      "year": 2013,
      "venue": "PODC 2013",
      "url": "https://doi.org/10.1145/2484239.2484281",
      "surveySection": 22,
      "notes": "Represented by the 2015 journal result; do not merge the differing numerical guarantees.",
      "doi": "10.1145/2484239.2484281"
    },
    {
      "id": "lenzen-restricted-2013",
      "title": "Distributed minimum dominating set approximations in restricted families of graphs",
      "authors": "Christoph Lenzen; Yvonne Anne Pignolet; Roger Wattenhofer",
      "year": 2013,
      "venue": "Distributed Computing",
      "url": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf",
      "surveySection": 23,
      "notes": "Consolidates SPAA 2008 and DISC 2010 results.",
      "doi": "10.1007/s00446-013-0186-z"
    },
    {
      "id": "lenzen-wattenhofer-2010",
      "title": "Minimum Dominating Set Approximation in Graphs of Bounded Arboricity",
      "authors": "Christoph Lenzen; Roger Wattenhofer",
      "year": 2010,
      "venue": "DISC 2010",
      "url": "https://doi.org/10.1007/978-3-642-15763-9_48",
      "surveySection": 24,
      "notes": "Results are indexed under the 2013 consolidated journal paper.",
      "doi": "10.1007/978-3-642-15763-9_48"
    },
    {
      "id": "barenboim-elkin-2010",
      "title": "Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition",
      "authors": "Leonid Barenboim; Michael Elkin",
      "year": 2010,
      "venue": "Distributed Computing",
      "url": "https://doi.org/10.1007/s00446-009-0088-2",
      "surveySection": 25,
      "notes": "Supporting exact symmetry-breaking result; maximal independent set is not maximum independent set.",
      "doi": "10.1007/s00446-009-0088-2"
    },
    {
      "id": "schneider-wattenhofer-2010",
      "title": "An optimal maximal independent set algorithm for bounded-independence graphs",
      "authors": "Johannes Schneider; Roger Wattenhofer",
      "year": 2010,
      "venue": "Distributed Computing",
      "url": "https://doi.org/10.1007/s00446-010-0097-1",
      "surveySection": 26,
      "notes": "Supporting MIS subroutine; not indexed as a maximum-independent-set approximation.",
      "doi": "10.1007/s00446-010-0097-1"
    },
    {
      "id": "czygrinow-arboricity-matching-2009",
      "title": "Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs",
      "authors": "Andrzej Czygrinow; Michał Hańćkowiak; Edyta Szymańska",
      "year": 2009,
      "venue": "ISAAC 2009",
      "url": "https://link.springer.com/chapter/10.1007/978-3-642-10631-6_68",
      "surveySection": 27,
      "doi": "10.1007/978-3-642-10631-6_68"
    },
    {
      "id": "lenzen-oswald-2008",
      "title": "What can be approximated locally? Case study: dominating sets in planar graphs",
      "authors": "Christoph Lenzen; Yvonne Anne Oswald; Roger Wattenhofer",
      "year": 2008,
      "venue": "SPAA 2008",
      "url": "https://doi.org/10.1145/1378533.1378540",
      "surveySection": 28,
      "notes": "Use the corrected 2013 journal analysis for numerical guarantees.",
      "doi": "10.1145/1378533.1378540"
    },
    {
      "id": "schneider-wattenhofer-2008",
      "title": "A log-star distributed maximal independent set algorithm for growth-bounded graphs",
      "authors": "Johannes Schneider; Roger Wattenhofer",
      "year": 2008,
      "venue": "PODC 2008",
      "url": "https://doi.org/10.1145/1400751.1400758",
      "surveySection": 29,
      "notes": "Supporting exact MIS subroutine; journal version is listed separately.",
      "doi": "10.1145/1400751.1400758"
    },
    {
      "id": "czygrinow-planar-fast-2008",
      "title": "Fast Distributed Approximations in Planar Graphs",
      "authors": "Andrzej Czygrinow; Michał Hańćkowiak; Wojciech Wawrzyniak",
      "year": 2008,
      "venue": "DISC 2008",
      "url": "https://link.springer.com/chapter/10.1007/978-3-540-87779-0_6",
      "surveySection": 30,
      "doi": "10.1007/978-3-540-87779-0_6"
    },
    {
      "id": "czygrinow-packing-planar-2008",
      "title": "Distributed packing in planar graphs",
      "authors": "Andrzej Czygrinow; Michał Hańćkowiak; Wojciech Wawrzyniak",
      "year": 2008,
      "venue": "SPAA 2008",
      "url": "https://doi.org/10.1145/1378533.1378541",
      "surveySection": 31,
      "doi": "10.1145/1378533.1378541"
    },
    {
      "id": "gfeller-vicari-2007",
      "title": "A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs",
      "authors": "Beat Gfeller; Elias Vicari",
      "year": 2007,
      "venue": "PODC 2007",
      "url": "https://doi.org/10.1145/1281100.1281111",
      "surveySection": 32,
      "notes": "Supporting exact MIS subroutine, not an approximation entry.",
      "doi": "10.1145/1281100.1281111"
    },
    {
      "id": "czygrinow-weighted-minor-2007",
      "title": "Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families",
      "authors": "Andrzej Czygrinow; Michał Hańćkowiak",
      "year": 2007,
      "venue": "COCOON 2007",
      "url": "https://link.springer.com/chapter/10.1007/978-3-540-73545-8_50",
      "surveySection": 33,
      "notes": "Weighted domination checked in Theorem 5. Weighted matching and the quantitative connected-domination lower bound remain to be extracted.",
      "doi": "10.1007/978-3-540-73545-8_50"
    },
    {
      "id": "czygrinow-packing-disk-2007",
      "title": "Distributed Approximations for Packing in Unit-Disk Graphs",
      "authors": "Andrzej Czygrinow; Michał Hańćkowiak",
      "year": 2007,
      "venue": "DISC 2007",
      "url": "https://link.springer.com/chapter/10.1007/978-3-540-75142-7_14",
      "surveySection": 34,
      "notes": "Packing algorithm verified at abstract level; precise ratio omitted pending theorem audit.",
      "doi": "10.1007/978-3-540-75142-7_14"
    },
    {
      "id": "czygrinow-minor-almost-2006",
      "title": "Distributed Almost Exact Approximations for Minor-Closed Families",
      "authors": "Andrzej Czygrinow; Michał Hańćkowiak",
      "year": 2006,
      "venue": "ESA 2006",
      "url": "https://link.springer.com/chapter/10.1007/11841036_24",
      "surveySection": 35,
      "doi": "10.1007/11841036_24"
    },
    {
      "id": "czygrinow-planar-2006",
      "title": "Distributed Approximation Algorithms for Planar Graphs",
      "authors": "Andrzej Czygrinow; Michał Hańćkowiak; Edyta Szymańska",
      "year": 2006,
      "venue": "CIAC 2006",
      "url": "https://link.springer.com/chapter/10.1007/11758471_29",
      "surveySection": 36,
      "notes": "The matching bound is indexed. The dominating-set variant has additional restrictions requiring theorem-level checking.",
      "doi": "10.1007/11758471_29"
    },
    {
      "id": "czygrinow-weighted-sparse-2006",
      "title": "Distributed algorithms for weighted problems in sparse graphs",
      "authors": "Andrzej Czygrinow; Michał Hańćkowiak",
      "year": 2006,
      "venue": "Journal of Discrete Algorithms",
      "url": "https://www.sciencedirect.com/science/article/pii/S1570866705000523",
      "surveySection": 37,
      "notes": "Theorems 2.10 and 3.6 checked in the author manuscript. The tree weighted-matching theorem remains to be extracted.",
      "doi": "10.1016/j.jda.2005.07.006"
    },
    {
      "id": "czygrinow-unitdisk-2006",
      "title": "Distributed Approximation Algorithms in Unit-Disk Graphs",
      "authors": "Andrzej Czygrinow; Michał Hańćkowiak",
      "year": 2006,
      "venue": "DISC 2006",
      "url": "https://doi.org/10.1007/11864219_27",
      "surveySection": 38,
      "notes": "Matching and connected domination guarantees checked in the primary manuscript abstract.",
      "doi": "10.1007/11864219_27"
    },
    {
      "id": "kuhn-mis-growth-2005",
      "title": "Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs",
      "authors": "Fabian Kuhn; Thomas Moscibroda; Tim Nieberg; Roger Wattenhofer",
      "year": 2005,
      "venue": "DISC 2005",
      "url": "https://doi.org/10.1007/11561927_21",
      "surveySection": 39,
      "notes": "Supporting exact maximal independent set algorithm.",
      "doi": "10.1007/11561927_21"
    },
    {
      "id": "kuhn-local-schemes-2005",
      "title": "Local approximation schemes for ad hoc and sensor networks",
      "authors": "Fabian Kuhn; Thomas Moscibroda; Tim Nieberg; Roger Wattenhofer",
      "year": 2005,
      "venue": "DIALM-POMC 2005",
      "url": "https://www.microsoft.com/en-us/research/wp-content/uploads/2017/01/DIALM2005a.pdf",
      "surveySection": 40,
      "doi": "10.1145/1080810.1080827"
    },
    {
      "id": "kuhn-locality-growth-2005",
      "title": "On the locality of bounded growth",
      "authors": "Fabian Kuhn; Thomas Moscibroda; Roger Wattenhofer",
      "year": 2005,
      "venue": "PODC 2005",
      "url": "https://doi.org/10.1145/1073814.1073826",
      "surveySection": 41,
      "notes": "Theorem 4.3 fractional domination is indexed with its geometric-distance assumption. General covering/packing LPs and decomposition corollaries are not fully extracted.",
      "doi": "10.1145/1073814.1073826"
    },
    {
      "id": "czygrinow-matching-2003",
      "title": "Distributed Algorithm for Better Approximation of the Maximum Matching",
      "authors": "Andrzej Czygrinow; Michał Hańćkowiak",
      "year": 2003,
      "venue": "COCOON 2003",
      "url": "https://link.springer.com/chapter/10.1007/3-540-45071-8_26",
      "surveySection": 42,
      "doi": "10.1007/3-540-45071-8_26"
    },
    {
      "id": "gen-ps09",
      "title": "A simple local 3-approximation algorithm for vertex cover",
      "authors": "Valentin Polishchuk; Jukka Suomela",
      "year": 2009,
      "venue": "Information Processing Letters",
      "url": "https://doi.org/10.1016/j.ipl.2009.02.017",
      "doi": "10.1016/j.ipl.2009.02.017"
    },
    {
      "id": "gen-as10",
      "title": "Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks",
      "authors": "Matti Åstrand; Jukka Suomela",
      "year": 2010,
      "venue": "SPAA 2010",
      "url": "https://jukkasuomela.fi/doc/vc-sc.pdf",
      "doi": "10.1145/1810479.1810533"
    },
    {
      "id": "gen-bcs16",
      "title": "A Distributed (2+ε)-Approximation for Vertex Cover in O(log Δ / (ε log log Δ)) Rounds",
      "authors": "Reuven Bar-Yehuda; Keren Censor-Hillel; Gregory Schwartzman",
      "year": 2016,
      "venue": "arXiv 2016; ACM Transactions on Parallel Computing 2017",
      "url": "https://arxiv.org/abs/1602.03713"
    },
    {
      "id": "gen-beks18",
      "title": "A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(log n log Δ / log² log Δ) Rounds",
      "authors": "Ran Ben-Basat; Guy Even; Ken-ichi Kawarabayashi; Gregory Schwartzman",
      "year": 2018,
      "venue": "SIROCCO 2018",
      "url": "https://arxiv.org/abs/1804.01308"
    },
    {
      "id": "gen-emr14",
      "title": "Distributed Maximum Matching in Bounded Degree Graphs",
      "authors": "Guy Even; Moti Medina; Dana Ron",
      "year": 2014,
      "venue": "arXiv 2014",
      "url": "https://arxiv.org/abs/1407.7882"
    },
    {
      "id": "gen-bcgs17",
      "title": "Distributed Approximation of Maximum Independent Set and Maximum Matching",
      "authors": "Reuven Bar-Yehuda; Keren Censor-Hillel; Mohsen Ghaffari; Gregory Schwartzman",
      "year": 2017,
      "venue": "PODC 2017",
      "url": "https://arxiv.org/abs/1708.00276",
      "doi": "10.1145/3087801.3087806"
    },
    {
      "id": "gen-ako18",
      "title": "Distributed Approximate Maximum Matching in the CONGEST Model",
      "authors": "Mohamad Ahmadi; Fabian Kuhn; Rotem Oshman",
      "year": 2018,
      "venue": "DISC 2018",
      "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.6",
      "doi": "10.4230/LIPIcs.DISC.2018.6",
      "notes": "Published bounds retained with source caveats: Li–Ouyang–Wang (2024), Remark 1.2, reports a flaw in the weighted fractional matching proof."
    },
    {
      "id": "gen-ffk21",
      "title": "Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings",
      "authors": "Salwa Faour; Marc Fuchs; Fabian Kuhn",
      "year": 2021,
      "venue": "OPODIS 2021",
      "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.17",
      "doi": "10.4230/LIPIcs.OPODIS.2021.17",
      "notes": "Matching upper bounds invoke AKO18, whose weighted fractional primitive has a reported proof issue; see result caveats. The vertex-cover algorithm instead reduces to unweighted fractional matching."
    },
    {
      "id": "gen-hs22",
      "title": "(1−ε)-Approximate Maximum Weighted Matching in Distributed, Parallel, and Semi-Streaming Settings",
      "authors": "Shang-En Huang; Hsin-Hao Su",
      "year": 2022,
      "venue": "arXiv 2022; PODC 2023",
      "url": "https://arxiv.org/abs/2212.14425"
    },
    {
      "id": "gen-aprsu10",
      "title": "Local algorithms in (weakly) coloured graphs",
      "authors": "Matti Åstrand; Valentin Polishchuk; Joel Rybicki; Jukka Suomela; Jara Uitto",
      "year": 2010,
      "venue": "arXiv 2010",
      "url": "https://arxiv.org/abs/1002.0125"
    },
    {
      "id": "gen-ghs12",
      "title": "Lower Bounds for Local Approximation",
      "authors": "Mika Göös; Juho Hirvonen; Jukka Suomela",
      "year": 2012,
      "venue": "PODC 2012; journal version",
      "url": "https://arxiv.org/abs/1201.6675"
    },
    {
      "id": "gen-w25",
      "title": "A Local 6-Approximation Distributed Algorithm for Minimum Dominating Set Problem in Planar Triangle-Free Graphs",
      "authors": "Wojciech Wawrzyniak",
      "year": 2025,
      "venue": "Algorithms 18(5), 280",
      "url": "https://www.mdpi.com/1999-4893/18/5/280",
      "doi": "10.3390/a18050280"
    },
    {
      "id": "gen-bdgpsw26",
      "title": "Meta-Theorems for Cuttable Distributed Problems",
      "authors": "Marthe Bonamy; Avinandan Das; Cyril Gavoille; Timothé Picavet; Jukka Suomela; Alexandra Wesolek",
      "year": 2026,
      "venue": "arXiv preprint",
      "url": "https://arxiv.org/abs/2605.19157",
      "notes": "Preprint; checked 15 November 2026."
    },
    {
      "id": "gen-af26",
      "title": "Distributed Dominating Set With Optimal Rounds and Message Size in Bounded Arboricity Graphs",
      "authors": "Sharareh Alipour; Ermiya Farokhnejad",
      "year": 2026,
      "venue": "SPAA 2026",
      "url": "https://arxiv.org/abs/2606.15411",
      "doi": "10.1145/3816782.3819190"
    },
    {
      "id": "gen-w26-planar",
      "title": "Near-Optimal Distributed Domination in Planar Graphs",
      "authors": "Wojciech Wawrzyniak",
      "year": 2026,
      "venue": "arXiv preprint",
      "url": "https://arxiv.org/abs/2609.32736",
      "notes": "Preprint; checked 15 November 2026."
    },
    {
      "id": "gen-as26",
      "title": "Almost Optimal Constant-Round Approximation of Dominating Set in Graph Classes with Excluded Minors",
      "authors": "Saeed Amiri; Sebastian Siebertz",
      "year": 2026,
      "venue": "arXiv preprint",
      "url": "https://arxiv.org/abs/2610.09618",
      "notes": "Preprint; checked 15 November 2026."
    },
    {
      "id": "gen-w26-transfer",
      "title": "Almost Lossless Transfer for Cuttable Distributed Problems",
      "authors": "Wojciech Wawrzyniak",
      "year": 2026,
      "venue": "arXiv preprint",
      "url": "https://arxiv.org/abs/2610.15596",
      "notes": "Preprint; checked 15 November 2026."
    },
    {
      "id": "gen-p26",
      "title": "Almost tight distributed approximation for domination in sparse graph classes",
      "authors": "Timothé Picavet",
      "year": 2026,
      "venue": "arXiv preprint",
      "url": "https://arxiv.org/abs/2610.31203",
      "notes": "Preprint; checked 15 November 2026."
    },
    {
      "id": "gen-asw26",
      "title": "Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts",
      "authors": "Saeed Amiri; Sebastian Siebertz; Wojciech Wawrzyniak",
      "year": 2026,
      "venue": "arXiv preprint",
      "url": "https://arxiv.org/abs/2611.02057",
      "notes": "November 2026 preprint. CONGEST results use the broadcast restriction. Fractional and integral benchmarks differ between graph classes."
    },
    {
      "id": "gen-fk25",
      "title": "Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs",
      "authors": "Salwa Faour; Fabian Kuhn",
      "year": 2025,
      "venue": "arXiv preprint",
      "url": "https://arxiv.org/abs/2506.10845"
    },
    {
      "id": "gen-low24",
      "title": "A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems",
      "authors": "Qian Li; Minghui Ouyang; Yuyi Wang",
      "year": 2024,
      "venue": "ISAAC 2024",
      "url": "https://arxiv.org/abs/2409.16168",
      "notes": "Remark 1.2 reports a proof issue in the weighted fractional matching bound of Ahmadi–Kuhn–Oshman (2018)."
    },
    {
      "id": "gen-dp26",
      "title": "Distributed Approximate Maximum Matching and Minimum Vertex Cover via Generalized Graph Decomposition",
      "authors": "Peter Davies-Peck",
      "year": 2026,
      "venue": "arXiv preprint",
      "url": "https://arxiv.org/abs/2605.13264"
    },
    {
      "id": "gen-iky25",
      "title": "Forgetting Alternation and Blossoms: A New Framework for Fast Matching Augmentation and Its Applications to Sequential/Distributed/Streaming Computation",
      "authors": "Taisuke Izumi; Naoki Kitamura; Yutaro Yamaguchi",
      "year": 2025,
      "venue": "arXiv preprint",
      "url": "https://arxiv.org/abs/2511.08210"
    },
    {
      "id": "gen-chr24",
      "title": "Local Density and Its Distributed Approximation",
      "authors": "Aleksander Bjørn Christiansen; Ivor van der Hoog; Eva Rotenberg",
      "year": 2024,
      "venue": "STACS 2025",
      "url": "https://arxiv.org/abs/2411.12694",
      "doi": "10.4230/LIPIcs.STACS.2025.25",
      "notes": "First preprint 2024; proceedings 2025. Local-density estimation is distinct from outputting a densest subgraph."
    },
    {
      "id": "gen-jpp26",
      "title": "Approximating Minimum Dominating Set with Few Awake Rounds",
      "authors": "Hongyan Ji; Shreyas Pai; Sriram V. Pemmaraju",
      "year": 2026,
      "venue": "DISC 2026",
      "url": "https://arxiv.org/abs/2608.19096",
      "doi": "10.4230/LIPIcs.DISC.2026.53",
      "notes": "Sleeping CONGEST; records distinguish total elapsed rounds from awake rounds."
    },
    {
      "id": "gen-beks19",
      "title": "Optimal Distributed Covering Algorithms",
      "authors": "Ran Ben-Basat; Guy Even; Ken-ichi Kawarabayashi; Gregory Schwartzman",
      "year": 2019,
      "venue": "DISC 2019",
      "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.5",
      "doi": "10.4230/LIPIcs.DISC.2019.5",
      "notes": "Bounds checked in arXiv v2, Theorem 4.9 and Corollary 4.10. The graph-vertex-cover entries instantiate rank f=2; the incidence protocol has a constant-overhead simulation on the original graph."
    },
    {
      "id": "gen-kmw16",
      "title": "Local Computation: Lower and Upper Bounds",
      "authors": "Fabian Kuhn; Thomas Moscibroda; Roger Wattenhofer",
      "year": 2016,
      "venue": "Journal of the ACM 63(2), Article 17, pp. 1–44",
      "url": "https://arxiv.org/abs/1011.5470v2",
      "doi": "10.1145/2742012",
      "notes": "Checked against arXiv v2 (31 March 2016); the primary preprint has 48 PDF pages. Lower bounds allow randomized algorithms and apply to expected approximation for a fixed round budget. References in Picavet thesis, Chapters I and IV."
    },
    {
      "id": "pic-bgpw-large-2025",
      "title": "Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors",
      "authors": "Marthe Bonamy; Cyril Gavoille; Timothé Picavet; Alexandra Wesolek",
      "year": 2025,
      "venue": "PODC 2025",
      "url": "https://arxiv.org/abs/2504.01091v2",
      "doi": "10.1145/3732772.3733531",
      "notes": "Bounds checked in arXiv v2. Theorem 4.4 says 2t−1, despite a 2t+1 introductory bullet."
    },
    {
      "id": "pic-bgpw-nice-2025",
      "title": "Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs",
      "authors": "Marthe Bonamy; Cyril Gavoille; Timothé Picavet; Alexandra Wesolek",
      "year": 2025,
      "venue": "arXiv preprint",
      "url": "https://arxiv.org/abs/2507.04960v1",
      "notes": "Historical v1. Its bounded-genus 34+ε result is represented by the later cuttable-problems paper; additional distinct statements appear here."
    },
    {
      "id": "pic-chww-kdom-2017",
      "title": "Distributed approximation algorithms for k-dominating set in graphs of bounded genus and linklessly embeddable graphs",
      "authors": "Andrzej Czygrinow; Michał Hańćkowiak; Wojciech Wawrzyniak; Marcin Witkowski",
      "year": 2017,
      "venue": "ICTCS 2017; extended TCS 2020",
      "url": "https://ceur-ws.org/Vol-1949/ICTCSpaper05.pdf",
      "doi": "10.1016/j.tcs.2019.12.027",
      "notes": "Theorem locators and result years use the accessible ICTCS 2017 version. Journal version: TCS 809 (2020), 327–338."
    },
    {
      "id": "pic-chww-broadcast-2019",
      "title": "Distributed CONGEST_BC constant approximation of MDS in bounded genus graphs",
      "authors": "Andrzej Czygrinow; Michał Hańćkowiak; Wojciech Wawrzyniak; Marcin Witkowski",
      "year": 2019,
      "venue": "Theoretical Computer Science 757",
      "url": "https://www.sciencedirect.com/science/article/pii/S0304397518304894",
      "doi": "10.1016/j.tcs.2018.07.008",
      "notes": "Cited by the 2025 locally-nice and 2026 cuttable papers. Primary publisher abstract and Lemma 10 inspected; explicit ratio left unspecified."
    },
    {
      "id": "pic-aw-girth-2019",
      "title": "Distributed Distance-r Dominating Set on Sparse High-Girth Graphs",
      "authors": "Saeed Akhoondian Amiri; Ben Wiederhake",
      "year": 2019,
      "venue": "arXiv preprint",
      "url": "https://arxiv.org/abs/1910.02794v1",
      "notes": "Original preprint; the later journal covers further problems and relaxes the girth condition. Kept separately to preserve version-specific statements."
    },
    {
      "id": "pic-aw-covering-2022",
      "title": "Distributed distance-r covering problems on sparse high-girth graphs",
      "authors": "Saeed Akhoondian Amiri; Ben Wiederhake",
      "year": 2022,
      "venue": "Theoretical Computer Science 906",
      "url": "https://www.sciencedirect.com/science/article/pii/S0304397522000081",
      "doi": "10.1016/j.tcs.2022.01.001",
      "notes": "Journal extension of the 2019 preprint. These rows record the publisher abstract; exact ratios and randomization not inferred from that abstract."
    },
    {
      "id": "pic-chw-distance-2022",
      "title": "Distributed distance domination in graphs with no K₂,ₜ-minor",
      "authors": "Andrzej Czygrinow; Michał Hańćkowiak; Marcin Witkowski",
      "year": 2022,
      "venue": "Theoretical Computer Science 916",
      "url": "https://arxiv.org/abs/2203.03229",
      "doi": "10.1016/j.tcs.2022.03.001"
    },
    {
      "id": "pic-lw-girth-2024",
      "title": "Tight Bounds for Constant-Round Domination on Graphs of High Girth and Low Expansion",
      "authors": "Christoph Lenzen; Sophie Wenning",
      "year": 2024,
      "venue": "SSS 2024; proceedings published 2025",
      "url": "https://arxiv.org/abs/2408.12998v1",
      "doi": "10.1007/978-3-031-74498-3_20",
      "notes": "Results checked against the August 2024 preprint. Anonymous upper bounds use port numbering; deterministic LOCAL lower bounds allow identifiers."
    },
    {
      "id": "pic-chw-capacitated-2021",
      "title": "Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion",
      "authors": "Andrzej Czygrinow; Michał Hańćkowiak; Marcin Witkowski",
      "year": 2021,
      "venue": "ISAAC 2021",
      "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.59",
      "doi": "10.4230/LIPIcs.ISAAC.2021.59"
    },
    {
      "id": "pic-thesis-2026",
      "type": "phdthesis",
      "school": "Université de Bordeaux",
      "title": "Algorithmes distribués et structures locales dans les graphes",
      "authors": "Timothé Picavet",
      "year": 2026,
      "venue": "PhD thesis, Université de Bordeaux; defended 23 June 2026",
      "url": "https://timothepicavet.fr/others/thesis.pdf",
      "notes": "Chapter V credits joint work with Marthe Bonamy, Cyril Gavoille, Tim Planken and Alexandra Wesolek. Indexed thesis results include the excluded-minor pathwidth lower bounds, the pathwidth-two excluded-minor factor-50 algorithm, bounded-degeneracy vertex cover, and distance-k domination on planar and Euler-genus-bounded graphs. References use verified PDF pages; contents-page offsets differ. Chapter III bounds also published at PODC 2026 are indexed once under that paper."
    }
  ],
  "sourceResults": [
    {
      "id": "sparse-expansion-constant",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Bounded expansion",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "O(1)",
      "rounds": "O(1)",
      "roundClass": "parameter",
      "parameters": "Fixed integer upper bound ∇₁ > 0 on the edge density of depth-1 minors. Both the approximation ratio and round complexity depend on ∇₁.",
      "assumptions": "Unique identifiers; an upper bound on ∇₁ is supplied; no embedding is supplied.",
      "paperId": "heydt-sparse-2022",
      "theorem": "Theorem 2.1 and following parameter-dependence discussion",
      "summary": "The approximation ratio and round complexity are bounded functions of the depth-1 density bound.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2207.02669#page=5",
      "year": 2022,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "expansion"
      },
      "approximationDisplay": "f(∇₁)",
      "roundsDisplay": "f(∇₁)",
      "approximationParameters": [
        {
          "symbol": "∇₁",
          "name": "depth-one density",
          "introduced": false,
          "displaySymbol": true
        }
      ],
      "roundParameters": [
        {
          "symbol": "∇₁",
          "name": "depth-one density",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(∇₁)",
        "tex": "f\\bigl(\\nabla_1\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2207.02669#page=5",
            "title": "Distributed domination on sparse graph classes",
            "location": "Theorem 2.1 and following parameter-dependence discussion"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Supplied upper bound on depth-one minor density",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-18d80e24949ad78541c0",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-18eb64ecbc1e49e9ea9e"
        ],
        "assumptions": [
          "auto-assumption-a3374a86e4b667605804"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-a3374a86e4b667605804",
          "auto-graph-18d80e24949ad78541c0",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-18eb64ecbc1e49e9ea9e",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "sparse-planar-eleven",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "11 + ε",
      "rounds": "O(1)",
      "roundClass": "parameter",
      "parameters": "Fixed ε > 0; the round complexity depends on ε.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "heydt-sparse-2022",
      "theorem": "Abstract",
      "summary": "The planar specialization improves the approximation guarantee.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2207.02669",
      "year": 2022,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "11 + ε",
      "roundsDisplay": "f(ε)",
      "roundParameters": [
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(ε)",
        "tex": "f\\bigl(\\varepsilon\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2207.02669",
            "title": "Distributed domination on sparse graph classes",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierComparisons": [
        {
          "better": "gen-asw26-planar",
          "worse": "sparse-planar-eleven",
          "strict": [
            "approximation"
          ],
          "conditions": {
            "problem": "Both solve unweighted minimum dominating set and output an integral vertex set.",
            "graphClass": "Both guarantees hold on all planar graphs; no graph-class strengthening is inferred.",
            "approximation": "The exact coefficient 7 is strictly smaller than 11 + ε for every ε > 0.",
            "rounds": "The newer round complexity is a universal constant, independent of ε. The older bound is f(ε), with its accuracy dependence retained. At the advertised asymptotic level the universal O(1) bound has no accuracy-dependent overhead. This does not compare unknown numerical round counts or identify f(ε) with a universal constant.",
            "model": "The newer algorithm uses broadcast CONGEST and therefore also works in LOCAL; message restrictions are stronger, not an extra graph or input requirement.",
            "randomness": "Both algorithms are deterministic.",
            "benchmark": "The newer integral output is bounded against fractional OPT, which is at most integral OPT; it therefore also satisfies the older integral-OPT convention.",
            "assumptions": "Use the standard unique O(log n)-bit identifier convention. Neither statement requires an embedding, a maximum-degree bound, or an externally supplied solution. This certificate does not apply to variants with a different initial-information convention."
          },
          "evidenceUrl": "https://arxiv.org/pdf/2611.02057",
          "reason": "Exact factor 7 replaces the 11 + ε planar guarantee using a universal constant round complexity, while the earlier round complexity depends on ε. The source introduction traces the constant-factor improvements; Theorem C(i) gives the new guarantee."
        }
      ],
      "dominatedBy": [
        "gen-asw26-planar"
      ],
      "frontierStatus": "dominated",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-34f494bd0c1a858c0a42"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-34f494bd0c1a858c0a42",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "chang-independent-logstar",
      "problem": "Independent set",
      "variant": "Unweighted",
      "objective": "max",
      "graphClass": "Excluded fixed minor",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − ε",
      "rounds": "O(ε⁻¹ log* n) + ε⁻O(1)",
      "roundClass": "logstar",
      "parameters": "Fixed excluded minor and 0 < ε < 1.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "chang-minor-2023",
      "theorem": "Abstract",
      "summary": "A deterministic approximation scheme with bounded messages.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2304.04699",
      "year": 2023,
      "problemScope": {
        "node": "independent-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "O(ε⁻¹ log* n) + ε⁻O(1)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(ε⁻¹ log* n) + ε⁻O(1)",
        "tex": "O(\\varepsilon^{-1}\\log^*n)+\\varepsilon^{-O(1)}",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2304.04699",
            "title": "Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Unweighted maximum independent set; deterministic CONGEST; fixed nonplanar excluded minor H and fixed 0 < ε < 1/2; (1−ε) times the integral optimum.",
        "reason": "Optimal Θ(log* n) dependence on n for fixed H and ε. The March 2026 version gives the upper bound and a matching LOCAL lower bound on paths and cycles. This does not certify optimal dependence on H or ε.",
        "evidenceUrl": "https://arxiv.org/pdf/2304.04699v2",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-nonplanar-H",
          "parameter-epsilon-half"
        ]
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "minor-free-independent-n-rounds",
          "resultId": "chang-independent-logstar",
          "graphs": [
            "minor",
            "planar",
            "outerplanar",
            "forest",
            "path",
            "oriented-path",
            "cycle"
          ],
          "problems": [
            "independent-set"
          ],
          "models": [
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": [
            "scope-rounds-n-H-epsilon",
            "parameter-nonplanar-H",
            "parameter-epsilon-half"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-e40ef97c3969c67aad8c",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-ce8a0b4b55d3e5cea9b6"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-e40ef97c3969c67aad8c",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-4ad7b7801c4e84e8fdd9",
          "auto-parameter-ce8a0b4b55d3e5cea9b6",
          "parameter-epsilon-positive",
          "parameter-epsilon-unit",
          "parameter-fixed-H",
          "parameter-fixed-epsilon",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "supported-client-planar",
      "problem": "Client dominating set",
      "variant": "Minimum client dominating set",
      "objective": "min",
      "graphClass": "Planar",
      "model": "SUPPORTED",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "O(1)",
      "roundClass": "parameter",
      "parameters": "Fixed ε > 0; only online rounds are counted.",
      "assumptions": "Preprocessing of the support topology is allowed. Only the designated clients must be dominated.",
      "paperId": "agrawal-supported-2022",
      "theorem": "Abstract",
      "summary": "A scheme for recurring client sets; preprocessing is essential.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2212.14542",
      "year": 2022,
      "problemScope": {
        "node": "client-dominating-set"
      },
      "problemSource": "Dominating set",
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "f(ε)",
      "roundParameters": [
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(ε)",
        "tex": "f\\bigl(\\varepsilon\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2212.14542",
            "title": "Recurrent Problems in the LOCAL model",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted",
          "model-supported-preprocessing"
        ],
        "parameters": [
          "auto-parameter-47955123d1ab13811753"
        ],
        "assumptions": [
          "auto-assumption-40b36c6041358c068e48"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-40b36c6041358c068e48",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-b67c8cccac8764b919fe",
          "auto-output-750423ed7257675c4903",
          "auto-parameter-47955123d1ab13811753",
          "model-supported-preprocessing",
          "output-client-domination",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "dory-weighted-domination",
      "problem": "Dominating set",
      "variant": "Weighted",
      "objective": "min",
      "graphClass": "Arboricity ≤ α",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(2α + 1)(1 + ε)",
      "rounds": "O(ε⁻¹ log Δ)",
      "roundClass": "degree",
      "parameters": "0 < ε < 1; α is known. Δ is the maximum degree.",
      "assumptions": "Positive integer vertex weights bounded by nᶜ for a constant c.",
      "paperId": "dory-arboricity-2022",
      "theorem": "Abstract",
      "summary": "A primal-dual algorithm with logarithmic degree dependence.",
      "verification": "primary",
      "sourceUrl": "https://link.springer.com/article/10.1007/s00446-023-00447-z",
      "year": 2022,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "density",
        "note": "Use compatible fixed arboricity bounds; planar inputs permit an arboricity bound of 3."
      },
      "approximationDisplay": "(2α + 1)(1 + ε)",
      "roundsDisplay": "O(ε⁻¹ log Δ)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(ε⁻¹ log Δ)",
        "tex": "O(\\varepsilon^{-1}\\log\\Delta)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://link.springer.com/article/10.1007/s00446-023-00447-z",
            "title": "Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "c",
          "description": "Fixed exponent bounding positive integer vertex weights by n^c",
          "tex": "c"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication network",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "α",
          "description": "Arboricity bound of the input graph",
          "tex": "\\alpha"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-97a0a2af0e526b2ffcd5",
          "weights-weighted"
        ],
        "parameters": [
          "auto-parameter-c1636b1b5a093071fc57"
        ],
        "assumptions": [
          "auto-assumption-895ecf81e2a512b52c01"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-895ecf81e2a512b52c01",
          "auto-graph-97a0a2af0e526b2ffcd5",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-c1636b1b5a093071fc57",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "dory-arboricity-lower",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Arboricity 2",
      "model": "LOCAL",
      "randomization": "Randomized",
      "bound": "lower",
      "approximation": "Constant or polylogarithmic factor",
      "rounds": "Ω(log Δ / log log Δ)",
      "roundClass": "degree",
      "parameters": "Δ is the maximum degree.",
      "assumptions": "Unweighted graphs; the lower bound applies to deterministic and randomized LOCAL algorithms.",
      "paperId": "dory-arboricity-2022",
      "theorem": "Lower bound theorem",
      "summary": "Bounded arboricity alone does not give constant-round domination.",
      "verification": "primary",
      "sourceUrl": "https://pmc.ncbi.nlm.nih.gov/articles/PMC11543758/",
      "year": 2022,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "arboricity-two"
      },
      "approximationDisplay": "Constant or polylogarithmic factor",
      "roundsDisplay": "Ω(log Δ / log log Δ)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Ω(log Δ / log log Δ)",
        "tex": "\\Omega\\!\\left(\\frac{\\log\\Delta}{\\log\\log\\Delta}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://pmc.ncbi.nlm.nih.gov/articles/PMC11543758/",
            "title": "Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs",
            "location": "Lower bound theorem"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "arboricity-domination-rounds",
          "resultId": "dory-arboricity-lower",
          "graphs": [
            "arboricity-two",
            "density"
          ],
          "problems": [
            "dominating-set"
          ],
          "models": [
            "LOCAL",
            "CONGEST"
          ],
          "conditionIds": [
            "parameter-fixed-alpha-ge2"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a6106837b5e5e7d68a12",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-0bb93829ec58e258a2dd"
        ],
        "assumptions": [
          "auto-assumption-c882a0c21e6fc58b26e1"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-c882a0c21e6fc58b26e1",
          "auto-graph-a6106837b5e5e7d68a12",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-0bb93829ec58e258a2dd",
          "parameter-alpha-ge1",
          "parameter-fixed-alpha",
          "parameter-fixed-alpha-ge2",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "chang-su-matching",
      "problem": "Maximum matching",
      "variant": "Weighted",
      "objective": "max",
      "graphClass": "Excluded fixed minor",
      "model": "CONGEST",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "1 − ε",
      "rounds": "poly(log n, 1/ε)",
      "roundClass": "polylog",
      "parameters": "Fixed excluded minor and 0 < ε < 1.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "chang-su-2022",
      "theorem": "Abstract",
      "summary": "Expander decomposition permits bounded-message approximation.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2205.08093",
      "year": 2022,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "poly(log n, 1/ε)",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "poly(log n, 1/ε)",
        "tex": "\\operatorname{poly}(\\log n,1/\\varepsilon)",
        "basis": "stated",
        "explanation": "Theorem 1.1 states this bound for randomized CONGEST maximum weighted matching on H-minor-free graphs. The multiplicative constant may depend on H; the O(1) exponents are explicitly independent of H. Their numerical values are not specified.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2205.08093",
            "title": "Narrowing the LOCAL–CONGEST Gaps in Sparse Networks via Expander Decompositions",
            "location": "Theorem 1.1 and the paragraph immediately following it (PDF p. 5); matching analysis near Theorem 1.1 proof"
          }
        ],
        "parameters": [
          {
            "symbol": "ε",
            "description": "Approximation accuracy, 0 < ε < 1",
            "tex": "\\varepsilon"
          },
          {
            "symbol": "H",
            "description": "Fixed graph excluded as a minor",
            "tex": "H"
          },
          {
            "symbol": "n",
            "description": "Number of vertices",
            "tex": "n"
          }
        ],
        "checked": "2026-11-16",
        "audited": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "n",
          "description": "Number of vertices",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy, 0 < ε < 1",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-e40ef97c3969c67aad8c",
          "weights-weighted"
        ],
        "parameters": [
          "auto-parameter-ce8a0b4b55d3e5cea9b6"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-e40ef97c3969c67aad8c",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-ce8a0b4b55d3e5cea9b6",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "chang-su-independent",
      "problem": "Independent set",
      "variant": "Unweighted",
      "objective": "max",
      "graphClass": "Excluded fixed minor",
      "model": "CONGEST",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "1 − ε",
      "rounds": "poly(log n, 1/ε)",
      "roundClass": "polylog",
      "parameters": "Fixed excluded minor and 0 < ε < 1.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "chang-su-2022",
      "theorem": "Abstract",
      "summary": "Expander decomposition permits bounded-message approximation.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2205.08093",
      "year": 2022,
      "problemScope": {
        "node": "independent-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "poly(log n, 1/ε)",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "poly(log n, 1/ε)",
        "tex": "\\operatorname{poly}(\\log n,1/\\varepsilon)",
        "basis": "stated",
        "explanation": "Theorem 1.2 gives this randomized CONGEST bound. It separately gives a deterministic bound ε^(−O(1)) · 2^(O(√(log n log log n))); that deterministic statement must not replace this randomized row. No numerical polynomial exponents are stated.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2205.08093",
            "title": "Narrowing the LOCAL–CONGEST Gaps in Sparse Networks via Expander Decompositions",
            "location": "Theorem 1.2 (PDF p. 5)"
          }
        ],
        "parameters": [
          {
            "symbol": "ε",
            "description": "Approximation accuracy, 0 < ε < 1",
            "tex": "\\varepsilon"
          },
          {
            "symbol": "H",
            "description": "Fixed graph excluded as a minor",
            "tex": "H"
          },
          {
            "symbol": "n",
            "description": "Number of vertices",
            "tex": "n"
          }
        ],
        "checked": "2026-11-16",
        "audited": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "n",
          "description": "Number of vertices",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy, 0 < ε < 1",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-e40ef97c3969c67aad8c",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-ce8a0b4b55d3e5cea9b6"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-e40ef97c3969c67aad8c",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-4ad7b7801c4e84e8fdd9",
          "auto-parameter-ce8a0b4b55d3e5cea9b6",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "heydt-planar-twenty",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "20",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "No fixed degree bound is required.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "heydt-planar-2021",
      "theorem": "Abstract",
      "summary": "Historical bound combining local reductions and greedy domination.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2111.14506v1",
      "year": 2021,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "20",
      "roundsDisplay": "Constant",
      "roundCountEvidence": {
        "basis": "not-specified",
        "explanation": "The paper gives two rounds for D1 and two further rounds for D2, and mentions thirty greedy iterations. These are not a complete communication count: the residual-degree updates and selection notifications also require communication. The available description does not give a verified total for the full algorithm.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2111.14506v1",
            "title": "Primary source reviewed",
            "location": "Section 3 PDF p. 4; Section 4 PDF p. 5; Section 5 PDF p. 7; introduction PDF p. 2"
          }
        ],
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "Constant",
        "tex": "\\text{Constant}",
        "basis": "not-specified",
        "explanation": "The paper gives two rounds for D1 and two further rounds for D2, and mentions thirty greedy iterations. These are not a complete communication count: the residual-degree updates and selection notifications also require communication. The available description does not give a verified total for the full algorithm.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2111.14506v1",
            "title": "Primary source reviewed",
            "location": "Section 3 PDF p. 4; Section 4 PDF p. 5; Section 5 PDF p. 7; introduction PDF p. 2"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierComparisons": [
        {
          "better": "gen-asw26-planar",
          "worse": "heydt-planar-twenty",
          "strict": [
            "approximation"
          ],
          "conditions": {
            "problem": "Both solve unweighted minimum dominating set and output an integral vertex set.",
            "graphClass": "Both guarantees hold on all planar graphs; no graph-class strengthening is inferred.",
            "approximation": "The exact coefficient 7 is strictly smaller than 20.",
            "rounds": "Both cataloged statements give a universal constant round complexity. This comparison concerns the stated asymptotic round complexity, not unknown absolute round counts.",
            "model": "The newer algorithm uses broadcast CONGEST and therefore also works in LOCAL; message restrictions are stronger, not an extra graph or input requirement.",
            "randomness": "Both algorithms are deterministic.",
            "benchmark": "The newer integral output is bounded against fractional OPT, which is at most integral OPT; it therefore also satisfies the older integral-OPT convention.",
            "assumptions": "Use the standard unique O(log n)-bit identifier convention. Neither statement requires an embedding, a maximum-degree bound, or an externally supplied solution. This certificate does not apply to variants with a different initial-information convention."
          },
          "evidenceUrl": "https://arxiv.org/pdf/2611.02057",
          "reason": "Exact factor 7 replaces the 20 planar guarantee within the advertised unspecified constant-round regime. The source introduction traces the constant-factor improvements; Theorem C(i) gives the new guarantee."
        }
      ],
      "dominatedBy": [
        "gen-asw26-planar"
      ],
      "frontierStatus": "dominated",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-368afe424cc1014e2254"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-368afe424cc1014e2254",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "morgan-arboricity",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Arboricity ≤ α",
      "model": "CONGEST",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "O(α)",
      "rounds": "O(α log n)",
      "roundClass": "logarithmic",
      "parameters": "α is the arboricity bound.",
      "assumptions": "Unweighted; the stated round complexity is achieved with high probability.",
      "paperId": "morgan-arboricity-2021",
      "theorem": "Abstract",
      "summary": "A combinatorial alternative to LP rounding.",
      "verification": "primary",
      "sourceUrl": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.33",
      "year": 2021,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "density",
        "note": "Use compatible fixed arboricity bounds; planar inputs permit an arboricity bound of 3."
      },
      "approximationDisplay": "O(α)",
      "roundsDisplay": "O(α log n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(α log n)",
        "tex": "O(\\alpha  \\log n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.33",
            "title": "Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs: Simpler, Faster, and Combinatorial",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "α",
          "description": "Arboricity bound of the input graph",
          "tex": "\\alpha"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-97a0a2af0e526b2ffcd5",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-d6747b2e215206975909"
        ],
        "assumptions": [
          "auto-assumption-8e4374cee15dc4d80d36"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-8e4374cee15dc4d80d36",
          "auto-graph-97a0a2af0e526b2ffcd5",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-d6747b2e215206975909",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "outerplanar-five",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Outerplanar",
      "model": "Anonymous",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "5",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "No fixed degree bound is required.",
      "assumptions": "Only degrees and neighbors’ degree categories are needed; unique IDs are unnecessary.",
      "paperId": "bonamy-outerplanar-2021",
      "theorem": "Theorem 1",
      "summary": "A degree-based algorithm with a tight constant guarantee.",
      "verification": "primary",
      "sourceUrl": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.13",
      "year": 2021,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "outerplanar"
      },
      "approximationDisplay": "5",
      "roundsDisplay": "1",
      "roundCountEvidence": {
        "basis": "stated",
        "explanation": "Algorithm 1 explicitly uses the first round to exchange local degrees. Each vertex then selects itself if its degree is at least four or if it has no neighbor of degree at least four. The source assumes incident ports and local degree are initially available. Neither identifiers nor an embedding are needed.",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol209-disc2021/LIPIcs.DISC.2021.13/LIPIcs.DISC.2021.13.pdf#page=2",
            "title": "Primary source communication schedule",
            "location": "Theorem 1; Algorithm 1, PDF p. 2 (printed 13:2)"
          }
        ],
        "rounds": "1",
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "1",
        "tex": "1",
        "basis": "stated",
        "explanation": "Algorithm 1 explicitly uses the first round to exchange local degrees. Each vertex then selects itself if its degree is at least four or if it has no neighbor of degree at least four. The source assumes incident ports and local degree are initially available. Neither identifiers nor an embedding are needed.",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol209-disc2021/LIPIcs.DISC.2021.13/LIPIcs.DISC.2021.13.pdf#page=2",
            "title": "Primary source communication schedule",
            "location": "Theorem 1; Algorithm 1, PDF p. 2 (printed 13:2)"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Unweighted MDS on outerplanar graphs; deterministic one-round LOCAL algorithm; integral optimum. The round count uses the source convention that local degree and incident ports are initially available.",
        "reason": "Theorem 1 gives factor 5, with the one-round implementation stated in Algorithm 1. Its matching lower bound rules out every smaller factor even with an arbitrary constant number of LOCAL rounds. The algorithm does not require identifiers or an embedding; no claim that one round is necessary is made.",
        "evidenceUrl": "https://arxiv.org/abs/2108.02697v2",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "tightness": [
        {
          "certificateId": "outerplanar-factor-five",
          "resultId": "outerplanar-five",
          "graphs": [
            "outerplanar"
          ],
          "problems": [
            "dominating-set"
          ],
          "models": [
            "Anonymous",
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": []
        }
      ],
      "parameterDefinitions": [],
      "setting": {
        "summary": [
          "auto-graph-2379fa66cc1a5f1d4e5c",
          "weights-unweighted",
          "model-port-numbering",
          "input-own-degree",
          "input-incident-ports"
        ],
        "parameters": [
          "auto-parameter-368afe424cc1014e2254"
        ],
        "assumptions": [],
        "detail": [
          "strength-no-ids"
        ],
        "covered": [
          "auto-graph-2379fa66cc1a5f1d4e5c",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-92362405df7c8f0d5040",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-368afe424cc1014e2254",
          "input-incident-ports",
          "input-own-degree",
          "model-port-numbering",
          "strength-no-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "outerplanar-five-lower",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Outerplanar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "approximation": "No (5 − ε)-approximation",
      "rounds": "O(1) rounds ruled out",
      "roundClass": "constant",
      "parameters": "Any fixed ε > 0.",
      "assumptions": "Deterministic LOCAL algorithms, including algorithms with unique IDs.",
      "paperId": "bonamy-outerplanar-2021",
      "theorem": "Theorem 1",
      "summary": "No smaller constant factor is possible in constant time.",
      "verification": "primary",
      "sourceUrl": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.13",
      "year": 2021,
      "roundBudgetExcluded": true,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "outerplanar"
      },
      "approximationDisplay": "> 5 − ε",
      "roundsDisplay": "Constant rounds ruled out",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Constant rounds ruled out",
        "tex": "\\text{Constant rounds ruled out}",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.13",
            "title": "A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs",
            "location": "Theorem 1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "outerplanar-factor-five",
          "resultId": "outerplanar-five-lower",
          "graphs": [
            "outerplanar"
          ],
          "problems": [
            "dominating-set"
          ],
          "models": [
            "LOCAL",
            "CONGEST"
          ],
          "conditionIds": []
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-2379fa66cc1a5f1d4e5c",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-8359c573af80d8ec5226"
        ],
        "assumptions": [
          "auto-assumption-89aac91807f1f88e4b7c"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-89aac91807f1f88e4b7c",
          "auto-graph-2379fa66cc1a5f1d4e5c",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-8359c573af80d8ec5226",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "kublenz-expansion",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Bounded expansion",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "O(1)",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "Known upper bound ∇₁ on the edge density of depth-1 minors; t is the least integer such that Kₜ,ₜ is absent as a subgraph, with t ≤ 2∇₁ + 1. The approximation ratio depends on these parameters; the number of LOCAL communication rounds is universally bounded.",
      "assumptions": "Unique identifiers; an upper bound on ∇₁ is supplied; no embedding is supplied.",
      "paperId": "kublenz-expansion-2020",
      "theorem": "Theorem 1.1; Section 6 (corrected v3)",
      "summary": "The corrected algorithm uses a universal constant number of LOCAL communication phases; its approximation ratio depends on the depth-1 density.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2012.02701v3#S6",
      "year": 2020,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "expansion"
      },
      "approximationDisplay": "f(∇₁)",
      "roundsDisplay": "≤ 11",
      "approximationParameters": [
        {
          "symbol": "∇₁",
          "name": "depth-one density",
          "introduced": false,
          "displaySymbol": true
        }
      ],
      "roundCountEvidence": {
        "basis": "phase-count",
        "explanation": "A conservative sequential count is 3 + 7 + 1 = 11: two rounds to inspect radius-two neighborhoods and one to mark neighbors of D1; then two neighborhood exchanges, two rounds to compute sequences, two to report their endpoints, and one to mark neighbors of D2; finally, the source includes a last selection step. This includes that final step conservatively and does not claim an optimized schedule. The algorithm uses distinct identifiers and a supplied upper bound on depth-one density.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2012.02701v3#page=15",
            "title": "Primary source communication schedule",
            "location": "Section 2, PDF pp. 6–7; Section 6, PDF p. 15; corrected arXiv v3"
          }
        ],
        "rounds": "≤ 11",
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "≤ 11",
        "tex": "\\le 11",
        "basis": "phase-count",
        "explanation": "A conservative sequential count is 3 + 7 + 1 = 11: two rounds to inspect radius-two neighborhoods and one to mark neighbors of D1; then two neighborhood exchanges, two rounds to compute sequences, two to report their endpoints, and one to mark neighbors of D2; finally, the source includes a last selection step. This includes that final step conservatively and does not claim an optimized schedule. The algorithm uses distinct identifiers and a supplied upper bound on depth-one density.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2012.02701v3#page=15",
            "title": "Primary source communication schedule",
            "location": "Section 2, PDF pp. 6–7; Section 6, PDF p. 15; corrected arXiv v3"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Supplied upper bound on depth-one minor density",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "t",
          "description": "Least integer for which the complete bipartite graph K_{t,t} is absent as a subgraph; t ≤ 2∇₁+1",
          "tex": "t"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-18d80e24949ad78541c0",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-399ec73f7f5ad61ad9de"
        ],
        "assumptions": [
          "auto-assumption-a3374a86e4b667605804"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-a3374a86e4b667605804",
          "auto-graph-18d80e24949ad78541c0",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-399ec73f7f5ad61ad9de",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "amiri-locally-embeddable",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Locally embeddable",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "6c²t + (2t + 5)c + 4",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "∇₁(G) is the maximum edge density |E(H)|/|V(H)| over nonempty depth-1 minors H of G. The supplied integer c satisfies c ≥ ∇₁(G); one may take c=⌈∇₁(G)⌉ if supplied. For a fixed integer t ≥ 3, K₃,ₜ is excluded as a depth-1 minor. The approximation ratio depends on c and t; the number of LOCAL communication rounds is universally bounded.",
      "assumptions": "Unique identifiers; a supplied integer c bounds the edge density of every depth-1 minor; no embedding is supplied.",
      "paperId": "amiri-beyond-2017",
      "theorem": "Algorithm 1; Lemma 3.8",
      "summary": "A fixed number of LOCAL communication phases gives an approximation depending on the local embeddability parameters.",
      "verification": "primary",
      "sourceUrl": "https://schmiste.github.io/talg19ds.pdf#page=11",
      "year": 2017,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "local-embedding"
      },
      "approximationDisplay": "6c²t + (2t + 5)c + 4",
      "roundsDisplay": "≤ 6",
      "roundCountEvidence": {
        "basis": "phase-count",
        "explanation": "Rounds 1–2: exchange identifiers then neighbor lists; decide phase-one set D using adjacencies from N(v) to candidate vertices in N²(v). Round 3: broadcast D membership; each vertex knows whether it lies in N[D]. Round 4: broadcast uncovered flags; each vertex computes residual closed-neighborhood degree. Round 5: broadcast residual degrees; each uncovered vertex chooses its dominator. Round 6: notify selected neighbors; all vertices know final membership. The source initially gives only each vertex its own ID. Unbounded LOCAL messages permit the lists. Auxiliary density c and excluded-depth-one-minor t affect local computation/analysis, not communication phases.",
        "evidence": [
          {
            "url": "https://schmiste.github.io/talg19ds.pdf#page=7",
            "title": "Primary source algorithm",
            "location": "Algorithm 1, PDF pp. 6–7; modified density threshold; Lemma 3.8"
          }
        ],
        "rounds": "≤ 6",
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "≤ 6",
        "tex": "\\le 6",
        "basis": "phase-count",
        "explanation": "Rounds 1–2: exchange identifiers then neighbor lists; decide phase-one set D using adjacencies from N(v) to candidate vertices in N²(v). Round 3: broadcast D membership; each vertex knows whether it lies in N[D]. Round 4: broadcast uncovered flags; each vertex computes residual closed-neighborhood degree. Round 5: broadcast residual degrees; each uncovered vertex chooses its dominator. Round 6: notify selected neighbors; all vertices know final membership. The source initially gives only each vertex its own ID. Unbounded LOCAL messages permit the lists. Auxiliary density c and excluded-depth-one-minor t affect local computation/analysis, not communication phases.",
        "evidence": [
          {
            "url": "https://schmiste.github.io/talg19ds.pdf#page=7",
            "title": "Primary source algorithm",
            "location": "Algorithm 1, PDF pp. 6–7; modified density threshold; Lemma 3.8"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁(G)",
          "description": "Maximum edge-to-vertex ratio over nonempty depth-one minors of G",
          "tex": "\\nabla_1(G)"
        },
        {
          "symbol": "∇₁",
          "description": "Depth-one minor density of the input graph",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "G",
          "description": "Input graph",
          "tex": "G"
        },
        {
          "symbol": "H",
          "description": "A minor of the input graph; depth one in the locally embeddable result",
          "tex": "H"
        },
        {
          "symbol": "c",
          "description": "Supplied integer upper bound on depth-one minor density ∇₁(G)",
          "tex": "c"
        },
        {
          "symbol": "t",
          "description": "Integer at least three such that K_{3,t} is excluded as a depth-one minor",
          "tex": "t"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-3e2ec5f6ef8ff6c28460",
          "weights-unweighted",
          "parameter-depth-one-excluded-k3t",
          "input-integer-depth-one-density"
        ],
        "parameters": [
          "parameter-depth-one-density-definition"
        ],
        "assumptions": [
          "input-distinct-ids",
          "strength-no-embedding"
        ],
        "detail": [
          "detail-depth-one-integer-ceiling"
        ],
        "covered": [
          "auto-graph-3e2ec5f6ef8ff6c28460",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "detail-depth-one-integer-ceiling",
          "input-distinct-ids",
          "input-integer-depth-one-density",
          "parameter-depth-one-density-definition",
          "parameter-depth-one-excluded-k3t",
          "strength-no-embedding",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "amiri-genus-ptas",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Bounded genus",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "O(log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed genus g and ε > 0.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "amiri-beyond-2017",
      "theorem": "Abstract",
      "summary": "A local approximation scheme for bounded genus.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/1705.09617",
      "year": 2017,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "orientable",
        "note": "The historical record does not establish applicability to every bounded Euler-genus family."
      },
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "O(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log* n)",
        "tex": "O(\\log^* n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/1705.09617",
            "title": "Distributed Dominating Set Approximations beyond Planar Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "g",
          "description": "Fixed genus bound in the convention of the source",
          "tex": "g"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-328b3babf04eeaf07339",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-09168808af1df2c8e6de"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-328b3babf04eeaf07339",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-09168808af1df2c8e6de",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "czygrinow-topological-dom",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Excluded topological Kₕ",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "O(1)",
      "rounds": "O(1)",
      "roundClass": "parameter",
      "parameters": "Fixed h; both constants depend on h.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "czygrinow-minor-2018",
      "theorem": "Abstract",
      "summary": "Constant-factor domination under topological-minor exclusion.",
      "verification": "primary",
      "sourceUrl": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.22",
      "year": 2018,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "topological"
      },
      "approximationDisplay": "f(h)",
      "roundsDisplay": "f(h)",
      "approximationParameters": [
        {
          "symbol": "h",
          "name": "excluded minor size",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundParameters": [
        {
          "symbol": "h",
          "name": "excluded minor size",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(h)",
        "tex": "f\\bigl(h\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.22",
            "title": "Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "h",
          "description": "Number of vertices in the excluded complete graph K_h",
          "tex": "h"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-f06d27c0e3b1ee4832f6",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-37cf69063665c567a1b7"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-f06d27c0e3b1ee4832f6",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-37cf69063665c567a1b7",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "czygrinow-minor-ptas",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Excluded Kₕ minor",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "O(log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed h and ε > 0.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "czygrinow-minor-2018",
      "theorem": "Abstract",
      "summary": "A scheme on a proper minor-closed family.",
      "verification": "primary",
      "sourceUrl": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.22",
      "year": 2018,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "O(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log* n)",
        "tex": "O(\\log^* n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.22",
            "title": "Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "h",
          "description": "Number of vertices in the excluded complete graph K_h",
          "tex": "h"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-0c9054ce7c0f254cff8a",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-54a27f04a63e72da0dd9"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-0c9054ce7c0f254cff8a",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-54a27f04a63e72da0dd9",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "amiri-distance",
      "problem": "Distance-r dominating set",
      "variant": "Distance r",
      "objective": "min",
      "graphClass": "Bounded expansion",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "O(1)",
      "rounds": "O(r² log n)",
      "roundClass": "logarithmic",
      "parameters": "Fixed expansion class and distance r.",
      "assumptions": "Broadcast CONGEST; connected output requires a connected input.",
      "paperId": "amiri-distance-2017",
      "theorem": "Abstract",
      "summary": "Sparse neighborhood covers yield an approximation.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/1702.02848",
      "year": 2017,
      "problemScope": {
        "node": "distance-dominating-set"
      },
      "problemParameter": "r",
      "problemParameterName": "distance radius",
      "problemSource": "Distance dominating set",
      "graphScope": {
        "node": "expansion"
      },
      "approximationDisplay": "F(r, f)",
      "roundsDisplay": "O(r² log n)",
      "approximationParameters": [
        {
          "symbol": "r",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "f",
          "name": "expansion function",
          "introduced": false,
          "displaySymbol": true
        }
      ],
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(r² log n)",
        "tex": "O(r^2\\log n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/1702.02848",
            "title": "Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "F",
          "description": "Unspecified function of the displayed parameters",
          "tex": "F"
        },
        {
          "symbol": "f",
          "description": "Expansion function bounding shallow-minor edge densities at each radius",
          "tex": "f",
          "sourceSymbol": "class"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "r"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-18d80e24949ad78541c0",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-4896d040e95ba8df7a1b"
        ],
        "assumptions": [
          "auto-assumption-a1335d5c279ce2f65aa3"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-a1335d5c279ce2f65aa3",
          "auto-graph-18d80e24949ad78541c0",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-4bc26b2a562297a647e1",
          "auto-parameter-4896d040e95ba8df7a1b",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "amiri-connected-distance",
      "problem": "Connected distance-r dominating set",
      "variant": "Connected distance r",
      "objective": "min",
      "graphClass": "Bounded expansion",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "O(1)",
      "rounds": "O(r² log n)",
      "roundClass": "logarithmic",
      "parameters": "Fixed expansion class and distance r.",
      "assumptions": "Broadcast CONGEST; connected output requires a connected input.",
      "paperId": "amiri-distance-2017",
      "theorem": "Abstract",
      "summary": "Sparse neighborhood covers yield an approximation.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/1702.02848",
      "year": 2017,
      "problemScope": {
        "node": "connected-distance-dominating-set"
      },
      "problemParameter": "r",
      "problemParameterName": "distance radius",
      "problemSource": "Connected dominating set",
      "graphScope": {
        "node": "expansion"
      },
      "approximationDisplay": "F(r, f)",
      "roundsDisplay": "O(r² log n)",
      "approximationParameters": [
        {
          "symbol": "r",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "f",
          "name": "expansion function",
          "introduced": false,
          "displaySymbol": true
        }
      ],
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(r² log n)",
        "tex": "O(r^2\\log n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/1702.02848",
            "title": "Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "F",
          "description": "Unspecified function of the displayed parameters",
          "tex": "F"
        },
        {
          "symbol": "f",
          "description": "Expansion function bounding shallow-minor edge densities at each radius",
          "tex": "f",
          "sourceSymbol": "class"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "r"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-18d80e24949ad78541c0",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-4896d040e95ba8df7a1b"
        ],
        "assumptions": [
          "auto-assumption-a1335d5c279ce2f65aa3"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-a1335d5c279ce2f65aa3",
          "auto-graph-18d80e24949ad78541c0",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-f0d9c1f064503cf5f16e",
          "auto-parameter-4896d040e95ba8df7a1b",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "amiri-planar-connected",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "O(1)",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "No degree bound.",
      "assumptions": "Connected unweighted input; uses a constant-factor dominating set as a subroutine.",
      "paperId": "amiri-distance-2017",
      "theorem": "Abstract",
      "summary": "A local connector multiplies the domination ratio by at most six.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/1702.02848",
      "year": 2017,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "Constant",
      "roundsDisplay": "≤ 10",
      "roundCountEvidence": {
        "basis": "phase-count",
        "explanation": "The connecting procedure takes 3r + 1 rounds. With r = 1, this adds four rounds to the six-round planar dominating-set algorithm explicitly used in the paper, giving at most ten rounds in total. This is an upper bound for that composition, not a minimum-round claim. Inputs are connected, unweighted planar graphs with distinct identifiers.",
        "evidence": [
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Primary source for the algorithm",
            "location": "Section 5 Connected Dominating Sets; LPW PDF page 14"
          },
          {
            "url": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf#page=14",
            "title": "Lenzen–Pignolet–Wattenhofer, six-round schedule",
            "location": "Lemma 6.1"
          }
        ],
        "rounds": "≤ 10",
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "≤ 10",
        "tex": "\\le 10",
        "basis": "phase-count",
        "explanation": "The connecting procedure takes 3r + 1 rounds. With r = 1, this adds four rounds to the six-round planar dominating-set algorithm explicitly used in the paper, giving at most ten rounds in total. This is an upper bound for that composition, not a minimum-round claim. Inputs are connected, unweighted planar graphs with distinct identifiers.",
        "evidence": [
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Primary source for the algorithm",
            "location": "Section 5 Connected Dominating Sets; LPW PDF page 14"
          },
          {
            "url": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf#page=14",
            "title": "Lenzen–Pignolet–Wattenhofer, six-round schedule",
            "location": "Lemma 6.1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-a5c3105c54ebf1d906ab"
        ],
        "assumptions": [
          "auto-assumption-ce6b1c5257cc01ecf01a"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-ce6b1c5257cc01ecf01a",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-a5c3105c54ebf1d906ab",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "planar-two-dom-six",
      "problem": "2-domination (outside the solution)",
      "variant": "2-domination of vertices outside D",
      "objective": "min",
      "graphClass": "Planar",
      "model": "Anonymous",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "6",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "k = 2.",
      "assumptions": "Port numbering; only vertices outside the solution need two neighbors in it.",
      "paperId": "czygrinow-two-dom-2017",
      "theorem": "Theorem 1",
      "summary": "A degree-threshold algorithm improves the earlier factor seven.",
      "verification": "primary",
      "sourceUrl": "https://www.sciencedirect.com/science/article/pii/S0304397516307071",
      "year": 2017,
      "problemScope": {
        "node": "outside-k-domination"
      },
      "problemParameter": "2",
      "problemParameterName": "required neighbors outside the solution",
      "problemSource": "k-tuple dominating set",
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "6",
      "roundsDisplay": "2",
      "roundCountEvidence": {
        "basis": "stated",
        "explanation": "First round selects vertices of degree at least six. Second round adds vertices outside the first set that are not yet 2-dominated. Source also allows one round to obtain own degree. A conservative two-round implementation obtains degree by dummy messages in round 1, then exchanges high-degree flags in round 2 and decides output. Messages are one bit.",
        "evidence": [
          {
            "url": "https://www.sciencedirect.com/science/article/pii/S0304397516307071",
            "title": "Primary source algorithm",
            "location": "Section 2, Algorithm 1, first explanatory paragraph"
          }
        ],
        "rounds": "2",
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "2",
        "tex": "2",
        "basis": "stated",
        "explanation": "First round selects vertices of degree at least six. Second round adds vertices outside the first set that are not yet 2-dominated. Source also allows one round to obtain own degree. A conservative two-round implementation obtains degree by dummy messages in round 1, then exchanges high-degree flags in round 2 and decides output. Messages are one bit.",
        "evidence": [
          {
            "url": "https://www.sciencedirect.com/science/article/pii/S0304397516307071",
            "title": "Primary source algorithm",
            "location": "Section 2, Algorithm 1, first explanatory paragraph"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "Anonymous planar; constant rounds",
        "setting": "Unweighted outside-2 domination on planar graphs; deterministic port numbering without identifiers; two rounds and one-bit messages; integral OPT.",
        "reason": "Theorem 1 gives factor 6. The October 2026 transfer paper still uses this as its planar source. Its broader-genus 6+ε result has an additive loss and more rounds, so it does not dominate this point. No exact optimality claim is made: the anonymous lower-bound gap remains.",
        "evidenceUrl": "https://arxiv.org/html/2610.15596v1#S8",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "2",
          "description": "Required neighbors outside the solution",
          "tex": "2"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted",
          "model-port-numbering"
        ],
        "parameters": [
          "auto-parameter-cd4920bb34139c49b8f8"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-92362405df7c8f0d5040",
          "auto-output-ef1b974b591df8f63ec3",
          "auto-parameter-cd4920bb34139c49b8f8",
          "model-port-numbering",
          "output-outside-k",
          "output-outside-two",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "amiri-genus-constant",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Orientable genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "24g + O(1)",
      "rounds": "12g + O(1)",
      "roundClass": "parameter",
      "parameters": "Orientable genus at most g; both the approximation ratio and the number of communication rounds depend linearly on g.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "amiri-genus-2016",
      "theorem": "Theorem 15",
      "summary": "The preprocessing algorithm gives a 24g + O(1)-approximation in 12g + O(1) LOCAL rounds.",
      "verification": "primary",
      "sourceUrl": "https://schmiste.github.io/podc16.pdf#page=6",
      "year": 2016,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "orientable",
        "note": "The historical record does not establish applicability to every bounded Euler-genus family."
      },
      "approximationDisplay": "24g + O(1)",
      "roundsDisplay": "12g + O(1)",
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "12g + O(1)",
        "tex": "12g+O(1)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://schmiste.github.io/podc16.pdf#page=6",
            "title": "A Local Constant Factor MDS Approximation for Bounded Genus Graphs",
            "location": "Theorem 15"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "g",
          "description": "Orientable genus upper bound",
          "tex": "g"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-924a81ff2b56320e8d33",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-52b654b9ca9cab42e4ed"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-924a81ff2b56320e8d33",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-52b654b9ca9cab42e4ed",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "wawrzyniak-anonymous-694",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "Anonymous",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "694",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "No fixed degree bound is required.",
      "assumptions": "Port numbering; O(log n)-bit messages; no identifiers.",
      "paperId": "wawrzyniak-anonymous-2015",
      "theorem": "Abstract",
      "summary": "Constant-factor domination with anonymity and bounded messages.",
      "verification": "primary",
      "sourceUrl": "https://link.springer.com/article/10.1007/s00446-015-0247-6",
      "year": 2015,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "694",
      "roundsDisplay": "Constant",
      "roundCountEvidence": {
        "basis": "unavailable",
        "explanation": "The journal abstract gives factor 694 and constant round complexity with short messages, but the full algorithm was unavailable. The public arXiv:1303.2514v2 preprint proves the earlier factor 636; without confirming that the corrected journal algorithm has the same schedule, it does not certify a count for the factor-694 entry.",
        "evidence": [
          {
            "url": "https://link.springer.com/article/10.1007/s00446-015-0247-6",
            "title": "Primary source reviewed",
            "location": "Journal abstract; full algorithm unavailable"
          }
        ],
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "Constant",
        "tex": "\\text{Constant}",
        "basis": "unavailable",
        "explanation": "The journal abstract gives factor 694 and constant round complexity with short messages, but the full algorithm was unavailable. The public arXiv:1303.2514v2 preprint proves the earlier factor 636; without confirming that the corrected journal algorithm has the same schedule, it does not certify a count for the factor-694 entry.",
        "evidence": [
          {
            "url": "https://link.springer.com/article/10.1007/s00446-015-0247-6",
            "title": "Primary source reviewed",
            "location": "Journal abstract; full algorithm unavailable"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted",
          "model-port-numbering"
        ],
        "parameters": [
          "auto-parameter-368afe424cc1014e2254"
        ],
        "assumptions": [],
        "detail": [
          "strength-no-ids",
          "strength-log-n-bits"
        ],
        "covered": [
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-92362405df7c8f0d5040",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-368afe424cc1014e2254",
          "model-port-numbering",
          "strength-log-n-bits",
          "strength-no-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "wawrzyniak-planar-52",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "52",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "No fixed degree bound is required.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "wawrzyniak-52-2014",
      "theorem": "Abstract",
      "summary": "Sharper analysis of the earlier planar algorithm.",
      "verification": "primary",
      "sourceUrl": "https://www.sciencedirect.com/science/article/abs/pii/S0020019013002767",
      "year": 2014,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "52",
      "roundsDisplay": "6",
      "roundCountEvidence": {
        "basis": "same-algorithm",
        "explanation": "The 2014 paper proves factor 52 for the unchanged Lenzen–Pignolet–Wattenhofer algorithm. Its six-round schedule therefore remains valid. The count follows from the original Lemma 6.1; the accessible 2014 abstract does not state a separate total. Both results use the same identifiers and initial-information convention.",
        "evidence": [
          {
            "url": "https://www.sciencedirect.com/science/article/abs/pii/S0020019013002767",
            "title": "Primary source for the algorithm",
            "location": "Publisher abstract and section snippet; LPW PDF page 14"
          },
          {
            "url": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf#page=14",
            "title": "Lenzen–Pignolet–Wattenhofer, six-round schedule",
            "location": "Lemma 6.1"
          }
        ],
        "rounds": "6",
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "6",
        "tex": "6",
        "basis": "same-algorithm",
        "explanation": "The 2014 paper proves factor 52 for the unchanged Lenzen–Pignolet–Wattenhofer algorithm. Its six-round schedule therefore remains valid. The count follows from the original Lemma 6.1; the accessible 2014 abstract does not state a separate total. Both results use the same identifiers and initial-information convention.",
        "evidence": [
          {
            "url": "https://www.sciencedirect.com/science/article/abs/pii/S0020019013002767",
            "title": "Primary source for the algorithm",
            "location": "Publisher abstract and section snippet; LPW PDF page 14"
          },
          {
            "url": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf#page=14",
            "title": "Lenzen–Pignolet–Wattenhofer, six-round schedule",
            "location": "Lemma 6.1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-368afe424cc1014e2254"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-368afe424cc1014e2254",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "planar-two-dom-seven",
      "problem": "2-domination (outside the solution)",
      "variant": "2-domination of vertices outside D",
      "objective": "min",
      "graphClass": "Planar",
      "model": "Anonymous",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "7",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "k = 2.",
      "assumptions": "No identifiers required.",
      "paperId": "czygrinow-k-tuple-2014",
      "theorem": "Abstract",
      "summary": "Historical algorithm for two-fold domination.",
      "verification": "primary",
      "sourceUrl": "https://link.springer.com/chapter/10.1007/978-3-319-14472-6_4",
      "year": 2014,
      "problemScope": {
        "node": "outside-k-domination"
      },
      "problemParameter": "2",
      "problemParameterName": "required neighbors outside the solution",
      "problemSource": "k-tuple dominating set",
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "7",
      "roundsDisplay": "Constant",
      "roundCountEvidence": {
        "basis": "unavailable",
        "explanation": "The available primary material states a constant number of rounds but omits the algorithm. Full PDF redirects to subscription content. The author homepage that advertises a PDF is currently accessible only within the AMU network/VPN. The later 2017 primary paper describes a small modification but does not establish the original exact schedule; do not infer the old count from the new one.",
        "evidence": [
          {
            "url": "https://link.springer.com/chapter/10.1007/978-3-319-14472-6_4",
            "title": "Primary source reviewed",
            "location": "Primary Springer abstract and two-page preview"
          }
        ],
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "Constant",
        "tex": "\\text{Constant}",
        "basis": "unavailable",
        "explanation": "The available primary material states a constant number of rounds but omits the algorithm. Full PDF redirects to subscription content. The author homepage that advertises a PDF is currently accessible only within the AMU network/VPN. The later 2017 primary paper describes a small modification but does not establish the original exact schedule; do not infer the old count from the new one.",
        "evidence": [
          {
            "url": "https://link.springer.com/chapter/10.1007/978-3-319-14472-6_4",
            "title": "Primary source reviewed",
            "location": "Primary Springer abstract and two-page preview"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "2",
          "description": "Required neighbors outside the solution",
          "tex": "2"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted",
          "model-port-numbering"
        ],
        "parameters": [
          "auto-parameter-cd4920bb34139c49b8f8"
        ],
        "assumptions": [],
        "detail": [
          "strength-no-ids"
        ],
        "covered": [
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-92362405df7c8f0d5040",
          "auto-output-ef1b974b591df8f63ec3",
          "auto-parameter-cd4920bb34139c49b8f8",
          "model-port-numbering",
          "output-outside-k",
          "output-outside-two",
          "strength-no-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "planar-k-dom-trivial",
      "problem": "k-domination (outside the solution)",
      "variant": "k-domination of vertices outside D",
      "objective": "min",
      "graphClass": "Planar",
      "model": "Anonymous",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "k / (k − 2)",
      "rounds": "0",
      "roundClass": "constant",
      "parameters": "Fixed k ≥ 3.",
      "assumptions": "No identifiers required.",
      "paperId": "czygrinow-k-tuple-2014",
      "theorem": "Abstract",
      "summary": "Select all vertices without communication. The planar bipartite edge bound gives the stated ratio; the source introduction records this elementary construction.",
      "verification": "primary",
      "sourceUrl": "https://link.springer.com/chapter/10.1007/978-3-319-14472-6_4",
      "year": 2014,
      "problemScope": {
        "node": "outside-k-domination"
      },
      "problemParameter": "k",
      "problemParameterName": "required neighbors outside the solution",
      "problemSource": "k-tuple dominating set",
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "k / (k − 2)",
      "roundsDisplay": "0",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "0",
        "tex": "0",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://link.springer.com/chapter/10.1007/978-3-319-14472-6_4",
            "title": "Distributed Local Approximation of the Minimum k-Tuple Dominating Set in Planar Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "Zero rounds; k ∈ {3,4,5,6}",
        "setting": "Unweighted outside-k domination on planar graphs; deterministic anonymous zero rounds by selecting every vertex; integral OPT; certification restricted to k = 3, 4, 5, or 6.",
        "reason": "The select-all factor k/(k−2) is matched by a lower bound that permits unique identifiers for these four values of k. The construction uses no communication, as explicitly recalled in the 2017 follow-up paper. The original guarantee applies to larger k too, but this annotation does not extend the optimality claim to that range.",
        "evidenceUrl": "https://link.springer.com/chapter/10.1007/978-3-319-14472-6_4",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-k-three-through-six"
        ]
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "outside-k-planar-factor",
          "resultId": "planar-k-dom-trivial",
          "graphs": [
            "planar"
          ],
          "problems": [
            "outside-k-domination"
          ],
          "models": [
            "Anonymous",
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": [
            "parameter-k-three-through-six"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "k",
          "description": "Required number of neighbors in the solution for each vertex outside it",
          "tex": "k"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted",
          "model-port-numbering"
        ],
        "parameters": [
          "auto-parameter-b8fdbb33beabe4183121"
        ],
        "assumptions": [],
        "detail": [
          "strength-no-ids"
        ],
        "covered": [
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-92362405df7c8f0d5040",
          "auto-output-b54ac6401a901b9d3590",
          "auto-parameter-b8fdbb33beabe4183121",
          "model-port-numbering",
          "output-outside-k",
          "parameter-k-ge1",
          "parameter-k-ge2",
          "parameter-k-ge3",
          "strength-no-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "planar-two-dom-lower",
      "problem": "2-domination (outside the solution)",
      "variant": "2-domination of vertices outside D",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "approximation": "No (4 − ε)-approximation",
      "rounds": "O(1) rounds ruled out",
      "roundClass": "constant",
      "parameters": "k = 2; fixed ε > 0.",
      "assumptions": "Unique identifiers allowed.",
      "paperId": "czygrinow-k-tuple-2014",
      "theorem": "Abstract",
      "summary": "A deterministic locality barrier.",
      "verification": "primary",
      "sourceUrl": "https://link.springer.com/chapter/10.1007/978-3-319-14472-6_4",
      "year": 2014,
      "roundBudgetExcluded": true,
      "problemScope": {
        "node": "outside-k-domination"
      },
      "problemParameter": "2",
      "problemParameterName": "required neighbors outside the solution",
      "problemSource": "k-tuple dominating set",
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "> 4 − ε",
      "roundsDisplay": "Constant rounds ruled out",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Constant rounds ruled out",
        "tex": "\\text{Constant rounds ruled out}",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://link.springer.com/chapter/10.1007/978-3-319-14472-6_4",
            "title": "Distributed Local Approximation of the Minimum k-Tuple Dominating Set in Planar Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "2",
          "description": "Required neighbors outside the solution",
          "tex": "2"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-7c840dd07497ac66d521"
        ],
        "assumptions": [
          "auto-assumption-645e17e1d66815d2bcca"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-645e17e1d66815d2bcca",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-ef1b974b591df8f63ec3",
          "auto-parameter-7c840dd07497ac66d521",
          "output-outside-k",
          "output-outside-two",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "planar-k-dom-lower",
      "problem": "k-domination (outside the solution)",
      "variant": "k-domination of vertices outside D",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "approximation": "No (k/(k − 2) − ε)-approximation",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "k ∈ {3, 4, 5, 6}; any fixed ε > 0.",
      "assumptions": "Unique identifiers allowed; smaller fixed ratios are excluded.",
      "paperId": "czygrinow-k-tuple-2014",
      "theorem": "Abstract",
      "summary": "Matches the upper bound for four multiplicities.",
      "verification": "primary",
      "sourceUrl": "https://link.springer.com/chapter/10.1007/978-3-319-14472-6_4",
      "year": 2014,
      "roundBudgetExcluded": true,
      "problemScope": {
        "node": "outside-k-domination"
      },
      "problemParameter": "k",
      "problemParameterName": "required neighbors outside the solution",
      "problemSource": "k-tuple dominating set",
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "> k/(k − 2) − ε",
      "roundsDisplay": "Constant",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Constant",
        "tex": "\\text{Constant}",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://link.springer.com/chapter/10.1007/978-3-319-14472-6_4",
            "title": "Distributed Local Approximation of the Minimum k-Tuple Dominating Set in Planar Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "outside-k-planar-factor",
          "resultId": "planar-k-dom-lower",
          "graphs": [
            "planar"
          ],
          "problems": [
            "outside-k-domination"
          ],
          "models": [
            "LOCAL",
            "CONGEST"
          ],
          "conditionIds": [
            "parameter-k-three-through-six"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "k",
          "description": "Required number of neighbors in the solution for each vertex outside it",
          "tex": "k"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-2ba338b64d6712d3e5cc"
        ],
        "assumptions": [
          "auto-assumption-a2e9c2b616808887ae25"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-a2e9c2b616808887ae25",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b54ac6401a901b9d3590",
          "auto-parameter-2ba338b64d6712d3e5cc",
          "output-outside-k",
          "parameter-k-ge1",
          "parameter-k-ge2",
          "parameter-k-ge3",
          "parameter-k-three-through-six",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "planar-seven-lower",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "approximation": "No (7 − ε)-approximation",
      "rounds": "O(1) rounds ruled out",
      "roundClass": "constant",
      "parameters": "Any fixed ε > 0.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "hilke-planar-lower-2014",
      "theorem": "Abstract",
      "summary": "A deterministic constant-round approximation barrier.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/1402.2549",
      "year": 2014,
      "roundBudgetExcluded": true,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "> 7 − ε",
      "roundsDisplay": "Constant rounds ruled out",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Constant rounds ruled out",
        "tex": "\\text{Constant rounds ruled out}",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/1402.2549",
            "title": "Local Approximability of Minimum Dominating Set on Planar Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "planar-factor-seven",
          "resultId": "planar-seven-lower",
          "graphs": [
            "planar",
            "euler",
            "orientable"
          ],
          "problems": [
            "dominating-set"
          ],
          "models": [
            "LOCAL",
            "CONGEST"
          ],
          "conditionIds": []
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-8359c573af80d8ec5226"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-8359c573af80d8ec5226",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "lenzen-planar-130",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "130",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "No fixed degree bound is required.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "lenzen-restricted-2013",
      "theorem": "Theorem 6.8",
      "summary": "Historical constant-round planar bound.",
      "verification": "primary",
      "sourceUrl": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf",
      "year": 2013,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "130",
      "roundsDisplay": "6",
      "roundCountEvidence": {
        "basis": "stated",
        "explanation": "Lemma 6.1 explicitly states six rounds and gives the schedule: rounds 1–2 learn identifiers within distance two; round 3 announces membership in D; rounds 4–5 compute and exchange residual degrees; round 6 notifies chosen dominators. The algorithm uses unique identifiers and unrestricted LOCAL messages, without a supplied embedding or degree bound.",
        "evidence": [
          {
            "url": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf#page=14",
            "title": "Primary source for the algorithm",
            "location": "PDF page 14 (round count), page 19 (130 factor)"
          }
        ],
        "rounds": "6",
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "6",
        "tex": "6",
        "basis": "stated",
        "explanation": "Lemma 6.1 explicitly states six rounds and gives the schedule: rounds 1–2 learn identifiers within distance two; round 3 announces membership in D; rounds 4–5 compute and exchange residual degrees; round 6 notifies chosen dominators. The algorithm uses unique identifiers and unrestricted LOCAL messages, without a supplied embedding or degree bound.",
        "evidence": [
          {
            "url": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf#page=14",
            "title": "Primary source for the algorithm",
            "location": "PDF page 14 (round count), page 19 (130 factor)"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierComparisons": [
        {
          "better": "wawrzyniak-planar-52",
          "worse": "lenzen-planar-130",
          "strict": [
            "approximation"
          ],
          "conditions": {
            "problem": "Both return an integral approximation for unweighted minimum dominating set.",
            "graphClass": "Both algorithms apply to all planar graphs.",
            "approximation": "Factor 52 is strictly smaller than 130.",
            "rounds": "The 2014 result reanalyzes the same protocol. Lemma 6.1 of Lenzen–Pignolet–Wattenhofer explicitly itemizes rounds 1–6; the reanalysis changes no communication.",
            "model": "Both use LOCAL with unrestricted message size and local computation.",
            "randomness": "Both algorithms are deterministic.",
            "benchmark": "Both approximation guarantees are measured against the integral optimum.",
            "assumptions": "Both use distinct identifiers and require no embedding, degree bound or externally supplied dominating set. Unbounded local computation is allowed in LOCAL."
          },
          "evidenceUrl": "https://www.sciencedirect.com/science/article/abs/pii/S0020019013002767",
          "reason": "The improved analysis proves factor 52 for the unchanged six-round protocol that originally had factor 130."
        }
      ],
      "dominatedBy": [
        "wawrzyniak-planar-52"
      ],
      "frontierStatus": "dominated",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-368afe424cc1014e2254"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-368afe424cc1014e2254",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "lenzen-unit-disk-lower",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Unit-disk",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "approximation": "f(n)-approximation",
      "rounds": "f(n) · T(n) = Ω(log* n)",
      "roundClass": "logstar",
      "parameters": "f(n) is the approximation factor; T(n) the round complexity.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "lenzen-restricted-2013",
      "theorem": "Theorem 4.7",
      "summary": "Tradeoff between deterministic running time and approximation.",
      "verification": "primary",
      "sourceUrl": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf",
      "year": 2013,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "unit-disk"
      },
      "approximationDisplay": "f(n)-approximation",
      "roundsDisplay": "f(n) · T(n) = Ω(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "f(n) · T(n) = Ω(log* n)",
        "tex": "f(n)\\,T(n)=\\Omega(\\log^*n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf",
            "title": "Distributed minimum dominating set approximations in restricted families of graphs",
            "location": "Theorem 4.7"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "T(n)",
          "description": "Number of communication rounds at input size n",
          "tex": "T(n)"
        },
        {
          "symbol": "f(n)",
          "description": "Approximation factor at input size n",
          "tex": "f(n)"
        },
        {
          "symbol": "T",
          "description": "Round-complexity function of the number of vertices",
          "tex": "T"
        },
        {
          "symbol": "f",
          "description": "Approximation-factor function of the number of vertices",
          "tex": "f"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-422a8fcd40a47bc44c15",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-e140b685efc84e3de936"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-422a8fcd40a47bc44c15",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-e140b685efc84e3de936",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "lenzen-arboricity-random",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Arboricity ≤ α",
      "model": "LOCAL",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "O(α²)",
      "rounds": "O(log n)",
      "roundClass": "logarithmic",
      "parameters": "α is the arboricity bound.",
      "assumptions": "Unweighted; running time holds with high probability.",
      "paperId": "lenzen-restricted-2013",
      "theorem": "Section 5",
      "summary": "Historical forest-decomposition approximation.",
      "verification": "primary",
      "sourceUrl": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf",
      "year": 2013,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "density",
        "note": "Use compatible fixed arboricity bounds; planar inputs permit an arboricity bound of 3."
      },
      "approximationDisplay": "O(α²)",
      "roundsDisplay": "O(log n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log n)",
        "tex": "O(\\log n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf",
            "title": "Distributed minimum dominating set approximations in restricted families of graphs",
            "location": "Section 5"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "α",
          "description": "Arboricity bound of the input graph",
          "tex": "\\alpha"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-97a0a2af0e526b2ffcd5",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-d6747b2e215206975909"
        ],
        "assumptions": [
          "auto-assumption-b836cd95ee47f8554bf1"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-b836cd95ee47f8554bf1",
          "auto-graph-97a0a2af0e526b2ffcd5",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-d6747b2e215206975909",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "lenzen-arboricity-deterministic",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Arboricity ≤ α",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "O(α log Δ)",
      "rounds": "O(log Δ)",
      "roundClass": "degree",
      "parameters": "Δ is maximum degree.",
      "assumptions": "Unweighted; uniform algorithm.",
      "paperId": "lenzen-restricted-2013",
      "theorem": "Section 5",
      "summary": "A deterministic degree-dependent tradeoff.",
      "verification": "primary",
      "sourceUrl": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf",
      "year": 2013,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "density",
        "note": "Use compatible fixed arboricity bounds; planar inputs permit an arboricity bound of 3."
      },
      "approximationDisplay": "O(α log Δ)",
      "roundsDisplay": "O(log Δ)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log Δ)",
        "tex": "O(\\log \\Delta )",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf",
            "title": "Distributed minimum dominating set approximations in restricted families of graphs",
            "location": "Section 5"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "α",
          "description": "Arboricity bound of the input graph",
          "tex": "\\alpha"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-97a0a2af0e526b2ffcd5",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-086b33ba1d8d93f63191"
        ],
        "assumptions": [
          "auto-assumption-d5ea1a184c45a94072eb"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-d5ea1a184c45a94072eb",
          "auto-graph-97a0a2af0e526b2ffcd5",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-086b33ba1d8d93f63191",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "arboricity-matching-logstar",
      "problem": "Maximum matching",
      "variant": "Unweighted",
      "objective": "max",
      "graphClass": "Arboricity ≤ α",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − ε",
      "rounds": "O(log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed α and 0 < ε < 1.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "czygrinow-arboricity-matching-2009",
      "theorem": "Abstract",
      "summary": "A deterministic matching scheme for bounded arboricity.",
      "verification": "primary",
      "sourceUrl": "https://link.springer.com/chapter/10.1007/978-3-642-10631-6_68",
      "year": 2009,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "density",
        "note": "Use compatible fixed arboricity bounds; planar inputs permit an arboricity bound of 3."
      },
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "O(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log* n)",
        "tex": "O(\\log^* n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://link.springer.com/chapter/10.1007/978-3-642-10631-6_68",
            "title": "Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Unweighted maximum matching; deterministic LOCAL; arboricity at most fixed α ≥ 1; fixed 0 < ε < 1/2; (1−ε) times the integral optimum.",
        "reason": "Optimal Θ(log* n) dependence on n for fixed α and ε: the matching lower bound already holds on paths. This does not certify optimal dependence on α or ε.",
        "evidenceUrl": "https://arxiv.org/pdf/2304.04699v2",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-epsilon-half"
        ]
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "arboricity-matching-n-rounds",
          "resultId": "arboricity-matching-logstar",
          "graphs": [
            "density",
            "arboricity-two",
            "forest",
            "path",
            "oriented-path",
            "cycle"
          ],
          "problems": [
            "maximum-matching"
          ],
          "models": [
            "LOCAL"
          ],
          "conditionIds": [
            "scope-rounds-n-alpha-epsilon",
            "parameter-epsilon-half"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "α",
          "description": "Arboricity bound of the input graph",
          "tex": "\\alpha"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-97a0a2af0e526b2ffcd5",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-cd01ec1b8d72b36ac585"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-97a0a2af0e526b2ffcd5",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-cd01ec1b8d72b36ac585",
          "parameter-alpha-ge1",
          "parameter-epsilon-positive",
          "parameter-epsilon-unit",
          "parameter-fixed-alpha",
          "parameter-fixed-epsilon",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "planar-fast-dominating",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "O(log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed 0 < ε < 1.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "czygrinow-planar-fast-2008",
      "theorem": "Abstract",
      "summary": "A deterministic local approximation scheme.",
      "verification": "primary",
      "sourceUrl": "https://link.springer.com/chapter/10.1007/978-3-540-87779-0_6",
      "year": 2008,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "O(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log* n)",
        "tex": "O(\\log^* n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://link.springer.com/chapter/10.1007/978-3-540-87779-0_6",
            "title": "Fast Distributed Approximations in Planar Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-556e1395ea8d9fad84a5"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-556e1395ea8d9fad84a5",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "planar-fast-matching",
      "problem": "Maximum matching",
      "variant": "Unweighted",
      "objective": "max",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − ε",
      "rounds": "O(log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed 0 < ε < 1.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "czygrinow-planar-fast-2008",
      "theorem": "Abstract",
      "summary": "A deterministic local approximation scheme.",
      "verification": "primary",
      "sourceUrl": "https://link.springer.com/chapter/10.1007/978-3-540-87779-0_6",
      "year": 2008,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "O(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log* n)",
        "tex": "O(\\log^* n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://link.springer.com/chapter/10.1007/978-3-540-87779-0_6",
            "title": "Fast Distributed Approximations in Planar Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-556e1395ea8d9fad84a5"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-556e1395ea8d9fad84a5",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "planar-fast-independent",
      "problem": "Independent set",
      "variant": "Unweighted",
      "objective": "max",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − ε",
      "rounds": "O(log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed 0 < ε < 1.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "czygrinow-planar-fast-2008",
      "theorem": "Abstract",
      "summary": "A deterministic local approximation scheme.",
      "verification": "primary",
      "sourceUrl": "https://link.springer.com/chapter/10.1007/978-3-540-87779-0_6",
      "year": 2008,
      "problemScope": {
        "node": "independent-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "O(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log* n)",
        "tex": "O(\\log^* n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://link.springer.com/chapter/10.1007/978-3-540-87779-0_6",
            "title": "Fast Distributed Approximations in Planar Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-556e1395ea8d9fad84a5"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-4ad7b7801c4e84e8fdd9",
          "auto-parameter-556e1395ea8d9fad84a5",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "packing-planar",
      "problem": "Vertex-disjoint H-packing",
      "variant": "Vertex-disjoint H-packing",
      "objective": "max",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − o(1)",
      "rounds": "polylog n",
      "roundClass": "polylog",
      "parameters": "Fixed pattern H (the paper permits some larger patterns).",
      "assumptions": "Unweighted packing; deterministic message passing.",
      "paperId": "czygrinow-packing-planar-2008",
      "theorem": "Abstract",
      "summary": "Nearly optimal packing through local decomposition.",
      "verification": "primary",
      "sourceUrl": "https://citeseerx.ist.psu.edu/document?doi=220ce316d6c4b583c4dd44cc3a67bdbc6c735967&repid=rep1&type=pdf",
      "year": 2008,
      "problemScope": {
        "node": "other-packing"
      },
      "problemParameter": "H",
      "problemParameterName": "fixed pattern graph",
      "problemSource": "Other packing",
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "1 − o(1)",
      "roundsDisplay": "polylog n",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "polylog n",
        "tex": "\\operatorname{polylog}n",
        "basis": "symbolic",
        "explanation": "A numerical polynomial exponent has not yet been extracted for this record. The displayed expression retains all currently recorded parameter dependence.",
        "evidence": [
          {
            "url": "https://citeseerx.ist.psu.edu/document?doi=220ce316d6c4b583c4dd44cc3a67bdbc6c735967&repid=rep1&type=pdf",
            "title": "Distributed packing in planar graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "H",
          "description": "Fixed graph whose vertex-disjoint copies are packed",
          "tex": "H"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-7d2fe83d945081e897d5"
        ],
        "assumptions": [
          "auto-assumption-439d0499bc59af58e1e1"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-439d0499bc59af58e1e1",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b552c597406156389871",
          "auto-parameter-7d2fe83d945081e897d5",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "minor-almost-dominating",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Excluded fixed minor",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + o(1)",
      "rounds": "polylog n",
      "roundClass": "polylog",
      "parameters": "Fixed proper minor-closed family; o(1) tends to zero as n grows.",
      "assumptions": "Unweighted; connected domination assumes connected input.",
      "paperId": "czygrinow-minor-almost-2006",
      "theorem": "Abstract",
      "summary": "Historical deterministic approximation approaching optimality.",
      "verification": "primary",
      "sourceUrl": "https://link.springer.com/chapter/10.1007/11841036_24",
      "year": 2006,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "1 + o(1)",
      "roundsDisplay": "polylog n",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "polylog n",
        "tex": "\\operatorname{polylog}n",
        "basis": "stated-in-publisher-abstract",
        "explanation": "The publisher abstract states polylogarithmic rounds for a fixed proper minor-closed family. Only the abstract was accessible in this check; no numerical exponent is verified, and no conclusion is drawn about what the full paper might permit.",
        "evidence": [
          {
            "url": "https://link.springer.com/chapter/10.1007/11841036_24",
            "title": "Distributed Almost Exact Approximations for Minor-Closed Families",
            "location": "Publisher abstract"
          }
        ],
        "parameters": [
          {
            "symbol": "n",
            "description": "Number of vertices",
            "tex": "n"
          }
        ],
        "checked": "2026-11-16",
        "audited": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "n",
          "description": "Number of vertices",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-e40ef97c3969c67aad8c",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-fcadea24a9eeedcc0605"
        ],
        "assumptions": [
          "auto-assumption-41383be6b6c11ef0ca69"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-41383be6b6c11ef0ca69",
          "auto-graph-e40ef97c3969c67aad8c",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-fcadea24a9eeedcc0605",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "minor-almost-connected",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Excluded fixed minor",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + o(1)",
      "rounds": "polylog n",
      "roundClass": "polylog",
      "parameters": "Fixed proper minor-closed family; o(1) tends to zero as n grows.",
      "assumptions": "Unweighted; connected domination assumes connected input.",
      "paperId": "czygrinow-minor-almost-2006",
      "theorem": "Abstract",
      "summary": "Historical deterministic approximation approaching optimality.",
      "verification": "primary",
      "sourceUrl": "https://link.springer.com/chapter/10.1007/11841036_24",
      "year": 2006,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "1 + o(1)",
      "roundsDisplay": "polylog n",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "polylog n",
        "tex": "\\operatorname{polylog}n",
        "basis": "stated-in-publisher-abstract",
        "explanation": "The publisher abstract states polylogarithmic rounds for connected dominating set in a fixed proper minor-closed family. Full-text access was unavailable in this check, so no numerical exponent is verified.",
        "evidence": [
          {
            "url": "https://link.springer.com/chapter/10.1007/11841036_24",
            "title": "Distributed Almost Exact Approximations for Minor-Closed Families",
            "location": "Publisher abstract"
          }
        ],
        "parameters": [
          {
            "symbol": "n",
            "description": "Number of vertices",
            "tex": "n"
          }
        ],
        "checked": "2026-11-16",
        "audited": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "n",
          "description": "Number of vertices",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-e40ef97c3969c67aad8c",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-fcadea24a9eeedcc0605"
        ],
        "assumptions": [
          "auto-assumption-41383be6b6c11ef0ca69"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-41383be6b6c11ef0ca69",
          "auto-graph-e40ef97c3969c67aad8c",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-fcadea24a9eeedcc0605",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "planar-matching-polylog",
      "problem": "Maximum matching",
      "variant": "Unweighted",
      "objective": "max",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − o(1)",
      "rounds": "polylog n",
      "roundClass": "polylog",
      "parameters": "o(1) tends to zero as n grows.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "czygrinow-planar-2006",
      "theorem": "Abstract",
      "summary": "Historical approximation scheme before the log-star bound.",
      "verification": "primary",
      "sourceUrl": "https://link.springer.com/chapter/10.1007/11758471_29",
      "year": 2006,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "1 − o(1)",
      "roundsDisplay": "polylog n",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "polylog n",
        "tex": "\\operatorname{polylog}n",
        "basis": "stated-in-publisher-abstract",
        "explanation": "The publisher abstract gives deterministic polylogarithmic rounds, with approximation approaching one as n increases. Only the abstract was accessible in this check; no numerical exponent is verified.",
        "evidence": [
          {
            "url": "https://link.springer.com/chapter/10.1007/11758471_29",
            "title": "Distributed Approximation Algorithms for Planar Graphs",
            "location": "Publisher abstract"
          }
        ],
        "parameters": [
          {
            "symbol": "n",
            "description": "Number of vertices",
            "tex": "n"
          }
        ],
        "checked": "2026-11-16",
        "audited": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-1a9fdb690f3300f60ed4"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-1a9fdb690f3300f60ed4",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "growth-local-dominating",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Polynomial neighborhood-independence growth",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "O(T_MIS + ε⁻O(1) log* n)",
      "roundClass": "other",
      "parameters": "Fixed growth polynomial and ε > 0; T_MIS is an MIS subroutine’s time.",
      "assumptions": "Includes unit-disk graphs; no coordinates are required.",
      "paperId": "kuhn-local-schemes-2005",
      "theorem": "Abstract",
      "summary": "An approximation scheme parameterized by a symmetry-breaking subroutine.",
      "verification": "primary",
      "sourceUrl": "https://www.microsoft.com/en-us/research/wp-content/uploads/2017/01/DIALM2005a.pdf",
      "year": 2005,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "independence-growth",
        "note": "Growth refers to independent sets in neighborhoods, not vertex counts."
      },
      "graphClassSource": "Polynomially bounded growth",
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "O(T_MIS + ε⁻O(1) log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(T_MIS + ε⁻O(1) log* n)",
        "tex": "O\\!\\left(T_{\\mathrm{MIS}}+\\varepsilon^{-O(1)}\\log^*n\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://www.microsoft.com/en-us/research/wp-content/uploads/2017/01/DIALM2005a.pdf",
            "title": "Local approximation schemes for ad hoc and sensor networks",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "T_MIS",
          "description": "Round complexity of the maximal-independent-set subroutine",
          "tex": "T_{\\mathrm{MIS}}"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-7140d561f38288daeca5",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-3501d10fc18c46a523f3"
        ],
        "assumptions": [
          "auto-assumption-5b844a3fdbd850e05d7e"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-5b844a3fdbd850e05d7e",
          "auto-graph-7140d561f38288daeca5",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-3501d10fc18c46a523f3",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "growth-local-independent",
      "problem": "Independent set",
      "variant": "Unweighted",
      "objective": "max",
      "graphClass": "Polynomial neighborhood-independence growth",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 / (1 + ε)",
      "rounds": "O(T_MIS + ε⁻O(1) log* n)",
      "roundClass": "other",
      "parameters": "Fixed growth polynomial and ε > 0; T_MIS is an MIS subroutine’s time.",
      "assumptions": "Includes unit-disk graphs; no coordinates are required.",
      "paperId": "kuhn-local-schemes-2005",
      "theorem": "Abstract",
      "summary": "An approximation scheme parameterized by a symmetry-breaking subroutine.",
      "verification": "primary",
      "sourceUrl": "https://www.microsoft.com/en-us/research/wp-content/uploads/2017/01/DIALM2005a.pdf",
      "year": 2005,
      "problemScope": {
        "node": "independent-set"
      },
      "graphScope": {
        "node": "independence-growth",
        "note": "Growth refers to independent sets in neighborhoods, not vertex counts."
      },
      "graphClassSource": "Polynomially bounded growth",
      "approximationDisplay": "1 / (1 + ε)",
      "roundsDisplay": "O(T_MIS + ε⁻O(1) log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(T_MIS + ε⁻O(1) log* n)",
        "tex": "O\\!\\left(T_{\\mathrm{MIS}}+\\varepsilon^{-O(1)}\\log^*n\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://www.microsoft.com/en-us/research/wp-content/uploads/2017/01/DIALM2005a.pdf",
            "title": "Local approximation schemes for ad hoc and sensor networks",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "T_MIS",
          "description": "Round complexity of the maximal-independent-set subroutine",
          "tex": "T_{\\mathrm{MIS}}"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-7140d561f38288daeca5",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-3501d10fc18c46a523f3"
        ],
        "assumptions": [
          "auto-assumption-5b844a3fdbd850e05d7e"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-5b844a3fdbd850e05d7e",
          "auto-graph-7140d561f38288daeca5",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-4ad7b7801c4e84e8fdd9",
          "auto-parameter-3501d10fc18c46a523f3",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "odd-cycle-matching",
      "problem": "Maximum matching",
      "variant": "Unweighted",
      "objective": "max",
      "graphClass": "No odd cycles of lengths 3, 5, …, 2k − 1",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − 1/(k + 1)",
      "rounds": "O(logᴰ⁽ᵏ⁾ n)",
      "roundClass": "polylog",
      "parameters": "Fixed integer k; exponent D depends on k.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "czygrinow-matching-2003",
      "theorem": "Abstract",
      "summary": "Historical approximation exploiting the absence of short odd cycles.",
      "verification": "primary",
      "sourceUrl": "https://link.springer.com/chapter/10.1007/3-540-45071-8_26",
      "year": 2003,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "odd-girth"
      },
      "approximationDisplay": "1 − 1/(k + 1)",
      "roundsDisplay": "O(logᴰ⁽ᵏ⁾ n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(logᴰ⁽ᵏ⁾ n)",
        "tex": "O\\!\\left(\\log^{D(k)}n\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://link.springer.com/chapter/10.1007/3-540-45071-8_26",
            "title": "Distributed Algorithm for Better Approximation of the Maximum Matching",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "D(k)",
          "description": "Fixed polynomial-in-logarithm exponent depending only on k",
          "tex": "D(k)"
        },
        {
          "symbol": "D",
          "description": "Exponent function depending only on k",
          "tex": "D"
        },
        {
          "symbol": "k",
          "description": "Integer controlling the excluded odd-cycle lengths 3,5,…,2k−1",
          "tex": "k"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-1b4eb5482088967f6989",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-6a77d51b1e51feea6d0f"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-1b4eb5482088967f6989",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-6a77d51b1e51feea6d0f",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "alipour-trianglefree-32",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Triangle-free planar",
      "model": "LOCAL",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "32",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "Algorithm 1 with m = 0.",
      "assumptions": "No isolated vertices; the presented algorithm uses random tie-breaking.",
      "paperId": "alipour-futuhi-2020",
      "theorem": "Theorem 2.1",
      "summary": "A local degree-based procedure, analyzed on triangle-free graphs.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2012.04883v2",
      "year": 2020,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "triangle-planar"
      },
      "approximationDisplay": "32",
      "roundsDisplay": "2",
      "roundCountEvidence": {
        "basis": "stated",
        "explanation": "In round 1, vertices broadcast their degree and random tie-breaking value. In round 2, each vertex marks a neighbor of maximum weight. The repeat loop is absent when m = 0. The selected vertices give total domination and hence ordinary domination. Vertices initially know their neighbors; the source excludes isolated vertices.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2012.04883v2#page=3",
            "title": "Primary source communication schedule",
            "location": "Algorithm 1 lines 1–2 and Theorem 2.1; arXiv v2 PDF p. 3"
          }
        ],
        "rounds": "2",
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "2",
        "tex": "2",
        "basis": "stated",
        "explanation": "In round 1, vertices broadcast their degree and random tie-breaking value. In round 2, each vertex marks a neighbor of maximum weight. The repeat loop is absent when m = 0. The selected vertices give total domination and hence ordinary domination. Vertices initially know their neighbors; the source excludes isolated vertices.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2012.04883v2#page=3",
            "title": "Primary source communication schedule",
            "location": "Algorithm 1 lines 1–2 and Theorem 2.1; arXiv v2 PDF p. 3"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "m",
          "description": "Source algorithm parameter instantiated to zero in this entry",
          "tex": "m"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-17b28995226fcbf3e00f",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-c8cd75de38af15472e55"
        ],
        "assumptions": [
          "auto-assumption-766087a5ffd80038c841"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-766087a5ffd80038c841",
          "auto-graph-17b28995226fcbf3e00f",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-c8cd75de38af15472e55",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "alipour-trianglefree-total-16",
      "problem": "Total dominating set",
      "variant": "Total dominating set",
      "objective": "min",
      "graphClass": "Triangle-free planar",
      "model": "LOCAL",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "16",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "Algorithm 1 with m = 0.",
      "assumptions": "No isolated vertices. Every vertex, including selected vertices, needs a selected neighbor.",
      "paperId": "alipour-futuhi-2020",
      "theorem": "Theorem 2.1",
      "summary": "The same procedure also approximates total domination.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2012.04883v2",
      "year": 2020,
      "problemScope": {
        "node": "total-dominating-set"
      },
      "problemSource": "Dominating set",
      "graphScope": {
        "node": "triangle-planar"
      },
      "approximationDisplay": "16",
      "roundsDisplay": "2",
      "roundCountEvidence": {
        "basis": "stated",
        "explanation": "The same m = 0 algorithm uses two rounds: broadcast weights, then mark a maximum-weight neighbor. Theorem 2.1 gives factor 16 against the total-domination optimum. Vertices initially know their neighbors, and isolated vertices are excluded.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2012.04883v2#page=3",
            "title": "Primary source communication schedule",
            "location": "Algorithm 1 lines 1–2 and Theorem 2.1; arXiv v2 PDF p. 3"
          }
        ],
        "rounds": "2",
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "2",
        "tex": "2",
        "basis": "stated",
        "explanation": "The same m = 0 algorithm uses two rounds: broadcast weights, then mark a maximum-weight neighbor. Theorem 2.1 gives factor 16 against the total-domination optimum. Vertices initially know their neighbors, and isolated vertices are excluded.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2012.04883v2#page=3",
            "title": "Primary source communication schedule",
            "location": "Algorithm 1 lines 1–2 and Theorem 2.1; arXiv v2 PDF p. 3"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "m",
          "description": "Source algorithm parameter instantiated to zero in this entry",
          "tex": "m"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-17b28995226fcbf3e00f",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-c8cd75de38af15472e55"
        ],
        "assumptions": [
          "auto-assumption-635ce45f315f03cad1a6"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-635ce45f315f03cad1a6",
          "auto-graph-17b28995226fcbf3e00f",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-output-f7056f83774cd9f78096",
          "auto-parameter-c8cd75de38af15472e55",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "alipour-fourcycle-18",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar without 4-cycles",
      "model": "LOCAL",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "18",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "Fixed graph-class restriction.",
      "assumptions": "Randomized LOCAL algorithm; the no-isolated-vertex setting is used here.",
      "paperId": "alipour-jafari-2020",
      "theorem": "SPAA author-talk abstract",
      "summary": "The conference abstract gives a bound under 4-cycle exclusion.",
      "verification": "primary",
      "sourceUrl": "https://papertalk.org/papertalks/24941",
      "year": 2020,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "fourcycle-planar"
      },
      "approximationDisplay": "18",
      "roundsDisplay": "Constant",
      "roundCountEvidence": {
        "basis": "unavailable",
        "explanation": "The primary author abstract confirms the approximation result but does not give a total round count. The full SPAA paper could not be accessed to verify its schedule. The count is not inferred from the separate triangle-free paper.",
        "evidence": [
          {
            "url": "https://papertalk.org/papertalks/24941",
            "title": "Primary source reviewed",
            "location": "Primary author abstract; full paper unavailable"
          }
        ],
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "Constant",
        "tex": "\\text{Constant}",
        "basis": "unavailable",
        "explanation": "The primary author abstract confirms the approximation result but does not give a total round count. The full SPAA paper could not be accessed to verify its schedule. The count is not inferred from the separate triangle-free paper.",
        "evidence": [
          {
            "url": "https://papertalk.org/papertalks/24941",
            "title": "Primary source reviewed",
            "location": "Primary author abstract; full paper unavailable"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [],
      "setting": {
        "summary": [
          "auto-graph-3795dad9c1a1c4cfdd87",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-67492501d8599441d259"
        ],
        "assumptions": [
          "auto-assumption-afd7f31621593a143084"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-afd7f31621593a143084",
          "auto-graph-3795dad9c1a1c4cfdd87",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-67492501d8599441d259",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "unitdisk-matching-2006",
      "problem": "Maximum matching",
      "variant": "Unweighted",
      "objective": "max",
      "graphClass": "Unit-disk",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − O(1 / logᵏ n)",
      "rounds": "polylog n",
      "roundClass": "polylog",
      "parameters": "Fixed positive integer k; polynomial exponent depends on k.",
      "assumptions": "No coordinates required; connected domination assumes connected input.",
      "paperId": "czygrinow-unitdisk-2006",
      "theorem": "Abstract",
      "summary": "A deterministic geometric-graph approximation scheme.",
      "verification": "primary",
      "sourceUrl": "https://citeseerx.ist.psu.edu/document?doi=20dda508c20a6ecb0968d9df37651143c62702bc&repid=rep1&type=pdf",
      "year": 2006,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "unit-disk"
      },
      "approximationDisplay": "1 − O(1 / logᵏ n)",
      "roundsDisplay": "polylog n",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "polylog n",
        "tex": "\\operatorname{polylog}n",
        "basis": "symbolic",
        "explanation": "A numerical polynomial exponent has not yet been extracted for this record. The displayed expression retains all currently recorded parameter dependence.",
        "evidence": [
          {
            "url": "https://citeseerx.ist.psu.edu/document?doi=20dda508c20a6ecb0968d9df37651143c62702bc&repid=rep1&type=pdf",
            "title": "Distributed Approximation Algorithms in Unit-Disk Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "k",
          "description": "Fixed positive exponent controlling the inverse-polylogarithmic accuracy",
          "tex": "k"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-422a8fcd40a47bc44c15",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-6ad33651604abc6ac7a2"
        ],
        "assumptions": [
          "auto-assumption-f2a82078dc0579e63cb9"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-f2a82078dc0579e63cb9",
          "auto-graph-422a8fcd40a47bc44c15",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-6ad33651604abc6ac7a2",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "unitdisk-connected-2006",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Unit-disk",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + O(1 / logᵏ n)",
      "rounds": "polylog n",
      "roundClass": "polylog",
      "parameters": "Fixed positive integer k; polynomial exponent depends on k.",
      "assumptions": "No coordinates required; connected domination assumes connected input.",
      "paperId": "czygrinow-unitdisk-2006",
      "theorem": "Abstract",
      "summary": "A deterministic geometric-graph approximation scheme.",
      "verification": "primary",
      "sourceUrl": "https://citeseerx.ist.psu.edu/document?doi=20dda508c20a6ecb0968d9df37651143c62702bc&repid=rep1&type=pdf",
      "year": 2006,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "unit-disk"
      },
      "approximationDisplay": "1 + O(1 / logᵏ n)",
      "roundsDisplay": "polylog n",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "polylog n",
        "tex": "\\operatorname{polylog}n",
        "basis": "symbolic",
        "explanation": "A numerical polynomial exponent has not yet been extracted for this record. The displayed expression retains all currently recorded parameter dependence.",
        "evidence": [
          {
            "url": "https://citeseerx.ist.psu.edu/document?doi=20dda508c20a6ecb0968d9df37651143c62702bc&repid=rep1&type=pdf",
            "title": "Distributed Approximation Algorithms in Unit-Disk Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "k",
          "description": "Fixed positive exponent controlling the inverse-polylogarithmic accuracy",
          "tex": "k"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-422a8fcd40a47bc44c15",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-6ad33651604abc6ac7a2"
        ],
        "assumptions": [
          "auto-assumption-f2a82078dc0579e63cb9"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-f2a82078dc0579e63cb9",
          "auto-graph-422a8fcd40a47bc44c15",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-6ad33651604abc6ac7a2",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "tree-weighted-domination-2006",
      "problem": "Dominating set",
      "variant": "Weighted",
      "objective": "min",
      "graphClass": "Trees",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + O(1 / log n)",
      "rounds": "polylog n",
      "roundClass": "polylog",
      "parameters": "Error tends to zero as n increases.",
      "assumptions": "Positive vertex weights.",
      "paperId": "czygrinow-weighted-sparse-2006",
      "theorem": "Theorem 2.10",
      "summary": "A deterministic near-optimal tree algorithm.",
      "verification": "primary",
      "sourceUrl": "https://citeseerx.ist.psu.edu/document?doi=5393d1efac934cd32964336c9cd276b1c6b9930b&repid=rep1&type=pdf",
      "year": 2006,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "forest"
      },
      "approximationDisplay": "1 + O(1 / log n)",
      "roundsDisplay": "polylog n",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "polylog n",
        "tex": "\\operatorname{polylog}n",
        "basis": "stated",
        "explanation": "Theorem 2.10 states only polylogarithmic rounds. Lemma 2.4 bounds cluster diameter by O(log³ n); this diameter alone is not the total algorithm complexity. The theorem does not specify a polynomial exponent.",
        "evidence": [
          {
            "url": "https://citeseerx.ist.psu.edu/document?doi=5393d1efac934cd32964336c9cd276b1c6b9930b&repid=rep1&type=pdf",
            "title": "Distributed algorithms for weighted problems in sparse graphs",
            "location": "Theorem 2.10; Lemma 2.4; WDSinTree procedure (manuscript pp. 7–11)"
          }
        ],
        "parameters": [
          {
            "symbol": "n",
            "description": "Number of vertices",
            "tex": "n"
          }
        ],
        "checked": "2026-11-16",
        "audited": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-655689d0297b69cf89ca",
          "weights-weighted"
        ],
        "parameters": [
          "auto-parameter-ef7f1cc3b30039b10a77"
        ],
        "assumptions": [
          "auto-assumption-a9fb24f2e10734b0d6e5"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-a9fb24f2e10734b0d6e5",
          "auto-graph-655689d0297b69cf89ca",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-ef7f1cc3b30039b10a77",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "planar-weighted-independent-2006",
      "problem": "Independent set",
      "variant": "Weighted",
      "objective": "max",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − O(1 / log n)",
      "rounds": "polylog n",
      "roundClass": "polylog",
      "parameters": "The finer polylogarithmic expression is in Theorem 3.6.",
      "assumptions": "Positive vertex weights; unique identifiers.",
      "paperId": "czygrinow-weighted-sparse-2006",
      "theorem": "Theorem 3.6",
      "summary": "Weighted clustering yields a near-optimal independent set.",
      "verification": "primary",
      "sourceUrl": "https://citeseerx.ist.psu.edu/document?doi=5393d1efac934cd32964336c9cd276b1c6b9930b&repid=rep1&type=pdf",
      "year": 2006,
      "problemScope": {
        "node": "independent-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "1 − O(1 / log n)",
      "roundsDisplay": "polylog n",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log log n · log* n · (log n)^(d+1)), where d = log 3 / log(12/11)",
        "tex": "O\\!\\left(\\log\\log n\\cdot\\log^* n\\cdot(\\log n)^{d+1}\\right),\\qquad d=\\frac{\\log 3}{\\log(12/11)}",
        "basis": "stated",
        "explanation": "Theorem 3.6 states this expression for the deterministic LOCAL weighted planar independent-set algorithm with ratio 1 − O(1/log n). Lemma 3.5 gives the same clustering complexity. Here d is a fixed numerical constant, not a graph parameter.",
        "evidence": [
          {
            "url": "https://citeseerx.ist.psu.edu/document?doi=5393d1efac934cd32964336c9cd276b1c6b9930b&repid=rep1&type=pdf",
            "title": "Distributed algorithms for weighted problems in sparse graphs",
            "location": "Theorem 3.6; Lemmas 3.3 and 3.5 (manuscript pp. 14–16)"
          }
        ],
        "parameters": [
          {
            "symbol": "d",
            "description": "Fixed numerical exponent log 3 / log(12/11)",
            "tex": "d"
          },
          {
            "symbol": "n",
            "description": "Number of vertices",
            "tex": "n"
          }
        ],
        "checked": "2026-11-16",
        "audited": true,
        "expression": {
          "formula": "O(log log n · log* n · (log n)^(d+1))",
          "tex": "O\\!\\left(\\log\\log n\\cdot\\log^* n\\cdot(\\log n)^{d+1}\\right)"
        },
        "suffix": {
          "formula": ", where d = log 3 / log(12/11)",
          "tex": ",\\qquad d=\\frac{\\log 3}{\\log(12/11)}"
        }
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "d",
          "description": "Fixed numerical exponent log 3 / log(12/11)",
          "tex": "d"
        },
        {
          "symbol": "n",
          "description": "Number of vertices",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-weighted"
        ],
        "parameters": [
          "auto-parameter-168a796c6c56db460d58"
        ],
        "assumptions": [
          "auto-assumption-e45d768e2b5e83c79c78"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-e45d768e2b5e83c79c78",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-4ad7b7801c4e84e8fdd9",
          "auto-parameter-168a796c6c56db460d58",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "minor-weighted-domination-2007",
      "problem": "Dominating set",
      "variant": "Weighted",
      "objective": "min",
      "graphClass": "Excluded fixed minor",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + 1 / logᵈ n",
      "rounds": "polylog n",
      "roundClass": "polylog",
      "parameters": "Fixed positive integer d and proper minor-closed family.",
      "assumptions": "Positive vertex weights; unique identifiers.",
      "paperId": "czygrinow-weighted-minor-2007",
      "theorem": "Theorem 5",
      "summary": "A historical weighted domination scheme.",
      "verification": "primary",
      "sourceUrl": "https://citeseerx.ist.psu.edu/document?doi=81197b872b8589d907fbef91ebf5600dfe34c59a&repid=rep1&type=pdf",
      "year": 2007,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "1 + 1 / logᵈ n",
      "roundsDisplay": "polylog n",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "polylog n",
        "tex": "\\operatorname{polylog}n",
        "basis": "stated",
        "explanation": "Theorem 5 states polylogarithmic rounds for ratio 1 + 1/(log n)^d. The polynomial can depend on the fixed accuracy exponent d and the minor-closed family. Corollary 3(b) also leaves its polynomial exponent unspecified.",
        "evidence": [
          {
            "url": "https://citeseerx.ist.psu.edu/document?doi=81197b872b8589d907fbef91ebf5600dfe34c59a&repid=rep1&type=pdf",
            "title": "Distributed approximation algorithms for weighted problems in minor-closed families",
            "location": "Theorem 5; Corollary 3(b); Vertex-weight Partition and Lemma 5"
          }
        ],
        "parameters": [
          {
            "symbol": "d",
            "description": "Fixed positive integer controlling the inverse-polylogarithmic approximation error",
            "tex": "d"
          },
          {
            "symbol": "n",
            "description": "Number of vertices",
            "tex": "n"
          }
        ],
        "checked": "2026-11-16",
        "audited": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "d",
          "description": "Fixed positive integer controlling the inverse-polylogarithmic approximation error",
          "tex": "d"
        },
        {
          "symbol": "n",
          "description": "Number of vertices",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-e40ef97c3969c67aad8c",
          "weights-weighted"
        ],
        "parameters": [
          "auto-parameter-8075cb2442a2168b4de2"
        ],
        "assumptions": [
          "auto-assumption-e45d768e2b5e83c79c78"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-e45d768e2b5e83c79c78",
          "auto-graph-e40ef97c3969c67aad8c",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-8075cb2442a2168b4de2",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "unitdisk-fractional-domination",
      "problem": "Fractional dominating set",
      "variant": "Fractional LP relaxation",
      "objective": "min",
      "graphClass": "Unit-disk",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "O(1)",
      "rounds": "1 round",
      "roundClass": "constant",
      "parameters": "Fixed unit-disk geometry.",
      "assumptions": "Nodes know geometric distances to neighbors. Output is fractional, not a dominating vertex set.",
      "paperId": "kuhn-locality-growth-2005",
      "theorem": "Theorem 4.3",
      "summary": "Local geometry permits constant-factor fractional domination.",
      "verification": "primary",
      "sourceUrl": "https://courses.csail.mit.edu/6.885/spring06/papers/KuhnMW.pdf",
      "year": 2005,
      "problemScope": {
        "node": "fractional-dominating-set"
      },
      "problemSource": "Dominating set",
      "graphScope": {
        "node": "unit-disk"
      },
      "prerequisite": "Geometric distances supplied",
      "approximationDisplay": "Constant",
      "roundsDisplay": "1 round",
      "approximationBenchmark": "fractional",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "1 round",
        "tex": "1\\text{ round}",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://courses.csail.mit.edu/6.885/spring06/papers/KuhnMW.pdf",
            "title": "On the locality of bounded growth",
            "location": "Theorem 4.3"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [],
      "setting": {
        "summary": [
          "auto-graph-422a8fcd40a47bc44c15",
          "weights-unweighted",
          "input-geometric-distances"
        ],
        "parameters": [
          "auto-parameter-7b82cb05a7875699c083"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-422a8fcd40a47bc44c15",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-19e536b10b8d7f071a79",
          "auto-parameter-7b82cb05a7875699c083",
          "detail-fractional-benchmark",
          "detail-fractional-output",
          "input-geometric-distances",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-ps09-vc",
      "problem": "Vertex cover",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "General",
      "model": "Anonymous",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "3",
      "rounds": "2Δ + 1",
      "roundClass": "degree",
      "parameters": "Constant in n when Δ is fixed.",
      "assumptions": "Port numbering; identifiers are unnecessary.",
      "paperId": "gen-ps09",
      "theorem": "Theorem 1",
      "summary": "A port-numbering algorithm with a linear degree dependence.",
      "verification": "primary",
      "sourceUrl": "https://citeseerx.ist.psu.edu/document?doi=6abcfa3e2d0134e51aa8b540f6ab69408fe95f6c&repid=rep1&type=pdf",
      "year": 2009,
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "approximationDisplay": "3",
      "roundsDisplay": "2Δ + 1",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "2Δ + 1",
        "tex": "2\\Delta  + 1",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://citeseerx.ist.psu.edu/document?doi=6abcfa3e2d0134e51aa8b540f6ab69408fe95f6c&repid=rep1&type=pdf",
            "title": "A simple local 3-approximation algorithm for vertex cover",
            "location": "Theorem 1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-unweighted",
          "model-port-numbering"
        ],
        "parameters": [
          "auto-parameter-dfdfaabc71602b4f4891"
        ],
        "assumptions": [],
        "detail": [
          "strength-no-ids"
        ],
        "covered": [
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-92362405df7c8f0d5040",
          "auto-output-7f07455ff69b3b347e9b",
          "auto-parameter-dfdfaabc71602b4f4891",
          "model-port-numbering",
          "strength-no-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-as10-vc",
      "problem": "Vertex cover",
      "variant": "Weighted",
      "objective": "min",
      "graphClass": "General",
      "model": "Anonymous",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "2",
      "rounds": "O(Δ + log* W)",
      "roundClass": "degree",
      "parameters": "W is the largest positive integer weight; fixed Δ and W give constant rounds.",
      "assumptions": "Anonymous port-numbered graph.",
      "paperId": "gen-as10",
      "theorem": "Theorem 1 and vertex-cover reduction",
      "summary": "Finds a maximal fractional edge packing and selects saturated vertices.",
      "verification": "primary",
      "sourceUrl": "https://jukkasuomela.fi/doc/vc-sc.pdf",
      "year": 2010,
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "approximationDisplay": "2",
      "roundsDisplay": "O(Δ + log* W)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(Δ + log* W)",
        "tex": "O(\\Delta  + \\log^* W)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/vc-sc.pdf",
            "title": "Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks",
            "location": "Theorem 1 and vertex-cover reduction"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "General · exact factor 2 · degree/weight dependent",
        "setting": "Deterministic anonymous port numbering; weighted vertex cover on general graphs; positive integer weights at most W; O(Δ + log* W) rounds, independent of n.",
        "reason": "Theorem 1 yields exact factor 2. This retains a tradeoff independent of n, absent from the faster-in-Δ polylogarithmic-n exact-2 result. Factor 2 is optimal for deterministic local algorithms when auxiliary parameters are fixed; optimal dependence on Δ and W is not claimed.",
        "evidenceUrl": "https://jukkasuomela.fi/doc/vc-sc.pdf",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-integer-W",
      "constantApproximation": true,
      "tightness": [
        {
          "certificateId": "anonymous-vertex-cover-factor-two",
          "resultId": "gen-as10-vc",
          "graphs": [
            "general"
          ],
          "problems": [
            "vertex-cover"
          ],
          "models": [
            "Anonymous"
          ],
          "conditionIds": []
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "W",
          "description": "Largest positive integer input vertex weight",
          "tex": "W"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-integer-W",
          "model-port-numbering"
        ],
        "parameters": [
          "auto-parameter-4f0b91346f5e2f0cce0a"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-92362405df7c8f0d5040",
          "auto-output-7f07455ff69b3b347e9b",
          "auto-parameter-4f0b91346f5e2f0cce0a",
          "model-port-numbering",
          "weights-integer-W",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-bcs16-vc",
      "problem": "Vertex cover",
      "variant": "Weighted",
      "objective": "min",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "2 + ε",
      "rounds": "O(log Δ / (ε log log Δ))",
      "roundClass": "degree",
      "parameters": "0 < ε = O(1); constant in n for fixed Δ, ε. Logs are truncated at constants.",
      "assumptions": "Weights and their maximum/minimum ratio have O(log n)-bit encodings.",
      "paperId": "gen-bcs16",
      "theorem": "Theorem 3.1 and Section 4",
      "summary": "A deterministic primal-dual approximation.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/1602.03713",
      "year": 2016,
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "approximationDisplay": "2 + ε",
      "roundsDisplay": "O(log Δ / (ε log log Δ))",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log Δ / (ε log log Δ))",
        "tex": "O\\!\\left(\\frac{\\log\\Delta}{\\varepsilon\\log\\log\\Delta}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/1602.03713",
            "title": "A Distributed (2+ε)-Approximation for Vertex Cover in O(log Δ / (ε log log Δ)) Rounds",
            "location": "Theorem 3.1 and Section 4"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-weighted"
        ],
        "parameters": [
          "auto-parameter-3f51ea419bee252999ef"
        ],
        "assumptions": [
          "auto-assumption-4b3fdcd87cdd0a2f66b9"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-4b3fdcd87cdd0a2f66b9",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-7f07455ff69b3b347e9b",
          "auto-parameter-3f51ea419bee252999ef",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-beks18-exact2",
      "problem": "Vertex cover",
      "variant": "Weighted",
      "objective": "min",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "2",
      "rounds": "O(log n · log Δ / log² log Δ)",
      "roundClass": "polylog",
      "parameters": "Logs are truncated at constants.",
      "assumptions": "Positive integer vertex weights at most W = n^O(1). Vertices know Δ or an upper bound polynomial in Δ. The exact-factor-2 instantiation uses a supplied common polynomial-in-n bound B ≥ nW, allowing the internal accuracy ε < 1/B (for example ε = 1/(2B)); knowing n and W suffices. Identifiers are unnecessary.",
      "paperId": "gen-beks18",
      "theorem": "Abstract",
      "summary": "Obtains factor two without an ε loss.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/1804.01308",
      "year": 2018,
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "prerequisite": "Known Δ and a common polynomial bound B ≥ nW",
      "approximationDisplay": "2",
      "roundsDisplay": "O(log n · log Δ / log² log Δ)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log n · log Δ / log² log Δ)",
        "tex": "O\\!\\left(\\frac{\\log n\\,\\log\\Delta}{(\\log\\log\\Delta)^2}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/1804.01308",
            "title": "A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(log n log Δ / log² log Δ) Rounds",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "General · exact factor 2 · polylogarithmic",
        "setting": "Deterministic CONGEST; weighted vertex cover on general graphs; positive integer weights W≤n^O(1); Δ or a polynomial-in-Δ upper bound known; a common polynomial-in-n bound B≥nW permits internal ε<1/B; exact factor 2 in O(log n · log Δ / log² log Δ) rounds.",
        "reason": "The paper supplies the exact-2 point of the weighted-VC tradeoff, improving prior deterministic exact-2 complexity. A 2+ε guarantee, even with fewer rounds, does not dominate exact factor 2; the anonymous n-independent exact-2 algorithm has a different Δ/weight tradeoff. No matching running-time lower bound is claimed.",
        "evidenceUrl": "https://arxiv.org/pdf/1804.01308v3",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierComparisons": [
        {
          "better": "gen-beks19-exact2",
          "worse": "gen-beks18-exact2",
          "strict": [
            "rounds",
            "assumptions"
          ],
          "conditions": {
            "problem": "Both return an integral minimum-weight vertex-cover approximation on the original graph.",
            "graphClass": "Both apply to all general graphs.",
            "approximation": "The approximation ratio is identical for every allowed accuracy value; the exact-2 comparison has no additive loss.",
            "rounds": "O(log n) is no worse than O(log n·log Δ/log² log Δ), with truncated logarithms. The improvement is strict when Δ grows, for example Δ=n. Both statements specify asymptotic round complexities. The comparison concerns their dependence on n and Δ.",
            "model": "Both are deterministic CONGEST algorithms. The rank-two edge processors of the newer protocol are simulated with constant overhead.",
            "randomness": "Both are deterministic.",
            "benchmark": "The newer guarantee is at least as strong as the older integral-OPT benchmark. In the approximate case its proof also bounds cost against fractional OPT.",
            "assumptions": "Both use positive polynomially bounded integer weights and a common polynomial bound B≥nW for the small-accuracy integrality step. The older implementation also needs global Δ; the newer one does not."
          },
          "evidenceUrl": "https://arxiv.org/pdf/1902.09377v2#page=9",
          "reason": "The 2019 rank-two corollary gives exact factor 2 in logarithmic rounds, superseding the older extra degree-dependent factor without stronger input assumptions."
        }
      ],
      "dominatedBy": [
        "gen-beks19-exact2"
      ],
      "frontierStatus": "dominated",
      "weightCondition": "weights-integer-polynomial",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "B",
          "description": "Supplied common polynomial upper bound on nW for the exact-factor integrality step",
          "tex": "B"
        },
        {
          "symbol": "W",
          "description": "Upper bound on positive integer input vertex weights; polynomial in n",
          "tex": "W"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-integer-polynomial",
          "input-degree-and-nW-bound"
        ],
        "parameters": [
          "auto-parameter-7fd648ba359d62bdb633"
        ],
        "assumptions": [],
        "detail": [
          "detail-exact-integrality",
          "strength-no-ids"
        ],
        "covered": [
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-7f07455ff69b3b347e9b",
          "auto-parameter-7fd648ba359d62bdb633",
          "detail-exact-integrality",
          "input-common-nW-bound",
          "input-degree-and-nW-bound",
          "input-known-degree-bound",
          "strength-no-ids",
          "weights-integer-polynomial",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-beks18-eps",
      "problem": "Vertex cover",
      "variant": "Weighted",
      "objective": "min",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "2 + (log Δ)⁻ᶜ",
      "rounds": "O(log Δ / log log Δ)",
      "roundClass": "degree",
      "parameters": "Fixed c ≥ 1; logs truncated at constants.",
      "assumptions": "Positive integer vertex weights at most W = n^O(1). Vertices know Δ or an upper bound polynomial in Δ; the stated inverse-polylogarithmic accuracy is instantiated using that degree information. Identifiers are unnecessary. Section 4 gives separate unknown-Δ variants with their own parameter choices.",
      "paperId": "gen-beks18",
      "theorem": "Abstract",
      "summary": "A degree-dependent approximation approaching two.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/1804.01308",
      "year": 2018,
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "prerequisite": "Known Δ or a polynomial upper bound",
      "approximationDisplay": "2 + (log Δ)⁻ᶜ",
      "roundsDisplay": "O(log Δ / log log Δ)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log Δ / log log Δ)",
        "tex": "O\\!\\left(\\frac{\\log\\Delta}{\\log\\log\\Delta}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/1804.01308",
            "title": "A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(log n log Δ / log² log Δ) Rounds",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "General · inverse-polylog accuracy · degree dependent",
        "setting": "Deterministic CONGEST; weighted vertex cover on general graphs; positive integer weights W≤n^O(1); Δ or a polynomial-in-Δ upper bound known; fixed c≥1 and accuracy ε=(log Δ)^−c; O(log Δ / log log Δ) rounds. This annotation uses the known-degree instantiation, not the separate Section 4 variants.",
        "reason": "Theorem 2 gives the degree-optimal round dependence in this accuracy range, matching the KMW lower bound for constant or polylogarithmic factors. Exact factor 2 requires a different round tradeoff. This annotation is restricted to the stated relation between ε and Δ.",
        "evidenceUrl": "https://arxiv.org/pdf/1804.01308v3#page=6",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierComparisons": [
        {
          "better": "gen-beks18-full-eps",
          "worse": "gen-beks18-eps",
          "strict": [
            "assumptions"
          ],
          "parameterSubstitution": "ε=(log Δ)^−c for fixed c≥1",
          "conditions": {
            "problem": "Both solve minimum-weight vertex cover and return an integral vertex set.",
            "graphClass": "Both work on general graphs.",
            "approximation": "Substituting ε=(log Δ)^−c gives exactly the corollary’s ratio 2+(log Δ)^−c.",
            "rounds": "This is the same Algorithm 1, not a comparison of unrelated hidden constants. In Theorem 2 the substitution makes log(1/ε)=c log log Δ and yields O(log Δ/log log Δ) for fixed c; the bounded-degree cases use the same protocol.",
            "model": "Both use the same deterministic CONGEST implementation.",
            "randomness": "Both are deterministic.",
            "benchmark": "Both compare the integral cover cost with weighted integral OPT.",
            "assumptions": "Both require positive polynomially bounded integer weights and known Δ or a polynomial upper bound. The full theorem permits every ε∈(0,1); the narrower inverse-polylogarithmic accuracy restriction is unnecessary."
          },
          "evidenceUrl": "https://arxiv.org/pdf/1804.01308v3#page=6",
          "reason": "The special accuracy point is already contained in the full Theorem 2 family, with identical algorithm, guarantee and round complexity after substitution and a strictly larger accuracy domain."
        }
      ],
      "dominatedBy": [
        "gen-beks18-full-eps"
      ],
      "frontierStatus": "dominated",
      "weightCondition": "weights-integer-polynomial",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "W",
          "description": "Upper bound on positive integer input vertex weights; polynomial in n",
          "tex": "W"
        },
        {
          "symbol": "c",
          "description": "Fixed exponent at least one controlling the inverse-polylogarithmic accuracy",
          "tex": "c"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-integer-polynomial",
          "input-known-degree-bound"
        ],
        "parameters": [
          "auto-parameter-353144e79cb249f819e3"
        ],
        "assumptions": [],
        "detail": [
          "strength-no-ids",
          "detail-unknown-degree-variants"
        ],
        "covered": [
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-7f07455ff69b3b347e9b",
          "auto-parameter-353144e79cb249f819e3",
          "detail-unknown-degree-variants",
          "input-known-degree-bound",
          "strength-no-ids",
          "weights-integer-polynomial",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-emr14-cardinality",
      "problem": "Maximum matching",
      "variant": "Unweighted",
      "objective": "max",
      "graphClass": "General",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − ε of OPT",
      "rounds": "Δᴼ⁽¹⁄ε⁾ + O(ε⁻²) log* n",
      "roundClass": "logstar",
      "parameters": "Fixed Δ and ε give O(log* n).",
      "assumptions": "Unique polynomial-size identifiers; n and Δ known.",
      "paperId": "gen-emr14",
      "theorem": "Abstract",
      "summary": "Deterministic approximation scheme for bounded degree.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/1407.7882",
      "year": 2014,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "prerequisite": "Known n and Δ",
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "Δᴼ⁽¹⁄ε⁾ + O(ε⁻²) log* n",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Δᴼ⁽¹⁄ε⁾ + O(ε⁻²) log* n",
        "tex": "\\Delta^{O(1/\\varepsilon)}+O(\\varepsilon^{-2})\\log^*n",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/1407.7882",
            "title": "Distributed Maximum Matching in Bounded Degree Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-unweighted",
          "input-known-n-degree"
        ],
        "parameters": [
          "auto-parameter-d1888d49018736b6c746"
        ],
        "assumptions": [
          "input-logarithmic-ids"
        ],
        "detail": [],
        "covered": [
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-d1888d49018736b6c746",
          "input-distinct-ids",
          "input-known-degree",
          "input-known-n",
          "input-known-n-degree",
          "input-logarithmic-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-emr14-weighted",
      "problem": "Maximum matching",
      "variant": "Weighted",
      "objective": "max",
      "graphClass": "General",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − ε of OPT",
      "rounds": "log(min{1/w_min, n/ε})ᴼ⁽¹⁄ε⁾ · (Δᴼ⁽¹⁄ε⁾ + log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed Δ, ε and positive w_min give O(log* n).",
      "assumptions": "Weights normalized to [w_min, 1]; unique IDs; n and Δ known.",
      "paperId": "gen-emr14",
      "theorem": "Abstract",
      "summary": "A weighted extension with explicit dependence on weight range.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/1407.7882",
      "year": 2014,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "prerequisite": "Known n and Δ",
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "log(min{1/w_min, n/ε})ᴼ⁽¹⁄ε⁾ · (Δᴼ⁽¹⁄ε⁾ + log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "log(min{1/w_min, n/ε})ᴼ⁽¹⁄ε⁾ · (Δᴼ⁽¹⁄ε⁾ + log* n)",
        "tex": "\\log^{O(1/\\varepsilon)}\\!\\left(\\min\\left\\{\\frac{1}{w_{\\min}},\\frac{n}{\\varepsilon}\\right\\}\\right)\\left(\\Delta^{O(1/\\varepsilon)}+\\log^*n\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/1407.7882",
            "title": "Distributed Maximum Matching in Bounded Degree Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-normalized-positive",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "w_min",
          "description": "Smallest normalized positive edge weight; all weights lie in [w_min,1]",
          "tex": "w_{\\min}"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-normalized-positive",
          "input-known-n-degree"
        ],
        "parameters": [
          "auto-parameter-d8bbb2a784bfaf07e208"
        ],
        "assumptions": [
          "input-distinct-ids"
        ],
        "detail": [],
        "covered": [
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-d8bbb2a784bfaf07e208",
          "input-distinct-ids",
          "input-known-degree",
          "input-known-n",
          "input-known-n-degree",
          "weights-normalized-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-bcgs17-is",
      "problem": "Independent set",
      "variant": "Weighted",
      "objective": "max",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1/Δ of OPT",
      "rounds": "O(Δ + log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed Δ gives O(log* n).",
      "assumptions": "",
      "paperId": "gen-bcgs17",
      "theorem": "Table 1; Section 2",
      "summary": "Coloring-based local-ratio algorithm.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/1708.00276",
      "year": 2017,
      "problemScope": {
        "node": "independent-set"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "approximationDisplay": "1/Δ",
      "roundsDisplay": "O(Δ + log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(Δ + log* n)",
        "tex": "O(\\Delta  + \\log^* n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/1708.00276",
            "title": "Distributed Approximation of Maximum Independent Set and Maximum Matching",
            "location": "Table 1; Section 2"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-weighted"
        ],
        "parameters": [
          "auto-parameter-15159932d98a441680fe"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-4ad7b7801c4e84e8fdd9",
          "auto-parameter-15159932d98a441680fe",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-bcgs17-mwm",
      "problem": "Maximum matching",
      "variant": "Weighted",
      "objective": "max",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1/2 of OPT",
      "rounds": "O(Δ + log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed Δ gives O(log* n).",
      "assumptions": "",
      "paperId": "gen-bcgs17",
      "theorem": "Table 1; Section 2.4",
      "summary": "A line-graph simulation preserves the message-size bound.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/1708.00276",
      "year": 2017,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "approximationDisplay": "1/2",
      "roundsDisplay": "O(Δ + log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(Δ + log* n)",
        "tex": "O(\\Delta  + \\log^* n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/1708.00276",
            "title": "Distributed Approximation of Maximum Independent Set and Maximum Matching",
            "location": "Table 1; Section 2.4"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-weighted",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-weighted"
        ],
        "parameters": [
          "auto-parameter-15159932d98a441680fe"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-15159932d98a441680fe",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-bcgs17-fast-mwm",
      "problem": "Maximum matching",
      "variant": "Weighted",
      "objective": "max",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "1/(2 + ε) of OPT",
      "rounds": "O(log Δ / log log Δ)",
      "roundClass": "degree",
      "parameters": "Fixed ε > 0; logs truncated at constants.",
      "assumptions": "Randomized guarantee; see Section 3 for probability details.",
      "paperId": "gen-bcgs17",
      "theorem": "Table 1; Section 3",
      "summary": "Trades a small approximation loss for degree-only runtime.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/1708.00276",
      "year": 2017,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "approximationDisplay": "1/(2 + ε)",
      "roundsDisplay": "O(log Δ / log log Δ)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log Δ / log log Δ)",
        "tex": "O\\!\\left(\\frac{\\log\\Delta}{\\log\\log\\Delta}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/1708.00276",
            "title": "Distributed Approximation of Maximum Independent Set and Maximum Matching",
            "location": "Table 1; Section 3"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-weighted"
        ],
        "parameters": [
          "auto-parameter-5936198c8edb2e100c9d"
        ],
        "assumptions": [
          "auto-assumption-cf6ebb6783a98dbd5cbb"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-cf6ebb6783a98dbd5cbb",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-5936198c8edb2e100c9d",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-bcgs17-fast-mcm",
      "problem": "Maximum matching",
      "variant": "Unweighted",
      "objective": "max",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "1/(1 + ε) of OPT",
      "rounds": "O(log Δ / log log Δ)",
      "roundClass": "degree",
      "parameters": "Fixed ε > 0; logs truncated at constants.",
      "assumptions": "Randomized guarantee; probability depends on instance size and parameters.",
      "paperId": "gen-bcgs17",
      "theorem": "Table 1; Appendix B.3",
      "summary": "Uses short augmenting paths in sampled bipartite subgraphs.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/1708.00276",
      "year": 2017,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "approximationDisplay": "1/(1 + ε)",
      "roundsDisplay": "O(log Δ / log log Δ)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log Δ / log log Δ)",
        "tex": "O\\!\\left(\\frac{\\log\\Delta}{\\log\\log\\Delta}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/1708.00276",
            "title": "Distributed Approximation of Maximum Independent Set and Maximum Matching",
            "location": "Table 1; Appendix B.3"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-5936198c8edb2e100c9d"
        ],
        "assumptions": [
          "auto-assumption-70a7a2d2cd73511df407"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-70a7a2d2cd73511df407",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-5936198c8edb2e100c9d",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-ako18-fractional",
      "problem": "Fractional matching",
      "variant": "Fractional weighted",
      "objective": "max",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − ε of fractional OPT",
      "rounds": "O(log(ΔW) / ε²)",
      "roundClass": "degree",
      "parameters": "W is largest/smallest edge weight; fixed Δ, W, ε give constant rounds.",
      "assumptions": "",
      "paperId": "gen-ako18",
      "theorem": "Abstract",
      "summary": "Approximates the fractional matching LP.",
      "verification": "primary",
      "sourceUrl": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.6",
      "year": 2018,
      "status": "claimed",
      "caveat": "Li–Ouyang–Wang (2024), Remark 1.2, reports a flaw in the weighted fractional matching proof and says the claimed time bound is not recovered. Integral weighted bounds use that fractional primitive; retained as published claims.",
      "caveatUrl": "https://arxiv.org/html/2409.16168v1",
      "problemScope": {
        "node": "fractional-matching"
      },
      "problemSource": "Maximum matching",
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "O(log(ΔW) / ε²)",
      "approximationBenchmark": "fractional",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log(ΔW) / ε²)",
        "tex": "O\\!\\left(\\frac{\\log(\\Delta W)}{\\varepsilon^2}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.6",
            "title": "Distributed Approximate Maximum Matching in the CONGEST Model",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "W",
          "description": "Ratio of the largest to the smallest positive edge weight",
          "tex": "W"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-weighted"
        ],
        "parameters": [
          "auto-parameter-c8d5c1c10fbc9e230819"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-9ba84324ac5813181686",
          "auto-parameter-c8d5c1c10fbc9e230819",
          "detail-fractional-benchmark",
          "detail-fractional-output",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-ako18-bipartite",
      "problem": "Maximum matching",
      "variant": "Weighted",
      "objective": "max",
      "graphClass": "Bipartite",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − ε of OPT",
      "rounds": "O(log(ΔW)/ε² + (log² Δ + log* n)/ε)",
      "roundClass": "logstar",
      "parameters": "Fixed Δ, W and ε give O(log* n).",
      "assumptions": "",
      "paperId": "gen-ako18",
      "theorem": "Abstract",
      "summary": "Deterministic rounding of a fractional matching.",
      "verification": "primary",
      "sourceUrl": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.6",
      "year": 2018,
      "status": "claimed",
      "caveat": "Li–Ouyang–Wang (2024), Remark 1.2, reports a flaw in the weighted fractional matching proof and says the claimed time bound is not recovered. Integral weighted bounds use that fractional primitive; retained as published claims.",
      "caveatUrl": "https://arxiv.org/html/2409.16168v1",
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "bipartite"
      },
      "graphClassSource": "Bipartite graphs",
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "O(log(ΔW)/ε² + (log² Δ + log* n)/ε)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log(ΔW)/ε² + (log² Δ + log* n)/ε)",
        "tex": "O\\!\\left(\\frac{\\log(\\Delta W)}{\\varepsilon^2}+\\frac{\\log^2\\Delta+\\log^*n}{\\varepsilon}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.6",
            "title": "Distributed Approximate Maximum Matching in the CONGEST Model",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "W",
          "description": "Ratio of the largest to the smallest positive edge weight",
          "tex": "W"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-7a5af0aff91f9fa9d17f",
          "weights-weighted"
        ],
        "parameters": [
          "auto-parameter-95d1811bfaf4d14ff9a2"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-7a5af0aff91f9fa9d17f",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-95d1811bfaf4d14ff9a2",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-ako18-oddgirth",
      "problem": "Maximum matching",
      "variant": "Weighted",
      "objective": "max",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 − ε)(g − 1)/g of OPT",
      "rounds": "O(log(ΔW)/ε² + (log² Δ + log* n)/ε)",
      "roundClass": "logstar",
      "parameters": "g is odd girth; W is the edge-weight ratio; fixed Δ, W, ε give O(log* n).",
      "assumptions": "",
      "paperId": "gen-ako18",
      "theorem": "Abstract",
      "summary": "Odd girth controls the integrality loss.",
      "verification": "primary",
      "sourceUrl": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.6",
      "year": 2018,
      "status": "claimed",
      "caveat": "Li–Ouyang–Wang (2024), Remark 1.2, reports a flaw in the weighted fractional matching proof and says the claimed time bound is not recovered. Integral weighted bounds use that fractional primitive; retained as published claims.",
      "caveatUrl": "https://arxiv.org/html/2409.16168v1",
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "approximationDisplay": "(1 − ε)(g − 1)/g",
      "roundsDisplay": "O(log(ΔW)/ε² + (log² Δ + log* n)/ε)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log(ΔW)/ε² + (log² Δ + log* n)/ε)",
        "tex": "O\\!\\left(\\frac{\\log(\\Delta W)}{\\varepsilon^2}+\\frac{\\log^2\\Delta+\\log^*n}{\\varepsilon}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.6",
            "title": "Distributed Approximate Maximum Matching in the CONGEST Model",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "W",
          "description": "Ratio of the largest to the smallest positive edge weight",
          "tex": "W"
        },
        {
          "symbol": "g",
          "description": "Odd girth: length of a shortest odd cycle",
          "tex": "g"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-weighted"
        ],
        "parameters": [
          "auto-parameter-afe3872ce26bd4e61843"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-afe3872ce26bd4e61843",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-ffk21-vc-bip",
      "problem": "Vertex cover",
      "variant": "Weighted",
      "objective": "min",
      "graphClass": "Bipartite",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "poly(log n / ε)",
      "roundClass": "polylog",
      "parameters": "",
      "assumptions": "",
      "paperId": "gen-ffk21",
      "theorem": "Abstract",
      "summary": "Near-optimal bipartite cover.",
      "verification": "primary",
      "sourceUrl": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.17",
      "year": 2021,
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "bipartite"
      },
      "graphClassSource": "Bipartite graphs",
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "poly(log n / ε)",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "poly(log n / ε)",
        "tex": "\\operatorname{poly}(\\log n/\\varepsilon)",
        "basis": "stated",
        "explanation": "Theorem 1.1 of the full version states this deterministic CONGEST bound for weighted bipartite vertex cover, for ε ∈ (0,1]. The theorem and diameter-reduction implementation do not supply a complete numerical polynomial exponent.",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2111.10577",
            "title": "Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings",
            "location": "Theorem 1.1; Theorem 3.1; Section 4.1"
          },
          {
            "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.17",
            "title": "Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings (OPODIS 2021)",
            "location": "Theorem 1; related full-version link"
          }
        ],
        "parameters": [
          {
            "symbol": "ε",
            "description": "Approximation accuracy, 0 < ε ≤ 1",
            "tex": "\\varepsilon"
          },
          {
            "symbol": "n",
            "description": "Number of vertices",
            "tex": "n"
          }
        ],
        "checked": "2026-11-16",
        "audited": true
      },
      "sota": {
        "scopeLabel": "Bipartite · weighted VC · polylogarithmic scheme",
        "setting": "Deterministic CONGEST; minimum-weight vertex cover on bipartite graphs; source weight encodings; every ε∈(0,1]; factor 1+ε in poly(log n/ε) rounds.",
        "reason": "Theorem 1.1 gives the weighted bipartite approximation-scheme point. General-graph factor-2 or 2+ε bounds do not dominate its stronger guarantee. The paper proves an Ω(log n/ε) LOCAL lower bound already on degree-three bipartite graphs; this does not establish optimal polylogarithmic exponents.",
        "evidenceUrl": "https://arxiv.org/pdf/2111.10577#page=4",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-epsilon-unit-inclusive",
          "claim-source-weight-encoding"
        ]
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy, 0 < ε ≤ 1",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-7a5af0aff91f9fa9d17f",
          "weights-weighted"
        ],
        "parameters": [],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-7a5af0aff91f9fa9d17f",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-7f07455ff69b3b347e9b",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-ffk21-mwm-det",
      "problem": "Maximum matching",
      "variant": "Weighted",
      "objective": "max",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − ε of OPT",
      "rounds": "2ᴼ⁽¹⁄ε⁾ · polylog n",
      "roundClass": "polylog",
      "parameters": "ε > 0.",
      "assumptions": "",
      "paperId": "gen-ffk21",
      "theorem": "Abstract",
      "summary": "Deterministic weighted matching scheme.",
      "verification": "primary",
      "sourceUrl": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.17",
      "year": 2021,
      "status": "claimed",
      "caveat": "Inherited dependency: FFK21 Lemma 5.2 invokes AKO18 weighted bipartite matching. Li–Ouyang–Wang (2024), Remark 1.2, reports a proof flaw in AKO18’s weighted fractional primitive. This catalog has not verified a repair preserving this bound.",
      "caveatUrl": "https://arxiv.org/html/2409.16168v1",
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "2ᴼ⁽¹⁄ε⁾ · polylog n",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "2ᴼ⁽¹⁄ε⁾ · polylog n",
        "tex": "2^{O(1/\\varepsilon)}\\operatorname{polylog}n",
        "basis": "stated",
        "explanation": "Lemma 5.8 in the full version retains an unspecified polylogarithmic factor. The more explicit expression involving Δ, W and failure probability δ in Theorem 1.4 applies to the randomized algorithm. Preserve the catalog's existing dependency caveat for the deterministic result.",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2111.10577",
            "title": "Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings",
            "location": "Lemma 5.8 and proof; Theorem 1.4"
          }
        ],
        "parameters": [
          {
            "symbol": "ε",
            "description": "Approximation accuracy, 0 < ε ≤ 1",
            "tex": "\\varepsilon"
          },
          {
            "symbol": "n",
            "description": "Number of vertices",
            "tex": "n"
          }
        ],
        "checked": "2026-11-16",
        "audited": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy, 0 < ε ≤ 1",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-weighted"
        ],
        "parameters": [
          "auto-parameter-d3b582587818d15dae40"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-d3b582587818d15dae40",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-ffk21-mwm-rand",
      "problem": "Maximum matching",
      "variant": "Weighted",
      "objective": "max",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "1 − ε of OPT",
      "rounds": "2ᴼ⁽¹⁄ε⁾ · (log(ΔW) + log² Δ + log* n) · log³(1/δ)",
      "roundClass": "logstar",
      "parameters": "Fixed Δ, W, ε, δ give O(log* n).",
      "assumptions": "Success probability ≥ 1−δ; W is largest/smallest weight.",
      "paperId": "gen-ffk21",
      "theorem": "Theorem 1.4",
      "summary": "Randomized weighted matching scheme.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2111.10577",
      "year": 2021,
      "status": "claimed",
      "caveat": "Inherited dependency: FFK21 Lemma 5.2 invokes AKO18 weighted bipartite matching. Li–Ouyang–Wang (2024), Remark 1.2, reports a proof flaw in AKO18’s weighted fractional primitive. This catalog has not verified a repair preserving this bound.",
      "caveatUrl": "https://arxiv.org/html/2409.16168v1",
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "2ᴼ⁽¹⁄ε⁾ · (log(ΔW) + log² Δ + log* n) · log³(1/δ)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "2ᴼ⁽¹⁄ε⁾ · (log(ΔW) + log² Δ + log* n) · log³(1/δ)",
        "tex": "2^{O(1/\\varepsilon)}\\bigl(\\log(\\Delta W)+\\log^2\\Delta+\\log^*n\\bigr)\\log^3(1/\\delta)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2111.10577",
            "title": "Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings",
            "location": "Theorem 1.4"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "W",
          "description": "Ratio of the largest to the smallest positive edge weight",
          "tex": "W"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "δ",
          "description": "Failure-probability upper bound; success probability is at least 1−δ",
          "tex": "\\delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-weighted"
        ],
        "parameters": [
          "auto-parameter-7cb2254842bd27f88e5d"
        ],
        "assumptions": [
          "auto-assumption-3b7575788fd0f5679a75"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-3b7575788fd0f5679a75",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-7cb2254842bd27f88e5d",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-ffk21-vc-lower",
      "problem": "Vertex cover",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Bipartite; Δ ≤ 3",
      "model": "LOCAL",
      "randomization": "Randomized",
      "bound": "lower",
      "approximation": "1 + ε",
      "rounds": "Ω(log n / ε)",
      "roundClass": "logarithmic",
      "parameters": "0 < ε < ε₀ for a positive constant ε₀.",
      "assumptions": "Applies to randomized algorithms, hence also deterministic ones.",
      "paperId": "gen-ffk21",
      "theorem": "Theorem 1.5; Section 6",
      "summary": "Even degree-three bipartite graphs require nonlocal information.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2111.10577",
      "year": 2021,
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "degree-bipartite"
      },
      "graphClassSource": "Bipartite graphs, Δ ≤ 3",
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "Ω(log n / ε)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Ω(log n / ε)",
        "tex": "\\Omega\\!\\left(\\frac{\\log n}{\\varepsilon}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2111.10577",
            "title": "Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings",
            "location": "Theorem 1.5; Section 6"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "ε₀",
          "description": "Positive absolute upper threshold on the accuracy parameter",
          "tex": "\\varepsilon_0"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-7c1008dca893d58855a9",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-1ccb3cbcbeee4e7c5cc6"
        ],
        "assumptions": [
          "auto-assumption-55d0383c4b86c8bcc344"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-55d0383c4b86c8bcc344",
          "auto-graph-7c1008dca893d58855a9",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-output-7f07455ff69b3b347e9b",
          "auto-parameter-1ccb3cbcbeee4e7c5cc6",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-hs22-mwm",
      "problem": "Maximum matching",
      "variant": "Weighted",
      "objective": "max",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − ε of OPT",
      "rounds": "poly(1/ε, log n)",
      "roundClass": "polylog",
      "parameters": "",
      "assumptions": "",
      "paperId": "gen-hs22",
      "theorem": "Abstract",
      "summary": "Makes the accuracy dependence polynomial.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2212.14425",
      "year": 2022,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "poly(1/ε, log n)",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "poly(1/ε, log n)",
        "tex": "\\operatorname{poly}(1/\\varepsilon,\\log n)",
        "basis": "stated",
        "explanation": "Theorem 1.1 states this deterministic CONGEST bound. Theorem 5.1 and Lemma C.7 retain polynomial costs for the augmentation subroutine and its simulation. The reviewed statements do not give numerical exponents for the complete algorithm.",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2212.14425",
            "title": "(1−ε)-Approximate Maximum Weighted Matching in Distributed, Parallel, and Semi-Streaming Settings",
            "location": "Theorem 1.1; Theorem 5.1; Lemma C.7"
          }
        ],
        "parameters": [
          {
            "symbol": "ε",
            "description": "Approximation accuracy, 0 < ε < 1",
            "tex": "\\varepsilon"
          },
          {
            "symbol": "n",
            "description": "Number of vertices",
            "tex": "n"
          }
        ],
        "checked": "2026-11-16",
        "audited": true
      },
      "sota": {
        "scopeLabel": "General · weighted matching · fully polynomial scheme",
        "setting": "Deterministic CONGEST; maximum-weight matching on general graphs; weights use the source message encoding; arbitrary 0 < ε < 1; retained weight at least (1−ε) OPT in poly(1/ε, log n) rounds.",
        "reason": "Theorem 1.1 supplies the fully polynomial CONGEST scheme for weighted matching on general graphs, replacing the earlier exponential-in-1/ε dependency. Later cardinality-only matching improvements do not dominate this weighted guarantee. The annotation does not assert optimal polynomial exponents.",
        "evidenceUrl": "https://arxiv.org/pdf/2212.14425v2#page=4",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-epsilon-unit",
          "claim-source-weight-encoding"
        ]
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy, 0 < ε < 1",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-weighted"
        ],
        "parameters": [],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-d95ef193bcfe270b3957",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-aprsu10-matching",
      "problem": "Maximum matching",
      "variant": "Unweighted",
      "objective": "max",
      "graphClass": "Bipartite",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1/(1 + ε) of OPT",
      "rounds": "O_Δ,ε(1)",
      "roundClass": "parameter",
      "parameters": "Fixed Δ and ε.",
      "assumptions": "A proper 2-colouring is given as input.",
      "paperId": "gen-aprsu10",
      "theorem": "Theorem 9",
      "summary": "Input colouring enables a deterministic local scheme.",
      "verification": "primary",
      "sourceUrl": "https://jukkasuomela.fi/doc/weakly-coloured.pdf",
      "year": 2010,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "bipartite"
      },
      "graphClassSource": "Bipartite graphs",
      "prerequisite": "Supplied proper 2-coloring",
      "approximationDisplay": "1/(1 + ε)",
      "roundsDisplay": "f(Δ, ε)",
      "roundParameters": [
        {
          "symbol": "Δ",
          "name": "max degree",
          "introduced": false,
          "displaySymbol": true
        },
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(Δ Σ_{i=1}^{K} (2i−1)(Δ−1)^{i−1}) for Δ ≥ 2, where K = ceil(1/ε); constant for Δ ≤ 1",
        "tex": "O\\!\\left(\\Delta\\sum_{i=1}^{K}(2i-1)(\\Delta-1)^{i-1}\\right)\\ (\\Delta\\ge 2),\\qquad K=\\lceil 1/\\varepsilon\\rceil",
        "basis": "derived-phase-bound",
        "explanation": "Section 6 runs stages i=1,...,K. Stage i removes augmenting paths of length h=2i−1 using at most t_i=Δ(Δ−1)^{i−1} invocations. Each invocation consists of flooding, proposals, and augmentation along paths of length h, and therefore costs O(h) rounds. Summing gives this explicit parameter dependence. The paper does not state an exact integer total. For Δ≤1, taking all edges gives an exact matching after at most one round; this avoids a 0^0 convention in the displayed sum. The supplied proper two-colouring is essential.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/weakly-coloured.pdf#page=11",
            "title": "Local algorithms in (weakly) coloured graphs",
            "location": "Section 6, augmenting-path algorithm and t_i bound immediately before Theorem 9"
          }
        ],
        "parameters": [
          {
            "symbol": "Δ",
            "description": "Maximum degree"
          },
          {
            "symbol": "ε",
            "description": "Positive accuracy parameter"
          },
          {
            "symbol": "K",
            "description": "Number of augmenting-path-length stages, ceil(1/ε)"
          },
          {
            "symbol": "i",
            "description": "Index of the augmenting-path-length stage",
            "tex": "i"
          }
        ],
        "checked": "2026-11-16",
        "audited": true,
        "expression": {
          "formula": "O(Δ Σ_{i=1}^{K} (2i−1)(Δ−1)^{i−1})",
          "tex": "O\\!\\left(\\Delta\\sum_{i=1}^{K}(2i-1)(\\Delta-1)^{i-1}\\right)"
        },
        "suffix": {
          "formula": " for Δ ≥ 2, where K = ceil(1/ε); constant for Δ ≤ 1",
          "tex": "\\ (\\Delta\\ge 2),\\qquad K=\\lceil 1/\\varepsilon\\rceil"
        }
      },
      "sota": {
        "scopeLabel": "Properly 2-colored bipartite · rounds independent of n",
        "setting": "Deterministic LOCAL; unweighted matching with a proper 2-coloring supplied as input and fixed maximum degree Δ; fixed ε>0; retained fraction 1/(1+ε) in f(Δ,ε) rounds independent of n.",
        "reason": "Theorem 9 supplies an approximation scheme in f(Δ, ε) rounds under this extra symmetry-breaking input. The limiting ratio is optimal; optimal dependence on Δ or ε is not claimed. Algorithms using log-star rounds without a supplied coloring do not dominate this guarantee independent of n.",
        "evidenceUrl": "https://jukkasuomela.fi/doc/weakly-coloured.pdf#page=12",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-epsilon-positive"
        ]
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "K",
          "description": "Number of augmenting-path-length stages, ceil(1/ε)",
          "tex": "K"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "i",
          "description": "Index of the augmenting-path-length stage",
          "tex": "i"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Positive accuracy parameter",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-7a5af0aff91f9fa9d17f",
          "weights-unweighted",
          "input-proper-two-coloring"
        ],
        "parameters": [
          "auto-parameter-69a29a48be724a8c4831"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-7a5af0aff91f9fa9d17f",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-69a29a48be724a8c4831",
          "input-proper-two-coloring",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-aprsu10-dom",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Weakly 2-colored",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(Δ + 1)/2",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "The maximum degree Δ affects the approximation ratio. The supplied weak 2-colouring permits a universal constant number of communication rounds, independently of Δ.",
      "assumptions": "A weak 2-colouring is supplied; no isolated vertices.",
      "paperId": "gen-aprsu10",
      "theorem": "Theorem 6",
      "summary": "Matches the paper’s local lower bound.",
      "verification": "primary",
      "sourceUrl": "https://jukkasuomela.fi/doc/weakly-coloured.pdf",
      "year": 2010,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "weak-colored",
        "note": "Requires a supplied weak two-coloring and no isolated vertices."
      },
      "graphClassSource": "Weakly 2-coloured graphs",
      "prerequisite": "Supplied weak 2-coloring; no isolates",
      "approximationDisplay": "(Δ + 1)/2",
      "roundsDisplay": "≤ 4",
      "roundCountEvidence": {
        "rounds": "≤ 4",
        "basis": "phase-count",
        "explanation": "The supplied weak two-colouring permits the Section 4 star-forest construction in an absolute constant number of rounds. The four-round schedule below computes exactly its final star centres without communicating the final edge orientations. Every black vertex with white children becomes a centre. An original white root remains a centre exactly when at least one of its black children has no white children. A white vertex that proposed to a black vertex is a leaf. In the all-depth-two case a root chooses one child for edge reversal, but the choice does not affect the set of centres, so the dominating-set output needs no extra round. This is an implementation upper bound derived from the paper, not a printed exact runtime or a claim of round optimality. Δ occurs in the approximation guarantee, not in the communication radius. The catalogue’s f(Δ) classification can be strengthened to constant. Schedule: (1) exchange weak-colouring bits; (2) black vertices propose to white parents; (3) white vertices without black children propose to black parents; (4) black vertices report whether they acquired white children. The selected set is the final star centres.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/weakly-coloured.pdf#page=8",
            "title": "Local algorithms in (weakly) coloured graphs",
            "location": "Section 4 star-forest construction and Theorem 6"
          }
        ],
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "≤ 4",
        "tex": "\\le 4",
        "basis": "derived-phase-bound",
        "explanation": "The supplied weak two-colouring permits the Section 4 star-forest construction in an absolute constant number of rounds. The four-round schedule below computes exactly its final star centres without communicating the final edge orientations. Every black vertex with white children becomes a centre. An original white root remains a centre exactly when at least one of its black children has no white children. A white vertex that proposed to a black vertex is a leaf. In the all-depth-two case a root chooses one child for edge reversal, but the choice does not affect the set of centres, so the dominating-set output needs no extra round. This is an implementation upper bound derived from the paper, not a printed exact runtime or a claim of round optimality. Δ occurs in the approximation guarantee, not in the communication radius. The catalogue’s f(Δ) classification can be strengthened to constant.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/weakly-coloured.pdf#page=8",
            "title": "Local algorithms in (weakly) coloured graphs",
            "location": "Section 4 star-forest construction and Theorem 6"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-009b17c9926b5eac5d12",
          "weights-unweighted",
          "input-weak-coloring-no-isolates"
        ],
        "parameters": [
          "auto-parameter-04655930e34a98fa6fb5"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-009b17c9926b5eac5d12",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-04655930e34a98fa6fb5",
          "input-isolate-free",
          "input-weak-coloring-no-isolates",
          "input-weak-two-coloring",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-ghs12-eds",
      "problem": "Edge dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Maximum degree ≤ Δ",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "approximation": "No ratio < 4 − 1/⌊Δ/2⌋",
      "rounds": "O(1)-round impossibility",
      "roundClass": "parameter",
      "parameters": "Fixed Δ ≥ 2.",
      "assumptions": "Deterministic LOCAL algorithms, even with unique identifiers.",
      "paperId": "gen-ghs12",
      "theorem": "Abstract; application to edge domination",
      "summary": "Transfers anonymous-network hardness to the identifier model.",
      "verification": "primary",
      "sourceUrl": "https://jukkasuomela.fi/doc/linear-order.pdf",
      "year": 2012,
      "problemScope": {
        "node": "edge-dominating-set"
      },
      "graphScope": {
        "node": "degree"
      },
      "graphClassSource": "Graphs of maximum degree Δ",
      "approximationDisplay": "≥ 4 − 1/⌊Δ/2⌋",
      "roundsDisplay": "f(Δ) rounds ruled out",
      "roundParameters": [
        {
          "symbol": "Δ",
          "name": "max degree",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundBudgetExcluded": true,
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "impossibility",
        "formula": "Any T(Δ) independent of n",
        "tex": "\\text{Any }T\\bigl(\\Delta\\bigr)\\text{ independent of }n",
        "basis": "quantified-impossibility",
        "explanation": "This excludes every round complexity depending only on the listed fixed parameters, independently of n. It is a lower-bound budget, not the running time of an algorithm.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/linear-order.pdf",
            "title": "Lower Bounds for Local Approximation",
            "location": "Abstract; application to edge domination"
          }
        ],
        "parameters": [
          {
            "symbol": "T",
            "description": "An arbitrary number of communication rounds depending only on the listed fixed parameters",
            "tex": "T"
          }
        ],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "Bounded degree · deterministic local lower bound",
        "setting": "Deterministic LOCAL; unweighted edge dominating set on graphs of maximum degree Δ≥2; for any round complexity depending only on Δ, approximation factors below 4−1/floor(Δ/2) are impossible.",
        "reason": "Theorem 1.6 explicitly proves that the same factor is achievable by a deterministic local algorithm whose round complexity may depend on Δ. The lower bound remains valid with unique identifiers. This certifies the coefficient for algorithms with rounds independent of n, not optimal dependence on Δ.",
        "evidenceUrl": "https://jukkasuomela.fi/doc/linear-order.pdf#page=6",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "edge-domination-factor",
          "resultId": "gen-ghs12-eds",
          "graphs": [
            "degree"
          ],
          "problems": [
            "edge-dominating-set"
          ],
          "models": [
            "LOCAL"
          ],
          "conditionIds": []
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "T",
          "description": "An arbitrary number of communication rounds depending only on the listed fixed parameters",
          "tex": "T"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication network",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-deab2387db4ebc51b8c0",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-f3f7c0d2ab5ad9ffd286"
        ],
        "assumptions": [
          "auto-assumption-eeb9411327e683e6b996"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-eeb9411327e683e6b996",
          "auto-graph-deab2387db4ebc51b8c0",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c9185b7551a9732c9cf5",
          "auto-parameter-f3f7c0d2ab5ad9ffd286",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-w25-dom",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Triangle-free planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "6",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "",
      "assumptions": "",
      "paperId": "gen-w25",
      "theorem": "Abstract",
      "summary": "A local construction based on bunches.",
      "verification": "primary",
      "sourceUrl": "https://www.mdpi.com/1999-4893/18/5/280",
      "year": 2025,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "triangle-planar"
      },
      "graphClassSource": "Triangle-free planar graphs",
      "approximationDisplay": "6",
      "roundsDisplay": "≤ 7",
      "roundCountEvidence": {
        "basis": "phase-count",
        "explanation": "The paper gives two phases without a total round count. A conservative implementation floods identifiers and neighbor lists for six rounds, then uses one round to notify selected neighbors. The first six rounds reveal degrees through distance five, sufficient to reconstruct the first selection and uncovered vertices within distance two. Every replacement candidate covers the selecting vertex, so it lies in its closed neighborhood. This is an implementation upper bound, not a source-stated or optimal count.",
        "evidence": [
          {
            "url": "https://mdpi-res.com/d_attachment/algorithms/algorithms-18-00280/article_deploy/algorithms-18-00280.pdf#page=9",
            "title": "Wawrzyniak, local six-approximation on triangle-free planar graphs",
            "location": "Section 3, pseudocode, PDF pp. 9–10"
          }
        ],
        "rounds": "≤ 7",
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "≤ 7",
        "tex": "\\le 7",
        "basis": "phase-count",
        "explanation": "The paper gives two phases without a total round count. A conservative implementation floods identifiers and neighbor lists for six rounds, then uses one round to notify selected neighbors. The first six rounds reveal degrees through distance five, sufficient to reconstruct the first selection and uncovered vertices within distance two. Every replacement candidate covers the selecting vertex, so it lies in its closed neighborhood. This is an implementation upper bound, not a source-stated or optimal count.",
        "evidence": [
          {
            "url": "https://mdpi-res.com/d_attachment/algorithms/algorithms-18-00280/article_deploy/algorithms-18-00280.pdf#page=9",
            "title": "Wawrzyniak, local six-approximation on triangle-free planar graphs",
            "location": "Section 3, pseudocode, PDF pp. 9–10"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [],
      "setting": {
        "summary": [
          "auto-graph-17b28995226fcbf3e00f",
          "weights-unweighted"
        ],
        "parameters": [],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-17b28995226fcbf3e00f",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-bdgpsw26-dom",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Euler genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "34 + ε",
      "rounds": "f(g, ε)",
      "roundClass": "parameter",
      "parameters": "Fixed Euler genus g and ε.",
      "assumptions": "Uses the planar 11+ε source approximation.",
      "paperId": "gen-bdgpsw26",
      "theorem": "Abstract",
      "summary": "A transfer theorem gives factor 3α+1 from a planar α-approximation.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2605.19157",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "euler",
        "note": "Retain any connectivity condition stated by the source."
      },
      "graphClassSource": "Bounded Euler genus",
      "approximationDisplay": "34 + ε",
      "roundsDisplay": "f(g, ε)",
      "roundParameters": [
        {
          "symbol": "g",
          "name": "Euler genus",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "partial",
        "formula": "T + δ + 2, where T = F(2u+2ρ) + max{u+ρ, b}",
        "tex": "T+\\delta+2,\\qquad T=F(2u+2\\rho)+\\max\\{u+\\rho,b\\}",
        "basis": "stated-composition",
        "explanation": "Corollary 4.3 states a parameter-dependent constant C(ε,g). Meta-Theorem I gives a transparent composition of the base algorithm, a dimensional control function, and an error-component diameter bound, but this does not compute a closed function of g and ε. In particular the runtime of the planar (11+ε)-approximation and the control-function constants are not expanded here.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
            "title": "Meta-Theorems for Cuttable Distributed Problems",
            "location": "Theorem 4.2 (Meta-Theorem I); Corollary 4.3; proof of Meta-Theorem I"
          }
        ],
        "parameters": [
          {
            "symbol": "T",
            "description": "Intermediate algorithm radius from the displayed composition",
            "tex": "T"
          },
          {
            "symbol": "δ",
            "description": "Upper bound on weak diameters of the local error components",
            "tex": "\\delta"
          },
          {
            "symbol": "F",
            "description": "Dimensional control function of the target graph class",
            "tex": "F"
          },
          {
            "symbol": "u",
            "description": "Uniformity radius of the base algorithm",
            "tex": "u"
          },
          {
            "symbol": "b",
            "description": "Round complexity of the base algorithm",
            "tex": "b"
          },
          {
            "symbol": "ρ",
            "description": "Verification radius of the distributed problem",
            "tex": "\\rho"
          }
        ],
        "checked": "2026-11-16",
        "audited": true,
        "expression": {
          "formula": "T + δ + 2",
          "tex": "T+\\delta+2"
        },
        "suffix": {
          "formula": ", where T = F(2u+2ρ) + max{u+ρ, b}",
          "tex": ",\\qquad T=F(2u+2\\rho)+\\max\\{u+\\rho,b\\}"
        }
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "F",
          "description": "Dimensional control function of the target graph class",
          "tex": "F"
        },
        {
          "symbol": "T",
          "description": "Intermediate algorithm radius from the displayed composition",
          "tex": "T"
        },
        {
          "symbol": "b",
          "description": "Round complexity of the base algorithm",
          "tex": "b"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound",
          "tex": "g"
        },
        {
          "symbol": "u",
          "description": "Uniformity radius of the base algorithm",
          "tex": "u"
        },
        {
          "symbol": "δ",
          "description": "Upper bound on weak diameters of the local error components",
          "tex": "\\delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        },
        {
          "symbol": "ρ",
          "description": "Verification radius of the distributed problem",
          "tex": "\\rho"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-4688deea0bc7a8a63f32",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-42f1cba507ba2c8efe56"
        ],
        "assumptions": [
          "auto-assumption-47f8c499fa139c946a3b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-47f8c499fa139c946a3b",
          "auto-graph-4688deea0bc7a8a63f32",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-42f1cba507ba2c8efe56",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-af26-dom",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Bounded arboricity",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "O(α log Δ / log log Δ)",
      "rounds": "O(log Δ / log log Δ)",
      "roundClass": "degree",
      "parameters": "α is arboricity; logs truncated at constants.",
      "assumptions": "Δ known; α need not be known; one-bit messages suffice.",
      "paperId": "gen-af26",
      "theorem": "Abstract",
      "summary": "A degree-dependent approximation with very small messages.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2606.15411",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "density",
        "note": "Use compatible fixed arboricity bounds; planar inputs permit an arboricity bound of 3."
      },
      "prerequisite": "Known Δ",
      "approximationDisplay": "O(α log Δ / log log Δ)",
      "roundsDisplay": "O(log Δ / log log Δ)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log Δ / log log Δ)",
        "tex": "O\\!\\left(\\frac{\\log\\Delta}{\\log\\log\\Delta}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2606.15411",
            "title": "Distributed Dominating Set With Optimal Rounds and Message Size in Bounded Arboricity Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "arboricity-domination-rounds",
          "resultId": "gen-af26-dom",
          "graphs": [
            "density",
            "arboricity-two"
          ],
          "problems": [
            "dominating-set"
          ],
          "models": [
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": [
            "parameter-fixed-alpha-ge2"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "α",
          "description": "Arboricity bound of the input graph",
          "tex": "\\alpha"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a31601ba12c5c7bcb524",
          "weights-unweighted",
          "input-known-degree"
        ],
        "parameters": [
          "auto-parameter-6c812971e246ce525770"
        ],
        "assumptions": [],
        "detail": [
          "strength-no-alpha-knowledge",
          "strength-one-bit"
        ],
        "covered": [
          "auto-graph-a31601ba12c5c7bcb524",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-6c812971e246ce525770",
          "input-known-degree",
          "strength-no-alpha-knowledge",
          "strength-one-bit",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-w26-planar-dom",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "8 + ε",
      "rounds": "O_ε(1)",
      "roundClass": "parameter",
      "parameters": "Fixed ε > 0.",
      "assumptions": "Neither embedding nor n is required.",
      "paperId": "gen-w26-planar",
      "theorem": "Abstract",
      "summary": "An improved analysis of the three-phase domination framework.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2609.32736",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "graphClassSource": "Planar graphs",
      "approximationDisplay": "8 + ε",
      "roundsDisplay": "f(ε)",
      "roundParameters": [
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(ε)",
        "tex": "f\\bigl(\\varepsilon\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2609.32736",
            "title": "Near-Optimal Distributed Domination in Planar Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierComparisons": [
        {
          "better": "gen-asw26-planar",
          "worse": "gen-w26-planar-dom",
          "strict": [
            "approximation"
          ],
          "conditions": {
            "problem": "Both solve unweighted minimum dominating set and output an integral vertex set.",
            "graphClass": "Both guarantees hold on all planar graphs; no graph-class strengthening is inferred.",
            "approximation": "The exact coefficient 7 is strictly smaller than 8 + ε for every ε > 0.",
            "rounds": "The newer round complexity is a universal constant, independent of ε. The older bound is f(ε), with its accuracy dependence retained. At the advertised asymptotic level the universal O(1) bound has no accuracy-dependent overhead. This does not compare unknown numerical round counts or identify f(ε) with a universal constant.",
            "model": "The newer algorithm uses broadcast CONGEST and therefore also works in LOCAL; message restrictions are stronger, not an extra graph or input requirement.",
            "randomness": "Both algorithms are deterministic.",
            "benchmark": "The newer integral output is bounded against fractional OPT, which is at most integral OPT; it therefore also satisfies the older integral-OPT convention.",
            "assumptions": "Use the standard unique O(log n)-bit identifier convention. Neither statement requires an embedding, a maximum-degree bound, or an externally supplied solution. This certificate does not apply to variants with a different initial-information convention."
          },
          "evidenceUrl": "https://arxiv.org/pdf/2611.02057",
          "reason": "Exact factor 7 replaces the 8 + ε planar guarantee using a universal constant round complexity, while the earlier round complexity depends on ε. The source introduction traces the constant-factor improvements; Theorem C(i) gives the new guarantee."
        }
      ],
      "dominatedBy": [
        "gen-asw26-planar"
      ],
      "frontierStatus": "dominated",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-a0a8e2790290a7471d70"
        ],
        "assumptions": [
          "auto-assumption-94e308d1e07eba7fa96c"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-94e308d1e07eba7fa96c",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-a0a8e2790290a7471d70",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-as26-planar",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "7 + ε",
      "rounds": "O_ε(1)",
      "roundClass": "parameter",
      "parameters": "Fixed ε > 0.",
      "assumptions": "Guarantee also holds against fractional OPT.",
      "paperId": "gen-as26",
      "theorem": "Abstract",
      "summary": "Planar specialization.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2610.09618",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "graphClassSource": "Planar graphs",
      "approximationDisplay": "7 + ε",
      "roundsDisplay": "f(ε)",
      "roundParameters": [
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(ε)",
        "tex": "f\\bigl(\\varepsilon\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2610.09618",
            "title": "Almost Optimal Constant-Round Approximation of Dominating Set in Graph Classes with Excluded Minors",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierComparisons": [
        {
          "better": "gen-asw26-planar",
          "worse": "gen-as26-planar",
          "strict": [
            "approximation"
          ],
          "conditions": {
            "problem": "Both solve unweighted minimum dominating set and output an integral vertex set.",
            "graphClass": "Both guarantees hold on all planar graphs; no graph-class strengthening is inferred.",
            "approximation": "The exact coefficient 7 is strictly smaller than 7 + ε for every ε > 0.",
            "rounds": "The newer round complexity is a universal constant, independent of ε. The older bound is f(ε), with its accuracy dependence retained. At the advertised asymptotic level the universal O(1) bound has no accuracy-dependent overhead. This does not compare unknown numerical round counts or identify f(ε) with a universal constant.",
            "model": "The newer algorithm uses broadcast CONGEST and therefore also works in LOCAL; message restrictions are stronger, not an extra graph or input requirement.",
            "randomness": "Both algorithms are deterministic.",
            "benchmark": "Both guarantees apply against fractional OPT.",
            "assumptions": "Use the standard unique O(log n)-bit identifier convention. Neither statement requires an embedding, a maximum-degree bound, or an externally supplied solution. This certificate does not apply to variants with a different initial-information convention."
          },
          "evidenceUrl": "https://arxiv.org/pdf/2611.02057",
          "reason": "Exact factor 7 replaces the 7 + ε planar guarantee using a universal constant round complexity, while the earlier round complexity depends on ε. The source introduction traces the constant-factor improvements; Theorem C(i) gives the new guarantee."
        }
      ],
      "dominatedBy": [
        "gen-asw26-planar"
      ],
      "frontierStatus": "dominated",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-a0a8e2790290a7471d70"
        ],
        "assumptions": [
          "auto-assumption-6dc0e590599c2c5a678a"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-6dc0e590599c2c5a678a",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-a0a8e2790290a7471d70",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-as26-minor",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Proper minor-closed classes",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "2a(𝒞) + 1 + ε",
      "rounds": "O_𝒞,ε(1)",
      "roundClass": "parameter",
      "parameters": "Fixed class 𝒞 and ε; a(𝒞) = sup |E|/|V|.",
      "assumptions": "Measured against fractional OPT.",
      "paperId": "gen-as26",
      "theorem": "Abstract",
      "summary": "A class-density bound.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2610.09618",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "2a(𝒞) + 1 + ε",
      "roundsDisplay": "f(𝒞, ε)",
      "roundParameters": [
        {
          "symbol": "𝒞",
          "name": "graph class",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(𝒞, ε)",
        "tex": "f\\bigl(\\mathcal{C},\\varepsilon\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2610.09618",
            "title": "Almost Optimal Constant-Round Approximation of Dominating Set in Graph Classes with Excluded Minors",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "a(𝒞)",
          "description": "Supremum of the edge-to-vertex ratio over graphs in the fixed minor-closed class 𝒞",
          "tex": "a(\\mathcal{C})"
        },
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "a",
          "description": "Edge-density bound of the fixed minor-closed graph class",
          "tex": "a"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        },
        {
          "symbol": "𝒞",
          "description": "Fixed input graph class",
          "tex": "\\mathcal{C}"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-3ffeda864faf117fac90",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-7f6191bd7030ad15d9fa"
        ],
        "assumptions": [
          "auto-assumption-933e122436b6c52ef189"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-933e122436b6c52ef189",
          "auto-graph-3ffeda864faf117fac90",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-7f6191bd7030ad15d9fa",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-as26-random",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Proper minor-closed classes",
      "model": "LOCAL",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "1 + ε in expectation",
      "rounds": "O_𝒞,ε(1)",
      "roundClass": "parameter",
      "parameters": "Fixed class 𝒞 and ε.",
      "assumptions": "Always feasible; expected size ≤ (1+ε)OPT.",
      "paperId": "gen-as26",
      "theorem": "Abstract",
      "summary": "An expectation guarantee, not a high-probability ratio.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2610.09618",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "1 + ε in expectation",
      "roundsDisplay": "f(𝒞, ε)",
      "roundParameters": [
        {
          "symbol": "𝒞",
          "name": "graph class",
          "introduced": false,
          "displaySymbol": true
        },
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(𝒞, ε)",
        "tex": "f\\bigl(\\mathcal{C},\\varepsilon\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2610.09618",
            "title": "Almost Optimal Constant-Round Approximation of Dominating Set in Graph Classes with Excluded Minors",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        },
        {
          "symbol": "𝒞",
          "description": "Fixed input graph class",
          "tex": "\\mathcal{C}"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-3ffeda864faf117fac90",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-9fc82b38708ec49e4023"
        ],
        "assumptions": [
          "auto-assumption-d6b18710736c4110b2b5"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-d6b18710736c4110b2b5",
          "auto-graph-3ffeda864faf117fac90",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-9fc82b38708ec49e4023",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-as26-power-lower",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "r-th powers of paths",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "approximation": "No ratio < 2r + 1",
      "rounds": "O(1)-round impossibility",
      "roundClass": "parameter",
      "parameters": "Fixed integer r ≥ 1; ε > 0 is a gap below 2r + 1. The excluded round complexity may depend on r and ε, but not on n.",
      "assumptions": "Deterministic; n may be known.",
      "paperId": "gen-as26",
      "theorem": "Theorem 8.7 (arXiv v2)",
      "summary": "Pure path powers suffice. Related lower bounds in Picavet’s thesis use endpoint leaves or excluded-minor pathwidth.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2610.09618v2#S8.SS4",
      "year": 2026,
      "relatedResults": [
        "pic-thesis-pathpower-lower",
        "pic-thesis-pathwidth-lower"
      ],
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "path-powers"
      },
      "approximationDisplay": "≥ 2r + 1",
      "roundsDisplay": "f(r, ε) rounds ruled out",
      "roundParameters": [
        {
          "symbol": "r",
          "name": "power radius",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": false,
          "displaySymbol": true
        }
      ],
      "roundBudgetExcluded": true,
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "impossibility",
        "formula": "Any T(r, ε) independent of n",
        "tex": "\\text{Any }T\\bigl(r,\\varepsilon\\bigr)\\text{ independent of }n",
        "basis": "quantified-impossibility",
        "explanation": "This excludes every round complexity depending only on the listed fixed parameters, independently of n. It is a lower-bound budget, not the running time of an algorithm.",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2610.09618v2#S8.SS4",
            "title": "Almost Optimal Constant-Round Approximation of Dominating Set in Graph Classes with Excluded Minors",
            "location": "Theorem 8.7 (arXiv v2)"
          }
        ],
        "parameters": [
          {
            "symbol": "T",
            "description": "An arbitrary number of communication rounds depending only on the listed fixed parameters",
            "tex": "T"
          }
        ],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "minor-density-factor",
          "resultId": "gen-as26-power-lower",
          "graphs": [
            "path-powers",
            "treewidth",
            "pathwidth"
          ],
          "problems": [
            "dominating-set"
          ],
          "models": [
            "LOCAL",
            "CONGEST"
          ],
          "conditionIds": [
            "parameter-r-integer-ge1"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "T",
          "description": "An arbitrary number of communication rounds depending only on the listed fixed parameters",
          "tex": "T"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Power of the underlying path: vertices at distance at most this value are adjacent",
          "tex": "r"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-5576afcd0ec58ee432cc",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-ea0947e1a900f9702605"
        ],
        "assumptions": [
          "auto-assumption-edb8aa2a8c4052a49812"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-edb8aa2a8c4052a49812",
          "auto-graph-5576afcd0ec58ee432cc",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-ea0947e1a900f9702605",
          "parameter-r-integer-ge1",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-w26-2dom",
      "problem": "2-domination (outside the solution)",
      "variant": "2-tuple domination",
      "objective": "min",
      "graphClass": "Euler genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "6 + η",
      "rounds": "O_g,η(1)",
      "roundClass": "parameter",
      "parameters": "Fixed Euler genus g and ε > 0.",
      "assumptions": "",
      "paperId": "gen-w26-transfer",
      "theorem": "Abstract",
      "summary": "Transfers the planar two-domination algorithm.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2610.15596",
      "year": 2026,
      "problemScope": {
        "node": "outside-k-domination"
      },
      "problemParameter": "2",
      "problemParameterName": "required neighbors outside the solution",
      "problemSource": "k-tuple dominating set",
      "graphScope": {
        "node": "euler",
        "note": "Retain any connectivity condition stated by the source."
      },
      "graphClassSource": "Bounded Euler genus",
      "notationChanges": [
        {
          "name": "approximation slack",
          "sourceSymbol": "η",
          "symbol": "ε"
        }
      ],
      "parametersSource": "Fixed Euler genus g and η > 0.",
      "approximationDisplay": "6 + ε",
      "roundsDisplay": "f(g, ε)",
      "roundParameters": [
        {
          "symbol": "g",
          "name": "Euler genus",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "ε",
          "name": "approximation slack",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(g, ε)",
        "tex": "f\\bigl(g,\\varepsilon\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2610.15596",
            "title": "Almost Lossless Transfer for Cuttable Distributed Problems",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "Euler genus ≤ g; fixed ε > 0",
        "setting": "Unweighted outside-2 domination on graphs of Euler genus at most g; deterministic LOCAL in f(g, ε) rounds with arbitrary distinct numerical identifiers; integral OPT; ε > 0.",
        "reason": "The almost-lossless transfer gives 6+ε on every fixed Euler-genus class, improving the previous coefficient 19. Its round complexity depends on g and ε. The exact planar coefficient 6 applies to a smaller class and does not dominate it. This is a checked best-known tradeoff; optimal parameter dependence, a matching lower bound and an exact factor-6 algorithm are not claimed.",
        "evidenceUrl": "https://arxiv.org/html/2610.15596v1#S8",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "2",
          "description": "Required neighbors outside the solution",
          "tex": "2"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound",
          "tex": "g"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-4688deea0bc7a8a63f32",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-0e4fbe5bde0b980e2436"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-4688deea0bc7a8a63f32",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-ef1b974b591df8f63ec3",
          "auto-parameter-0e4fbe5bde0b980e2436",
          "output-outside-k",
          "output-outside-two",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-w26-clique-dom",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar with a clique attached at one vertex",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "7 + ε",
      "rounds": "O_ε(1)",
      "roundClass": "parameter",
      "parameters": "Fixed ε > 0; clique size unbounded.",
      "assumptions": "Distinct IDs; n need not be known.",
      "paperId": "gen-w26-transfer",
      "theorem": "Abstract",
      "summary": "The target class can have unbounded genus.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2610.15596",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "planar-clique"
      },
      "graphClassSource": "Planar graph with a clique attached at one vertex",
      "approximationDisplay": "7 + ε",
      "roundsDisplay": "f(ε)",
      "roundParameters": [
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(ε)",
        "tex": "f\\bigl(\\varepsilon\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2610.15596",
            "title": "Almost Lossless Transfer for Cuttable Distributed Problems",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-88416e0fa2d902c6bf6e",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-fd0c7f39daee55d44146"
        ],
        "assumptions": [
          "auto-assumption-898f68dddc2253ec17f8"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-898f68dddc2253ec17f8",
          "auto-graph-88416e0fa2d902c6bf6e",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-fd0c7f39daee55d44146",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-p26-density",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Bounded maximum average degree and depth-one density",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "d + 1 + ε",
      "rounds": "O_d,∇₁,ε(1)",
      "roundClass": "parameter",
      "parameters": "Fixed mad bound d, shallow-minor density ∇₁, ε.",
      "assumptions": "",
      "paperId": "gen-p26",
      "theorem": "Abstract",
      "summary": "Extends beyond minor-closed classes.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2610.31203",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "depth-one"
      },
      "approximationDisplay": "d + 1 + ε",
      "roundsDisplay": "f(d, ∇₁, ε)",
      "roundParameters": [
        {
          "symbol": "d",
          "name": "max average degree",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "∇₁",
          "name": "depth-one density",
          "introduced": false,
          "displaySymbol": true
        },
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(d, ∇₁, ε)",
        "tex": "f\\bigl(d,\\nabla_1,\\varepsilon\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2610.31203",
            "title": "Almost tight distributed approximation for domination in sparse graph classes",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "Even integer d ≥ 2",
        "setting": "Unweighted MDS; deterministic LOCAL in f(d, depth-one density, ε) rounds; maximum-average-degree bound d and a fixed depth-one density bound; integral OPT; ε > 0. Optimal-coefficient certification is restricted to even integer d ≥ 2.",
        "reason": "Corollary 1.1 gives d+1+ε on the broader bounded-depth-one-density setting, with polynomial dependence on accuracy and polynomial local computation for fixed parameters. Section 3.9 supplies a matching d+1 limiting lower bound for even integer d. This certifies the limiting coefficient, not optimal dependence on every parameter, an exact d+1 algorithm or a fractional benchmark.",
        "evidenceUrl": "https://arxiv.org/pdf/2610.31203#page=21",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-d-even-ge2"
        ]
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Upper bound on depth-one minor density",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "d",
          "description": "Maximum average degree bound of the input graph",
          "tex": "d"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-c176f5851daf0691e2c9",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-e60de88c7059235a0d25"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-c176f5851daf0691e2c9",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-e60de88c7059235a0d25",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-p26-genus",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Euler genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "7 + ε",
      "rounds": "O_g,ε(1)",
      "roundClass": "parameter",
      "parameters": "Fixed Euler genus g and ε > 0.",
      "assumptions": "",
      "paperId": "gen-p26",
      "theorem": "Abstract",
      "summary": "Includes planar graphs.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2610.31203",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "euler",
        "note": "Retain any connectivity condition stated by the source."
      },
      "graphClassSource": "Bounded Euler genus",
      "approximationDisplay": "7 + ε",
      "roundsDisplay": "f(g, ε)",
      "roundParameters": [
        {
          "symbol": "g",
          "name": "Euler genus",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(g, ε)",
        "tex": "f\\bigl(g,\\varepsilon\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2610.31203",
            "title": "Almost tight distributed approximation for domination in sparse graph classes",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound",
          "tex": "g"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-4688deea0bc7a8a63f32",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-0e4fbe5bde0b980e2436"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-4688deea0bc7a8a63f32",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-0e4fbe5bde0b980e2436",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-p26-trianglefree",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Triangle-free; Euler genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "5 + ε",
      "rounds": "O_g,ε(1)",
      "roundClass": "parameter",
      "parameters": "Fixed Euler genus g and ε > 0.",
      "assumptions": "",
      "paperId": "gen-p26",
      "theorem": "Abstract",
      "summary": "Includes triangle-free planar graphs.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2610.31203",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "triangle-genus"
      },
      "graphClassSource": "Triangle-free bounded Euler genus",
      "approximationDisplay": "5 + ε",
      "roundsDisplay": "f(g, ε)",
      "roundParameters": [
        {
          "symbol": "g",
          "name": "Euler genus",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(g, ε)",
        "tex": "f\\bigl(g,\\varepsilon\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2610.31203",
            "title": "Almost tight distributed approximation for domination in sparse graph classes",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound",
          "tex": "g"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-4cb0180200cc86776426",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-0e4fbe5bde0b980e2436"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-4cb0180200cc86776426",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-0e4fbe5bde0b980e2436",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-asw26-planar",
      "problem": "Dominating set",
      "variant": "Unweighted; fractional benchmark",
      "objective": "min",
      "graphClass": "Planar",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "7 against fractional OPT",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "",
      "assumptions": "Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs.",
      "paperId": "gen-asw26",
      "theorem": "Theorem C(i); Corollary 1.1",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "7",
      "roundsDisplay": "Constant",
      "approximationBenchmark": "fractional",
      "roundCountEvidence": {
        "basis": "not-specified",
        "explanation": "Theorem C and Corollary 1.1 give universal constant-round algorithms for these fixed graph classes. Section 6.5, Theorem 6.13, bounds the fractional algorithm by fixed parameters, but gives no end-to-end numerical total. The partition in Lemma 6.9 also uses parameter-dependent constants without numerical instantiation. The three broadcasts after the fractional stage in Section 5.4 are only the final stage, not the total round count.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=24",
            "title": "Amiri–Siebertz–Wawrzyniak, implementation",
            "location": "Section 5.4, final implementation paragraph"
          },
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=35",
            "title": "Partition and fractional algorithm",
            "location": "Lemma 6.9 and Theorem 6.13, PDF pp. 35 and 40"
          }
        ],
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "Constant",
        "tex": "\\text{Constant}",
        "basis": "not-specified",
        "explanation": "Theorem C and Corollary 1.1 give universal constant-round algorithms for these fixed graph classes. Section 6.5, Theorem 6.13, bounds the fractional algorithm by fixed parameters, but gives no end-to-end numerical total. The partition in Lemma 6.9 also uses parameter-dependent constants without numerical instantiation. The three broadcasts after the fractional stage in Section 5.4 are only the final stage, not the total round count.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=24",
            "title": "Amiri–Siebertz–Wawrzyniak, implementation",
            "location": "Section 5.4, final implementation paragraph"
          },
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=35",
            "title": "Partition and fractional algorithm",
            "location": "Lemma 6.9 and Theorem 6.13, PDF pp. 35 and 40"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Deterministic constant-round broadcast CONGEST; unweighted planar dominating set; integral output measured against fractional OPT.",
        "reason": "Theorem C and Corollary 1.1 give exact factor 7, matching a LOCAL lower bound even against integral OPT. Thus the coefficient is optimal in this setting.",
        "evidenceUrl": "https://arxiv.org/pdf/2611.02057",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierComparisons": [
        {
          "better": "gen-asw26-minordensity",
          "worse": "gen-asw26-planar",
          "strict": [
            "graphClass"
          ],
          "parameterSubstitution": "a=3",
          "comparisonGraphClass": {
            "node": "minor",
            "label": "Every minor H has |E(H)| ≤ 3|V(H)|"
          },
          "conditions": {
            "problem": "Both return an integral unweighted dominating set.",
            "graphClass": "Every planar graph satisfies minor density at most 3. This class strictly contains the planar graphs: K5 also satisfies the bound for all its minors.",
            "approximation": "At a=3, the general coefficient 2a+1 equals the planar coefficient 7.",
            "rounds": "Sections 5.4 and 7.2 use the same protocol at a=3: degree-six defects, the same initial set F and candidate costs, algorithm parameters ρ=3, maximum candidate cost 7 and accuracy ε=1/294, followed by the same W, R and H broadcasts. The general instance adds no rounds or parameter overhead to the planar construction.",
            "model": "Both use broadcast CONGEST with O(log n)-bit messages.",
            "randomness": "Both algorithms are deterministic.",
            "benchmark": "Both integral outputs are bounded against the same fractional dominating-set optimum.",
            "assumptions": "Both use distinct O(log n)-bit identifiers and need no embedding, orientation, initial cover, degree bound or knowledge of n. The fixed substitution a=3 is hard-coded and valid for every planar input."
          },
          "evidenceUrl": "https://arxiv.org/pdf/2611.02057#page=50",
          "reason": "The planar factor-seven algorithm is the a=3 instance of the integer-density construction, with identical algorithm accuracy and broadcasts. The same guarantee and round complexity therefore hold on a strictly larger graph class."
        }
      ],
      "dominatedBy": [
        "gen-asw26-minordensity"
      ],
      "frontierStatus": "dominated",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "tightness": [
        {
          "certificateId": "planar-factor-seven",
          "resultId": "gen-asw26-planar",
          "graphs": [
            "planar"
          ],
          "problems": [
            "dominating-set"
          ],
          "models": [
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": []
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted",
          "model-broadcast-congest"
        ],
        "parameters": [],
        "assumptions": [
          "input-logarithmic-ids"
        ],
        "detail": [],
        "covered": [
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-b321139eea50286d2951",
          "detail-fractional-benchmark",
          "input-distinct-ids",
          "input-logarithmic-ids",
          "model-broadcast-congest",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-asw26-trianglefree",
      "problem": "Dominating set",
      "variant": "Unweighted; fractional benchmark",
      "objective": "min",
      "graphClass": "Triangle-free planar",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "5 against fractional OPT",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "",
      "assumptions": "Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs.",
      "paperId": "gen-asw26",
      "theorem": "Theorem C(iii); Corollary 1.1",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "triangle-planar"
      },
      "approximationDisplay": "5",
      "roundsDisplay": "Constant",
      "approximationBenchmark": "fractional",
      "roundCountEvidence": {
        "basis": "not-specified",
        "explanation": "Theorem C and Corollary 1.1 give universal constant-round algorithms for these fixed graph classes. Section 6.5, Theorem 6.13, bounds the fractional algorithm by fixed parameters, but gives no end-to-end numerical total. The partition in Lemma 6.9 also uses parameter-dependent constants without numerical instantiation. The three broadcasts after the fractional stage in Section 5.4 are only the final stage, not the total round count.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=24",
            "title": "Amiri–Siebertz–Wawrzyniak, implementation",
            "location": "Section 5.4, final implementation paragraph"
          },
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=35",
            "title": "Partition and fractional algorithm",
            "location": "Lemma 6.9 and Theorem 6.13, PDF pp. 35 and 40"
          }
        ],
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "Constant",
        "tex": "\\text{Constant}",
        "basis": "not-specified",
        "explanation": "Theorem C and Corollary 1.1 give universal constant-round algorithms for these fixed graph classes. Section 6.5, Theorem 6.13, bounds the fractional algorithm by fixed parameters, but gives no end-to-end numerical total. The partition in Lemma 6.9 also uses parameter-dependent constants without numerical instantiation. The three broadcasts after the fractional stage in Section 5.4 are only the final stage, not the total round count.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=24",
            "title": "Amiri–Siebertz–Wawrzyniak, implementation",
            "location": "Section 5.4, final implementation paragraph"
          },
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=35",
            "title": "Partition and fractional algorithm",
            "location": "Lemma 6.9 and Theorem 6.13, PDF pp. 35 and 40"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Deterministic constant-round broadcast CONGEST; unweighted triangle-free planar dominating set; integral output measured against fractional OPT.",
        "reason": "Theorem C and Corollary 1.1 give exact factor 5 with a matching deterministic LOCAL lower bound. This is an optimal coefficient.",
        "evidenceUrl": "https://arxiv.org/pdf/2611.02057",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "tightness": [
        {
          "certificateId": "trianglefree-planar-factor-five",
          "resultId": "gen-asw26-trianglefree",
          "graphs": [
            "triangle-planar"
          ],
          "problems": [
            "dominating-set"
          ],
          "models": [
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": []
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-17b28995226fcbf3e00f",
          "weights-unweighted",
          "model-broadcast-congest"
        ],
        "parameters": [],
        "assumptions": [
          "input-logarithmic-ids"
        ],
        "detail": [],
        "covered": [
          "auto-graph-17b28995226fcbf3e00f",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-b321139eea50286d2951",
          "detail-fractional-benchmark",
          "input-distinct-ids",
          "input-logarithmic-ids",
          "model-broadcast-congest",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-asw26-minordensity",
      "problem": "Dominating set",
      "variant": "Unweighted; fractional benchmark",
      "objective": "min",
      "graphClass": "Every minor H satisfies |E(H)| ≤ a|V(H)|",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "2a + 1 against fractional OPT",
      "rounds": "Oₐ(1)",
      "roundClass": "parameter",
      "parameters": "Fixed rational a ≥ 1.",
      "assumptions": "Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs.",
      "paperId": "gen-asw26",
      "theorem": "Theorem C(i)",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "2a + 1",
      "roundsDisplay": "f(a)",
      "approximationBenchmark": "fractional",
      "roundParameters": [
        {
          "symbol": "a",
          "name": "minor density",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(a)",
        "tex": "f\\bigl(a\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057",
            "title": "Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts",
            "location": "Theorem C(i)"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "Integer a ≥ 2",
        "setting": "Unweighted MDS; deterministic broadcast CONGEST in f(a) rounds; every minor has edge-to-vertex density at most integer a ≥ 2; integral output measured against fractional OPT.",
        "reason": "Theorem C gives the exact coefficient 2a+1 with round complexity depending on a. Treewidth-a path-power witnesses show that this coefficient cannot be improved, even against integral OPT in LOCAL. Certification here is limited to integer a; the paper gives improved coefficients on some noninteger parameter ranges. Optimal dependence on a is not claimed. The a=1 pseudoforest case has the sharper explicit one-round folklore implementation recorded separately.",
        "evidenceUrl": "https://arxiv.org/pdf/2611.02057#page=66",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-a-integer-ge2"
        ]
      },
      "sotaScopeTransfers": [
        {
          "resultId": "gen-asw26-minordensity",
          "graph": "planar",
          "scopeLabel": "Planar · a=3",
          "setting": "Planar unweighted MDS; a=3 gives exact factor 7 against fractional OPT, with the same constant-round broadcast CONGEST protocol as the planar corollary.",
          "reason": "The planar specialization is certified by the identical algorithm and parameters in Sections 5.4 and 7.2. The broader all-minor-density-three class contains the planar graphs.",
          "evidenceUrl": "https://arxiv.org/pdf/2611.02057#page=50",
          "approximation": {
            "substitutions": {
              "a": "3"
            },
            "factor": "7",
            "constantApproximation": true
          },
          "conditionIds": [],
          "claimConditionIds": [],
          "settingConditionIds": [
            "binding-a-three"
          ]
        }
      ],
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "minor-density-factor",
          "resultId": "gen-asw26-minordensity",
          "graphs": [
            "minor"
          ],
          "problems": [
            "dominating-set"
          ],
          "models": [
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": [
            "parameter-a-integer-ge1"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "G",
          "description": "Input graph",
          "tex": "G"
        },
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "a",
          "description": "Fixed rational upper bound on |E(H)|/|V(H)| for every minor H",
          "tex": "a"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a0de36fa1bbd12a5b487",
          "weights-unweighted",
          "model-broadcast-congest"
        ],
        "parameters": [
          "parameter-fixed-a"
        ],
        "assumptions": [
          "input-logarithmic-ids"
        ],
        "detail": [],
        "covered": [
          "auto-graph-a0de36fa1bbd12a5b487",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-b321139eea50286d2951",
          "detail-fractional-benchmark",
          "input-distinct-ids",
          "input-logarithmic-ids",
          "model-broadcast-congest",
          "parameter-a-rational-ge1",
          "parameter-fixed-a",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-asw26-genus",
      "problem": "Dominating set",
      "variant": "Unweighted; integral benchmark",
      "objective": "min",
      "graphClass": "Euler genus ≤ g",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "7",
      "rounds": "Oₑ(1)",
      "roundClass": "parameter",
      "parameters": "Fixed g.",
      "assumptions": "Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs. No embedding required. Benchmark is integral OPT.",
      "paperId": "gen-asw26",
      "theorem": "Theorem E",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "euler",
        "note": "Retain any connectivity condition stated by the source."
      },
      "graphClassSource": "Euler genus ≤ e",
      "notationChanges": [
        {
          "name": "Euler genus",
          "sourceSymbol": "e",
          "symbol": "g"
        }
      ],
      "parametersSource": "Fixed e.",
      "approximationDisplay": "7",
      "roundsDisplay": "f(g)",
      "roundParameters": [
        {
          "symbol": "g",
          "name": "Euler genus",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(g)",
        "tex": "f\\bigl(g\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057",
            "title": "Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts",
            "location": "Theorem E"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Deterministic broadcast CONGEST in f(g) rounds; unweighted dominating set on graphs of Euler genus at most g; integral OPT; no embedding supplied.",
        "reason": "Theorem E gives exact factor 7 with genus-dependent round complexity. Planar lower bounds prove coefficient optimality. The benchmark remains integral OPT on arbitrary fixed surfaces. Optimal dependence on g is not claimed.",
        "evidenceUrl": "https://arxiv.org/pdf/2611.02057",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "tightness": [
        {
          "certificateId": "planar-factor-seven",
          "resultId": "gen-asw26-genus",
          "graphs": [
            "euler",
            "orientable",
            "planar"
          ],
          "problems": [
            "dominating-set"
          ],
          "models": [
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": []
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound",
          "tex": "g"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-4688deea0bc7a8a63f32",
          "weights-unweighted",
          "model-broadcast-congest"
        ],
        "parameters": [
          "parameter-fixed-genus"
        ],
        "assumptions": [
          "input-logarithmic-ids"
        ],
        "detail": [
          "strength-no-embedding"
        ],
        "covered": [
          "auto-graph-4688deea0bc7a8a63f32",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-b321139eea50286d2951",
          "detail-integral-benchmark",
          "input-distinct-ids",
          "input-logarithmic-ids",
          "model-broadcast-congest",
          "parameter-fixed-genus",
          "strength-no-embedding",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-asw26-total",
      "problem": "Total dominating set",
      "variant": "Unweighted; fractional benchmark",
      "objective": "min",
      "graphClass": "Isolate-free; every minor H has |E(H)| ≤ a|V(H)|",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "2a against fractional OPT",
      "rounds": "Oₐ(1)",
      "roundClass": "parameter",
      "parameters": "Fixed rational a ≥ 1; planar graphs give 6.",
      "assumptions": "Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs.",
      "paperId": "gen-asw26",
      "theorem": "Theorem F.1(i)",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "total-dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "Requires an isolate-free instance, as appropriate for total domination."
      },
      "approximationDisplay": "2a",
      "roundsDisplay": "f(a)",
      "approximationBenchmark": "fractional",
      "roundParameters": [
        {
          "symbol": "a",
          "name": "minor density",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(a)",
        "tex": "f\\bigl(a\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057",
            "title": "Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts",
            "location": "Theorem F.1(i)"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "Integer a ≥ 1; fractional benchmark",
        "setting": "Unweighted total domination; isolate-free graphs whose every minor has density at most integer a ≥ 1; deterministic broadcast CONGEST in f(a) rounds; integral output against fractional total-domination OPT.",
        "reason": "Theorem F.1 gives exact coefficient 2a with round complexity depending on a. Proposition F.13 proves the matching coefficient lower bound in LOCAL on treewidth-a graphs against the fractional benchmark. For a=1 it also holds against integral OPT. Optimal dependence on a, noninteger a and stronger integral-benchmark optimality are not certified by this annotation.",
        "evidenceUrl": "https://arxiv.org/pdf/2611.02057#page=88",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-a-integer-ge1"
        ]
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "total-domination-factor",
          "resultId": "gen-asw26-total",
          "graphs": [
            "minor"
          ],
          "problems": [
            "total-dominating-set"
          ],
          "models": [
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": [
            "parameter-a-integer-ge1"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "G",
          "description": "Input graph",
          "tex": "G"
        },
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "a",
          "description": "Fixed rational upper bound on |E(H)|/|V(H)| for every minor H",
          "tex": "a"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-3cb5a957ccd8c0f583ad",
          "weights-unweighted",
          "model-broadcast-congest"
        ],
        "parameters": [
          "parameter-fixed-a"
        ],
        "assumptions": [
          "input-logarithmic-ids"
        ],
        "detail": [],
        "covered": [
          "auto-graph-3cb5a957ccd8c0f583ad",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-f7056f83774cd9f78096",
          "detail-fractional-benchmark",
          "input-distinct-ids",
          "input-isolate-free",
          "input-logarithmic-ids",
          "model-broadcast-congest",
          "parameter-a-rational-ge1",
          "parameter-fixed-a",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-asw26-setcover",
      "problem": "Set cover",
      "variant": "Bounded costs; also red-blue domination / hitting set",
      "objective": "min",
      "graphClass": "Planar incidence graphs",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "4 + ε against fractional OPT",
      "rounds": "Oᵦ,ε(1)",
      "roundClass": "parameter",
      "parameters": "Fixed ε > 0 and integer b ≥ 1. Each set has a positive integer cost at most b.",
      "assumptions": "Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs. Feasible instance; costs in {1,…,b}; unbounded set size and frequency.",
      "paperId": "gen-asw26",
      "theorem": "Corollary H.1(ii)",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "set-cover"
      },
      "graphScope": {
        "node": "planar-incidence",
        "note": "Planarity is required of the incidence graph."
      },
      "graphClassSource": "Planar incidence graph",
      "approximationDisplay": "4 + ε",
      "roundsDisplay": "f(b, ε)",
      "approximationBenchmark": "fractional",
      "roundParameters": [
        {
          "symbol": "b",
          "name": "maximum input cost",
          "introduced": false,
          "displaySymbol": true
        },
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(b, ε)",
        "tex": "f\\bigl(b,\\varepsilon\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057",
            "title": "Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts",
            "location": "Corollary H.1(ii)"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Deterministic broadcast CONGEST in f(b, ε) rounds; feasible set cover on planar incidence graphs; each set has a positive integer cost at most b; ε > 0; integral output against fractional OPT.",
        "reason": "Corollary H.1 achieves 4+ε; Theorem H.2 excludes every coefficient below 4 even in LOCAL. This certifies the optimal limiting coefficient, not an exact factor-4 algorithm or optimal dependence on b and ε.",
        "evidenceUrl": "https://arxiv.org/pdf/2611.02057",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "costs-integer-b",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "b",
          "description": "Upper bound on the positive integer cost of each set",
          "tex": "b"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-b08d89aa3044ab497598",
          "costs-integer-b",
          "model-broadcast-congest",
          "input-feasible-set-cover"
        ],
        "parameters": [
          "parameter-fixed-b-epsilon"
        ],
        "assumptions": [
          "input-logarithmic-ids"
        ],
        "detail": [
          "detail-red-blue-hitting-set",
          "strength-unbounded-set-incidence"
        ],
        "covered": [
          "auto-graph-b08d89aa3044ab497598",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-5e3e21d1210a645eea70",
          "costs-integer-b",
          "detail-fractional-benchmark",
          "detail-red-blue-hitting-set",
          "input-distinct-ids",
          "input-feasible-set-cover",
          "input-logarithmic-ids",
          "model-broadcast-congest",
          "parameter-epsilon-positive",
          "parameter-fixed-b-epsilon",
          "parameter-fixed-epsilon",
          "strength-unbounded-set-incidence",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-asw26-fractional",
      "problem": "Fractional local covering",
      "variant": "Local covering constraints; bounded costs",
      "objective": "min",
      "graphClass": "Every minor H satisfies |E(H)| ≤ ρ|V(H)|",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + δ against fractional OPT",
      "rounds": "Oρ,ᵦ,δ(1)",
      "roundClass": "parameter",
      "parameters": "Fixed rational ρ ≥ 1, integer b ≥ 1 and ε > 0. Each candidate vertex has a positive integer cost at most b.",
      "assumptions": "Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs. Feasible locally known candidates C(r) ⊆ N[r]; costs in {1,…,b}.",
      "paperId": "gen-asw26",
      "theorem": "Theorem A",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "fractional-local-covering"
      },
      "problemSource": "Covering LP",
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "notationChanges": [
        {
          "name": "accuracy",
          "sourceSymbol": "δ",
          "symbol": "ε"
        }
      ],
      "parametersSource": "Fixed rational ρ ≥ 1, integer b ≥ 1 and δ > 0. Each candidate vertex has a positive integer cost at most b.",
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "f(ρ, b, ε)",
      "approximationBenchmark": "fractional",
      "roundParameters": [
        {
          "symbol": "ρ",
          "name": "minor density",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "b",
          "name": "maximum input cost",
          "introduced": false,
          "displaySymbol": true
        },
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(ρ, b, ε)",
        "tex": "f\\bigl(\\rho,b,\\varepsilon\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057",
            "title": "Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts",
            "location": "Theorem A"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Deterministic broadcast CONGEST in f(ρ, b, ε) rounds; local covering LP with candidates in closed neighborhoods; minor-density bound ρ; each candidate has a positive integer cost at most b; fractional output; ε > 0.",
        "reason": "Theorem A supplies an approximation scheme with limiting ratio 1 and round complexity depending on ρ, b and ε. Optimal parameter dependence and exact optimization are not claimed.",
        "evidenceUrl": "https://arxiv.org/pdf/2611.02057",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "costs-integer-b",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "C(r)",
          "description": "Candidate vertices permitted to cover request r",
          "tex": "C(r)"
        },
        {
          "symbol": "C",
          "description": "Locally known candidate sets for the requests",
          "tex": "C"
        },
        {
          "symbol": "G",
          "description": "Input graph",
          "tex": "G"
        },
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "b",
          "description": "Upper bound on the positive integer cost of each candidate vertex",
          "tex": "b"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Request vertex of the local covering instance",
          "tex": "r"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        },
        {
          "symbol": "ρ",
          "description": "Fixed rational upper bound on |E(H)|/|V(H)| for every minor H",
          "tex": "\\rho"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-ba929dd9ea7a6101c7cf",
          "costs-integer-b",
          "input-local-covering-candidates",
          "model-broadcast-congest"
        ],
        "parameters": [
          "parameter-fixed-rho-b-epsilon"
        ],
        "assumptions": [
          "input-logarithmic-ids"
        ],
        "detail": [],
        "covered": [
          "auto-graph-ba929dd9ea7a6101c7cf",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-d4a9a4dfb4c06850597b",
          "costs-integer-b",
          "detail-fractional-benchmark",
          "detail-fractional-output",
          "input-distinct-ids",
          "input-local-covering-candidates",
          "input-logarithmic-ids",
          "model-broadcast-congest",
          "parameter-epsilon-positive",
          "parameter-fixed-epsilon",
          "parameter-fixed-rho-b-epsilon",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-asw26-cover-random",
      "problem": "Integral local covering",
      "variant": "Integral local cover; bounded costs",
      "objective": "min",
      "graphClass": "Every minor H satisfies |E(H)| ≤ ρ|V(H)|",
      "model": "CONGEST",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "1 + ε in expectation",
      "rounds": "Oρ,ᵦ,ε(1)",
      "roundClass": "parameter",
      "parameters": "Fixed rational ρ ≥ 1, integer b ≥ 1 and ε > 0. Each candidate vertex has a positive integer cost at most b.",
      "assumptions": "Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs. Feasible locally known candidates C(r) ⊆ N[r]; costs in {1,…,b}. Output always feasible.",
      "paperId": "gen-asw26",
      "theorem": "Theorem D(i)",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "local-covering"
      },
      "problemSource": "Local covering",
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "1 + ε in expectation",
      "roundsDisplay": "f(ρ, b, ε)",
      "roundParameters": [
        {
          "symbol": "ρ",
          "name": "minor density",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "b",
          "name": "maximum input cost",
          "introduced": false,
          "displaySymbol": true
        },
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(ρ, b, ε)",
        "tex": "f\\bigl(\\rho,b,\\varepsilon\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057",
            "title": "Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts",
            "location": "Theorem D(i)"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Randomized broadcast CONGEST in f(ρ, b, ε) rounds; integral local covering; minor-density bound ρ; each candidate has a positive integer cost at most b; always feasible output; expected cost ≤ (1+ε) integral OPT for ε > 0.",
        "reason": "Theorem D(i) attains an approximation scheme with round complexity depending on ρ, b and ε. Ratio 1 is the limiting optimum; the cost guarantee is in expectation. Optimal parameter dependence is not claimed.",
        "evidenceUrl": "https://arxiv.org/pdf/2611.02057",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "costs-integer-b",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "C(r)",
          "description": "Candidate vertices permitted to cover request r",
          "tex": "C(r)"
        },
        {
          "symbol": "C",
          "description": "Locally known candidate sets for the requests",
          "tex": "C"
        },
        {
          "symbol": "G",
          "description": "Input graph",
          "tex": "G"
        },
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "b",
          "description": "Upper bound on the positive integer cost of each candidate vertex",
          "tex": "b"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Request vertex of the local covering instance",
          "tex": "r"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        },
        {
          "symbol": "ρ",
          "description": "Fixed rational upper bound on |E(H)|/|V(H)| for every minor H",
          "tex": "\\rho"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-ba929dd9ea7a6101c7cf",
          "costs-integer-b",
          "input-local-covering-candidates",
          "model-broadcast-congest"
        ],
        "parameters": [
          "parameter-fixed-rho-b-epsilon"
        ],
        "assumptions": [
          "input-logarithmic-ids"
        ],
        "detail": [
          "output-always-feasible"
        ],
        "covered": [
          "auto-graph-ba929dd9ea7a6101c7cf",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-d13f16e4e51c9b55f160",
          "costs-integer-b",
          "detail-integral-output",
          "input-distinct-ids",
          "input-local-covering-candidates",
          "input-logarithmic-ids",
          "model-broadcast-congest",
          "output-always-feasible",
          "parameter-epsilon-positive",
          "parameter-fixed-epsilon",
          "parameter-fixed-rho-b-epsilon",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-asw26-cover-det",
      "problem": "Integral local covering",
      "variant": "Integral local cover; bounded costs",
      "objective": "min",
      "graphClass": "Every minor H satisfies |E(H)| ≤ ρ|V(H)|",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "Oρ,ᵦ,ε(log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed rational ρ ≥ 1, integer b ≥ 1 and ε > 0. Each candidate vertex has a positive integer cost at most b.",
      "assumptions": "Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs. Feasible locally known candidates C(r) ⊆ N[r]; costs in {1,…,b}. Common polynomial upper bound on IDs known.",
      "paperId": "gen-asw26",
      "theorem": "Theorem D(ii)",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "local-covering"
      },
      "problemSource": "Local covering",
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "prerequisite": "Known common polynomial ID bound",
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "Oρ,ᵦ,ε(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Oρ,ᵦ,ε(log* n)",
        "tex": "O_{\\rho,b,\\varepsilon}(\\log^*n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057",
            "title": "Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts",
            "location": "Theorem D(ii)"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Deterministic broadcast CONGEST; integral local covering on graphs of minor density at most ρ; positive integer candidate costs at most b; 0 < ε < 1/4; known common polynomial ID bound; O(log* n) rounds with a multiplicative constant depending on ρ, b and ε.",
        "reason": "Theorem D(ii) approaches integral OPT within 1+ε. Proposition C.1 proves Ω(log* n) already for cycles, so the dependence on n is optimal for fixed ρ, b and ε. Optimal dependence on those parameters is not claimed.",
        "evidenceUrl": "https://arxiv.org/pdf/2611.02057",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-epsilon-quarter"
        ]
      },
      "sotaScopeTransfers": [
        {
          "resultId": "gen-asw26-cover-det",
          "graph": "planar",
          "problem": "dominating-set",
          "scopeLabel": "Planar MDS · log-star",
          "setting": "Planar unweighted MDS; instantiate local covering with requests V, C(v)=N[v], unit costs and minor-density bound ρ=3. Deterministic broadcast CONGEST gives ratio 1+ε in the stated parameter-dependent log-star bound, with the known common polynomial ID bound.",
          "reason": "Theorem D(ii) supplies this specialization. Proposition C.1 makes the dependence on n optimal already on cycles. Full accuracy dependence and the supplied ID-bound convention remain part of the tradeoff.",
          "evidenceUrl": "https://arxiv.org/pdf/2611.02057#page=51",
          "conditionIds": [
            "parameter-epsilon-quarter"
          ],
          "claimConditionIds": [
            "parameter-epsilon-quarter"
          ],
          "settingConditionIds": [
            "binding-rho-three",
            "binding-unit-costs",
            "binding-closed-neighborhood-requests"
          ]
        }
      ],
      "frontierStatus": "frontier",
      "weightCondition": "costs-integer-b",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "dominating-logstar-rounds",
          "resultId": "gen-asw26-cover-det",
          "graphs": [
            "minor"
          ],
          "problems": [
            "local-covering"
          ],
          "models": [
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": [
            "scope-rounds-n-rho-b-epsilon",
            "parameter-epsilon-quarter"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "C(r)",
          "description": "Candidate vertices permitted to cover request r",
          "tex": "C(r)"
        },
        {
          "symbol": "C",
          "description": "Locally known candidate sets for the requests",
          "tex": "C"
        },
        {
          "symbol": "G",
          "description": "Input graph",
          "tex": "G"
        },
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "b",
          "description": "Upper bound on the positive integer cost of each candidate vertex",
          "tex": "b"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Request vertex of the local covering instance",
          "tex": "r"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        },
        {
          "symbol": "ρ",
          "description": "Fixed rational upper bound on |E(H)|/|V(H)| for every minor H",
          "tex": "\\rho"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-ba929dd9ea7a6101c7cf",
          "costs-integer-b",
          "input-local-covering-candidates",
          "input-common-polynomial-id-bound",
          "model-broadcast-congest"
        ],
        "parameters": [
          "parameter-fixed-rho-b-epsilon"
        ],
        "assumptions": [
          "input-logarithmic-ids"
        ],
        "detail": [],
        "covered": [
          "auto-graph-ba929dd9ea7a6101c7cf",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-d13f16e4e51c9b55f160",
          "costs-integer-b",
          "detail-integral-output",
          "input-common-polynomial-id-bound",
          "input-distinct-ids",
          "input-local-covering-candidates",
          "input-logarithmic-ids",
          "model-broadcast-congest",
          "parameter-epsilon-positive",
          "parameter-fixed-epsilon",
          "parameter-fixed-rho-b-epsilon",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-asw26-cycle-lower",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Cycles",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "approximation": "1 + ε",
      "rounds": "Ω(log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed 0 < ε < 1/4.",
      "assumptions": "Deterministic; even with known n and IDs {1,…,n}.",
      "paperId": "gen-asw26",
      "theorem": "Proposition C.1",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "cycle"
      },
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "Ω(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Ω(log* n)",
        "tex": "\\Omega (\\log^* n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057",
            "title": "Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts",
            "location": "Proposition C.1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Deterministic LOCAL; unweighted minimum dominating set on cycles; fixed 0 < ε < 1/4; ratio 1+ε against integral OPT; known n and IDs {1,…,n} allowed.",
        "reason": "Proposition C.1 gives Ω(log* n), matched by Theorem D(ii), even using broadcast CONGEST for the upper bound. This lower bound is tight.",
        "evidenceUrl": "https://arxiv.org/pdf/2611.02057",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "dominating-logstar-rounds",
          "resultId": "gen-asw26-cycle-lower",
          "graphs": [
            "cycle",
            "planar",
            "outerplanar",
            "euler",
            "orientable"
          ],
          "problems": [
            "dominating-set"
          ],
          "models": [
            "LOCAL",
            "CONGEST"
          ],
          "conditionIds": [
            "scope-rounds-n-epsilon",
            "parameter-epsilon-quarter"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-581d3bad24d9045aad04",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-3322b3cbbe2c94dcb771"
        ],
        "assumptions": [
          "auto-assumption-30d97f811f8d9d819bc6"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-30d97f811f8d9d819bc6",
          "auto-graph-581d3bad24d9045aad04",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-3322b3cbbe2c94dcb771",
          "parameter-epsilon-half",
          "parameter-epsilon-positive",
          "parameter-epsilon-quarter",
          "parameter-epsilon-unit",
          "parameter-fixed-epsilon",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-fk25-tree",
      "problem": "Independent set",
      "variant": "Maximum weight",
      "objective": "max",
      "graphClass": "Trees",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − ε of OPT",
      "rounds": "O(log* n / ε)",
      "roundClass": "logstar",
      "parameters": "log(n)/n < ε < 1; fixed ε gives log-star rounds.",
      "assumptions": "Node weights fit one CONGEST message; n, Δ and relevant graph parameters known.",
      "paperId": "gen-fk25",
      "theorem": "Theorem 1.1",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2506.10845v1",
      "year": 2025,
      "problemScope": {
        "node": "independent-set"
      },
      "graphScope": {
        "node": "forest"
      },
      "graphClassSource": "Trees, including unrooted trees",
      "prerequisite": "Known n, Δ and graph parameters",
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "O(log* n / ε)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log* n / ε)",
        "tex": "O\\!\\left(\\frac{\\log^*n}{\\varepsilon}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2506.10845v1",
            "title": "Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs",
            "location": "Theorem 1.1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Deterministic CONGEST; maximum-weight independent set on arbitrary unrooted trees; log(n)/n < ε < 1; retained weight ≥ (1−ε) OPT; weights fit one message.",
        "reason": "Theorem 1.1 proves tight Θ(log* n/ε) complexity; the lower bound holds even for unweighted oriented paths in LOCAL.",
        "evidenceUrl": "https://arxiv.org/html/2506.10845v1",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "tree-independent-rounds",
          "resultId": "gen-fk25-tree",
          "graphs": [
            "forest",
            "path",
            "oriented-path"
          ],
          "problems": [
            "independent-set"
          ],
          "models": [
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": []
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-655689d0297b69cf89ca",
          "weights-weighted",
          "input-known-n-degree-graph"
        ],
        "parameters": [
          "auto-parameter-7c6f24677bc7fbc2830c"
        ],
        "assumptions": [],
        "detail": [
          "detail-weights-one-message"
        ],
        "covered": [
          "auto-graph-655689d0297b69cf89ca",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-4ad7b7801c4e84e8fdd9",
          "auto-parameter-7c6f24677bc7fbc2830c",
          "detail-weights-one-message",
          "input-known-degree",
          "input-known-n",
          "input-known-n-degree",
          "input-known-n-degree-graph",
          "parameter-epsilon-positive",
          "parameter-epsilon-tree-domain",
          "parameter-epsilon-unit",
          "parameter-fixed-epsilon",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-fk25-path-lower",
      "problem": "Independent set",
      "variant": "Maximum cardinality",
      "objective": "max",
      "graphClass": "Oriented paths",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "approximation": "1 − ε",
      "rounds": "Ω(log* n / ε)",
      "roundClass": "logstar",
      "parameters": "log(n)/n < ε < 1; fixed ε gives log-star rounds.",
      "assumptions": "Deterministic algorithms.",
      "paperId": "gen-fk25",
      "theorem": "Theorem 1.1",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2506.10845v1",
      "year": 2025,
      "problemScope": {
        "node": "independent-set"
      },
      "graphScope": {
        "node": "oriented-path",
        "note": "Orientation is supplied to the lower-bound algorithm."
      },
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "Ω(log* n / ε)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Ω(log* n / ε)",
        "tex": "\\Omega\\!\\left(\\frac{\\log^*n}{\\varepsilon}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2506.10845v1",
            "title": "Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs",
            "location": "Theorem 1.1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Deterministic LOCAL; maximum-cardinality independent set on oriented paths; log(n)/n < ε < 1; retained cardinality ≥ (1−ε) OPT.",
        "reason": "Theorem 1.1 proves Ω(log* n/ε), matched by its CONGEST upper bound for all trees. Both n and ε dependence are tight in the stated range.",
        "evidenceUrl": "https://arxiv.org/html/2506.10845v1",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "tree-independent-rounds",
          "resultId": "gen-fk25-path-lower",
          "graphs": [
            "oriented-path",
            "path",
            "forest"
          ],
          "problems": [
            "independent-set"
          ],
          "models": [
            "LOCAL",
            "CONGEST"
          ],
          "conditionIds": []
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-597aa492393966caa704",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-7c6f24677bc7fbc2830c"
        ],
        "assumptions": [
          "auto-assumption-dd30a8ba85510a5ac83a"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-dd30a8ba85510a5ac83a",
          "auto-graph-597aa492393966caa704",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-4ad7b7801c4e84e8fdd9",
          "auto-parameter-7c6f24677bc7fbc2830c",
          "parameter-epsilon-positive",
          "parameter-epsilon-tree-domain",
          "parameter-epsilon-unit",
          "parameter-fixed-epsilon",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-fk25-arboricity-fast",
      "problem": "Independent set",
      "variant": "Maximum weight",
      "objective": "max",
      "graphClass": "Arboricity β ≥ 1",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "≥ (1−ε) w(V)/(4β)",
      "rounds": "O(log²(β/ε)/ε + log* n)",
      "roundClass": "logstar",
      "parameters": "0 < ε < 1; fixed β, ε gives log-star rounds.",
      "assumptions": "Node weights fit one CONGEST message; n, Δ and relevant graph parameters known. w(V) is total input weight, hence at least OPT.",
      "paperId": "gen-fk25",
      "theorem": "Theorem 1.2",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2506.10845v1",
      "year": 2025,
      "problemScope": {
        "node": "independent-set"
      },
      "graphScope": {
        "node": "density",
        "note": "Use compatible fixed arboricity bounds; planar inputs permit an arboricity bound of 3."
      },
      "prerequisite": "Known n, Δ and graph parameters",
      "approximationDisplay": "≥ (1−ε) w(V)/(4β)",
      "roundsDisplay": "O(log²(β/ε)/ε + log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log²(β/ε)/ε + log* n)",
        "tex": "O\\!\\left(\\frac{\\log^2(\\beta/\\varepsilon)}{\\varepsilon}+\\log^*n\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2506.10845v1",
            "title": "Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs",
            "location": "Theorem 1.2"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "Bounded arboricity · weighted IS · log-star",
        "setting": "Deterministic CONGEST; maximum-weight independent set on graphs of arboricity β≥1; source weight encodings and supplied graph parameters; weight at least (1−ε)w(V)/(4β) in O(log²(β/ε)/ε + log* n) rounds.",
        "reason": "Theorem 1.2 improves the known bounded-arboricity weighted-IS tradeoff to log-star dependence on n for fixed β and ε. The stronger total-weight guarantee of Theorem 1.3 uses logarithmic n rounds, so it does not dominate this faster point. The benchmark remains total input weight w(V), rather than being silently replaced by OPT.",
        "evidenceUrl": "https://arxiv.org/html/2506.10845v1#S1.SS4.SSS2",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "w(V)",
          "description": "Total input vertex weight, which is at least the maximum independent-set weight",
          "tex": "w(V)"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "w",
          "description": "Input vertex-weight function",
          "tex": "w"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "β",
          "description": "Arboricity bound of the input graph",
          "tex": "\\beta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-407b59be506be46dbb08",
          "weights-weighted",
          "input-known-n-degree-graph"
        ],
        "parameters": [
          "auto-parameter-e8b3261a0e0b3f8858bd"
        ],
        "assumptions": [],
        "detail": [
          "detail-weights-one-message",
          "detail-total-weight-benchmark"
        ],
        "covered": [
          "auto-graph-407b59be506be46dbb08",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-4ad7b7801c4e84e8fdd9",
          "auto-parameter-e8b3261a0e0b3f8858bd",
          "detail-total-weight-benchmark",
          "detail-weights-one-message",
          "input-known-degree",
          "input-known-n",
          "input-known-n-degree",
          "input-known-n-degree-graph",
          "parameter-beta-ge1",
          "parameter-epsilon-positive",
          "parameter-epsilon-unit",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-fk25-arboricity-better",
      "problem": "Independent set",
      "variant": "Maximum weight",
      "objective": "max",
      "graphClass": "Arboricity β > 1",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "≥ (1−ε) w(V)/(2β+1)",
      "rounds": "O(log³ β · log(1/ε) · log n / ε²)",
      "roundClass": "logarithmic",
      "parameters": "0 < ε < 1; fixed β, ε gives logarithmic rounds.",
      "assumptions": "Node weights fit one CONGEST message; n, Δ and relevant graph parameters known. w(V) is total input weight, hence at least OPT.",
      "paperId": "gen-fk25",
      "theorem": "Theorem 1.3",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2506.10845v1",
      "year": 2025,
      "problemScope": {
        "node": "independent-set"
      },
      "graphScope": {
        "node": "density",
        "note": "Use compatible fixed arboricity bounds; planar inputs permit an arboricity bound of 3."
      },
      "prerequisite": "Known n, Δ and graph parameters",
      "approximationDisplay": "≥ (1−ε) w(V)/(2β+1)",
      "roundsDisplay": "O(log³ β · log(1/ε) · log n / ε²)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log³ β · log(1/ε) · log n / ε²)",
        "tex": "O\\!\\left(\\frac{\\log^3\\beta\\,\\log(1/\\varepsilon)\\,\\log n}{\\varepsilon^2}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2506.10845v1",
            "title": "Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs",
            "location": "Theorem 1.3"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "Bounded arboricity · weighted IS · logarithmic",
        "setting": "Deterministic CONGEST; maximum-weight independent set on graphs of arboricity β>1; source weight encodings and supplied graph parameters; weight at least (1−ε)w(V)/(2β+1) with the stated β, ε and logarithmic-n round dependence.",
        "reason": "Theorem 1.3 improves the logarithmic-round guarantee and its dependence on β in the stated parameter range. Its larger retained fraction trades against Theorem 1.2’s faster log-star n dependence. The total-weight benchmark and complete parameter dependence are part of this frontier point; no exact optimality claim is made.",
        "evidenceUrl": "https://arxiv.org/html/2506.10845v1#S1.SS4.SSS2",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "w(V)",
          "description": "Total input vertex weight, which is at least the maximum independent-set weight",
          "tex": "w(V)"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "w",
          "description": "Input vertex-weight function",
          "tex": "w"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "β",
          "description": "Arboricity bound of the input graph",
          "tex": "\\beta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-f0a5babb59d5c701134a",
          "weights-weighted",
          "input-known-n-degree-graph"
        ],
        "parameters": [
          "auto-parameter-fca824c9f4aac6656e76"
        ],
        "assumptions": [],
        "detail": [
          "detail-weights-one-message",
          "detail-total-weight-benchmark"
        ],
        "covered": [
          "auto-graph-f0a5babb59d5c701134a",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-4ad7b7801c4e84e8fdd9",
          "auto-parameter-fca824c9f4aac6656e76",
          "detail-total-weight-benchmark",
          "detail-weights-one-message",
          "input-known-degree",
          "input-known-n",
          "input-known-n-degree",
          "input-known-n-degree-graph",
          "parameter-beta-ge1",
          "parameter-beta-gt1",
          "parameter-epsilon-positive",
          "parameter-epsilon-unit",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-low24-cover",
      "problem": "Fractional covering LP",
      "variant": "Fractional positive LP",
      "objective": "min",
      "graphClass": "Incidence graphs",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "O(Γd · log Γₚ / ε²)",
      "roundClass": "degree",
      "parameters": "Γₚ = max column sum, Γd = max row sum of normalized A; ε > 0.",
      "assumptions": "Communication graph is variable–constraint incidence graph. Normalized nonzero Aᵢⱼ ≥ 1; coefficient sizes follow the paper’s CONGEST encoding.",
      "paperId": "gen-low24",
      "theorem": "Theorem 2.1",
      "summary": "Simultaneously computes a feasible primal and dual approximation.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2409.16168v1",
      "year": 2024,
      "problemScope": {
        "node": "covering-lp"
      },
      "problemSource": "Covering LP",
      "graphScope": {
        "node": "incidence",
        "note": "The communication graph is the variable–constraint incidence graph."
      },
      "graphClassSource": "General incidence graphs",
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "O(Γd · log Γₚ / ε²)",
      "approximationBenchmark": "fractional",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(Γd · log Γₚ / ε²)",
        "tex": "O\\!\\left(\\frac{\\Gamma_d\\,\\log\\Gamma_p}{\\varepsilon^2}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2409.16168v1",
            "title": "A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems",
            "location": "Theorem 2.1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "Incidence network · sparse fractional covering · accuracy tradeoff",
        "setting": "Deterministic CONGEST; normalized fractional covering LP on its variable–constraint incidence network; nonzero coefficients at least 1 with the source encodings; ratio 1+ε and O(Γd log Γp / ε²) rounds.",
        "reason": "Theorem 2.1 gives the ε^−2 accuracy point. Its linear Γd dependence trades against the earlier logarithmic-Γd, ε^−4 bound; neither family uniformly dominates the other. For bounded sparsity and coefficients this improves the prior accuracy dependence. No integral-output or graph-preserving reduction is inferred.",
        "evidenceUrl": "https://arxiv.org/html/2409.16168v1#S2",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "coefficients-normalized-positive",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "Aᵢⱼ",
          "description": "Coefficient in row i and column j of the normalized constraint matrix",
          "tex": "A_{ij}"
        },
        {
          "symbol": "Γd",
          "description": "Maximum row sum of the normalized constraint matrix A",
          "tex": "\\Gamma_d"
        },
        {
          "symbol": "Γₚ",
          "description": "Maximum column sum of the normalized constraint matrix A",
          "tex": "\\Gamma_p"
        },
        {
          "symbol": "A",
          "description": "Normalized constraint matrix, whose nonzero coefficients are at least one",
          "tex": "A"
        },
        {
          "symbol": "i",
          "description": "Row index of the normalized constraint matrix",
          "tex": "i"
        },
        {
          "symbol": "j",
          "description": "Column index of the normalized constraint matrix",
          "tex": "j"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "graph-variable-constraint-incidence",
          "coefficients-normalized-positive",
          "coefficients-at-least-one",
          "coefficient-encoding"
        ],
        "parameters": [
          "auto-parameter-c293f2aadfa39d01b72f"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-53746915587a9d48e761",
          "auto-parameter-c293f2aadfa39d01b72f",
          "coefficient-encoding",
          "coefficients-at-least-one",
          "coefficients-normalized-positive",
          "detail-fractional-benchmark",
          "detail-fractional-output",
          "graph-variable-constraint-incidence"
        ]
      }
    },
    {
      "id": "gen-low24-pack",
      "problem": "Fractional packing LP",
      "variant": "Dual fractional positive LP",
      "objective": "max",
      "graphClass": "Incidence graphs",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1/(1+ε) of fractional OPT",
      "rounds": "O(Γd · log Γₚ / ε²)",
      "roundClass": "degree",
      "parameters": "Γₚ = max column sum, Γd = max row sum of normalized A; ε > 0.",
      "assumptions": "Communication graph is variable–constraint incidence graph. Normalized nonzero Aᵢⱼ ≥ 1; coefficient sizes follow the paper’s CONGEST encoding.",
      "paperId": "gen-low24",
      "theorem": "Theorem 2.1",
      "summary": "For fixed row sparsity k, Γd ≤ k Amax.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2409.16168v1",
      "year": 2024,
      "problemScope": {
        "node": "packing-lp"
      },
      "problemSource": "Packing LP",
      "graphScope": {
        "node": "incidence",
        "note": "The communication graph is the variable–constraint incidence graph."
      },
      "graphClassSource": "General incidence graphs",
      "approximationDisplay": "1/(1+ε)",
      "roundsDisplay": "O(Γd · log Γₚ / ε²)",
      "approximationBenchmark": "fractional",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(Γd · log Γₚ / ε²)",
        "tex": "O\\!\\left(\\frac{\\Gamma_d\\,\\log\\Gamma_p}{\\varepsilon^2}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2409.16168v1",
            "title": "A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems",
            "location": "Theorem 2.1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "Incidence network · sparse fractional packing · accuracy tradeoff",
        "setting": "Deterministic CONGEST; the dual normalized fractional packing LP on its variable–constraint incidence network; source coefficient/encoding conditions; feasible value at least OPT/(1+ε) in O(Γd log Γp / ε²) rounds.",
        "reason": "Theorem 2.1 supplies the dual ε^−2 point with the same sparsity/coefficient tradeoff as covering. Earlier ε^−4 algorithms have better Γd dependence, so the full parameter functions must be compared. A fractional packing guarantee is kept separate from integral matching and packing.",
        "evidenceUrl": "https://arxiv.org/html/2409.16168v1#S2",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "coefficients-normalized-positive",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "Aᵢⱼ",
          "description": "Coefficient in row i and column j of the normalized constraint matrix",
          "tex": "A_{ij}"
        },
        {
          "symbol": "Γd",
          "description": "Maximum row sum of the normalized constraint matrix A",
          "tex": "\\Gamma_d"
        },
        {
          "symbol": "Γₚ",
          "description": "Maximum column sum of the normalized constraint matrix A",
          "tex": "\\Gamma_p"
        },
        {
          "symbol": "A",
          "description": "Normalized constraint matrix, whose nonzero coefficients are at least one",
          "tex": "A"
        },
        {
          "symbol": "i",
          "description": "Row index of the normalized constraint matrix",
          "tex": "i"
        },
        {
          "symbol": "j",
          "description": "Column index of the normalized constraint matrix",
          "tex": "j"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "graph-variable-constraint-incidence",
          "coefficients-normalized-positive",
          "coefficients-at-least-one",
          "coefficient-encoding"
        ],
        "parameters": [
          "auto-parameter-c293f2aadfa39d01b72f"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-5bdcfa2d039df6333abe",
          "auto-parameter-c293f2aadfa39d01b72f",
          "coefficient-encoding",
          "coefficients-at-least-one",
          "coefficients-normalized-positive",
          "detail-fractional-benchmark",
          "detail-fractional-output",
          "graph-variable-constraint-incidence"
        ]
      }
    },
    {
      "id": "gen-dp26-matching",
      "problem": "Maximum matching",
      "variant": "Maximum cardinality",
      "objective": "max",
      "graphClass": "General",
      "model": "LOCAL",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "1/(2+ε) of OPT",
      "rounds": "O(log n / log² log n)",
      "roundClass": "other",
      "parameters": "0 < ε < 1 may depend on n; constant δ > 0.",
      "assumptions": "Success probability ≥ 1 − ε⁻¹ exp(−Ω(log¹⁻δ n)).",
      "paperId": "gen-dp26",
      "theorem": "Theorem 1",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2605.13264v1",
      "year": 2026,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "general"
      },
      "approximationDisplay": "1/(2+ε)",
      "roundsDisplay": "O(log n / log² log n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log n / log² log n)",
        "tex": "O\\!\\left(\\frac{\\log n}{(\\log\\log n)^2}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2605.13264v1",
            "title": "Distributed Approximate Maximum Matching and Minimum Vertex Cover via Generalized Graph Decomposition",
            "location": "Theorem 1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Randomized LOCAL; maximum-cardinality matching on general graphs with no degree bound; fixed 0 < ε < 1 and δ > 0; ratio 1/(2+ε); success ≥ 1−ε⁻¹ exp(−Ω(log¹⁻δ n)); n-only round complexity.",
        "reason": "Theorem 1 improves the previous n-dependent bound by a log log n factor to O(log n/log² log n). Current primary-source audit found no later improvement with this guarantee; optimality remains open.",
        "evidenceUrl": "https://arxiv.org/html/2605.13264v1",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-fixed-epsilon"
        ]
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "δ",
          "description": "Fixed constant controlling the exponent in the success-probability bound",
          "tex": "\\delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-fc75e240ad481ee0e55f"
        ],
        "assumptions": [
          "auto-assumption-99d1e131b93d403aad65"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-99d1e131b93d403aad65",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-fc75e240ad481ee0e55f",
          "parameter-epsilon-positive",
          "parameter-epsilon-unit",
          "parameter-fixed-delta",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-dp26-cover",
      "problem": "Vertex cover",
      "variant": "Minimum weight",
      "objective": "min",
      "graphClass": "General",
      "model": "LOCAL",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "2 + ε",
      "rounds": "O(log n/log² log n + log n · log(1/ε)/log³ log n)",
      "roundClass": "other",
      "parameters": "0 < ε < 1 may depend on n.",
      "assumptions": "With high probability in n.",
      "paperId": "gen-dp26",
      "theorem": "Theorem 2",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2605.13264v1",
      "year": 2026,
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "general"
      },
      "approximationDisplay": "2 + ε",
      "roundsDisplay": "O(log n/log² log n + log n · log(1/ε)/log³ log n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log n/log² log n + log n · log(1/ε)/log³ log n)",
        "tex": "O\\!\\left(\\frac{\\log n}{(\\log\\log n)^2}+\\frac{\\log n\\,\\log(1/\\varepsilon)}{(\\log\\log n)^3}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2605.13264v1",
            "title": "Distributed Approximate Maximum Matching and Minimum Vertex Cover via Generalized Graph Decomposition",
            "location": "Theorem 2"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Randomized LOCAL; minimum-weight vertex cover on general graphs with no degree bound; fixed 0 < ε < 1; factor 2+ε with high probability in n; n-only round complexity.",
        "reason": "Theorem 2 gives O(log n/log² log n) for fixed ε and explicitly improves the prior n-dependent best. Current primary-source audit found no later improvement; the lower-bound gap remains open.",
        "evidenceUrl": "https://arxiv.org/html/2605.13264v1",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-fixed-epsilon"
        ]
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-weighted"
        ],
        "parameters": [
          "auto-parameter-3476296f566e07833c97"
        ],
        "assumptions": [
          "auto-assumption-80568cb855e5b8754fce"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-80568cb855e5b8754fce",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-output-7f07455ff69b3b347e9b",
          "auto-parameter-3476296f566e07833c97",
          "parameter-epsilon-positive",
          "parameter-epsilon-unit",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-iky25-matching",
      "problem": "Maximum matching",
      "variant": "Maximum cardinality",
      "objective": "max",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − ε of OPT",
      "rounds": "O(ε⁻⁴ · MM(ε⁻² n))",
      "roundClass": "polylog",
      "parameters": "0 < ε < 1; MM(N) is the round complexity of maximal matching on N vertices.",
      "assumptions": "Deterministic when using a deterministic maximal-matching subroutine. The bound retains this subroutine cost.",
      "paperId": "gen-iky25",
      "theorem": "Theorem 1.2",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2511.08210v1",
      "year": 2025,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "general"
      },
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "O(ε⁻⁴ · MM(ε⁻² n))",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(ε⁻⁴ · MM(ε⁻² n))",
        "tex": "O\\!\\left(\\varepsilon^{-4}\\,\\mathrm{MM}(\\varepsilon^{-2}n)\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2511.08210v1",
            "title": "Forgetting Alternation and Blossoms: A New Framework for Fast Matching Augmentation and Its Applications to Sequential/Distributed/Streaming Computation",
            "location": "Theorem 1.2"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Deterministic CONGEST; maximum-cardinality matching on general graphs without a degree bound; retained fraction 1−ε; fully polynomial dependence on 1/ε and polylogarithmic n; MM(N) denotes deterministic maximal-matching cost.",
        "reason": "Theorem 1.2 gives O(ε⁻⁴ MM(ε⁻²n)), improving the prior Õ(ε⁻¹⁰ MM(n)) bound. Current primary-source audit found no later improvement to this general tradeoff; no optimality claim.",
        "evidenceUrl": "https://arxiv.org/html/2511.08210v1",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "MM",
          "description": "Round complexity of the maximal-matching subroutine as a function of its input size",
          "tex": "\\mathrm{MM}"
        },
        {
          "symbol": "N",
          "description": "Number of vertices in the maximal-matching subroutine instance",
          "tex": "N"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-516147a00c3aa0a82783"
        ],
        "assumptions": [
          "auto-assumption-4dffc0da8b409a724621"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-4dffc0da8b409a724621",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-516147a00c3aa0a82783",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-chr24-local",
      "problem": "Local density",
      "variant": "Per-vertex local-density estimation",
      "objective": "max",
      "graphClass": "General",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "Within factor 1 + ε",
      "rounds": "O(ε⁻² log² n)",
      "roundClass": "polylog",
      "parameters": "ε⁻¹ = O(poly(n)).",
      "assumptions": "Outputs an estimate of ρ*(v) at each vertex; not directly a selected densest subgraph.",
      "paperId": "gen-chr24",
      "theorem": "Abstract",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2025.25",
      "year": 2024,
      "problemScope": {
        "node": "local-density"
      },
      "graphScope": {
        "node": "general"
      },
      "approximationDisplay": "Within factor 1 + ε",
      "roundsDisplay": "O(ε⁻² log² n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(ε⁻² log² n)",
        "tex": "O(\\varepsilon^{-2}\\log^2n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2025.25",
            "title": "Local Density and Its Distributed Approximation",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "ρ*(v)",
          "description": "Local density assigned to vertex v; equivalently its optimal local out-degree",
          "tex": "\\rho^*(v)"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "v",
          "description": "Vertex whose local density is estimated",
          "tex": "v"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-8d2a24f83dd35a601656"
        ],
        "assumptions": [
          "auto-assumption-e178aeb72ef1814dfe69"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-e178aeb72ef1814dfe69",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-0ded4f9dae88d217ac16",
          "auto-parameter-8d2a24f83dd35a601656",
          "detail-per-vertex-density",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-chr24-congest",
      "problem": "Local density",
      "variant": "Per-vertex local-density estimation",
      "objective": "max",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "Within factor 1 + ε",
      "rounds": "poly(log n, ε⁻¹) · 2ᴼ⁽√ˡᵒᵍ ⁿ⁾",
      "roundClass": "other",
      "parameters": "ε⁻¹ = O(poly(n)).",
      "assumptions": "Outputs an estimate of ρ*(v) at each vertex; not directly a selected densest subgraph.",
      "paperId": "gen-chr24",
      "theorem": "Abstract",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2025.25",
      "year": 2024,
      "problemScope": {
        "node": "local-density"
      },
      "graphScope": {
        "node": "general"
      },
      "approximationDisplay": "Within factor 1 + ε",
      "roundsDisplay": "poly(log n, ε⁻¹) · 2ᴼ⁽√ˡᵒᵍ ⁿ⁾",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "poly(log n, ε⁻¹) · 2ᴼ⁽√ˡᵒᵍ ⁿ⁾",
        "tex": "\\operatorname{poly}(\\log n,\\varepsilon^{-1})\\,2^{O(\\sqrt{\\log n})}",
        "basis": "symbolic",
        "explanation": "A numerical polynomial exponent has not yet been extracted for this record. The displayed expression retains all currently recorded parameter dependence.",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2025.25",
            "title": "Local Density and Its Distributed Approximation",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "ρ*(v)",
          "description": "Local density assigned to vertex v; equivalently its optimal local out-degree",
          "tex": "\\rho^*(v)"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "v",
          "description": "Vertex whose local density is estimated",
          "tex": "v"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-8d2a24f83dd35a601656"
        ],
        "assumptions": [
          "auto-assumption-e178aeb72ef1814dfe69"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-e178aeb72ef1814dfe69",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-0ded4f9dae88d217ac16",
          "auto-parameter-8d2a24f83dd35a601656",
          "detail-per-vertex-density",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-jpp26-sleep",
      "problem": "Dominating set",
      "variant": "Unweighted; sleeping CONGEST",
      "objective": "min",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "O(log Δ) in expectation",
      "rounds": "O(log² Δ) total; O(log Δ) awake",
      "roundClass": "degree",
      "parameters": "Δ is maximum degree.",
      "assumptions": "Sleeping CONGEST: a sleeping node cannot compute, send, or receive. Awake bound is per node.",
      "paperId": "gen-jpp26",
      "theorem": "Abstract",
      "summary": "Elapsed rounds and awake complexity are separate resources.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2608.19096",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "general"
      },
      "approximationDisplay": "O(log Δ) in expectation",
      "roundsDisplay": "O(log² Δ) total; O(log Δ) awake",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log² Δ) total; O(log Δ) awake",
        "tex": "O(\\log^2\\Delta)\\text{ total};\\quad O(\\log\\Delta)\\text{ awake}",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2608.19096",
            "title": "Approximating Minimum Dominating Set with Few Awake Rounds",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-unweighted",
          "model-sleeping-congest"
        ],
        "parameters": [
          "auto-parameter-086b33ba1d8d93f63191"
        ],
        "assumptions": [
          "auto-assumption-cd9841afbab6ff0511ce"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-cd9841afbab6ff0511ce",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-086b33ba1d8d93f63191",
          "model-sleeping-congest",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-as10-setcover",
      "problem": "Set cover",
      "variant": "Weighted",
      "objective": "min",
      "graphClass": "Incidence graphs; set size ≤ k, frequency ≤ f",
      "model": "Anonymous",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "f",
      "rounds": "O(f²k² + fk log* W)",
      "roundClass": "degree",
      "parameters": "Positive integer weights ≤ W; bounded f,k,W gives constant rounds.",
      "assumptions": "Anonymous broadcast network; no unique identifiers.",
      "paperId": "gen-as10",
      "theorem": "Section 4",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://jukkasuomela.fi/doc/vc-sc.pdf",
      "year": 2010,
      "problemScope": {
        "node": "set-cover"
      },
      "graphScope": {
        "node": "bounded-incidence",
        "note": "The set-size and frequency bounds remain required."
      },
      "approximationDisplay": "f",
      "roundsDisplay": "O(f²k² + fk log* W)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(f²k² + fk log* W)",
        "tex": "O(f^2k^2+fk\\log^*W)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/vc-sc.pdf",
            "title": "Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks",
            "location": "Section 4"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "Bounded incidence · anonymous broadcast · f ≤ k",
        "setting": "Weighted set cover on its incidence network; set size at most k, element frequency at most f ≤ k and positive integer weights at most W; deterministic anonymous broadcast; O(f²k² + fk log* W) rounds.",
        "reason": "Section 4 gives factor f without identifiers or port numbering. Section 6 proves the lower barrier min{f,k}; hence factor f is optimal in the certified range f ≤ k. For f > k, the trivial k-approximation is stronger, so this annotation does not certify that range. Exact running-time optimality is not claimed.",
        "evidenceUrl": "https://jukkasuomela.fi/doc/vc-sc.pdf",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-f-at-most-k"
        ]
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-integer-W",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "W",
          "description": "Upper bound on positive integer input set weights",
          "tex": "W"
        },
        {
          "symbol": "f",
          "description": "Maximum frequency: number of sets containing an element",
          "tex": "f"
        },
        {
          "symbol": "k",
          "description": "Maximum cardinality of a set",
          "tex": "k"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-29f2223ddd7a0e79d30b",
          "weights-integer-W",
          "model-anonymous-broadcast"
        ],
        "parameters": [
          "auto-parameter-6791260aa74876dd1065"
        ],
        "assumptions": [],
        "detail": [
          "strength-no-ids"
        ],
        "covered": [
          "auto-graph-29f2223ddd7a0e79d30b",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-92362405df7c8f0d5040",
          "auto-output-5e3e21d1210a645eea70",
          "auto-parameter-6791260aa74876dd1065",
          "model-anonymous-broadcast",
          "model-port-numbering",
          "strength-no-ids",
          "weights-integer-W",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-bdgpsw26-apex",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Euler genus ≤ g; at most a apices",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "34 + ε",
      "rounds": "C(g,a,ε)",
      "roundClass": "parameter",
      "parameters": "Fixed g and a; fixed ε > 0.",
      "assumptions": "",
      "paperId": "gen-bdgpsw26",
      "theorem": "Corollary 4.3 and following extension",
      "summary": "Apex neighborhoods may be arbitrary.",
      "verification": "primary",
      "sourceUrl": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "apex"
      },
      "graphClassSource": "Euler genus ≤ g plus at most a apices",
      "approximationDisplay": "34 + ε",
      "roundsDisplay": "f(g, a, ε)",
      "roundParameters": [
        {
          "symbol": "g",
          "name": "Euler genus",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "a",
          "name": "apex count",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "f(g, a, ε)",
        "tex": "f\\bigl(g,a,\\varepsilon\\bigr)",
        "basis": "unspecified-parameter-function",
        "explanation": "The text after Corollary 4.3 extends the genus approximation to graphs with at most a apices. It explains the structural changes (including shortcuts through at most a apices), but does not give a closed round-complexity formula in g,a,ε. The meta-theorem composition still requires the appropriate class control function and local-error diameter threshold.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
            "title": "Meta-Theorems for Cuttable Distributed Problems",
            "location": "Corollary 4.3 and subsequent apex extension; Theorem 4.2"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "a",
          "description": "Maximum number of apex vertices deleted to obtain Euler genus at most g",
          "tex": "a"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound",
          "tex": "g"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-cdc1893875a9dac727a7",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-a584b0bba6a6122fb630"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-cdc1893875a9dac727a7",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-a584b0bba6a6122fb630",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-bdgpsw26-localgenus",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Asymptotic dimension d; radius-r balls of Euler genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "34.01(d + 1)",
      "rounds": "C(d,g,r)",
      "roundClass": "parameter",
      "parameters": "Fixed d,g and sufficiently large fixed radius r.",
      "assumptions": "The local-class condition is as defined in the paper; the apex extension also holds.",
      "paperId": "gen-bdgpsw26",
      "theorem": "Corollary 4.4",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "local-genus",
        "note": "Asymptotic dimension, its control function and sufficiently large local radius remain fixed prerequisites."
      },
      "graphClassSource": "Asymptotic dimension d; r-locally Euler genus ≤ g",
      "approximationDisplay": "34.01(d + 1)",
      "roundsDisplay": "f(d, g, r)",
      "roundParameters": [
        {
          "symbol": "d",
          "name": "asymptotic dimension",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "g",
          "name": "local genus",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "r",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "f(d, g, r)",
        "tex": "f\\bigl(d,g,r\\bigr)",
        "basis": "unspecified-parameter-function",
        "explanation": "Corollary 4.4 fixes the dimensional control function and a sufficiently large local radius. These are substantive prerequisites: d,g,r alone do not specify the numerical control-function values used by the proof. Do not describe its runtime as an absolute constant independent of the graph-class parameters.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
            "title": "Meta-Theorems for Cuttable Distributed Problems",
            "location": "Corollary 4.4, its application of Meta-Theorem I, and the definition of the dimensional control function"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "d",
          "description": "Asymptotic dimension bound of the graph class",
          "tex": "d"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound for the radius-r balls after any stated apex deletions",
          "tex": "g"
        },
        {
          "symbol": "r",
          "description": "Fixed sufficiently large radius of the neighborhoods used in the local-class assumption",
          "tex": "r"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-cc88dac74423991e2fb4",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-537a07678fea6f22098a"
        ],
        "assumptions": [
          "auto-assumption-d82fde380382d55bfbd5"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-d82fde380382d55bfbd5",
          "auto-graph-cc88dac74423991e2fb4",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-537a07678fea6f22098a",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-bdgpsw26-ktuple",
      "problem": "k-domination (outside the solution)",
      "variant": "k-domination of vertices outside the solution",
      "objective": "min",
      "graphClass": "Euler genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "19 if k = 2; 3k/(k−2) + 1 if k > 2",
      "rounds": "C(g,k)",
      "roundClass": "parameter",
      "parameters": "Fixed g and k ≥ 2.",
      "assumptions": "Each vertex outside the solution needs k neighbors inside it; no such condition on selected vertices.",
      "paperId": "gen-bdgpsw26",
      "theorem": "Corollary 4.5",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
      "year": 2026,
      "problemScope": {
        "node": "outside-k-domination"
      },
      "problemParameter": "k",
      "problemParameterName": "required neighbors outside the solution",
      "problemSource": "k-tuple dominating set",
      "graphScope": {
        "node": "euler",
        "note": "Retain any connectivity condition stated by the source."
      },
      "approximationDisplay": "19 if k = 2; 3k/(k−2) + 1 if k > 2",
      "roundsDisplay": "f(g, k)",
      "roundParameters": [
        {
          "symbol": "g",
          "name": "Euler genus",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "k",
          "name": "domination multiplicity",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "f(g, k)",
        "tex": "f\\bigl(g,k\\bigr)",
        "basis": "unspecified-parameter-function",
        "explanation": "Corollary 4.5 quantifies the genus and k-tuple parameters using functions C₁ and C₂. Its proof invokes the genus-transfer meta-theorem and a planar algorithm; a closed runtime in g,k is not printed. The general T+δ+2 composition is available but does not eliminate the unspecified control function.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
            "title": "Meta-Theorems for Cuttable Distributed Problems",
            "location": "Corollary 4.5 and Theorem 4.2"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound",
          "tex": "g"
        },
        {
          "symbol": "k",
          "description": "Required number of neighbors in the solution for each vertex outside it",
          "tex": "k"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-4688deea0bc7a8a63f32",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-b62bd2c4786d0cd69208"
        ],
        "assumptions": [
          "auto-assumption-eeaced0e93ae80d9fd33"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-eeaced0e93ae80d9fd33",
          "auto-graph-4688deea0bc7a8a63f32",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b54ac6401a901b9d3590",
          "auto-parameter-b62bd2c4786d0cd69208",
          "output-outside-k",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-bdgpsw26-connected",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Connected; Euler genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "O(√g + 1)",
      "rounds": "C(g)",
      "roundClass": "parameter",
      "parameters": "Fixed g.",
      "assumptions": "",
      "paperId": "gen-bdgpsw26",
      "theorem": "Section 4, after Corollary 4.5",
      "summary": "The paper states the more detailed bound 68√(3g/2) + O(1).",
      "verification": "primary",
      "sourceUrl": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
      "year": 2026,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "euler",
        "note": "Retain any connectivity condition stated by the source."
      },
      "graphClassSource": "Connected graphs of Euler genus ≤ g",
      "approximationDisplay": "O(√g + 1)",
      "roundsDisplay": "f(g)",
      "roundParameters": [
        {
          "symbol": "g",
          "name": "Euler genus",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "f(g)",
        "tex": "f\\bigl(g\\bigr)",
        "basis": "unspecified-parameter-function",
        "explanation": "The connected dominating set paragraph derives its approximation guarantee using the cited connected-domination reduction, but does not expand the round complexity of the composition as a formula in g. Its explicit O(sqrt(g)) approximation factor is not a runtime formula.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
            "title": "Meta-Theorems for Cuttable Distributed Problems",
            "location": "Section 4, connected dominating set application following Corollary 4.5"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound",
          "tex": "g"
        }
      ],
      "setting": {
        "summary": [
          "graph-connected-euler",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-2f1626f8ddeafbffccc4"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-2f1626f8ddeafbffccc4",
          "graph-connected-euler",
          "input-connected",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-beks18-full-eps",
      "problem": "Vertex cover",
      "variant": "Weighted",
      "objective": "min",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "2 + ε",
      "rounds": "O(log Δ / log log Δ + log(1/ε) · log Δ / log² log Δ)",
      "roundClass": "degree",
      "parameters": "0 < ε < 1. Logs are truncated at constants; the source treats Δ ≤ 16 separately.",
      "assumptions": "Positive integer vertex weights W ≤ n^O(1). Every vertex knows Δ or an upper bound polynomial in Δ. This is the known-degree Theorem 2 implementation; no common bound on nW is needed unless rounding the result to exact factor 2.",
      "paperId": "gen-beks18",
      "theorem": "Theorem 2",
      "summary": "The full accuracy tradeoff improves the dependence on 1/ε from linear to logarithmic. The inverse-polylogarithmic-accuracy result is a specialization of this same algorithm.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/1804.01308v3#page=6",
      "year": 2018,
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "prerequisite": "Known Δ or a polynomial upper bound",
      "approximationDisplay": "2 + ε",
      "roundsDisplay": "O(log Δ / log log Δ + log(1/ε) · log Δ / log² log Δ)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log Δ / log log Δ + log(1/ε) · log Δ / log² log Δ)",
        "tex": "O\\!\\left(\\frac{\\log\\Delta}{\\log\\log\\Delta}+\\frac{\\log(1/\\varepsilon)\\,\\log\\Delta}{(\\log\\log\\Delta)^2}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/1804.01308v3#page=6",
            "title": "A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(log n log Δ / log² log Δ) Rounds",
            "location": "Theorem 2"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "General · full accuracy tradeoff",
        "setting": "Deterministic CONGEST; weighted vertex cover on general graphs; positive integer weights W≤n^O(1); known Δ or a polynomial upper bound; every ε∈(0,1), with all logarithms truncated as in the source. The complete Δ and ε round expression is retained.",
        "reason": "Theorem 2 gives the full logarithmic dependence on inverse accuracy and includes the inverse-polylogarithmic-accuracy corollary as the same protocol. Exact factor 2 and the anonymous n-independent weighted algorithm remain distinct tradeoffs; no optimal joint dependence on Δ and ε is claimed.",
        "evidenceUrl": "https://arxiv.org/pdf/1804.01308v3#page=6",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierComparisons": [
        {
          "better": "gen-beks19-full-eps",
          "worse": "gen-beks18-full-eps",
          "strict": [
            "rounds",
            "assumptions"
          ],
          "conditions": {
            "problem": "Both return an integral minimum-weight vertex-cover approximation on the original graph.",
            "graphClass": "Both apply to all general graphs.",
            "approximation": "The approximation ratio is identical for every allowed accuracy value; the exact-2 comparison has no additive loss.",
            "rounds": "Write x=log Δ and L=log(2/ε). The newer bound is O(x/log x+L+min{x,L x^0.001}); the older is O(x/log x+L x/(log x)^2). For sufficiently large x, x^0.001≤x/(log x)^2, so the new bound is no worse uniformly. For Δ=n and ε=1/n it is O(log n) instead of O(log² n/log² log n), giving a strict joint-parameter improvement. Bounded-degree cases are O(L) in both.",
            "model": "Both are deterministic CONGEST algorithms. The rank-two edge processors of the newer protocol are simulated with constant overhead.",
            "randomness": "Both are deterministic.",
            "benchmark": "The newer guarantee is at least as strong as the older integral-OPT benchmark. In the approximate case its proof also bounds cost against fractional OPT.",
            "assumptions": "Both use positive polynomially bounded integer weights. The older algorithm requires global Δ or a polynomial upper bound; the newer one can use local edge-degree bounds. No additional global input is introduced."
          },
          "evidenceUrl": "https://arxiv.org/pdf/1902.09377v2#page=9",
          "reason": "The 2019 full-accuracy family improves the 2018 joint round function, and removes the global-degree-knowledge requirement."
        }
      ],
      "dominatedBy": [
        "gen-beks19-full-eps"
      ],
      "frontierStatus": "dominated",
      "weightCondition": "weights-integer-polynomial",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "W",
          "description": "Upper bound on positive integer input vertex weights; polynomial in n",
          "tex": "W"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-integer-polynomial",
          "input-known-degree-bound"
        ],
        "parameters": [
          "auto-parameter-e2603d7d21b2cf13e04b"
        ],
        "assumptions": [],
        "detail": [
          "detail-no-nW-for-scheme"
        ],
        "covered": [
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-7f07455ff69b3b347e9b",
          "auto-parameter-e2603d7d21b2cf13e04b",
          "detail-no-nW-for-scheme",
          "input-known-degree-bound",
          "parameter-epsilon-positive",
          "parameter-epsilon-unit",
          "weights-integer-polynomial",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-beks19-full-eps",
      "problem": "Vertex cover",
      "variant": "Weighted",
      "objective": "min",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "2 + ε",
      "rounds": "O(log(2/ε) + log Δ / log log Δ + min{log Δ, log(2/ε) · (log Δ)^0.001})",
      "roundClass": "degree",
      "parameters": "0 < ε < 1; the analysis fixes γ=0.001. All logarithms are truncated at constants.",
      "assumptions": "Positive integer weights W ≤ n^O(1). Theorem 4.9 permits local degree bounds, so no global Δ is required. Instantiate rank f=2 and simulate each edge processor at its endpoints with constant communication overhead.",
      "paperId": "gen-beks19",
      "theorem": "Theorem 4.9 and the rank-two specialization in Section 1.2",
      "summary": "The complete accuracy tradeoff improves the older weighted-vertex-cover dependence on Δ and ε. This is an integral cover; the proof also bounds its cost against fractional OPT.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/1902.09377v2#page=9",
      "year": 2019,
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "approximationDisplay": "2 + ε",
      "roundsDisplay": "O(log(2/ε) + log Δ / log log Δ + min{log Δ, log(2/ε) · (log Δ)^0.001})",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log(2/ε) + log Δ / log log Δ + min{log Δ, log(2/ε) · (log Δ)^0.001})",
        "tex": "O\\!\\left(\\log(2/\\varepsilon)+\\frac{\\log\\Delta}{\\log\\log\\Delta}+\\min\\{\\log\\Delta,\\log(2/\\varepsilon)(\\log\\Delta)^{0.001}\\}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/1902.09377v2#page=9",
            "title": "Optimal Distributed Covering Algorithms",
            "location": "Theorem 4.9 and the rank-two specialization in Section 1.2"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "General · full accuracy / degree tradeoff",
        "setting": "Weighted vertex cover on general graphs; deterministic CONGEST; positive polynomially bounded integer weights; every ε∈(0,1). Rank f=2 uses a constant-overhead incidence simulation. The full displayed Δ and ε function is retained; a global degree bound is unnecessary.",
        "reason": "Theorem 4.9 improves the previous joint degree/accuracy tradeoff. For fixed accuracy it matches the degree lower bound. The complete function retains its tradeoff with anonymous exact-2 algorithms and with the separate logarithmic-round exact-2 point; no optimality for every accuracy exponent is asserted.",
        "evidenceUrl": "https://arxiv.org/pdf/1902.09377v2#page=9",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-integer-polynomial",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "W",
          "description": "Upper bound on positive integer input vertex weights; polynomial in n",
          "tex": "W"
        },
        {
          "symbol": "f",
          "description": "Rank of the simulated hypergraph instance, instantiated to two for vertex cover",
          "tex": "f"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "γ",
          "description": "Fixed analysis exponent instantiated to 0.001",
          "tex": "\\gamma"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-integer-polynomial"
        ],
        "parameters": [
          "auto-parameter-d2ade5a65ae03b5599fb"
        ],
        "assumptions": [],
        "detail": [
          "detail-rank-two-simulation",
          "strength-no-global-degree"
        ],
        "covered": [
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-7f07455ff69b3b347e9b",
          "auto-parameter-d2ade5a65ae03b5599fb",
          "detail-rank-two-simulation",
          "parameter-epsilon-positive",
          "parameter-epsilon-unit",
          "strength-no-global-degree",
          "weights-integer-polynomial",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-beks19-exact2",
      "problem": "Vertex cover",
      "variant": "Weighted",
      "objective": "min",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "2",
      "rounds": "O(log n)",
      "roundClass": "logarithmic",
      "parameters": "Positive integer weights bounded by a polynomial in n.",
      "assumptions": "Positive integer weights W ≤ n^O(1). A common polynomial bound B ≥ nW is supplied for choosing the small accuracy needed for the exact-factor integrality step; knowing n and W suffices. The rank-two incidence protocol is simulated with constant overhead on the original graph. Global Δ is unnecessary.",
      "paperId": "gen-beks19",
      "theorem": "Corollary 4.10 with rank f=2",
      "summary": "Instantiating the hypergraph result at rank two gives an exact factor-two weighted vertex cover in logarithmic rounds.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/1902.09377v2#page=9",
      "year": 2019,
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "prerequisite": "Common polynomial bound B ≥ nW",
      "approximationDisplay": "2",
      "roundsDisplay": "O(log n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log n)",
        "tex": "O(\\log n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/1902.09377v2#page=9",
            "title": "Optimal Distributed Covering Algorithms",
            "location": "Corollary 4.10 with rank f=2"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "General · exact factor 2 · logarithmic",
        "setting": "Weighted vertex cover on general graphs; deterministic CONGEST; exact ratio 2 in O(log n) rounds; positive polynomially bounded integer weights and a common polynomial bound B≥nW for the integrality step. Rank f=2 uses a constant-overhead incidence simulation.",
        "reason": "Corollary 4.10 gives the logarithmic-round exact-2 point, improving the 2018 bound by removing its additional degree-dependent factor. Faster 2+ε guarantees do not dominate exact factor 2; anonymous degree/weight-dependent exact-2 algorithms remain a different tradeoff.",
        "evidenceUrl": "https://arxiv.org/pdf/1902.09377v2#page=9",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-integer-polynomial",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "B",
          "description": "Supplied common polynomial upper bound on nW for the exact-factor integrality step",
          "tex": "B"
        },
        {
          "symbol": "W",
          "description": "Upper bound on positive integer input vertex weights; polynomial in n",
          "tex": "W"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-integer-polynomial",
          "input-common-nW-bound"
        ],
        "parameters": [],
        "assumptions": [],
        "detail": [
          "detail-exact-integrality",
          "detail-rank-two-simulation",
          "strength-no-global-degree"
        ],
        "covered": [
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-7f07455ff69b3b347e9b",
          "detail-exact-integrality",
          "detail-rank-two-simulation",
          "input-common-nW-bound",
          "strength-no-global-degree",
          "weights-integer-polynomial",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "paperId": "gen-kmw16",
      "variant": "Unweighted; constant or polylogarithmic approximation",
      "objective": "min",
      "graphClass": "General",
      "model": "LOCAL",
      "randomization": "Randomized",
      "bound": "lower",
      "approximation": "Constant or polylogarithmic factor",
      "rounds": "Ω(min{√(log n / log log n), log Δ / log log Δ})",
      "roundClass": "other",
      "parameters": "n is the number of vertices; Δ is the maximum degree. The exponents in polylogarithmic factors are fixed.",
      "assumptions": "Also applies to deterministic algorithms. Randomized lower bound concerns expected approximation with a fixed worst-case round budget. There are hard graph families; n and Δ are coupled by the construction, so this is not a guarantee for every independently prescribed pair (n, Δ).",
      "verification": "primary",
      "year": 2016,
      "id": "gen-kmw16-vc-lower",
      "problem": "Vertex cover",
      "theorem": "Theorems 13 and 14 (arXiv v2, PDF pp.20–21)",
      "summary": "The lower bound permits randomized algorithms, identifiers in {1,…,n}, and knowledge of n, Δ and the unlabelled network topology.",
      "sourceUrl": "https://arxiv.org/pdf/1011.5470v2#page=21",
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "general"
      },
      "approximationDisplay": "Constant or polylogarithmic factor",
      "roundsDisplay": "Ω(min{√(log n / log log n), log Δ / log log Δ})",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Ω(min{√(log n / log log n), log Δ / log log Δ})",
        "tex": "\\Omega\\!\\left(\\min\\!\\left\\{\\sqrt{\\frac{\\log n}{\\log\\log n}},\\frac{\\log\\Delta}{\\log\\log\\Delta}\\right\\}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/1011.5470v2#page=21",
            "title": "Local Computation: Lower and Upper Bounds",
            "location": "Theorems 13 and 14 (arXiv v2, PDF pp.20–21)"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-df5e493698da1468cb3b"
        ],
        "assumptions": [
          "auto-assumption-8ab2eb4fd98dcdd8e53c"
        ],
        "detail": [
          "detail-lower-approximation-range"
        ],
        "covered": [
          "auto-assumption-8ab2eb4fd98dcdd8e53c",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-output-7f07455ff69b3b347e9b",
          "auto-parameter-df5e493698da1468cb3b",
          "detail-lower-approximation-range",
          "weights-unweighted"
        ]
      }
    },
    {
      "paperId": "gen-kmw16",
      "variant": "Unweighted; constant or polylogarithmic approximation",
      "objective": "min",
      "graphClass": "General",
      "model": "LOCAL",
      "randomization": "Randomized",
      "bound": "lower",
      "approximation": "Constant or polylogarithmic factor",
      "rounds": "Ω(min{√(log n / log log n), log Δ / log log Δ})",
      "roundClass": "other",
      "parameters": "n is the number of vertices; Δ is the maximum degree. The exponents in polylogarithmic factors are fixed.",
      "assumptions": "Also applies to deterministic algorithms. Randomized lower bound concerns expected approximation with a fixed worst-case round budget. There are hard graph families; n and Δ are coupled by the construction, so this is not a guarantee for every independently prescribed pair (n, Δ).",
      "verification": "primary",
      "year": 2016,
      "id": "gen-kmw16-mds-lower",
      "problem": "Dominating set",
      "theorem": "Theorem 15 and Corollary 16 (arXiv v2, PDF pp.21–23)",
      "summary": "A locality-preserving line-graph reduction transfers the vertex-cover lower bound to minimum dominating set.",
      "sourceUrl": "https://arxiv.org/pdf/1011.5470v2#page=22",
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "general"
      },
      "approximationDisplay": "Constant or polylogarithmic factor",
      "roundsDisplay": "Ω(min{√(log n / log log n), log Δ / log log Δ})",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Ω(min{√(log n / log log n), log Δ / log log Δ})",
        "tex": "\\Omega\\!\\left(\\min\\!\\left\\{\\sqrt{\\frac{\\log n}{\\log\\log n}},\\frac{\\log\\Delta}{\\log\\log\\Delta}\\right\\}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/1011.5470v2#page=22",
            "title": "Local Computation: Lower and Upper Bounds",
            "location": "Theorem 15 and Corollary 16 (arXiv v2, PDF pp.21–23)"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-df5e493698da1468cb3b"
        ],
        "assumptions": [
          "auto-assumption-8ab2eb4fd98dcdd8e53c"
        ],
        "detail": [
          "detail-lower-approximation-range"
        ],
        "covered": [
          "auto-assumption-8ab2eb4fd98dcdd8e53c",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-df5e493698da1468cb3b",
          "detail-lower-approximation-range",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-large-50-dom",
      "paperId": "pic-bgpw-large-2025",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "K₂,t-minor-free",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "50",
      "rounds": "Oₜ(1)",
      "roundClass": "parameter",
      "parameters": "Fixed integer t ≥ 2.",
      "assumptions": "Distinct identifiers.",
      "theorem": "Theorem 4.1",
      "summary": "Ratio independent of t.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2504.01091v2",
      "year": 2025,
      "relatedResults": [
        "pic-thesis-pw2-dom"
      ],
      "algorithmFamily": "local-cutting-dominating-set-algorithm5",
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "k2t"
      },
      "graphClassSource": "K₂,ₜ-minor-free",
      "approximationDisplay": "50",
      "roundsDisplay": "O(t)",
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(t)",
        "tex": "O(t)",
        "basis": "stated",
        "explanation": "The original paper states Oₜ(1), while the thesis explicitly analyzes the same Algorithm 5 in O(t) rounds. It chooses the class control function F_t(r)=(5r+18)t; the remaining residual-diameter term is linear in t. The printed composition is 3 max{F_t(5)+2,F_t(11)+5}+g(t)+3, with g linear. This is an asymptotic bound, not a fully specified exact round count.",
        "evidence": [
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=125",
            "title": "Timothé Picavet’s doctoral thesis",
            "location": "Chapter IV, Theorem IV.3.1 and following explicit linear-in-t runtime analysis (PDF p. 125)"
          },
          {
            "url": "https://arxiv.org/html/2504.01091v2",
            "title": "Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors",
            "location": "Theorem 4.1, Lemma 4.2 and following runtime composition"
          }
        ],
        "parameters": [
          {
            "symbol": "t",
            "description": "Size of the second bipartition class of the excluded minor K₂,t; fixed integer t≥2",
            "tex": "t"
          }
        ],
        "checked": "2026-11-16",
        "audited": true,
        "displayInTable": true
      },
      "sota": {
        "scopeLabel": "Ratio independent of t; t ≥ 49",
        "setting": "Unweighted minimum dominating set on K₂,t-minor-free graphs; deterministic LOCAL; factor 50 against the integral optimum; round complexity O(t) independent of n for fixed t. The approximation ratio is independent of t.",
        "reason": "The original factor-50 Algorithm 5 applies for all fixed t≥2 and has O(t) rounds by the thesis’s explicit runtime analysis on PDF p. 125. Its historical SOTA review concerns t≥49, where the newer t+2 factor exceeds 50. It is now covered by the broader pathwidth-two excluded-minor theorem, using the certified identical H=K₂,t configuration and runtime. Smaller-t tradeoffs and original source provenance remain available.",
        "evidenceUrl": "https://arxiv.org/html/2504.01091v2",
        "checked": "2026-11-16",
        "conditionIds": [
          "claim-t-ge49"
        ]
      },
      "frontierComparisons": [
        {
          "better": "pic-thesis-pw2-dom",
          "worse": "pic-large-50-dom",
          "kind": "family-extension",
          "algorithmSpecialization": "algorithm5-k2t-specialization",
          "strict": [
            "graphClass"
          ],
          "parameterSubstitution": "H=K₂,t",
          "conditions": {
            "problem": "The same unweighted minimum dominating-set output and minimization objective.",
            "graphClass": "The broader parameterized theorem permits every fixed excluded H with pw(H)≤2; H=K₂,t recovers the original setting for every t≥2. Strictness concerns the family of allowed excluded-minor settings, not an arbitrary pair of fixed H and t. For example, H=C₅ has pathwidth two and its minor-free class contains K₂,s for arbitrarily large s; it is not contained in any fixed K₂,t-minor-free class.",
            "approximation": "The same factor 50, independent of the excluded graph parameter.",
            "rounds": "On H=K₂,t use the certified identical Algorithm 5 configuration and original O(t) communication schedule. The generic H-dependent proof bound is not compared with that schedule.",
            "model": "The same LOCAL communication model.",
            "randomness": "The same deterministic procedure.",
            "benchmark": "The same integral optimum.",
            "assumptions": "The same distinct identifiers and fixed excluded-minor setting; the original control function and radii are used on the mapped branch."
          },
          "evidenceUrl": "https://timothepicavet.fr/others/thesis.pdf#page=204",
          "reason": "Covered by the broader theorem: the K₂,t setting is the H=K₂,t branch of the same Algorithm 5 family, with the same O(t) implementation. The improvement is the larger family of excluded-minor settings, not faster rounds."
        }
      ],
      "dominatedBy": [
        "pic-thesis-pw2-dom"
      ],
      "frontierStatus": "dominated",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "t",
          "description": "Size of the second bipartition class of the excluded minor K₂,t; fixed integer t≥2",
          "tex": "t"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-bb37704c123e99aa335b",
          "weights-unweighted",
          "parameter-fixed-t-ge2"
        ],
        "parameters": [],
        "assumptions": [
          "auto-assumption-546f9427a7eb5183892d"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-546f9427a7eb5183892d",
          "auto-graph-bb37704c123e99aa335b",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "parameter-fixed-t-ge2",
          "parameter-t-integer-ge1",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-large-50-vc",
      "paperId": "pic-bgpw-large-2025",
      "problem": "Vertex cover",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "K₂,t-minor-free",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "50",
      "rounds": "Oₜ(1)",
      "roundClass": "parameter",
      "parameters": "Fixed integer t ≥ 2.",
      "assumptions": "",
      "theorem": "Theorem 4.1; extension after Theorem 4.3",
      "summary": "Ratio independent of t.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2504.01091v2",
      "year": 2025,
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "k2t"
      },
      "graphClassSource": "K₂,ₜ-minor-free",
      "approximationDisplay": "50",
      "roundsDisplay": "O(t)",
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(t)",
        "tex": "O(t)",
        "basis": "derived-from-stated-extension",
        "explanation": "The vertex-cover extension keeps the same local-cut radius, replacing interesting local 2-cuts by all local 2-cuts. Combining this unchanged radius and residual exploration with the thesis’s linear-in-t analysis gives O(t) rounds. This is derived from the stated extension; no exact integer total is claimed.",
        "evidence": [
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=125",
            "title": "Timothé Picavet’s doctoral thesis",
            "location": "Chapter IV, Theorem IV.3.1 and following explicit linear-in-t runtime analysis (PDF p. 125)"
          },
          {
            "url": "https://arxiv.org/html/2504.01091v2",
            "title": "Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors",
            "location": "Extension after Theorem 4.3; same local-cut radius"
          },
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=126",
            "title": "Timothé Picavet’s doctoral thesis",
            "location": "Vertex-cover extension following Theorem IV.3.3 (PDF p. 126)"
          }
        ],
        "parameters": [
          {
            "symbol": "t",
            "description": "Size of the second bipartition class of the excluded minor K₂,t; fixed integer t≥2",
            "tex": "t"
          }
        ],
        "checked": "2026-11-16",
        "audited": true,
        "displayInTable": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "t",
          "description": "Size of the second bipartition class of the excluded minor K₂,t; fixed integer t≥2",
          "tex": "t"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-bb37704c123e99aa335b",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-84a9fcdebc259dfe7099"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-bb37704c123e99aa335b",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-7f07455ff69b3b347e9b",
          "auto-parameter-84a9fcdebc259dfe7099",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-large-linear-dom",
      "paperId": "pic-bgpw-large-2025",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "K₂,t-minor-free",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "2t − 1",
      "rounds": "3",
      "roundClass": "constant",
      "parameters": "Integer t ≥ 2; rounds independent of t.",
      "assumptions": "",
      "theorem": "Theorem 4.4",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2504.01091v2",
      "year": 2025,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "k2t"
      },
      "graphClassSource": "K₂,ₜ-minor-free",
      "approximationDisplay": "2t − 1",
      "roundsDisplay": "3",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "3",
        "tex": "3",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2504.01091v2",
            "title": "Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors",
            "location": "Theorem 4.4"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "t",
          "description": "Size of the second bipartition class of the excluded minor K_{2,t}",
          "tex": "t"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-bb37704c123e99aa335b",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-a76c57eac2fe51c6e0c3"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-bb37704c123e99aa335b",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-a76c57eac2fe51c6e0c3",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-large-linear-vc",
      "paperId": "pic-bgpw-large-2025",
      "problem": "Vertex cover",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "K₂,t-minor-free",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "t",
      "rounds": "3",
      "roundClass": "constant",
      "parameters": "Integer t ≥ 2; rounds independent of t.",
      "assumptions": "",
      "theorem": "Theorem 4.4",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2504.01091v2",
      "year": 2025,
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "k2t"
      },
      "graphClassSource": "K₂,ₜ-minor-free",
      "approximationDisplay": "t",
      "roundsDisplay": "3",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "3",
        "tex": "3",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2504.01091v2",
            "title": "Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors",
            "location": "Theorem 4.4"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "t",
          "description": "Size of the second bipartition class of the excluded minor K_{2,t}",
          "tex": "t"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-bb37704c123e99aa335b",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-a76c57eac2fe51c6e0c3"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-bb37704c123e99aa335b",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-7f07455ff69b3b347e9b",
          "auto-parameter-a76c57eac2fe51c6e0c3",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-nice-planar-uniform",
      "paperId": "pic-bgpw-nice-2025",
      "problem": "Dominating set",
      "variant": "Unweighted; 4-uniform guarantee",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "302",
      "rounds": "5",
      "roundClass": "constant",
      "parameters": "",
      "assumptions": "",
      "theorem": "Proposition 5",
      "summary": "Uniformity supports transfer to other graph classes.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2507.04960v1",
      "year": 2025,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "302",
      "roundsDisplay": "5",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "5",
        "tex": "5",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2507.04960v1",
            "title": "Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs",
            "location": "Proposition 5"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [],
        "assumptions": [],
        "detail": [
          "detail-four-uniform"
        ],
        "covered": [
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "detail-four-uniform",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-nice-localgenus",
      "paperId": "pic-bgpw-nice-2025",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Asymptotic dimension d; radius-r balls of Euler genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "35(d + 1)",
      "rounds": "C(d,g,r)",
      "roundClass": "parameter",
      "parameters": "Fixed d,g,r and dimensional control function; r sufficiently large.",
      "assumptions": "Every radius-r induced ball lies in the Euler-genus-g class.",
      "theorem": "Theorem 8",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2507.04960v1",
      "year": 2025,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "local-genus",
        "note": "Asymptotic dimension, its control function and sufficiently large local radius remain fixed prerequisites."
      },
      "graphClassSource": "Asymptotic dimension d; sufficiently large-radius neighborhoods of Euler genus ≤ g",
      "approximationDisplay": "35(d + 1)",
      "roundsDisplay": "f(d, g, r)",
      "roundParameters": [
        {
          "symbol": "d",
          "name": "asymptotic dimension",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "g",
          "name": "local genus",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "r",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "partial",
        "formula": "T + δ + 2, where T = F(2u+2) + max{u+1, b}",
        "tex": "T+\\delta+2,\\qquad T=F(2u+2)+\\max\\{u+1,b\\}",
        "basis": "stated-composition",
        "explanation": "Theorem 8 gives a class-dependent constant and applies Proposition 2 to Theorem 7. Proposition 3 does give a precise generic composition, but the dimensional control function and the genus base runtime are not reduced to closed expressions in the displayed parameters. The local-genus row therefore has no computed full formula to substitute for f(d,g,r).",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2507.04960v1",
            "title": "Approximation Algorithms for Dominating Set on Locally Nice Graph Classes",
            "location": "Proposition 3; Theorems 7 and 8; Claim 4"
          }
        ],
        "parameters": [
          {
            "symbol": "T",
            "description": "Intermediate algorithm radius from the displayed composition",
            "tex": "T"
          },
          {
            "symbol": "δ",
            "description": "Upper bound on weak diameters of the local error components",
            "tex": "\\delta"
          },
          {
            "symbol": "F",
            "description": "Dimensional control function of the target graph class",
            "tex": "F"
          },
          {
            "symbol": "u",
            "description": "Uniformity radius of the base algorithm",
            "tex": "u"
          },
          {
            "symbol": "b",
            "description": "Round complexity of the base algorithm",
            "tex": "b"
          }
        ],
        "checked": "2026-11-16",
        "audited": true,
        "expression": {
          "formula": "T + δ + 2",
          "tex": "T+\\delta+2"
        },
        "suffix": {
          "formula": ", where T = F(2u+2) + max{u+1, b}",
          "tex": ",\\qquad T=F(2u+2)+\\max\\{u+1,b\\}"
        }
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "F",
          "description": "Dimensional control function of the target graph class",
          "tex": "F"
        },
        {
          "symbol": "T",
          "description": "Intermediate algorithm radius from the displayed composition",
          "tex": "T"
        },
        {
          "symbol": "b",
          "description": "Round complexity of the base algorithm",
          "tex": "b"
        },
        {
          "symbol": "d",
          "description": "Asymptotic dimension bound of the graph class",
          "tex": "d"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound for the radius-r balls after any stated apex deletions",
          "tex": "g"
        },
        {
          "symbol": "r",
          "description": "Fixed sufficiently large radius of the neighborhoods used in the local-class assumption",
          "tex": "r"
        },
        {
          "symbol": "u",
          "description": "Uniformity radius of the base algorithm",
          "tex": "u"
        },
        {
          "symbol": "δ",
          "description": "Upper bound on weak diameters of the local error components",
          "tex": "\\delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-cc88dac74423991e2fb4",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-9e294b6fa3a897ed9cf2"
        ],
        "assumptions": [
          "auto-assumption-366645571a60ecd2fcf3"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-366645571a60ecd2fcf3",
          "auto-graph-cc88dac74423991e2fb4",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-9e294b6fa3a897ed9cf2",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-kdom-genus-constant",
      "paperId": "pic-chww-kdom-2017",
      "problem": "k-domination (outside the solution)",
      "variant": "k neighbors required only outside the solution",
      "objective": "min",
      "graphClass": "Orientable genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "Oₖ,𝗀(1)",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "Fixed k ≥ 2 and g.",
      "assumptions": "",
      "theorem": "Corollary 3",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://ceur-ws.org/Vol-1949/ICTCSpaper05.pdf",
      "year": 2017,
      "problemScope": {
        "node": "outside-k-domination"
      },
      "problemParameter": "k",
      "problemParameterName": "required neighbors outside the solution",
      "problemSource": "k-tuple dominating set",
      "graphScope": {
        "node": "orientable",
        "note": "The historical record does not establish applicability to every bounded Euler-genus family."
      },
      "approximationDisplay": "f(g, k)",
      "roundsDisplay": "≤ 2",
      "approximationParameters": [
        {
          "symbol": "g",
          "name": "orientable genus",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "k",
          "name": "domination multiplicity",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundCountEvidence": {
        "basis": "phase-count",
        "explanation": "Round 1 obtains the local degree if necessary and tests the threshold L. Round 2 exchanges threshold-membership flags; every unselected vertex with fewer than k selected neighbors then selects itself. The fixed parameters g and k determine L through local computation. The approximation factor depends on them, while this communication bound does not.",
        "evidence": [
          {
            "url": "https://ceur-ws.org/Vol-1949/ICTCSpaper05.pdf#page=5",
            "title": "Primary source algorithm",
            "location": "Procedure 1 PDF p. 5; Corollary 3 p. 6"
          }
        ],
        "rounds": "≤ 2",
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "≤ 2",
        "tex": "\\le 2",
        "basis": "phase-count",
        "explanation": "Round 1 obtains the local degree if necessary and tests the threshold L. Round 2 exchanges threshold-membership flags; every unselected vertex with fewer than k selected neighbors then selects itself. The fixed parameters g and k determine L through local computation. The approximation factor depends on them, while this communication bound does not.",
        "evidence": [
          {
            "url": "https://ceur-ws.org/Vol-1949/ICTCSpaper05.pdf#page=5",
            "title": "Primary source algorithm",
            "location": "Procedure 1 PDF p. 5; Corollary 3 p. 6"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Orientable genus upper bound",
          "tex": "g",
          "sourceSymbol": "𝗀"
        },
        {
          "symbol": "k",
          "description": "Required number of neighbors in the solution for each vertex outside it",
          "tex": "k"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-924a81ff2b56320e8d33",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-b6e4f4217a140a655edf"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-924a81ff2b56320e8d33",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b54ac6401a901b9d3590",
          "auto-parameter-b6e4f4217a140a655edf",
          "output-outside-k",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-kdom-linkless-constant",
      "paperId": "pic-chww-kdom-2017",
      "problem": "k-domination (outside the solution)",
      "variant": "k neighbors required only outside the solution",
      "objective": "min",
      "graphClass": "Linklessly embeddable",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "Oₖ(1)",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "Fixed k ≥ 3.",
      "assumptions": "",
      "theorem": "Corollary 2",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://ceur-ws.org/Vol-1949/ICTCSpaper05.pdf",
      "year": 2017,
      "problemScope": {
        "node": "outside-k-domination"
      },
      "problemParameter": "k",
      "problemParameterName": "required neighbors outside the solution",
      "problemSource": "k-tuple dominating set",
      "graphScope": {
        "node": "linkless"
      },
      "approximationDisplay": "f(k)",
      "roundsDisplay": "≤ 2",
      "approximationParameters": [
        {
          "symbol": "k",
          "name": "domination multiplicity",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundCountEvidence": {
        "basis": "phase-count",
        "explanation": "The same threshold procedure uses at most two rounds: obtain the local degree if necessary, then exchange selection flags and add vertices with fewer than k selected neighbors. The source uses fixed k ≥ 3 and h = 4. These parameters affect the local threshold and approximation factor, not the number of rounds.",
        "evidence": [
          {
            "url": "https://ceur-ws.org/Vol-1949/ICTCSpaper05.pdf#page=5",
            "title": "Primary source algorithm",
            "location": "Procedure 1 PDF p. 5; Corollary 2 p. 6"
          }
        ],
        "rounds": "≤ 2",
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "≤ 2",
        "tex": "\\le 2",
        "basis": "phase-count",
        "explanation": "The same threshold procedure uses at most two rounds: obtain the local degree if necessary, then exchange selection flags and add vertices with fewer than k selected neighbors. The source uses fixed k ≥ 3 and h = 4. These parameters affect the local threshold and approximation factor, not the number of rounds.",
        "evidence": [
          {
            "url": "https://ceur-ws.org/Vol-1949/ICTCSpaper05.pdf#page=5",
            "title": "Primary source algorithm",
            "location": "Procedure 1 PDF p. 5; Corollary 2 p. 6"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "k",
          "description": "Required number of neighbors in the solution for each vertex outside it",
          "tex": "k"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-1c8015ba8785f64fced9",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-b8fdbb33beabe4183121"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-1c8015ba8785f64fced9",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b54ac6401a901b9d3590",
          "auto-parameter-b8fdbb33beabe4183121",
          "output-outside-k",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-kdom-topological44",
      "paperId": "pic-chww-kdom-2017",
      "problem": "2-domination (outside the solution)",
      "variant": "k neighbors required only outside the solution",
      "objective": "min",
      "graphClass": "No K₄,₄ subdivision",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "O(1)",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "k = 2.",
      "assumptions": "",
      "theorem": "Theorem 7",
      "summary": "Includes linklessly embeddable graphs.",
      "verification": "primary",
      "sourceUrl": "https://ceur-ws.org/Vol-1949/ICTCSpaper05.pdf",
      "year": 2017,
      "problemScope": {
        "node": "outside-k-domination"
      },
      "problemParameter": "2",
      "problemParameterName": "required neighbors outside the solution",
      "problemSource": "k-tuple dominating set",
      "graphScope": {
        "node": "no-k44"
      },
      "graphClassSource": "No subdivision of K₄,₄",
      "approximationDisplay": "Constant",
      "roundsDisplay": "≤ 6",
      "roundCountEvidence": {
        "basis": "phase-count",
        "explanation": "Rounds 1–2 obtain neighbor lists and decide D1 by radius-two information. Round 3 broadcasts D1; compute two-domination flags Z. Round 4 broadcasts Z; compute residual open-neighborhood degrees. Round 5 broadcasts these degrees; vertices outside Z choose one or two neighbors as prescribed. Round 6 notifies the chosen neighbors. Distinct IDs in the source LOCAL model; unbounded messages. All thresholds are fixed numerical constants for excluded TK4,4.",
        "evidence": [
          {
            "url": "https://ceur-ws.org/Vol-1949/ICTCSpaper05.pdf#page=6",
            "title": "Primary source algorithm",
            "location": "Procedure 2 PDF p. 6; radius-two remark p. 7; Theorem 7 p. 8"
          }
        ],
        "rounds": "≤ 6",
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "≤ 6",
        "tex": "\\le 6",
        "basis": "phase-count",
        "explanation": "Rounds 1–2 obtain neighbor lists and decide D1 by radius-two information. Round 3 broadcasts D1; compute two-domination flags Z. Round 4 broadcasts Z; compute residual open-neighborhood degrees. Round 5 broadcasts these degrees; vertices outside Z choose one or two neighbors as prescribed. Round 6 notifies the chosen neighbors. Distinct IDs in the source LOCAL model; unbounded messages. All thresholds are fixed numerical constants for excluded TK4,4.",
        "evidence": [
          {
            "url": "https://ceur-ws.org/Vol-1949/ICTCSpaper05.pdf#page=6",
            "title": "Primary source algorithm",
            "location": "Procedure 2 PDF p. 6; radius-two remark p. 7; Theorem 7 p. 8"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "2",
          "description": "Required neighbors outside the solution",
          "tex": "2"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-f0d82e6adc6c5f65d541",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-cd4920bb34139c49b8f8"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-f0d82e6adc6c5f65d541",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-ef1b974b591df8f63ec3",
          "auto-parameter-cd4920bb34139c49b8f8",
          "output-outside-k",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-kdom-genus-ptas",
      "paperId": "pic-chww-kdom-2017",
      "problem": "k-domination (outside the solution)",
      "variant": "k neighbors required only outside the solution",
      "objective": "min",
      "graphClass": "Orientable genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "Oₖ,𝗀,ε(log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed k ≥ 2, g and ε > 0.",
      "assumptions": "",
      "theorem": "Corollary 11",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://ceur-ws.org/Vol-1949/ICTCSpaper05.pdf",
      "year": 2017,
      "problemScope": {
        "node": "outside-k-domination"
      },
      "problemParameter": "k",
      "problemParameterName": "required neighbors outside the solution",
      "problemSource": "k-tuple dominating set",
      "graphScope": {
        "node": "orientable",
        "note": "The historical record does not establish applicability to every bounded Euler-genus family."
      },
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "Oₖ,𝗀,ε(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Oₖ,𝗀,ε(log* n)",
        "tex": "O_{k,g,\\varepsilon}(\\log^*n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://ceur-ws.org/Vol-1949/ICTCSpaper05.pdf",
            "title": "Distributed approximation algorithms for k-dominating set in graphs of bounded genus and linklessly embeddable graphs",
            "location": "Corollary 11"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "g",
          "description": "Orientable genus upper bound",
          "tex": "g",
          "sourceSymbol": "𝗀"
        },
        {
          "symbol": "k",
          "description": "Required number of neighbors in the solution for each vertex outside it",
          "tex": "k"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-924a81ff2b56320e8d33",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-741134fe129c5a0fa776"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-924a81ff2b56320e8d33",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b54ac6401a901b9d3590",
          "auto-parameter-741134fe129c5a0fa776",
          "output-outside-k",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-kdom-linkless-ptas",
      "paperId": "pic-chww-kdom-2017",
      "problem": "k-domination (outside the solution)",
      "variant": "k neighbors required only outside the solution",
      "objective": "min",
      "graphClass": "Linklessly embeddable",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "Oₖ,ε(log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed k ≥ 2 and ε > 0.",
      "assumptions": "",
      "theorem": "Corollary 12",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://ceur-ws.org/Vol-1949/ICTCSpaper05.pdf",
      "year": 2017,
      "problemScope": {
        "node": "outside-k-domination"
      },
      "problemParameter": "k",
      "problemParameterName": "required neighbors outside the solution",
      "problemSource": "k-tuple dominating set",
      "graphScope": {
        "node": "linkless"
      },
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "Oₖ,ε(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Oₖ,ε(log* n)",
        "tex": "O_{k,\\varepsilon}(\\log^*n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://ceur-ws.org/Vol-1949/ICTCSpaper05.pdf",
            "title": "Distributed approximation algorithms for k-dominating set in graphs of bounded genus and linklessly embeddable graphs",
            "location": "Corollary 12"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "k",
          "description": "Required number of neighbors in the solution for each vertex outside it",
          "tex": "k"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-1c8015ba8785f64fced9",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-a5230659d3c4bcfedc87"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-1c8015ba8785f64fced9",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b54ac6401a901b9d3590",
          "auto-parameter-a5230659d3c4bcfedc87",
          "output-outside-k",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-genus-broadcast-historical",
      "paperId": "pic-chww-broadcast-2019",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Orientable genus ≤ g",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "O𝗀(1)",
      "rounds": "10",
      "roundClass": "constant",
      "parameters": "Fixed g.",
      "assumptions": "CONGEST_BC: each vertex broadcasts the same O(log n)-bit message to neighbors.",
      "theorem": "Abstract; Lemma 10",
      "summary": "Publisher text specifies ten rounds.",
      "verification": "primary",
      "sourceUrl": "https://www.sciencedirect.com/science/article/pii/S0304397518304894",
      "year": 2019,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "orientable",
        "note": "The historical record does not establish applicability to every bounded Euler-genus family."
      },
      "graphClassSource": "Bounded orientable genus g",
      "approximationDisplay": "f(g)",
      "roundsDisplay": "10",
      "approximationParameters": [
        {
          "symbol": "g",
          "name": "orientable genus",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "10",
        "tex": "10",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://www.sciencedirect.com/science/article/pii/S0304397518304894",
            "title": "Distributed CONGEST_BC constant approximation of MDS in bounded genus graphs",
            "location": "Abstract; Lemma 10"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Orientable genus upper bound",
          "tex": "g",
          "sourceSymbol": "𝗀"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-924a81ff2b56320e8d33",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-2f1626f8ddeafbffccc4"
        ],
        "assumptions": [
          "auto-assumption-6b02bb84a23eb80caedf"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-6b02bb84a23eb80caedf",
          "auto-graph-924a81ff2b56320e8d33",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-2f1626f8ddeafbffccc4",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-girth-dom-2019",
      "paperId": "pic-aw-girth-2019",
      "problem": "Distance-r dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Expansion f; girth ≥ 4r + 3",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "O(r f(r))",
      "rounds": "O(r)",
      "roundClass": "parameter",
      "parameters": "Fixed radius r and expansion function f.",
      "assumptions": "",
      "theorem": "Theorem 1",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/1910.02794",
      "year": 2019,
      "problemScope": {
        "node": "distance-dominating-set"
      },
      "problemParameter": "r",
      "problemParameterName": "distance radius",
      "problemSource": "Distance dominating set",
      "graphScope": {
        "node": "girth-expansion",
        "note": "The girth threshold remains required for the stated distance parameter."
      },
      "approximationDisplay": "O(r f(r))",
      "roundsDisplay": "O(r)",
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(r)",
        "tex": "O(r)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/1910.02794",
            "title": "Distributed Distance-r Dominating Set on Sparse High-Girth Graphs",
            "location": "Theorem 1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f(r)",
          "description": "Upper bound on the edge-to-vertex ratio after deleting vertices and contracting disjoint subgraphs of the stated radius",
          "tex": "f(r)"
        },
        {
          "symbol": "f",
          "description": "Expansion function bounding edge-to-vertex ratios after bounded-radius contractions",
          "tex": "f"
        },
        {
          "symbol": "r",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "r"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-2c2b44d50352f53722f0",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-0bb6a4815f4c4715a933"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-2c2b44d50352f53722f0",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-4bc26b2a562297a647e1",
          "auto-parameter-0bb6a4815f4c4715a933",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-girth-cycle-lower",
      "paperId": "pic-aw-girth-2019",
      "problem": "Distance-r dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Cycles of length at least 4r + 3",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "approximation": "No (2r + 1 − δ)-approximation",
      "rounds": "O(r)",
      "roundClass": "parameter",
      "parameters": "Fixed ε > 0; r > 1 and r = o(log* n).",
      "assumptions": "For fixed r this excludes constant-round algorithms.",
      "theorem": "Theorem 2",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/1910.02794",
      "year": 2019,
      "roundBudgetExcluded": true,
      "problemScope": {
        "node": "distance-dominating-set"
      },
      "problemParameter": "r",
      "problemParameterName": "distance radius",
      "problemSource": "Distance dominating set",
      "graphScope": {
        "node": "long-cycle"
      },
      "notationChanges": [
        {
          "name": "accuracy",
          "sourceSymbol": "δ",
          "symbol": "ε"
        }
      ],
      "parametersSource": "Fixed δ > 0; r > 1 and r = o(log* n).",
      "approximationDisplay": "> 2r + 1 − ε",
      "roundsDisplay": "O(r)",
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(r)",
        "tex": "O(r)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/1910.02794",
            "title": "Distributed Distance-r Dominating Set on Sparse High-Girth Graphs",
            "location": "Theorem 2"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "long-cycle-distance-factor",
          "resultId": "pic-girth-cycle-lower",
          "graphs": [
            "long-cycle"
          ],
          "problems": [
            "distance-dominating-set"
          ],
          "models": [
            "LOCAL",
            "CONGEST"
          ],
          "conditionIds": [
            "scope-radius-r-sublogstar"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "r"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-5bf5bfc6dd710f349d27",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-8f111cac3e93af500567"
        ],
        "assumptions": [
          "auto-assumption-021b0a56919f5f4e6bfb"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-021b0a56919f5f4e6bfb",
          "auto-graph-5bf5bfc6dd710f349d27",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-4bc26b2a562297a647e1",
          "auto-parameter-8f111cac3e93af500567",
          "scope-radius-r-sublogstar",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-girth-cover-dom",
      "paperId": "pic-aw-covering-2022",
      "problem": "Distance-r dominating set",
      "variant": "Distance r",
      "objective": "min",
      "graphClass": "Bounded expansion; girth ≥ 4r + 2",
      "model": "CONGEST",
      "randomization": "Unspecified",
      "bound": "upper",
      "approximation": "O(1)",
      "rounds": "O(1)",
      "roundClass": "parameter",
      "parameters": "Fixed r and graph class.",
      "assumptions": "Abstract-level record; see paper for problem definitions.",
      "theorem": "Abstract",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://www.sciencedirect.com/science/article/pii/S0304397522000081",
      "year": 2022,
      "problemScope": {
        "node": "distance-dominating-set"
      },
      "problemParameter": "r",
      "problemParameterName": "distance radius",
      "problemSource": "Distance dominating set",
      "graphScope": {
        "node": "girth-expansion",
        "note": "The girth threshold remains required for the stated distance parameter."
      },
      "approximationDisplay": "F(r, f)",
      "roundsDisplay": "F(r, f)",
      "approximationParameters": [
        {
          "symbol": "r",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "f",
          "name": "expansion function",
          "introduced": false,
          "displaySymbol": true
        }
      ],
      "roundParameters": [
        {
          "symbol": "r",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "f",
          "name": "expansion function",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "F(r, f)",
        "tex": "F\\bigl(r,f\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://www.sciencedirect.com/science/article/pii/S0304397522000081",
            "title": "Distributed distance-r covering problems on sparse high-girth graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "F",
          "description": "Unspecified function of the displayed parameters",
          "tex": "F"
        },
        {
          "symbol": "f",
          "description": "Expansion function bounding shallow-minor edge densities at each radius",
          "tex": "f",
          "sourceSymbol": "class"
        },
        {
          "symbol": "r",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "r"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-915afc773f0aa3fac5c2",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-af57e23573dcc3ca99da"
        ],
        "assumptions": [
          "auto-assumption-1438241cdaf269b6f219"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-1438241cdaf269b6f219",
          "auto-graph-915afc773f0aa3fac5c2",
          "auto-model-37b353da5fa68eebd709",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-4bc26b2a562297a647e1",
          "auto-parameter-af57e23573dcc3ca99da",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-girth-cover-connected-dom",
      "paperId": "pic-aw-covering-2022",
      "problem": "Connected distance-r dominating set",
      "variant": "Distance-r connected domination",
      "objective": "min",
      "graphClass": "Bounded expansion; girth ≥ 4r + 2",
      "model": "CONGEST",
      "randomization": "Unspecified",
      "bound": "upper",
      "approximation": "O(1)",
      "rounds": "O(1)",
      "roundClass": "parameter",
      "parameters": "Fixed r and graph class.",
      "assumptions": "Abstract-level record; see paper for problem definitions.",
      "theorem": "Abstract",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://www.sciencedirect.com/science/article/pii/S0304397522000081",
      "year": 2022,
      "problemScope": {
        "node": "connected-distance-dominating-set"
      },
      "problemParameter": "r",
      "problemParameterName": "distance radius",
      "problemSource": "Connected dominating set",
      "graphScope": {
        "node": "girth-expansion",
        "note": "The girth threshold remains required for the stated distance parameter."
      },
      "approximationDisplay": "F(r, f)",
      "roundsDisplay": "F(r, f)",
      "approximationParameters": [
        {
          "symbol": "r",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "f",
          "name": "expansion function",
          "introduced": false,
          "displaySymbol": true
        }
      ],
      "roundParameters": [
        {
          "symbol": "r",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "f",
          "name": "expansion function",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "F(r, f)",
        "tex": "F\\bigl(r,f\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://www.sciencedirect.com/science/article/pii/S0304397522000081",
            "title": "Distributed distance-r covering problems on sparse high-girth graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "F",
          "description": "Unspecified function of the displayed parameters",
          "tex": "F"
        },
        {
          "symbol": "f",
          "description": "Expansion function bounding shallow-minor edge densities at each radius",
          "tex": "f",
          "sourceSymbol": "class"
        },
        {
          "symbol": "r",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "r"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-915afc773f0aa3fac5c2",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-af57e23573dcc3ca99da"
        ],
        "assumptions": [
          "auto-assumption-1438241cdaf269b6f219"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-1438241cdaf269b6f219",
          "auto-graph-915afc773f0aa3fac5c2",
          "auto-model-37b353da5fa68eebd709",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-f0d9c1f064503cf5f16e",
          "auto-parameter-af57e23573dcc3ca99da",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-girth-cover-vc",
      "paperId": "pic-aw-covering-2022",
      "problem": "Distance-r vertex cover",
      "variant": "",
      "objective": "min",
      "graphClass": "Bounded expansion; girth ≥ 4r + 2",
      "model": "CONGEST",
      "randomization": "Unspecified",
      "bound": "upper",
      "approximation": "O(1)",
      "rounds": "O(1)",
      "roundClass": "parameter",
      "parameters": "Fixed r and graph class.",
      "assumptions": "Abstract-level record; see paper for problem definitions.",
      "theorem": "Abstract",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://www.sciencedirect.com/science/article/pii/S0304397522000081",
      "year": 2022,
      "problemSource": "Vertex cover",
      "variantSource": "Distance-r vertex cover",
      "problemScope": {
        "node": "distance-vertex-cover"
      },
      "problemParameter": "r",
      "problemParameterName": "distance radius",
      "graphScope": {
        "node": "girth-expansion",
        "note": "The girth threshold remains required for the stated distance parameter."
      },
      "approximationDisplay": "F(r, f)",
      "roundsDisplay": "F(r, f)",
      "approximationParameters": [
        {
          "symbol": "r",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "f",
          "name": "expansion function",
          "introduced": false,
          "displaySymbol": true
        }
      ],
      "roundParameters": [
        {
          "symbol": "r",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "f",
          "name": "expansion function",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "F(r, f)",
        "tex": "F\\bigl(r,f\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://www.sciencedirect.com/science/article/pii/S0304397522000081",
            "title": "Distributed distance-r covering problems on sparse high-girth graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unspecified",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "F",
          "description": "Unspecified function of the displayed parameters",
          "tex": "F"
        },
        {
          "symbol": "f",
          "description": "Expansion function bounding shallow-minor edge densities at each radius",
          "tex": "f",
          "sourceSymbol": "class"
        },
        {
          "symbol": "r",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "r"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-915afc773f0aa3fac5c2",
          "weights-unspecified"
        ],
        "parameters": [
          "auto-parameter-af57e23573dcc3ca99da"
        ],
        "assumptions": [
          "auto-assumption-1438241cdaf269b6f219"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-1438241cdaf269b6f219",
          "auto-graph-915afc773f0aa3fac5c2",
          "auto-model-37b353da5fa68eebd709",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-be4082e563d6ac3c12d9",
          "auto-parameter-af57e23573dcc3ca99da",
          "weights-unspecified"
        ]
      }
    },
    {
      "id": "pic-girth-cover-connected-vc",
      "paperId": "pic-aw-covering-2022",
      "problem": "Distance-r connected vertex cover",
      "variant": "",
      "objective": "min",
      "graphClass": "Bounded expansion; girth ≥ 4r + 2",
      "model": "CONGEST",
      "randomization": "Unspecified",
      "bound": "upper",
      "approximation": "O(1)",
      "rounds": "O(1)",
      "roundClass": "parameter",
      "parameters": "Fixed r and graph class.",
      "assumptions": "Abstract-level record; see paper for problem definitions.",
      "theorem": "Abstract",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://www.sciencedirect.com/science/article/pii/S0304397522000081",
      "year": 2022,
      "problemSource": "Vertex cover",
      "variantSource": "Distance-r connected vertex cover",
      "problemScope": {
        "node": "connected-distance-vertex-cover"
      },
      "problemParameter": "r",
      "problemParameterName": "distance radius",
      "graphScope": {
        "node": "girth-expansion",
        "note": "The girth threshold remains required for the stated distance parameter."
      },
      "approximationDisplay": "F(r, f)",
      "roundsDisplay": "F(r, f)",
      "approximationParameters": [
        {
          "symbol": "r",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "f",
          "name": "expansion function",
          "introduced": false,
          "displaySymbol": true
        }
      ],
      "roundParameters": [
        {
          "symbol": "r",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "f",
          "name": "expansion function",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "F(r, f)",
        "tex": "F\\bigl(r,f\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://www.sciencedirect.com/science/article/pii/S0304397522000081",
            "title": "Distributed distance-r covering problems on sparse high-girth graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unspecified",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "F",
          "description": "Unspecified function of the displayed parameters",
          "tex": "F"
        },
        {
          "symbol": "f",
          "description": "Expansion function bounding shallow-minor edge densities at each radius",
          "tex": "f",
          "sourceSymbol": "class"
        },
        {
          "symbol": "r",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "r"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-915afc773f0aa3fac5c2",
          "weights-unspecified"
        ],
        "parameters": [
          "auto-parameter-af57e23573dcc3ca99da"
        ],
        "assumptions": [
          "auto-assumption-1438241cdaf269b6f219"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-1438241cdaf269b6f219",
          "auto-graph-915afc773f0aa3fac5c2",
          "auto-model-37b353da5fa68eebd709",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-d3386db78d70530c7ff1",
          "auto-parameter-af57e23573dcc3ca99da",
          "weights-unspecified"
        ]
      }
    },
    {
      "id": "pic-distance-k2t-constant",
      "paperId": "pic-chw-distance-2022",
      "problem": "Distance-k dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "K₂,t-minor-free",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "Oₖ,ₜ(1)",
      "rounds": "O(k)",
      "roundClass": "parameter",
      "parameters": "Fixed radius k and integer t.",
      "assumptions": "Connected graph; diameter ≥ 4k.",
      "theorem": "Theorem 15",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2203.03229",
      "year": 2022,
      "problemScope": {
        "node": "distance-dominating-set"
      },
      "problemParameter": "k",
      "problemParameterName": "distance radius",
      "problemSource": "Distance dominating set",
      "graphScope": {
        "node": "k2t"
      },
      "graphClassSource": "K₂,ₜ-minor-free",
      "prerequisite": "Connected; diameter ≥ 4k",
      "approximationDisplay": "f(k, t)",
      "roundsDisplay": "O(k)",
      "approximationParameters": [
        {
          "symbol": "k",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "t",
          "name": "excluded minor size",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(k)",
        "tex": "O(k)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2203.03229",
            "title": "Distributed distance domination in graphs with no K₂,ₜ-minor",
            "location": "Theorem 15"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "k",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "k"
        },
        {
          "symbol": "t",
          "description": "Size of the second bipartition class of the excluded minor K_{2,t}",
          "tex": "t"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-bb37704c123e99aa335b",
          "weights-unweighted",
          "input-connected-diameter-four-k"
        ],
        "parameters": [
          "auto-parameter-dc252bf1c14e8e232a95"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-bb37704c123e99aa335b",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-22413995976b0346df27",
          "auto-parameter-dc252bf1c14e8e232a95",
          "input-connected",
          "input-connected-diameter-four-k",
          "input-diameter-four-k",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-distance-k2t-ptas",
      "paperId": "pic-chw-distance-2022",
      "problem": "Distance-k dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "K₂,t-minor-free",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "Oₖ,ₜ,ε(log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed k,t and 0 < ε < 1.",
      "assumptions": "Connected graph; diameter ≥ 4k.",
      "theorem": "Theorem 18",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2203.03229",
      "year": 2022,
      "problemScope": {
        "node": "distance-dominating-set"
      },
      "problemParameter": "k",
      "problemParameterName": "distance radius",
      "problemSource": "Distance dominating set",
      "graphScope": {
        "node": "k2t"
      },
      "graphClassSource": "K₂,ₜ-minor-free",
      "prerequisite": "Connected; diameter ≥ 4k",
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "Oₖ,ₜ,ε(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Oₖ,ₜ,ε(log* n)",
        "tex": "O_{k,t,\\varepsilon}(\\log^*n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2203.03229",
            "title": "Distributed distance domination in graphs with no K₂,ₜ-minor",
            "location": "Theorem 18"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "k",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "k"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "t",
          "description": "Size of the second bipartition class of the excluded minor K_{2,t}",
          "tex": "t"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-bb37704c123e99aa335b",
          "weights-unweighted",
          "input-connected-diameter-four-k"
        ],
        "parameters": [
          "auto-parameter-d4d4c3f4968560101dad"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-bb37704c123e99aa335b",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-22413995976b0346df27",
          "auto-parameter-d4d4c3f4968560101dad",
          "input-connected",
          "input-connected-diameter-four-k",
          "input-diameter-four-k",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-distance-minor-ptas",
      "paperId": "pic-chw-distance-2022",
      "problem": "Distance-k dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Kₜ-minor-free; γ₁(G) ≤ Cγₖ(G)",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "O_C,k,t,ε(log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed C,k,t,ε; 0 < ε < 1.",
      "assumptions": "C,k,t known; includes bounded-degree minor-free classes.",
      "theorem": "Theorem 19",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2203.03229",
      "year": 2022,
      "problemScope": {
        "node": "distance-dominating-set"
      },
      "problemParameter": "k",
      "problemParameterName": "distance radius",
      "problemSource": "Distance dominating set",
      "graphScope": {
        "node": "minor-domination",
        "note": "Requires the stated relation between domination numbers."
      },
      "prerequisite": "Known C, k, t; domination constraint",
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "O_C,k,t,ε(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O_C,k,t,ε(log* n)",
        "tex": "O_{C,k,t,\\varepsilon}(\\log^*n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2203.03229",
            "title": "Distributed distance domination in graphs with no K₂,ₜ-minor",
            "location": "Theorem 19"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "γ₁(G)",
          "description": "Minimum cardinality of an ordinary dominating set of G",
          "tex": "\\gamma_1(G)"
        },
        {
          "symbol": "γₖ(G)",
          "description": "Minimum cardinality of a distance-k dominating set of G",
          "tex": "\\gamma_k(G)"
        },
        {
          "symbol": "C",
          "description": "Supplied positive integer comparison constant satisfying γ₁(G)≤Cγₖ(G)",
          "tex": "C"
        },
        {
          "symbol": "G",
          "description": "Input graph",
          "tex": "G"
        },
        {
          "symbol": "k",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "k"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "t",
          "description": "Number of vertices in the excluded complete minor K_t",
          "tex": "t"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-bcec1760a63c4cbb99b7",
          "weights-unweighted",
          "input-C-k-t-domination"
        ],
        "parameters": [
          "auto-parameter-e4817656513cd78376c7"
        ],
        "assumptions": [
          "auto-assumption-96d7175a2aee97a5e9b2"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-96d7175a2aee97a5e9b2",
          "auto-graph-bcec1760a63c4cbb99b7",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-22413995976b0346df27",
          "auto-parameter-e4817656513cd78376c7",
          "input-C-k-t-domination",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-girth-pruning",
      "paperId": "pic-lw-girth-2024",
      "problem": "Distance-k dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Connected; k-hop expansion ≤ f(k); girth ≥ 4k + 3",
      "model": "Anonymous",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "2k f(k) + 1",
      "rounds": "k",
      "roundClass": "parameter",
      "parameters": "Fixed radius k.",
      "assumptions": "Port numbering; empty messages suffice.",
      "theorem": "Theorem 1.1",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2408.12998v1",
      "year": 2024,
      "problemScope": {
        "node": "distance-dominating-set"
      },
      "problemParameter": "k",
      "problemParameterName": "distance radius",
      "problemSource": "Distance dominating set",
      "graphScope": {
        "node": "girth-hop",
        "note": "Retains connectivity, the precise k-hop expansion definition, and girth threshold."
      },
      "approximationDisplay": "2k f(k) + 1",
      "roundsDisplay": "k",
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "k",
        "tex": "k",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2408.12998v1",
            "title": "Tight Bounds for Constant-Round Domination on Graphs of High Girth and Low Expansion",
            "location": "Theorem 1.1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "Exact k rounds; k ≥ 2",
        "setting": "Unweighted distance-k MDS; k≥2 and fixed expansion bound f(k)≥1; connected graphs of girth at least 4k+3 and k-hop expansion at most f(k). Deterministic anonymous port numbering, exactly k rounds with empty messages, integral OPT.",
        "reason": "Theorem 1.1 is the published exact-k-round point with factor 2kf(k)+1. Theorem 1.2 proves that k−1 rounds cannot give any factor independent of Δ even on trees. The 3k-round improved-factor algorithm does not dominate this faster point. This certifies the minimum round budget and the documented tradeoff, not optimality of the coefficient for every k and f(k).",
        "evidenceUrl": "https://arxiv.org/html/2408.12998v1#S1",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-k-ge2",
          "parameter-expansion-ge1"
        ]
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "distance-k-round-threshold",
          "resultId": "pic-girth-pruning",
          "graphs": [
            "girth-hop",
            "forest",
            "degree-forest"
          ],
          "problems": [
            "distance-dominating-set"
          ],
          "models": [
            "Anonymous",
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": [
            "parameter-k-ge2",
            "parameter-expansion-ge1",
            "scope-factor-independent-degree"
          ]
        },
        {
          "certificateId": "long-cycle-distance-factor",
          "resultId": "pic-girth-pruning",
          "graphs": [
            "long-cycle"
          ],
          "problems": [
            "distance-dominating-set"
          ],
          "models": [
            "Anonymous",
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": [
            "scope-cycle-expansion-one",
            "scope-radius-k-equals-r",
            "scope-radius-r-sublogstar"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "f(k)",
          "description": "Upper bound on the edge-to-vertex ratio after deleting vertices and contracting disjoint subgraphs of the stated radius",
          "tex": "f(k)"
        },
        {
          "symbol": "f",
          "description": "Expansion function bounding edge-to-vertex ratios after bounded-radius contractions",
          "tex": "f"
        },
        {
          "symbol": "k",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "k"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-9171fdfac7e54f0c66d4",
          "weights-unweighted",
          "model-port-numbering"
        ],
        "parameters": [
          "auto-parameter-f0979e1ca73e2b9842db"
        ],
        "assumptions": [],
        "detail": [
          "strength-empty-messages"
        ],
        "covered": [
          "auto-graph-9171fdfac7e54f0c66d4",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-92362405df7c8f0d5040",
          "auto-output-22413995976b0346df27",
          "auto-parameter-f0979e1ca73e2b9842db",
          "model-port-numbering",
          "parameter-fixed-k",
          "parameter-k-ge1",
          "scope-factor-independent-degree",
          "strength-empty-messages",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-girth-sublinear",
      "paperId": "pic-lw-girth-2024",
      "problem": "Distance-k dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Connected; k-hop expansion ≤ f(k); girth ≥ 4k + 3",
      "model": "Anonymous",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "O(k + f(k)^(k/(k+1)))",
      "rounds": "3k",
      "roundClass": "parameter",
      "parameters": "Fixed k; algorithm need not know f(k).",
      "assumptions": "Port numbering; messages ≤ ⌈log Δ⌉ bits.",
      "theorem": "Theorem 1.5",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2408.12998v1",
      "year": 2024,
      "problemScope": {
        "node": "distance-dominating-set"
      },
      "problemParameter": "k",
      "problemParameterName": "distance radius",
      "problemSource": "Distance dominating set",
      "graphScope": {
        "node": "girth-hop",
        "note": "Retains connectivity, the precise k-hop expansion definition, and girth threshold."
      },
      "approximationDisplay": "O(k + f(k)^(k/(k+1)))",
      "roundsDisplay": "3k",
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "3k",
        "tex": "3k",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2408.12998v1",
            "title": "Tight Bounds for Constant-Round Domination on Graphs of High Girth and Low Expansion",
            "location": "Theorem 1.5"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Unweighted distance-k domination; connected graphs with girth ≥ 4k+3 and k-hop expansion at most f(k); deterministic anonymous port numbering in exactly 3k rounds; k ≥ 1; integral optimum.",
        "reason": "Optimal factor up to constants: O(k+f(k)^(k/(k+1))) in 3k anonymous rounds matches the deterministic LOCAL lower bound.",
        "evidenceUrl": "https://arxiv.org/html/2408.12998v1",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "high-girth-approximation-order",
          "resultId": "pic-girth-sublinear",
          "graphs": [
            "girth-hop"
          ],
          "problems": [
            "distance-dominating-set"
          ],
          "models": [
            "Anonymous",
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": []
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "f(k)",
          "description": "Upper bound on the edge-to-vertex ratio after deleting vertices and contracting disjoint subgraphs of the stated radius",
          "tex": "f(k)"
        },
        {
          "symbol": "f",
          "description": "Expansion function bounding edge-to-vertex ratios after bounded-radius contractions",
          "tex": "f"
        },
        {
          "symbol": "k",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "k"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-9171fdfac7e54f0c66d4",
          "weights-unweighted",
          "model-port-numbering"
        ],
        "parameters": [
          "parameter-fixed-k",
          "parameter-k-ge1"
        ],
        "assumptions": [],
        "detail": [
          "strength-log-degree-bits",
          "strength-no-f-knowledge"
        ],
        "covered": [
          "auto-graph-9171fdfac7e54f0c66d4",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-92362405df7c8f0d5040",
          "auto-output-22413995976b0346df27",
          "model-port-numbering",
          "parameter-fixed-k",
          "parameter-k-ge1",
          "strength-log-degree-bits",
          "strength-no-f-knowledge",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-girth-sublinear-lower",
      "paperId": "pic-lw-girth-2024",
      "problem": "Distance-k dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Connected; k-hop expansion ≤ f(k); girth ≥ 4k + 3",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "approximation": "No o(k + f(k)^(k/(k+1)))-approximation",
      "rounds": "O(1)",
      "roundClass": "parameter",
      "parameters": "Fixed k and expansion bound; asymptotic dependence on both parameters.",
      "assumptions": "",
      "theorem": "Abstract; Theorem 1.6 and LOCAL transfer",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2408.12998v1",
      "year": 2024,
      "problemScope": {
        "node": "distance-dominating-set"
      },
      "problemParameter": "k",
      "problemParameterName": "distance radius",
      "problemSource": "Distance dominating set",
      "graphScope": {
        "node": "girth-hop",
        "note": "Retains connectivity, the precise k-hop expansion definition, and girth threshold."
      },
      "approximationDisplay": "Ω(k + f(k)^(k/(k+1)))",
      "roundsDisplay": "F(k, f(k)) rounds ruled out",
      "roundParameters": [
        {
          "symbol": "k",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "f(k)",
          "name": "expansion bound",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundBudgetExcluded": true,
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "impossibility",
        "formula": "Any T(k, f(k)) independent of n",
        "tex": "\\text{Any }T\\bigl(k,f\\bigl(k\\bigr)\\bigr)\\text{ independent of }n",
        "basis": "quantified-impossibility",
        "explanation": "This excludes every round complexity depending only on the listed fixed parameters, independently of n. It is a lower-bound budget, not the running time of an algorithm.",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2408.12998v1",
            "title": "Tight Bounds for Constant-Round Domination on Graphs of High Girth and Low Expansion",
            "location": "Abstract; Theorem 1.6 and LOCAL transfer"
          }
        ],
        "parameters": [
          {
            "symbol": "T",
            "description": "An arbitrary number of communication rounds depending only on the listed fixed parameters",
            "tex": "T"
          }
        ],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "high-girth-approximation-order",
          "resultId": "pic-girth-sublinear-lower",
          "graphs": [
            "girth-hop"
          ],
          "problems": [
            "distance-dominating-set"
          ],
          "models": [
            "LOCAL",
            "CONGEST"
          ],
          "conditionIds": []
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "f(k)",
          "description": "Upper bound on the edge-to-vertex ratio after deleting vertices and contracting disjoint subgraphs of the stated radius",
          "tex": "f(k)",
          "sourceSymbol": "class"
        },
        {
          "symbol": "F",
          "description": "Unspecified function of the displayed parameters",
          "tex": "F"
        },
        {
          "symbol": "T",
          "description": "An arbitrary number of communication rounds depending only on the listed fixed parameters",
          "tex": "T"
        },
        {
          "symbol": "f",
          "description": "Expansion function bounding edge-to-vertex ratios after bounded-radius contractions",
          "tex": "f"
        },
        {
          "symbol": "k",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "k"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication network",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-9171fdfac7e54f0c66d4",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-849af929a5eaf7f9ea3b"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-9171fdfac7e54f0c66d4",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-22413995976b0346df27",
          "auto-parameter-849af929a5eaf7f9ea3b",
          "parameter-k-ge1",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-girth-time-lower",
      "paperId": "pic-lw-girth-2024",
      "problem": "Distance-k dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Trees; maximum degree ≤ Δ",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "approximation": "No factor smaller than Δ",
      "rounds": "k − 1",
      "roundClass": "parameter",
      "parameters": "Radius k; arbitrary Δ.",
      "assumptions": "",
      "theorem": "Theorem 1.2; Corollary 1",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2408.12998v1",
      "year": 2024,
      "roundBudgetExcluded": true,
      "problemScope": {
        "node": "distance-dominating-set"
      },
      "problemParameter": "k",
      "problemParameterName": "distance radius",
      "problemSource": "Distance dominating set",
      "graphScope": {
        "node": "degree-forest"
      },
      "graphClassSource": "Trees of maximum degree Δ",
      "approximationDisplay": "≥ Δ",
      "roundsDisplay": "k − 1",
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "k − 1",
        "tex": "k - 1",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2408.12998v1",
            "title": "Tight Bounds for Constant-Round Domination on Graphs of High Girth and Low Expansion",
            "location": "Theorem 1.2; Corollary 1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "distance-k-round-threshold",
          "resultId": "pic-girth-time-lower",
          "graphs": [
            "degree-forest",
            "forest",
            "girth-hop"
          ],
          "problems": [
            "distance-dominating-set"
          ],
          "models": [
            "LOCAL",
            "CONGEST"
          ],
          "conditionIds": [
            "parameter-k-ge2",
            "parameter-expansion-ge1",
            "scope-factor-independent-degree"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "k",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "k"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-6b18cb9d7cafda1f1507",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-5163900e51cf7e19adb3"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-6b18cb9d7cafda1f1507",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-22413995976b0346df27",
          "auto-parameter-5163900e51cf7e19adb3",
          "parameter-expansion-ge1",
          "parameter-k-ge1",
          "parameter-k-ge2",
          "scope-factor-independent-degree",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-sublog-fmatching",
      "paperId": "pic-chw-capacitated-2021",
      "problem": "Maximum f-matching",
      "variant": "Maximum f-matching; edges used at most once",
      "objective": "max",
      "graphClass": "Sub-logarithmic expansion g(r) = o(log r)",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − ε",
      "rounds": "Oε,𝗀(log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed ε > 0 and expansion function g.",
      "assumptions": "Integer vertex capacities f(v); expansion information supplied.",
      "theorem": "Theorem 7",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol212-isaac2021/LIPIcs.ISAAC.2021.59/LIPIcs.ISAAC.2021.59.pdf",
      "year": 2021,
      "problemScope": {
        "node": "f-matching"
      },
      "problemParameter": "f",
      "problemParameterName": "vertex-capacity function",
      "problemSource": "Maximum matching",
      "graphScope": {
        "node": "sublog"
      },
      "prerequisite": "Expansion bounds supplied",
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "Oε,𝗀(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Oε,𝗀(log* n)",
        "tex": "O_{\\varepsilon,g}(\\log^*n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol212-isaac2021/LIPIcs.ISAAC.2021.59/LIPIcs.ISAAC.2021.59.pdf",
            "title": "Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion",
            "location": "Theorem 7"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Maximum f-matching with integer vertex capacities and each edge used at most once; deterministic LOCAL; sub-logarithmic expansion; fixed 0 < ε < 1/2 and expansion bounds; no supplied coloring.",
        "reason": "For a (1−ε) guarantee, Θ(log* n) dependence on n is optimal in the worst case for fixed ε and expansion bounds, already for unit capacities on paths. This does not certify optimal dependence on ε or the expansion function.",
        "evidenceUrl": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol212-isaac2021/LIPIcs.ISAAC.2021.59/LIPIcs.ISAAC.2021.59.pdf",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-epsilon-half"
        ]
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "fmatching-n-rounds",
          "resultId": "pic-sublog-fmatching",
          "graphs": [
            "sublog",
            "forest",
            "path",
            "oriented-path",
            "cycle"
          ],
          "problems": [
            "f-matching"
          ],
          "models": [
            "LOCAL"
          ],
          "conditionIds": [
            "scope-rounds-n-expansion-epsilon",
            "parameter-epsilon-half"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "f(v)",
          "description": "Positive integer capacity of vertex v in the f-matching problem",
          "tex": "f(v)"
        },
        {
          "symbol": "g(r)",
          "description": "Upper bound on the edge-to-vertex ratio of depth-r minors",
          "tex": "g(r)"
        },
        {
          "symbol": "f",
          "description": "Positive integer vertex-capacity function: a vertex v may meet at most f(v) selected edges",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Expansion function of the fixed input graph class; g(r)=o(log r)",
          "tex": "g",
          "sourceSymbol": "𝗀"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Radius parameter in the expansion function",
          "tex": "r"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-9fd58cfedeb677601608",
          "weights-unweighted",
          "output-fmatching-simple",
          "input-expansion-bounds"
        ],
        "parameters": [
          "auto-parameter-51662271224435b06188"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-9fd58cfedeb677601608",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-406e7225cb456f7c7595",
          "auto-parameter-51662271224435b06188",
          "input-expansion-bounds",
          "output-fmatching-simple",
          "parameter-fixed-epsilon",
          "parameter-fixed-expansion",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-sublog-bmatching",
      "paperId": "pic-chw-capacitated-2021",
      "problem": "Maximum b-matching",
      "variant": "Maximum b-matching; integer edge multiplicities",
      "objective": "max",
      "graphClass": "Sub-logarithmic expansion g(r) = o(log r)",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − ε",
      "rounds": "Oε,ᴸ,𝗀(log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed ε > 0, L, and expansion function g.",
      "assumptions": "Positive integer capacities b; |b(u)−b(v)| ≤ L dist(u,v); L known.",
      "theorem": "Theorem 17",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol212-isaac2021/LIPIcs.ISAAC.2021.59/LIPIcs.ISAAC.2021.59.pdf",
      "year": 2021,
      "problemScope": {
        "node": "b-matching"
      },
      "problemParameter": "b",
      "problemParameterName": "vertex-capacity function",
      "problemSource": "Maximum matching",
      "graphScope": {
        "node": "sublog"
      },
      "prerequisite": "Known Lipschitz capacity bound",
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "Oε,ᴸ,𝗀(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Oε,ᴸ,𝗀(log* n)",
        "tex": "O_{\\varepsilon,L,g}(\\log^*n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol212-isaac2021/LIPIcs.ISAAC.2021.59/LIPIcs.ISAAC.2021.59.pdf",
            "title": "Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion",
            "location": "Theorem 17"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Maximum b-matching with integer edge multiplicities; deterministic LOCAL; sub-logarithmic expansion and known L-Lipschitz capacities; fixed 0 < ε < 1/2, L, and expansion bounds; no supplied coloring.",
        "reason": "For a (1−ε) guarantee, Θ(log* n) dependence on n is optimal in the worst case for fixed ε, L and expansion bounds; unit capacities satisfy the Lipschitz condition. This does not certify optimal dependence on ε, L or the expansion function.",
        "evidenceUrl": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol212-isaac2021/LIPIcs.ISAAC.2021.59/LIPIcs.ISAAC.2021.59.pdf",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-epsilon-half"
        ]
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "bmatching-n-rounds",
          "resultId": "pic-sublog-bmatching",
          "graphs": [
            "sublog",
            "forest",
            "path",
            "oriented-path",
            "cycle"
          ],
          "problems": [
            "b-matching"
          ],
          "models": [
            "LOCAL"
          ],
          "conditionIds": [
            "scope-rounds-n-L-expansion-epsilon",
            "parameter-epsilon-half"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "b(v)",
          "description": "Positive integer capacity of vertex v in the b-matching problem",
          "tex": "b(v)"
        },
        {
          "symbol": "g(r)",
          "description": "Upper bound on the edge-to-vertex ratio of depth-r minors",
          "tex": "g(r)"
        },
        {
          "symbol": "L",
          "description": "Known Lipschitz constant: |b(u)−b(v)|≤L·dist(u,v)",
          "tex": "L"
        },
        {
          "symbol": "b",
          "description": "Positive integer vertex-capacity function bounding incident edge multiplicities",
          "tex": "b"
        },
        {
          "symbol": "g",
          "description": "Expansion function of the fixed input graph class; g(r)=o(log r)",
          "tex": "g",
          "sourceSymbol": "𝗀"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Radius parameter in the expansion function",
          "tex": "r"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-9fd58cfedeb677601608",
          "weights-unweighted",
          "output-bmatching-multiplicity",
          "input-lipschitz-capacity-bound",
          "input-lipschitz-capacities"
        ],
        "parameters": [
          "auto-parameter-70c7558f1bd42ca5b75a"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-9fd58cfedeb677601608",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-eb30c7aa45dd0f7be45c",
          "auto-parameter-70c7558f1bd42ca5b75a",
          "input-lipschitz-capacities",
          "input-lipschitz-capacity-bound",
          "output-bmatching-multiplicity",
          "parameter-fixed-L",
          "parameter-fixed-epsilon",
          "parameter-fixed-expansion",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-ass-sublog-refine",
      "paperId": "amiri-beyond-2017",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Sub-logarithmic expansion f(r) = o(log r)",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "Oε,꜀(log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed expansion class, ε > 0, c.",
      "assumptions": "A c-approximate dominating set is provided as input.",
      "theorem": "Journal version, Theorem 4.6",
      "summary": "Conditional refinement; seed cost is additional.",
      "verification": "primary",
      "sourceUrl": "https://schmiste.github.io/talg19ds.pdf",
      "year": 2019,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "sublog"
      },
      "prerequisite": "Supplied c-approximate dominating set; seed cost additional",
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "Oε,꜀(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Oε,꜀(log* n)",
        "tex": "O_{\\varepsilon,c}(\\log^*n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://schmiste.github.io/talg19ds.pdf",
            "title": "Distributed Dominating Set Approximations beyond Planar Graphs",
            "location": "Journal version, Theorem 4.6"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f(r)",
          "description": "Upper bound on the edge-to-vertex ratio of depth-r minors",
          "tex": "f(r)"
        },
        {
          "symbol": "c",
          "description": "Approximation factor of the initial dominating set supplied as input",
          "tex": "c"
        },
        {
          "symbol": "f",
          "description": "Expansion function of the fixed graph class; f(r)=o(log r)",
          "tex": "f"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Radius parameter in the expansion function",
          "tex": "r"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-8522d0de3c4afaf02c91",
          "weights-unweighted",
          "input-c-approx-seed"
        ],
        "parameters": [
          "auto-parameter-848e8210bb141aa4c5cf"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-8522d0de3c4afaf02c91",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-848e8210bb141aa4c5cf",
          "input-c-approx-seed",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-ass-sublog-full",
      "paperId": "amiri-beyond-2017",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Sub-logarithmic expansion f(r) = o(log r)",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "O(log n)",
      "roundClass": "logarithmic",
      "parameters": "Fixed expansion class and ε > 0.",
      "assumptions": "",
      "theorem": "Journal version, Corollary 4.7 and following paragraph",
      "summary": "Includes the cited bounded-expansion seed construction.",
      "verification": "primary",
      "sourceUrl": "https://schmiste.github.io/talg19ds.pdf",
      "year": 2019,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "sublog"
      },
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "O(log n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log n)",
        "tex": "O(\\log n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://schmiste.github.io/talg19ds.pdf",
            "title": "Distributed Dominating Set Approximations beyond Planar Graphs",
            "location": "Journal version, Corollary 4.7 and following paragraph"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f(r)",
          "description": "Upper bound on the edge-to-vertex ratio of depth-r minors",
          "tex": "f(r)"
        },
        {
          "symbol": "f",
          "description": "Expansion function of the fixed graph class; f(r)=o(log r)",
          "tex": "f"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Radius parameter in the expansion function",
          "tex": "r"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-8522d0de3c4afaf02c91",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-a71ee1ff530d799c86f8"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-8522d0de3c4afaf02c91",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-a71ee1ff530d799c86f8",
          "weights-unweighted"
        ]
      }
    },
    {
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "rounds": "O(1)-round impossibility",
      "roundClass": "parameter",
      "paperId": "pic-thesis-2026",
      "verification": "primary",
      "year": 2026,
      "id": "pic-thesis-pathwidth-lower",
      "graphClass": "H-minor-free graphs",
      "approximation": "No (2 pw(H) − 1 − ε)-approximation",
      "parameters": "Fixed excluded minor H and ε > 0; pw(H) is its pathwidth.",
      "assumptions": "The number of rounds may depend arbitrarily on H, independently of n.",
      "theorem": "Chapter V, Theorem V.1.1 (PDF p. 146)",
      "sourceUrl": "https://timothepicavet.fr/others/thesis.pdf#page=146",
      "summary": "Pathwidth of the excluded minor controls this lower bound.",
      "relatedResults": [
        "pic-thesis-pathpower-lower",
        "gen-as26-power-lower"
      ],
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "> 2 pw(H) − 1 − ε",
      "roundsDisplay": "f(H, ε) rounds ruled out",
      "roundParameters": [
        {
          "symbol": "H",
          "name": "excluded minor",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundBudgetExcluded": true,
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "impossibility",
        "formula": "Any T(H, ε) independent of n",
        "tex": "\\text{Any }T\\bigl(H,\\varepsilon\\bigr)\\text{ independent of }n",
        "basis": "quantified-impossibility",
        "explanation": "This excludes every round complexity depending only on the listed fixed parameters, independently of n. It is a lower-bound budget, not the running time of an algorithm.",
        "evidence": [
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=146",
            "title": "Algorithmes distribués et structures locales dans les graphes",
            "location": "Chapter V, Theorem V.1.1 (PDF p. 146)"
          }
        ],
        "parameters": [
          {
            "symbol": "T",
            "description": "An arbitrary number of communication rounds depending only on the listed fixed parameters",
            "tex": "T"
          }
        ],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "pw(H)",
          "description": "Pathwidth of the excluded graph H",
          "tex": "\\operatorname{pw}(H)"
        },
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "T",
          "description": "An arbitrary number of communication rounds depending only on the listed fixed parameters",
          "tex": "T"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-147b06bde51054bdc0f1",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-156dd6ff20d8a86a9aff"
        ],
        "assumptions": [
          "auto-assumption-94ab493b6b5f81e0d93a"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-94ab493b6b5f81e0d93a",
          "auto-graph-147b06bde51054bdc0f1",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-156dd6ff20d8a86a9aff",
          "weights-unweighted"
        ]
      }
    },
    {
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "rounds": "O(1)-round impossibility",
      "roundClass": "parameter",
      "paperId": "pic-thesis-2026",
      "verification": "primary",
      "year": 2026,
      "id": "pic-thesis-pathpower-lower",
      "graphClass": "t-th powers of paths with endpoint leaves",
      "approximation": "No ratio < 2t + 1",
      "parameters": "Fixed integer t ≥ 1; arbitrary round complexity f(t).",
      "assumptions": "Witnesses allow extra degree-one vertices attached at one endpoint. Distinct identifiers in {1,…,|V(G)|}.",
      "theorem": "Chapter V, Lemma V.2.1 (PDF p. 148; proof p. 149)",
      "sourceUrl": "https://timothepicavet.fr/others/thesis.pdf#page=148",
      "summary": "A related path-power lower bound with endpoint leaves.",
      "relatedResults": [
        "gen-as26-power-lower",
        "pic-thesis-pathwidth-lower"
      ],
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "path-powers-leaves"
      },
      "approximationDisplay": "≥ 2t + 1",
      "roundsDisplay": "f(t) rounds ruled out",
      "roundParameters": [
        {
          "symbol": "t",
          "name": "power radius",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundBudgetExcluded": true,
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "impossibility",
        "formula": "Any T(t) independent of n",
        "tex": "\\text{Any }T\\bigl(t\\bigr)\\text{ independent of }n",
        "basis": "quantified-impossibility",
        "explanation": "This excludes every round complexity depending only on the listed fixed parameters, independently of n. It is a lower-bound budget, not the running time of an algorithm.",
        "evidence": [
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=148",
            "title": "Algorithmes distribués et structures locales dans les graphes",
            "location": "Chapter V, Lemma V.2.1 (PDF p. 148; proof p. 149)"
          }
        ],
        "parameters": [
          {
            "symbol": "T",
            "description": "An arbitrary number of communication rounds depending only on the listed fixed parameters",
            "tex": "T"
          }
        ],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "pathpower-leaves-factor",
          "resultId": "pic-thesis-pathpower-lower",
          "graphs": [
            "path-powers-leaves"
          ],
          "problems": [
            "dominating-set"
          ],
          "models": [
            "LOCAL",
            "CONGEST"
          ],
          "conditionIds": [
            "parameter-t-integer-ge1",
            "input-ids-one-to-n"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "G",
          "description": "Input graph",
          "tex": "G"
        },
        {
          "symbol": "T",
          "description": "An arbitrary number of communication rounds depending only on the listed fixed parameters",
          "tex": "T"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication network",
          "tex": "n"
        },
        {
          "symbol": "t",
          "description": "Power of the underlying path: original path vertices at distance at most t are adjacent",
          "tex": "t"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-580cce8ae5a0654250af",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-d8937560fe62ed79d064"
        ],
        "assumptions": [
          "auto-assumption-82725811fe448ccca35c"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-82725811fe448ccca35c",
          "auto-graph-580cce8ae5a0654250af",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-d8937560fe62ed79d064",
          "input-distinct-ids",
          "input-ids-one-to-n",
          "input-logarithmic-ids",
          "parameter-t-integer-ge1",
          "weights-unweighted"
        ]
      }
    },
    {
      "paperId": "gen-bdgpsw26",
      "problem": "Dominating set",
      "objective": "min",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "verification": "primary",
      "year": 2026,
      "id": "pic-thesis-planar-205",
      "variant": "Unweighted",
      "graphClass": "Planar",
      "approximation": "205",
      "rounds": "6",
      "roundClass": "constant",
      "parameters": "",
      "assumptions": "Distinct identifiers; the algorithm uses local computation without a time bound.",
      "theorem": "Proposition 3.1; thesis Proposition III.3.1 (PDF p. 82)",
      "summary": "The local optimum-based Algorithm 1 has an explicit six-round schedule.",
      "sourceUrl": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf#page=5",
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "205",
      "roundsDisplay": "6",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "6",
        "tex": "6",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf#page=5",
            "title": "Meta-Theorems for Cuttable Distributed Problems",
            "location": "Proposition 3.1; thesis Proposition III.3.1 (PDF p. 82)"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierComparisons": [
        {
          "better": "wawrzyniak-planar-52",
          "worse": "pic-thesis-planar-205",
          "strict": [
            "approximation"
          ],
          "conditions": {
            "problem": "Both return an integral approximation for unweighted minimum dominating set.",
            "graphClass": "Both algorithms apply to all planar graphs.",
            "approximation": "Factor 52 is strictly smaller than 205.",
            "rounds": "Both provide six-round LOCAL implementations. The 52 result uses the Lenzen–Pignolet–Wattenhofer schedule in Lemma 6.1; Proposition 3.1 of the cuttable-problems paper explicitly gives six rounds for factor 205. No comparison of unrelated unspecified constants is used.",
            "model": "Both use LOCAL with unrestricted message size and local computation.",
            "randomness": "Both algorithms are deterministic.",
            "benchmark": "Both approximation guarantees are measured against the integral optimum.",
            "assumptions": "Both use distinct identifiers and require no embedding, degree bound or externally supplied dominating set. Unbounded local computation is allowed in LOCAL."
          },
          "evidenceUrl": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf#page=5",
          "reason": "The six-round factor-52 algorithm has a strictly stronger guarantee than the six-round factor-205 algorithm under the same graph, model and identifier assumptions."
        }
      ],
      "dominatedBy": [
        "wawrzyniak-planar-52"
      ],
      "frontierStatus": "dominated",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [],
        "assumptions": [
          "auto-assumption-dfd0a20f62b413880876"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-dfd0a20f62b413880876",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "weights-unweighted"
        ]
      }
    },
    {
      "paperId": "gen-bdgpsw26",
      "problem": "Dominating set",
      "objective": "min",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "verification": "primary",
      "year": 2026,
      "id": "pic-thesis-genus-616",
      "variant": "Unweighted",
      "graphClass": "Euler genus ≤ g",
      "approximation": "616",
      "rounds": "C(g)",
      "roundClass": "parameter",
      "parameters": "Fixed Euler genus bound g; the approximation ratio is independent of g.",
      "assumptions": "Distinct identifiers; the class-dependent control function and genus bound determine the number of rounds.",
      "theorem": "Theorem 3.2; thesis Theorem III.3.2 (PDF pp. 82–83)",
      "summary": "An introductory genus-transfer algorithm with ratio independent of g; the round complexity depends on g.",
      "sourceUrl": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf#page=6",
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "euler",
        "note": "Retain any connectivity condition stated by the source."
      },
      "approximationDisplay": "616",
      "roundsDisplay": "f(g)",
      "roundParameters": [
        {
          "symbol": "g",
          "name": "Euler genus",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "partial",
        "formula": "O((g+1)(F_g(10)+6))",
        "tex": "O\\!\\left((g+1)(F_g(10)+6)\\right)",
        "basis": "derived-phase-bound",
        "explanation": "Theorem 3.2 states C(g). Algorithm 2 inspects radius F_g(10)+5, and Claim 3.3 bounds the residual two-hop components' weak diameters by less than 2(F_g(10)+6)g. Gathering the necessary bounded-radius views and applying the constant-round planar algorithm therefore gives the partial asymptotic expansion below. The proof does not compute F_g(10) as a closed function of g; do not label this an elementary explicit dependence on g or an exact integer runtime.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
            "title": "Meta-Theorems for Cuttable Distributed Problems",
            "location": "Theorem 3.2, Algorithm 2, Claim 3.3"
          },
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=82",
            "title": "Timothé Picavet's doctoral thesis",
            "location": "Theorem III.3.2, PDF pp. 82–83"
          }
        ],
        "parameters": [
          {
            "symbol": "F_g",
            "description": "A two-dimensional control function for the class of graphs of Euler genus at most g",
            "tex": "F_g"
          }
        ],
        "checked": "2026-11-16",
        "audited": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "F_g",
          "description": "A two-dimensional control function for the class of graphs of Euler genus at most g",
          "tex": "F_g"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound",
          "tex": "g"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-4688deea0bc7a8a63f32",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-c0e181a48eccedc1a097"
        ],
        "assumptions": [
          "auto-assumption-dc067c5203f5429194e2"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-dc067c5203f5429194e2",
          "auto-graph-4688deea0bc7a8a63f32",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-c0e181a48eccedc1a097",
          "weights-unweighted"
        ]
      }
    },
    {
      "paperId": "gen-bdgpsw26",
      "problem": "Dominating set",
      "objective": "min",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "verification": "primary",
      "year": 2026,
      "id": "pic-thesis-local-apex",
      "variant": "Unweighted",
      "graphClass": "Asymptotic dimension d; radius-r balls of Euler genus ≤ g with at most a apices",
      "approximation": "34.01(d + 1)",
      "rounds": "C(d,g,a,r)",
      "roundClass": "parameter",
      "parameters": "Fixed d, g, a and sufficiently large fixed radius r, together with a fixed dimensional control function.",
      "assumptions": "For every vertex, its induced radius-r ball becomes a graph of Euler genus at most g after deleting at most a vertices. The bound is for a class of asymptotic dimension at most d; its control function is fixed.",
      "theorem": "Corollary 4.4 and apex extension; thesis Corollary III.4.4 (PDF p. 88)",
      "summary": "The text explicitly extends the local-genus corollary to the a-apex version, preserving its ratio while allowing a-dependent round complexity.",
      "sourceUrl": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf#page=10",
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "local-apex",
        "note": "Retain fixed d, g, a, a sufficiently large radius r, and the class-dimensional control function; the deletion set of at most a apices may differ between balls."
      },
      "approximationDisplay": "34.01(d + 1)",
      "roundsDisplay": "f(d, g, a, r)",
      "roundParameters": [
        {
          "symbol": "d",
          "name": "asymptotic dimension",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "g",
          "name": "Euler genus",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "a",
          "name": "apex count",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "r",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "f(d, g, a, r)",
        "tex": "f\\bigl(d,g,a,r\\bigr)",
        "basis": "unspecified-parameter-function",
        "explanation": "The local-apex extension preserves the approximation ratio while allowing the number of rounds to depend on the apex count and the other fixed class parameters. The corollary and the following extension do not calculate a closed round formula; the transfer still uses the class's control function.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
            "title": "Meta-Theorems for Cuttable Distributed Problems",
            "location": "Corollary 4.4 and apex extension"
          },
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=88",
            "title": "Timothé Picavet's doctoral thesis",
            "location": "Corollary III.4.4 and its apex extension, PDF p. 88"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "a",
          "description": "Maximum number of vertices deleted from each radius-r ball to obtain Euler genus at most g",
          "tex": "a"
        },
        {
          "symbol": "d",
          "description": "Asymptotic dimension bound of the graph class",
          "tex": "d"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound for the radius-r balls after any stated apex deletions",
          "tex": "g"
        },
        {
          "symbol": "r",
          "description": "Fixed sufficiently large radius of the neighborhoods used in the local-class assumption",
          "tex": "r"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-923a099c9b7572b1569c",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-fafe049cf255bb2992b3"
        ],
        "assumptions": [
          "auto-assumption-e9f4409ff458ab752c46"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-e9f4409ff458ab752c46",
          "auto-graph-923a099c9b7572b1569c",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-fafe049cf255bb2992b3",
          "weights-unweighted"
        ]
      }
    },
    {
      "paperId": "pic-thesis-2026",
      "variant": "Unweighted",
      "objective": "min",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "verification": "primary",
      "year": 2026,
      "id": "pic-thesis-pw2-dom",
      "problem": "Dominating set",
      "graphClass": "H-minor-free; pw(H) ≤ 2",
      "approximation": "50",
      "rounds": "O_H(1)",
      "roundClass": "parameter",
      "parameters": "Fixed excluded graph H with pw(H) ≤ 2. The approximation ratio is independent of H.",
      "assumptions": "Distinct identifiers. The excluded graph H is fixed, and the proof chooses H-dependent structural diameter thresholds.",
      "theorem": "Chapter VIII, Theorem VIII.1.1 (PDF p. 204; proof completed p. 218)",
      "summary": "Extends Algorithm 5 from K₂,t-minor-free graphs to every fixed excluded minor H of pathwidth at most two. The pathwidth restriction is on H, not on the input graph.",
      "sourceUrl": "https://timothepicavet.fr/others/thesis.pdf#page=204",
      "relatedResults": [
        "pic-large-50-dom",
        "pic-thesis-pathwidth-lower"
      ],
      "algorithmFamily": "local-cutting-dominating-set-algorithm5",
      "graphParameterRoles": {
        "excluded-minor": "H"
      },
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "minor-pw2",
        "note": "H is a fixed excluded minor with pw(H) ≤ 2; the input graph need not have pathwidth at most 2."
      },
      "approximationDisplay": "50",
      "roundsDisplay": "f(H)",
      "roundParameters": [
        {
          "symbol": "H",
          "name": "excluded minor",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "f(H)",
        "tex": "f\\bigl(H\\bigr)",
        "basis": "unspecified-parameter-function",
        "explanation": "Theorem VIII.1.1 reuses Algorithm 5 with a new structural diameter analysis. The proof still chooses local-cut radii via the dimensional control function and H-dependent structural thresholds. The final residual weak-diameter estimate is D+4 in terms of a prior structural bound D; it does not by itself produce a closed communication bound in the excluded graph H.",
        "evidence": [
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=204",
            "title": "Timothé Picavet's doctoral thesis",
            "location": "Theorem VIII.1.1, PDF p. 204; proof of Theorem VIII.5.1 and conclusion of Chapter VIII, PDF pp. 217–218"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": true
      },
      "sota": {
        "scopeLabel": "pw(H) ≤ 2; ratio independent of H",
        "setting": "Unweighted minimum dominating set; deterministic LOCAL; every fixed excluded minor H with pw(H) ≤ 2; factor 50 against the integral optimum in f(H) rounds independent of n.",
        "reason": "Theorem VIII.1.1 extends the same Algorithm 5 to every fixed excluded minor H with pw(H)≤2, retaining factor 50 independent of H. For H=K₂,t the family uses the original control function and cut radii, so the original O(t) implementation is retained. This covers the original K₂,t theorem by strict extension of the family of excluded-minor settings; it does not claim faster rounds. The generic H-dependent bound remains f(H), and particular H can have better specialized algorithms.",
        "evidenceUrl": "https://timothepicavet.fr/others/thesis.pdf#page=204",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "sotaScopeTransfers": [
        {
          "resultId": "pic-thesis-pw2-dom",
          "graph": "k2t",
          "algorithmSpecialization": "algorithm5-k2t-specialization",
          "scopeLabel": "K₂,t-minor-free; t ≥ 49",
          "setting": "Unweighted K₂,t-minor-free MDS; H=K₂,t with fixed t≥2; deterministic LOCAL; factor 50 against integral OPT. Use the original Algorithm 5 configuration and its O(t) runtime. The SOTA review is for t≥49.",
          "reason": "Theorem VIII.1.1 extends the original Algorithm 5 to all fixed excluded minors of pathwidth at most two. The certified H=K₂,t branch uses the original linear-in-t implementation. Its uniform factor-50 SOTA scope retains t≥49, while the algorithm itself applies for every t≥2. The original paper remains linked as the source of this specialized algorithm.",
          "evidenceUrl": "https://timothepicavet.fr/others/thesis.pdf#page=204",
          "conditionIds": [
            "claim-t-ge49"
          ],
          "claimConditionIds": [
            "claim-t-ge49"
          ],
          "settingConditionIds": [
            "binding-excluded-minor-k2t",
            "parameter-fixed-t-ge2"
          ]
        }
      ],
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "pw(H)",
          "description": "Pathwidth of the excluded graph H",
          "tex": "\\operatorname{pw}(H)"
        },
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-23bbca89e52d93fabbc0",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-47b7ba76ac595cfa11be"
        ],
        "assumptions": [
          "auto-assumption-d180b40ee9f79668f8bb"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-d180b40ee9f79668f8bb",
          "auto-graph-23bbca89e52d93fabbc0",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-47b7ba76ac595cfa11be",
          "weights-unweighted"
        ]
      }
    },
    {
      "paperId": "pic-thesis-2026",
      "variant": "Unweighted",
      "objective": "min",
      "model": "Anonymous",
      "randomization": "Deterministic",
      "bound": "upper",
      "verification": "primary",
      "year": 2026,
      "id": "pic-thesis-degeneracy-vc",
      "problem": "Vertex cover",
      "graphClass": "Degeneracy ≤ d",
      "approximation": "2 + ε",
      "rounds": "((1 + 1/ε)d + 1)² + 1",
      "roundClass": "parameter",
      "parameters": "Integer degeneracy bound d ≥ 1 and accuracy ε > 0 are supplied. For 0 < ε ≤ 1 the round complexity is O((d/ε)²).",
      "assumptions": "Anonymous port numbering; each vertex initially knows its own degree. At most two bits per message. The round complexity is independent of n and the maximum degree.",
      "theorem": "Chapter X, Theorem X.1.3; proof round count (PDF pp. 235–236)",
      "summary": "Select vertices above a degree threshold, then run the anonymous factor-two algorithm on the residual bounded-degree graph. The displayed upper bound includes the preprocessing round.",
      "sourceUrl": "https://timothepicavet.fr/others/thesis.pdf#page=235",
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "density",
        "note": "Retain the stated numerical degeneracy bound d. Boundedness is equivalent to bounded arboricity, but their numerical parameters are not identified."
      },
      "approximationDisplay": "2 + ε",
      "roundsDisplay": "((1 + 1/ε)d + 1)² + 1",
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "((1 + 1/ε)d + 1)² + 1",
        "tex": "\\bigl((1+1/\\varepsilon)d+1\\bigr)^2+1",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=235",
            "title": "Algorithmes distribués et structures locales dans les graphes",
            "location": "Chapter X, Theorem X.1.3; proof round count (PDF pp. 235–236)"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "d",
          "description": "Supplied integer upper bound on graph degeneracy",
          "tex": "d"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-7d0e376814cb5e208e0f",
          "weights-unweighted",
          "model-port-numbering",
          "input-own-degree",
          "parameter-known-d-epsilon"
        ],
        "parameters": [],
        "assumptions": [],
        "detail": [
          "strength-two-bits",
          "parameter-degeneracy-runtime"
        ],
        "covered": [
          "auto-graph-7d0e376814cb5e208e0f",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-92362405df7c8f0d5040",
          "auto-output-7f07455ff69b3b347e9b",
          "input-own-degree",
          "model-port-numbering",
          "parameter-degeneracy-runtime",
          "parameter-known-d-epsilon",
          "strength-two-bits",
          "weights-unweighted"
        ]
      }
    },
    {
      "paperId": "pic-thesis-2026",
      "variant": "Unweighted",
      "objective": "min",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "verification": "primary",
      "year": 2026,
      "id": "pic-thesis-planar-distance-dom",
      "problem": "Distance-k dominating set",
      "graphClass": "Planar",
      "approximation": "k^{O(k)}",
      "rounds": "O(k)",
      "roundClass": "parameter",
      "parameters": "Fixed integer distance k ≥ 1.",
      "assumptions": "Distinct identifiers; Algorithm 8 uses only their order. Unrestricted LOCAL messages and local computation. No girth restriction.",
      "theorem": "Chapter X, Theorem X.2.5 and Algorithm 8 (PDF pp. 237–238; proof pp. 239–246)",
      "summary": "Local optimum computations give a distance-k dominating set on every planar graph. The theorem uses k; the radius r in the algorithm is the same parameter.",
      "sourceUrl": "https://timothepicavet.fr/others/thesis.pdf#page=237",
      "relatedResults": [
        "pic-thesis-genus-distance-dom"
      ],
      "problemScope": {
        "node": "distance-dominating-set"
      },
      "problemParameter": "k",
      "problemParameterName": "distance radius",
      "problemSource": "Distance dominating set",
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "k^{O(k)}",
      "roundsDisplay": "O(k)",
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(k)",
        "tex": "O(k)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=237",
            "title": "Algorithmes distribués et structures locales dans les graphes",
            "location": "Chapter X, Theorem X.2.5 and Algorithm 8 (PDF pp. 237–238; proof pp. 239–246)"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "k",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "k"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-beaf612e4f0193d5db76"
        ],
        "assumptions": [
          "auto-assumption-4d3da7dbdc858af64700"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-4d3da7dbdc858af64700",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-22413995976b0346df27",
          "auto-parameter-beaf612e4f0193d5db76",
          "weights-unweighted"
        ]
      }
    },
    {
      "paperId": "pic-thesis-2026",
      "variant": "Unweighted",
      "objective": "min",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "verification": "primary",
      "year": 2026,
      "id": "pic-thesis-genus-distance-dom",
      "problem": "Distance-k dominating set",
      "graphClass": "Euler genus ≤ g",
      "approximation": "k^{O(k)}",
      "rounds": "C(g,k)",
      "roundClass": "parameter",
      "parameters": "Fixed integer distance k ≥ 1 and Euler genus bound g. The approximation ratio is independent of g.",
      "assumptions": "Distinct identifiers; no knowledge of n is required. Apply Meta-Theorem I with asymptotic dimension two and the fixed Euler-genus control function. No girth restriction.",
      "theorem": "Chapter X, paragraph following Theorem X.2.5; Meta-Theorem I and Proposition III.7.6 (PDF pp. 237–238)",
      "summary": "The thesis explicitly gives this genus extension. If the planar factor is α(k)=k^{O(k)}, the transfer gives 3α(k)+1=k^{O(k)}, with round complexity depending on g and k.",
      "sourceUrl": "https://timothepicavet.fr/others/thesis.pdf#page=238",
      "relatedResults": [
        "pic-thesis-planar-distance-dom"
      ],
      "problemScope": {
        "node": "distance-dominating-set"
      },
      "problemParameter": "k",
      "problemParameterName": "distance radius",
      "problemSource": "Distance dominating set",
      "graphScope": {
        "node": "euler",
        "note": "Retain any connectivity condition stated by the source."
      },
      "approximationDisplay": "k^{O(k)}",
      "roundsDisplay": "f(g, k)",
      "roundParameters": [
        {
          "symbol": "g",
          "name": "Euler genus",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "k",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "f(g, k)",
        "tex": "f\\bigl(g,k\\bigr)",
        "basis": "unspecified-parameter-function",
        "explanation": "The paragraph following Theorem X.2.5 explicitly obtains the genus extension by Meta-Theorem I and Proposition III.7.6. Algorithm 8 gives a radius-5k+1 neighbourhood inspection for the planar base algorithm, but this is not the runtime of its genus transfer. The transfer additionally depends on the uniformity transformation, the genus class's dimensional control function, and error-component diameter bounds. No complete g,k formula is calculated in this passage.",
        "evidence": [
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=237",
            "title": "Timothé Picavet's doctoral thesis",
            "location": "Theorem X.2.5, Algorithm 8 and the subsequent genus-extension paragraph, PDF pp. 237–238; Meta-Theorem I and Proposition III.7.6"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": true
      },
      "sota": {
        "scopeLabel": "General distance-k guarantee; ratio independent of g",
        "setting": "Unweighted distance-k dominating set on graphs of Euler genus at most g; fixed integer k ≥ 1 and genus bound g ≥ 0; deterministic LOCAL with distinct identifiers, unrestricted messages and local computation; approximation k^{O(k)}, independent of g, in f(g,k) rounds independent of n. No girth restriction.",
        "reason": "The paragraph following Theorem X.2.5 explicitly extends the planar algorithm using Meta-Theorem I and Proposition III.7.6. Its approximation ratio depends only on the distance parameter, while its round complexity may depend on both distance and genus. Faster planar and high-girth results require smaller graph classes; schemes with log-star or logarithmic dependence on n do not dominate this round complexity independent of n. This certifies the general distance-k tradeoff, without claiming the best coefficient at every special value of k, tightness or optimal parameter dependence.",
        "evidenceUrl": "https://timothepicavet.fr/others/thesis.pdf#page=238",
        "checked": "2026-11-17",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound",
          "tex": "g"
        },
        {
          "symbol": "k",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "k"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-4688deea0bc7a8a63f32",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-b0a4f6cca13712e0d8ac"
        ],
        "assumptions": [
          "auto-assumption-c29b65f0df3a5db56172"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-c29b65f0df3a5db56172",
          "auto-graph-4688deea0bc7a8a63f32",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-22413995976b0346df27",
          "auto-parameter-b0a4f6cca13712e0d8ac",
          "weights-unweighted"
        ]
      }
    },
    {
      "paperId": "pic-thesis-2026",
      "variant": "Unweighted; exact component optimum",
      "objective": "min",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "verification": "primary",
      "year": 2026,
      "id": "pic-thesis-path-excluded-exact",
      "problem": "Dominating set",
      "graphClass": "Pₜ-minor-free",
      "approximation": "1",
      "rounds": "t − 1",
      "roundClass": "parameter",
      "parameters": "Pₜ is the t-vertex path; fixed integer t ≥ 2.",
      "assumptions": "Distinct identifiers and unrestricted LOCAL messages. Disconnected graphs are handled component by component.",
      "theorem": "Chapter IV, Section IV.1, elementary observation (PDF p. 120)",
      "summary": "Every connected component has diameter at most t−2. Gather the component and compute its exact minimum dominating set with common lexicographic tie-breaking.",
      "sourceUrl": "https://timothepicavet.fr/others/thesis.pdf#page=120",
      "attribution": "folklore",
      "algorithm": "Gather the entire connected component in t−1 rounds, compute all minimum dominating sets, and select the lexicographically first using the distinct identifiers.",
      "proofSketch": "A shortest path of length t−1 would contain the forbidden t-vertex path. Thus each component has diameter at most t−2; t−1 rounds suffice to gather all its edges. Every vertex computes the same optimum, and component optima combine to a global optimum.",
      "proofFormula": "|D| = OPT",
      "provenanceNote": "Elementary baseline explicitly recalled in the thesis; 2026 is the source year, not a discovery claim.",
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "path-minor",
        "note": "t is the fixed number of vertices of the excluded path. Bounds apply separately to each connected component."
      },
      "approximationDisplay": "1",
      "roundsDisplay": "t − 1",
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "t − 1",
        "tex": "t-1",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=120",
            "title": "Algorithmes distribués et structures locales dans les graphes",
            "location": "Chapter IV, Section IV.1, elementary observation (PDF p. 120)"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "OPT",
          "description": "Minimum cardinality of a feasible solution",
          "tex": "\\mathrm{OPT}"
        },
        {
          "symbol": "D",
          "description": "Vertex set selected by the algorithm",
          "tex": "D"
        },
        {
          "symbol": "t",
          "description": "Number of vertices in the excluded path P_t",
          "tex": "t"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-c40b643df6f08b5ef5f6",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-19cffd064800d231c334"
        ],
        "assumptions": [
          "auto-assumption-c037429316643f33df51"
        ],
        "detail": [
          "detail-exact-components"
        ],
        "covered": [
          "auto-assumption-c037429316643f33df51",
          "auto-graph-c40b643df6f08b5ef5f6",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-19cffd064800d231c334",
          "detail-exact-components",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "folklore-tree-mds",
      "problem": "Dominating set",
      "variant": "Unweighted; non-leaf rule",
      "objective": "min",
      "graphClass": "Pseudoforests",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "3",
      "rounds": "1",
      "roundClass": "constant",
      "parameters": "At most one cycle per component; no degree bound.",
      "assumptions": "Unweighted pseudoforest; each vertex initially knows its own degree. One-bit broadcasts suffice; identifiers are unnecessary. Isolated vertices are selected, and both endpoints of a two-vertex component are selected.",
      "paperId": "dory-arboricity-2022",
      "theorem": "Appendix A, Observation A.1 (forest construction); elementary pseudoforest extension proved here",
      "summary": "The one-round non-leaf rule works on forests and, by the elementary extension below, on pseudoforests.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2206.05174#page=17",
      "year": 2022,
      "attribution": "folklore",
      "algorithm": "Broadcast whether the local degree equals one. Select vertices of degree zero or at least two, and degree-one vertices whose neighbor also has degree one.",
      "proofSketch": "In a component with at least three vertices, non-leaves dominate. Assign each non-optimum vertex to an adjacent optimum vertex; the resulting disjoint stars use n−OPT edges. A pseudoforest component has at most n edges, so at most OPT edges remain outside the stars. Every non-optimum non-leaf touches a remaining edge, giving at most 2 OPT such vertices, plus at most OPT optimum vertices. Singleton and two-vertex components have ratios one and two. Sum over components.",
      "provenanceNote": "Folklore non-leaf construction; 2022 identifies the source documenting the forest case, not discovery credit. The broader pseudoforest statement is explicitly derived here.",
      "proofFormula": "|D| ≤ 3 OPT",
      "derivationNote": "The cited observation states the forest case. The pseudoforest scope is an elementary extension, with the same one-bit protocol and the proof given here; it is not attributed as a separate theorem in that paper.",
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "pseudoforest",
        "note": "The one-round non-leaf construction extends to this class by the elementary star-assignment proof in the result details."
      },
      "approximationDisplay": "3",
      "roundsDisplay": "1",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "1",
        "tex": "1",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2206.05174#page=17",
            "title": "Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs",
            "location": "Appendix A, Observation A.1 (forest construction); elementary pseudoforest extension proved here"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "One round; pseudoforests",
        "setting": "Unweighted MDS on pseudoforests, hence also forests; deterministic one-round CONGEST with initial local degree knowledge; no identifiers; integral OPT. The pseudoforest scope is an explicitly derived extension of the documented forest rule.",
        "reason": "The one-bit non-leaf construction and the star-assignment proof in the entry give factor 3 on the strictly larger pseudoforest class. The treewidth-one lower bound in Corollary 1.1 excludes every factor below 3 already on paths, even for constant-round LOCAL algorithms. Generic constant-round protocols are not assumed to run in one round.",
        "evidenceUrl": "https://arxiv.org/pdf/2611.02057#page=66",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "sotaScopeTransfers": [
        {
          "resultId": "folklore-tree-mds",
          "graph": "forest",
          "scopeLabel": "Forests · one round",
          "setting": "Unweighted MDS on trees or forests; exact factor 3 in one round, with initial local degree knowledge and no identifiers.",
          "reason": "Forests are contained in pseudoforests. The same non-leaf construction is documented in Observation A.1, and the constant-round factor-three barrier already holds on paths.",
          "evidenceUrl": "https://arxiv.org/pdf/2206.05174#page=17",
          "conditionIds": [],
          "claimConditionIds": [],
          "settingConditionIds": []
        }
      ],
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "tightness": [
        {
          "certificateId": "pseudoforest-factor-three",
          "resultId": "folklore-tree-mds",
          "graphs": [
            "pseudoforest",
            "forest",
            "degree-forest",
            "path",
            "oriented-path"
          ],
          "problems": [
            "dominating-set"
          ],
          "models": [
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": []
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "OPT",
          "description": "Minimum cardinality of a feasible solution",
          "tex": "\\mathrm{OPT}"
        },
        {
          "symbol": "D",
          "description": "Vertex set selected by the algorithm",
          "tex": "D"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a92a23ddd7d97c52a4a2",
          "weights-unweighted",
          "input-own-degree"
        ],
        "parameters": [
          "auto-parameter-db0be7437e2fe9433220"
        ],
        "assumptions": [],
        "detail": [
          "strength-one-bit",
          "strength-no-ids"
        ],
        "covered": [
          "auto-graph-a92a23ddd7d97c52a4a2",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-db0be7437e2fe9433220",
          "input-own-degree",
          "strength-no-ids",
          "strength-one-bit",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "folklore-degree-mds",
      "problem": "Dominating set",
      "variant": "Unweighted; select all vertices",
      "objective": "min",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "Δ + 1",
      "rounds": "0",
      "roundClass": "constant",
      "parameters": "Δ is the maximum degree; the algorithm need not know it.",
      "assumptions": "Unweighted graphs. No identifiers, degree knowledge, or communication are needed.",
      "paperId": "gen-aprsu10",
      "theorem": "Section 2, trivial dominating-set approximation",
      "summary": "Selecting every vertex provides the elementary degree-dependent benchmark.",
      "verification": "primary",
      "sourceUrl": "https://jukkasuomela.fi/doc/weakly-coloured.pdf#page=3",
      "year": 2010,
      "attribution": "folklore",
      "algorithm": "Every vertex selects itself.",
      "proofSketch": "A vertex dominates at most Δ + 1 vertices, so OPT is at least n/(Δ + 1). The output has n vertices.",
      "provenanceNote": "Folklore baseline documented by the cited source; 2010 is the source year, not a discovery claim.",
      "proofFormula": "|D| ≤ (Δ + 1) OPT",
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "approximationDisplay": "Δ + 1",
      "roundsDisplay": "0",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "0",
        "tex": "0",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/weakly-coloured.pdf#page=3",
            "title": "Local algorithms in (weakly) coloured graphs",
            "location": "Section 2, trivial dominating-set approximation"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "OPT",
          "description": "Minimum cardinality of a feasible solution",
          "tex": "\\mathrm{OPT}"
        },
        {
          "symbol": "D",
          "description": "Vertex set selected by the algorithm",
          "tex": "D"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-22a8f3875f4ed671e161"
        ],
        "assumptions": [
          "auto-assumption-7218db1f3f785e20d190"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-7218db1f3f785e20d190",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-22a8f3875f4ed671e161",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "folklore-star-minor-mds",
      "problem": "Dominating set",
      "variant": "Unweighted; select all vertices",
      "objective": "min",
      "graphClass": "K₁,ₜ-minor-free",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "t",
      "rounds": "0",
      "roundClass": "constant",
      "parameters": "Integer t ≥ 2; the algorithm need not know t.",
      "assumptions": "Unweighted. No identifiers, degree knowledge, or communication are needed.",
      "paperId": "pic-bgpw-large-2025",
      "theorem": "Table 1 and footnote 4",
      "summary": "The excluded-star condition bounds the cost of selecting all vertices.",
      "verification": "primary",
      "sourceUrl": "https://dept-info.labri.fr/~gavoille/article/BGPW25.pdf#page=3",
      "year": 2025,
      "attribution": "folklore",
      "algorithm": "Every vertex selects itself.",
      "proofSketch": "Excluding K₁,ₜ as a minor implies Δ ≤ t − 1. Thus every optimum vertex dominates at most t vertices, and n ≤ t · OPT.",
      "provenanceNote": "Folklore baseline documented by the cited source; 2025 is the source year, not a discovery claim.",
      "proofFormula": "|D| ≤ t OPT",
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "star-minor"
      },
      "approximationDisplay": "t",
      "roundsDisplay": "0",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "0",
        "tex": "0",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://dept-info.labri.fr/~gavoille/article/BGPW25.pdf#page=3",
            "title": "Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors",
            "location": "Table 1 and footnote 4"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierComparisons": [
        {
          "better": "folklore-degree-mds",
          "worse": "folklore-star-minor-mds",
          "strict": [
            "graphClass"
          ],
          "parameterDomain": "For every integer t ≥ 2, instantiate the general degree guarantee on the class of graphs with maximum degree Δ ≤ t−1.",
          "comparisonGraphClass": {
            "node": "degree",
            "label": "Maximum degree ≤ t−1"
          },
          "conditions": {
            "problem": "Both solve unweighted minimum dominating set by selecting every vertex.",
            "graphClass": "Every K1,t-minor-free graph has maximum degree at most t−1. The larger comparison class is maximum degree ≤ t−1, not all general graphs with a uniform factor t. For t ≥ 4 the containment is strict: a subcubic tree with t leaves contains K1,t as a minor while its degree is at most t−1. For t=2 or t=3 the two classes coincide.",
            "approximation": "On maximum-degree-(t−1) graphs, the general Δ+1 bound is at most t, matching the excluded-star guarantee.",
            "rounds": "Both use exactly zero communication rounds, with no parameter-dependent overhead.",
            "model": "Both are valid in CONGEST and use no messages or identifiers.",
            "randomness": "Both algorithms are deterministic.",
            "benchmark": "Both output integral dominating sets measured against integral OPT.",
            "assumptions": "Both are unweighted and need no degree or parameter knowledge. The parameter substitution is a property of the graph class, not extra information supplied to processors."
          },
          "evidenceUrl": "https://dept-info.labri.fr/~gavoille/article/BGPW25.pdf#page=3",
          "reason": "The excluded-star zero-round baseline is a specialization of the zero-round maximum-degree baseline. It has no separate frontier advantage for t ≥ 4 once the larger maximum-degree class is instantiated at Δ ≤ t−1. At t=2 or t=3 the classes coincide, so this is equivalence rather than strict dominance.",
          "domainGuard": "t ≥ 4"
        }
      ],
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "OPT",
          "description": "Minimum cardinality of a feasible solution",
          "tex": "\\mathrm{OPT}"
        },
        {
          "symbol": "D",
          "description": "Vertex set selected by the algorithm",
          "tex": "D"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "t",
          "description": "Number of leaves in the excluded star K_{1,t}",
          "tex": "t"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-f5f624e676f5e722507d",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-67f354a1ddafcbd4a3f4"
        ],
        "assumptions": [
          "auto-assumption-5a941652786b9818dce6"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-5a941652786b9818dce6",
          "auto-graph-f5f624e676f5e722507d",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-67f354a1ddafcbd4a3f4",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "folklore-regular-vc",
      "problem": "Vertex cover",
      "variant": "Unweighted; select all vertices",
      "objective": "min",
      "graphClass": "Regular; degree ≥ 1",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "2",
      "rounds": "0",
      "roundClass": "constant",
      "parameters": "All vertices have the same positive degree.",
      "assumptions": "Unweighted regular graphs of positive degree. No identifiers, degree knowledge, or communication are needed.",
      "paperId": "pic-bgpw-large-2025",
      "theorem": "Introduction, constant-round algorithms; footnote 1",
      "summary": "Selecting all vertices is a two-approximation on positive-degree regular graphs.",
      "verification": "primary",
      "sourceUrl": "https://dept-info.labri.fr/~gavoille/article/BGPW25.pdf#page=2",
      "year": 2025,
      "attribution": "folklore",
      "algorithm": "Every vertex selects itself.",
      "proofSketch": "A d-regular graph has dn/2 edges. A vertex cover of size p meets at most dp edges, so OPT ≥ n/2 for d ≥ 1.",
      "provenanceNote": "Folklore baseline documented by the cited source; 2025 is the source year, not a discovery claim.",
      "proofFormula": "|D| ≤ 2 OPT",
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "regular",
        "note": "The vertex-cover baseline assumes a positive regular degree. It does not select all vertices of a nonempty edgeless graph."
      },
      "prerequisite": "Positive regular degree",
      "approximationDisplay": "2",
      "roundsDisplay": "0",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "0",
        "tex": "0",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://dept-info.labri.fr/~gavoille/article/BGPW25.pdf#page=2",
            "title": "Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors",
            "location": "Introduction, constant-round algorithms; footnote 1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "Positive-degree regular · zero rounds",
        "setting": "Unweighted vertex cover on positive-degree regular graphs; deterministic CONGEST; zero rounds; no identifiers or degree knowledge required; factor 2.",
        "reason": "The zero-round construction attains factor 2, and zero communication is minimal. The deterministic constant-locality factor-2 lower bound already applies to cycles, which are regular. General-graph exact-2 algorithms with degree-dependent or polylogarithmic round complexities do not dominate this zero-round point.",
        "evidenceUrl": "https://jukkasuomela.fi/doc/linear-order.pdf#page=4",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "tightness": [
        {
          "certificateId": "regular-vertex-cover-factor-two",
          "resultId": "folklore-regular-vc",
          "graphs": [
            "regular",
            "cycle"
          ],
          "problems": [
            "vertex-cover"
          ],
          "models": [
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": []
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "OPT",
          "description": "Minimum cardinality of a feasible solution",
          "tex": "\\mathrm{OPT}"
        },
        {
          "symbol": "D",
          "description": "Vertex set selected by the algorithm",
          "tex": "D"
        },
        {
          "symbol": "d",
          "description": "Common positive degree of every vertex in the regular input graph",
          "tex": "d"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "p",
          "description": "Cardinality of the comparison vertex cover in the proof",
          "tex": "p"
        }
      ],
      "setting": {
        "summary": [
          "graph-regular-positive",
          "weights-unweighted"
        ],
        "parameters": [],
        "assumptions": [],
        "detail": [
          "strength-no-ids",
          "strength-no-degree-knowledge"
        ],
        "covered": [
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-7f07455ff69b3b347e9b",
          "graph-regular",
          "graph-regular-positive",
          "input-positive-degree",
          "strength-no-communication",
          "strength-no-degree-knowledge",
          "strength-no-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "folklore-unitdisk-vc",
      "problem": "Vertex cover",
      "variant": "Unweighted; select nonisolated vertices",
      "objective": "min",
      "graphClass": "Unit-disk",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "6",
      "rounds": "1",
      "roundClass": "constant",
      "parameters": "Unit-disk graphs in the plane.",
      "assumptions": "Unweighted. No geometric representation or identifiers are needed. One empty-message round detects isolates; zero rounds suffice if local degree is initially known.",
      "paperId": "pic-bgpw-large-2025",
      "theorem": "Introduction, constant-round algorithms",
      "summary": "Selecting every nonisolated vertex gives a geometry-free constant approximation.",
      "verification": "primary",
      "sourceUrl": "https://dept-info.labri.fr/~gavoille/article/BGPW25.pdf#page=2",
      "year": 2025,
      "attribution": "folklore",
      "algorithm": "Send a dummy message on every incident edge, then select vertices that receive a message.",
      "proofSketch": "Outside an optimum cover, nonisolated vertices form an independent set and each has a neighbor in the cover. A unit-disk neighborhood contains at most five independent neighbors, so at most five such vertices are charged to each optimum vertex. Including the cover itself gives factor six.",
      "provenanceNote": "Folklore baseline documented by the cited source; 2025 is the source year, not a discovery claim. The one-round isolate detection is an explicit implementation choice.",
      "proofFormula": "|D| ≤ 6 OPT",
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "unit-disk"
      },
      "approximationDisplay": "6",
      "roundsDisplay": "1",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "1",
        "tex": "1",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://dept-info.labri.fr/~gavoille/article/BGPW25.pdf#page=2",
            "title": "Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors",
            "location": "Introduction, constant-round algorithms"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "OPT",
          "description": "Minimum cardinality of a feasible solution",
          "tex": "\\mathrm{OPT}"
        },
        {
          "symbol": "D",
          "description": "Vertex set selected by the algorithm",
          "tex": "D"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-422a8fcd40a47bc44c15",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-0b7cb0040f1e25baeba5"
        ],
        "assumptions": [
          "auto-assumption-8465d976c4ce42e13ba6"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-8465d976c4ce42e13ba6",
          "auto-graph-422a8fcd40a47bc44c15",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-7f07455ff69b3b347e9b",
          "auto-parameter-0b7cb0040f1e25baeba5",
          "weights-unweighted"
        ]
      }
    }
  ],
  "results": [
    {
      "id": "sparse-expansion-constant",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Bounded expansion",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "O(1)",
      "rounds": "O(1)",
      "roundClass": "parameter",
      "parameters": "Fixed integer upper bound ∇₁ > 0 on the edge density of depth-1 minors. Both the approximation ratio and round complexity depend on ∇₁.",
      "assumptions": "Unique identifiers; an upper bound on ∇₁ is supplied; no embedding is supplied.",
      "paperId": "heydt-sparse-2022",
      "theorem": "Theorem 2.1 and following parameter-dependence discussion",
      "summary": "The approximation ratio and round complexity are bounded functions of the depth-1 density bound.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2207.02669#page=5",
      "year": 2022,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "expansion"
      },
      "approximationDisplay": "f(∇₁)",
      "roundsDisplay": "f(∇₁)",
      "approximationParameters": [
        {
          "symbol": "∇₁",
          "name": "depth-one density",
          "introduced": false,
          "displaySymbol": true
        }
      ],
      "roundParameters": [
        {
          "symbol": "∇₁",
          "name": "depth-one density",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(∇₁)",
        "tex": "f\\bigl(\\nabla_1\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2207.02669#page=5",
            "title": "Distributed domination on sparse graph classes",
            "location": "Theorem 2.1 and following parameter-dependence discussion"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Supplied upper bound on depth-one minor density",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-18d80e24949ad78541c0",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-18eb64ecbc1e49e9ea9e"
        ],
        "assumptions": [
          "auto-assumption-a3374a86e4b667605804"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-a3374a86e4b667605804",
          "auto-graph-18d80e24949ad78541c0",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-18eb64ecbc1e49e9ea9e",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "sparse-planar-eleven",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "11 + ε",
      "rounds": "O(1)",
      "roundClass": "parameter",
      "parameters": "Fixed ε > 0; the round complexity depends on ε.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "heydt-sparse-2022",
      "theorem": "Abstract",
      "summary": "The planar specialization improves the approximation guarantee.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2207.02669",
      "year": 2022,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "11 + ε",
      "roundsDisplay": "f(ε)",
      "roundParameters": [
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(ε)",
        "tex": "f\\bigl(\\varepsilon\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2207.02669",
            "title": "Distributed domination on sparse graph classes",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierComparisons": [
        {
          "better": "gen-asw26-planar",
          "worse": "sparse-planar-eleven",
          "strict": [
            "approximation"
          ],
          "conditions": {
            "problem": "Both solve unweighted minimum dominating set and output an integral vertex set.",
            "graphClass": "Both guarantees hold on all planar graphs; no graph-class strengthening is inferred.",
            "approximation": "The exact coefficient 7 is strictly smaller than 11 + ε for every ε > 0.",
            "rounds": "The newer round complexity is a universal constant, independent of ε. The older bound is f(ε), with its accuracy dependence retained. At the advertised asymptotic level the universal O(1) bound has no accuracy-dependent overhead. This does not compare unknown numerical round counts or identify f(ε) with a universal constant.",
            "model": "The newer algorithm uses broadcast CONGEST and therefore also works in LOCAL; message restrictions are stronger, not an extra graph or input requirement.",
            "randomness": "Both algorithms are deterministic.",
            "benchmark": "The newer integral output is bounded against fractional OPT, which is at most integral OPT; it therefore also satisfies the older integral-OPT convention.",
            "assumptions": "Use the standard unique O(log n)-bit identifier convention. Neither statement requires an embedding, a maximum-degree bound, or an externally supplied solution. This certificate does not apply to variants with a different initial-information convention."
          },
          "evidenceUrl": "https://arxiv.org/pdf/2611.02057",
          "reason": "Exact factor 7 replaces the 11 + ε planar guarantee using a universal constant round complexity, while the earlier round complexity depends on ε. The source introduction traces the constant-factor improvements; Theorem C(i) gives the new guarantee."
        }
      ],
      "dominatedBy": [
        "gen-asw26-planar"
      ],
      "frontierStatus": "dominated",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-34f494bd0c1a858c0a42"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-34f494bd0c1a858c0a42",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "chang-independent-logstar",
      "problem": "Independent set",
      "variant": "Unweighted",
      "objective": "max",
      "graphClass": "Excluded fixed minor",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − ε",
      "rounds": "O(ε⁻¹ log* n) + ε⁻O(1)",
      "roundClass": "logstar",
      "parameters": "Fixed excluded minor and 0 < ε < 1.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "chang-minor-2023",
      "theorem": "Abstract",
      "summary": "A deterministic approximation scheme with bounded messages.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2304.04699",
      "year": 2023,
      "problemScope": {
        "node": "independent-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "O(ε⁻¹ log* n) + ε⁻O(1)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(ε⁻¹ log* n) + ε⁻O(1)",
        "tex": "O(\\varepsilon^{-1}\\log^*n)+\\varepsilon^{-O(1)}",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2304.04699",
            "title": "Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Unweighted maximum independent set; deterministic CONGEST; fixed nonplanar excluded minor H and fixed 0 < ε < 1/2; (1−ε) times the integral optimum.",
        "reason": "Optimal Θ(log* n) dependence on n for fixed H and ε. The March 2026 version gives the upper bound and a matching LOCAL lower bound on paths and cycles. This does not certify optimal dependence on H or ε.",
        "evidenceUrl": "https://arxiv.org/pdf/2304.04699v2",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-nonplanar-H",
          "parameter-epsilon-half"
        ]
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "minor-free-independent-n-rounds",
          "resultId": "chang-independent-logstar",
          "graphs": [
            "minor",
            "planar",
            "outerplanar",
            "forest",
            "path",
            "oriented-path",
            "cycle"
          ],
          "problems": [
            "independent-set"
          ],
          "models": [
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": [
            "scope-rounds-n-H-epsilon",
            "parameter-nonplanar-H",
            "parameter-epsilon-half"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-e40ef97c3969c67aad8c",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-ce8a0b4b55d3e5cea9b6"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-e40ef97c3969c67aad8c",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-4ad7b7801c4e84e8fdd9",
          "auto-parameter-ce8a0b4b55d3e5cea9b6",
          "parameter-epsilon-positive",
          "parameter-epsilon-unit",
          "parameter-fixed-H",
          "parameter-fixed-epsilon",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "supported-client-planar",
      "problem": "Client dominating set",
      "variant": "Minimum client dominating set",
      "objective": "min",
      "graphClass": "Planar",
      "model": "SUPPORTED",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "O(1)",
      "roundClass": "parameter",
      "parameters": "Fixed ε > 0; only online rounds are counted.",
      "assumptions": "Preprocessing of the support topology is allowed. Only the designated clients must be dominated.",
      "paperId": "agrawal-supported-2022",
      "theorem": "Abstract",
      "summary": "A scheme for recurring client sets; preprocessing is essential.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2212.14542",
      "year": 2022,
      "problemScope": {
        "node": "client-dominating-set"
      },
      "problemSource": "Dominating set",
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "f(ε)",
      "roundParameters": [
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(ε)",
        "tex": "f\\bigl(\\varepsilon\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2212.14542",
            "title": "Recurrent Problems in the LOCAL model",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted",
          "model-supported-preprocessing"
        ],
        "parameters": [
          "auto-parameter-47955123d1ab13811753"
        ],
        "assumptions": [
          "auto-assumption-40b36c6041358c068e48"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-40b36c6041358c068e48",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-b67c8cccac8764b919fe",
          "auto-output-750423ed7257675c4903",
          "auto-parameter-47955123d1ab13811753",
          "model-supported-preprocessing",
          "output-client-domination",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "dory-weighted-domination",
      "problem": "Dominating set",
      "variant": "Weighted",
      "objective": "min",
      "graphClass": "Arboricity ≤ α",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(2α + 1)(1 + ε)",
      "rounds": "O(ε⁻¹ log Δ)",
      "roundClass": "degree",
      "parameters": "0 < ε < 1; α is known. Δ is the maximum degree.",
      "assumptions": "Positive integer vertex weights bounded by nᶜ for a constant c.",
      "paperId": "dory-arboricity-2022",
      "theorem": "Abstract",
      "summary": "A primal-dual algorithm with logarithmic degree dependence.",
      "verification": "primary",
      "sourceUrl": "https://link.springer.com/article/10.1007/s00446-023-00447-z",
      "year": 2022,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "density",
        "note": "Use compatible fixed arboricity bounds; planar inputs permit an arboricity bound of 3."
      },
      "approximationDisplay": "(2α + 1)(1 + ε)",
      "roundsDisplay": "O(ε⁻¹ log Δ)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(ε⁻¹ log Δ)",
        "tex": "O(\\varepsilon^{-1}\\log\\Delta)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://link.springer.com/article/10.1007/s00446-023-00447-z",
            "title": "Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "c",
          "description": "Fixed exponent bounding positive integer vertex weights by n^c",
          "tex": "c"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication network",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "α",
          "description": "Arboricity bound of the input graph",
          "tex": "\\alpha"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-97a0a2af0e526b2ffcd5",
          "weights-weighted"
        ],
        "parameters": [
          "auto-parameter-c1636b1b5a093071fc57"
        ],
        "assumptions": [
          "auto-assumption-895ecf81e2a512b52c01"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-895ecf81e2a512b52c01",
          "auto-graph-97a0a2af0e526b2ffcd5",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-c1636b1b5a093071fc57",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "dory-arboricity-lower",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Arboricity 2",
      "model": "LOCAL",
      "randomization": "Randomized",
      "bound": "lower",
      "approximation": "Constant or polylogarithmic factor",
      "rounds": "Ω(log Δ / log log Δ)",
      "roundClass": "degree",
      "parameters": "Δ is the maximum degree.",
      "assumptions": "Unweighted graphs; the lower bound applies to deterministic and randomized LOCAL algorithms.",
      "paperId": "dory-arboricity-2022",
      "theorem": "Lower bound theorem",
      "summary": "Bounded arboricity alone does not give constant-round domination.",
      "verification": "primary",
      "sourceUrl": "https://pmc.ncbi.nlm.nih.gov/articles/PMC11543758/",
      "year": 2022,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "arboricity-two"
      },
      "approximationDisplay": "Constant or polylogarithmic factor",
      "roundsDisplay": "Ω(log Δ / log log Δ)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Ω(log Δ / log log Δ)",
        "tex": "\\Omega\\!\\left(\\frac{\\log\\Delta}{\\log\\log\\Delta}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://pmc.ncbi.nlm.nih.gov/articles/PMC11543758/",
            "title": "Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs",
            "location": "Lower bound theorem"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "arboricity-domination-rounds",
          "resultId": "dory-arboricity-lower",
          "graphs": [
            "arboricity-two",
            "density"
          ],
          "problems": [
            "dominating-set"
          ],
          "models": [
            "LOCAL",
            "CONGEST"
          ],
          "conditionIds": [
            "parameter-fixed-alpha-ge2"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a6106837b5e5e7d68a12",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-0bb93829ec58e258a2dd"
        ],
        "assumptions": [
          "auto-assumption-c882a0c21e6fc58b26e1"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-c882a0c21e6fc58b26e1",
          "auto-graph-a6106837b5e5e7d68a12",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-0bb93829ec58e258a2dd",
          "parameter-alpha-ge1",
          "parameter-fixed-alpha",
          "parameter-fixed-alpha-ge2",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "chang-su-matching",
      "problem": "Maximum matching",
      "variant": "Weighted",
      "objective": "max",
      "graphClass": "Excluded fixed minor",
      "model": "CONGEST",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "1 − ε",
      "rounds": "poly(log n, 1/ε)",
      "roundClass": "polylog",
      "parameters": "Fixed excluded minor and 0 < ε < 1.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "chang-su-2022",
      "theorem": "Abstract",
      "summary": "Expander decomposition permits bounded-message approximation.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2205.08093",
      "year": 2022,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "poly(log n, 1/ε)",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "poly(log n, 1/ε)",
        "tex": "\\operatorname{poly}(\\log n,1/\\varepsilon)",
        "basis": "stated",
        "explanation": "Theorem 1.1 states this bound for randomized CONGEST maximum weighted matching on H-minor-free graphs. The multiplicative constant may depend on H; the O(1) exponents are explicitly independent of H. Their numerical values are not specified.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2205.08093",
            "title": "Narrowing the LOCAL–CONGEST Gaps in Sparse Networks via Expander Decompositions",
            "location": "Theorem 1.1 and the paragraph immediately following it (PDF p. 5); matching analysis near Theorem 1.1 proof"
          }
        ],
        "parameters": [
          {
            "symbol": "ε",
            "description": "Approximation accuracy, 0 < ε < 1",
            "tex": "\\varepsilon"
          },
          {
            "symbol": "H",
            "description": "Fixed graph excluded as a minor",
            "tex": "H"
          },
          {
            "symbol": "n",
            "description": "Number of vertices",
            "tex": "n"
          }
        ],
        "checked": "2026-11-16",
        "audited": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "n",
          "description": "Number of vertices",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy, 0 < ε < 1",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-e40ef97c3969c67aad8c",
          "weights-weighted"
        ],
        "parameters": [
          "auto-parameter-ce8a0b4b55d3e5cea9b6"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-e40ef97c3969c67aad8c",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-ce8a0b4b55d3e5cea9b6",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "chang-su-independent",
      "problem": "Independent set",
      "variant": "Unweighted",
      "objective": "max",
      "graphClass": "Excluded fixed minor",
      "model": "CONGEST",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "1 − ε",
      "rounds": "poly(log n, 1/ε)",
      "roundClass": "polylog",
      "parameters": "Fixed excluded minor and 0 < ε < 1.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "chang-su-2022",
      "theorem": "Abstract",
      "summary": "Expander decomposition permits bounded-message approximation.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2205.08093",
      "year": 2022,
      "problemScope": {
        "node": "independent-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "poly(log n, 1/ε)",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "poly(log n, 1/ε)",
        "tex": "\\operatorname{poly}(\\log n,1/\\varepsilon)",
        "basis": "stated",
        "explanation": "Theorem 1.2 gives this randomized CONGEST bound. It separately gives a deterministic bound ε^(−O(1)) · 2^(O(√(log n log log n))); that deterministic statement must not replace this randomized row. No numerical polynomial exponents are stated.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2205.08093",
            "title": "Narrowing the LOCAL–CONGEST Gaps in Sparse Networks via Expander Decompositions",
            "location": "Theorem 1.2 (PDF p. 5)"
          }
        ],
        "parameters": [
          {
            "symbol": "ε",
            "description": "Approximation accuracy, 0 < ε < 1",
            "tex": "\\varepsilon"
          },
          {
            "symbol": "H",
            "description": "Fixed graph excluded as a minor",
            "tex": "H"
          },
          {
            "symbol": "n",
            "description": "Number of vertices",
            "tex": "n"
          }
        ],
        "checked": "2026-11-16",
        "audited": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "n",
          "description": "Number of vertices",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy, 0 < ε < 1",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-e40ef97c3969c67aad8c",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-ce8a0b4b55d3e5cea9b6"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-e40ef97c3969c67aad8c",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-4ad7b7801c4e84e8fdd9",
          "auto-parameter-ce8a0b4b55d3e5cea9b6",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "heydt-planar-twenty",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "20",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "No fixed degree bound is required.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "heydt-planar-2021",
      "theorem": "Abstract",
      "summary": "Historical bound combining local reductions and greedy domination.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2111.14506v1",
      "year": 2021,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "20",
      "roundsDisplay": "Constant",
      "roundCountEvidence": {
        "basis": "not-specified",
        "explanation": "The paper gives two rounds for D1 and two further rounds for D2, and mentions thirty greedy iterations. These are not a complete communication count: the residual-degree updates and selection notifications also require communication. The available description does not give a verified total for the full algorithm.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2111.14506v1",
            "title": "Primary source reviewed",
            "location": "Section 3 PDF p. 4; Section 4 PDF p. 5; Section 5 PDF p. 7; introduction PDF p. 2"
          }
        ],
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "Constant",
        "tex": "\\text{Constant}",
        "basis": "not-specified",
        "explanation": "The paper gives two rounds for D1 and two further rounds for D2, and mentions thirty greedy iterations. These are not a complete communication count: the residual-degree updates and selection notifications also require communication. The available description does not give a verified total for the full algorithm.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2111.14506v1",
            "title": "Primary source reviewed",
            "location": "Section 3 PDF p. 4; Section 4 PDF p. 5; Section 5 PDF p. 7; introduction PDF p. 2"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierComparisons": [
        {
          "better": "gen-asw26-planar",
          "worse": "heydt-planar-twenty",
          "strict": [
            "approximation"
          ],
          "conditions": {
            "problem": "Both solve unweighted minimum dominating set and output an integral vertex set.",
            "graphClass": "Both guarantees hold on all planar graphs; no graph-class strengthening is inferred.",
            "approximation": "The exact coefficient 7 is strictly smaller than 20.",
            "rounds": "Both cataloged statements give a universal constant round complexity. This comparison concerns the stated asymptotic round complexity, not unknown absolute round counts.",
            "model": "The newer algorithm uses broadcast CONGEST and therefore also works in LOCAL; message restrictions are stronger, not an extra graph or input requirement.",
            "randomness": "Both algorithms are deterministic.",
            "benchmark": "The newer integral output is bounded against fractional OPT, which is at most integral OPT; it therefore also satisfies the older integral-OPT convention.",
            "assumptions": "Use the standard unique O(log n)-bit identifier convention. Neither statement requires an embedding, a maximum-degree bound, or an externally supplied solution. This certificate does not apply to variants with a different initial-information convention."
          },
          "evidenceUrl": "https://arxiv.org/pdf/2611.02057",
          "reason": "Exact factor 7 replaces the 20 planar guarantee within the advertised unspecified constant-round regime. The source introduction traces the constant-factor improvements; Theorem C(i) gives the new guarantee."
        }
      ],
      "dominatedBy": [
        "gen-asw26-planar"
      ],
      "frontierStatus": "dominated",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-368afe424cc1014e2254"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-368afe424cc1014e2254",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "morgan-arboricity",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Arboricity ≤ α",
      "model": "CONGEST",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "O(α)",
      "rounds": "O(α log n)",
      "roundClass": "logarithmic",
      "parameters": "α is the arboricity bound.",
      "assumptions": "Unweighted; the stated round complexity is achieved with high probability.",
      "paperId": "morgan-arboricity-2021",
      "theorem": "Abstract",
      "summary": "A combinatorial alternative to LP rounding.",
      "verification": "primary",
      "sourceUrl": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.33",
      "year": 2021,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "density",
        "note": "Use compatible fixed arboricity bounds; planar inputs permit an arboricity bound of 3."
      },
      "approximationDisplay": "O(α)",
      "roundsDisplay": "O(α log n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(α log n)",
        "tex": "O(\\alpha  \\log n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.33",
            "title": "Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs: Simpler, Faster, and Combinatorial",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "α",
          "description": "Arboricity bound of the input graph",
          "tex": "\\alpha"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-97a0a2af0e526b2ffcd5",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-d6747b2e215206975909"
        ],
        "assumptions": [
          "auto-assumption-8e4374cee15dc4d80d36"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-8e4374cee15dc4d80d36",
          "auto-graph-97a0a2af0e526b2ffcd5",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-d6747b2e215206975909",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "outerplanar-five",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Outerplanar",
      "model": "Anonymous",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "5",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "No fixed degree bound is required.",
      "assumptions": "Only degrees and neighbors’ degree categories are needed; unique IDs are unnecessary.",
      "paperId": "bonamy-outerplanar-2021",
      "theorem": "Theorem 1",
      "summary": "A degree-based algorithm with a tight constant guarantee.",
      "verification": "primary",
      "sourceUrl": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.13",
      "year": 2021,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "outerplanar"
      },
      "approximationDisplay": "5",
      "roundsDisplay": "1",
      "roundCountEvidence": {
        "basis": "stated",
        "explanation": "Algorithm 1 explicitly uses the first round to exchange local degrees. Each vertex then selects itself if its degree is at least four or if it has no neighbor of degree at least four. The source assumes incident ports and local degree are initially available. Neither identifiers nor an embedding are needed.",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol209-disc2021/LIPIcs.DISC.2021.13/LIPIcs.DISC.2021.13.pdf#page=2",
            "title": "Primary source communication schedule",
            "location": "Theorem 1; Algorithm 1, PDF p. 2 (printed 13:2)"
          }
        ],
        "rounds": "1",
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "1",
        "tex": "1",
        "basis": "stated",
        "explanation": "Algorithm 1 explicitly uses the first round to exchange local degrees. Each vertex then selects itself if its degree is at least four or if it has no neighbor of degree at least four. The source assumes incident ports and local degree are initially available. Neither identifiers nor an embedding are needed.",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol209-disc2021/LIPIcs.DISC.2021.13/LIPIcs.DISC.2021.13.pdf#page=2",
            "title": "Primary source communication schedule",
            "location": "Theorem 1; Algorithm 1, PDF p. 2 (printed 13:2)"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Unweighted MDS on outerplanar graphs; deterministic one-round LOCAL algorithm; integral optimum. The round count uses the source convention that local degree and incident ports are initially available.",
        "reason": "Theorem 1 gives factor 5, with the one-round implementation stated in Algorithm 1. Its matching lower bound rules out every smaller factor even with an arbitrary constant number of LOCAL rounds. The algorithm does not require identifiers or an embedding; no claim that one round is necessary is made.",
        "evidenceUrl": "https://arxiv.org/abs/2108.02697v2",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "tightness": [
        {
          "certificateId": "outerplanar-factor-five",
          "resultId": "outerplanar-five",
          "graphs": [
            "outerplanar"
          ],
          "problems": [
            "dominating-set"
          ],
          "models": [
            "Anonymous",
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": []
        }
      ],
      "parameterDefinitions": [],
      "setting": {
        "summary": [
          "auto-graph-2379fa66cc1a5f1d4e5c",
          "weights-unweighted",
          "model-port-numbering",
          "input-own-degree",
          "input-incident-ports"
        ],
        "parameters": [
          "auto-parameter-368afe424cc1014e2254"
        ],
        "assumptions": [],
        "detail": [
          "strength-no-ids"
        ],
        "covered": [
          "auto-graph-2379fa66cc1a5f1d4e5c",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-92362405df7c8f0d5040",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-368afe424cc1014e2254",
          "input-incident-ports",
          "input-own-degree",
          "model-port-numbering",
          "strength-no-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "outerplanar-five-lower",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Outerplanar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "approximation": "No (5 − ε)-approximation",
      "rounds": "O(1) rounds ruled out",
      "roundClass": "constant",
      "parameters": "Any fixed ε > 0.",
      "assumptions": "Deterministic LOCAL algorithms, including algorithms with unique IDs.",
      "paperId": "bonamy-outerplanar-2021",
      "theorem": "Theorem 1",
      "summary": "No smaller constant factor is possible in constant time.",
      "verification": "primary",
      "sourceUrl": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.13",
      "year": 2021,
      "roundBudgetExcluded": true,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "outerplanar"
      },
      "approximationDisplay": "> 5 − ε",
      "roundsDisplay": "Constant rounds ruled out",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Constant rounds ruled out",
        "tex": "\\text{Constant rounds ruled out}",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.13",
            "title": "A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs",
            "location": "Theorem 1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "outerplanar-factor-five",
          "resultId": "outerplanar-five-lower",
          "graphs": [
            "outerplanar"
          ],
          "problems": [
            "dominating-set"
          ],
          "models": [
            "LOCAL",
            "CONGEST"
          ],
          "conditionIds": []
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-2379fa66cc1a5f1d4e5c",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-8359c573af80d8ec5226"
        ],
        "assumptions": [
          "auto-assumption-89aac91807f1f88e4b7c"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-89aac91807f1f88e4b7c",
          "auto-graph-2379fa66cc1a5f1d4e5c",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-8359c573af80d8ec5226",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "kublenz-expansion",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Bounded expansion",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "O(1)",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "Known upper bound ∇₁ on the edge density of depth-1 minors; t is the least integer such that Kₜ,ₜ is absent as a subgraph, with t ≤ 2∇₁ + 1. The approximation ratio depends on these parameters; the number of LOCAL communication rounds is universally bounded.",
      "assumptions": "Unique identifiers; an upper bound on ∇₁ is supplied; no embedding is supplied.",
      "paperId": "kublenz-expansion-2020",
      "theorem": "Theorem 1.1; Section 6 (corrected v3)",
      "summary": "The corrected algorithm uses a universal constant number of LOCAL communication phases; its approximation ratio depends on the depth-1 density.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2012.02701v3#S6",
      "year": 2020,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "expansion"
      },
      "approximationDisplay": "f(∇₁)",
      "roundsDisplay": "≤ 11",
      "approximationParameters": [
        {
          "symbol": "∇₁",
          "name": "depth-one density",
          "introduced": false,
          "displaySymbol": true
        }
      ],
      "roundCountEvidence": {
        "basis": "phase-count",
        "explanation": "A conservative sequential count is 3 + 7 + 1 = 11: two rounds to inspect radius-two neighborhoods and one to mark neighbors of D1; then two neighborhood exchanges, two rounds to compute sequences, two to report their endpoints, and one to mark neighbors of D2; finally, the source includes a last selection step. This includes that final step conservatively and does not claim an optimized schedule. The algorithm uses distinct identifiers and a supplied upper bound on depth-one density.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2012.02701v3#page=15",
            "title": "Primary source communication schedule",
            "location": "Section 2, PDF pp. 6–7; Section 6, PDF p. 15; corrected arXiv v3"
          }
        ],
        "rounds": "≤ 11",
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "≤ 11",
        "tex": "\\le 11",
        "basis": "phase-count",
        "explanation": "A conservative sequential count is 3 + 7 + 1 = 11: two rounds to inspect radius-two neighborhoods and one to mark neighbors of D1; then two neighborhood exchanges, two rounds to compute sequences, two to report their endpoints, and one to mark neighbors of D2; finally, the source includes a last selection step. This includes that final step conservatively and does not claim an optimized schedule. The algorithm uses distinct identifiers and a supplied upper bound on depth-one density.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2012.02701v3#page=15",
            "title": "Primary source communication schedule",
            "location": "Section 2, PDF pp. 6–7; Section 6, PDF p. 15; corrected arXiv v3"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Supplied upper bound on depth-one minor density",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "t",
          "description": "Least integer for which the complete bipartite graph K_{t,t} is absent as a subgraph; t ≤ 2∇₁+1",
          "tex": "t"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-18d80e24949ad78541c0",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-399ec73f7f5ad61ad9de"
        ],
        "assumptions": [
          "auto-assumption-a3374a86e4b667605804"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-a3374a86e4b667605804",
          "auto-graph-18d80e24949ad78541c0",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-399ec73f7f5ad61ad9de",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "amiri-locally-embeddable",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Locally embeddable",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "6c²t + (2t + 5)c + 4",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "∇₁(G) is the maximum edge density |E(H)|/|V(H)| over nonempty depth-1 minors H of G. The supplied integer c satisfies c ≥ ∇₁(G); one may take c=⌈∇₁(G)⌉ if supplied. For a fixed integer t ≥ 3, K₃,ₜ is excluded as a depth-1 minor. The approximation ratio depends on c and t; the number of LOCAL communication rounds is universally bounded.",
      "assumptions": "Unique identifiers; a supplied integer c bounds the edge density of every depth-1 minor; no embedding is supplied.",
      "paperId": "amiri-beyond-2017",
      "theorem": "Algorithm 1; Lemma 3.8",
      "summary": "A fixed number of LOCAL communication phases gives an approximation depending on the local embeddability parameters.",
      "verification": "primary",
      "sourceUrl": "https://schmiste.github.io/talg19ds.pdf#page=11",
      "year": 2017,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "local-embedding"
      },
      "approximationDisplay": "6c²t + (2t + 5)c + 4",
      "roundsDisplay": "≤ 6",
      "roundCountEvidence": {
        "basis": "phase-count",
        "explanation": "Rounds 1–2: exchange identifiers then neighbor lists; decide phase-one set D using adjacencies from N(v) to candidate vertices in N²(v). Round 3: broadcast D membership; each vertex knows whether it lies in N[D]. Round 4: broadcast uncovered flags; each vertex computes residual closed-neighborhood degree. Round 5: broadcast residual degrees; each uncovered vertex chooses its dominator. Round 6: notify selected neighbors; all vertices know final membership. The source initially gives only each vertex its own ID. Unbounded LOCAL messages permit the lists. Auxiliary density c and excluded-depth-one-minor t affect local computation/analysis, not communication phases.",
        "evidence": [
          {
            "url": "https://schmiste.github.io/talg19ds.pdf#page=7",
            "title": "Primary source algorithm",
            "location": "Algorithm 1, PDF pp. 6–7; modified density threshold; Lemma 3.8"
          }
        ],
        "rounds": "≤ 6",
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "≤ 6",
        "tex": "\\le 6",
        "basis": "phase-count",
        "explanation": "Rounds 1–2: exchange identifiers then neighbor lists; decide phase-one set D using adjacencies from N(v) to candidate vertices in N²(v). Round 3: broadcast D membership; each vertex knows whether it lies in N[D]. Round 4: broadcast uncovered flags; each vertex computes residual closed-neighborhood degree. Round 5: broadcast residual degrees; each uncovered vertex chooses its dominator. Round 6: notify selected neighbors; all vertices know final membership. The source initially gives only each vertex its own ID. Unbounded LOCAL messages permit the lists. Auxiliary density c and excluded-depth-one-minor t affect local computation/analysis, not communication phases.",
        "evidence": [
          {
            "url": "https://schmiste.github.io/talg19ds.pdf#page=7",
            "title": "Primary source algorithm",
            "location": "Algorithm 1, PDF pp. 6–7; modified density threshold; Lemma 3.8"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁(G)",
          "description": "Maximum edge-to-vertex ratio over nonempty depth-one minors of G",
          "tex": "\\nabla_1(G)"
        },
        {
          "symbol": "∇₁",
          "description": "Depth-one minor density of the input graph",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "G",
          "description": "Input graph",
          "tex": "G"
        },
        {
          "symbol": "H",
          "description": "A minor of the input graph; depth one in the locally embeddable result",
          "tex": "H"
        },
        {
          "symbol": "c",
          "description": "Supplied integer upper bound on depth-one minor density ∇₁(G)",
          "tex": "c"
        },
        {
          "symbol": "t",
          "description": "Integer at least three such that K_{3,t} is excluded as a depth-one minor",
          "tex": "t"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-3e2ec5f6ef8ff6c28460",
          "weights-unweighted",
          "parameter-depth-one-excluded-k3t",
          "input-integer-depth-one-density"
        ],
        "parameters": [
          "parameter-depth-one-density-definition"
        ],
        "assumptions": [
          "input-distinct-ids",
          "strength-no-embedding"
        ],
        "detail": [
          "detail-depth-one-integer-ceiling"
        ],
        "covered": [
          "auto-graph-3e2ec5f6ef8ff6c28460",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "detail-depth-one-integer-ceiling",
          "input-distinct-ids",
          "input-integer-depth-one-density",
          "parameter-depth-one-density-definition",
          "parameter-depth-one-excluded-k3t",
          "strength-no-embedding",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "amiri-genus-ptas",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Bounded genus",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "O(log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed genus g and ε > 0.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "amiri-beyond-2017",
      "theorem": "Abstract",
      "summary": "A local approximation scheme for bounded genus.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/1705.09617",
      "year": 2017,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "orientable",
        "note": "The historical record does not establish applicability to every bounded Euler-genus family."
      },
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "O(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log* n)",
        "tex": "O(\\log^* n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/1705.09617",
            "title": "Distributed Dominating Set Approximations beyond Planar Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "g",
          "description": "Fixed genus bound in the convention of the source",
          "tex": "g"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-328b3babf04eeaf07339",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-09168808af1df2c8e6de"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-328b3babf04eeaf07339",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-09168808af1df2c8e6de",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "czygrinow-topological-dom",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Excluded topological Kₕ",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "O(1)",
      "rounds": "O(1)",
      "roundClass": "parameter",
      "parameters": "Fixed h; both constants depend on h.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "czygrinow-minor-2018",
      "theorem": "Abstract",
      "summary": "Constant-factor domination under topological-minor exclusion.",
      "verification": "primary",
      "sourceUrl": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.22",
      "year": 2018,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "topological"
      },
      "approximationDisplay": "f(h)",
      "roundsDisplay": "f(h)",
      "approximationParameters": [
        {
          "symbol": "h",
          "name": "excluded minor size",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundParameters": [
        {
          "symbol": "h",
          "name": "excluded minor size",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(h)",
        "tex": "f\\bigl(h\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.22",
            "title": "Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "h",
          "description": "Number of vertices in the excluded complete graph K_h",
          "tex": "h"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-f06d27c0e3b1ee4832f6",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-37cf69063665c567a1b7"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-f06d27c0e3b1ee4832f6",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-37cf69063665c567a1b7",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "czygrinow-minor-ptas",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Excluded Kₕ minor",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "O(log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed h and ε > 0.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "czygrinow-minor-2018",
      "theorem": "Abstract",
      "summary": "A scheme on a proper minor-closed family.",
      "verification": "primary",
      "sourceUrl": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.22",
      "year": 2018,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "O(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log* n)",
        "tex": "O(\\log^* n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.22",
            "title": "Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "h",
          "description": "Number of vertices in the excluded complete graph K_h",
          "tex": "h"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-0c9054ce7c0f254cff8a",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-54a27f04a63e72da0dd9"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-0c9054ce7c0f254cff8a",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-54a27f04a63e72da0dd9",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "amiri-distance",
      "problem": "Distance-r dominating set",
      "variant": "Distance r",
      "objective": "min",
      "graphClass": "Bounded expansion",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "O(1)",
      "rounds": "O(r² log n)",
      "roundClass": "logarithmic",
      "parameters": "Fixed expansion class and distance r.",
      "assumptions": "Broadcast CONGEST; connected output requires a connected input.",
      "paperId": "amiri-distance-2017",
      "theorem": "Abstract",
      "summary": "Sparse neighborhood covers yield an approximation.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/1702.02848",
      "year": 2017,
      "problemScope": {
        "node": "distance-dominating-set"
      },
      "problemParameter": "r",
      "problemParameterName": "distance radius",
      "problemSource": "Distance dominating set",
      "graphScope": {
        "node": "expansion"
      },
      "approximationDisplay": "F(r, f)",
      "roundsDisplay": "O(r² log n)",
      "approximationParameters": [
        {
          "symbol": "r",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "f",
          "name": "expansion function",
          "introduced": false,
          "displaySymbol": true
        }
      ],
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(r² log n)",
        "tex": "O(r^2\\log n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/1702.02848",
            "title": "Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "F",
          "description": "Unspecified function of the displayed parameters",
          "tex": "F"
        },
        {
          "symbol": "f",
          "description": "Expansion function bounding shallow-minor edge densities at each radius",
          "tex": "f",
          "sourceSymbol": "class"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "r"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-18d80e24949ad78541c0",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-4896d040e95ba8df7a1b"
        ],
        "assumptions": [
          "auto-assumption-a1335d5c279ce2f65aa3"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-a1335d5c279ce2f65aa3",
          "auto-graph-18d80e24949ad78541c0",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-4bc26b2a562297a647e1",
          "auto-parameter-4896d040e95ba8df7a1b",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "amiri-connected-distance",
      "problem": "Connected distance-r dominating set",
      "variant": "Connected distance r",
      "objective": "min",
      "graphClass": "Bounded expansion",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "O(1)",
      "rounds": "O(r² log n)",
      "roundClass": "logarithmic",
      "parameters": "Fixed expansion class and distance r.",
      "assumptions": "Broadcast CONGEST; connected output requires a connected input.",
      "paperId": "amiri-distance-2017",
      "theorem": "Abstract",
      "summary": "Sparse neighborhood covers yield an approximation.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/1702.02848",
      "year": 2017,
      "problemScope": {
        "node": "connected-distance-dominating-set"
      },
      "problemParameter": "r",
      "problemParameterName": "distance radius",
      "problemSource": "Connected dominating set",
      "graphScope": {
        "node": "expansion"
      },
      "approximationDisplay": "F(r, f)",
      "roundsDisplay": "O(r² log n)",
      "approximationParameters": [
        {
          "symbol": "r",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "f",
          "name": "expansion function",
          "introduced": false,
          "displaySymbol": true
        }
      ],
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(r² log n)",
        "tex": "O(r^2\\log n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/1702.02848",
            "title": "Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "F",
          "description": "Unspecified function of the displayed parameters",
          "tex": "F"
        },
        {
          "symbol": "f",
          "description": "Expansion function bounding shallow-minor edge densities at each radius",
          "tex": "f",
          "sourceSymbol": "class"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "r"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-18d80e24949ad78541c0",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-4896d040e95ba8df7a1b"
        ],
        "assumptions": [
          "auto-assumption-a1335d5c279ce2f65aa3"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-a1335d5c279ce2f65aa3",
          "auto-graph-18d80e24949ad78541c0",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-f0d9c1f064503cf5f16e",
          "auto-parameter-4896d040e95ba8df7a1b",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "amiri-planar-connected",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "O(1)",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "No degree bound.",
      "assumptions": "Connected unweighted input; uses a constant-factor dominating set as a subroutine.",
      "paperId": "amiri-distance-2017",
      "theorem": "Abstract",
      "summary": "A local connector multiplies the domination ratio by at most six.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/1702.02848",
      "year": 2017,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "Constant",
      "roundsDisplay": "≤ 10",
      "roundCountEvidence": {
        "basis": "phase-count",
        "explanation": "The connecting procedure takes 3r + 1 rounds. With r = 1, this adds four rounds to the six-round planar dominating-set algorithm explicitly used in the paper, giving at most ten rounds in total. This is an upper bound for that composition, not a minimum-round claim. Inputs are connected, unweighted planar graphs with distinct identifiers.",
        "evidence": [
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Primary source for the algorithm",
            "location": "Section 5 Connected Dominating Sets; LPW PDF page 14"
          },
          {
            "url": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf#page=14",
            "title": "Lenzen–Pignolet–Wattenhofer, six-round schedule",
            "location": "Lemma 6.1"
          }
        ],
        "rounds": "≤ 10",
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "≤ 10",
        "tex": "\\le 10",
        "basis": "phase-count",
        "explanation": "The connecting procedure takes 3r + 1 rounds. With r = 1, this adds four rounds to the six-round planar dominating-set algorithm explicitly used in the paper, giving at most ten rounds in total. This is an upper bound for that composition, not a minimum-round claim. Inputs are connected, unweighted planar graphs with distinct identifiers.",
        "evidence": [
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Primary source for the algorithm",
            "location": "Section 5 Connected Dominating Sets; LPW PDF page 14"
          },
          {
            "url": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf#page=14",
            "title": "Lenzen–Pignolet–Wattenhofer, six-round schedule",
            "location": "Lemma 6.1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-a5c3105c54ebf1d906ab"
        ],
        "assumptions": [
          "auto-assumption-ce6b1c5257cc01ecf01a"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-ce6b1c5257cc01ecf01a",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-a5c3105c54ebf1d906ab",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "planar-two-dom-six",
      "problem": "2-domination (outside the solution)",
      "variant": "2-domination of vertices outside D",
      "objective": "min",
      "graphClass": "Planar",
      "model": "Anonymous",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "6",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "k = 2.",
      "assumptions": "Port numbering; only vertices outside the solution need two neighbors in it.",
      "paperId": "czygrinow-two-dom-2017",
      "theorem": "Theorem 1",
      "summary": "A degree-threshold algorithm improves the earlier factor seven.",
      "verification": "primary",
      "sourceUrl": "https://www.sciencedirect.com/science/article/pii/S0304397516307071",
      "year": 2017,
      "problemScope": {
        "node": "outside-k-domination"
      },
      "problemParameter": "2",
      "problemParameterName": "required neighbors outside the solution",
      "problemSource": "k-tuple dominating set",
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "6",
      "roundsDisplay": "2",
      "roundCountEvidence": {
        "basis": "stated",
        "explanation": "First round selects vertices of degree at least six. Second round adds vertices outside the first set that are not yet 2-dominated. Source also allows one round to obtain own degree. A conservative two-round implementation obtains degree by dummy messages in round 1, then exchanges high-degree flags in round 2 and decides output. Messages are one bit.",
        "evidence": [
          {
            "url": "https://www.sciencedirect.com/science/article/pii/S0304397516307071",
            "title": "Primary source algorithm",
            "location": "Section 2, Algorithm 1, first explanatory paragraph"
          }
        ],
        "rounds": "2",
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "2",
        "tex": "2",
        "basis": "stated",
        "explanation": "First round selects vertices of degree at least six. Second round adds vertices outside the first set that are not yet 2-dominated. Source also allows one round to obtain own degree. A conservative two-round implementation obtains degree by dummy messages in round 1, then exchanges high-degree flags in round 2 and decides output. Messages are one bit.",
        "evidence": [
          {
            "url": "https://www.sciencedirect.com/science/article/pii/S0304397516307071",
            "title": "Primary source algorithm",
            "location": "Section 2, Algorithm 1, first explanatory paragraph"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "Anonymous planar; constant rounds",
        "setting": "Unweighted outside-2 domination on planar graphs; deterministic port numbering without identifiers; two rounds and one-bit messages; integral OPT.",
        "reason": "Theorem 1 gives factor 6. The October 2026 transfer paper still uses this as its planar source. Its broader-genus 6+ε result has an additive loss and more rounds, so it does not dominate this point. No exact optimality claim is made: the anonymous lower-bound gap remains.",
        "evidenceUrl": "https://arxiv.org/html/2610.15596v1#S8",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "2",
          "description": "Required neighbors outside the solution",
          "tex": "2"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted",
          "model-port-numbering"
        ],
        "parameters": [
          "auto-parameter-cd4920bb34139c49b8f8"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-92362405df7c8f0d5040",
          "auto-output-ef1b974b591df8f63ec3",
          "auto-parameter-cd4920bb34139c49b8f8",
          "model-port-numbering",
          "output-outside-k",
          "output-outside-two",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "amiri-genus-constant",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Orientable genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "24g + O(1)",
      "rounds": "12g + O(1)",
      "roundClass": "parameter",
      "parameters": "Orientable genus at most g; both the approximation ratio and the number of communication rounds depend linearly on g.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "amiri-genus-2016",
      "theorem": "Theorem 15",
      "summary": "The preprocessing algorithm gives a 24g + O(1)-approximation in 12g + O(1) LOCAL rounds.",
      "verification": "primary",
      "sourceUrl": "https://schmiste.github.io/podc16.pdf#page=6",
      "year": 2016,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "orientable",
        "note": "The historical record does not establish applicability to every bounded Euler-genus family."
      },
      "approximationDisplay": "24g + O(1)",
      "roundsDisplay": "12g + O(1)",
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "12g + O(1)",
        "tex": "12g+O(1)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://schmiste.github.io/podc16.pdf#page=6",
            "title": "A Local Constant Factor MDS Approximation for Bounded Genus Graphs",
            "location": "Theorem 15"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "g",
          "description": "Orientable genus upper bound",
          "tex": "g"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-924a81ff2b56320e8d33",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-52b654b9ca9cab42e4ed"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-924a81ff2b56320e8d33",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-52b654b9ca9cab42e4ed",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "wawrzyniak-anonymous-694",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "Anonymous",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "694",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "No fixed degree bound is required.",
      "assumptions": "Port numbering; O(log n)-bit messages; no identifiers.",
      "paperId": "wawrzyniak-anonymous-2015",
      "theorem": "Abstract",
      "summary": "Constant-factor domination with anonymity and bounded messages.",
      "verification": "primary",
      "sourceUrl": "https://link.springer.com/article/10.1007/s00446-015-0247-6",
      "year": 2015,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "694",
      "roundsDisplay": "Constant",
      "roundCountEvidence": {
        "basis": "unavailable",
        "explanation": "The journal abstract gives factor 694 and constant round complexity with short messages, but the full algorithm was unavailable. The public arXiv:1303.2514v2 preprint proves the earlier factor 636; without confirming that the corrected journal algorithm has the same schedule, it does not certify a count for the factor-694 entry.",
        "evidence": [
          {
            "url": "https://link.springer.com/article/10.1007/s00446-015-0247-6",
            "title": "Primary source reviewed",
            "location": "Journal abstract; full algorithm unavailable"
          }
        ],
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "Constant",
        "tex": "\\text{Constant}",
        "basis": "unavailable",
        "explanation": "The journal abstract gives factor 694 and constant round complexity with short messages, but the full algorithm was unavailable. The public arXiv:1303.2514v2 preprint proves the earlier factor 636; without confirming that the corrected journal algorithm has the same schedule, it does not certify a count for the factor-694 entry.",
        "evidence": [
          {
            "url": "https://link.springer.com/article/10.1007/s00446-015-0247-6",
            "title": "Primary source reviewed",
            "location": "Journal abstract; full algorithm unavailable"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted",
          "model-port-numbering"
        ],
        "parameters": [
          "auto-parameter-368afe424cc1014e2254"
        ],
        "assumptions": [],
        "detail": [
          "strength-no-ids",
          "strength-log-n-bits"
        ],
        "covered": [
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-92362405df7c8f0d5040",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-368afe424cc1014e2254",
          "model-port-numbering",
          "strength-log-n-bits",
          "strength-no-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "wawrzyniak-planar-52",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "52",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "No fixed degree bound is required.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "wawrzyniak-52-2014",
      "theorem": "Abstract",
      "summary": "Sharper analysis of the earlier planar algorithm.",
      "verification": "primary",
      "sourceUrl": "https://www.sciencedirect.com/science/article/abs/pii/S0020019013002767",
      "year": 2014,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "52",
      "roundsDisplay": "6",
      "roundCountEvidence": {
        "basis": "same-algorithm",
        "explanation": "The 2014 paper proves factor 52 for the unchanged Lenzen–Pignolet–Wattenhofer algorithm. Its six-round schedule therefore remains valid. The count follows from the original Lemma 6.1; the accessible 2014 abstract does not state a separate total. Both results use the same identifiers and initial-information convention.",
        "evidence": [
          {
            "url": "https://www.sciencedirect.com/science/article/abs/pii/S0020019013002767",
            "title": "Primary source for the algorithm",
            "location": "Publisher abstract and section snippet; LPW PDF page 14"
          },
          {
            "url": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf#page=14",
            "title": "Lenzen–Pignolet–Wattenhofer, six-round schedule",
            "location": "Lemma 6.1"
          }
        ],
        "rounds": "6",
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "6",
        "tex": "6",
        "basis": "same-algorithm",
        "explanation": "The 2014 paper proves factor 52 for the unchanged Lenzen–Pignolet–Wattenhofer algorithm. Its six-round schedule therefore remains valid. The count follows from the original Lemma 6.1; the accessible 2014 abstract does not state a separate total. Both results use the same identifiers and initial-information convention.",
        "evidence": [
          {
            "url": "https://www.sciencedirect.com/science/article/abs/pii/S0020019013002767",
            "title": "Primary source for the algorithm",
            "location": "Publisher abstract and section snippet; LPW PDF page 14"
          },
          {
            "url": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf#page=14",
            "title": "Lenzen–Pignolet–Wattenhofer, six-round schedule",
            "location": "Lemma 6.1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-368afe424cc1014e2254"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-368afe424cc1014e2254",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "planar-two-dom-seven",
      "problem": "2-domination (outside the solution)",
      "variant": "2-domination of vertices outside D",
      "objective": "min",
      "graphClass": "Planar",
      "model": "Anonymous",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "7",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "k = 2.",
      "assumptions": "No identifiers required.",
      "paperId": "czygrinow-k-tuple-2014",
      "theorem": "Abstract",
      "summary": "Historical algorithm for two-fold domination.",
      "verification": "primary",
      "sourceUrl": "https://link.springer.com/chapter/10.1007/978-3-319-14472-6_4",
      "year": 2014,
      "problemScope": {
        "node": "outside-k-domination"
      },
      "problemParameter": "2",
      "problemParameterName": "required neighbors outside the solution",
      "problemSource": "k-tuple dominating set",
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "7",
      "roundsDisplay": "Constant",
      "roundCountEvidence": {
        "basis": "unavailable",
        "explanation": "The available primary material states a constant number of rounds but omits the algorithm. Full PDF redirects to subscription content. The author homepage that advertises a PDF is currently accessible only within the AMU network/VPN. The later 2017 primary paper describes a small modification but does not establish the original exact schedule; do not infer the old count from the new one.",
        "evidence": [
          {
            "url": "https://link.springer.com/chapter/10.1007/978-3-319-14472-6_4",
            "title": "Primary source reviewed",
            "location": "Primary Springer abstract and two-page preview"
          }
        ],
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "Constant",
        "tex": "\\text{Constant}",
        "basis": "unavailable",
        "explanation": "The available primary material states a constant number of rounds but omits the algorithm. Full PDF redirects to subscription content. The author homepage that advertises a PDF is currently accessible only within the AMU network/VPN. The later 2017 primary paper describes a small modification but does not establish the original exact schedule; do not infer the old count from the new one.",
        "evidence": [
          {
            "url": "https://link.springer.com/chapter/10.1007/978-3-319-14472-6_4",
            "title": "Primary source reviewed",
            "location": "Primary Springer abstract and two-page preview"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "2",
          "description": "Required neighbors outside the solution",
          "tex": "2"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted",
          "model-port-numbering"
        ],
        "parameters": [
          "auto-parameter-cd4920bb34139c49b8f8"
        ],
        "assumptions": [],
        "detail": [
          "strength-no-ids"
        ],
        "covered": [
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-92362405df7c8f0d5040",
          "auto-output-ef1b974b591df8f63ec3",
          "auto-parameter-cd4920bb34139c49b8f8",
          "model-port-numbering",
          "output-outside-k",
          "output-outside-two",
          "strength-no-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "planar-k-dom-trivial",
      "problem": "k-domination (outside the solution)",
      "variant": "k-domination of vertices outside D",
      "objective": "min",
      "graphClass": "Planar",
      "model": "Anonymous",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "k / (k − 2)",
      "rounds": "0",
      "roundClass": "constant",
      "parameters": "Fixed k ≥ 3.",
      "assumptions": "No identifiers required.",
      "paperId": "czygrinow-k-tuple-2014",
      "theorem": "Abstract",
      "summary": "Select all vertices without communication. The planar bipartite edge bound gives the stated ratio; the source introduction records this elementary construction.",
      "verification": "primary",
      "sourceUrl": "https://link.springer.com/chapter/10.1007/978-3-319-14472-6_4",
      "year": 2014,
      "problemScope": {
        "node": "outside-k-domination"
      },
      "problemParameter": "k",
      "problemParameterName": "required neighbors outside the solution",
      "problemSource": "k-tuple dominating set",
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "k / (k − 2)",
      "roundsDisplay": "0",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "0",
        "tex": "0",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://link.springer.com/chapter/10.1007/978-3-319-14472-6_4",
            "title": "Distributed Local Approximation of the Minimum k-Tuple Dominating Set in Planar Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "Zero rounds; k ∈ {3,4,5,6}",
        "setting": "Unweighted outside-k domination on planar graphs; deterministic anonymous zero rounds by selecting every vertex; integral OPT; certification restricted to k = 3, 4, 5, or 6.",
        "reason": "The select-all factor k/(k−2) is matched by a lower bound that permits unique identifiers for these four values of k. The construction uses no communication, as explicitly recalled in the 2017 follow-up paper. The original guarantee applies to larger k too, but this annotation does not extend the optimality claim to that range.",
        "evidenceUrl": "https://link.springer.com/chapter/10.1007/978-3-319-14472-6_4",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-k-three-through-six"
        ]
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "outside-k-planar-factor",
          "resultId": "planar-k-dom-trivial",
          "graphs": [
            "planar"
          ],
          "problems": [
            "outside-k-domination"
          ],
          "models": [
            "Anonymous",
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": [
            "parameter-k-three-through-six"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "k",
          "description": "Required number of neighbors in the solution for each vertex outside it",
          "tex": "k"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted",
          "model-port-numbering"
        ],
        "parameters": [
          "auto-parameter-b8fdbb33beabe4183121"
        ],
        "assumptions": [],
        "detail": [
          "strength-no-ids"
        ],
        "covered": [
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-92362405df7c8f0d5040",
          "auto-output-b54ac6401a901b9d3590",
          "auto-parameter-b8fdbb33beabe4183121",
          "model-port-numbering",
          "output-outside-k",
          "parameter-k-ge1",
          "parameter-k-ge2",
          "parameter-k-ge3",
          "strength-no-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "planar-two-dom-lower",
      "problem": "2-domination (outside the solution)",
      "variant": "2-domination of vertices outside D",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "approximation": "No (4 − ε)-approximation",
      "rounds": "O(1) rounds ruled out",
      "roundClass": "constant",
      "parameters": "k = 2; fixed ε > 0.",
      "assumptions": "Unique identifiers allowed.",
      "paperId": "czygrinow-k-tuple-2014",
      "theorem": "Abstract",
      "summary": "A deterministic locality barrier.",
      "verification": "primary",
      "sourceUrl": "https://link.springer.com/chapter/10.1007/978-3-319-14472-6_4",
      "year": 2014,
      "roundBudgetExcluded": true,
      "problemScope": {
        "node": "outside-k-domination"
      },
      "problemParameter": "2",
      "problemParameterName": "required neighbors outside the solution",
      "problemSource": "k-tuple dominating set",
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "> 4 − ε",
      "roundsDisplay": "Constant rounds ruled out",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Constant rounds ruled out",
        "tex": "\\text{Constant rounds ruled out}",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://link.springer.com/chapter/10.1007/978-3-319-14472-6_4",
            "title": "Distributed Local Approximation of the Minimum k-Tuple Dominating Set in Planar Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "2",
          "description": "Required neighbors outside the solution",
          "tex": "2"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-7c840dd07497ac66d521"
        ],
        "assumptions": [
          "auto-assumption-645e17e1d66815d2bcca"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-645e17e1d66815d2bcca",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-ef1b974b591df8f63ec3",
          "auto-parameter-7c840dd07497ac66d521",
          "output-outside-k",
          "output-outside-two",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "planar-k-dom-lower",
      "problem": "k-domination (outside the solution)",
      "variant": "k-domination of vertices outside D",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "approximation": "No (k/(k − 2) − ε)-approximation",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "k ∈ {3, 4, 5, 6}; any fixed ε > 0.",
      "assumptions": "Unique identifiers allowed; smaller fixed ratios are excluded.",
      "paperId": "czygrinow-k-tuple-2014",
      "theorem": "Abstract",
      "summary": "Matches the upper bound for four multiplicities.",
      "verification": "primary",
      "sourceUrl": "https://link.springer.com/chapter/10.1007/978-3-319-14472-6_4",
      "year": 2014,
      "roundBudgetExcluded": true,
      "problemScope": {
        "node": "outside-k-domination"
      },
      "problemParameter": "k",
      "problemParameterName": "required neighbors outside the solution",
      "problemSource": "k-tuple dominating set",
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "> k/(k − 2) − ε",
      "roundsDisplay": "Constant",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Constant",
        "tex": "\\text{Constant}",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://link.springer.com/chapter/10.1007/978-3-319-14472-6_4",
            "title": "Distributed Local Approximation of the Minimum k-Tuple Dominating Set in Planar Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "outside-k-planar-factor",
          "resultId": "planar-k-dom-lower",
          "graphs": [
            "planar"
          ],
          "problems": [
            "outside-k-domination"
          ],
          "models": [
            "LOCAL",
            "CONGEST"
          ],
          "conditionIds": [
            "parameter-k-three-through-six"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "k",
          "description": "Required number of neighbors in the solution for each vertex outside it",
          "tex": "k"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-2ba338b64d6712d3e5cc"
        ],
        "assumptions": [
          "auto-assumption-a2e9c2b616808887ae25"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-a2e9c2b616808887ae25",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b54ac6401a901b9d3590",
          "auto-parameter-2ba338b64d6712d3e5cc",
          "output-outside-k",
          "parameter-k-ge1",
          "parameter-k-ge2",
          "parameter-k-ge3",
          "parameter-k-three-through-six",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "planar-seven-lower",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "approximation": "No (7 − ε)-approximation",
      "rounds": "O(1) rounds ruled out",
      "roundClass": "constant",
      "parameters": "Any fixed ε > 0.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "hilke-planar-lower-2014",
      "theorem": "Abstract",
      "summary": "A deterministic constant-round approximation barrier.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/1402.2549",
      "year": 2014,
      "roundBudgetExcluded": true,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "> 7 − ε",
      "roundsDisplay": "Constant rounds ruled out",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Constant rounds ruled out",
        "tex": "\\text{Constant rounds ruled out}",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/1402.2549",
            "title": "Local Approximability of Minimum Dominating Set on Planar Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "planar-factor-seven",
          "resultId": "planar-seven-lower",
          "graphs": [
            "planar",
            "euler",
            "orientable"
          ],
          "problems": [
            "dominating-set"
          ],
          "models": [
            "LOCAL",
            "CONGEST"
          ],
          "conditionIds": []
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-8359c573af80d8ec5226"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-8359c573af80d8ec5226",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "lenzen-planar-130",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "130",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "No fixed degree bound is required.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "lenzen-restricted-2013",
      "theorem": "Theorem 6.8",
      "summary": "Historical constant-round planar bound.",
      "verification": "primary",
      "sourceUrl": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf",
      "year": 2013,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "130",
      "roundsDisplay": "6",
      "roundCountEvidence": {
        "basis": "stated",
        "explanation": "Lemma 6.1 explicitly states six rounds and gives the schedule: rounds 1–2 learn identifiers within distance two; round 3 announces membership in D; rounds 4–5 compute and exchange residual degrees; round 6 notifies chosen dominators. The algorithm uses unique identifiers and unrestricted LOCAL messages, without a supplied embedding or degree bound.",
        "evidence": [
          {
            "url": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf#page=14",
            "title": "Primary source for the algorithm",
            "location": "PDF page 14 (round count), page 19 (130 factor)"
          }
        ],
        "rounds": "6",
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "6",
        "tex": "6",
        "basis": "stated",
        "explanation": "Lemma 6.1 explicitly states six rounds and gives the schedule: rounds 1–2 learn identifiers within distance two; round 3 announces membership in D; rounds 4–5 compute and exchange residual degrees; round 6 notifies chosen dominators. The algorithm uses unique identifiers and unrestricted LOCAL messages, without a supplied embedding or degree bound.",
        "evidence": [
          {
            "url": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf#page=14",
            "title": "Primary source for the algorithm",
            "location": "PDF page 14 (round count), page 19 (130 factor)"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierComparisons": [
        {
          "better": "wawrzyniak-planar-52",
          "worse": "lenzen-planar-130",
          "strict": [
            "approximation"
          ],
          "conditions": {
            "problem": "Both return an integral approximation for unweighted minimum dominating set.",
            "graphClass": "Both algorithms apply to all planar graphs.",
            "approximation": "Factor 52 is strictly smaller than 130.",
            "rounds": "The 2014 result reanalyzes the same protocol. Lemma 6.1 of Lenzen–Pignolet–Wattenhofer explicitly itemizes rounds 1–6; the reanalysis changes no communication.",
            "model": "Both use LOCAL with unrestricted message size and local computation.",
            "randomness": "Both algorithms are deterministic.",
            "benchmark": "Both approximation guarantees are measured against the integral optimum.",
            "assumptions": "Both use distinct identifiers and require no embedding, degree bound or externally supplied dominating set. Unbounded local computation is allowed in LOCAL."
          },
          "evidenceUrl": "https://www.sciencedirect.com/science/article/abs/pii/S0020019013002767",
          "reason": "The improved analysis proves factor 52 for the unchanged six-round protocol that originally had factor 130."
        }
      ],
      "dominatedBy": [
        "wawrzyniak-planar-52"
      ],
      "frontierStatus": "dominated",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-368afe424cc1014e2254"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-368afe424cc1014e2254",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "lenzen-unit-disk-lower",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Unit-disk",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "approximation": "f(n)-approximation",
      "rounds": "f(n) · T(n) = Ω(log* n)",
      "roundClass": "logstar",
      "parameters": "f(n) is the approximation factor; T(n) the round complexity.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "lenzen-restricted-2013",
      "theorem": "Theorem 4.7",
      "summary": "Tradeoff between deterministic running time and approximation.",
      "verification": "primary",
      "sourceUrl": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf",
      "year": 2013,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "unit-disk"
      },
      "approximationDisplay": "f(n)-approximation",
      "roundsDisplay": "f(n) · T(n) = Ω(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "f(n) · T(n) = Ω(log* n)",
        "tex": "f(n)\\,T(n)=\\Omega(\\log^*n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf",
            "title": "Distributed minimum dominating set approximations in restricted families of graphs",
            "location": "Theorem 4.7"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "T(n)",
          "description": "Number of communication rounds at input size n",
          "tex": "T(n)"
        },
        {
          "symbol": "f(n)",
          "description": "Approximation factor at input size n",
          "tex": "f(n)"
        },
        {
          "symbol": "T",
          "description": "Round-complexity function of the number of vertices",
          "tex": "T"
        },
        {
          "symbol": "f",
          "description": "Approximation-factor function of the number of vertices",
          "tex": "f"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-422a8fcd40a47bc44c15",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-e140b685efc84e3de936"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-422a8fcd40a47bc44c15",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-e140b685efc84e3de936",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "lenzen-arboricity-random",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Arboricity ≤ α",
      "model": "LOCAL",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "O(α²)",
      "rounds": "O(log n)",
      "roundClass": "logarithmic",
      "parameters": "α is the arboricity bound.",
      "assumptions": "Unweighted; running time holds with high probability.",
      "paperId": "lenzen-restricted-2013",
      "theorem": "Section 5",
      "summary": "Historical forest-decomposition approximation.",
      "verification": "primary",
      "sourceUrl": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf",
      "year": 2013,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "density",
        "note": "Use compatible fixed arboricity bounds; planar inputs permit an arboricity bound of 3."
      },
      "approximationDisplay": "O(α²)",
      "roundsDisplay": "O(log n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log n)",
        "tex": "O(\\log n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf",
            "title": "Distributed minimum dominating set approximations in restricted families of graphs",
            "location": "Section 5"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "α",
          "description": "Arboricity bound of the input graph",
          "tex": "\\alpha"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-97a0a2af0e526b2ffcd5",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-d6747b2e215206975909"
        ],
        "assumptions": [
          "auto-assumption-b836cd95ee47f8554bf1"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-b836cd95ee47f8554bf1",
          "auto-graph-97a0a2af0e526b2ffcd5",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-d6747b2e215206975909",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "lenzen-arboricity-deterministic",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Arboricity ≤ α",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "O(α log Δ)",
      "rounds": "O(log Δ)",
      "roundClass": "degree",
      "parameters": "Δ is maximum degree.",
      "assumptions": "Unweighted; uniform algorithm.",
      "paperId": "lenzen-restricted-2013",
      "theorem": "Section 5",
      "summary": "A deterministic degree-dependent tradeoff.",
      "verification": "primary",
      "sourceUrl": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf",
      "year": 2013,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "density",
        "note": "Use compatible fixed arboricity bounds; planar inputs permit an arboricity bound of 3."
      },
      "approximationDisplay": "O(α log Δ)",
      "roundsDisplay": "O(log Δ)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log Δ)",
        "tex": "O(\\log \\Delta )",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf",
            "title": "Distributed minimum dominating set approximations in restricted families of graphs",
            "location": "Section 5"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "α",
          "description": "Arboricity bound of the input graph",
          "tex": "\\alpha"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-97a0a2af0e526b2ffcd5",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-086b33ba1d8d93f63191"
        ],
        "assumptions": [
          "auto-assumption-d5ea1a184c45a94072eb"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-d5ea1a184c45a94072eb",
          "auto-graph-97a0a2af0e526b2ffcd5",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-086b33ba1d8d93f63191",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "arboricity-matching-logstar",
      "problem": "Maximum matching",
      "variant": "Unweighted",
      "objective": "max",
      "graphClass": "Arboricity ≤ α",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − ε",
      "rounds": "O(log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed α and 0 < ε < 1.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "czygrinow-arboricity-matching-2009",
      "theorem": "Abstract",
      "summary": "A deterministic matching scheme for bounded arboricity.",
      "verification": "primary",
      "sourceUrl": "https://link.springer.com/chapter/10.1007/978-3-642-10631-6_68",
      "year": 2009,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "density",
        "note": "Use compatible fixed arboricity bounds; planar inputs permit an arboricity bound of 3."
      },
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "O(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log* n)",
        "tex": "O(\\log^* n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://link.springer.com/chapter/10.1007/978-3-642-10631-6_68",
            "title": "Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Unweighted maximum matching; deterministic LOCAL; arboricity at most fixed α ≥ 1; fixed 0 < ε < 1/2; (1−ε) times the integral optimum.",
        "reason": "Optimal Θ(log* n) dependence on n for fixed α and ε: the matching lower bound already holds on paths. This does not certify optimal dependence on α or ε.",
        "evidenceUrl": "https://arxiv.org/pdf/2304.04699v2",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-epsilon-half"
        ]
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "arboricity-matching-n-rounds",
          "resultId": "arboricity-matching-logstar",
          "graphs": [
            "density",
            "arboricity-two",
            "forest",
            "path",
            "oriented-path",
            "cycle"
          ],
          "problems": [
            "maximum-matching"
          ],
          "models": [
            "LOCAL"
          ],
          "conditionIds": [
            "scope-rounds-n-alpha-epsilon",
            "parameter-epsilon-half"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "α",
          "description": "Arboricity bound of the input graph",
          "tex": "\\alpha"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-97a0a2af0e526b2ffcd5",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-cd01ec1b8d72b36ac585"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-97a0a2af0e526b2ffcd5",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-cd01ec1b8d72b36ac585",
          "parameter-alpha-ge1",
          "parameter-epsilon-positive",
          "parameter-epsilon-unit",
          "parameter-fixed-alpha",
          "parameter-fixed-epsilon",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "planar-fast-dominating",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "O(log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed 0 < ε < 1.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "czygrinow-planar-fast-2008",
      "theorem": "Abstract",
      "summary": "A deterministic local approximation scheme.",
      "verification": "primary",
      "sourceUrl": "https://link.springer.com/chapter/10.1007/978-3-540-87779-0_6",
      "year": 2008,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "O(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log* n)",
        "tex": "O(\\log^* n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://link.springer.com/chapter/10.1007/978-3-540-87779-0_6",
            "title": "Fast Distributed Approximations in Planar Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-556e1395ea8d9fad84a5"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-556e1395ea8d9fad84a5",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "planar-fast-matching",
      "problem": "Maximum matching",
      "variant": "Unweighted",
      "objective": "max",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − ε",
      "rounds": "O(log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed 0 < ε < 1.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "czygrinow-planar-fast-2008",
      "theorem": "Abstract",
      "summary": "A deterministic local approximation scheme.",
      "verification": "primary",
      "sourceUrl": "https://link.springer.com/chapter/10.1007/978-3-540-87779-0_6",
      "year": 2008,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "O(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log* n)",
        "tex": "O(\\log^* n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://link.springer.com/chapter/10.1007/978-3-540-87779-0_6",
            "title": "Fast Distributed Approximations in Planar Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-556e1395ea8d9fad84a5"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-556e1395ea8d9fad84a5",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "planar-fast-independent",
      "problem": "Independent set",
      "variant": "Unweighted",
      "objective": "max",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − ε",
      "rounds": "O(log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed 0 < ε < 1.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "czygrinow-planar-fast-2008",
      "theorem": "Abstract",
      "summary": "A deterministic local approximation scheme.",
      "verification": "primary",
      "sourceUrl": "https://link.springer.com/chapter/10.1007/978-3-540-87779-0_6",
      "year": 2008,
      "problemScope": {
        "node": "independent-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "O(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log* n)",
        "tex": "O(\\log^* n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://link.springer.com/chapter/10.1007/978-3-540-87779-0_6",
            "title": "Fast Distributed Approximations in Planar Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-556e1395ea8d9fad84a5"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-4ad7b7801c4e84e8fdd9",
          "auto-parameter-556e1395ea8d9fad84a5",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "packing-planar",
      "problem": "Vertex-disjoint H-packing",
      "variant": "Vertex-disjoint H-packing",
      "objective": "max",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − o(1)",
      "rounds": "polylog n",
      "roundClass": "polylog",
      "parameters": "Fixed pattern H (the paper permits some larger patterns).",
      "assumptions": "Unweighted packing; deterministic message passing.",
      "paperId": "czygrinow-packing-planar-2008",
      "theorem": "Abstract",
      "summary": "Nearly optimal packing through local decomposition.",
      "verification": "primary",
      "sourceUrl": "https://citeseerx.ist.psu.edu/document?doi=220ce316d6c4b583c4dd44cc3a67bdbc6c735967&repid=rep1&type=pdf",
      "year": 2008,
      "problemScope": {
        "node": "other-packing"
      },
      "problemParameter": "H",
      "problemParameterName": "fixed pattern graph",
      "problemSource": "Other packing",
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "1 − o(1)",
      "roundsDisplay": "polylog n",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "polylog n",
        "tex": "\\operatorname{polylog}n",
        "basis": "symbolic",
        "explanation": "A numerical polynomial exponent has not yet been extracted for this record. The displayed expression retains all currently recorded parameter dependence.",
        "evidence": [
          {
            "url": "https://citeseerx.ist.psu.edu/document?doi=220ce316d6c4b583c4dd44cc3a67bdbc6c735967&repid=rep1&type=pdf",
            "title": "Distributed packing in planar graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "H",
          "description": "Fixed graph whose vertex-disjoint copies are packed",
          "tex": "H"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-7d2fe83d945081e897d5"
        ],
        "assumptions": [
          "auto-assumption-439d0499bc59af58e1e1"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-439d0499bc59af58e1e1",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b552c597406156389871",
          "auto-parameter-7d2fe83d945081e897d5",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "minor-almost-dominating",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Excluded fixed minor",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + o(1)",
      "rounds": "polylog n",
      "roundClass": "polylog",
      "parameters": "Fixed proper minor-closed family; o(1) tends to zero as n grows.",
      "assumptions": "Unweighted; connected domination assumes connected input.",
      "paperId": "czygrinow-minor-almost-2006",
      "theorem": "Abstract",
      "summary": "Historical deterministic approximation approaching optimality.",
      "verification": "primary",
      "sourceUrl": "https://link.springer.com/chapter/10.1007/11841036_24",
      "year": 2006,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "1 + o(1)",
      "roundsDisplay": "polylog n",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "polylog n",
        "tex": "\\operatorname{polylog}n",
        "basis": "stated-in-publisher-abstract",
        "explanation": "The publisher abstract states polylogarithmic rounds for a fixed proper minor-closed family. Only the abstract was accessible in this check; no numerical exponent is verified, and no conclusion is drawn about what the full paper might permit.",
        "evidence": [
          {
            "url": "https://link.springer.com/chapter/10.1007/11841036_24",
            "title": "Distributed Almost Exact Approximations for Minor-Closed Families",
            "location": "Publisher abstract"
          }
        ],
        "parameters": [
          {
            "symbol": "n",
            "description": "Number of vertices",
            "tex": "n"
          }
        ],
        "checked": "2026-11-16",
        "audited": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "n",
          "description": "Number of vertices",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-e40ef97c3969c67aad8c",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-fcadea24a9eeedcc0605"
        ],
        "assumptions": [
          "auto-assumption-41383be6b6c11ef0ca69"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-41383be6b6c11ef0ca69",
          "auto-graph-e40ef97c3969c67aad8c",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-fcadea24a9eeedcc0605",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "minor-almost-connected",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Excluded fixed minor",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + o(1)",
      "rounds": "polylog n",
      "roundClass": "polylog",
      "parameters": "Fixed proper minor-closed family; o(1) tends to zero as n grows.",
      "assumptions": "Unweighted; connected domination assumes connected input.",
      "paperId": "czygrinow-minor-almost-2006",
      "theorem": "Abstract",
      "summary": "Historical deterministic approximation approaching optimality.",
      "verification": "primary",
      "sourceUrl": "https://link.springer.com/chapter/10.1007/11841036_24",
      "year": 2006,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "1 + o(1)",
      "roundsDisplay": "polylog n",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "polylog n",
        "tex": "\\operatorname{polylog}n",
        "basis": "stated-in-publisher-abstract",
        "explanation": "The publisher abstract states polylogarithmic rounds for connected dominating set in a fixed proper minor-closed family. Full-text access was unavailable in this check, so no numerical exponent is verified.",
        "evidence": [
          {
            "url": "https://link.springer.com/chapter/10.1007/11841036_24",
            "title": "Distributed Almost Exact Approximations for Minor-Closed Families",
            "location": "Publisher abstract"
          }
        ],
        "parameters": [
          {
            "symbol": "n",
            "description": "Number of vertices",
            "tex": "n"
          }
        ],
        "checked": "2026-11-16",
        "audited": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "n",
          "description": "Number of vertices",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-e40ef97c3969c67aad8c",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-fcadea24a9eeedcc0605"
        ],
        "assumptions": [
          "auto-assumption-41383be6b6c11ef0ca69"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-41383be6b6c11ef0ca69",
          "auto-graph-e40ef97c3969c67aad8c",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-fcadea24a9eeedcc0605",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "planar-matching-polylog",
      "problem": "Maximum matching",
      "variant": "Unweighted",
      "objective": "max",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − o(1)",
      "rounds": "polylog n",
      "roundClass": "polylog",
      "parameters": "o(1) tends to zero as n grows.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "czygrinow-planar-2006",
      "theorem": "Abstract",
      "summary": "Historical approximation scheme before the log-star bound.",
      "verification": "primary",
      "sourceUrl": "https://link.springer.com/chapter/10.1007/11758471_29",
      "year": 2006,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "1 − o(1)",
      "roundsDisplay": "polylog n",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "polylog n",
        "tex": "\\operatorname{polylog}n",
        "basis": "stated-in-publisher-abstract",
        "explanation": "The publisher abstract gives deterministic polylogarithmic rounds, with approximation approaching one as n increases. Only the abstract was accessible in this check; no numerical exponent is verified.",
        "evidence": [
          {
            "url": "https://link.springer.com/chapter/10.1007/11758471_29",
            "title": "Distributed Approximation Algorithms for Planar Graphs",
            "location": "Publisher abstract"
          }
        ],
        "parameters": [
          {
            "symbol": "n",
            "description": "Number of vertices",
            "tex": "n"
          }
        ],
        "checked": "2026-11-16",
        "audited": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-1a9fdb690f3300f60ed4"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-1a9fdb690f3300f60ed4",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "growth-local-dominating",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Polynomial neighborhood-independence growth",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "O(T_MIS + ε⁻O(1) log* n)",
      "roundClass": "other",
      "parameters": "Fixed growth polynomial and ε > 0; T_MIS is an MIS subroutine’s time.",
      "assumptions": "Includes unit-disk graphs; no coordinates are required.",
      "paperId": "kuhn-local-schemes-2005",
      "theorem": "Abstract",
      "summary": "An approximation scheme parameterized by a symmetry-breaking subroutine.",
      "verification": "primary",
      "sourceUrl": "https://www.microsoft.com/en-us/research/wp-content/uploads/2017/01/DIALM2005a.pdf",
      "year": 2005,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "independence-growth",
        "note": "Growth refers to independent sets in neighborhoods, not vertex counts."
      },
      "graphClassSource": "Polynomially bounded growth",
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "O(T_MIS + ε⁻O(1) log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(T_MIS + ε⁻O(1) log* n)",
        "tex": "O\\!\\left(T_{\\mathrm{MIS}}+\\varepsilon^{-O(1)}\\log^*n\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://www.microsoft.com/en-us/research/wp-content/uploads/2017/01/DIALM2005a.pdf",
            "title": "Local approximation schemes for ad hoc and sensor networks",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "T_MIS",
          "description": "Round complexity of the maximal-independent-set subroutine",
          "tex": "T_{\\mathrm{MIS}}"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-7140d561f38288daeca5",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-3501d10fc18c46a523f3"
        ],
        "assumptions": [
          "auto-assumption-5b844a3fdbd850e05d7e"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-5b844a3fdbd850e05d7e",
          "auto-graph-7140d561f38288daeca5",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-3501d10fc18c46a523f3",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "growth-local-independent",
      "problem": "Independent set",
      "variant": "Unweighted",
      "objective": "max",
      "graphClass": "Polynomial neighborhood-independence growth",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 / (1 + ε)",
      "rounds": "O(T_MIS + ε⁻O(1) log* n)",
      "roundClass": "other",
      "parameters": "Fixed growth polynomial and ε > 0; T_MIS is an MIS subroutine’s time.",
      "assumptions": "Includes unit-disk graphs; no coordinates are required.",
      "paperId": "kuhn-local-schemes-2005",
      "theorem": "Abstract",
      "summary": "An approximation scheme parameterized by a symmetry-breaking subroutine.",
      "verification": "primary",
      "sourceUrl": "https://www.microsoft.com/en-us/research/wp-content/uploads/2017/01/DIALM2005a.pdf",
      "year": 2005,
      "problemScope": {
        "node": "independent-set"
      },
      "graphScope": {
        "node": "independence-growth",
        "note": "Growth refers to independent sets in neighborhoods, not vertex counts."
      },
      "graphClassSource": "Polynomially bounded growth",
      "approximationDisplay": "1 / (1 + ε)",
      "roundsDisplay": "O(T_MIS + ε⁻O(1) log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(T_MIS + ε⁻O(1) log* n)",
        "tex": "O\\!\\left(T_{\\mathrm{MIS}}+\\varepsilon^{-O(1)}\\log^*n\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://www.microsoft.com/en-us/research/wp-content/uploads/2017/01/DIALM2005a.pdf",
            "title": "Local approximation schemes for ad hoc and sensor networks",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "T_MIS",
          "description": "Round complexity of the maximal-independent-set subroutine",
          "tex": "T_{\\mathrm{MIS}}"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-7140d561f38288daeca5",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-3501d10fc18c46a523f3"
        ],
        "assumptions": [
          "auto-assumption-5b844a3fdbd850e05d7e"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-5b844a3fdbd850e05d7e",
          "auto-graph-7140d561f38288daeca5",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-4ad7b7801c4e84e8fdd9",
          "auto-parameter-3501d10fc18c46a523f3",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "odd-cycle-matching",
      "problem": "Maximum matching",
      "variant": "Unweighted",
      "objective": "max",
      "graphClass": "No odd cycles of lengths 3, 5, …, 2k − 1",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − 1/(k + 1)",
      "rounds": "O(logᴰ⁽ᵏ⁾ n)",
      "roundClass": "polylog",
      "parameters": "Fixed integer k; exponent D depends on k.",
      "assumptions": "Unique identifiers; no embedding is supplied.",
      "paperId": "czygrinow-matching-2003",
      "theorem": "Abstract",
      "summary": "Historical approximation exploiting the absence of short odd cycles.",
      "verification": "primary",
      "sourceUrl": "https://link.springer.com/chapter/10.1007/3-540-45071-8_26",
      "year": 2003,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "odd-girth"
      },
      "approximationDisplay": "1 − 1/(k + 1)",
      "roundsDisplay": "O(logᴰ⁽ᵏ⁾ n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(logᴰ⁽ᵏ⁾ n)",
        "tex": "O\\!\\left(\\log^{D(k)}n\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://link.springer.com/chapter/10.1007/3-540-45071-8_26",
            "title": "Distributed Algorithm for Better Approximation of the Maximum Matching",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "D(k)",
          "description": "Fixed polynomial-in-logarithm exponent depending only on k",
          "tex": "D(k)"
        },
        {
          "symbol": "D",
          "description": "Exponent function depending only on k",
          "tex": "D"
        },
        {
          "symbol": "k",
          "description": "Integer controlling the excluded odd-cycle lengths 3,5,…,2k−1",
          "tex": "k"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-1b4eb5482088967f6989",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-6a77d51b1e51feea6d0f"
        ],
        "assumptions": [
          "auto-assumption-44c6dc5d9b316688718b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-44c6dc5d9b316688718b",
          "auto-graph-1b4eb5482088967f6989",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-6a77d51b1e51feea6d0f",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "alipour-trianglefree-32",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Triangle-free planar",
      "model": "LOCAL",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "32",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "Algorithm 1 with m = 0.",
      "assumptions": "No isolated vertices; the presented algorithm uses random tie-breaking.",
      "paperId": "alipour-futuhi-2020",
      "theorem": "Theorem 2.1",
      "summary": "A local degree-based procedure, analyzed on triangle-free graphs.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2012.04883v2",
      "year": 2020,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "triangle-planar"
      },
      "approximationDisplay": "32",
      "roundsDisplay": "2",
      "roundCountEvidence": {
        "basis": "stated",
        "explanation": "In round 1, vertices broadcast their degree and random tie-breaking value. In round 2, each vertex marks a neighbor of maximum weight. The repeat loop is absent when m = 0. The selected vertices give total domination and hence ordinary domination. Vertices initially know their neighbors; the source excludes isolated vertices.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2012.04883v2#page=3",
            "title": "Primary source communication schedule",
            "location": "Algorithm 1 lines 1–2 and Theorem 2.1; arXiv v2 PDF p. 3"
          }
        ],
        "rounds": "2",
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "2",
        "tex": "2",
        "basis": "stated",
        "explanation": "In round 1, vertices broadcast their degree and random tie-breaking value. In round 2, each vertex marks a neighbor of maximum weight. The repeat loop is absent when m = 0. The selected vertices give total domination and hence ordinary domination. Vertices initially know their neighbors; the source excludes isolated vertices.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2012.04883v2#page=3",
            "title": "Primary source communication schedule",
            "location": "Algorithm 1 lines 1–2 and Theorem 2.1; arXiv v2 PDF p. 3"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "m",
          "description": "Source algorithm parameter instantiated to zero in this entry",
          "tex": "m"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-17b28995226fcbf3e00f",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-c8cd75de38af15472e55"
        ],
        "assumptions": [
          "auto-assumption-766087a5ffd80038c841"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-766087a5ffd80038c841",
          "auto-graph-17b28995226fcbf3e00f",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-c8cd75de38af15472e55",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "alipour-trianglefree-total-16",
      "problem": "Total dominating set",
      "variant": "Total dominating set",
      "objective": "min",
      "graphClass": "Triangle-free planar",
      "model": "LOCAL",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "16",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "Algorithm 1 with m = 0.",
      "assumptions": "No isolated vertices. Every vertex, including selected vertices, needs a selected neighbor.",
      "paperId": "alipour-futuhi-2020",
      "theorem": "Theorem 2.1",
      "summary": "The same procedure also approximates total domination.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2012.04883v2",
      "year": 2020,
      "problemScope": {
        "node": "total-dominating-set"
      },
      "problemSource": "Dominating set",
      "graphScope": {
        "node": "triangle-planar"
      },
      "approximationDisplay": "16",
      "roundsDisplay": "2",
      "roundCountEvidence": {
        "basis": "stated",
        "explanation": "The same m = 0 algorithm uses two rounds: broadcast weights, then mark a maximum-weight neighbor. Theorem 2.1 gives factor 16 against the total-domination optimum. Vertices initially know their neighbors, and isolated vertices are excluded.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2012.04883v2#page=3",
            "title": "Primary source communication schedule",
            "location": "Algorithm 1 lines 1–2 and Theorem 2.1; arXiv v2 PDF p. 3"
          }
        ],
        "rounds": "2",
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "2",
        "tex": "2",
        "basis": "stated",
        "explanation": "The same m = 0 algorithm uses two rounds: broadcast weights, then mark a maximum-weight neighbor. Theorem 2.1 gives factor 16 against the total-domination optimum. Vertices initially know their neighbors, and isolated vertices are excluded.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2012.04883v2#page=3",
            "title": "Primary source communication schedule",
            "location": "Algorithm 1 lines 1–2 and Theorem 2.1; arXiv v2 PDF p. 3"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "m",
          "description": "Source algorithm parameter instantiated to zero in this entry",
          "tex": "m"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-17b28995226fcbf3e00f",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-c8cd75de38af15472e55"
        ],
        "assumptions": [
          "auto-assumption-635ce45f315f03cad1a6"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-635ce45f315f03cad1a6",
          "auto-graph-17b28995226fcbf3e00f",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-output-f7056f83774cd9f78096",
          "auto-parameter-c8cd75de38af15472e55",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "alipour-fourcycle-18",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar without 4-cycles",
      "model": "LOCAL",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "18",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "Fixed graph-class restriction.",
      "assumptions": "Randomized LOCAL algorithm; the no-isolated-vertex setting is used here.",
      "paperId": "alipour-jafari-2020",
      "theorem": "SPAA author-talk abstract",
      "summary": "The conference abstract gives a bound under 4-cycle exclusion.",
      "verification": "primary",
      "sourceUrl": "https://papertalk.org/papertalks/24941",
      "year": 2020,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "fourcycle-planar"
      },
      "approximationDisplay": "18",
      "roundsDisplay": "Constant",
      "roundCountEvidence": {
        "basis": "unavailable",
        "explanation": "The primary author abstract confirms the approximation result but does not give a total round count. The full SPAA paper could not be accessed to verify its schedule. The count is not inferred from the separate triangle-free paper.",
        "evidence": [
          {
            "url": "https://papertalk.org/papertalks/24941",
            "title": "Primary source reviewed",
            "location": "Primary author abstract; full paper unavailable"
          }
        ],
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "Constant",
        "tex": "\\text{Constant}",
        "basis": "unavailable",
        "explanation": "The primary author abstract confirms the approximation result but does not give a total round count. The full SPAA paper could not be accessed to verify its schedule. The count is not inferred from the separate triangle-free paper.",
        "evidence": [
          {
            "url": "https://papertalk.org/papertalks/24941",
            "title": "Primary source reviewed",
            "location": "Primary author abstract; full paper unavailable"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [],
      "setting": {
        "summary": [
          "auto-graph-3795dad9c1a1c4cfdd87",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-67492501d8599441d259"
        ],
        "assumptions": [
          "auto-assumption-afd7f31621593a143084"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-afd7f31621593a143084",
          "auto-graph-3795dad9c1a1c4cfdd87",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-67492501d8599441d259",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "unitdisk-matching-2006",
      "problem": "Maximum matching",
      "variant": "Unweighted",
      "objective": "max",
      "graphClass": "Unit-disk",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − O(1 / logᵏ n)",
      "rounds": "polylog n",
      "roundClass": "polylog",
      "parameters": "Fixed positive integer k; polynomial exponent depends on k.",
      "assumptions": "No coordinates required; connected domination assumes connected input.",
      "paperId": "czygrinow-unitdisk-2006",
      "theorem": "Abstract",
      "summary": "A deterministic geometric-graph approximation scheme.",
      "verification": "primary",
      "sourceUrl": "https://citeseerx.ist.psu.edu/document?doi=20dda508c20a6ecb0968d9df37651143c62702bc&repid=rep1&type=pdf",
      "year": 2006,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "unit-disk"
      },
      "approximationDisplay": "1 − O(1 / logᵏ n)",
      "roundsDisplay": "polylog n",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "polylog n",
        "tex": "\\operatorname{polylog}n",
        "basis": "symbolic",
        "explanation": "A numerical polynomial exponent has not yet been extracted for this record. The displayed expression retains all currently recorded parameter dependence.",
        "evidence": [
          {
            "url": "https://citeseerx.ist.psu.edu/document?doi=20dda508c20a6ecb0968d9df37651143c62702bc&repid=rep1&type=pdf",
            "title": "Distributed Approximation Algorithms in Unit-Disk Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "k",
          "description": "Fixed positive exponent controlling the inverse-polylogarithmic accuracy",
          "tex": "k"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-422a8fcd40a47bc44c15",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-6ad33651604abc6ac7a2"
        ],
        "assumptions": [
          "auto-assumption-f2a82078dc0579e63cb9"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-f2a82078dc0579e63cb9",
          "auto-graph-422a8fcd40a47bc44c15",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-6ad33651604abc6ac7a2",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "unitdisk-connected-2006",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Unit-disk",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + O(1 / logᵏ n)",
      "rounds": "polylog n",
      "roundClass": "polylog",
      "parameters": "Fixed positive integer k; polynomial exponent depends on k.",
      "assumptions": "No coordinates required; connected domination assumes connected input.",
      "paperId": "czygrinow-unitdisk-2006",
      "theorem": "Abstract",
      "summary": "A deterministic geometric-graph approximation scheme.",
      "verification": "primary",
      "sourceUrl": "https://citeseerx.ist.psu.edu/document?doi=20dda508c20a6ecb0968d9df37651143c62702bc&repid=rep1&type=pdf",
      "year": 2006,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "unit-disk"
      },
      "approximationDisplay": "1 + O(1 / logᵏ n)",
      "roundsDisplay": "polylog n",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "polylog n",
        "tex": "\\operatorname{polylog}n",
        "basis": "symbolic",
        "explanation": "A numerical polynomial exponent has not yet been extracted for this record. The displayed expression retains all currently recorded parameter dependence.",
        "evidence": [
          {
            "url": "https://citeseerx.ist.psu.edu/document?doi=20dda508c20a6ecb0968d9df37651143c62702bc&repid=rep1&type=pdf",
            "title": "Distributed Approximation Algorithms in Unit-Disk Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "k",
          "description": "Fixed positive exponent controlling the inverse-polylogarithmic accuracy",
          "tex": "k"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-422a8fcd40a47bc44c15",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-6ad33651604abc6ac7a2"
        ],
        "assumptions": [
          "auto-assumption-f2a82078dc0579e63cb9"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-f2a82078dc0579e63cb9",
          "auto-graph-422a8fcd40a47bc44c15",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-6ad33651604abc6ac7a2",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "tree-weighted-domination-2006",
      "problem": "Dominating set",
      "variant": "Weighted",
      "objective": "min",
      "graphClass": "Trees",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + O(1 / log n)",
      "rounds": "polylog n",
      "roundClass": "polylog",
      "parameters": "Error tends to zero as n increases.",
      "assumptions": "Positive vertex weights.",
      "paperId": "czygrinow-weighted-sparse-2006",
      "theorem": "Theorem 2.10",
      "summary": "A deterministic near-optimal tree algorithm.",
      "verification": "primary",
      "sourceUrl": "https://citeseerx.ist.psu.edu/document?doi=5393d1efac934cd32964336c9cd276b1c6b9930b&repid=rep1&type=pdf",
      "year": 2006,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "forest"
      },
      "approximationDisplay": "1 + O(1 / log n)",
      "roundsDisplay": "polylog n",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "polylog n",
        "tex": "\\operatorname{polylog}n",
        "basis": "stated",
        "explanation": "Theorem 2.10 states only polylogarithmic rounds. Lemma 2.4 bounds cluster diameter by O(log³ n); this diameter alone is not the total algorithm complexity. The theorem does not specify a polynomial exponent.",
        "evidence": [
          {
            "url": "https://citeseerx.ist.psu.edu/document?doi=5393d1efac934cd32964336c9cd276b1c6b9930b&repid=rep1&type=pdf",
            "title": "Distributed algorithms for weighted problems in sparse graphs",
            "location": "Theorem 2.10; Lemma 2.4; WDSinTree procedure (manuscript pp. 7–11)"
          }
        ],
        "parameters": [
          {
            "symbol": "n",
            "description": "Number of vertices",
            "tex": "n"
          }
        ],
        "checked": "2026-11-16",
        "audited": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-655689d0297b69cf89ca",
          "weights-weighted"
        ],
        "parameters": [
          "auto-parameter-ef7f1cc3b30039b10a77"
        ],
        "assumptions": [
          "auto-assumption-a9fb24f2e10734b0d6e5"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-a9fb24f2e10734b0d6e5",
          "auto-graph-655689d0297b69cf89ca",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-ef7f1cc3b30039b10a77",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "planar-weighted-independent-2006",
      "problem": "Independent set",
      "variant": "Weighted",
      "objective": "max",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − O(1 / log n)",
      "rounds": "polylog n",
      "roundClass": "polylog",
      "parameters": "The finer polylogarithmic expression is in Theorem 3.6.",
      "assumptions": "Positive vertex weights; unique identifiers.",
      "paperId": "czygrinow-weighted-sparse-2006",
      "theorem": "Theorem 3.6",
      "summary": "Weighted clustering yields a near-optimal independent set.",
      "verification": "primary",
      "sourceUrl": "https://citeseerx.ist.psu.edu/document?doi=5393d1efac934cd32964336c9cd276b1c6b9930b&repid=rep1&type=pdf",
      "year": 2006,
      "problemScope": {
        "node": "independent-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "1 − O(1 / log n)",
      "roundsDisplay": "polylog n",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log log n · log* n · (log n)^(d+1)), where d = log 3 / log(12/11)",
        "tex": "O\\!\\left(\\log\\log n\\cdot\\log^* n\\cdot(\\log n)^{d+1}\\right),\\qquad d=\\frac{\\log 3}{\\log(12/11)}",
        "basis": "stated",
        "explanation": "Theorem 3.6 states this expression for the deterministic LOCAL weighted planar independent-set algorithm with ratio 1 − O(1/log n). Lemma 3.5 gives the same clustering complexity. Here d is a fixed numerical constant, not a graph parameter.",
        "evidence": [
          {
            "url": "https://citeseerx.ist.psu.edu/document?doi=5393d1efac934cd32964336c9cd276b1c6b9930b&repid=rep1&type=pdf",
            "title": "Distributed algorithms for weighted problems in sparse graphs",
            "location": "Theorem 3.6; Lemmas 3.3 and 3.5 (manuscript pp. 14–16)"
          }
        ],
        "parameters": [
          {
            "symbol": "d",
            "description": "Fixed numerical exponent log 3 / log(12/11)",
            "tex": "d"
          },
          {
            "symbol": "n",
            "description": "Number of vertices",
            "tex": "n"
          }
        ],
        "checked": "2026-11-16",
        "audited": true,
        "expression": {
          "formula": "O(log log n · log* n · (log n)^(d+1))",
          "tex": "O\\!\\left(\\log\\log n\\cdot\\log^* n\\cdot(\\log n)^{d+1}\\right)"
        },
        "suffix": {
          "formula": ", where d = log 3 / log(12/11)",
          "tex": ",\\qquad d=\\frac{\\log 3}{\\log(12/11)}"
        }
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "d",
          "description": "Fixed numerical exponent log 3 / log(12/11)",
          "tex": "d"
        },
        {
          "symbol": "n",
          "description": "Number of vertices",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-weighted"
        ],
        "parameters": [
          "auto-parameter-168a796c6c56db460d58"
        ],
        "assumptions": [
          "auto-assumption-e45d768e2b5e83c79c78"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-e45d768e2b5e83c79c78",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-4ad7b7801c4e84e8fdd9",
          "auto-parameter-168a796c6c56db460d58",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "minor-weighted-domination-2007",
      "problem": "Dominating set",
      "variant": "Weighted",
      "objective": "min",
      "graphClass": "Excluded fixed minor",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + 1 / logᵈ n",
      "rounds": "polylog n",
      "roundClass": "polylog",
      "parameters": "Fixed positive integer d and proper minor-closed family.",
      "assumptions": "Positive vertex weights; unique identifiers.",
      "paperId": "czygrinow-weighted-minor-2007",
      "theorem": "Theorem 5",
      "summary": "A historical weighted domination scheme.",
      "verification": "primary",
      "sourceUrl": "https://citeseerx.ist.psu.edu/document?doi=81197b872b8589d907fbef91ebf5600dfe34c59a&repid=rep1&type=pdf",
      "year": 2007,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "1 + 1 / logᵈ n",
      "roundsDisplay": "polylog n",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "polylog n",
        "tex": "\\operatorname{polylog}n",
        "basis": "stated",
        "explanation": "Theorem 5 states polylogarithmic rounds for ratio 1 + 1/(log n)^d. The polynomial can depend on the fixed accuracy exponent d and the minor-closed family. Corollary 3(b) also leaves its polynomial exponent unspecified.",
        "evidence": [
          {
            "url": "https://citeseerx.ist.psu.edu/document?doi=81197b872b8589d907fbef91ebf5600dfe34c59a&repid=rep1&type=pdf",
            "title": "Distributed approximation algorithms for weighted problems in minor-closed families",
            "location": "Theorem 5; Corollary 3(b); Vertex-weight Partition and Lemma 5"
          }
        ],
        "parameters": [
          {
            "symbol": "d",
            "description": "Fixed positive integer controlling the inverse-polylogarithmic approximation error",
            "tex": "d"
          },
          {
            "symbol": "n",
            "description": "Number of vertices",
            "tex": "n"
          }
        ],
        "checked": "2026-11-16",
        "audited": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "d",
          "description": "Fixed positive integer controlling the inverse-polylogarithmic approximation error",
          "tex": "d"
        },
        {
          "symbol": "n",
          "description": "Number of vertices",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-e40ef97c3969c67aad8c",
          "weights-weighted"
        ],
        "parameters": [
          "auto-parameter-8075cb2442a2168b4de2"
        ],
        "assumptions": [
          "auto-assumption-e45d768e2b5e83c79c78"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-e45d768e2b5e83c79c78",
          "auto-graph-e40ef97c3969c67aad8c",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-8075cb2442a2168b4de2",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "unitdisk-fractional-domination",
      "problem": "Fractional dominating set",
      "variant": "Fractional LP relaxation",
      "objective": "min",
      "graphClass": "Unit-disk",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "O(1)",
      "rounds": "1 round",
      "roundClass": "constant",
      "parameters": "Fixed unit-disk geometry.",
      "assumptions": "Nodes know geometric distances to neighbors. Output is fractional, not a dominating vertex set.",
      "paperId": "kuhn-locality-growth-2005",
      "theorem": "Theorem 4.3",
      "summary": "Local geometry permits constant-factor fractional domination.",
      "verification": "primary",
      "sourceUrl": "https://courses.csail.mit.edu/6.885/spring06/papers/KuhnMW.pdf",
      "year": 2005,
      "problemScope": {
        "node": "fractional-dominating-set"
      },
      "problemSource": "Dominating set",
      "graphScope": {
        "node": "unit-disk"
      },
      "prerequisite": "Geometric distances supplied",
      "approximationDisplay": "Constant",
      "roundsDisplay": "1 round",
      "approximationBenchmark": "fractional",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "1 round",
        "tex": "1\\text{ round}",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://courses.csail.mit.edu/6.885/spring06/papers/KuhnMW.pdf",
            "title": "On the locality of bounded growth",
            "location": "Theorem 4.3"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [],
      "setting": {
        "summary": [
          "auto-graph-422a8fcd40a47bc44c15",
          "weights-unweighted",
          "input-geometric-distances"
        ],
        "parameters": [
          "auto-parameter-7b82cb05a7875699c083"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-422a8fcd40a47bc44c15",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-19e536b10b8d7f071a79",
          "auto-parameter-7b82cb05a7875699c083",
          "detail-fractional-benchmark",
          "detail-fractional-output",
          "input-geometric-distances",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-ps09-vc",
      "problem": "Vertex cover",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "General",
      "model": "Anonymous",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "3",
      "rounds": "2Δ + 1",
      "roundClass": "degree",
      "parameters": "Constant in n when Δ is fixed.",
      "assumptions": "Port numbering; identifiers are unnecessary.",
      "paperId": "gen-ps09",
      "theorem": "Theorem 1",
      "summary": "A port-numbering algorithm with a linear degree dependence.",
      "verification": "primary",
      "sourceUrl": "https://citeseerx.ist.psu.edu/document?doi=6abcfa3e2d0134e51aa8b540f6ab69408fe95f6c&repid=rep1&type=pdf",
      "year": 2009,
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "approximationDisplay": "3",
      "roundsDisplay": "2Δ + 1",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "2Δ + 1",
        "tex": "2\\Delta  + 1",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://citeseerx.ist.psu.edu/document?doi=6abcfa3e2d0134e51aa8b540f6ab69408fe95f6c&repid=rep1&type=pdf",
            "title": "A simple local 3-approximation algorithm for vertex cover",
            "location": "Theorem 1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-unweighted",
          "model-port-numbering"
        ],
        "parameters": [
          "auto-parameter-dfdfaabc71602b4f4891"
        ],
        "assumptions": [],
        "detail": [
          "strength-no-ids"
        ],
        "covered": [
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-92362405df7c8f0d5040",
          "auto-output-7f07455ff69b3b347e9b",
          "auto-parameter-dfdfaabc71602b4f4891",
          "model-port-numbering",
          "strength-no-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-as10-vc",
      "problem": "Vertex cover",
      "variant": "Weighted",
      "objective": "min",
      "graphClass": "General",
      "model": "Anonymous",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "2",
      "rounds": "O(Δ + log* W)",
      "roundClass": "degree",
      "parameters": "W is the largest positive integer weight; fixed Δ and W give constant rounds.",
      "assumptions": "Anonymous port-numbered graph.",
      "paperId": "gen-as10",
      "theorem": "Theorem 1 and vertex-cover reduction",
      "summary": "Finds a maximal fractional edge packing and selects saturated vertices.",
      "verification": "primary",
      "sourceUrl": "https://jukkasuomela.fi/doc/vc-sc.pdf",
      "year": 2010,
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "approximationDisplay": "2",
      "roundsDisplay": "O(Δ + log* W)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(Δ + log* W)",
        "tex": "O(\\Delta  + \\log^* W)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/vc-sc.pdf",
            "title": "Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks",
            "location": "Theorem 1 and vertex-cover reduction"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "General · exact factor 2 · degree/weight dependent",
        "setting": "Deterministic anonymous port numbering; weighted vertex cover on general graphs; positive integer weights at most W; O(Δ + log* W) rounds, independent of n.",
        "reason": "Theorem 1 yields exact factor 2. This retains a tradeoff independent of n, absent from the faster-in-Δ polylogarithmic-n exact-2 result. Factor 2 is optimal for deterministic local algorithms when auxiliary parameters are fixed; optimal dependence on Δ and W is not claimed.",
        "evidenceUrl": "https://jukkasuomela.fi/doc/vc-sc.pdf",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-integer-W",
      "constantApproximation": true,
      "tightness": [
        {
          "certificateId": "anonymous-vertex-cover-factor-two",
          "resultId": "gen-as10-vc",
          "graphs": [
            "general"
          ],
          "problems": [
            "vertex-cover"
          ],
          "models": [
            "Anonymous"
          ],
          "conditionIds": []
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "W",
          "description": "Largest positive integer input vertex weight",
          "tex": "W"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-integer-W",
          "model-port-numbering"
        ],
        "parameters": [
          "auto-parameter-4f0b91346f5e2f0cce0a"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-92362405df7c8f0d5040",
          "auto-output-7f07455ff69b3b347e9b",
          "auto-parameter-4f0b91346f5e2f0cce0a",
          "model-port-numbering",
          "weights-integer-W",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-bcs16-vc",
      "problem": "Vertex cover",
      "variant": "Weighted",
      "objective": "min",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "2 + ε",
      "rounds": "O(log Δ / (ε log log Δ))",
      "roundClass": "degree",
      "parameters": "0 < ε = O(1); constant in n for fixed Δ, ε. Logs are truncated at constants.",
      "assumptions": "Weights and their maximum/minimum ratio have O(log n)-bit encodings.",
      "paperId": "gen-bcs16",
      "theorem": "Theorem 3.1 and Section 4",
      "summary": "A deterministic primal-dual approximation.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/1602.03713",
      "year": 2016,
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "approximationDisplay": "2 + ε",
      "roundsDisplay": "O(log Δ / (ε log log Δ))",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log Δ / (ε log log Δ))",
        "tex": "O\\!\\left(\\frac{\\log\\Delta}{\\varepsilon\\log\\log\\Delta}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/1602.03713",
            "title": "A Distributed (2+ε)-Approximation for Vertex Cover in O(log Δ / (ε log log Δ)) Rounds",
            "location": "Theorem 3.1 and Section 4"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-weighted"
        ],
        "parameters": [
          "auto-parameter-3f51ea419bee252999ef"
        ],
        "assumptions": [
          "auto-assumption-4b3fdcd87cdd0a2f66b9"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-4b3fdcd87cdd0a2f66b9",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-7f07455ff69b3b347e9b",
          "auto-parameter-3f51ea419bee252999ef",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-beks18-exact2",
      "problem": "Vertex cover",
      "variant": "Weighted",
      "objective": "min",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "2",
      "rounds": "O(log n · log Δ / log² log Δ)",
      "roundClass": "polylog",
      "parameters": "Logs are truncated at constants.",
      "assumptions": "Positive integer vertex weights at most W = n^O(1). Vertices know Δ or an upper bound polynomial in Δ. The exact-factor-2 instantiation uses a supplied common polynomial-in-n bound B ≥ nW, allowing the internal accuracy ε < 1/B (for example ε = 1/(2B)); knowing n and W suffices. Identifiers are unnecessary.",
      "paperId": "gen-beks18",
      "theorem": "Abstract",
      "summary": "Obtains factor two without an ε loss.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/1804.01308",
      "year": 2018,
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "prerequisite": "Known Δ and a common polynomial bound B ≥ nW",
      "approximationDisplay": "2",
      "roundsDisplay": "O(log n · log Δ / log² log Δ)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log n · log Δ / log² log Δ)",
        "tex": "O\\!\\left(\\frac{\\log n\\,\\log\\Delta}{(\\log\\log\\Delta)^2}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/1804.01308",
            "title": "A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(log n log Δ / log² log Δ) Rounds",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "General · exact factor 2 · polylogarithmic",
        "setting": "Deterministic CONGEST; weighted vertex cover on general graphs; positive integer weights W≤n^O(1); Δ or a polynomial-in-Δ upper bound known; a common polynomial-in-n bound B≥nW permits internal ε<1/B; exact factor 2 in O(log n · log Δ / log² log Δ) rounds.",
        "reason": "The paper supplies the exact-2 point of the weighted-VC tradeoff, improving prior deterministic exact-2 complexity. A 2+ε guarantee, even with fewer rounds, does not dominate exact factor 2; the anonymous n-independent exact-2 algorithm has a different Δ/weight tradeoff. No matching running-time lower bound is claimed.",
        "evidenceUrl": "https://arxiv.org/pdf/1804.01308v3",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierComparisons": [
        {
          "better": "gen-beks19-exact2",
          "worse": "gen-beks18-exact2",
          "strict": [
            "rounds",
            "assumptions"
          ],
          "conditions": {
            "problem": "Both return an integral minimum-weight vertex-cover approximation on the original graph.",
            "graphClass": "Both apply to all general graphs.",
            "approximation": "The approximation ratio is identical for every allowed accuracy value; the exact-2 comparison has no additive loss.",
            "rounds": "O(log n) is no worse than O(log n·log Δ/log² log Δ), with truncated logarithms. The improvement is strict when Δ grows, for example Δ=n. Both statements specify asymptotic round complexities. The comparison concerns their dependence on n and Δ.",
            "model": "Both are deterministic CONGEST algorithms. The rank-two edge processors of the newer protocol are simulated with constant overhead.",
            "randomness": "Both are deterministic.",
            "benchmark": "The newer guarantee is at least as strong as the older integral-OPT benchmark. In the approximate case its proof also bounds cost against fractional OPT.",
            "assumptions": "Both use positive polynomially bounded integer weights and a common polynomial bound B≥nW for the small-accuracy integrality step. The older implementation also needs global Δ; the newer one does not."
          },
          "evidenceUrl": "https://arxiv.org/pdf/1902.09377v2#page=9",
          "reason": "The 2019 rank-two corollary gives exact factor 2 in logarithmic rounds, superseding the older extra degree-dependent factor without stronger input assumptions."
        }
      ],
      "dominatedBy": [
        "gen-beks19-exact2"
      ],
      "frontierStatus": "dominated",
      "weightCondition": "weights-integer-polynomial",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "B",
          "description": "Supplied common polynomial upper bound on nW for the exact-factor integrality step",
          "tex": "B"
        },
        {
          "symbol": "W",
          "description": "Upper bound on positive integer input vertex weights; polynomial in n",
          "tex": "W"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-integer-polynomial",
          "input-degree-and-nW-bound"
        ],
        "parameters": [
          "auto-parameter-7fd648ba359d62bdb633"
        ],
        "assumptions": [],
        "detail": [
          "detail-exact-integrality",
          "strength-no-ids"
        ],
        "covered": [
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-7f07455ff69b3b347e9b",
          "auto-parameter-7fd648ba359d62bdb633",
          "detail-exact-integrality",
          "input-common-nW-bound",
          "input-degree-and-nW-bound",
          "input-known-degree-bound",
          "strength-no-ids",
          "weights-integer-polynomial",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-beks18-eps",
      "problem": "Vertex cover",
      "variant": "Weighted",
      "objective": "min",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "2 + (log Δ)⁻ᶜ",
      "rounds": "O(log Δ / log log Δ)",
      "roundClass": "degree",
      "parameters": "Fixed c ≥ 1; logs truncated at constants.",
      "assumptions": "Positive integer vertex weights at most W = n^O(1). Vertices know Δ or an upper bound polynomial in Δ; the stated inverse-polylogarithmic accuracy is instantiated using that degree information. Identifiers are unnecessary. Section 4 gives separate unknown-Δ variants with their own parameter choices.",
      "paperId": "gen-beks18",
      "theorem": "Abstract",
      "summary": "A degree-dependent approximation approaching two.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/1804.01308",
      "year": 2018,
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "prerequisite": "Known Δ or a polynomial upper bound",
      "approximationDisplay": "2 + (log Δ)⁻ᶜ",
      "roundsDisplay": "O(log Δ / log log Δ)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log Δ / log log Δ)",
        "tex": "O\\!\\left(\\frac{\\log\\Delta}{\\log\\log\\Delta}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/1804.01308",
            "title": "A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(log n log Δ / log² log Δ) Rounds",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "General · inverse-polylog accuracy · degree dependent",
        "setting": "Deterministic CONGEST; weighted vertex cover on general graphs; positive integer weights W≤n^O(1); Δ or a polynomial-in-Δ upper bound known; fixed c≥1 and accuracy ε=(log Δ)^−c; O(log Δ / log log Δ) rounds. This annotation uses the known-degree instantiation, not the separate Section 4 variants.",
        "reason": "Theorem 2 gives the degree-optimal round dependence in this accuracy range, matching the KMW lower bound for constant or polylogarithmic factors. Exact factor 2 requires a different round tradeoff. This annotation is restricted to the stated relation between ε and Δ.",
        "evidenceUrl": "https://arxiv.org/pdf/1804.01308v3#page=6",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierComparisons": [
        {
          "better": "gen-beks18-full-eps",
          "worse": "gen-beks18-eps",
          "strict": [
            "assumptions"
          ],
          "parameterSubstitution": "ε=(log Δ)^−c for fixed c≥1",
          "conditions": {
            "problem": "Both solve minimum-weight vertex cover and return an integral vertex set.",
            "graphClass": "Both work on general graphs.",
            "approximation": "Substituting ε=(log Δ)^−c gives exactly the corollary’s ratio 2+(log Δ)^−c.",
            "rounds": "This is the same Algorithm 1, not a comparison of unrelated hidden constants. In Theorem 2 the substitution makes log(1/ε)=c log log Δ and yields O(log Δ/log log Δ) for fixed c; the bounded-degree cases use the same protocol.",
            "model": "Both use the same deterministic CONGEST implementation.",
            "randomness": "Both are deterministic.",
            "benchmark": "Both compare the integral cover cost with weighted integral OPT.",
            "assumptions": "Both require positive polynomially bounded integer weights and known Δ or a polynomial upper bound. The full theorem permits every ε∈(0,1); the narrower inverse-polylogarithmic accuracy restriction is unnecessary."
          },
          "evidenceUrl": "https://arxiv.org/pdf/1804.01308v3#page=6",
          "reason": "The special accuracy point is already contained in the full Theorem 2 family, with identical algorithm, guarantee and round complexity after substitution and a strictly larger accuracy domain."
        }
      ],
      "dominatedBy": [
        "gen-beks18-full-eps"
      ],
      "frontierStatus": "dominated",
      "weightCondition": "weights-integer-polynomial",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "W",
          "description": "Upper bound on positive integer input vertex weights; polynomial in n",
          "tex": "W"
        },
        {
          "symbol": "c",
          "description": "Fixed exponent at least one controlling the inverse-polylogarithmic accuracy",
          "tex": "c"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-integer-polynomial",
          "input-known-degree-bound"
        ],
        "parameters": [
          "auto-parameter-353144e79cb249f819e3"
        ],
        "assumptions": [],
        "detail": [
          "strength-no-ids",
          "detail-unknown-degree-variants"
        ],
        "covered": [
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-7f07455ff69b3b347e9b",
          "auto-parameter-353144e79cb249f819e3",
          "detail-unknown-degree-variants",
          "input-known-degree-bound",
          "strength-no-ids",
          "weights-integer-polynomial",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-emr14-cardinality",
      "problem": "Maximum matching",
      "variant": "Unweighted",
      "objective": "max",
      "graphClass": "General",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − ε of OPT",
      "rounds": "Δᴼ⁽¹⁄ε⁾ + O(ε⁻²) log* n",
      "roundClass": "logstar",
      "parameters": "Fixed Δ and ε give O(log* n).",
      "assumptions": "Unique polynomial-size identifiers; n and Δ known.",
      "paperId": "gen-emr14",
      "theorem": "Abstract",
      "summary": "Deterministic approximation scheme for bounded degree.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/1407.7882",
      "year": 2014,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "prerequisite": "Known n and Δ",
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "Δᴼ⁽¹⁄ε⁾ + O(ε⁻²) log* n",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Δᴼ⁽¹⁄ε⁾ + O(ε⁻²) log* n",
        "tex": "\\Delta^{O(1/\\varepsilon)}+O(\\varepsilon^{-2})\\log^*n",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/1407.7882",
            "title": "Distributed Maximum Matching in Bounded Degree Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-unweighted",
          "input-known-n-degree"
        ],
        "parameters": [
          "auto-parameter-d1888d49018736b6c746"
        ],
        "assumptions": [
          "input-logarithmic-ids"
        ],
        "detail": [],
        "covered": [
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-d1888d49018736b6c746",
          "input-distinct-ids",
          "input-known-degree",
          "input-known-n",
          "input-known-n-degree",
          "input-logarithmic-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-emr14-weighted",
      "problem": "Maximum matching",
      "variant": "Weighted",
      "objective": "max",
      "graphClass": "General",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − ε of OPT",
      "rounds": "log(min{1/w_min, n/ε})ᴼ⁽¹⁄ε⁾ · (Δᴼ⁽¹⁄ε⁾ + log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed Δ, ε and positive w_min give O(log* n).",
      "assumptions": "Weights normalized to [w_min, 1]; unique IDs; n and Δ known.",
      "paperId": "gen-emr14",
      "theorem": "Abstract",
      "summary": "A weighted extension with explicit dependence on weight range.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/1407.7882",
      "year": 2014,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "prerequisite": "Known n and Δ",
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "log(min{1/w_min, n/ε})ᴼ⁽¹⁄ε⁾ · (Δᴼ⁽¹⁄ε⁾ + log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "log(min{1/w_min, n/ε})ᴼ⁽¹⁄ε⁾ · (Δᴼ⁽¹⁄ε⁾ + log* n)",
        "tex": "\\log^{O(1/\\varepsilon)}\\!\\left(\\min\\left\\{\\frac{1}{w_{\\min}},\\frac{n}{\\varepsilon}\\right\\}\\right)\\left(\\Delta^{O(1/\\varepsilon)}+\\log^*n\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/1407.7882",
            "title": "Distributed Maximum Matching in Bounded Degree Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-normalized-positive",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "w_min",
          "description": "Smallest normalized positive edge weight; all weights lie in [w_min,1]",
          "tex": "w_{\\min}"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-normalized-positive",
          "input-known-n-degree"
        ],
        "parameters": [
          "auto-parameter-d8bbb2a784bfaf07e208"
        ],
        "assumptions": [
          "input-distinct-ids"
        ],
        "detail": [],
        "covered": [
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-d8bbb2a784bfaf07e208",
          "input-distinct-ids",
          "input-known-degree",
          "input-known-n",
          "input-known-n-degree",
          "weights-normalized-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-bcgs17-is",
      "problem": "Independent set",
      "variant": "Weighted",
      "objective": "max",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1/Δ of OPT",
      "rounds": "O(Δ + log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed Δ gives O(log* n).",
      "assumptions": "",
      "paperId": "gen-bcgs17",
      "theorem": "Table 1; Section 2",
      "summary": "Coloring-based local-ratio algorithm.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/1708.00276",
      "year": 2017,
      "problemScope": {
        "node": "independent-set"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "approximationDisplay": "1/Δ",
      "roundsDisplay": "O(Δ + log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(Δ + log* n)",
        "tex": "O(\\Delta  + \\log^* n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/1708.00276",
            "title": "Distributed Approximation of Maximum Independent Set and Maximum Matching",
            "location": "Table 1; Section 2"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-weighted"
        ],
        "parameters": [
          "auto-parameter-15159932d98a441680fe"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-4ad7b7801c4e84e8fdd9",
          "auto-parameter-15159932d98a441680fe",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-bcgs17-mwm",
      "problem": "Maximum matching",
      "variant": "Weighted",
      "objective": "max",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1/2 of OPT",
      "rounds": "O(Δ + log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed Δ gives O(log* n).",
      "assumptions": "",
      "paperId": "gen-bcgs17",
      "theorem": "Table 1; Section 2.4",
      "summary": "A line-graph simulation preserves the message-size bound.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/1708.00276",
      "year": 2017,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "approximationDisplay": "1/2",
      "roundsDisplay": "O(Δ + log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(Δ + log* n)",
        "tex": "O(\\Delta  + \\log^* n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/1708.00276",
            "title": "Distributed Approximation of Maximum Independent Set and Maximum Matching",
            "location": "Table 1; Section 2.4"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-weighted",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-weighted"
        ],
        "parameters": [
          "auto-parameter-15159932d98a441680fe"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-15159932d98a441680fe",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-bcgs17-fast-mwm",
      "problem": "Maximum matching",
      "variant": "Weighted",
      "objective": "max",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "1/(2 + ε) of OPT",
      "rounds": "O(log Δ / log log Δ)",
      "roundClass": "degree",
      "parameters": "Fixed ε > 0; logs truncated at constants.",
      "assumptions": "Randomized guarantee; see Section 3 for probability details.",
      "paperId": "gen-bcgs17",
      "theorem": "Table 1; Section 3",
      "summary": "Trades a small approximation loss for degree-only runtime.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/1708.00276",
      "year": 2017,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "approximationDisplay": "1/(2 + ε)",
      "roundsDisplay": "O(log Δ / log log Δ)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log Δ / log log Δ)",
        "tex": "O\\!\\left(\\frac{\\log\\Delta}{\\log\\log\\Delta}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/1708.00276",
            "title": "Distributed Approximation of Maximum Independent Set and Maximum Matching",
            "location": "Table 1; Section 3"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-weighted"
        ],
        "parameters": [
          "auto-parameter-5936198c8edb2e100c9d"
        ],
        "assumptions": [
          "auto-assumption-cf6ebb6783a98dbd5cbb"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-cf6ebb6783a98dbd5cbb",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-5936198c8edb2e100c9d",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-bcgs17-fast-mcm",
      "problem": "Maximum matching",
      "variant": "Unweighted",
      "objective": "max",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "1/(1 + ε) of OPT",
      "rounds": "O(log Δ / log log Δ)",
      "roundClass": "degree",
      "parameters": "Fixed ε > 0; logs truncated at constants.",
      "assumptions": "Randomized guarantee; probability depends on instance size and parameters.",
      "paperId": "gen-bcgs17",
      "theorem": "Table 1; Appendix B.3",
      "summary": "Uses short augmenting paths in sampled bipartite subgraphs.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/1708.00276",
      "year": 2017,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "approximationDisplay": "1/(1 + ε)",
      "roundsDisplay": "O(log Δ / log log Δ)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log Δ / log log Δ)",
        "tex": "O\\!\\left(\\frac{\\log\\Delta}{\\log\\log\\Delta}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/1708.00276",
            "title": "Distributed Approximation of Maximum Independent Set and Maximum Matching",
            "location": "Table 1; Appendix B.3"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-5936198c8edb2e100c9d"
        ],
        "assumptions": [
          "auto-assumption-70a7a2d2cd73511df407"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-70a7a2d2cd73511df407",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-5936198c8edb2e100c9d",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-ako18-fractional",
      "problem": "Fractional matching",
      "variant": "Fractional weighted",
      "objective": "max",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − ε of fractional OPT",
      "rounds": "O(log(ΔW) / ε²)",
      "roundClass": "degree",
      "parameters": "W is largest/smallest edge weight; fixed Δ, W, ε give constant rounds.",
      "assumptions": "",
      "paperId": "gen-ako18",
      "theorem": "Abstract",
      "summary": "Approximates the fractional matching LP.",
      "verification": "primary",
      "sourceUrl": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.6",
      "year": 2018,
      "status": "claimed",
      "caveat": "Li–Ouyang–Wang (2024), Remark 1.2, reports a flaw in the weighted fractional matching proof and says the claimed time bound is not recovered. Integral weighted bounds use that fractional primitive; retained as published claims.",
      "caveatUrl": "https://arxiv.org/html/2409.16168v1",
      "problemScope": {
        "node": "fractional-matching"
      },
      "problemSource": "Maximum matching",
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "O(log(ΔW) / ε²)",
      "approximationBenchmark": "fractional",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log(ΔW) / ε²)",
        "tex": "O\\!\\left(\\frac{\\log(\\Delta W)}{\\varepsilon^2}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.6",
            "title": "Distributed Approximate Maximum Matching in the CONGEST Model",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "W",
          "description": "Ratio of the largest to the smallest positive edge weight",
          "tex": "W"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-weighted"
        ],
        "parameters": [
          "auto-parameter-c8d5c1c10fbc9e230819"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-9ba84324ac5813181686",
          "auto-parameter-c8d5c1c10fbc9e230819",
          "detail-fractional-benchmark",
          "detail-fractional-output",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-ako18-bipartite",
      "problem": "Maximum matching",
      "variant": "Weighted",
      "objective": "max",
      "graphClass": "Bipartite",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − ε of OPT",
      "rounds": "O(log(ΔW)/ε² + (log² Δ + log* n)/ε)",
      "roundClass": "logstar",
      "parameters": "Fixed Δ, W and ε give O(log* n).",
      "assumptions": "",
      "paperId": "gen-ako18",
      "theorem": "Abstract",
      "summary": "Deterministic rounding of a fractional matching.",
      "verification": "primary",
      "sourceUrl": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.6",
      "year": 2018,
      "status": "claimed",
      "caveat": "Li–Ouyang–Wang (2024), Remark 1.2, reports a flaw in the weighted fractional matching proof and says the claimed time bound is not recovered. Integral weighted bounds use that fractional primitive; retained as published claims.",
      "caveatUrl": "https://arxiv.org/html/2409.16168v1",
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "bipartite"
      },
      "graphClassSource": "Bipartite graphs",
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "O(log(ΔW)/ε² + (log² Δ + log* n)/ε)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log(ΔW)/ε² + (log² Δ + log* n)/ε)",
        "tex": "O\\!\\left(\\frac{\\log(\\Delta W)}{\\varepsilon^2}+\\frac{\\log^2\\Delta+\\log^*n}{\\varepsilon}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.6",
            "title": "Distributed Approximate Maximum Matching in the CONGEST Model",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "W",
          "description": "Ratio of the largest to the smallest positive edge weight",
          "tex": "W"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-7a5af0aff91f9fa9d17f",
          "weights-weighted"
        ],
        "parameters": [
          "auto-parameter-95d1811bfaf4d14ff9a2"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-7a5af0aff91f9fa9d17f",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-95d1811bfaf4d14ff9a2",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-ako18-oddgirth",
      "problem": "Maximum matching",
      "variant": "Weighted",
      "objective": "max",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 − ε)(g − 1)/g of OPT",
      "rounds": "O(log(ΔW)/ε² + (log² Δ + log* n)/ε)",
      "roundClass": "logstar",
      "parameters": "g is odd girth; W is the edge-weight ratio; fixed Δ, W, ε give O(log* n).",
      "assumptions": "",
      "paperId": "gen-ako18",
      "theorem": "Abstract",
      "summary": "Odd girth controls the integrality loss.",
      "verification": "primary",
      "sourceUrl": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.6",
      "year": 2018,
      "status": "claimed",
      "caveat": "Li–Ouyang–Wang (2024), Remark 1.2, reports a flaw in the weighted fractional matching proof and says the claimed time bound is not recovered. Integral weighted bounds use that fractional primitive; retained as published claims.",
      "caveatUrl": "https://arxiv.org/html/2409.16168v1",
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "approximationDisplay": "(1 − ε)(g − 1)/g",
      "roundsDisplay": "O(log(ΔW)/ε² + (log² Δ + log* n)/ε)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log(ΔW)/ε² + (log² Δ + log* n)/ε)",
        "tex": "O\\!\\left(\\frac{\\log(\\Delta W)}{\\varepsilon^2}+\\frac{\\log^2\\Delta+\\log^*n}{\\varepsilon}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.6",
            "title": "Distributed Approximate Maximum Matching in the CONGEST Model",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "W",
          "description": "Ratio of the largest to the smallest positive edge weight",
          "tex": "W"
        },
        {
          "symbol": "g",
          "description": "Odd girth: length of a shortest odd cycle",
          "tex": "g"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-weighted"
        ],
        "parameters": [
          "auto-parameter-afe3872ce26bd4e61843"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-afe3872ce26bd4e61843",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-ffk21-vc-bip",
      "problem": "Vertex cover",
      "variant": "Weighted",
      "objective": "min",
      "graphClass": "Bipartite",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "poly(log n / ε)",
      "roundClass": "polylog",
      "parameters": "",
      "assumptions": "",
      "paperId": "gen-ffk21",
      "theorem": "Abstract",
      "summary": "Near-optimal bipartite cover.",
      "verification": "primary",
      "sourceUrl": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.17",
      "year": 2021,
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "bipartite"
      },
      "graphClassSource": "Bipartite graphs",
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "poly(log n / ε)",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "poly(log n / ε)",
        "tex": "\\operatorname{poly}(\\log n/\\varepsilon)",
        "basis": "stated",
        "explanation": "Theorem 1.1 of the full version states this deterministic CONGEST bound for weighted bipartite vertex cover, for ε ∈ (0,1]. The theorem and diameter-reduction implementation do not supply a complete numerical polynomial exponent.",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2111.10577",
            "title": "Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings",
            "location": "Theorem 1.1; Theorem 3.1; Section 4.1"
          },
          {
            "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.17",
            "title": "Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings (OPODIS 2021)",
            "location": "Theorem 1; related full-version link"
          }
        ],
        "parameters": [
          {
            "symbol": "ε",
            "description": "Approximation accuracy, 0 < ε ≤ 1",
            "tex": "\\varepsilon"
          },
          {
            "symbol": "n",
            "description": "Number of vertices",
            "tex": "n"
          }
        ],
        "checked": "2026-11-16",
        "audited": true
      },
      "sota": {
        "scopeLabel": "Bipartite · weighted VC · polylogarithmic scheme",
        "setting": "Deterministic CONGEST; minimum-weight vertex cover on bipartite graphs; source weight encodings; every ε∈(0,1]; factor 1+ε in poly(log n/ε) rounds.",
        "reason": "Theorem 1.1 gives the weighted bipartite approximation-scheme point. General-graph factor-2 or 2+ε bounds do not dominate its stronger guarantee. The paper proves an Ω(log n/ε) LOCAL lower bound already on degree-three bipartite graphs; this does not establish optimal polylogarithmic exponents.",
        "evidenceUrl": "https://arxiv.org/pdf/2111.10577#page=4",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-epsilon-unit-inclusive",
          "claim-source-weight-encoding"
        ]
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy, 0 < ε ≤ 1",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-7a5af0aff91f9fa9d17f",
          "weights-weighted"
        ],
        "parameters": [],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-7a5af0aff91f9fa9d17f",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-7f07455ff69b3b347e9b",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-ffk21-mwm-det",
      "problem": "Maximum matching",
      "variant": "Weighted",
      "objective": "max",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − ε of OPT",
      "rounds": "2ᴼ⁽¹⁄ε⁾ · polylog n",
      "roundClass": "polylog",
      "parameters": "ε > 0.",
      "assumptions": "",
      "paperId": "gen-ffk21",
      "theorem": "Abstract",
      "summary": "Deterministic weighted matching scheme.",
      "verification": "primary",
      "sourceUrl": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.17",
      "year": 2021,
      "status": "claimed",
      "caveat": "Inherited dependency: FFK21 Lemma 5.2 invokes AKO18 weighted bipartite matching. Li–Ouyang–Wang (2024), Remark 1.2, reports a proof flaw in AKO18’s weighted fractional primitive. This catalog has not verified a repair preserving this bound.",
      "caveatUrl": "https://arxiv.org/html/2409.16168v1",
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "2ᴼ⁽¹⁄ε⁾ · polylog n",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "2ᴼ⁽¹⁄ε⁾ · polylog n",
        "tex": "2^{O(1/\\varepsilon)}\\operatorname{polylog}n",
        "basis": "stated",
        "explanation": "Lemma 5.8 in the full version retains an unspecified polylogarithmic factor. The more explicit expression involving Δ, W and failure probability δ in Theorem 1.4 applies to the randomized algorithm. Preserve the catalog's existing dependency caveat for the deterministic result.",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2111.10577",
            "title": "Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings",
            "location": "Lemma 5.8 and proof; Theorem 1.4"
          }
        ],
        "parameters": [
          {
            "symbol": "ε",
            "description": "Approximation accuracy, 0 < ε ≤ 1",
            "tex": "\\varepsilon"
          },
          {
            "symbol": "n",
            "description": "Number of vertices",
            "tex": "n"
          }
        ],
        "checked": "2026-11-16",
        "audited": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy, 0 < ε ≤ 1",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-weighted"
        ],
        "parameters": [
          "auto-parameter-d3b582587818d15dae40"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-d3b582587818d15dae40",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-ffk21-mwm-rand",
      "problem": "Maximum matching",
      "variant": "Weighted",
      "objective": "max",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "1 − ε of OPT",
      "rounds": "2ᴼ⁽¹⁄ε⁾ · (log(ΔW) + log² Δ + log* n) · log³(1/δ)",
      "roundClass": "logstar",
      "parameters": "Fixed Δ, W, ε, δ give O(log* n).",
      "assumptions": "Success probability ≥ 1−δ; W is largest/smallest weight.",
      "paperId": "gen-ffk21",
      "theorem": "Theorem 1.4",
      "summary": "Randomized weighted matching scheme.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2111.10577",
      "year": 2021,
      "status": "claimed",
      "caveat": "Inherited dependency: FFK21 Lemma 5.2 invokes AKO18 weighted bipartite matching. Li–Ouyang–Wang (2024), Remark 1.2, reports a proof flaw in AKO18’s weighted fractional primitive. This catalog has not verified a repair preserving this bound.",
      "caveatUrl": "https://arxiv.org/html/2409.16168v1",
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "2ᴼ⁽¹⁄ε⁾ · (log(ΔW) + log² Δ + log* n) · log³(1/δ)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "2ᴼ⁽¹⁄ε⁾ · (log(ΔW) + log² Δ + log* n) · log³(1/δ)",
        "tex": "2^{O(1/\\varepsilon)}\\bigl(\\log(\\Delta W)+\\log^2\\Delta+\\log^*n\\bigr)\\log^3(1/\\delta)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2111.10577",
            "title": "Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings",
            "location": "Theorem 1.4"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "W",
          "description": "Ratio of the largest to the smallest positive edge weight",
          "tex": "W"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "δ",
          "description": "Failure-probability upper bound; success probability is at least 1−δ",
          "tex": "\\delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-weighted"
        ],
        "parameters": [
          "auto-parameter-7cb2254842bd27f88e5d"
        ],
        "assumptions": [
          "auto-assumption-3b7575788fd0f5679a75"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-3b7575788fd0f5679a75",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-7cb2254842bd27f88e5d",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-ffk21-vc-lower",
      "problem": "Vertex cover",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Bipartite; Δ ≤ 3",
      "model": "LOCAL",
      "randomization": "Randomized",
      "bound": "lower",
      "approximation": "1 + ε",
      "rounds": "Ω(log n / ε)",
      "roundClass": "logarithmic",
      "parameters": "0 < ε < ε₀ for a positive constant ε₀.",
      "assumptions": "Applies to randomized algorithms, hence also deterministic ones.",
      "paperId": "gen-ffk21",
      "theorem": "Theorem 1.5; Section 6",
      "summary": "Even degree-three bipartite graphs require nonlocal information.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2111.10577",
      "year": 2021,
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "degree-bipartite"
      },
      "graphClassSource": "Bipartite graphs, Δ ≤ 3",
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "Ω(log n / ε)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Ω(log n / ε)",
        "tex": "\\Omega\\!\\left(\\frac{\\log n}{\\varepsilon}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2111.10577",
            "title": "Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings",
            "location": "Theorem 1.5; Section 6"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "ε₀",
          "description": "Positive absolute upper threshold on the accuracy parameter",
          "tex": "\\varepsilon_0"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-7c1008dca893d58855a9",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-1ccb3cbcbeee4e7c5cc6"
        ],
        "assumptions": [
          "auto-assumption-55d0383c4b86c8bcc344"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-55d0383c4b86c8bcc344",
          "auto-graph-7c1008dca893d58855a9",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-output-7f07455ff69b3b347e9b",
          "auto-parameter-1ccb3cbcbeee4e7c5cc6",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-hs22-mwm",
      "problem": "Maximum matching",
      "variant": "Weighted",
      "objective": "max",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − ε of OPT",
      "rounds": "poly(1/ε, log n)",
      "roundClass": "polylog",
      "parameters": "",
      "assumptions": "",
      "paperId": "gen-hs22",
      "theorem": "Abstract",
      "summary": "Makes the accuracy dependence polynomial.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2212.14425",
      "year": 2022,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "poly(1/ε, log n)",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "poly(1/ε, log n)",
        "tex": "\\operatorname{poly}(1/\\varepsilon,\\log n)",
        "basis": "stated",
        "explanation": "Theorem 1.1 states this deterministic CONGEST bound. Theorem 5.1 and Lemma C.7 retain polynomial costs for the augmentation subroutine and its simulation. The reviewed statements do not give numerical exponents for the complete algorithm.",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2212.14425",
            "title": "(1−ε)-Approximate Maximum Weighted Matching in Distributed, Parallel, and Semi-Streaming Settings",
            "location": "Theorem 1.1; Theorem 5.1; Lemma C.7"
          }
        ],
        "parameters": [
          {
            "symbol": "ε",
            "description": "Approximation accuracy, 0 < ε < 1",
            "tex": "\\varepsilon"
          },
          {
            "symbol": "n",
            "description": "Number of vertices",
            "tex": "n"
          }
        ],
        "checked": "2026-11-16",
        "audited": true
      },
      "sota": {
        "scopeLabel": "General · weighted matching · fully polynomial scheme",
        "setting": "Deterministic CONGEST; maximum-weight matching on general graphs; weights use the source message encoding; arbitrary 0 < ε < 1; retained weight at least (1−ε) OPT in poly(1/ε, log n) rounds.",
        "reason": "Theorem 1.1 supplies the fully polynomial CONGEST scheme for weighted matching on general graphs, replacing the earlier exponential-in-1/ε dependency. Later cardinality-only matching improvements do not dominate this weighted guarantee. The annotation does not assert optimal polynomial exponents.",
        "evidenceUrl": "https://arxiv.org/pdf/2212.14425v2#page=4",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-epsilon-unit",
          "claim-source-weight-encoding"
        ]
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy, 0 < ε < 1",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-weighted"
        ],
        "parameters": [],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-d95ef193bcfe270b3957",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-aprsu10-matching",
      "problem": "Maximum matching",
      "variant": "Unweighted",
      "objective": "max",
      "graphClass": "Bipartite",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1/(1 + ε) of OPT",
      "rounds": "O_Δ,ε(1)",
      "roundClass": "parameter",
      "parameters": "Fixed Δ and ε.",
      "assumptions": "A proper 2-colouring is given as input.",
      "paperId": "gen-aprsu10",
      "theorem": "Theorem 9",
      "summary": "Input colouring enables a deterministic local scheme.",
      "verification": "primary",
      "sourceUrl": "https://jukkasuomela.fi/doc/weakly-coloured.pdf",
      "year": 2010,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "bipartite"
      },
      "graphClassSource": "Bipartite graphs",
      "prerequisite": "Supplied proper 2-coloring",
      "approximationDisplay": "1/(1 + ε)",
      "roundsDisplay": "f(Δ, ε)",
      "roundParameters": [
        {
          "symbol": "Δ",
          "name": "max degree",
          "introduced": false,
          "displaySymbol": true
        },
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(Δ Σ_{i=1}^{K} (2i−1)(Δ−1)^{i−1}) for Δ ≥ 2, where K = ceil(1/ε); constant for Δ ≤ 1",
        "tex": "O\\!\\left(\\Delta\\sum_{i=1}^{K}(2i-1)(\\Delta-1)^{i-1}\\right)\\ (\\Delta\\ge 2),\\qquad K=\\lceil 1/\\varepsilon\\rceil",
        "basis": "derived-phase-bound",
        "explanation": "Section 6 runs stages i=1,...,K. Stage i removes augmenting paths of length h=2i−1 using at most t_i=Δ(Δ−1)^{i−1} invocations. Each invocation consists of flooding, proposals, and augmentation along paths of length h, and therefore costs O(h) rounds. Summing gives this explicit parameter dependence. The paper does not state an exact integer total. For Δ≤1, taking all edges gives an exact matching after at most one round; this avoids a 0^0 convention in the displayed sum. The supplied proper two-colouring is essential.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/weakly-coloured.pdf#page=11",
            "title": "Local algorithms in (weakly) coloured graphs",
            "location": "Section 6, augmenting-path algorithm and t_i bound immediately before Theorem 9"
          }
        ],
        "parameters": [
          {
            "symbol": "Δ",
            "description": "Maximum degree"
          },
          {
            "symbol": "ε",
            "description": "Positive accuracy parameter"
          },
          {
            "symbol": "K",
            "description": "Number of augmenting-path-length stages, ceil(1/ε)"
          },
          {
            "symbol": "i",
            "description": "Index of the augmenting-path-length stage",
            "tex": "i"
          }
        ],
        "checked": "2026-11-16",
        "audited": true,
        "expression": {
          "formula": "O(Δ Σ_{i=1}^{K} (2i−1)(Δ−1)^{i−1})",
          "tex": "O\\!\\left(\\Delta\\sum_{i=1}^{K}(2i-1)(\\Delta-1)^{i-1}\\right)"
        },
        "suffix": {
          "formula": " for Δ ≥ 2, where K = ceil(1/ε); constant for Δ ≤ 1",
          "tex": "\\ (\\Delta\\ge 2),\\qquad K=\\lceil 1/\\varepsilon\\rceil"
        }
      },
      "sota": {
        "scopeLabel": "Properly 2-colored bipartite · rounds independent of n",
        "setting": "Deterministic LOCAL; unweighted matching with a proper 2-coloring supplied as input and fixed maximum degree Δ; fixed ε>0; retained fraction 1/(1+ε) in f(Δ,ε) rounds independent of n.",
        "reason": "Theorem 9 supplies an approximation scheme in f(Δ, ε) rounds under this extra symmetry-breaking input. The limiting ratio is optimal; optimal dependence on Δ or ε is not claimed. Algorithms using log-star rounds without a supplied coloring do not dominate this guarantee independent of n.",
        "evidenceUrl": "https://jukkasuomela.fi/doc/weakly-coloured.pdf#page=12",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-epsilon-positive"
        ]
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "K",
          "description": "Number of augmenting-path-length stages, ceil(1/ε)",
          "tex": "K"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "i",
          "description": "Index of the augmenting-path-length stage",
          "tex": "i"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Positive accuracy parameter",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-7a5af0aff91f9fa9d17f",
          "weights-unweighted",
          "input-proper-two-coloring"
        ],
        "parameters": [
          "auto-parameter-69a29a48be724a8c4831"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-7a5af0aff91f9fa9d17f",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-69a29a48be724a8c4831",
          "input-proper-two-coloring",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-aprsu10-dom",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Weakly 2-colored",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(Δ + 1)/2",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "The maximum degree Δ affects the approximation ratio. The supplied weak 2-colouring permits a universal constant number of communication rounds, independently of Δ.",
      "assumptions": "A weak 2-colouring is supplied; no isolated vertices.",
      "paperId": "gen-aprsu10",
      "theorem": "Theorem 6",
      "summary": "Matches the paper’s local lower bound.",
      "verification": "primary",
      "sourceUrl": "https://jukkasuomela.fi/doc/weakly-coloured.pdf",
      "year": 2010,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "weak-colored",
        "note": "Requires a supplied weak two-coloring and no isolated vertices."
      },
      "graphClassSource": "Weakly 2-coloured graphs",
      "prerequisite": "Supplied weak 2-coloring; no isolates",
      "approximationDisplay": "(Δ + 1)/2",
      "roundsDisplay": "≤ 4",
      "roundCountEvidence": {
        "rounds": "≤ 4",
        "basis": "phase-count",
        "explanation": "The supplied weak two-colouring permits the Section 4 star-forest construction in an absolute constant number of rounds. The four-round schedule below computes exactly its final star centres without communicating the final edge orientations. Every black vertex with white children becomes a centre. An original white root remains a centre exactly when at least one of its black children has no white children. A white vertex that proposed to a black vertex is a leaf. In the all-depth-two case a root chooses one child for edge reversal, but the choice does not affect the set of centres, so the dominating-set output needs no extra round. This is an implementation upper bound derived from the paper, not a printed exact runtime or a claim of round optimality. Δ occurs in the approximation guarantee, not in the communication radius. The catalogue’s f(Δ) classification can be strengthened to constant. Schedule: (1) exchange weak-colouring bits; (2) black vertices propose to white parents; (3) white vertices without black children propose to black parents; (4) black vertices report whether they acquired white children. The selected set is the final star centres.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/weakly-coloured.pdf#page=8",
            "title": "Local algorithms in (weakly) coloured graphs",
            "location": "Section 4 star-forest construction and Theorem 6"
          }
        ],
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "≤ 4",
        "tex": "\\le 4",
        "basis": "derived-phase-bound",
        "explanation": "The supplied weak two-colouring permits the Section 4 star-forest construction in an absolute constant number of rounds. The four-round schedule below computes exactly its final star centres without communicating the final edge orientations. Every black vertex with white children becomes a centre. An original white root remains a centre exactly when at least one of its black children has no white children. A white vertex that proposed to a black vertex is a leaf. In the all-depth-two case a root chooses one child for edge reversal, but the choice does not affect the set of centres, so the dominating-set output needs no extra round. This is an implementation upper bound derived from the paper, not a printed exact runtime or a claim of round optimality. Δ occurs in the approximation guarantee, not in the communication radius. The catalogue’s f(Δ) classification can be strengthened to constant.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/weakly-coloured.pdf#page=8",
            "title": "Local algorithms in (weakly) coloured graphs",
            "location": "Section 4 star-forest construction and Theorem 6"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-009b17c9926b5eac5d12",
          "weights-unweighted",
          "input-weak-coloring-no-isolates"
        ],
        "parameters": [
          "auto-parameter-04655930e34a98fa6fb5"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-009b17c9926b5eac5d12",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-04655930e34a98fa6fb5",
          "input-isolate-free",
          "input-weak-coloring-no-isolates",
          "input-weak-two-coloring",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-ghs12-eds",
      "problem": "Edge dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Maximum degree ≤ Δ",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "approximation": "No ratio < 4 − 1/⌊Δ/2⌋",
      "rounds": "O(1)-round impossibility",
      "roundClass": "parameter",
      "parameters": "Fixed Δ ≥ 2.",
      "assumptions": "Deterministic LOCAL algorithms, even with unique identifiers.",
      "paperId": "gen-ghs12",
      "theorem": "Abstract; application to edge domination",
      "summary": "Transfers anonymous-network hardness to the identifier model.",
      "verification": "primary",
      "sourceUrl": "https://jukkasuomela.fi/doc/linear-order.pdf",
      "year": 2012,
      "problemScope": {
        "node": "edge-dominating-set"
      },
      "graphScope": {
        "node": "degree"
      },
      "graphClassSource": "Graphs of maximum degree Δ",
      "approximationDisplay": "≥ 4 − 1/⌊Δ/2⌋",
      "roundsDisplay": "f(Δ) rounds ruled out",
      "roundParameters": [
        {
          "symbol": "Δ",
          "name": "max degree",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundBudgetExcluded": true,
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "impossibility",
        "formula": "Any T(Δ) independent of n",
        "tex": "\\text{Any }T\\bigl(\\Delta\\bigr)\\text{ independent of }n",
        "basis": "quantified-impossibility",
        "explanation": "This excludes every round complexity depending only on the listed fixed parameters, independently of n. It is a lower-bound budget, not the running time of an algorithm.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/linear-order.pdf",
            "title": "Lower Bounds for Local Approximation",
            "location": "Abstract; application to edge domination"
          }
        ],
        "parameters": [
          {
            "symbol": "T",
            "description": "An arbitrary number of communication rounds depending only on the listed fixed parameters",
            "tex": "T"
          }
        ],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "Bounded degree · deterministic local lower bound",
        "setting": "Deterministic LOCAL; unweighted edge dominating set on graphs of maximum degree Δ≥2; for any round complexity depending only on Δ, approximation factors below 4−1/floor(Δ/2) are impossible.",
        "reason": "Theorem 1.6 explicitly proves that the same factor is achievable by a deterministic local algorithm whose round complexity may depend on Δ. The lower bound remains valid with unique identifiers. This certifies the coefficient for algorithms with rounds independent of n, not optimal dependence on Δ.",
        "evidenceUrl": "https://jukkasuomela.fi/doc/linear-order.pdf#page=6",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "edge-domination-factor",
          "resultId": "gen-ghs12-eds",
          "graphs": [
            "degree"
          ],
          "problems": [
            "edge-dominating-set"
          ],
          "models": [
            "LOCAL"
          ],
          "conditionIds": []
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "T",
          "description": "An arbitrary number of communication rounds depending only on the listed fixed parameters",
          "tex": "T"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication network",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-deab2387db4ebc51b8c0",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-f3f7c0d2ab5ad9ffd286"
        ],
        "assumptions": [
          "auto-assumption-eeb9411327e683e6b996"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-eeb9411327e683e6b996",
          "auto-graph-deab2387db4ebc51b8c0",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c9185b7551a9732c9cf5",
          "auto-parameter-f3f7c0d2ab5ad9ffd286",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-w25-dom",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Triangle-free planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "6",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "",
      "assumptions": "",
      "paperId": "gen-w25",
      "theorem": "Abstract",
      "summary": "A local construction based on bunches.",
      "verification": "primary",
      "sourceUrl": "https://www.mdpi.com/1999-4893/18/5/280",
      "year": 2025,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "triangle-planar"
      },
      "graphClassSource": "Triangle-free planar graphs",
      "approximationDisplay": "6",
      "roundsDisplay": "≤ 7",
      "roundCountEvidence": {
        "basis": "phase-count",
        "explanation": "The paper gives two phases without a total round count. A conservative implementation floods identifiers and neighbor lists for six rounds, then uses one round to notify selected neighbors. The first six rounds reveal degrees through distance five, sufficient to reconstruct the first selection and uncovered vertices within distance two. Every replacement candidate covers the selecting vertex, so it lies in its closed neighborhood. This is an implementation upper bound, not a source-stated or optimal count.",
        "evidence": [
          {
            "url": "https://mdpi-res.com/d_attachment/algorithms/algorithms-18-00280/article_deploy/algorithms-18-00280.pdf#page=9",
            "title": "Wawrzyniak, local six-approximation on triangle-free planar graphs",
            "location": "Section 3, pseudocode, PDF pp. 9–10"
          }
        ],
        "rounds": "≤ 7",
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "≤ 7",
        "tex": "\\le 7",
        "basis": "phase-count",
        "explanation": "The paper gives two phases without a total round count. A conservative implementation floods identifiers and neighbor lists for six rounds, then uses one round to notify selected neighbors. The first six rounds reveal degrees through distance five, sufficient to reconstruct the first selection and uncovered vertices within distance two. Every replacement candidate covers the selecting vertex, so it lies in its closed neighborhood. This is an implementation upper bound, not a source-stated or optimal count.",
        "evidence": [
          {
            "url": "https://mdpi-res.com/d_attachment/algorithms/algorithms-18-00280/article_deploy/algorithms-18-00280.pdf#page=9",
            "title": "Wawrzyniak, local six-approximation on triangle-free planar graphs",
            "location": "Section 3, pseudocode, PDF pp. 9–10"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [],
      "setting": {
        "summary": [
          "auto-graph-17b28995226fcbf3e00f",
          "weights-unweighted"
        ],
        "parameters": [],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-17b28995226fcbf3e00f",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-bdgpsw26-dom",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Euler genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "34 + ε",
      "rounds": "f(g, ε)",
      "roundClass": "parameter",
      "parameters": "Fixed Euler genus g and ε.",
      "assumptions": "Uses the planar 11+ε source approximation.",
      "paperId": "gen-bdgpsw26",
      "theorem": "Abstract",
      "summary": "A transfer theorem gives factor 3α+1 from a planar α-approximation.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2605.19157",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "euler",
        "note": "Retain any connectivity condition stated by the source."
      },
      "graphClassSource": "Bounded Euler genus",
      "approximationDisplay": "34 + ε",
      "roundsDisplay": "f(g, ε)",
      "roundParameters": [
        {
          "symbol": "g",
          "name": "Euler genus",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "partial",
        "formula": "T + δ + 2, where T = F(2u+2ρ) + max{u+ρ, b}",
        "tex": "T+\\delta+2,\\qquad T=F(2u+2\\rho)+\\max\\{u+\\rho,b\\}",
        "basis": "stated-composition",
        "explanation": "Corollary 4.3 states a parameter-dependent constant C(ε,g). Meta-Theorem I gives a transparent composition of the base algorithm, a dimensional control function, and an error-component diameter bound, but this does not compute a closed function of g and ε. In particular the runtime of the planar (11+ε)-approximation and the control-function constants are not expanded here.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
            "title": "Meta-Theorems for Cuttable Distributed Problems",
            "location": "Theorem 4.2 (Meta-Theorem I); Corollary 4.3; proof of Meta-Theorem I"
          }
        ],
        "parameters": [
          {
            "symbol": "T",
            "description": "Intermediate algorithm radius from the displayed composition",
            "tex": "T"
          },
          {
            "symbol": "δ",
            "description": "Upper bound on weak diameters of the local error components",
            "tex": "\\delta"
          },
          {
            "symbol": "F",
            "description": "Dimensional control function of the target graph class",
            "tex": "F"
          },
          {
            "symbol": "u",
            "description": "Uniformity radius of the base algorithm",
            "tex": "u"
          },
          {
            "symbol": "b",
            "description": "Round complexity of the base algorithm",
            "tex": "b"
          },
          {
            "symbol": "ρ",
            "description": "Verification radius of the distributed problem",
            "tex": "\\rho"
          }
        ],
        "checked": "2026-11-16",
        "audited": true,
        "expression": {
          "formula": "T + δ + 2",
          "tex": "T+\\delta+2"
        },
        "suffix": {
          "formula": ", where T = F(2u+2ρ) + max{u+ρ, b}",
          "tex": ",\\qquad T=F(2u+2\\rho)+\\max\\{u+\\rho,b\\}"
        }
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "F",
          "description": "Dimensional control function of the target graph class",
          "tex": "F"
        },
        {
          "symbol": "T",
          "description": "Intermediate algorithm radius from the displayed composition",
          "tex": "T"
        },
        {
          "symbol": "b",
          "description": "Round complexity of the base algorithm",
          "tex": "b"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound",
          "tex": "g"
        },
        {
          "symbol": "u",
          "description": "Uniformity radius of the base algorithm",
          "tex": "u"
        },
        {
          "symbol": "δ",
          "description": "Upper bound on weak diameters of the local error components",
          "tex": "\\delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        },
        {
          "symbol": "ρ",
          "description": "Verification radius of the distributed problem",
          "tex": "\\rho"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-4688deea0bc7a8a63f32",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-42f1cba507ba2c8efe56"
        ],
        "assumptions": [
          "auto-assumption-47f8c499fa139c946a3b"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-47f8c499fa139c946a3b",
          "auto-graph-4688deea0bc7a8a63f32",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-42f1cba507ba2c8efe56",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-af26-dom",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Bounded arboricity",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "O(α log Δ / log log Δ)",
      "rounds": "O(log Δ / log log Δ)",
      "roundClass": "degree",
      "parameters": "α is arboricity; logs truncated at constants.",
      "assumptions": "Δ known; α need not be known; one-bit messages suffice.",
      "paperId": "gen-af26",
      "theorem": "Abstract",
      "summary": "A degree-dependent approximation with very small messages.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2606.15411",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "density",
        "note": "Use compatible fixed arboricity bounds; planar inputs permit an arboricity bound of 3."
      },
      "prerequisite": "Known Δ",
      "approximationDisplay": "O(α log Δ / log log Δ)",
      "roundsDisplay": "O(log Δ / log log Δ)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log Δ / log log Δ)",
        "tex": "O\\!\\left(\\frac{\\log\\Delta}{\\log\\log\\Delta}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2606.15411",
            "title": "Distributed Dominating Set With Optimal Rounds and Message Size in Bounded Arboricity Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "arboricity-domination-rounds",
          "resultId": "gen-af26-dom",
          "graphs": [
            "density",
            "arboricity-two"
          ],
          "problems": [
            "dominating-set"
          ],
          "models": [
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": [
            "parameter-fixed-alpha-ge2"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "α",
          "description": "Arboricity bound of the input graph",
          "tex": "\\alpha"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a31601ba12c5c7bcb524",
          "weights-unweighted",
          "input-known-degree"
        ],
        "parameters": [
          "auto-parameter-6c812971e246ce525770"
        ],
        "assumptions": [],
        "detail": [
          "strength-no-alpha-knowledge",
          "strength-one-bit"
        ],
        "covered": [
          "auto-graph-a31601ba12c5c7bcb524",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-6c812971e246ce525770",
          "input-known-degree",
          "strength-no-alpha-knowledge",
          "strength-one-bit",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-w26-planar-dom",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "8 + ε",
      "rounds": "O_ε(1)",
      "roundClass": "parameter",
      "parameters": "Fixed ε > 0.",
      "assumptions": "Neither embedding nor n is required.",
      "paperId": "gen-w26-planar",
      "theorem": "Abstract",
      "summary": "An improved analysis of the three-phase domination framework.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2609.32736",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "graphClassSource": "Planar graphs",
      "approximationDisplay": "8 + ε",
      "roundsDisplay": "f(ε)",
      "roundParameters": [
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(ε)",
        "tex": "f\\bigl(\\varepsilon\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2609.32736",
            "title": "Near-Optimal Distributed Domination in Planar Graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierComparisons": [
        {
          "better": "gen-asw26-planar",
          "worse": "gen-w26-planar-dom",
          "strict": [
            "approximation"
          ],
          "conditions": {
            "problem": "Both solve unweighted minimum dominating set and output an integral vertex set.",
            "graphClass": "Both guarantees hold on all planar graphs; no graph-class strengthening is inferred.",
            "approximation": "The exact coefficient 7 is strictly smaller than 8 + ε for every ε > 0.",
            "rounds": "The newer round complexity is a universal constant, independent of ε. The older bound is f(ε), with its accuracy dependence retained. At the advertised asymptotic level the universal O(1) bound has no accuracy-dependent overhead. This does not compare unknown numerical round counts or identify f(ε) with a universal constant.",
            "model": "The newer algorithm uses broadcast CONGEST and therefore also works in LOCAL; message restrictions are stronger, not an extra graph or input requirement.",
            "randomness": "Both algorithms are deterministic.",
            "benchmark": "The newer integral output is bounded against fractional OPT, which is at most integral OPT; it therefore also satisfies the older integral-OPT convention.",
            "assumptions": "Use the standard unique O(log n)-bit identifier convention. Neither statement requires an embedding, a maximum-degree bound, or an externally supplied solution. This certificate does not apply to variants with a different initial-information convention."
          },
          "evidenceUrl": "https://arxiv.org/pdf/2611.02057",
          "reason": "Exact factor 7 replaces the 8 + ε planar guarantee using a universal constant round complexity, while the earlier round complexity depends on ε. The source introduction traces the constant-factor improvements; Theorem C(i) gives the new guarantee."
        }
      ],
      "dominatedBy": [
        "gen-asw26-planar"
      ],
      "frontierStatus": "dominated",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-a0a8e2790290a7471d70"
        ],
        "assumptions": [
          "auto-assumption-94e308d1e07eba7fa96c"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-94e308d1e07eba7fa96c",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-a0a8e2790290a7471d70",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-as26-planar",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "7 + ε",
      "rounds": "O_ε(1)",
      "roundClass": "parameter",
      "parameters": "Fixed ε > 0.",
      "assumptions": "Guarantee also holds against fractional OPT.",
      "paperId": "gen-as26",
      "theorem": "Abstract",
      "summary": "Planar specialization.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2610.09618",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "graphClassSource": "Planar graphs",
      "approximationDisplay": "7 + ε",
      "roundsDisplay": "f(ε)",
      "roundParameters": [
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(ε)",
        "tex": "f\\bigl(\\varepsilon\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2610.09618",
            "title": "Almost Optimal Constant-Round Approximation of Dominating Set in Graph Classes with Excluded Minors",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierComparisons": [
        {
          "better": "gen-asw26-planar",
          "worse": "gen-as26-planar",
          "strict": [
            "approximation"
          ],
          "conditions": {
            "problem": "Both solve unweighted minimum dominating set and output an integral vertex set.",
            "graphClass": "Both guarantees hold on all planar graphs; no graph-class strengthening is inferred.",
            "approximation": "The exact coefficient 7 is strictly smaller than 7 + ε for every ε > 0.",
            "rounds": "The newer round complexity is a universal constant, independent of ε. The older bound is f(ε), with its accuracy dependence retained. At the advertised asymptotic level the universal O(1) bound has no accuracy-dependent overhead. This does not compare unknown numerical round counts or identify f(ε) with a universal constant.",
            "model": "The newer algorithm uses broadcast CONGEST and therefore also works in LOCAL; message restrictions are stronger, not an extra graph or input requirement.",
            "randomness": "Both algorithms are deterministic.",
            "benchmark": "Both guarantees apply against fractional OPT.",
            "assumptions": "Use the standard unique O(log n)-bit identifier convention. Neither statement requires an embedding, a maximum-degree bound, or an externally supplied solution. This certificate does not apply to variants with a different initial-information convention."
          },
          "evidenceUrl": "https://arxiv.org/pdf/2611.02057",
          "reason": "Exact factor 7 replaces the 7 + ε planar guarantee using a universal constant round complexity, while the earlier round complexity depends on ε. The source introduction traces the constant-factor improvements; Theorem C(i) gives the new guarantee."
        }
      ],
      "dominatedBy": [
        "gen-asw26-planar"
      ],
      "frontierStatus": "dominated",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-a0a8e2790290a7471d70"
        ],
        "assumptions": [
          "auto-assumption-6dc0e590599c2c5a678a"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-6dc0e590599c2c5a678a",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-a0a8e2790290a7471d70",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-as26-minor",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Proper minor-closed classes",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "2a(𝒞) + 1 + ε",
      "rounds": "O_𝒞,ε(1)",
      "roundClass": "parameter",
      "parameters": "Fixed class 𝒞 and ε; a(𝒞) = sup |E|/|V|.",
      "assumptions": "Measured against fractional OPT.",
      "paperId": "gen-as26",
      "theorem": "Abstract",
      "summary": "A class-density bound.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2610.09618",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "2a(𝒞) + 1 + ε",
      "roundsDisplay": "f(𝒞, ε)",
      "roundParameters": [
        {
          "symbol": "𝒞",
          "name": "graph class",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(𝒞, ε)",
        "tex": "f\\bigl(\\mathcal{C},\\varepsilon\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2610.09618",
            "title": "Almost Optimal Constant-Round Approximation of Dominating Set in Graph Classes with Excluded Minors",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "a(𝒞)",
          "description": "Supremum of the edge-to-vertex ratio over graphs in the fixed minor-closed class 𝒞",
          "tex": "a(\\mathcal{C})"
        },
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "a",
          "description": "Edge-density bound of the fixed minor-closed graph class",
          "tex": "a"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        },
        {
          "symbol": "𝒞",
          "description": "Fixed input graph class",
          "tex": "\\mathcal{C}"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-3ffeda864faf117fac90",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-7f6191bd7030ad15d9fa"
        ],
        "assumptions": [
          "auto-assumption-933e122436b6c52ef189"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-933e122436b6c52ef189",
          "auto-graph-3ffeda864faf117fac90",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-7f6191bd7030ad15d9fa",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-as26-random",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Proper minor-closed classes",
      "model": "LOCAL",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "1 + ε in expectation",
      "rounds": "O_𝒞,ε(1)",
      "roundClass": "parameter",
      "parameters": "Fixed class 𝒞 and ε.",
      "assumptions": "Always feasible; expected size ≤ (1+ε)OPT.",
      "paperId": "gen-as26",
      "theorem": "Abstract",
      "summary": "An expectation guarantee, not a high-probability ratio.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2610.09618",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "1 + ε in expectation",
      "roundsDisplay": "f(𝒞, ε)",
      "roundParameters": [
        {
          "symbol": "𝒞",
          "name": "graph class",
          "introduced": false,
          "displaySymbol": true
        },
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(𝒞, ε)",
        "tex": "f\\bigl(\\mathcal{C},\\varepsilon\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2610.09618",
            "title": "Almost Optimal Constant-Round Approximation of Dominating Set in Graph Classes with Excluded Minors",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        },
        {
          "symbol": "𝒞",
          "description": "Fixed input graph class",
          "tex": "\\mathcal{C}"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-3ffeda864faf117fac90",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-9fc82b38708ec49e4023"
        ],
        "assumptions": [
          "auto-assumption-d6b18710736c4110b2b5"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-d6b18710736c4110b2b5",
          "auto-graph-3ffeda864faf117fac90",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-9fc82b38708ec49e4023",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-as26-power-lower",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "r-th powers of paths",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "approximation": "No ratio < 2r + 1",
      "rounds": "O(1)-round impossibility",
      "roundClass": "parameter",
      "parameters": "Fixed integer r ≥ 1; ε > 0 is a gap below 2r + 1. The excluded round complexity may depend on r and ε, but not on n.",
      "assumptions": "Deterministic; n may be known.",
      "paperId": "gen-as26",
      "theorem": "Theorem 8.7 (arXiv v2)",
      "summary": "Pure path powers suffice. Related lower bounds in Picavet’s thesis use endpoint leaves or excluded-minor pathwidth.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2610.09618v2#S8.SS4",
      "year": 2026,
      "relatedResults": [
        "pic-thesis-pathpower-lower",
        "pic-thesis-pathwidth-lower"
      ],
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "path-powers"
      },
      "approximationDisplay": "≥ 2r + 1",
      "roundsDisplay": "f(r, ε) rounds ruled out",
      "roundParameters": [
        {
          "symbol": "r",
          "name": "power radius",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": false,
          "displaySymbol": true
        }
      ],
      "roundBudgetExcluded": true,
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "impossibility",
        "formula": "Any T(r, ε) independent of n",
        "tex": "\\text{Any }T\\bigl(r,\\varepsilon\\bigr)\\text{ independent of }n",
        "basis": "quantified-impossibility",
        "explanation": "This excludes every round complexity depending only on the listed fixed parameters, independently of n. It is a lower-bound budget, not the running time of an algorithm.",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2610.09618v2#S8.SS4",
            "title": "Almost Optimal Constant-Round Approximation of Dominating Set in Graph Classes with Excluded Minors",
            "location": "Theorem 8.7 (arXiv v2)"
          }
        ],
        "parameters": [
          {
            "symbol": "T",
            "description": "An arbitrary number of communication rounds depending only on the listed fixed parameters",
            "tex": "T"
          }
        ],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "minor-density-factor",
          "resultId": "gen-as26-power-lower",
          "graphs": [
            "path-powers",
            "treewidth",
            "pathwidth"
          ],
          "problems": [
            "dominating-set"
          ],
          "models": [
            "LOCAL",
            "CONGEST"
          ],
          "conditionIds": [
            "parameter-r-integer-ge1"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "T",
          "description": "An arbitrary number of communication rounds depending only on the listed fixed parameters",
          "tex": "T"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Power of the underlying path: vertices at distance at most this value are adjacent",
          "tex": "r"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-5576afcd0ec58ee432cc",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-ea0947e1a900f9702605"
        ],
        "assumptions": [
          "auto-assumption-edb8aa2a8c4052a49812"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-edb8aa2a8c4052a49812",
          "auto-graph-5576afcd0ec58ee432cc",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-ea0947e1a900f9702605",
          "parameter-r-integer-ge1",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-w26-2dom",
      "problem": "2-domination (outside the solution)",
      "variant": "2-tuple domination",
      "objective": "min",
      "graphClass": "Euler genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "6 + η",
      "rounds": "O_g,η(1)",
      "roundClass": "parameter",
      "parameters": "Fixed Euler genus g and ε > 0.",
      "assumptions": "",
      "paperId": "gen-w26-transfer",
      "theorem": "Abstract",
      "summary": "Transfers the planar two-domination algorithm.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2610.15596",
      "year": 2026,
      "problemScope": {
        "node": "outside-k-domination"
      },
      "problemParameter": "2",
      "problemParameterName": "required neighbors outside the solution",
      "problemSource": "k-tuple dominating set",
      "graphScope": {
        "node": "euler",
        "note": "Retain any connectivity condition stated by the source."
      },
      "graphClassSource": "Bounded Euler genus",
      "notationChanges": [
        {
          "name": "approximation slack",
          "sourceSymbol": "η",
          "symbol": "ε"
        }
      ],
      "parametersSource": "Fixed Euler genus g and η > 0.",
      "approximationDisplay": "6 + ε",
      "roundsDisplay": "f(g, ε)",
      "roundParameters": [
        {
          "symbol": "g",
          "name": "Euler genus",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "ε",
          "name": "approximation slack",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(g, ε)",
        "tex": "f\\bigl(g,\\varepsilon\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2610.15596",
            "title": "Almost Lossless Transfer for Cuttable Distributed Problems",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "Euler genus ≤ g; fixed ε > 0",
        "setting": "Unweighted outside-2 domination on graphs of Euler genus at most g; deterministic LOCAL in f(g, ε) rounds with arbitrary distinct numerical identifiers; integral OPT; ε > 0.",
        "reason": "The almost-lossless transfer gives 6+ε on every fixed Euler-genus class, improving the previous coefficient 19. Its round complexity depends on g and ε. The exact planar coefficient 6 applies to a smaller class and does not dominate it. This is a checked best-known tradeoff; optimal parameter dependence, a matching lower bound and an exact factor-6 algorithm are not claimed.",
        "evidenceUrl": "https://arxiv.org/html/2610.15596v1#S8",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "2",
          "description": "Required neighbors outside the solution",
          "tex": "2"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound",
          "tex": "g"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-4688deea0bc7a8a63f32",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-0e4fbe5bde0b980e2436"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-4688deea0bc7a8a63f32",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-ef1b974b591df8f63ec3",
          "auto-parameter-0e4fbe5bde0b980e2436",
          "output-outside-k",
          "output-outside-two",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-w26-clique-dom",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar with a clique attached at one vertex",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "7 + ε",
      "rounds": "O_ε(1)",
      "roundClass": "parameter",
      "parameters": "Fixed ε > 0; clique size unbounded.",
      "assumptions": "Distinct IDs; n need not be known.",
      "paperId": "gen-w26-transfer",
      "theorem": "Abstract",
      "summary": "The target class can have unbounded genus.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2610.15596",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "planar-clique"
      },
      "graphClassSource": "Planar graph with a clique attached at one vertex",
      "approximationDisplay": "7 + ε",
      "roundsDisplay": "f(ε)",
      "roundParameters": [
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(ε)",
        "tex": "f\\bigl(\\varepsilon\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2610.15596",
            "title": "Almost Lossless Transfer for Cuttable Distributed Problems",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-88416e0fa2d902c6bf6e",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-fd0c7f39daee55d44146"
        ],
        "assumptions": [
          "auto-assumption-898f68dddc2253ec17f8"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-898f68dddc2253ec17f8",
          "auto-graph-88416e0fa2d902c6bf6e",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-fd0c7f39daee55d44146",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-p26-density",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Bounded maximum average degree and depth-one density",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "d + 1 + ε",
      "rounds": "O_d,∇₁,ε(1)",
      "roundClass": "parameter",
      "parameters": "Fixed mad bound d, shallow-minor density ∇₁, ε.",
      "assumptions": "",
      "paperId": "gen-p26",
      "theorem": "Abstract",
      "summary": "Extends beyond minor-closed classes.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2610.31203",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "depth-one"
      },
      "approximationDisplay": "d + 1 + ε",
      "roundsDisplay": "f(d, ∇₁, ε)",
      "roundParameters": [
        {
          "symbol": "d",
          "name": "max average degree",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "∇₁",
          "name": "depth-one density",
          "introduced": false,
          "displaySymbol": true
        },
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(d, ∇₁, ε)",
        "tex": "f\\bigl(d,\\nabla_1,\\varepsilon\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2610.31203",
            "title": "Almost tight distributed approximation for domination in sparse graph classes",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "Even integer d ≥ 2",
        "setting": "Unweighted MDS; deterministic LOCAL in f(d, depth-one density, ε) rounds; maximum-average-degree bound d and a fixed depth-one density bound; integral OPT; ε > 0. Optimal-coefficient certification is restricted to even integer d ≥ 2.",
        "reason": "Corollary 1.1 gives d+1+ε on the broader bounded-depth-one-density setting, with polynomial dependence on accuracy and polynomial local computation for fixed parameters. Section 3.9 supplies a matching d+1 limiting lower bound for even integer d. This certifies the limiting coefficient, not optimal dependence on every parameter, an exact d+1 algorithm or a fractional benchmark.",
        "evidenceUrl": "https://arxiv.org/pdf/2610.31203#page=21",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-d-even-ge2"
        ]
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Upper bound on depth-one minor density",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "d",
          "description": "Maximum average degree bound of the input graph",
          "tex": "d"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-c176f5851daf0691e2c9",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-e60de88c7059235a0d25"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-c176f5851daf0691e2c9",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-e60de88c7059235a0d25",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-p26-genus",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Euler genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "7 + ε",
      "rounds": "O_g,ε(1)",
      "roundClass": "parameter",
      "parameters": "Fixed Euler genus g and ε > 0.",
      "assumptions": "",
      "paperId": "gen-p26",
      "theorem": "Abstract",
      "summary": "Includes planar graphs.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2610.31203",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "euler",
        "note": "Retain any connectivity condition stated by the source."
      },
      "graphClassSource": "Bounded Euler genus",
      "approximationDisplay": "7 + ε",
      "roundsDisplay": "f(g, ε)",
      "roundParameters": [
        {
          "symbol": "g",
          "name": "Euler genus",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(g, ε)",
        "tex": "f\\bigl(g,\\varepsilon\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2610.31203",
            "title": "Almost tight distributed approximation for domination in sparse graph classes",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound",
          "tex": "g"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-4688deea0bc7a8a63f32",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-0e4fbe5bde0b980e2436"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-4688deea0bc7a8a63f32",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-0e4fbe5bde0b980e2436",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-p26-trianglefree",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Triangle-free; Euler genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "5 + ε",
      "rounds": "O_g,ε(1)",
      "roundClass": "parameter",
      "parameters": "Fixed Euler genus g and ε > 0.",
      "assumptions": "",
      "paperId": "gen-p26",
      "theorem": "Abstract",
      "summary": "Includes triangle-free planar graphs.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2610.31203",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "triangle-genus"
      },
      "graphClassSource": "Triangle-free bounded Euler genus",
      "approximationDisplay": "5 + ε",
      "roundsDisplay": "f(g, ε)",
      "roundParameters": [
        {
          "symbol": "g",
          "name": "Euler genus",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(g, ε)",
        "tex": "f\\bigl(g,\\varepsilon\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2610.31203",
            "title": "Almost tight distributed approximation for domination in sparse graph classes",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound",
          "tex": "g"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-4cb0180200cc86776426",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-0e4fbe5bde0b980e2436"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-4cb0180200cc86776426",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-0e4fbe5bde0b980e2436",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-asw26-planar",
      "problem": "Dominating set",
      "variant": "Unweighted; fractional benchmark",
      "objective": "min",
      "graphClass": "Planar",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "7 against fractional OPT",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "",
      "assumptions": "Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs.",
      "paperId": "gen-asw26",
      "theorem": "Theorem C(i); Corollary 1.1",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "7",
      "roundsDisplay": "Constant",
      "approximationBenchmark": "fractional",
      "roundCountEvidence": {
        "basis": "not-specified",
        "explanation": "Theorem C and Corollary 1.1 give universal constant-round algorithms for these fixed graph classes. Section 6.5, Theorem 6.13, bounds the fractional algorithm by fixed parameters, but gives no end-to-end numerical total. The partition in Lemma 6.9 also uses parameter-dependent constants without numerical instantiation. The three broadcasts after the fractional stage in Section 5.4 are only the final stage, not the total round count.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=24",
            "title": "Amiri–Siebertz–Wawrzyniak, implementation",
            "location": "Section 5.4, final implementation paragraph"
          },
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=35",
            "title": "Partition and fractional algorithm",
            "location": "Lemma 6.9 and Theorem 6.13, PDF pp. 35 and 40"
          }
        ],
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "Constant",
        "tex": "\\text{Constant}",
        "basis": "not-specified",
        "explanation": "Theorem C and Corollary 1.1 give universal constant-round algorithms for these fixed graph classes. Section 6.5, Theorem 6.13, bounds the fractional algorithm by fixed parameters, but gives no end-to-end numerical total. The partition in Lemma 6.9 also uses parameter-dependent constants without numerical instantiation. The three broadcasts after the fractional stage in Section 5.4 are only the final stage, not the total round count.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=24",
            "title": "Amiri–Siebertz–Wawrzyniak, implementation",
            "location": "Section 5.4, final implementation paragraph"
          },
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=35",
            "title": "Partition and fractional algorithm",
            "location": "Lemma 6.9 and Theorem 6.13, PDF pp. 35 and 40"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Deterministic constant-round broadcast CONGEST; unweighted planar dominating set; integral output measured against fractional OPT.",
        "reason": "Theorem C and Corollary 1.1 give exact factor 7, matching a LOCAL lower bound even against integral OPT. Thus the coefficient is optimal in this setting.",
        "evidenceUrl": "https://arxiv.org/pdf/2611.02057",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierComparisons": [
        {
          "better": "gen-asw26-minordensity",
          "worse": "gen-asw26-planar",
          "strict": [
            "graphClass"
          ],
          "parameterSubstitution": "a=3",
          "comparisonGraphClass": {
            "node": "minor",
            "label": "Every minor H has |E(H)| ≤ 3|V(H)|"
          },
          "conditions": {
            "problem": "Both return an integral unweighted dominating set.",
            "graphClass": "Every planar graph satisfies minor density at most 3. This class strictly contains the planar graphs: K5 also satisfies the bound for all its minors.",
            "approximation": "At a=3, the general coefficient 2a+1 equals the planar coefficient 7.",
            "rounds": "Sections 5.4 and 7.2 use the same protocol at a=3: degree-six defects, the same initial set F and candidate costs, algorithm parameters ρ=3, maximum candidate cost 7 and accuracy ε=1/294, followed by the same W, R and H broadcasts. The general instance adds no rounds or parameter overhead to the planar construction.",
            "model": "Both use broadcast CONGEST with O(log n)-bit messages.",
            "randomness": "Both algorithms are deterministic.",
            "benchmark": "Both integral outputs are bounded against the same fractional dominating-set optimum.",
            "assumptions": "Both use distinct O(log n)-bit identifiers and need no embedding, orientation, initial cover, degree bound or knowledge of n. The fixed substitution a=3 is hard-coded and valid for every planar input."
          },
          "evidenceUrl": "https://arxiv.org/pdf/2611.02057#page=50",
          "reason": "The planar factor-seven algorithm is the a=3 instance of the integer-density construction, with identical algorithm accuracy and broadcasts. The same guarantee and round complexity therefore hold on a strictly larger graph class."
        }
      ],
      "dominatedBy": [
        "gen-asw26-minordensity"
      ],
      "frontierStatus": "dominated",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "tightness": [
        {
          "certificateId": "planar-factor-seven",
          "resultId": "gen-asw26-planar",
          "graphs": [
            "planar"
          ],
          "problems": [
            "dominating-set"
          ],
          "models": [
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": []
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted",
          "model-broadcast-congest"
        ],
        "parameters": [],
        "assumptions": [
          "input-logarithmic-ids"
        ],
        "detail": [],
        "covered": [
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-b321139eea50286d2951",
          "detail-fractional-benchmark",
          "input-distinct-ids",
          "input-logarithmic-ids",
          "model-broadcast-congest",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-asw26-trianglefree",
      "problem": "Dominating set",
      "variant": "Unweighted; fractional benchmark",
      "objective": "min",
      "graphClass": "Triangle-free planar",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "5 against fractional OPT",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "",
      "assumptions": "Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs.",
      "paperId": "gen-asw26",
      "theorem": "Theorem C(iii); Corollary 1.1",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "triangle-planar"
      },
      "approximationDisplay": "5",
      "roundsDisplay": "Constant",
      "approximationBenchmark": "fractional",
      "roundCountEvidence": {
        "basis": "not-specified",
        "explanation": "Theorem C and Corollary 1.1 give universal constant-round algorithms for these fixed graph classes. Section 6.5, Theorem 6.13, bounds the fractional algorithm by fixed parameters, but gives no end-to-end numerical total. The partition in Lemma 6.9 also uses parameter-dependent constants without numerical instantiation. The three broadcasts after the fractional stage in Section 5.4 are only the final stage, not the total round count.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=24",
            "title": "Amiri–Siebertz–Wawrzyniak, implementation",
            "location": "Section 5.4, final implementation paragraph"
          },
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=35",
            "title": "Partition and fractional algorithm",
            "location": "Lemma 6.9 and Theorem 6.13, PDF pp. 35 and 40"
          }
        ],
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "Constant",
        "tex": "\\text{Constant}",
        "basis": "not-specified",
        "explanation": "Theorem C and Corollary 1.1 give universal constant-round algorithms for these fixed graph classes. Section 6.5, Theorem 6.13, bounds the fractional algorithm by fixed parameters, but gives no end-to-end numerical total. The partition in Lemma 6.9 also uses parameter-dependent constants without numerical instantiation. The three broadcasts after the fractional stage in Section 5.4 are only the final stage, not the total round count.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=24",
            "title": "Amiri–Siebertz–Wawrzyniak, implementation",
            "location": "Section 5.4, final implementation paragraph"
          },
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=35",
            "title": "Partition and fractional algorithm",
            "location": "Lemma 6.9 and Theorem 6.13, PDF pp. 35 and 40"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Deterministic constant-round broadcast CONGEST; unweighted triangle-free planar dominating set; integral output measured against fractional OPT.",
        "reason": "Theorem C and Corollary 1.1 give exact factor 5 with a matching deterministic LOCAL lower bound. This is an optimal coefficient.",
        "evidenceUrl": "https://arxiv.org/pdf/2611.02057",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "tightness": [
        {
          "certificateId": "trianglefree-planar-factor-five",
          "resultId": "gen-asw26-trianglefree",
          "graphs": [
            "triangle-planar"
          ],
          "problems": [
            "dominating-set"
          ],
          "models": [
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": []
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-17b28995226fcbf3e00f",
          "weights-unweighted",
          "model-broadcast-congest"
        ],
        "parameters": [],
        "assumptions": [
          "input-logarithmic-ids"
        ],
        "detail": [],
        "covered": [
          "auto-graph-17b28995226fcbf3e00f",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-b321139eea50286d2951",
          "detail-fractional-benchmark",
          "input-distinct-ids",
          "input-logarithmic-ids",
          "model-broadcast-congest",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-asw26-minordensity",
      "problem": "Dominating set",
      "variant": "Unweighted; fractional benchmark",
      "objective": "min",
      "graphClass": "Every minor H satisfies |E(H)| ≤ a|V(H)|",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "2a + 1 against fractional OPT",
      "rounds": "Oₐ(1)",
      "roundClass": "parameter",
      "parameters": "Fixed rational a ≥ 1.",
      "assumptions": "Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs.",
      "paperId": "gen-asw26",
      "theorem": "Theorem C(i)",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "2a + 1",
      "roundsDisplay": "f(a)",
      "approximationBenchmark": "fractional",
      "roundParameters": [
        {
          "symbol": "a",
          "name": "minor density",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(a)",
        "tex": "f\\bigl(a\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057",
            "title": "Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts",
            "location": "Theorem C(i)"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "Integer a ≥ 2",
        "setting": "Unweighted MDS; deterministic broadcast CONGEST in f(a) rounds; every minor has edge-to-vertex density at most integer a ≥ 2; integral output measured against fractional OPT.",
        "reason": "Theorem C gives the exact coefficient 2a+1 with round complexity depending on a. Treewidth-a path-power witnesses show that this coefficient cannot be improved, even against integral OPT in LOCAL. Certification here is limited to integer a; the paper gives improved coefficients on some noninteger parameter ranges. Optimal dependence on a is not claimed. The a=1 pseudoforest case has the sharper explicit one-round folklore implementation recorded separately.",
        "evidenceUrl": "https://arxiv.org/pdf/2611.02057#page=66",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-a-integer-ge2"
        ]
      },
      "sotaScopeTransfers": [
        {
          "resultId": "gen-asw26-minordensity",
          "graph": "planar",
          "scopeLabel": "Planar · a=3",
          "setting": "Planar unweighted MDS; a=3 gives exact factor 7 against fractional OPT, with the same constant-round broadcast CONGEST protocol as the planar corollary.",
          "reason": "The planar specialization is certified by the identical algorithm and parameters in Sections 5.4 and 7.2. The broader all-minor-density-three class contains the planar graphs.",
          "evidenceUrl": "https://arxiv.org/pdf/2611.02057#page=50",
          "approximation": {
            "substitutions": {
              "a": "3"
            },
            "factor": "7",
            "constantApproximation": true
          },
          "conditionIds": [],
          "claimConditionIds": [],
          "settingConditionIds": [
            "binding-a-three"
          ]
        }
      ],
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "minor-density-factor",
          "resultId": "gen-asw26-minordensity",
          "graphs": [
            "minor"
          ],
          "problems": [
            "dominating-set"
          ],
          "models": [
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": [
            "parameter-a-integer-ge1"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "G",
          "description": "Input graph",
          "tex": "G"
        },
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "a",
          "description": "Fixed rational upper bound on |E(H)|/|V(H)| for every minor H",
          "tex": "a"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a0de36fa1bbd12a5b487",
          "weights-unweighted",
          "model-broadcast-congest"
        ],
        "parameters": [
          "parameter-fixed-a"
        ],
        "assumptions": [
          "input-logarithmic-ids"
        ],
        "detail": [],
        "covered": [
          "auto-graph-a0de36fa1bbd12a5b487",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-b321139eea50286d2951",
          "detail-fractional-benchmark",
          "input-distinct-ids",
          "input-logarithmic-ids",
          "model-broadcast-congest",
          "parameter-a-rational-ge1",
          "parameter-fixed-a",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-asw26-genus",
      "problem": "Dominating set",
      "variant": "Unweighted; integral benchmark",
      "objective": "min",
      "graphClass": "Euler genus ≤ g",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "7",
      "rounds": "Oₑ(1)",
      "roundClass": "parameter",
      "parameters": "Fixed g.",
      "assumptions": "Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs. No embedding required. Benchmark is integral OPT.",
      "paperId": "gen-asw26",
      "theorem": "Theorem E",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "euler",
        "note": "Retain any connectivity condition stated by the source."
      },
      "graphClassSource": "Euler genus ≤ e",
      "notationChanges": [
        {
          "name": "Euler genus",
          "sourceSymbol": "e",
          "symbol": "g"
        }
      ],
      "parametersSource": "Fixed e.",
      "approximationDisplay": "7",
      "roundsDisplay": "f(g)",
      "roundParameters": [
        {
          "symbol": "g",
          "name": "Euler genus",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(g)",
        "tex": "f\\bigl(g\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057",
            "title": "Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts",
            "location": "Theorem E"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Deterministic broadcast CONGEST in f(g) rounds; unweighted dominating set on graphs of Euler genus at most g; integral OPT; no embedding supplied.",
        "reason": "Theorem E gives exact factor 7 with genus-dependent round complexity. Planar lower bounds prove coefficient optimality. The benchmark remains integral OPT on arbitrary fixed surfaces. Optimal dependence on g is not claimed.",
        "evidenceUrl": "https://arxiv.org/pdf/2611.02057",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "tightness": [
        {
          "certificateId": "planar-factor-seven",
          "resultId": "gen-asw26-genus",
          "graphs": [
            "euler",
            "orientable",
            "planar"
          ],
          "problems": [
            "dominating-set"
          ],
          "models": [
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": []
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound",
          "tex": "g"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-4688deea0bc7a8a63f32",
          "weights-unweighted",
          "model-broadcast-congest"
        ],
        "parameters": [
          "parameter-fixed-genus"
        ],
        "assumptions": [
          "input-logarithmic-ids"
        ],
        "detail": [
          "strength-no-embedding"
        ],
        "covered": [
          "auto-graph-4688deea0bc7a8a63f32",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-b321139eea50286d2951",
          "detail-integral-benchmark",
          "input-distinct-ids",
          "input-logarithmic-ids",
          "model-broadcast-congest",
          "parameter-fixed-genus",
          "strength-no-embedding",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-asw26-total",
      "problem": "Total dominating set",
      "variant": "Unweighted; fractional benchmark",
      "objective": "min",
      "graphClass": "Isolate-free; every minor H has |E(H)| ≤ a|V(H)|",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "2a against fractional OPT",
      "rounds": "Oₐ(1)",
      "roundClass": "parameter",
      "parameters": "Fixed rational a ≥ 1; planar graphs give 6.",
      "assumptions": "Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs.",
      "paperId": "gen-asw26",
      "theorem": "Theorem F.1(i)",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "total-dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "Requires an isolate-free instance, as appropriate for total domination."
      },
      "approximationDisplay": "2a",
      "roundsDisplay": "f(a)",
      "approximationBenchmark": "fractional",
      "roundParameters": [
        {
          "symbol": "a",
          "name": "minor density",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(a)",
        "tex": "f\\bigl(a\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057",
            "title": "Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts",
            "location": "Theorem F.1(i)"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "Integer a ≥ 1; fractional benchmark",
        "setting": "Unweighted total domination; isolate-free graphs whose every minor has density at most integer a ≥ 1; deterministic broadcast CONGEST in f(a) rounds; integral output against fractional total-domination OPT.",
        "reason": "Theorem F.1 gives exact coefficient 2a with round complexity depending on a. Proposition F.13 proves the matching coefficient lower bound in LOCAL on treewidth-a graphs against the fractional benchmark. For a=1 it also holds against integral OPT. Optimal dependence on a, noninteger a and stronger integral-benchmark optimality are not certified by this annotation.",
        "evidenceUrl": "https://arxiv.org/pdf/2611.02057#page=88",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-a-integer-ge1"
        ]
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "total-domination-factor",
          "resultId": "gen-asw26-total",
          "graphs": [
            "minor"
          ],
          "problems": [
            "total-dominating-set"
          ],
          "models": [
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": [
            "parameter-a-integer-ge1"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "G",
          "description": "Input graph",
          "tex": "G"
        },
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "a",
          "description": "Fixed rational upper bound on |E(H)|/|V(H)| for every minor H",
          "tex": "a"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-3cb5a957ccd8c0f583ad",
          "weights-unweighted",
          "model-broadcast-congest"
        ],
        "parameters": [
          "parameter-fixed-a"
        ],
        "assumptions": [
          "input-logarithmic-ids"
        ],
        "detail": [],
        "covered": [
          "auto-graph-3cb5a957ccd8c0f583ad",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-f7056f83774cd9f78096",
          "detail-fractional-benchmark",
          "input-distinct-ids",
          "input-isolate-free",
          "input-logarithmic-ids",
          "model-broadcast-congest",
          "parameter-a-rational-ge1",
          "parameter-fixed-a",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-asw26-setcover",
      "problem": "Set cover",
      "variant": "Bounded costs; also red-blue domination / hitting set",
      "objective": "min",
      "graphClass": "Planar incidence graphs",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "4 + ε against fractional OPT",
      "rounds": "Oᵦ,ε(1)",
      "roundClass": "parameter",
      "parameters": "Fixed ε > 0 and integer b ≥ 1. Each set has a positive integer cost at most b.",
      "assumptions": "Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs. Feasible instance; costs in {1,…,b}; unbounded set size and frequency.",
      "paperId": "gen-asw26",
      "theorem": "Corollary H.1(ii)",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "set-cover"
      },
      "graphScope": {
        "node": "planar-incidence",
        "note": "Planarity is required of the incidence graph."
      },
      "graphClassSource": "Planar incidence graph",
      "approximationDisplay": "4 + ε",
      "roundsDisplay": "f(b, ε)",
      "approximationBenchmark": "fractional",
      "roundParameters": [
        {
          "symbol": "b",
          "name": "maximum input cost",
          "introduced": false,
          "displaySymbol": true
        },
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(b, ε)",
        "tex": "f\\bigl(b,\\varepsilon\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057",
            "title": "Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts",
            "location": "Corollary H.1(ii)"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Deterministic broadcast CONGEST in f(b, ε) rounds; feasible set cover on planar incidence graphs; each set has a positive integer cost at most b; ε > 0; integral output against fractional OPT.",
        "reason": "Corollary H.1 achieves 4+ε; Theorem H.2 excludes every coefficient below 4 even in LOCAL. This certifies the optimal limiting coefficient, not an exact factor-4 algorithm or optimal dependence on b and ε.",
        "evidenceUrl": "https://arxiv.org/pdf/2611.02057",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "costs-integer-b",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "b",
          "description": "Upper bound on the positive integer cost of each set",
          "tex": "b"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-b08d89aa3044ab497598",
          "costs-integer-b",
          "model-broadcast-congest",
          "input-feasible-set-cover"
        ],
        "parameters": [
          "parameter-fixed-b-epsilon"
        ],
        "assumptions": [
          "input-logarithmic-ids"
        ],
        "detail": [
          "detail-red-blue-hitting-set",
          "strength-unbounded-set-incidence"
        ],
        "covered": [
          "auto-graph-b08d89aa3044ab497598",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-5e3e21d1210a645eea70",
          "costs-integer-b",
          "detail-fractional-benchmark",
          "detail-red-blue-hitting-set",
          "input-distinct-ids",
          "input-feasible-set-cover",
          "input-logarithmic-ids",
          "model-broadcast-congest",
          "parameter-epsilon-positive",
          "parameter-fixed-b-epsilon",
          "parameter-fixed-epsilon",
          "strength-unbounded-set-incidence",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-asw26-fractional",
      "problem": "Fractional local covering",
      "variant": "Local covering constraints; bounded costs",
      "objective": "min",
      "graphClass": "Every minor H satisfies |E(H)| ≤ ρ|V(H)|",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + δ against fractional OPT",
      "rounds": "Oρ,ᵦ,δ(1)",
      "roundClass": "parameter",
      "parameters": "Fixed rational ρ ≥ 1, integer b ≥ 1 and ε > 0. Each candidate vertex has a positive integer cost at most b.",
      "assumptions": "Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs. Feasible locally known candidates C(r) ⊆ N[r]; costs in {1,…,b}.",
      "paperId": "gen-asw26",
      "theorem": "Theorem A",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "fractional-local-covering"
      },
      "problemSource": "Covering LP",
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "notationChanges": [
        {
          "name": "accuracy",
          "sourceSymbol": "δ",
          "symbol": "ε"
        }
      ],
      "parametersSource": "Fixed rational ρ ≥ 1, integer b ≥ 1 and δ > 0. Each candidate vertex has a positive integer cost at most b.",
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "f(ρ, b, ε)",
      "approximationBenchmark": "fractional",
      "roundParameters": [
        {
          "symbol": "ρ",
          "name": "minor density",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "b",
          "name": "maximum input cost",
          "introduced": false,
          "displaySymbol": true
        },
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(ρ, b, ε)",
        "tex": "f\\bigl(\\rho,b,\\varepsilon\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057",
            "title": "Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts",
            "location": "Theorem A"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Deterministic broadcast CONGEST in f(ρ, b, ε) rounds; local covering LP with candidates in closed neighborhoods; minor-density bound ρ; each candidate has a positive integer cost at most b; fractional output; ε > 0.",
        "reason": "Theorem A supplies an approximation scheme with limiting ratio 1 and round complexity depending on ρ, b and ε. Optimal parameter dependence and exact optimization are not claimed.",
        "evidenceUrl": "https://arxiv.org/pdf/2611.02057",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "costs-integer-b",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "C(r)",
          "description": "Candidate vertices permitted to cover request r",
          "tex": "C(r)"
        },
        {
          "symbol": "C",
          "description": "Locally known candidate sets for the requests",
          "tex": "C"
        },
        {
          "symbol": "G",
          "description": "Input graph",
          "tex": "G"
        },
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "b",
          "description": "Upper bound on the positive integer cost of each candidate vertex",
          "tex": "b"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Request vertex of the local covering instance",
          "tex": "r"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        },
        {
          "symbol": "ρ",
          "description": "Fixed rational upper bound on |E(H)|/|V(H)| for every minor H",
          "tex": "\\rho"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-ba929dd9ea7a6101c7cf",
          "costs-integer-b",
          "input-local-covering-candidates",
          "model-broadcast-congest"
        ],
        "parameters": [
          "parameter-fixed-rho-b-epsilon"
        ],
        "assumptions": [
          "input-logarithmic-ids"
        ],
        "detail": [],
        "covered": [
          "auto-graph-ba929dd9ea7a6101c7cf",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-d4a9a4dfb4c06850597b",
          "costs-integer-b",
          "detail-fractional-benchmark",
          "detail-fractional-output",
          "input-distinct-ids",
          "input-local-covering-candidates",
          "input-logarithmic-ids",
          "model-broadcast-congest",
          "parameter-epsilon-positive",
          "parameter-fixed-epsilon",
          "parameter-fixed-rho-b-epsilon",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-asw26-cover-random",
      "problem": "Integral local covering",
      "variant": "Integral local cover; bounded costs",
      "objective": "min",
      "graphClass": "Every minor H satisfies |E(H)| ≤ ρ|V(H)|",
      "model": "CONGEST",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "1 + ε in expectation",
      "rounds": "Oρ,ᵦ,ε(1)",
      "roundClass": "parameter",
      "parameters": "Fixed rational ρ ≥ 1, integer b ≥ 1 and ε > 0. Each candidate vertex has a positive integer cost at most b.",
      "assumptions": "Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs. Feasible locally known candidates C(r) ⊆ N[r]; costs in {1,…,b}. Output always feasible.",
      "paperId": "gen-asw26",
      "theorem": "Theorem D(i)",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "local-covering"
      },
      "problemSource": "Local covering",
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "1 + ε in expectation",
      "roundsDisplay": "f(ρ, b, ε)",
      "roundParameters": [
        {
          "symbol": "ρ",
          "name": "minor density",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "b",
          "name": "maximum input cost",
          "introduced": false,
          "displaySymbol": true
        },
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(ρ, b, ε)",
        "tex": "f\\bigl(\\rho,b,\\varepsilon\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057",
            "title": "Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts",
            "location": "Theorem D(i)"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Randomized broadcast CONGEST in f(ρ, b, ε) rounds; integral local covering; minor-density bound ρ; each candidate has a positive integer cost at most b; always feasible output; expected cost ≤ (1+ε) integral OPT for ε > 0.",
        "reason": "Theorem D(i) attains an approximation scheme with round complexity depending on ρ, b and ε. Ratio 1 is the limiting optimum; the cost guarantee is in expectation. Optimal parameter dependence is not claimed.",
        "evidenceUrl": "https://arxiv.org/pdf/2611.02057",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "costs-integer-b",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "C(r)",
          "description": "Candidate vertices permitted to cover request r",
          "tex": "C(r)"
        },
        {
          "symbol": "C",
          "description": "Locally known candidate sets for the requests",
          "tex": "C"
        },
        {
          "symbol": "G",
          "description": "Input graph",
          "tex": "G"
        },
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "b",
          "description": "Upper bound on the positive integer cost of each candidate vertex",
          "tex": "b"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Request vertex of the local covering instance",
          "tex": "r"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        },
        {
          "symbol": "ρ",
          "description": "Fixed rational upper bound on |E(H)|/|V(H)| for every minor H",
          "tex": "\\rho"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-ba929dd9ea7a6101c7cf",
          "costs-integer-b",
          "input-local-covering-candidates",
          "model-broadcast-congest"
        ],
        "parameters": [
          "parameter-fixed-rho-b-epsilon"
        ],
        "assumptions": [
          "input-logarithmic-ids"
        ],
        "detail": [
          "output-always-feasible"
        ],
        "covered": [
          "auto-graph-ba929dd9ea7a6101c7cf",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-d13f16e4e51c9b55f160",
          "costs-integer-b",
          "detail-integral-output",
          "input-distinct-ids",
          "input-local-covering-candidates",
          "input-logarithmic-ids",
          "model-broadcast-congest",
          "output-always-feasible",
          "parameter-epsilon-positive",
          "parameter-fixed-epsilon",
          "parameter-fixed-rho-b-epsilon",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-asw26-cover-det",
      "problem": "Integral local covering",
      "variant": "Integral local cover; bounded costs",
      "objective": "min",
      "graphClass": "Every minor H satisfies |E(H)| ≤ ρ|V(H)|",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "Oρ,ᵦ,ε(log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed rational ρ ≥ 1, integer b ≥ 1 and ε > 0. Each candidate vertex has a positive integer cost at most b.",
      "assumptions": "Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs. Feasible locally known candidates C(r) ⊆ N[r]; costs in {1,…,b}. Common polynomial upper bound on IDs known.",
      "paperId": "gen-asw26",
      "theorem": "Theorem D(ii)",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "local-covering"
      },
      "problemSource": "Local covering",
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "prerequisite": "Known common polynomial ID bound",
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "Oρ,ᵦ,ε(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Oρ,ᵦ,ε(log* n)",
        "tex": "O_{\\rho,b,\\varepsilon}(\\log^*n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057",
            "title": "Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts",
            "location": "Theorem D(ii)"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Deterministic broadcast CONGEST; integral local covering on graphs of minor density at most ρ; positive integer candidate costs at most b; 0 < ε < 1/4; known common polynomial ID bound; O(log* n) rounds with a multiplicative constant depending on ρ, b and ε.",
        "reason": "Theorem D(ii) approaches integral OPT within 1+ε. Proposition C.1 proves Ω(log* n) already for cycles, so the dependence on n is optimal for fixed ρ, b and ε. Optimal dependence on those parameters is not claimed.",
        "evidenceUrl": "https://arxiv.org/pdf/2611.02057",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-epsilon-quarter"
        ]
      },
      "sotaScopeTransfers": [
        {
          "resultId": "gen-asw26-cover-det",
          "graph": "planar",
          "problem": "dominating-set",
          "scopeLabel": "Planar MDS · log-star",
          "setting": "Planar unweighted MDS; instantiate local covering with requests V, C(v)=N[v], unit costs and minor-density bound ρ=3. Deterministic broadcast CONGEST gives ratio 1+ε in the stated parameter-dependent log-star bound, with the known common polynomial ID bound.",
          "reason": "Theorem D(ii) supplies this specialization. Proposition C.1 makes the dependence on n optimal already on cycles. Full accuracy dependence and the supplied ID-bound convention remain part of the tradeoff.",
          "evidenceUrl": "https://arxiv.org/pdf/2611.02057#page=51",
          "conditionIds": [
            "parameter-epsilon-quarter"
          ],
          "claimConditionIds": [
            "parameter-epsilon-quarter"
          ],
          "settingConditionIds": [
            "binding-rho-three",
            "binding-unit-costs",
            "binding-closed-neighborhood-requests"
          ]
        }
      ],
      "frontierStatus": "frontier",
      "weightCondition": "costs-integer-b",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "dominating-logstar-rounds",
          "resultId": "gen-asw26-cover-det",
          "graphs": [
            "minor"
          ],
          "problems": [
            "local-covering"
          ],
          "models": [
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": [
            "scope-rounds-n-rho-b-epsilon",
            "parameter-epsilon-quarter"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "C(r)",
          "description": "Candidate vertices permitted to cover request r",
          "tex": "C(r)"
        },
        {
          "symbol": "C",
          "description": "Locally known candidate sets for the requests",
          "tex": "C"
        },
        {
          "symbol": "G",
          "description": "Input graph",
          "tex": "G"
        },
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "b",
          "description": "Upper bound on the positive integer cost of each candidate vertex",
          "tex": "b"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Request vertex of the local covering instance",
          "tex": "r"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        },
        {
          "symbol": "ρ",
          "description": "Fixed rational upper bound on |E(H)|/|V(H)| for every minor H",
          "tex": "\\rho"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-ba929dd9ea7a6101c7cf",
          "costs-integer-b",
          "input-local-covering-candidates",
          "input-common-polynomial-id-bound",
          "model-broadcast-congest"
        ],
        "parameters": [
          "parameter-fixed-rho-b-epsilon"
        ],
        "assumptions": [
          "input-logarithmic-ids"
        ],
        "detail": [],
        "covered": [
          "auto-graph-ba929dd9ea7a6101c7cf",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-d13f16e4e51c9b55f160",
          "costs-integer-b",
          "detail-integral-output",
          "input-common-polynomial-id-bound",
          "input-distinct-ids",
          "input-local-covering-candidates",
          "input-logarithmic-ids",
          "model-broadcast-congest",
          "parameter-epsilon-positive",
          "parameter-fixed-epsilon",
          "parameter-fixed-rho-b-epsilon",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-asw26-cycle-lower",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Cycles",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "approximation": "1 + ε",
      "rounds": "Ω(log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed 0 < ε < 1/4.",
      "assumptions": "Deterministic; even with known n and IDs {1,…,n}.",
      "paperId": "gen-asw26",
      "theorem": "Proposition C.1",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "cycle"
      },
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "Ω(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Ω(log* n)",
        "tex": "\\Omega (\\log^* n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057",
            "title": "Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts",
            "location": "Proposition C.1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Deterministic LOCAL; unweighted minimum dominating set on cycles; fixed 0 < ε < 1/4; ratio 1+ε against integral OPT; known n and IDs {1,…,n} allowed.",
        "reason": "Proposition C.1 gives Ω(log* n), matched by Theorem D(ii), even using broadcast CONGEST for the upper bound. This lower bound is tight.",
        "evidenceUrl": "https://arxiv.org/pdf/2611.02057",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "dominating-logstar-rounds",
          "resultId": "gen-asw26-cycle-lower",
          "graphs": [
            "cycle",
            "planar",
            "outerplanar",
            "euler",
            "orientable"
          ],
          "problems": [
            "dominating-set"
          ],
          "models": [
            "LOCAL",
            "CONGEST"
          ],
          "conditionIds": [
            "scope-rounds-n-epsilon",
            "parameter-epsilon-quarter"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-581d3bad24d9045aad04",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-3322b3cbbe2c94dcb771"
        ],
        "assumptions": [
          "auto-assumption-30d97f811f8d9d819bc6"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-30d97f811f8d9d819bc6",
          "auto-graph-581d3bad24d9045aad04",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-3322b3cbbe2c94dcb771",
          "parameter-epsilon-half",
          "parameter-epsilon-positive",
          "parameter-epsilon-quarter",
          "parameter-epsilon-unit",
          "parameter-fixed-epsilon",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-fk25-tree",
      "problem": "Independent set",
      "variant": "Maximum weight",
      "objective": "max",
      "graphClass": "Trees",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − ε of OPT",
      "rounds": "O(log* n / ε)",
      "roundClass": "logstar",
      "parameters": "log(n)/n < ε < 1; fixed ε gives log-star rounds.",
      "assumptions": "Node weights fit one CONGEST message; n, Δ and relevant graph parameters known.",
      "paperId": "gen-fk25",
      "theorem": "Theorem 1.1",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2506.10845v1",
      "year": 2025,
      "problemScope": {
        "node": "independent-set"
      },
      "graphScope": {
        "node": "forest"
      },
      "graphClassSource": "Trees, including unrooted trees",
      "prerequisite": "Known n, Δ and graph parameters",
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "O(log* n / ε)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log* n / ε)",
        "tex": "O\\!\\left(\\frac{\\log^*n}{\\varepsilon}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2506.10845v1",
            "title": "Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs",
            "location": "Theorem 1.1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Deterministic CONGEST; maximum-weight independent set on arbitrary unrooted trees; log(n)/n < ε < 1; retained weight ≥ (1−ε) OPT; weights fit one message.",
        "reason": "Theorem 1.1 proves tight Θ(log* n/ε) complexity; the lower bound holds even for unweighted oriented paths in LOCAL.",
        "evidenceUrl": "https://arxiv.org/html/2506.10845v1",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "tree-independent-rounds",
          "resultId": "gen-fk25-tree",
          "graphs": [
            "forest",
            "path",
            "oriented-path"
          ],
          "problems": [
            "independent-set"
          ],
          "models": [
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": []
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-655689d0297b69cf89ca",
          "weights-weighted",
          "input-known-n-degree-graph"
        ],
        "parameters": [
          "auto-parameter-7c6f24677bc7fbc2830c"
        ],
        "assumptions": [],
        "detail": [
          "detail-weights-one-message"
        ],
        "covered": [
          "auto-graph-655689d0297b69cf89ca",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-4ad7b7801c4e84e8fdd9",
          "auto-parameter-7c6f24677bc7fbc2830c",
          "detail-weights-one-message",
          "input-known-degree",
          "input-known-n",
          "input-known-n-degree",
          "input-known-n-degree-graph",
          "parameter-epsilon-positive",
          "parameter-epsilon-tree-domain",
          "parameter-epsilon-unit",
          "parameter-fixed-epsilon",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-fk25-path-lower",
      "problem": "Independent set",
      "variant": "Maximum cardinality",
      "objective": "max",
      "graphClass": "Oriented paths",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "approximation": "1 − ε",
      "rounds": "Ω(log* n / ε)",
      "roundClass": "logstar",
      "parameters": "log(n)/n < ε < 1; fixed ε gives log-star rounds.",
      "assumptions": "Deterministic algorithms.",
      "paperId": "gen-fk25",
      "theorem": "Theorem 1.1",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2506.10845v1",
      "year": 2025,
      "problemScope": {
        "node": "independent-set"
      },
      "graphScope": {
        "node": "oriented-path",
        "note": "Orientation is supplied to the lower-bound algorithm."
      },
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "Ω(log* n / ε)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Ω(log* n / ε)",
        "tex": "\\Omega\\!\\left(\\frac{\\log^*n}{\\varepsilon}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2506.10845v1",
            "title": "Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs",
            "location": "Theorem 1.1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Deterministic LOCAL; maximum-cardinality independent set on oriented paths; log(n)/n < ε < 1; retained cardinality ≥ (1−ε) OPT.",
        "reason": "Theorem 1.1 proves Ω(log* n/ε), matched by its CONGEST upper bound for all trees. Both n and ε dependence are tight in the stated range.",
        "evidenceUrl": "https://arxiv.org/html/2506.10845v1",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "tree-independent-rounds",
          "resultId": "gen-fk25-path-lower",
          "graphs": [
            "oriented-path",
            "path",
            "forest"
          ],
          "problems": [
            "independent-set"
          ],
          "models": [
            "LOCAL",
            "CONGEST"
          ],
          "conditionIds": []
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-597aa492393966caa704",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-7c6f24677bc7fbc2830c"
        ],
        "assumptions": [
          "auto-assumption-dd30a8ba85510a5ac83a"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-dd30a8ba85510a5ac83a",
          "auto-graph-597aa492393966caa704",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-4ad7b7801c4e84e8fdd9",
          "auto-parameter-7c6f24677bc7fbc2830c",
          "parameter-epsilon-positive",
          "parameter-epsilon-tree-domain",
          "parameter-epsilon-unit",
          "parameter-fixed-epsilon",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-fk25-arboricity-fast",
      "problem": "Independent set",
      "variant": "Maximum weight",
      "objective": "max",
      "graphClass": "Arboricity β ≥ 1",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "≥ (1−ε) w(V)/(4β)",
      "rounds": "O(log²(β/ε)/ε + log* n)",
      "roundClass": "logstar",
      "parameters": "0 < ε < 1; fixed β, ε gives log-star rounds.",
      "assumptions": "Node weights fit one CONGEST message; n, Δ and relevant graph parameters known. w(V) is total input weight, hence at least OPT.",
      "paperId": "gen-fk25",
      "theorem": "Theorem 1.2",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2506.10845v1",
      "year": 2025,
      "problemScope": {
        "node": "independent-set"
      },
      "graphScope": {
        "node": "density",
        "note": "Use compatible fixed arboricity bounds; planar inputs permit an arboricity bound of 3."
      },
      "prerequisite": "Known n, Δ and graph parameters",
      "approximationDisplay": "≥ (1−ε) w(V)/(4β)",
      "roundsDisplay": "O(log²(β/ε)/ε + log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log²(β/ε)/ε + log* n)",
        "tex": "O\\!\\left(\\frac{\\log^2(\\beta/\\varepsilon)}{\\varepsilon}+\\log^*n\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2506.10845v1",
            "title": "Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs",
            "location": "Theorem 1.2"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "Bounded arboricity · weighted IS · log-star",
        "setting": "Deterministic CONGEST; maximum-weight independent set on graphs of arboricity β≥1; source weight encodings and supplied graph parameters; weight at least (1−ε)w(V)/(4β) in O(log²(β/ε)/ε + log* n) rounds.",
        "reason": "Theorem 1.2 improves the known bounded-arboricity weighted-IS tradeoff to log-star dependence on n for fixed β and ε. The stronger total-weight guarantee of Theorem 1.3 uses logarithmic n rounds, so it does not dominate this faster point. The benchmark remains total input weight w(V), rather than being silently replaced by OPT.",
        "evidenceUrl": "https://arxiv.org/html/2506.10845v1#S1.SS4.SSS2",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "w(V)",
          "description": "Total input vertex weight, which is at least the maximum independent-set weight",
          "tex": "w(V)"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "w",
          "description": "Input vertex-weight function",
          "tex": "w"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "β",
          "description": "Arboricity bound of the input graph",
          "tex": "\\beta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-407b59be506be46dbb08",
          "weights-weighted",
          "input-known-n-degree-graph"
        ],
        "parameters": [
          "auto-parameter-e8b3261a0e0b3f8858bd"
        ],
        "assumptions": [],
        "detail": [
          "detail-weights-one-message",
          "detail-total-weight-benchmark"
        ],
        "covered": [
          "auto-graph-407b59be506be46dbb08",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-4ad7b7801c4e84e8fdd9",
          "auto-parameter-e8b3261a0e0b3f8858bd",
          "detail-total-weight-benchmark",
          "detail-weights-one-message",
          "input-known-degree",
          "input-known-n",
          "input-known-n-degree",
          "input-known-n-degree-graph",
          "parameter-beta-ge1",
          "parameter-epsilon-positive",
          "parameter-epsilon-unit",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-fk25-arboricity-better",
      "problem": "Independent set",
      "variant": "Maximum weight",
      "objective": "max",
      "graphClass": "Arboricity β > 1",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "≥ (1−ε) w(V)/(2β+1)",
      "rounds": "O(log³ β · log(1/ε) · log n / ε²)",
      "roundClass": "logarithmic",
      "parameters": "0 < ε < 1; fixed β, ε gives logarithmic rounds.",
      "assumptions": "Node weights fit one CONGEST message; n, Δ and relevant graph parameters known. w(V) is total input weight, hence at least OPT.",
      "paperId": "gen-fk25",
      "theorem": "Theorem 1.3",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2506.10845v1",
      "year": 2025,
      "problemScope": {
        "node": "independent-set"
      },
      "graphScope": {
        "node": "density",
        "note": "Use compatible fixed arboricity bounds; planar inputs permit an arboricity bound of 3."
      },
      "prerequisite": "Known n, Δ and graph parameters",
      "approximationDisplay": "≥ (1−ε) w(V)/(2β+1)",
      "roundsDisplay": "O(log³ β · log(1/ε) · log n / ε²)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log³ β · log(1/ε) · log n / ε²)",
        "tex": "O\\!\\left(\\frac{\\log^3\\beta\\,\\log(1/\\varepsilon)\\,\\log n}{\\varepsilon^2}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2506.10845v1",
            "title": "Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs",
            "location": "Theorem 1.3"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "Bounded arboricity · weighted IS · logarithmic",
        "setting": "Deterministic CONGEST; maximum-weight independent set on graphs of arboricity β>1; source weight encodings and supplied graph parameters; weight at least (1−ε)w(V)/(2β+1) with the stated β, ε and logarithmic-n round dependence.",
        "reason": "Theorem 1.3 improves the logarithmic-round guarantee and its dependence on β in the stated parameter range. Its larger retained fraction trades against Theorem 1.2’s faster log-star n dependence. The total-weight benchmark and complete parameter dependence are part of this frontier point; no exact optimality claim is made.",
        "evidenceUrl": "https://arxiv.org/html/2506.10845v1#S1.SS4.SSS2",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "w(V)",
          "description": "Total input vertex weight, which is at least the maximum independent-set weight",
          "tex": "w(V)"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "w",
          "description": "Input vertex-weight function",
          "tex": "w"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "β",
          "description": "Arboricity bound of the input graph",
          "tex": "\\beta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-f0a5babb59d5c701134a",
          "weights-weighted",
          "input-known-n-degree-graph"
        ],
        "parameters": [
          "auto-parameter-fca824c9f4aac6656e76"
        ],
        "assumptions": [],
        "detail": [
          "detail-weights-one-message",
          "detail-total-weight-benchmark"
        ],
        "covered": [
          "auto-graph-f0a5babb59d5c701134a",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-4ad7b7801c4e84e8fdd9",
          "auto-parameter-fca824c9f4aac6656e76",
          "detail-total-weight-benchmark",
          "detail-weights-one-message",
          "input-known-degree",
          "input-known-n",
          "input-known-n-degree",
          "input-known-n-degree-graph",
          "parameter-beta-ge1",
          "parameter-beta-gt1",
          "parameter-epsilon-positive",
          "parameter-epsilon-unit",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-low24-cover",
      "problem": "Fractional covering LP",
      "variant": "Fractional positive LP",
      "objective": "min",
      "graphClass": "Incidence graphs",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "O(Γd · log Γₚ / ε²)",
      "roundClass": "degree",
      "parameters": "Γₚ = max column sum, Γd = max row sum of normalized A; ε > 0.",
      "assumptions": "Communication graph is variable–constraint incidence graph. Normalized nonzero Aᵢⱼ ≥ 1; coefficient sizes follow the paper’s CONGEST encoding.",
      "paperId": "gen-low24",
      "theorem": "Theorem 2.1",
      "summary": "Simultaneously computes a feasible primal and dual approximation.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2409.16168v1",
      "year": 2024,
      "problemScope": {
        "node": "covering-lp"
      },
      "problemSource": "Covering LP",
      "graphScope": {
        "node": "incidence",
        "note": "The communication graph is the variable–constraint incidence graph."
      },
      "graphClassSource": "General incidence graphs",
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "O(Γd · log Γₚ / ε²)",
      "approximationBenchmark": "fractional",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(Γd · log Γₚ / ε²)",
        "tex": "O\\!\\left(\\frac{\\Gamma_d\\,\\log\\Gamma_p}{\\varepsilon^2}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2409.16168v1",
            "title": "A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems",
            "location": "Theorem 2.1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "Incidence network · sparse fractional covering · accuracy tradeoff",
        "setting": "Deterministic CONGEST; normalized fractional covering LP on its variable–constraint incidence network; nonzero coefficients at least 1 with the source encodings; ratio 1+ε and O(Γd log Γp / ε²) rounds.",
        "reason": "Theorem 2.1 gives the ε^−2 accuracy point. Its linear Γd dependence trades against the earlier logarithmic-Γd, ε^−4 bound; neither family uniformly dominates the other. For bounded sparsity and coefficients this improves the prior accuracy dependence. No integral-output or graph-preserving reduction is inferred.",
        "evidenceUrl": "https://arxiv.org/html/2409.16168v1#S2",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "coefficients-normalized-positive",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "Aᵢⱼ",
          "description": "Coefficient in row i and column j of the normalized constraint matrix",
          "tex": "A_{ij}"
        },
        {
          "symbol": "Γd",
          "description": "Maximum row sum of the normalized constraint matrix A",
          "tex": "\\Gamma_d"
        },
        {
          "symbol": "Γₚ",
          "description": "Maximum column sum of the normalized constraint matrix A",
          "tex": "\\Gamma_p"
        },
        {
          "symbol": "A",
          "description": "Normalized constraint matrix, whose nonzero coefficients are at least one",
          "tex": "A"
        },
        {
          "symbol": "i",
          "description": "Row index of the normalized constraint matrix",
          "tex": "i"
        },
        {
          "symbol": "j",
          "description": "Column index of the normalized constraint matrix",
          "tex": "j"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "graph-variable-constraint-incidence",
          "coefficients-normalized-positive",
          "coefficients-at-least-one",
          "coefficient-encoding"
        ],
        "parameters": [
          "auto-parameter-c293f2aadfa39d01b72f"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-53746915587a9d48e761",
          "auto-parameter-c293f2aadfa39d01b72f",
          "coefficient-encoding",
          "coefficients-at-least-one",
          "coefficients-normalized-positive",
          "detail-fractional-benchmark",
          "detail-fractional-output",
          "graph-variable-constraint-incidence"
        ]
      }
    },
    {
      "id": "gen-low24-pack",
      "problem": "Fractional packing LP",
      "variant": "Dual fractional positive LP",
      "objective": "max",
      "graphClass": "Incidence graphs",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1/(1+ε) of fractional OPT",
      "rounds": "O(Γd · log Γₚ / ε²)",
      "roundClass": "degree",
      "parameters": "Γₚ = max column sum, Γd = max row sum of normalized A; ε > 0.",
      "assumptions": "Communication graph is variable–constraint incidence graph. Normalized nonzero Aᵢⱼ ≥ 1; coefficient sizes follow the paper’s CONGEST encoding.",
      "paperId": "gen-low24",
      "theorem": "Theorem 2.1",
      "summary": "For fixed row sparsity k, Γd ≤ k Amax.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2409.16168v1",
      "year": 2024,
      "problemScope": {
        "node": "packing-lp"
      },
      "problemSource": "Packing LP",
      "graphScope": {
        "node": "incidence",
        "note": "The communication graph is the variable–constraint incidence graph."
      },
      "graphClassSource": "General incidence graphs",
      "approximationDisplay": "1/(1+ε)",
      "roundsDisplay": "O(Γd · log Γₚ / ε²)",
      "approximationBenchmark": "fractional",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(Γd · log Γₚ / ε²)",
        "tex": "O\\!\\left(\\frac{\\Gamma_d\\,\\log\\Gamma_p}{\\varepsilon^2}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2409.16168v1",
            "title": "A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems",
            "location": "Theorem 2.1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "Incidence network · sparse fractional packing · accuracy tradeoff",
        "setting": "Deterministic CONGEST; the dual normalized fractional packing LP on its variable–constraint incidence network; source coefficient/encoding conditions; feasible value at least OPT/(1+ε) in O(Γd log Γp / ε²) rounds.",
        "reason": "Theorem 2.1 supplies the dual ε^−2 point with the same sparsity/coefficient tradeoff as covering. Earlier ε^−4 algorithms have better Γd dependence, so the full parameter functions must be compared. A fractional packing guarantee is kept separate from integral matching and packing.",
        "evidenceUrl": "https://arxiv.org/html/2409.16168v1#S2",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "coefficients-normalized-positive",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "Aᵢⱼ",
          "description": "Coefficient in row i and column j of the normalized constraint matrix",
          "tex": "A_{ij}"
        },
        {
          "symbol": "Γd",
          "description": "Maximum row sum of the normalized constraint matrix A",
          "tex": "\\Gamma_d"
        },
        {
          "symbol": "Γₚ",
          "description": "Maximum column sum of the normalized constraint matrix A",
          "tex": "\\Gamma_p"
        },
        {
          "symbol": "A",
          "description": "Normalized constraint matrix, whose nonzero coefficients are at least one",
          "tex": "A"
        },
        {
          "symbol": "i",
          "description": "Row index of the normalized constraint matrix",
          "tex": "i"
        },
        {
          "symbol": "j",
          "description": "Column index of the normalized constraint matrix",
          "tex": "j"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "graph-variable-constraint-incidence",
          "coefficients-normalized-positive",
          "coefficients-at-least-one",
          "coefficient-encoding"
        ],
        "parameters": [
          "auto-parameter-c293f2aadfa39d01b72f"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-5bdcfa2d039df6333abe",
          "auto-parameter-c293f2aadfa39d01b72f",
          "coefficient-encoding",
          "coefficients-at-least-one",
          "coefficients-normalized-positive",
          "detail-fractional-benchmark",
          "detail-fractional-output",
          "graph-variable-constraint-incidence"
        ]
      }
    },
    {
      "id": "gen-dp26-matching",
      "problem": "Maximum matching",
      "variant": "Maximum cardinality",
      "objective": "max",
      "graphClass": "General",
      "model": "LOCAL",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "1/(2+ε) of OPT",
      "rounds": "O(log n / log² log n)",
      "roundClass": "other",
      "parameters": "0 < ε < 1 may depend on n; constant δ > 0.",
      "assumptions": "Success probability ≥ 1 − ε⁻¹ exp(−Ω(log¹⁻δ n)).",
      "paperId": "gen-dp26",
      "theorem": "Theorem 1",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2605.13264v1",
      "year": 2026,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "general"
      },
      "approximationDisplay": "1/(2+ε)",
      "roundsDisplay": "O(log n / log² log n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log n / log² log n)",
        "tex": "O\\!\\left(\\frac{\\log n}{(\\log\\log n)^2}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2605.13264v1",
            "title": "Distributed Approximate Maximum Matching and Minimum Vertex Cover via Generalized Graph Decomposition",
            "location": "Theorem 1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Randomized LOCAL; maximum-cardinality matching on general graphs with no degree bound; fixed 0 < ε < 1 and δ > 0; ratio 1/(2+ε); success ≥ 1−ε⁻¹ exp(−Ω(log¹⁻δ n)); n-only round complexity.",
        "reason": "Theorem 1 improves the previous n-dependent bound by a log log n factor to O(log n/log² log n). Current primary-source audit found no later improvement with this guarantee; optimality remains open.",
        "evidenceUrl": "https://arxiv.org/html/2605.13264v1",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-fixed-epsilon"
        ]
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "δ",
          "description": "Fixed constant controlling the exponent in the success-probability bound",
          "tex": "\\delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-fc75e240ad481ee0e55f"
        ],
        "assumptions": [
          "auto-assumption-99d1e131b93d403aad65"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-99d1e131b93d403aad65",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-fc75e240ad481ee0e55f",
          "parameter-epsilon-positive",
          "parameter-epsilon-unit",
          "parameter-fixed-delta",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-dp26-cover",
      "problem": "Vertex cover",
      "variant": "Minimum weight",
      "objective": "min",
      "graphClass": "General",
      "model": "LOCAL",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "2 + ε",
      "rounds": "O(log n/log² log n + log n · log(1/ε)/log³ log n)",
      "roundClass": "other",
      "parameters": "0 < ε < 1 may depend on n.",
      "assumptions": "With high probability in n.",
      "paperId": "gen-dp26",
      "theorem": "Theorem 2",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2605.13264v1",
      "year": 2026,
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "general"
      },
      "approximationDisplay": "2 + ε",
      "roundsDisplay": "O(log n/log² log n + log n · log(1/ε)/log³ log n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log n/log² log n + log n · log(1/ε)/log³ log n)",
        "tex": "O\\!\\left(\\frac{\\log n}{(\\log\\log n)^2}+\\frac{\\log n\\,\\log(1/\\varepsilon)}{(\\log\\log n)^3}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2605.13264v1",
            "title": "Distributed Approximate Maximum Matching and Minimum Vertex Cover via Generalized Graph Decomposition",
            "location": "Theorem 2"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Randomized LOCAL; minimum-weight vertex cover on general graphs with no degree bound; fixed 0 < ε < 1; factor 2+ε with high probability in n; n-only round complexity.",
        "reason": "Theorem 2 gives O(log n/log² log n) for fixed ε and explicitly improves the prior n-dependent best. Current primary-source audit found no later improvement; the lower-bound gap remains open.",
        "evidenceUrl": "https://arxiv.org/html/2605.13264v1",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-fixed-epsilon"
        ]
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-weighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-weighted"
        ],
        "parameters": [
          "auto-parameter-3476296f566e07833c97"
        ],
        "assumptions": [
          "auto-assumption-80568cb855e5b8754fce"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-80568cb855e5b8754fce",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-output-7f07455ff69b3b347e9b",
          "auto-parameter-3476296f566e07833c97",
          "parameter-epsilon-positive",
          "parameter-epsilon-unit",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-iky25-matching",
      "problem": "Maximum matching",
      "variant": "Maximum cardinality",
      "objective": "max",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − ε of OPT",
      "rounds": "O(ε⁻⁴ · MM(ε⁻² n))",
      "roundClass": "polylog",
      "parameters": "0 < ε < 1; MM(N) is the round complexity of maximal matching on N vertices.",
      "assumptions": "Deterministic when using a deterministic maximal-matching subroutine. The bound retains this subroutine cost.",
      "paperId": "gen-iky25",
      "theorem": "Theorem 1.2",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2511.08210v1",
      "year": 2025,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "general"
      },
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "O(ε⁻⁴ · MM(ε⁻² n))",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(ε⁻⁴ · MM(ε⁻² n))",
        "tex": "O\\!\\left(\\varepsilon^{-4}\\,\\mathrm{MM}(\\varepsilon^{-2}n)\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2511.08210v1",
            "title": "Forgetting Alternation and Blossoms: A New Framework for Fast Matching Augmentation and Its Applications to Sequential/Distributed/Streaming Computation",
            "location": "Theorem 1.2"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Deterministic CONGEST; maximum-cardinality matching on general graphs without a degree bound; retained fraction 1−ε; fully polynomial dependence on 1/ε and polylogarithmic n; MM(N) denotes deterministic maximal-matching cost.",
        "reason": "Theorem 1.2 gives O(ε⁻⁴ MM(ε⁻²n)), improving the prior Õ(ε⁻¹⁰ MM(n)) bound. Current primary-source audit found no later improvement to this general tradeoff; no optimality claim.",
        "evidenceUrl": "https://arxiv.org/html/2511.08210v1",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "MM",
          "description": "Round complexity of the maximal-matching subroutine as a function of its input size",
          "tex": "\\mathrm{MM}"
        },
        {
          "symbol": "N",
          "description": "Number of vertices in the maximal-matching subroutine instance",
          "tex": "N"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-516147a00c3aa0a82783"
        ],
        "assumptions": [
          "auto-assumption-4dffc0da8b409a724621"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-4dffc0da8b409a724621",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-516147a00c3aa0a82783",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-chr24-local",
      "problem": "Local density",
      "variant": "Per-vertex local-density estimation",
      "objective": "max",
      "graphClass": "General",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "Within factor 1 + ε",
      "rounds": "O(ε⁻² log² n)",
      "roundClass": "polylog",
      "parameters": "ε⁻¹ = O(poly(n)).",
      "assumptions": "Outputs an estimate of ρ*(v) at each vertex; not directly a selected densest subgraph.",
      "paperId": "gen-chr24",
      "theorem": "Abstract",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2025.25",
      "year": 2024,
      "problemScope": {
        "node": "local-density"
      },
      "graphScope": {
        "node": "general"
      },
      "approximationDisplay": "Within factor 1 + ε",
      "roundsDisplay": "O(ε⁻² log² n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(ε⁻² log² n)",
        "tex": "O(\\varepsilon^{-2}\\log^2n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2025.25",
            "title": "Local Density and Its Distributed Approximation",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "ρ*(v)",
          "description": "Local density assigned to vertex v; equivalently its optimal local out-degree",
          "tex": "\\rho^*(v)"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "v",
          "description": "Vertex whose local density is estimated",
          "tex": "v"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-8d2a24f83dd35a601656"
        ],
        "assumptions": [
          "auto-assumption-e178aeb72ef1814dfe69"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-e178aeb72ef1814dfe69",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-0ded4f9dae88d217ac16",
          "auto-parameter-8d2a24f83dd35a601656",
          "detail-per-vertex-density",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-chr24-congest",
      "problem": "Local density",
      "variant": "Per-vertex local-density estimation",
      "objective": "max",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "Within factor 1 + ε",
      "rounds": "poly(log n, ε⁻¹) · 2ᴼ⁽√ˡᵒᵍ ⁿ⁾",
      "roundClass": "other",
      "parameters": "ε⁻¹ = O(poly(n)).",
      "assumptions": "Outputs an estimate of ρ*(v) at each vertex; not directly a selected densest subgraph.",
      "paperId": "gen-chr24",
      "theorem": "Abstract",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2025.25",
      "year": 2024,
      "problemScope": {
        "node": "local-density"
      },
      "graphScope": {
        "node": "general"
      },
      "approximationDisplay": "Within factor 1 + ε",
      "roundsDisplay": "poly(log n, ε⁻¹) · 2ᴼ⁽√ˡᵒᵍ ⁿ⁾",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "poly(log n, ε⁻¹) · 2ᴼ⁽√ˡᵒᵍ ⁿ⁾",
        "tex": "\\operatorname{poly}(\\log n,\\varepsilon^{-1})\\,2^{O(\\sqrt{\\log n})}",
        "basis": "symbolic",
        "explanation": "A numerical polynomial exponent has not yet been extracted for this record. The displayed expression retains all currently recorded parameter dependence.",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2025.25",
            "title": "Local Density and Its Distributed Approximation",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "ρ*(v)",
          "description": "Local density assigned to vertex v; equivalently its optimal local out-degree",
          "tex": "\\rho^*(v)"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "v",
          "description": "Vertex whose local density is estimated",
          "tex": "v"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-8d2a24f83dd35a601656"
        ],
        "assumptions": [
          "auto-assumption-e178aeb72ef1814dfe69"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-e178aeb72ef1814dfe69",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-0ded4f9dae88d217ac16",
          "auto-parameter-8d2a24f83dd35a601656",
          "detail-per-vertex-density",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-jpp26-sleep",
      "problem": "Dominating set",
      "variant": "Unweighted; sleeping CONGEST",
      "objective": "min",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "O(log Δ) in expectation",
      "rounds": "O(log² Δ) total; O(log Δ) awake",
      "roundClass": "degree",
      "parameters": "Δ is maximum degree.",
      "assumptions": "Sleeping CONGEST: a sleeping node cannot compute, send, or receive. Awake bound is per node.",
      "paperId": "gen-jpp26",
      "theorem": "Abstract",
      "summary": "Elapsed rounds and awake complexity are separate resources.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/abs/2608.19096",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "general"
      },
      "approximationDisplay": "O(log Δ) in expectation",
      "roundsDisplay": "O(log² Δ) total; O(log Δ) awake",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log² Δ) total; O(log Δ) awake",
        "tex": "O(\\log^2\\Delta)\\text{ total};\\quad O(\\log\\Delta)\\text{ awake}",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2608.19096",
            "title": "Approximating Minimum Dominating Set with Few Awake Rounds",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-unweighted",
          "model-sleeping-congest"
        ],
        "parameters": [
          "auto-parameter-086b33ba1d8d93f63191"
        ],
        "assumptions": [
          "auto-assumption-cd9841afbab6ff0511ce"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-cd9841afbab6ff0511ce",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-086b33ba1d8d93f63191",
          "model-sleeping-congest",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-as10-setcover",
      "problem": "Set cover",
      "variant": "Weighted",
      "objective": "min",
      "graphClass": "Incidence graphs; set size ≤ k, frequency ≤ f",
      "model": "Anonymous",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "f",
      "rounds": "O(f²k² + fk log* W)",
      "roundClass": "degree",
      "parameters": "Positive integer weights ≤ W; bounded f,k,W gives constant rounds.",
      "assumptions": "Anonymous broadcast network; no unique identifiers.",
      "paperId": "gen-as10",
      "theorem": "Section 4",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://jukkasuomela.fi/doc/vc-sc.pdf",
      "year": 2010,
      "problemScope": {
        "node": "set-cover"
      },
      "graphScope": {
        "node": "bounded-incidence",
        "note": "The set-size and frequency bounds remain required."
      },
      "approximationDisplay": "f",
      "roundsDisplay": "O(f²k² + fk log* W)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(f²k² + fk log* W)",
        "tex": "O(f^2k^2+fk\\log^*W)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/vc-sc.pdf",
            "title": "Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks",
            "location": "Section 4"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "Bounded incidence · anonymous broadcast · f ≤ k",
        "setting": "Weighted set cover on its incidence network; set size at most k, element frequency at most f ≤ k and positive integer weights at most W; deterministic anonymous broadcast; O(f²k² + fk log* W) rounds.",
        "reason": "Section 4 gives factor f without identifiers or port numbering. Section 6 proves the lower barrier min{f,k}; hence factor f is optimal in the certified range f ≤ k. For f > k, the trivial k-approximation is stronger, so this annotation does not certify that range. Exact running-time optimality is not claimed.",
        "evidenceUrl": "https://jukkasuomela.fi/doc/vc-sc.pdf",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-f-at-most-k"
        ]
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-integer-W",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "W",
          "description": "Upper bound on positive integer input set weights",
          "tex": "W"
        },
        {
          "symbol": "f",
          "description": "Maximum frequency: number of sets containing an element",
          "tex": "f"
        },
        {
          "symbol": "k",
          "description": "Maximum cardinality of a set",
          "tex": "k"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-29f2223ddd7a0e79d30b",
          "weights-integer-W",
          "model-anonymous-broadcast"
        ],
        "parameters": [
          "auto-parameter-6791260aa74876dd1065"
        ],
        "assumptions": [],
        "detail": [
          "strength-no-ids"
        ],
        "covered": [
          "auto-graph-29f2223ddd7a0e79d30b",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-92362405df7c8f0d5040",
          "auto-output-5e3e21d1210a645eea70",
          "auto-parameter-6791260aa74876dd1065",
          "model-anonymous-broadcast",
          "model-port-numbering",
          "strength-no-ids",
          "weights-integer-W",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-bdgpsw26-apex",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Euler genus ≤ g; at most a apices",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "34 + ε",
      "rounds": "C(g,a,ε)",
      "roundClass": "parameter",
      "parameters": "Fixed g and a; fixed ε > 0.",
      "assumptions": "",
      "paperId": "gen-bdgpsw26",
      "theorem": "Corollary 4.3 and following extension",
      "summary": "Apex neighborhoods may be arbitrary.",
      "verification": "primary",
      "sourceUrl": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "apex"
      },
      "graphClassSource": "Euler genus ≤ g plus at most a apices",
      "approximationDisplay": "34 + ε",
      "roundsDisplay": "f(g, a, ε)",
      "roundParameters": [
        {
          "symbol": "g",
          "name": "Euler genus",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "a",
          "name": "apex count",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "f(g, a, ε)",
        "tex": "f\\bigl(g,a,\\varepsilon\\bigr)",
        "basis": "unspecified-parameter-function",
        "explanation": "The text after Corollary 4.3 extends the genus approximation to graphs with at most a apices. It explains the structural changes (including shortcuts through at most a apices), but does not give a closed round-complexity formula in g,a,ε. The meta-theorem composition still requires the appropriate class control function and local-error diameter threshold.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
            "title": "Meta-Theorems for Cuttable Distributed Problems",
            "location": "Corollary 4.3 and subsequent apex extension; Theorem 4.2"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "a",
          "description": "Maximum number of apex vertices deleted to obtain Euler genus at most g",
          "tex": "a"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound",
          "tex": "g"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-cdc1893875a9dac727a7",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-a584b0bba6a6122fb630"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-cdc1893875a9dac727a7",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-a584b0bba6a6122fb630",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-bdgpsw26-localgenus",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Asymptotic dimension d; radius-r balls of Euler genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "34.01(d + 1)",
      "rounds": "C(d,g,r)",
      "roundClass": "parameter",
      "parameters": "Fixed d,g and sufficiently large fixed radius r.",
      "assumptions": "The local-class condition is as defined in the paper; the apex extension also holds.",
      "paperId": "gen-bdgpsw26",
      "theorem": "Corollary 4.4",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "local-genus",
        "note": "Asymptotic dimension, its control function and sufficiently large local radius remain fixed prerequisites."
      },
      "graphClassSource": "Asymptotic dimension d; r-locally Euler genus ≤ g",
      "approximationDisplay": "34.01(d + 1)",
      "roundsDisplay": "f(d, g, r)",
      "roundParameters": [
        {
          "symbol": "d",
          "name": "asymptotic dimension",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "g",
          "name": "local genus",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "r",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "f(d, g, r)",
        "tex": "f\\bigl(d,g,r\\bigr)",
        "basis": "unspecified-parameter-function",
        "explanation": "Corollary 4.4 fixes the dimensional control function and a sufficiently large local radius. These are substantive prerequisites: d,g,r alone do not specify the numerical control-function values used by the proof. Do not describe its runtime as an absolute constant independent of the graph-class parameters.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
            "title": "Meta-Theorems for Cuttable Distributed Problems",
            "location": "Corollary 4.4, its application of Meta-Theorem I, and the definition of the dimensional control function"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "d",
          "description": "Asymptotic dimension bound of the graph class",
          "tex": "d"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound for the radius-r balls after any stated apex deletions",
          "tex": "g"
        },
        {
          "symbol": "r",
          "description": "Fixed sufficiently large radius of the neighborhoods used in the local-class assumption",
          "tex": "r"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-cc88dac74423991e2fb4",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-537a07678fea6f22098a"
        ],
        "assumptions": [
          "auto-assumption-d82fde380382d55bfbd5"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-d82fde380382d55bfbd5",
          "auto-graph-cc88dac74423991e2fb4",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-537a07678fea6f22098a",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-bdgpsw26-ktuple",
      "problem": "k-domination (outside the solution)",
      "variant": "k-domination of vertices outside the solution",
      "objective": "min",
      "graphClass": "Euler genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "19 if k = 2; 3k/(k−2) + 1 if k > 2",
      "rounds": "C(g,k)",
      "roundClass": "parameter",
      "parameters": "Fixed g and k ≥ 2.",
      "assumptions": "Each vertex outside the solution needs k neighbors inside it; no such condition on selected vertices.",
      "paperId": "gen-bdgpsw26",
      "theorem": "Corollary 4.5",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
      "year": 2026,
      "problemScope": {
        "node": "outside-k-domination"
      },
      "problemParameter": "k",
      "problemParameterName": "required neighbors outside the solution",
      "problemSource": "k-tuple dominating set",
      "graphScope": {
        "node": "euler",
        "note": "Retain any connectivity condition stated by the source."
      },
      "approximationDisplay": "19 if k = 2; 3k/(k−2) + 1 if k > 2",
      "roundsDisplay": "f(g, k)",
      "roundParameters": [
        {
          "symbol": "g",
          "name": "Euler genus",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "k",
          "name": "domination multiplicity",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "f(g, k)",
        "tex": "f\\bigl(g,k\\bigr)",
        "basis": "unspecified-parameter-function",
        "explanation": "Corollary 4.5 quantifies the genus and k-tuple parameters using functions C₁ and C₂. Its proof invokes the genus-transfer meta-theorem and a planar algorithm; a closed runtime in g,k is not printed. The general T+δ+2 composition is available but does not eliminate the unspecified control function.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
            "title": "Meta-Theorems for Cuttable Distributed Problems",
            "location": "Corollary 4.5 and Theorem 4.2"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound",
          "tex": "g"
        },
        {
          "symbol": "k",
          "description": "Required number of neighbors in the solution for each vertex outside it",
          "tex": "k"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-4688deea0bc7a8a63f32",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-b62bd2c4786d0cd69208"
        ],
        "assumptions": [
          "auto-assumption-eeaced0e93ae80d9fd33"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-eeaced0e93ae80d9fd33",
          "auto-graph-4688deea0bc7a8a63f32",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b54ac6401a901b9d3590",
          "auto-parameter-b62bd2c4786d0cd69208",
          "output-outside-k",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-bdgpsw26-connected",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Connected; Euler genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "O(√g + 1)",
      "rounds": "C(g)",
      "roundClass": "parameter",
      "parameters": "Fixed g.",
      "assumptions": "",
      "paperId": "gen-bdgpsw26",
      "theorem": "Section 4, after Corollary 4.5",
      "summary": "The paper states the more detailed bound 68√(3g/2) + O(1).",
      "verification": "primary",
      "sourceUrl": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
      "year": 2026,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "euler",
        "note": "Retain any connectivity condition stated by the source."
      },
      "graphClassSource": "Connected graphs of Euler genus ≤ g",
      "approximationDisplay": "O(√g + 1)",
      "roundsDisplay": "f(g)",
      "roundParameters": [
        {
          "symbol": "g",
          "name": "Euler genus",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "f(g)",
        "tex": "f\\bigl(g\\bigr)",
        "basis": "unspecified-parameter-function",
        "explanation": "The connected dominating set paragraph derives its approximation guarantee using the cited connected-domination reduction, but does not expand the round complexity of the composition as a formula in g. Its explicit O(sqrt(g)) approximation factor is not a runtime formula.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
            "title": "Meta-Theorems for Cuttable Distributed Problems",
            "location": "Section 4, connected dominating set application following Corollary 4.5"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound",
          "tex": "g"
        }
      ],
      "setting": {
        "summary": [
          "graph-connected-euler",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-2f1626f8ddeafbffccc4"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-2f1626f8ddeafbffccc4",
          "graph-connected-euler",
          "input-connected",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "gen-beks18-full-eps",
      "problem": "Vertex cover",
      "variant": "Weighted",
      "objective": "min",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "2 + ε",
      "rounds": "O(log Δ / log log Δ + log(1/ε) · log Δ / log² log Δ)",
      "roundClass": "degree",
      "parameters": "0 < ε < 1. Logs are truncated at constants; the source treats Δ ≤ 16 separately.",
      "assumptions": "Positive integer vertex weights W ≤ n^O(1). Every vertex knows Δ or an upper bound polynomial in Δ. This is the known-degree Theorem 2 implementation; no common bound on nW is needed unless rounding the result to exact factor 2.",
      "paperId": "gen-beks18",
      "theorem": "Theorem 2",
      "summary": "The full accuracy tradeoff improves the dependence on 1/ε from linear to logarithmic. The inverse-polylogarithmic-accuracy result is a specialization of this same algorithm.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/1804.01308v3#page=6",
      "year": 2018,
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "prerequisite": "Known Δ or a polynomial upper bound",
      "approximationDisplay": "2 + ε",
      "roundsDisplay": "O(log Δ / log log Δ + log(1/ε) · log Δ / log² log Δ)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log Δ / log log Δ + log(1/ε) · log Δ / log² log Δ)",
        "tex": "O\\!\\left(\\frac{\\log\\Delta}{\\log\\log\\Delta}+\\frac{\\log(1/\\varepsilon)\\,\\log\\Delta}{(\\log\\log\\Delta)^2}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/1804.01308v3#page=6",
            "title": "A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(log n log Δ / log² log Δ) Rounds",
            "location": "Theorem 2"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "General · full accuracy tradeoff",
        "setting": "Deterministic CONGEST; weighted vertex cover on general graphs; positive integer weights W≤n^O(1); known Δ or a polynomial upper bound; every ε∈(0,1), with all logarithms truncated as in the source. The complete Δ and ε round expression is retained.",
        "reason": "Theorem 2 gives the full logarithmic dependence on inverse accuracy and includes the inverse-polylogarithmic-accuracy corollary as the same protocol. Exact factor 2 and the anonymous n-independent weighted algorithm remain distinct tradeoffs; no optimal joint dependence on Δ and ε is claimed.",
        "evidenceUrl": "https://arxiv.org/pdf/1804.01308v3#page=6",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierComparisons": [
        {
          "better": "gen-beks19-full-eps",
          "worse": "gen-beks18-full-eps",
          "strict": [
            "rounds",
            "assumptions"
          ],
          "conditions": {
            "problem": "Both return an integral minimum-weight vertex-cover approximation on the original graph.",
            "graphClass": "Both apply to all general graphs.",
            "approximation": "The approximation ratio is identical for every allowed accuracy value; the exact-2 comparison has no additive loss.",
            "rounds": "Write x=log Δ and L=log(2/ε). The newer bound is O(x/log x+L+min{x,L x^0.001}); the older is O(x/log x+L x/(log x)^2). For sufficiently large x, x^0.001≤x/(log x)^2, so the new bound is no worse uniformly. For Δ=n and ε=1/n it is O(log n) instead of O(log² n/log² log n), giving a strict joint-parameter improvement. Bounded-degree cases are O(L) in both.",
            "model": "Both are deterministic CONGEST algorithms. The rank-two edge processors of the newer protocol are simulated with constant overhead.",
            "randomness": "Both are deterministic.",
            "benchmark": "The newer guarantee is at least as strong as the older integral-OPT benchmark. In the approximate case its proof also bounds cost against fractional OPT.",
            "assumptions": "Both use positive polynomially bounded integer weights. The older algorithm requires global Δ or a polynomial upper bound; the newer one can use local edge-degree bounds. No additional global input is introduced."
          },
          "evidenceUrl": "https://arxiv.org/pdf/1902.09377v2#page=9",
          "reason": "The 2019 full-accuracy family improves the 2018 joint round function, and removes the global-degree-knowledge requirement."
        }
      ],
      "dominatedBy": [
        "gen-beks19-full-eps"
      ],
      "frontierStatus": "dominated",
      "weightCondition": "weights-integer-polynomial",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "W",
          "description": "Upper bound on positive integer input vertex weights; polynomial in n",
          "tex": "W"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-integer-polynomial",
          "input-known-degree-bound"
        ],
        "parameters": [
          "auto-parameter-e2603d7d21b2cf13e04b"
        ],
        "assumptions": [],
        "detail": [
          "detail-no-nW-for-scheme"
        ],
        "covered": [
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-7f07455ff69b3b347e9b",
          "auto-parameter-e2603d7d21b2cf13e04b",
          "detail-no-nW-for-scheme",
          "input-known-degree-bound",
          "parameter-epsilon-positive",
          "parameter-epsilon-unit",
          "weights-integer-polynomial",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-beks19-full-eps",
      "problem": "Vertex cover",
      "variant": "Weighted",
      "objective": "min",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "2 + ε",
      "rounds": "O(log(2/ε) + log Δ / log log Δ + min{log Δ, log(2/ε) · (log Δ)^0.001})",
      "roundClass": "degree",
      "parameters": "0 < ε < 1; the analysis fixes γ=0.001. All logarithms are truncated at constants.",
      "assumptions": "Positive integer weights W ≤ n^O(1). Theorem 4.9 permits local degree bounds, so no global Δ is required. Instantiate rank f=2 and simulate each edge processor at its endpoints with constant communication overhead.",
      "paperId": "gen-beks19",
      "theorem": "Theorem 4.9 and the rank-two specialization in Section 1.2",
      "summary": "The complete accuracy tradeoff improves the older weighted-vertex-cover dependence on Δ and ε. This is an integral cover; the proof also bounds its cost against fractional OPT.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/1902.09377v2#page=9",
      "year": 2019,
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "approximationDisplay": "2 + ε",
      "roundsDisplay": "O(log(2/ε) + log Δ / log log Δ + min{log Δ, log(2/ε) · (log Δ)^0.001})",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log(2/ε) + log Δ / log log Δ + min{log Δ, log(2/ε) · (log Δ)^0.001})",
        "tex": "O\\!\\left(\\log(2/\\varepsilon)+\\frac{\\log\\Delta}{\\log\\log\\Delta}+\\min\\{\\log\\Delta,\\log(2/\\varepsilon)(\\log\\Delta)^{0.001}\\}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/1902.09377v2#page=9",
            "title": "Optimal Distributed Covering Algorithms",
            "location": "Theorem 4.9 and the rank-two specialization in Section 1.2"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "General · full accuracy / degree tradeoff",
        "setting": "Weighted vertex cover on general graphs; deterministic CONGEST; positive polynomially bounded integer weights; every ε∈(0,1). Rank f=2 uses a constant-overhead incidence simulation. The full displayed Δ and ε function is retained; a global degree bound is unnecessary.",
        "reason": "Theorem 4.9 improves the previous joint degree/accuracy tradeoff. For fixed accuracy it matches the degree lower bound. The complete function retains its tradeoff with anonymous exact-2 algorithms and with the separate logarithmic-round exact-2 point; no optimality for every accuracy exponent is asserted.",
        "evidenceUrl": "https://arxiv.org/pdf/1902.09377v2#page=9",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-integer-polynomial",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "W",
          "description": "Upper bound on positive integer input vertex weights; polynomial in n",
          "tex": "W"
        },
        {
          "symbol": "f",
          "description": "Rank of the simulated hypergraph instance, instantiated to two for vertex cover",
          "tex": "f"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "γ",
          "description": "Fixed analysis exponent instantiated to 0.001",
          "tex": "\\gamma"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-integer-polynomial"
        ],
        "parameters": [
          "auto-parameter-d2ade5a65ae03b5599fb"
        ],
        "assumptions": [],
        "detail": [
          "detail-rank-two-simulation",
          "strength-no-global-degree"
        ],
        "covered": [
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-7f07455ff69b3b347e9b",
          "auto-parameter-d2ade5a65ae03b5599fb",
          "detail-rank-two-simulation",
          "parameter-epsilon-positive",
          "parameter-epsilon-unit",
          "strength-no-global-degree",
          "weights-integer-polynomial",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "gen-beks19-exact2",
      "problem": "Vertex cover",
      "variant": "Weighted",
      "objective": "min",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "2",
      "rounds": "O(log n)",
      "roundClass": "logarithmic",
      "parameters": "Positive integer weights bounded by a polynomial in n.",
      "assumptions": "Positive integer weights W ≤ n^O(1). A common polynomial bound B ≥ nW is supplied for choosing the small accuracy needed for the exact-factor integrality step; knowing n and W suffices. The rank-two incidence protocol is simulated with constant overhead on the original graph. Global Δ is unnecessary.",
      "paperId": "gen-beks19",
      "theorem": "Corollary 4.10 with rank f=2",
      "summary": "Instantiating the hypergraph result at rank two gives an exact factor-two weighted vertex cover in logarithmic rounds.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/1902.09377v2#page=9",
      "year": 2019,
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "prerequisite": "Common polynomial bound B ≥ nW",
      "approximationDisplay": "2",
      "roundsDisplay": "O(log n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log n)",
        "tex": "O(\\log n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/1902.09377v2#page=9",
            "title": "Optimal Distributed Covering Algorithms",
            "location": "Corollary 4.10 with rank f=2"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "General · exact factor 2 · logarithmic",
        "setting": "Weighted vertex cover on general graphs; deterministic CONGEST; exact ratio 2 in O(log n) rounds; positive polynomially bounded integer weights and a common polynomial bound B≥nW for the integrality step. Rank f=2 uses a constant-overhead incidence simulation.",
        "reason": "Corollary 4.10 gives the logarithmic-round exact-2 point, improving the 2018 bound by removing its additional degree-dependent factor. Faster 2+ε guarantees do not dominate exact factor 2; anonymous degree/weight-dependent exact-2 algorithms remain a different tradeoff.",
        "evidenceUrl": "https://arxiv.org/pdf/1902.09377v2#page=9",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-integer-polynomial",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "B",
          "description": "Supplied common polynomial upper bound on nW for the exact-factor integrality step",
          "tex": "B"
        },
        {
          "symbol": "W",
          "description": "Upper bound on positive integer input vertex weights; polynomial in n",
          "tex": "W"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-integer-polynomial",
          "input-common-nW-bound"
        ],
        "parameters": [],
        "assumptions": [],
        "detail": [
          "detail-exact-integrality",
          "detail-rank-two-simulation",
          "strength-no-global-degree"
        ],
        "covered": [
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-7f07455ff69b3b347e9b",
          "detail-exact-integrality",
          "detail-rank-two-simulation",
          "input-common-nW-bound",
          "strength-no-global-degree",
          "weights-integer-polynomial",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "paperId": "gen-kmw16",
      "variant": "Unweighted; constant or polylogarithmic approximation",
      "objective": "min",
      "graphClass": "General",
      "model": "LOCAL",
      "randomization": "Randomized",
      "bound": "lower",
      "approximation": "Constant or polylogarithmic factor",
      "rounds": "Ω(min{√(log n / log log n), log Δ / log log Δ})",
      "roundClass": "other",
      "parameters": "n is the number of vertices; Δ is the maximum degree. The exponents in polylogarithmic factors are fixed.",
      "assumptions": "Also applies to deterministic algorithms. Randomized lower bound concerns expected approximation with a fixed worst-case round budget. There are hard graph families; n and Δ are coupled by the construction, so this is not a guarantee for every independently prescribed pair (n, Δ).",
      "verification": "primary",
      "year": 2016,
      "id": "gen-kmw16-vc-lower",
      "problem": "Vertex cover",
      "theorem": "Theorems 13 and 14 (arXiv v2, PDF pp.20–21)",
      "summary": "The lower bound permits randomized algorithms, identifiers in {1,…,n}, and knowledge of n, Δ and the unlabelled network topology.",
      "sourceUrl": "https://arxiv.org/pdf/1011.5470v2#page=21",
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "general"
      },
      "approximationDisplay": "Constant or polylogarithmic factor",
      "roundsDisplay": "Ω(min{√(log n / log log n), log Δ / log log Δ})",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Ω(min{√(log n / log log n), log Δ / log log Δ})",
        "tex": "\\Omega\\!\\left(\\min\\!\\left\\{\\sqrt{\\frac{\\log n}{\\log\\log n}},\\frac{\\log\\Delta}{\\log\\log\\Delta}\\right\\}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/1011.5470v2#page=21",
            "title": "Local Computation: Lower and Upper Bounds",
            "location": "Theorems 13 and 14 (arXiv v2, PDF pp.20–21)"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-df5e493698da1468cb3b"
        ],
        "assumptions": [
          "auto-assumption-8ab2eb4fd98dcdd8e53c"
        ],
        "detail": [
          "detail-lower-approximation-range"
        ],
        "covered": [
          "auto-assumption-8ab2eb4fd98dcdd8e53c",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-output-7f07455ff69b3b347e9b",
          "auto-parameter-df5e493698da1468cb3b",
          "detail-lower-approximation-range",
          "weights-unweighted"
        ]
      }
    },
    {
      "paperId": "gen-kmw16",
      "variant": "Unweighted; constant or polylogarithmic approximation",
      "objective": "min",
      "graphClass": "General",
      "model": "LOCAL",
      "randomization": "Randomized",
      "bound": "lower",
      "approximation": "Constant or polylogarithmic factor",
      "rounds": "Ω(min{√(log n / log log n), log Δ / log log Δ})",
      "roundClass": "other",
      "parameters": "n is the number of vertices; Δ is the maximum degree. The exponents in polylogarithmic factors are fixed.",
      "assumptions": "Also applies to deterministic algorithms. Randomized lower bound concerns expected approximation with a fixed worst-case round budget. There are hard graph families; n and Δ are coupled by the construction, so this is not a guarantee for every independently prescribed pair (n, Δ).",
      "verification": "primary",
      "year": 2016,
      "id": "gen-kmw16-mds-lower",
      "problem": "Dominating set",
      "theorem": "Theorem 15 and Corollary 16 (arXiv v2, PDF pp.21–23)",
      "summary": "A locality-preserving line-graph reduction transfers the vertex-cover lower bound to minimum dominating set.",
      "sourceUrl": "https://arxiv.org/pdf/1011.5470v2#page=22",
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "general"
      },
      "approximationDisplay": "Constant or polylogarithmic factor",
      "roundsDisplay": "Ω(min{√(log n / log log n), log Δ / log log Δ})",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Ω(min{√(log n / log log n), log Δ / log log Δ})",
        "tex": "\\Omega\\!\\left(\\min\\!\\left\\{\\sqrt{\\frac{\\log n}{\\log\\log n}},\\frac{\\log\\Delta}{\\log\\log\\Delta}\\right\\}\\right)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/1011.5470v2#page=22",
            "title": "Local Computation: Lower and Upper Bounds",
            "location": "Theorem 15 and Corollary 16 (arXiv v2, PDF pp.21–23)"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-df5e493698da1468cb3b"
        ],
        "assumptions": [
          "auto-assumption-8ab2eb4fd98dcdd8e53c"
        ],
        "detail": [
          "detail-lower-approximation-range"
        ],
        "covered": [
          "auto-assumption-8ab2eb4fd98dcdd8e53c",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-df5e493698da1468cb3b",
          "detail-lower-approximation-range",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-large-50-dom",
      "paperId": "pic-bgpw-large-2025",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "K₂,t-minor-free",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "50",
      "rounds": "Oₜ(1)",
      "roundClass": "parameter",
      "parameters": "Fixed integer t ≥ 2.",
      "assumptions": "Distinct identifiers.",
      "theorem": "Theorem 4.1",
      "summary": "Ratio independent of t.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2504.01091v2",
      "year": 2025,
      "relatedResults": [
        "pic-thesis-pw2-dom"
      ],
      "algorithmFamily": "local-cutting-dominating-set-algorithm5",
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "k2t"
      },
      "graphClassSource": "K₂,ₜ-minor-free",
      "approximationDisplay": "50",
      "roundsDisplay": "O(t)",
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(t)",
        "tex": "O(t)",
        "basis": "stated",
        "explanation": "The original paper states Oₜ(1), while the thesis explicitly analyzes the same Algorithm 5 in O(t) rounds. It chooses the class control function F_t(r)=(5r+18)t; the remaining residual-diameter term is linear in t. The printed composition is 3 max{F_t(5)+2,F_t(11)+5}+g(t)+3, with g linear. This is an asymptotic bound, not a fully specified exact round count.",
        "evidence": [
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=125",
            "title": "Timothé Picavet’s doctoral thesis",
            "location": "Chapter IV, Theorem IV.3.1 and following explicit linear-in-t runtime analysis (PDF p. 125)"
          },
          {
            "url": "https://arxiv.org/html/2504.01091v2",
            "title": "Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors",
            "location": "Theorem 4.1, Lemma 4.2 and following runtime composition"
          }
        ],
        "parameters": [
          {
            "symbol": "t",
            "description": "Size of the second bipartition class of the excluded minor K₂,t; fixed integer t≥2",
            "tex": "t"
          }
        ],
        "checked": "2026-11-16",
        "audited": true,
        "displayInTable": true
      },
      "sota": {
        "scopeLabel": "Ratio independent of t; t ≥ 49",
        "setting": "Unweighted minimum dominating set on K₂,t-minor-free graphs; deterministic LOCAL; factor 50 against the integral optimum; round complexity O(t) independent of n for fixed t. The approximation ratio is independent of t.",
        "reason": "The original factor-50 Algorithm 5 applies for all fixed t≥2 and has O(t) rounds by the thesis’s explicit runtime analysis on PDF p. 125. Its historical SOTA review concerns t≥49, where the newer t+2 factor exceeds 50. It is now covered by the broader pathwidth-two excluded-minor theorem, using the certified identical H=K₂,t configuration and runtime. Smaller-t tradeoffs and original source provenance remain available.",
        "evidenceUrl": "https://arxiv.org/html/2504.01091v2",
        "checked": "2026-11-16",
        "conditionIds": [
          "claim-t-ge49"
        ]
      },
      "frontierComparisons": [
        {
          "better": "pic-thesis-pw2-dom",
          "worse": "pic-large-50-dom",
          "kind": "family-extension",
          "algorithmSpecialization": "algorithm5-k2t-specialization",
          "strict": [
            "graphClass"
          ],
          "parameterSubstitution": "H=K₂,t",
          "conditions": {
            "problem": "The same unweighted minimum dominating-set output and minimization objective.",
            "graphClass": "The broader parameterized theorem permits every fixed excluded H with pw(H)≤2; H=K₂,t recovers the original setting for every t≥2. Strictness concerns the family of allowed excluded-minor settings, not an arbitrary pair of fixed H and t. For example, H=C₅ has pathwidth two and its minor-free class contains K₂,s for arbitrarily large s; it is not contained in any fixed K₂,t-minor-free class.",
            "approximation": "The same factor 50, independent of the excluded graph parameter.",
            "rounds": "On H=K₂,t use the certified identical Algorithm 5 configuration and original O(t) communication schedule. The generic H-dependent proof bound is not compared with that schedule.",
            "model": "The same LOCAL communication model.",
            "randomness": "The same deterministic procedure.",
            "benchmark": "The same integral optimum.",
            "assumptions": "The same distinct identifiers and fixed excluded-minor setting; the original control function and radii are used on the mapped branch."
          },
          "evidenceUrl": "https://timothepicavet.fr/others/thesis.pdf#page=204",
          "reason": "Covered by the broader theorem: the K₂,t setting is the H=K₂,t branch of the same Algorithm 5 family, with the same O(t) implementation. The improvement is the larger family of excluded-minor settings, not faster rounds."
        }
      ],
      "dominatedBy": [
        "pic-thesis-pw2-dom"
      ],
      "frontierStatus": "dominated",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "t",
          "description": "Size of the second bipartition class of the excluded minor K₂,t; fixed integer t≥2",
          "tex": "t"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-bb37704c123e99aa335b",
          "weights-unweighted",
          "parameter-fixed-t-ge2"
        ],
        "parameters": [],
        "assumptions": [
          "auto-assumption-546f9427a7eb5183892d"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-546f9427a7eb5183892d",
          "auto-graph-bb37704c123e99aa335b",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "parameter-fixed-t-ge2",
          "parameter-t-integer-ge1",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-large-50-vc",
      "paperId": "pic-bgpw-large-2025",
      "problem": "Vertex cover",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "K₂,t-minor-free",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "50",
      "rounds": "Oₜ(1)",
      "roundClass": "parameter",
      "parameters": "Fixed integer t ≥ 2.",
      "assumptions": "",
      "theorem": "Theorem 4.1; extension after Theorem 4.3",
      "summary": "Ratio independent of t.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2504.01091v2",
      "year": 2025,
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "k2t"
      },
      "graphClassSource": "K₂,ₜ-minor-free",
      "approximationDisplay": "50",
      "roundsDisplay": "O(t)",
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(t)",
        "tex": "O(t)",
        "basis": "derived-from-stated-extension",
        "explanation": "The vertex-cover extension keeps the same local-cut radius, replacing interesting local 2-cuts by all local 2-cuts. Combining this unchanged radius and residual exploration with the thesis’s linear-in-t analysis gives O(t) rounds. This is derived from the stated extension; no exact integer total is claimed.",
        "evidence": [
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=125",
            "title": "Timothé Picavet’s doctoral thesis",
            "location": "Chapter IV, Theorem IV.3.1 and following explicit linear-in-t runtime analysis (PDF p. 125)"
          },
          {
            "url": "https://arxiv.org/html/2504.01091v2",
            "title": "Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors",
            "location": "Extension after Theorem 4.3; same local-cut radius"
          },
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=126",
            "title": "Timothé Picavet’s doctoral thesis",
            "location": "Vertex-cover extension following Theorem IV.3.3 (PDF p. 126)"
          }
        ],
        "parameters": [
          {
            "symbol": "t",
            "description": "Size of the second bipartition class of the excluded minor K₂,t; fixed integer t≥2",
            "tex": "t"
          }
        ],
        "checked": "2026-11-16",
        "audited": true,
        "displayInTable": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "t",
          "description": "Size of the second bipartition class of the excluded minor K₂,t; fixed integer t≥2",
          "tex": "t"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-bb37704c123e99aa335b",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-84a9fcdebc259dfe7099"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-bb37704c123e99aa335b",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-7f07455ff69b3b347e9b",
          "auto-parameter-84a9fcdebc259dfe7099",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-large-linear-dom",
      "paperId": "pic-bgpw-large-2025",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "K₂,t-minor-free",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "2t − 1",
      "rounds": "3",
      "roundClass": "constant",
      "parameters": "Integer t ≥ 2; rounds independent of t.",
      "assumptions": "",
      "theorem": "Theorem 4.4",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2504.01091v2",
      "year": 2025,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "k2t"
      },
      "graphClassSource": "K₂,ₜ-minor-free",
      "approximationDisplay": "2t − 1",
      "roundsDisplay": "3",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "3",
        "tex": "3",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2504.01091v2",
            "title": "Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors",
            "location": "Theorem 4.4"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "t",
          "description": "Size of the second bipartition class of the excluded minor K_{2,t}",
          "tex": "t"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-bb37704c123e99aa335b",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-a76c57eac2fe51c6e0c3"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-bb37704c123e99aa335b",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-a76c57eac2fe51c6e0c3",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-large-linear-vc",
      "paperId": "pic-bgpw-large-2025",
      "problem": "Vertex cover",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "K₂,t-minor-free",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "t",
      "rounds": "3",
      "roundClass": "constant",
      "parameters": "Integer t ≥ 2; rounds independent of t.",
      "assumptions": "",
      "theorem": "Theorem 4.4",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2504.01091v2",
      "year": 2025,
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "k2t"
      },
      "graphClassSource": "K₂,ₜ-minor-free",
      "approximationDisplay": "t",
      "roundsDisplay": "3",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "3",
        "tex": "3",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2504.01091v2",
            "title": "Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors",
            "location": "Theorem 4.4"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "t",
          "description": "Size of the second bipartition class of the excluded minor K_{2,t}",
          "tex": "t"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-bb37704c123e99aa335b",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-a76c57eac2fe51c6e0c3"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-bb37704c123e99aa335b",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-7f07455ff69b3b347e9b",
          "auto-parameter-a76c57eac2fe51c6e0c3",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-nice-planar-uniform",
      "paperId": "pic-bgpw-nice-2025",
      "problem": "Dominating set",
      "variant": "Unweighted; 4-uniform guarantee",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "302",
      "rounds": "5",
      "roundClass": "constant",
      "parameters": "",
      "assumptions": "",
      "theorem": "Proposition 5",
      "summary": "Uniformity supports transfer to other graph classes.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2507.04960v1",
      "year": 2025,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "302",
      "roundsDisplay": "5",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "5",
        "tex": "5",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2507.04960v1",
            "title": "Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs",
            "location": "Proposition 5"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [],
        "assumptions": [],
        "detail": [
          "detail-four-uniform"
        ],
        "covered": [
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "detail-four-uniform",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-nice-localgenus",
      "paperId": "pic-bgpw-nice-2025",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Asymptotic dimension d; radius-r balls of Euler genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "35(d + 1)",
      "rounds": "C(d,g,r)",
      "roundClass": "parameter",
      "parameters": "Fixed d,g,r and dimensional control function; r sufficiently large.",
      "assumptions": "Every radius-r induced ball lies in the Euler-genus-g class.",
      "theorem": "Theorem 8",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2507.04960v1",
      "year": 2025,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "local-genus",
        "note": "Asymptotic dimension, its control function and sufficiently large local radius remain fixed prerequisites."
      },
      "graphClassSource": "Asymptotic dimension d; sufficiently large-radius neighborhoods of Euler genus ≤ g",
      "approximationDisplay": "35(d + 1)",
      "roundsDisplay": "f(d, g, r)",
      "roundParameters": [
        {
          "symbol": "d",
          "name": "asymptotic dimension",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "g",
          "name": "local genus",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "r",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "partial",
        "formula": "T + δ + 2, where T = F(2u+2) + max{u+1, b}",
        "tex": "T+\\delta+2,\\qquad T=F(2u+2)+\\max\\{u+1,b\\}",
        "basis": "stated-composition",
        "explanation": "Theorem 8 gives a class-dependent constant and applies Proposition 2 to Theorem 7. Proposition 3 does give a precise generic composition, but the dimensional control function and the genus base runtime are not reduced to closed expressions in the displayed parameters. The local-genus row therefore has no computed full formula to substitute for f(d,g,r).",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2507.04960v1",
            "title": "Approximation Algorithms for Dominating Set on Locally Nice Graph Classes",
            "location": "Proposition 3; Theorems 7 and 8; Claim 4"
          }
        ],
        "parameters": [
          {
            "symbol": "T",
            "description": "Intermediate algorithm radius from the displayed composition",
            "tex": "T"
          },
          {
            "symbol": "δ",
            "description": "Upper bound on weak diameters of the local error components",
            "tex": "\\delta"
          },
          {
            "symbol": "F",
            "description": "Dimensional control function of the target graph class",
            "tex": "F"
          },
          {
            "symbol": "u",
            "description": "Uniformity radius of the base algorithm",
            "tex": "u"
          },
          {
            "symbol": "b",
            "description": "Round complexity of the base algorithm",
            "tex": "b"
          }
        ],
        "checked": "2026-11-16",
        "audited": true,
        "expression": {
          "formula": "T + δ + 2",
          "tex": "T+\\delta+2"
        },
        "suffix": {
          "formula": ", where T = F(2u+2) + max{u+1, b}",
          "tex": ",\\qquad T=F(2u+2)+\\max\\{u+1,b\\}"
        }
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "F",
          "description": "Dimensional control function of the target graph class",
          "tex": "F"
        },
        {
          "symbol": "T",
          "description": "Intermediate algorithm radius from the displayed composition",
          "tex": "T"
        },
        {
          "symbol": "b",
          "description": "Round complexity of the base algorithm",
          "tex": "b"
        },
        {
          "symbol": "d",
          "description": "Asymptotic dimension bound of the graph class",
          "tex": "d"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound for the radius-r balls after any stated apex deletions",
          "tex": "g"
        },
        {
          "symbol": "r",
          "description": "Fixed sufficiently large radius of the neighborhoods used in the local-class assumption",
          "tex": "r"
        },
        {
          "symbol": "u",
          "description": "Uniformity radius of the base algorithm",
          "tex": "u"
        },
        {
          "symbol": "δ",
          "description": "Upper bound on weak diameters of the local error components",
          "tex": "\\delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-cc88dac74423991e2fb4",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-9e294b6fa3a897ed9cf2"
        ],
        "assumptions": [
          "auto-assumption-366645571a60ecd2fcf3"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-366645571a60ecd2fcf3",
          "auto-graph-cc88dac74423991e2fb4",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-9e294b6fa3a897ed9cf2",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-kdom-genus-constant",
      "paperId": "pic-chww-kdom-2017",
      "problem": "k-domination (outside the solution)",
      "variant": "k neighbors required only outside the solution",
      "objective": "min",
      "graphClass": "Orientable genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "Oₖ,𝗀(1)",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "Fixed k ≥ 2 and g.",
      "assumptions": "",
      "theorem": "Corollary 3",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://ceur-ws.org/Vol-1949/ICTCSpaper05.pdf",
      "year": 2017,
      "problemScope": {
        "node": "outside-k-domination"
      },
      "problemParameter": "k",
      "problemParameterName": "required neighbors outside the solution",
      "problemSource": "k-tuple dominating set",
      "graphScope": {
        "node": "orientable",
        "note": "The historical record does not establish applicability to every bounded Euler-genus family."
      },
      "approximationDisplay": "f(g, k)",
      "roundsDisplay": "≤ 2",
      "approximationParameters": [
        {
          "symbol": "g",
          "name": "orientable genus",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "k",
          "name": "domination multiplicity",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundCountEvidence": {
        "basis": "phase-count",
        "explanation": "Round 1 obtains the local degree if necessary and tests the threshold L. Round 2 exchanges threshold-membership flags; every unselected vertex with fewer than k selected neighbors then selects itself. The fixed parameters g and k determine L through local computation. The approximation factor depends on them, while this communication bound does not.",
        "evidence": [
          {
            "url": "https://ceur-ws.org/Vol-1949/ICTCSpaper05.pdf#page=5",
            "title": "Primary source algorithm",
            "location": "Procedure 1 PDF p. 5; Corollary 3 p. 6"
          }
        ],
        "rounds": "≤ 2",
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "≤ 2",
        "tex": "\\le 2",
        "basis": "phase-count",
        "explanation": "Round 1 obtains the local degree if necessary and tests the threshold L. Round 2 exchanges threshold-membership flags; every unselected vertex with fewer than k selected neighbors then selects itself. The fixed parameters g and k determine L through local computation. The approximation factor depends on them, while this communication bound does not.",
        "evidence": [
          {
            "url": "https://ceur-ws.org/Vol-1949/ICTCSpaper05.pdf#page=5",
            "title": "Primary source algorithm",
            "location": "Procedure 1 PDF p. 5; Corollary 3 p. 6"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Orientable genus upper bound",
          "tex": "g",
          "sourceSymbol": "𝗀"
        },
        {
          "symbol": "k",
          "description": "Required number of neighbors in the solution for each vertex outside it",
          "tex": "k"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-924a81ff2b56320e8d33",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-b6e4f4217a140a655edf"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-924a81ff2b56320e8d33",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b54ac6401a901b9d3590",
          "auto-parameter-b6e4f4217a140a655edf",
          "output-outside-k",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-kdom-linkless-constant",
      "paperId": "pic-chww-kdom-2017",
      "problem": "k-domination (outside the solution)",
      "variant": "k neighbors required only outside the solution",
      "objective": "min",
      "graphClass": "Linklessly embeddable",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "Oₖ(1)",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "Fixed k ≥ 3.",
      "assumptions": "",
      "theorem": "Corollary 2",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://ceur-ws.org/Vol-1949/ICTCSpaper05.pdf",
      "year": 2017,
      "problemScope": {
        "node": "outside-k-domination"
      },
      "problemParameter": "k",
      "problemParameterName": "required neighbors outside the solution",
      "problemSource": "k-tuple dominating set",
      "graphScope": {
        "node": "linkless"
      },
      "approximationDisplay": "f(k)",
      "roundsDisplay": "≤ 2",
      "approximationParameters": [
        {
          "symbol": "k",
          "name": "domination multiplicity",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundCountEvidence": {
        "basis": "phase-count",
        "explanation": "The same threshold procedure uses at most two rounds: obtain the local degree if necessary, then exchange selection flags and add vertices with fewer than k selected neighbors. The source uses fixed k ≥ 3 and h = 4. These parameters affect the local threshold and approximation factor, not the number of rounds.",
        "evidence": [
          {
            "url": "https://ceur-ws.org/Vol-1949/ICTCSpaper05.pdf#page=5",
            "title": "Primary source algorithm",
            "location": "Procedure 1 PDF p. 5; Corollary 2 p. 6"
          }
        ],
        "rounds": "≤ 2",
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "≤ 2",
        "tex": "\\le 2",
        "basis": "phase-count",
        "explanation": "The same threshold procedure uses at most two rounds: obtain the local degree if necessary, then exchange selection flags and add vertices with fewer than k selected neighbors. The source uses fixed k ≥ 3 and h = 4. These parameters affect the local threshold and approximation factor, not the number of rounds.",
        "evidence": [
          {
            "url": "https://ceur-ws.org/Vol-1949/ICTCSpaper05.pdf#page=5",
            "title": "Primary source algorithm",
            "location": "Procedure 1 PDF p. 5; Corollary 2 p. 6"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "k",
          "description": "Required number of neighbors in the solution for each vertex outside it",
          "tex": "k"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-1c8015ba8785f64fced9",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-b8fdbb33beabe4183121"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-1c8015ba8785f64fced9",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b54ac6401a901b9d3590",
          "auto-parameter-b8fdbb33beabe4183121",
          "output-outside-k",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-kdom-topological44",
      "paperId": "pic-chww-kdom-2017",
      "problem": "2-domination (outside the solution)",
      "variant": "k neighbors required only outside the solution",
      "objective": "min",
      "graphClass": "No K₄,₄ subdivision",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "O(1)",
      "rounds": "O(1)",
      "roundClass": "constant",
      "parameters": "k = 2.",
      "assumptions": "",
      "theorem": "Theorem 7",
      "summary": "Includes linklessly embeddable graphs.",
      "verification": "primary",
      "sourceUrl": "https://ceur-ws.org/Vol-1949/ICTCSpaper05.pdf",
      "year": 2017,
      "problemScope": {
        "node": "outside-k-domination"
      },
      "problemParameter": "2",
      "problemParameterName": "required neighbors outside the solution",
      "problemSource": "k-tuple dominating set",
      "graphScope": {
        "node": "no-k44"
      },
      "graphClassSource": "No subdivision of K₄,₄",
      "approximationDisplay": "Constant",
      "roundsDisplay": "≤ 6",
      "roundCountEvidence": {
        "basis": "phase-count",
        "explanation": "Rounds 1–2 obtain neighbor lists and decide D1 by radius-two information. Round 3 broadcasts D1; compute two-domination flags Z. Round 4 broadcasts Z; compute residual open-neighborhood degrees. Round 5 broadcasts these degrees; vertices outside Z choose one or two neighbors as prescribed. Round 6 notifies the chosen neighbors. Distinct IDs in the source LOCAL model; unbounded messages. All thresholds are fixed numerical constants for excluded TK4,4.",
        "evidence": [
          {
            "url": "https://ceur-ws.org/Vol-1949/ICTCSpaper05.pdf#page=6",
            "title": "Primary source algorithm",
            "location": "Procedure 2 PDF p. 6; radius-two remark p. 7; Theorem 7 p. 8"
          }
        ],
        "rounds": "≤ 6",
        "checked": "2026-11-16"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "≤ 6",
        "tex": "\\le 6",
        "basis": "phase-count",
        "explanation": "Rounds 1–2 obtain neighbor lists and decide D1 by radius-two information. Round 3 broadcasts D1; compute two-domination flags Z. Round 4 broadcasts Z; compute residual open-neighborhood degrees. Round 5 broadcasts these degrees; vertices outside Z choose one or two neighbors as prescribed. Round 6 notifies the chosen neighbors. Distinct IDs in the source LOCAL model; unbounded messages. All thresholds are fixed numerical constants for excluded TK4,4.",
        "evidence": [
          {
            "url": "https://ceur-ws.org/Vol-1949/ICTCSpaper05.pdf#page=6",
            "title": "Primary source algorithm",
            "location": "Procedure 2 PDF p. 6; radius-two remark p. 7; Theorem 7 p. 8"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "2",
          "description": "Required neighbors outside the solution",
          "tex": "2"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-f0d82e6adc6c5f65d541",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-cd4920bb34139c49b8f8"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-f0d82e6adc6c5f65d541",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-ef1b974b591df8f63ec3",
          "auto-parameter-cd4920bb34139c49b8f8",
          "output-outside-k",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-kdom-genus-ptas",
      "paperId": "pic-chww-kdom-2017",
      "problem": "k-domination (outside the solution)",
      "variant": "k neighbors required only outside the solution",
      "objective": "min",
      "graphClass": "Orientable genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "Oₖ,𝗀,ε(log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed k ≥ 2, g and ε > 0.",
      "assumptions": "",
      "theorem": "Corollary 11",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://ceur-ws.org/Vol-1949/ICTCSpaper05.pdf",
      "year": 2017,
      "problemScope": {
        "node": "outside-k-domination"
      },
      "problemParameter": "k",
      "problemParameterName": "required neighbors outside the solution",
      "problemSource": "k-tuple dominating set",
      "graphScope": {
        "node": "orientable",
        "note": "The historical record does not establish applicability to every bounded Euler-genus family."
      },
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "Oₖ,𝗀,ε(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Oₖ,𝗀,ε(log* n)",
        "tex": "O_{k,g,\\varepsilon}(\\log^*n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://ceur-ws.org/Vol-1949/ICTCSpaper05.pdf",
            "title": "Distributed approximation algorithms for k-dominating set in graphs of bounded genus and linklessly embeddable graphs",
            "location": "Corollary 11"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "g",
          "description": "Orientable genus upper bound",
          "tex": "g",
          "sourceSymbol": "𝗀"
        },
        {
          "symbol": "k",
          "description": "Required number of neighbors in the solution for each vertex outside it",
          "tex": "k"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-924a81ff2b56320e8d33",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-741134fe129c5a0fa776"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-924a81ff2b56320e8d33",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b54ac6401a901b9d3590",
          "auto-parameter-741134fe129c5a0fa776",
          "output-outside-k",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-kdom-linkless-ptas",
      "paperId": "pic-chww-kdom-2017",
      "problem": "k-domination (outside the solution)",
      "variant": "k neighbors required only outside the solution",
      "objective": "min",
      "graphClass": "Linklessly embeddable",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "Oₖ,ε(log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed k ≥ 2 and ε > 0.",
      "assumptions": "",
      "theorem": "Corollary 12",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://ceur-ws.org/Vol-1949/ICTCSpaper05.pdf",
      "year": 2017,
      "problemScope": {
        "node": "outside-k-domination"
      },
      "problemParameter": "k",
      "problemParameterName": "required neighbors outside the solution",
      "problemSource": "k-tuple dominating set",
      "graphScope": {
        "node": "linkless"
      },
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "Oₖ,ε(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Oₖ,ε(log* n)",
        "tex": "O_{k,\\varepsilon}(\\log^*n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://ceur-ws.org/Vol-1949/ICTCSpaper05.pdf",
            "title": "Distributed approximation algorithms for k-dominating set in graphs of bounded genus and linklessly embeddable graphs",
            "location": "Corollary 12"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "k",
          "description": "Required number of neighbors in the solution for each vertex outside it",
          "tex": "k"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-1c8015ba8785f64fced9",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-a5230659d3c4bcfedc87"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-1c8015ba8785f64fced9",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b54ac6401a901b9d3590",
          "auto-parameter-a5230659d3c4bcfedc87",
          "output-outside-k",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-genus-broadcast-historical",
      "paperId": "pic-chww-broadcast-2019",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Orientable genus ≤ g",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "O𝗀(1)",
      "rounds": "10",
      "roundClass": "constant",
      "parameters": "Fixed g.",
      "assumptions": "CONGEST_BC: each vertex broadcasts the same O(log n)-bit message to neighbors.",
      "theorem": "Abstract; Lemma 10",
      "summary": "Publisher text specifies ten rounds.",
      "verification": "primary",
      "sourceUrl": "https://www.sciencedirect.com/science/article/pii/S0304397518304894",
      "year": 2019,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "orientable",
        "note": "The historical record does not establish applicability to every bounded Euler-genus family."
      },
      "graphClassSource": "Bounded orientable genus g",
      "approximationDisplay": "f(g)",
      "roundsDisplay": "10",
      "approximationParameters": [
        {
          "symbol": "g",
          "name": "orientable genus",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "10",
        "tex": "10",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://www.sciencedirect.com/science/article/pii/S0304397518304894",
            "title": "Distributed CONGEST_BC constant approximation of MDS in bounded genus graphs",
            "location": "Abstract; Lemma 10"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Orientable genus upper bound",
          "tex": "g",
          "sourceSymbol": "𝗀"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-924a81ff2b56320e8d33",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-2f1626f8ddeafbffccc4"
        ],
        "assumptions": [
          "auto-assumption-6b02bb84a23eb80caedf"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-6b02bb84a23eb80caedf",
          "auto-graph-924a81ff2b56320e8d33",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-2f1626f8ddeafbffccc4",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-girth-dom-2019",
      "paperId": "pic-aw-girth-2019",
      "problem": "Distance-r dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Expansion f; girth ≥ 4r + 3",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "O(r f(r))",
      "rounds": "O(r)",
      "roundClass": "parameter",
      "parameters": "Fixed radius r and expansion function f.",
      "assumptions": "",
      "theorem": "Theorem 1",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/1910.02794",
      "year": 2019,
      "problemScope": {
        "node": "distance-dominating-set"
      },
      "problemParameter": "r",
      "problemParameterName": "distance radius",
      "problemSource": "Distance dominating set",
      "graphScope": {
        "node": "girth-expansion",
        "note": "The girth threshold remains required for the stated distance parameter."
      },
      "approximationDisplay": "O(r f(r))",
      "roundsDisplay": "O(r)",
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(r)",
        "tex": "O(r)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/1910.02794",
            "title": "Distributed Distance-r Dominating Set on Sparse High-Girth Graphs",
            "location": "Theorem 1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f(r)",
          "description": "Upper bound on the edge-to-vertex ratio after deleting vertices and contracting disjoint subgraphs of the stated radius",
          "tex": "f(r)"
        },
        {
          "symbol": "f",
          "description": "Expansion function bounding edge-to-vertex ratios after bounded-radius contractions",
          "tex": "f"
        },
        {
          "symbol": "r",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "r"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-2c2b44d50352f53722f0",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-0bb6a4815f4c4715a933"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-2c2b44d50352f53722f0",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-4bc26b2a562297a647e1",
          "auto-parameter-0bb6a4815f4c4715a933",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-girth-cycle-lower",
      "paperId": "pic-aw-girth-2019",
      "problem": "Distance-r dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Cycles of length at least 4r + 3",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "approximation": "No (2r + 1 − δ)-approximation",
      "rounds": "O(r)",
      "roundClass": "parameter",
      "parameters": "Fixed ε > 0; r > 1 and r = o(log* n).",
      "assumptions": "For fixed r this excludes constant-round algorithms.",
      "theorem": "Theorem 2",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/1910.02794",
      "year": 2019,
      "roundBudgetExcluded": true,
      "problemScope": {
        "node": "distance-dominating-set"
      },
      "problemParameter": "r",
      "problemParameterName": "distance radius",
      "problemSource": "Distance dominating set",
      "graphScope": {
        "node": "long-cycle"
      },
      "notationChanges": [
        {
          "name": "accuracy",
          "sourceSymbol": "δ",
          "symbol": "ε"
        }
      ],
      "parametersSource": "Fixed δ > 0; r > 1 and r = o(log* n).",
      "approximationDisplay": "> 2r + 1 − ε",
      "roundsDisplay": "O(r)",
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(r)",
        "tex": "O(r)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/1910.02794",
            "title": "Distributed Distance-r Dominating Set on Sparse High-Girth Graphs",
            "location": "Theorem 2"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "long-cycle-distance-factor",
          "resultId": "pic-girth-cycle-lower",
          "graphs": [
            "long-cycle"
          ],
          "problems": [
            "distance-dominating-set"
          ],
          "models": [
            "LOCAL",
            "CONGEST"
          ],
          "conditionIds": [
            "scope-radius-r-sublogstar"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "r"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-5bf5bfc6dd710f349d27",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-8f111cac3e93af500567"
        ],
        "assumptions": [
          "auto-assumption-021b0a56919f5f4e6bfb"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-021b0a56919f5f4e6bfb",
          "auto-graph-5bf5bfc6dd710f349d27",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-4bc26b2a562297a647e1",
          "auto-parameter-8f111cac3e93af500567",
          "scope-radius-r-sublogstar",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-girth-cover-dom",
      "paperId": "pic-aw-covering-2022",
      "problem": "Distance-r dominating set",
      "variant": "Distance r",
      "objective": "min",
      "graphClass": "Bounded expansion; girth ≥ 4r + 2",
      "model": "CONGEST",
      "randomization": "Unspecified",
      "bound": "upper",
      "approximation": "O(1)",
      "rounds": "O(1)",
      "roundClass": "parameter",
      "parameters": "Fixed r and graph class.",
      "assumptions": "Abstract-level record; see paper for problem definitions.",
      "theorem": "Abstract",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://www.sciencedirect.com/science/article/pii/S0304397522000081",
      "year": 2022,
      "problemScope": {
        "node": "distance-dominating-set"
      },
      "problemParameter": "r",
      "problemParameterName": "distance radius",
      "problemSource": "Distance dominating set",
      "graphScope": {
        "node": "girth-expansion",
        "note": "The girth threshold remains required for the stated distance parameter."
      },
      "approximationDisplay": "F(r, f)",
      "roundsDisplay": "F(r, f)",
      "approximationParameters": [
        {
          "symbol": "r",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "f",
          "name": "expansion function",
          "introduced": false,
          "displaySymbol": true
        }
      ],
      "roundParameters": [
        {
          "symbol": "r",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "f",
          "name": "expansion function",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "F(r, f)",
        "tex": "F\\bigl(r,f\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://www.sciencedirect.com/science/article/pii/S0304397522000081",
            "title": "Distributed distance-r covering problems on sparse high-girth graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "F",
          "description": "Unspecified function of the displayed parameters",
          "tex": "F"
        },
        {
          "symbol": "f",
          "description": "Expansion function bounding shallow-minor edge densities at each radius",
          "tex": "f",
          "sourceSymbol": "class"
        },
        {
          "symbol": "r",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "r"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-915afc773f0aa3fac5c2",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-af57e23573dcc3ca99da"
        ],
        "assumptions": [
          "auto-assumption-1438241cdaf269b6f219"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-1438241cdaf269b6f219",
          "auto-graph-915afc773f0aa3fac5c2",
          "auto-model-37b353da5fa68eebd709",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-4bc26b2a562297a647e1",
          "auto-parameter-af57e23573dcc3ca99da",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-girth-cover-connected-dom",
      "paperId": "pic-aw-covering-2022",
      "problem": "Connected distance-r dominating set",
      "variant": "Distance-r connected domination",
      "objective": "min",
      "graphClass": "Bounded expansion; girth ≥ 4r + 2",
      "model": "CONGEST",
      "randomization": "Unspecified",
      "bound": "upper",
      "approximation": "O(1)",
      "rounds": "O(1)",
      "roundClass": "parameter",
      "parameters": "Fixed r and graph class.",
      "assumptions": "Abstract-level record; see paper for problem definitions.",
      "theorem": "Abstract",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://www.sciencedirect.com/science/article/pii/S0304397522000081",
      "year": 2022,
      "problemScope": {
        "node": "connected-distance-dominating-set"
      },
      "problemParameter": "r",
      "problemParameterName": "distance radius",
      "problemSource": "Connected dominating set",
      "graphScope": {
        "node": "girth-expansion",
        "note": "The girth threshold remains required for the stated distance parameter."
      },
      "approximationDisplay": "F(r, f)",
      "roundsDisplay": "F(r, f)",
      "approximationParameters": [
        {
          "symbol": "r",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "f",
          "name": "expansion function",
          "introduced": false,
          "displaySymbol": true
        }
      ],
      "roundParameters": [
        {
          "symbol": "r",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "f",
          "name": "expansion function",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "F(r, f)",
        "tex": "F\\bigl(r,f\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://www.sciencedirect.com/science/article/pii/S0304397522000081",
            "title": "Distributed distance-r covering problems on sparse high-girth graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "F",
          "description": "Unspecified function of the displayed parameters",
          "tex": "F"
        },
        {
          "symbol": "f",
          "description": "Expansion function bounding shallow-minor edge densities at each radius",
          "tex": "f",
          "sourceSymbol": "class"
        },
        {
          "symbol": "r",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "r"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-915afc773f0aa3fac5c2",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-af57e23573dcc3ca99da"
        ],
        "assumptions": [
          "auto-assumption-1438241cdaf269b6f219"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-1438241cdaf269b6f219",
          "auto-graph-915afc773f0aa3fac5c2",
          "auto-model-37b353da5fa68eebd709",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-f0d9c1f064503cf5f16e",
          "auto-parameter-af57e23573dcc3ca99da",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-girth-cover-vc",
      "paperId": "pic-aw-covering-2022",
      "problem": "Distance-r vertex cover",
      "variant": "",
      "objective": "min",
      "graphClass": "Bounded expansion; girth ≥ 4r + 2",
      "model": "CONGEST",
      "randomization": "Unspecified",
      "bound": "upper",
      "approximation": "O(1)",
      "rounds": "O(1)",
      "roundClass": "parameter",
      "parameters": "Fixed r and graph class.",
      "assumptions": "Abstract-level record; see paper for problem definitions.",
      "theorem": "Abstract",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://www.sciencedirect.com/science/article/pii/S0304397522000081",
      "year": 2022,
      "problemSource": "Vertex cover",
      "variantSource": "Distance-r vertex cover",
      "problemScope": {
        "node": "distance-vertex-cover"
      },
      "problemParameter": "r",
      "problemParameterName": "distance radius",
      "graphScope": {
        "node": "girth-expansion",
        "note": "The girth threshold remains required for the stated distance parameter."
      },
      "approximationDisplay": "F(r, f)",
      "roundsDisplay": "F(r, f)",
      "approximationParameters": [
        {
          "symbol": "r",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "f",
          "name": "expansion function",
          "introduced": false,
          "displaySymbol": true
        }
      ],
      "roundParameters": [
        {
          "symbol": "r",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "f",
          "name": "expansion function",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "F(r, f)",
        "tex": "F\\bigl(r,f\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://www.sciencedirect.com/science/article/pii/S0304397522000081",
            "title": "Distributed distance-r covering problems on sparse high-girth graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unspecified",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "F",
          "description": "Unspecified function of the displayed parameters",
          "tex": "F"
        },
        {
          "symbol": "f",
          "description": "Expansion function bounding shallow-minor edge densities at each radius",
          "tex": "f",
          "sourceSymbol": "class"
        },
        {
          "symbol": "r",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "r"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-915afc773f0aa3fac5c2",
          "weights-unspecified"
        ],
        "parameters": [
          "auto-parameter-af57e23573dcc3ca99da"
        ],
        "assumptions": [
          "auto-assumption-1438241cdaf269b6f219"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-1438241cdaf269b6f219",
          "auto-graph-915afc773f0aa3fac5c2",
          "auto-model-37b353da5fa68eebd709",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-be4082e563d6ac3c12d9",
          "auto-parameter-af57e23573dcc3ca99da",
          "weights-unspecified"
        ]
      }
    },
    {
      "id": "pic-girth-cover-connected-vc",
      "paperId": "pic-aw-covering-2022",
      "problem": "Distance-r connected vertex cover",
      "variant": "",
      "objective": "min",
      "graphClass": "Bounded expansion; girth ≥ 4r + 2",
      "model": "CONGEST",
      "randomization": "Unspecified",
      "bound": "upper",
      "approximation": "O(1)",
      "rounds": "O(1)",
      "roundClass": "parameter",
      "parameters": "Fixed r and graph class.",
      "assumptions": "Abstract-level record; see paper for problem definitions.",
      "theorem": "Abstract",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://www.sciencedirect.com/science/article/pii/S0304397522000081",
      "year": 2022,
      "problemSource": "Vertex cover",
      "variantSource": "Distance-r connected vertex cover",
      "problemScope": {
        "node": "connected-distance-vertex-cover"
      },
      "problemParameter": "r",
      "problemParameterName": "distance radius",
      "graphScope": {
        "node": "girth-expansion",
        "note": "The girth threshold remains required for the stated distance parameter."
      },
      "approximationDisplay": "F(r, f)",
      "roundsDisplay": "F(r, f)",
      "approximationParameters": [
        {
          "symbol": "r",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "f",
          "name": "expansion function",
          "introduced": false,
          "displaySymbol": true
        }
      ],
      "roundParameters": [
        {
          "symbol": "r",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "f",
          "name": "expansion function",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "F(r, f)",
        "tex": "F\\bigl(r,f\\bigr)",
        "basis": "symbolic",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate.",
        "evidence": [
          {
            "url": "https://www.sciencedirect.com/science/article/pii/S0304397522000081",
            "title": "Distributed distance-r covering problems on sparse high-girth graphs",
            "location": "Abstract"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unspecified",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "F",
          "description": "Unspecified function of the displayed parameters",
          "tex": "F"
        },
        {
          "symbol": "f",
          "description": "Expansion function bounding shallow-minor edge densities at each radius",
          "tex": "f",
          "sourceSymbol": "class"
        },
        {
          "symbol": "r",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "r"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-915afc773f0aa3fac5c2",
          "weights-unspecified"
        ],
        "parameters": [
          "auto-parameter-af57e23573dcc3ca99da"
        ],
        "assumptions": [
          "auto-assumption-1438241cdaf269b6f219"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-1438241cdaf269b6f219",
          "auto-graph-915afc773f0aa3fac5c2",
          "auto-model-37b353da5fa68eebd709",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-d3386db78d70530c7ff1",
          "auto-parameter-af57e23573dcc3ca99da",
          "weights-unspecified"
        ]
      }
    },
    {
      "id": "pic-distance-k2t-constant",
      "paperId": "pic-chw-distance-2022",
      "problem": "Distance-k dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "K₂,t-minor-free",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "Oₖ,ₜ(1)",
      "rounds": "O(k)",
      "roundClass": "parameter",
      "parameters": "Fixed radius k and integer t.",
      "assumptions": "Connected graph; diameter ≥ 4k.",
      "theorem": "Theorem 15",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2203.03229",
      "year": 2022,
      "problemScope": {
        "node": "distance-dominating-set"
      },
      "problemParameter": "k",
      "problemParameterName": "distance radius",
      "problemSource": "Distance dominating set",
      "graphScope": {
        "node": "k2t"
      },
      "graphClassSource": "K₂,ₜ-minor-free",
      "prerequisite": "Connected; diameter ≥ 4k",
      "approximationDisplay": "f(k, t)",
      "roundsDisplay": "O(k)",
      "approximationParameters": [
        {
          "symbol": "k",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "t",
          "name": "excluded minor size",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(k)",
        "tex": "O(k)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2203.03229",
            "title": "Distributed distance domination in graphs with no K₂,ₜ-minor",
            "location": "Theorem 15"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "k",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "k"
        },
        {
          "symbol": "t",
          "description": "Size of the second bipartition class of the excluded minor K_{2,t}",
          "tex": "t"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-bb37704c123e99aa335b",
          "weights-unweighted",
          "input-connected-diameter-four-k"
        ],
        "parameters": [
          "auto-parameter-dc252bf1c14e8e232a95"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-bb37704c123e99aa335b",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-22413995976b0346df27",
          "auto-parameter-dc252bf1c14e8e232a95",
          "input-connected",
          "input-connected-diameter-four-k",
          "input-diameter-four-k",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-distance-k2t-ptas",
      "paperId": "pic-chw-distance-2022",
      "problem": "Distance-k dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "K₂,t-minor-free",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "Oₖ,ₜ,ε(log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed k,t and 0 < ε < 1.",
      "assumptions": "Connected graph; diameter ≥ 4k.",
      "theorem": "Theorem 18",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2203.03229",
      "year": 2022,
      "problemScope": {
        "node": "distance-dominating-set"
      },
      "problemParameter": "k",
      "problemParameterName": "distance radius",
      "problemSource": "Distance dominating set",
      "graphScope": {
        "node": "k2t"
      },
      "graphClassSource": "K₂,ₜ-minor-free",
      "prerequisite": "Connected; diameter ≥ 4k",
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "Oₖ,ₜ,ε(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Oₖ,ₜ,ε(log* n)",
        "tex": "O_{k,t,\\varepsilon}(\\log^*n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2203.03229",
            "title": "Distributed distance domination in graphs with no K₂,ₜ-minor",
            "location": "Theorem 18"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "k",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "k"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "t",
          "description": "Size of the second bipartition class of the excluded minor K_{2,t}",
          "tex": "t"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-bb37704c123e99aa335b",
          "weights-unweighted",
          "input-connected-diameter-four-k"
        ],
        "parameters": [
          "auto-parameter-d4d4c3f4968560101dad"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-bb37704c123e99aa335b",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-22413995976b0346df27",
          "auto-parameter-d4d4c3f4968560101dad",
          "input-connected",
          "input-connected-diameter-four-k",
          "input-diameter-four-k",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-distance-minor-ptas",
      "paperId": "pic-chw-distance-2022",
      "problem": "Distance-k dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Kₜ-minor-free; γ₁(G) ≤ Cγₖ(G)",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "O_C,k,t,ε(log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed C,k,t,ε; 0 < ε < 1.",
      "assumptions": "C,k,t known; includes bounded-degree minor-free classes.",
      "theorem": "Theorem 19",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2203.03229",
      "year": 2022,
      "problemScope": {
        "node": "distance-dominating-set"
      },
      "problemParameter": "k",
      "problemParameterName": "distance radius",
      "problemSource": "Distance dominating set",
      "graphScope": {
        "node": "minor-domination",
        "note": "Requires the stated relation between domination numbers."
      },
      "prerequisite": "Known C, k, t; domination constraint",
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "O_C,k,t,ε(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O_C,k,t,ε(log* n)",
        "tex": "O_{C,k,t,\\varepsilon}(\\log^*n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2203.03229",
            "title": "Distributed distance domination in graphs with no K₂,ₜ-minor",
            "location": "Theorem 19"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "γ₁(G)",
          "description": "Minimum cardinality of an ordinary dominating set of G",
          "tex": "\\gamma_1(G)"
        },
        {
          "symbol": "γₖ(G)",
          "description": "Minimum cardinality of a distance-k dominating set of G",
          "tex": "\\gamma_k(G)"
        },
        {
          "symbol": "C",
          "description": "Supplied positive integer comparison constant satisfying γ₁(G)≤Cγₖ(G)",
          "tex": "C"
        },
        {
          "symbol": "G",
          "description": "Input graph",
          "tex": "G"
        },
        {
          "symbol": "k",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "k"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "t",
          "description": "Number of vertices in the excluded complete minor K_t",
          "tex": "t"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-bcec1760a63c4cbb99b7",
          "weights-unweighted",
          "input-C-k-t-domination"
        ],
        "parameters": [
          "auto-parameter-e4817656513cd78376c7"
        ],
        "assumptions": [
          "auto-assumption-96d7175a2aee97a5e9b2"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-96d7175a2aee97a5e9b2",
          "auto-graph-bcec1760a63c4cbb99b7",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-22413995976b0346df27",
          "auto-parameter-e4817656513cd78376c7",
          "input-C-k-t-domination",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-girth-pruning",
      "paperId": "pic-lw-girth-2024",
      "problem": "Distance-k dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Connected; k-hop expansion ≤ f(k); girth ≥ 4k + 3",
      "model": "Anonymous",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "2k f(k) + 1",
      "rounds": "k",
      "roundClass": "parameter",
      "parameters": "Fixed radius k.",
      "assumptions": "Port numbering; empty messages suffice.",
      "theorem": "Theorem 1.1",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2408.12998v1",
      "year": 2024,
      "problemScope": {
        "node": "distance-dominating-set"
      },
      "problemParameter": "k",
      "problemParameterName": "distance radius",
      "problemSource": "Distance dominating set",
      "graphScope": {
        "node": "girth-hop",
        "note": "Retains connectivity, the precise k-hop expansion definition, and girth threshold."
      },
      "approximationDisplay": "2k f(k) + 1",
      "roundsDisplay": "k",
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "k",
        "tex": "k",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2408.12998v1",
            "title": "Tight Bounds for Constant-Round Domination on Graphs of High Girth and Low Expansion",
            "location": "Theorem 1.1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "Exact k rounds; k ≥ 2",
        "setting": "Unweighted distance-k MDS; k≥2 and fixed expansion bound f(k)≥1; connected graphs of girth at least 4k+3 and k-hop expansion at most f(k). Deterministic anonymous port numbering, exactly k rounds with empty messages, integral OPT.",
        "reason": "Theorem 1.1 is the published exact-k-round point with factor 2kf(k)+1. Theorem 1.2 proves that k−1 rounds cannot give any factor independent of Δ even on trees. The 3k-round improved-factor algorithm does not dominate this faster point. This certifies the minimum round budget and the documented tradeoff, not optimality of the coefficient for every k and f(k).",
        "evidenceUrl": "https://arxiv.org/html/2408.12998v1#S1",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-k-ge2",
          "parameter-expansion-ge1"
        ]
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "distance-k-round-threshold",
          "resultId": "pic-girth-pruning",
          "graphs": [
            "girth-hop",
            "forest",
            "degree-forest"
          ],
          "problems": [
            "distance-dominating-set"
          ],
          "models": [
            "Anonymous",
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": [
            "parameter-k-ge2",
            "parameter-expansion-ge1",
            "scope-factor-independent-degree"
          ]
        },
        {
          "certificateId": "long-cycle-distance-factor",
          "resultId": "pic-girth-pruning",
          "graphs": [
            "long-cycle"
          ],
          "problems": [
            "distance-dominating-set"
          ],
          "models": [
            "Anonymous",
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": [
            "scope-cycle-expansion-one",
            "scope-radius-k-equals-r",
            "scope-radius-r-sublogstar"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "f(k)",
          "description": "Upper bound on the edge-to-vertex ratio after deleting vertices and contracting disjoint subgraphs of the stated radius",
          "tex": "f(k)"
        },
        {
          "symbol": "f",
          "description": "Expansion function bounding edge-to-vertex ratios after bounded-radius contractions",
          "tex": "f"
        },
        {
          "symbol": "k",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "k"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-9171fdfac7e54f0c66d4",
          "weights-unweighted",
          "model-port-numbering"
        ],
        "parameters": [
          "auto-parameter-f0979e1ca73e2b9842db"
        ],
        "assumptions": [],
        "detail": [
          "strength-empty-messages"
        ],
        "covered": [
          "auto-graph-9171fdfac7e54f0c66d4",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-92362405df7c8f0d5040",
          "auto-output-22413995976b0346df27",
          "auto-parameter-f0979e1ca73e2b9842db",
          "model-port-numbering",
          "parameter-fixed-k",
          "parameter-k-ge1",
          "scope-factor-independent-degree",
          "strength-empty-messages",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-girth-sublinear",
      "paperId": "pic-lw-girth-2024",
      "problem": "Distance-k dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Connected; k-hop expansion ≤ f(k); girth ≥ 4k + 3",
      "model": "Anonymous",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "O(k + f(k)^(k/(k+1)))",
      "rounds": "3k",
      "roundClass": "parameter",
      "parameters": "Fixed k; algorithm need not know f(k).",
      "assumptions": "Port numbering; messages ≤ ⌈log Δ⌉ bits.",
      "theorem": "Theorem 1.5",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2408.12998v1",
      "year": 2024,
      "problemScope": {
        "node": "distance-dominating-set"
      },
      "problemParameter": "k",
      "problemParameterName": "distance radius",
      "problemSource": "Distance dominating set",
      "graphScope": {
        "node": "girth-hop",
        "note": "Retains connectivity, the precise k-hop expansion definition, and girth threshold."
      },
      "approximationDisplay": "O(k + f(k)^(k/(k+1)))",
      "roundsDisplay": "3k",
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "3k",
        "tex": "3k",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2408.12998v1",
            "title": "Tight Bounds for Constant-Round Domination on Graphs of High Girth and Low Expansion",
            "location": "Theorem 1.5"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Unweighted distance-k domination; connected graphs with girth ≥ 4k+3 and k-hop expansion at most f(k); deterministic anonymous port numbering in exactly 3k rounds; k ≥ 1; integral optimum.",
        "reason": "Optimal factor up to constants: O(k+f(k)^(k/(k+1))) in 3k anonymous rounds matches the deterministic LOCAL lower bound.",
        "evidenceUrl": "https://arxiv.org/html/2408.12998v1",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "high-girth-approximation-order",
          "resultId": "pic-girth-sublinear",
          "graphs": [
            "girth-hop"
          ],
          "problems": [
            "distance-dominating-set"
          ],
          "models": [
            "Anonymous",
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": []
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "f(k)",
          "description": "Upper bound on the edge-to-vertex ratio after deleting vertices and contracting disjoint subgraphs of the stated radius",
          "tex": "f(k)"
        },
        {
          "symbol": "f",
          "description": "Expansion function bounding edge-to-vertex ratios after bounded-radius contractions",
          "tex": "f"
        },
        {
          "symbol": "k",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "k"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-9171fdfac7e54f0c66d4",
          "weights-unweighted",
          "model-port-numbering"
        ],
        "parameters": [
          "parameter-fixed-k",
          "parameter-k-ge1"
        ],
        "assumptions": [],
        "detail": [
          "strength-log-degree-bits",
          "strength-no-f-knowledge"
        ],
        "covered": [
          "auto-graph-9171fdfac7e54f0c66d4",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-92362405df7c8f0d5040",
          "auto-output-22413995976b0346df27",
          "model-port-numbering",
          "parameter-fixed-k",
          "parameter-k-ge1",
          "strength-log-degree-bits",
          "strength-no-f-knowledge",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-girth-sublinear-lower",
      "paperId": "pic-lw-girth-2024",
      "problem": "Distance-k dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Connected; k-hop expansion ≤ f(k); girth ≥ 4k + 3",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "approximation": "No o(k + f(k)^(k/(k+1)))-approximation",
      "rounds": "O(1)",
      "roundClass": "parameter",
      "parameters": "Fixed k and expansion bound; asymptotic dependence on both parameters.",
      "assumptions": "",
      "theorem": "Abstract; Theorem 1.6 and LOCAL transfer",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2408.12998v1",
      "year": 2024,
      "problemScope": {
        "node": "distance-dominating-set"
      },
      "problemParameter": "k",
      "problemParameterName": "distance radius",
      "problemSource": "Distance dominating set",
      "graphScope": {
        "node": "girth-hop",
        "note": "Retains connectivity, the precise k-hop expansion definition, and girth threshold."
      },
      "approximationDisplay": "Ω(k + f(k)^(k/(k+1)))",
      "roundsDisplay": "F(k, f(k)) rounds ruled out",
      "roundParameters": [
        {
          "symbol": "k",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "f(k)",
          "name": "expansion bound",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundBudgetExcluded": true,
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "impossibility",
        "formula": "Any T(k, f(k)) independent of n",
        "tex": "\\text{Any }T\\bigl(k,f\\bigl(k\\bigr)\\bigr)\\text{ independent of }n",
        "basis": "quantified-impossibility",
        "explanation": "This excludes every round complexity depending only on the listed fixed parameters, independently of n. It is a lower-bound budget, not the running time of an algorithm.",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2408.12998v1",
            "title": "Tight Bounds for Constant-Round Domination on Graphs of High Girth and Low Expansion",
            "location": "Abstract; Theorem 1.6 and LOCAL transfer"
          }
        ],
        "parameters": [
          {
            "symbol": "T",
            "description": "An arbitrary number of communication rounds depending only on the listed fixed parameters",
            "tex": "T"
          }
        ],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "high-girth-approximation-order",
          "resultId": "pic-girth-sublinear-lower",
          "graphs": [
            "girth-hop"
          ],
          "problems": [
            "distance-dominating-set"
          ],
          "models": [
            "LOCAL",
            "CONGEST"
          ],
          "conditionIds": []
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "f(k)",
          "description": "Upper bound on the edge-to-vertex ratio after deleting vertices and contracting disjoint subgraphs of the stated radius",
          "tex": "f(k)",
          "sourceSymbol": "class"
        },
        {
          "symbol": "F",
          "description": "Unspecified function of the displayed parameters",
          "tex": "F"
        },
        {
          "symbol": "T",
          "description": "An arbitrary number of communication rounds depending only on the listed fixed parameters",
          "tex": "T"
        },
        {
          "symbol": "f",
          "description": "Expansion function bounding edge-to-vertex ratios after bounded-radius contractions",
          "tex": "f"
        },
        {
          "symbol": "k",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "k"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication network",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-9171fdfac7e54f0c66d4",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-849af929a5eaf7f9ea3b"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-9171fdfac7e54f0c66d4",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-22413995976b0346df27",
          "auto-parameter-849af929a5eaf7f9ea3b",
          "parameter-k-ge1",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-girth-time-lower",
      "paperId": "pic-lw-girth-2024",
      "problem": "Distance-k dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Trees; maximum degree ≤ Δ",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "approximation": "No factor smaller than Δ",
      "rounds": "k − 1",
      "roundClass": "parameter",
      "parameters": "Radius k; arbitrary Δ.",
      "assumptions": "",
      "theorem": "Theorem 1.2; Corollary 1",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/html/2408.12998v1",
      "year": 2024,
      "roundBudgetExcluded": true,
      "problemScope": {
        "node": "distance-dominating-set"
      },
      "problemParameter": "k",
      "problemParameterName": "distance radius",
      "problemSource": "Distance dominating set",
      "graphScope": {
        "node": "degree-forest"
      },
      "graphClassSource": "Trees of maximum degree Δ",
      "approximationDisplay": "≥ Δ",
      "roundsDisplay": "k − 1",
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "k − 1",
        "tex": "k - 1",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2408.12998v1",
            "title": "Tight Bounds for Constant-Round Domination on Graphs of High Girth and Low Expansion",
            "location": "Theorem 1.2; Corollary 1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "distance-k-round-threshold",
          "resultId": "pic-girth-time-lower",
          "graphs": [
            "degree-forest",
            "forest",
            "girth-hop"
          ],
          "problems": [
            "distance-dominating-set"
          ],
          "models": [
            "LOCAL",
            "CONGEST"
          ],
          "conditionIds": [
            "parameter-k-ge2",
            "parameter-expansion-ge1",
            "scope-factor-independent-degree"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "k",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "k"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-6b18cb9d7cafda1f1507",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-5163900e51cf7e19adb3"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-6b18cb9d7cafda1f1507",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-22413995976b0346df27",
          "auto-parameter-5163900e51cf7e19adb3",
          "parameter-expansion-ge1",
          "parameter-k-ge1",
          "parameter-k-ge2",
          "scope-factor-independent-degree",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-sublog-fmatching",
      "paperId": "pic-chw-capacitated-2021",
      "problem": "Maximum f-matching",
      "variant": "Maximum f-matching; edges used at most once",
      "objective": "max",
      "graphClass": "Sub-logarithmic expansion g(r) = o(log r)",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − ε",
      "rounds": "Oε,𝗀(log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed ε > 0 and expansion function g.",
      "assumptions": "Integer vertex capacities f(v); expansion information supplied.",
      "theorem": "Theorem 7",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol212-isaac2021/LIPIcs.ISAAC.2021.59/LIPIcs.ISAAC.2021.59.pdf",
      "year": 2021,
      "problemScope": {
        "node": "f-matching"
      },
      "problemParameter": "f",
      "problemParameterName": "vertex-capacity function",
      "problemSource": "Maximum matching",
      "graphScope": {
        "node": "sublog"
      },
      "prerequisite": "Expansion bounds supplied",
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "Oε,𝗀(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Oε,𝗀(log* n)",
        "tex": "O_{\\varepsilon,g}(\\log^*n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol212-isaac2021/LIPIcs.ISAAC.2021.59/LIPIcs.ISAAC.2021.59.pdf",
            "title": "Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion",
            "location": "Theorem 7"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Maximum f-matching with integer vertex capacities and each edge used at most once; deterministic LOCAL; sub-logarithmic expansion; fixed 0 < ε < 1/2 and expansion bounds; no supplied coloring.",
        "reason": "For a (1−ε) guarantee, Θ(log* n) dependence on n is optimal in the worst case for fixed ε and expansion bounds, already for unit capacities on paths. This does not certify optimal dependence on ε or the expansion function.",
        "evidenceUrl": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol212-isaac2021/LIPIcs.ISAAC.2021.59/LIPIcs.ISAAC.2021.59.pdf",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-epsilon-half"
        ]
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "fmatching-n-rounds",
          "resultId": "pic-sublog-fmatching",
          "graphs": [
            "sublog",
            "forest",
            "path",
            "oriented-path",
            "cycle"
          ],
          "problems": [
            "f-matching"
          ],
          "models": [
            "LOCAL"
          ],
          "conditionIds": [
            "scope-rounds-n-expansion-epsilon",
            "parameter-epsilon-half"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "f(v)",
          "description": "Positive integer capacity of vertex v in the f-matching problem",
          "tex": "f(v)"
        },
        {
          "symbol": "g(r)",
          "description": "Upper bound on the edge-to-vertex ratio of depth-r minors",
          "tex": "g(r)"
        },
        {
          "symbol": "f",
          "description": "Positive integer vertex-capacity function: a vertex v may meet at most f(v) selected edges",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Expansion function of the fixed input graph class; g(r)=o(log r)",
          "tex": "g",
          "sourceSymbol": "𝗀"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Radius parameter in the expansion function",
          "tex": "r"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-9fd58cfedeb677601608",
          "weights-unweighted",
          "output-fmatching-simple",
          "input-expansion-bounds"
        ],
        "parameters": [
          "auto-parameter-51662271224435b06188"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-9fd58cfedeb677601608",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-406e7225cb456f7c7595",
          "auto-parameter-51662271224435b06188",
          "input-expansion-bounds",
          "output-fmatching-simple",
          "parameter-fixed-epsilon",
          "parameter-fixed-expansion",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-sublog-bmatching",
      "paperId": "pic-chw-capacitated-2021",
      "problem": "Maximum b-matching",
      "variant": "Maximum b-matching; integer edge multiplicities",
      "objective": "max",
      "graphClass": "Sub-logarithmic expansion g(r) = o(log r)",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − ε",
      "rounds": "Oε,ᴸ,𝗀(log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed ε > 0, L, and expansion function g.",
      "assumptions": "Positive integer capacities b; |b(u)−b(v)| ≤ L dist(u,v); L known.",
      "theorem": "Theorem 17",
      "summary": "",
      "verification": "primary",
      "sourceUrl": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol212-isaac2021/LIPIcs.ISAAC.2021.59/LIPIcs.ISAAC.2021.59.pdf",
      "year": 2021,
      "problemScope": {
        "node": "b-matching"
      },
      "problemParameter": "b",
      "problemParameterName": "vertex-capacity function",
      "problemSource": "Maximum matching",
      "graphScope": {
        "node": "sublog"
      },
      "prerequisite": "Known Lipschitz capacity bound",
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "Oε,ᴸ,𝗀(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Oε,ᴸ,𝗀(log* n)",
        "tex": "O_{\\varepsilon,L,g}(\\log^*n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol212-isaac2021/LIPIcs.ISAAC.2021.59/LIPIcs.ISAAC.2021.59.pdf",
            "title": "Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion",
            "location": "Theorem 17"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "setting": "Maximum b-matching with integer edge multiplicities; deterministic LOCAL; sub-logarithmic expansion and known L-Lipschitz capacities; fixed 0 < ε < 1/2, L, and expansion bounds; no supplied coloring.",
        "reason": "For a (1−ε) guarantee, Θ(log* n) dependence on n is optimal in the worst case for fixed ε, L and expansion bounds; unit capacities satisfy the Lipschitz condition. This does not certify optimal dependence on ε, L or the expansion function.",
        "evidenceUrl": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol212-isaac2021/LIPIcs.ISAAC.2021.59/LIPIcs.ISAAC.2021.59.pdf",
        "checked": "2026-11-16",
        "conditionIds": [
          "parameter-epsilon-half"
        ]
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "bmatching-n-rounds",
          "resultId": "pic-sublog-bmatching",
          "graphs": [
            "sublog",
            "forest",
            "path",
            "oriented-path",
            "cycle"
          ],
          "problems": [
            "b-matching"
          ],
          "models": [
            "LOCAL"
          ],
          "conditionIds": [
            "scope-rounds-n-L-expansion-epsilon",
            "parameter-epsilon-half"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "b(v)",
          "description": "Positive integer capacity of vertex v in the b-matching problem",
          "tex": "b(v)"
        },
        {
          "symbol": "g(r)",
          "description": "Upper bound on the edge-to-vertex ratio of depth-r minors",
          "tex": "g(r)"
        },
        {
          "symbol": "L",
          "description": "Known Lipschitz constant: |b(u)−b(v)|≤L·dist(u,v)",
          "tex": "L"
        },
        {
          "symbol": "b",
          "description": "Positive integer vertex-capacity function bounding incident edge multiplicities",
          "tex": "b"
        },
        {
          "symbol": "g",
          "description": "Expansion function of the fixed input graph class; g(r)=o(log r)",
          "tex": "g",
          "sourceSymbol": "𝗀"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Radius parameter in the expansion function",
          "tex": "r"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-9fd58cfedeb677601608",
          "weights-unweighted",
          "output-bmatching-multiplicity",
          "input-lipschitz-capacity-bound",
          "input-lipschitz-capacities"
        ],
        "parameters": [
          "auto-parameter-70c7558f1bd42ca5b75a"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-9fd58cfedeb677601608",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-eb30c7aa45dd0f7be45c",
          "auto-parameter-70c7558f1bd42ca5b75a",
          "input-lipschitz-capacities",
          "input-lipschitz-capacity-bound",
          "output-bmatching-multiplicity",
          "parameter-fixed-L",
          "parameter-fixed-epsilon",
          "parameter-fixed-expansion",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-ass-sublog-refine",
      "paperId": "amiri-beyond-2017",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Sub-logarithmic expansion f(r) = o(log r)",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "Oε,꜀(log* n)",
      "roundClass": "logstar",
      "parameters": "Fixed expansion class, ε > 0, c.",
      "assumptions": "A c-approximate dominating set is provided as input.",
      "theorem": "Journal version, Theorem 4.6",
      "summary": "Conditional refinement; seed cost is additional.",
      "verification": "primary",
      "sourceUrl": "https://schmiste.github.io/talg19ds.pdf",
      "year": 2019,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "sublog"
      },
      "prerequisite": "Supplied c-approximate dominating set; seed cost additional",
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "Oε,꜀(log* n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Oε,꜀(log* n)",
        "tex": "O_{\\varepsilon,c}(\\log^*n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://schmiste.github.io/talg19ds.pdf",
            "title": "Distributed Dominating Set Approximations beyond Planar Graphs",
            "location": "Journal version, Theorem 4.6"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f(r)",
          "description": "Upper bound on the edge-to-vertex ratio of depth-r minors",
          "tex": "f(r)"
        },
        {
          "symbol": "c",
          "description": "Approximation factor of the initial dominating set supplied as input",
          "tex": "c"
        },
        {
          "symbol": "f",
          "description": "Expansion function of the fixed graph class; f(r)=o(log r)",
          "tex": "f"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Radius parameter in the expansion function",
          "tex": "r"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-8522d0de3c4afaf02c91",
          "weights-unweighted",
          "input-c-approx-seed"
        ],
        "parameters": [
          "auto-parameter-848e8210bb141aa4c5cf"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-8522d0de3c4afaf02c91",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-848e8210bb141aa4c5cf",
          "input-c-approx-seed",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "pic-ass-sublog-full",
      "paperId": "amiri-beyond-2017",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Sub-logarithmic expansion f(r) = o(log r)",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "O(log n)",
      "roundClass": "logarithmic",
      "parameters": "Fixed expansion class and ε > 0.",
      "assumptions": "",
      "theorem": "Journal version, Corollary 4.7 and following paragraph",
      "summary": "Includes the cited bounded-expansion seed construction.",
      "verification": "primary",
      "sourceUrl": "https://schmiste.github.io/talg19ds.pdf",
      "year": 2019,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "sublog"
      },
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "O(log n)",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(log n)",
        "tex": "O(\\log n)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://schmiste.github.io/talg19ds.pdf",
            "title": "Distributed Dominating Set Approximations beyond Planar Graphs",
            "location": "Journal version, Corollary 4.7 and following paragraph"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f(r)",
          "description": "Upper bound on the edge-to-vertex ratio of depth-r minors",
          "tex": "f(r)"
        },
        {
          "symbol": "f",
          "description": "Expansion function of the fixed graph class; f(r)=o(log r)",
          "tex": "f"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Radius parameter in the expansion function",
          "tex": "r"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-8522d0de3c4afaf02c91",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-a71ee1ff530d799c86f8"
        ],
        "assumptions": [],
        "detail": [],
        "covered": [
          "auto-graph-8522d0de3c4afaf02c91",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-a71ee1ff530d799c86f8",
          "weights-unweighted"
        ]
      }
    },
    {
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "rounds": "O(1)-round impossibility",
      "roundClass": "parameter",
      "paperId": "pic-thesis-2026",
      "verification": "primary",
      "year": 2026,
      "id": "pic-thesis-pathwidth-lower",
      "graphClass": "H-minor-free graphs",
      "approximation": "No (2 pw(H) − 1 − ε)-approximation",
      "parameters": "Fixed excluded minor H and ε > 0; pw(H) is its pathwidth.",
      "assumptions": "The number of rounds may depend arbitrarily on H, independently of n.",
      "theorem": "Chapter V, Theorem V.1.1 (PDF p. 146)",
      "sourceUrl": "https://timothepicavet.fr/others/thesis.pdf#page=146",
      "summary": "Pathwidth of the excluded minor controls this lower bound.",
      "relatedResults": [
        "pic-thesis-pathpower-lower",
        "gen-as26-power-lower"
      ],
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "> 2 pw(H) − 1 − ε",
      "roundsDisplay": "f(H, ε) rounds ruled out",
      "roundParameters": [
        {
          "symbol": "H",
          "name": "excluded minor",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "ε",
          "name": "accuracy",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundBudgetExcluded": true,
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "impossibility",
        "formula": "Any T(H, ε) independent of n",
        "tex": "\\text{Any }T\\bigl(H,\\varepsilon\\bigr)\\text{ independent of }n",
        "basis": "quantified-impossibility",
        "explanation": "This excludes every round complexity depending only on the listed fixed parameters, independently of n. It is a lower-bound budget, not the running time of an algorithm.",
        "evidence": [
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=146",
            "title": "Algorithmes distribués et structures locales dans les graphes",
            "location": "Chapter V, Theorem V.1.1 (PDF p. 146)"
          }
        ],
        "parameters": [
          {
            "symbol": "T",
            "description": "An arbitrary number of communication rounds depending only on the listed fixed parameters",
            "tex": "T"
          }
        ],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "pw(H)",
          "description": "Pathwidth of the excluded graph H",
          "tex": "\\operatorname{pw}(H)"
        },
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "T",
          "description": "An arbitrary number of communication rounds depending only on the listed fixed parameters",
          "tex": "T"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-147b06bde51054bdc0f1",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-156dd6ff20d8a86a9aff"
        ],
        "assumptions": [
          "auto-assumption-94ab493b6b5f81e0d93a"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-94ab493b6b5f81e0d93a",
          "auto-graph-147b06bde51054bdc0f1",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-156dd6ff20d8a86a9aff",
          "weights-unweighted"
        ]
      }
    },
    {
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "rounds": "O(1)-round impossibility",
      "roundClass": "parameter",
      "paperId": "pic-thesis-2026",
      "verification": "primary",
      "year": 2026,
      "id": "pic-thesis-pathpower-lower",
      "graphClass": "t-th powers of paths with endpoint leaves",
      "approximation": "No ratio < 2t + 1",
      "parameters": "Fixed integer t ≥ 1; arbitrary round complexity f(t).",
      "assumptions": "Witnesses allow extra degree-one vertices attached at one endpoint. Distinct identifiers in {1,…,|V(G)|}.",
      "theorem": "Chapter V, Lemma V.2.1 (PDF p. 148; proof p. 149)",
      "sourceUrl": "https://timothepicavet.fr/others/thesis.pdf#page=148",
      "summary": "A related path-power lower bound with endpoint leaves.",
      "relatedResults": [
        "gen-as26-power-lower",
        "pic-thesis-pathwidth-lower"
      ],
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "path-powers-leaves"
      },
      "approximationDisplay": "≥ 2t + 1",
      "roundsDisplay": "f(t) rounds ruled out",
      "roundParameters": [
        {
          "symbol": "t",
          "name": "power radius",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundBudgetExcluded": true,
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "impossibility",
        "formula": "Any T(t) independent of n",
        "tex": "\\text{Any }T\\bigl(t\\bigr)\\text{ independent of }n",
        "basis": "quantified-impossibility",
        "explanation": "This excludes every round complexity depending only on the listed fixed parameters, independently of n. It is a lower-bound budget, not the running time of an algorithm.",
        "evidence": [
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=148",
            "title": "Algorithmes distribués et structures locales dans les graphes",
            "location": "Chapter V, Lemma V.2.1 (PDF p. 148; proof p. 149)"
          }
        ],
        "parameters": [
          {
            "symbol": "T",
            "description": "An arbitrary number of communication rounds depending only on the listed fixed parameters",
            "tex": "T"
          }
        ],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "pathpower-leaves-factor",
          "resultId": "pic-thesis-pathpower-lower",
          "graphs": [
            "path-powers-leaves"
          ],
          "problems": [
            "dominating-set"
          ],
          "models": [
            "LOCAL",
            "CONGEST"
          ],
          "conditionIds": [
            "parameter-t-integer-ge1",
            "input-ids-one-to-n"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "G",
          "description": "Input graph",
          "tex": "G"
        },
        {
          "symbol": "T",
          "description": "An arbitrary number of communication rounds depending only on the listed fixed parameters",
          "tex": "T"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication network",
          "tex": "n"
        },
        {
          "symbol": "t",
          "description": "Power of the underlying path: original path vertices at distance at most t are adjacent",
          "tex": "t"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-580cce8ae5a0654250af",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-d8937560fe62ed79d064"
        ],
        "assumptions": [
          "auto-assumption-82725811fe448ccca35c"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-82725811fe448ccca35c",
          "auto-graph-580cce8ae5a0654250af",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-d8937560fe62ed79d064",
          "input-distinct-ids",
          "input-ids-one-to-n",
          "input-logarithmic-ids",
          "parameter-t-integer-ge1",
          "weights-unweighted"
        ]
      }
    },
    {
      "paperId": "gen-bdgpsw26",
      "problem": "Dominating set",
      "objective": "min",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "verification": "primary",
      "year": 2026,
      "id": "pic-thesis-planar-205",
      "variant": "Unweighted",
      "graphClass": "Planar",
      "approximation": "205",
      "rounds": "6",
      "roundClass": "constant",
      "parameters": "",
      "assumptions": "Distinct identifiers; the algorithm uses local computation without a time bound.",
      "theorem": "Proposition 3.1; thesis Proposition III.3.1 (PDF p. 82)",
      "summary": "The local optimum-based Algorithm 1 has an explicit six-round schedule.",
      "sourceUrl": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf#page=5",
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "205",
      "roundsDisplay": "6",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "6",
        "tex": "6",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf#page=5",
            "title": "Meta-Theorems for Cuttable Distributed Problems",
            "location": "Proposition 3.1; thesis Proposition III.3.1 (PDF p. 82)"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierComparisons": [
        {
          "better": "wawrzyniak-planar-52",
          "worse": "pic-thesis-planar-205",
          "strict": [
            "approximation"
          ],
          "conditions": {
            "problem": "Both return an integral approximation for unweighted minimum dominating set.",
            "graphClass": "Both algorithms apply to all planar graphs.",
            "approximation": "Factor 52 is strictly smaller than 205.",
            "rounds": "Both provide six-round LOCAL implementations. The 52 result uses the Lenzen–Pignolet–Wattenhofer schedule in Lemma 6.1; Proposition 3.1 of the cuttable-problems paper explicitly gives six rounds for factor 205. No comparison of unrelated unspecified constants is used.",
            "model": "Both use LOCAL with unrestricted message size and local computation.",
            "randomness": "Both algorithms are deterministic.",
            "benchmark": "Both approximation guarantees are measured against the integral optimum.",
            "assumptions": "Both use distinct identifiers and require no embedding, degree bound or externally supplied dominating set. Unbounded local computation is allowed in LOCAL."
          },
          "evidenceUrl": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf#page=5",
          "reason": "The six-round factor-52 algorithm has a strictly stronger guarantee than the six-round factor-205 algorithm under the same graph, model and identifier assumptions."
        }
      ],
      "dominatedBy": [
        "wawrzyniak-planar-52"
      ],
      "frontierStatus": "dominated",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [],
        "assumptions": [
          "auto-assumption-dfd0a20f62b413880876"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-dfd0a20f62b413880876",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "weights-unweighted"
        ]
      }
    },
    {
      "paperId": "gen-bdgpsw26",
      "problem": "Dominating set",
      "objective": "min",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "verification": "primary",
      "year": 2026,
      "id": "pic-thesis-genus-616",
      "variant": "Unweighted",
      "graphClass": "Euler genus ≤ g",
      "approximation": "616",
      "rounds": "C(g)",
      "roundClass": "parameter",
      "parameters": "Fixed Euler genus bound g; the approximation ratio is independent of g.",
      "assumptions": "Distinct identifiers; the class-dependent control function and genus bound determine the number of rounds.",
      "theorem": "Theorem 3.2; thesis Theorem III.3.2 (PDF pp. 82–83)",
      "summary": "An introductory genus-transfer algorithm with ratio independent of g; the round complexity depends on g.",
      "sourceUrl": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf#page=6",
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "euler",
        "note": "Retain any connectivity condition stated by the source."
      },
      "approximationDisplay": "616",
      "roundsDisplay": "f(g)",
      "roundParameters": [
        {
          "symbol": "g",
          "name": "Euler genus",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "partial",
        "formula": "O((g+1)(F_g(10)+6))",
        "tex": "O\\!\\left((g+1)(F_g(10)+6)\\right)",
        "basis": "derived-phase-bound",
        "explanation": "Theorem 3.2 states C(g). Algorithm 2 inspects radius F_g(10)+5, and Claim 3.3 bounds the residual two-hop components' weak diameters by less than 2(F_g(10)+6)g. Gathering the necessary bounded-radius views and applying the constant-round planar algorithm therefore gives the partial asymptotic expansion below. The proof does not compute F_g(10) as a closed function of g; do not label this an elementary explicit dependence on g or an exact integer runtime.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
            "title": "Meta-Theorems for Cuttable Distributed Problems",
            "location": "Theorem 3.2, Algorithm 2, Claim 3.3"
          },
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=82",
            "title": "Timothé Picavet's doctoral thesis",
            "location": "Theorem III.3.2, PDF pp. 82–83"
          }
        ],
        "parameters": [
          {
            "symbol": "F_g",
            "description": "A two-dimensional control function for the class of graphs of Euler genus at most g",
            "tex": "F_g"
          }
        ],
        "checked": "2026-11-16",
        "audited": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "F_g",
          "description": "A two-dimensional control function for the class of graphs of Euler genus at most g",
          "tex": "F_g"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound",
          "tex": "g"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-4688deea0bc7a8a63f32",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-c0e181a48eccedc1a097"
        ],
        "assumptions": [
          "auto-assumption-dc067c5203f5429194e2"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-dc067c5203f5429194e2",
          "auto-graph-4688deea0bc7a8a63f32",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-c0e181a48eccedc1a097",
          "weights-unweighted"
        ]
      }
    },
    {
      "paperId": "gen-bdgpsw26",
      "problem": "Dominating set",
      "objective": "min",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "verification": "primary",
      "year": 2026,
      "id": "pic-thesis-local-apex",
      "variant": "Unweighted",
      "graphClass": "Asymptotic dimension d; radius-r balls of Euler genus ≤ g with at most a apices",
      "approximation": "34.01(d + 1)",
      "rounds": "C(d,g,a,r)",
      "roundClass": "parameter",
      "parameters": "Fixed d, g, a and sufficiently large fixed radius r, together with a fixed dimensional control function.",
      "assumptions": "For every vertex, its induced radius-r ball becomes a graph of Euler genus at most g after deleting at most a vertices. The bound is for a class of asymptotic dimension at most d; its control function is fixed.",
      "theorem": "Corollary 4.4 and apex extension; thesis Corollary III.4.4 (PDF p. 88)",
      "summary": "The text explicitly extends the local-genus corollary to the a-apex version, preserving its ratio while allowing a-dependent round complexity.",
      "sourceUrl": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf#page=10",
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "local-apex",
        "note": "Retain fixed d, g, a, a sufficiently large radius r, and the class-dimensional control function; the deletion set of at most a apices may differ between balls."
      },
      "approximationDisplay": "34.01(d + 1)",
      "roundsDisplay": "f(d, g, a, r)",
      "roundParameters": [
        {
          "symbol": "d",
          "name": "asymptotic dimension",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "g",
          "name": "Euler genus",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "a",
          "name": "apex count",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "r",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "f(d, g, a, r)",
        "tex": "f\\bigl(d,g,a,r\\bigr)",
        "basis": "unspecified-parameter-function",
        "explanation": "The local-apex extension preserves the approximation ratio while allowing the number of rounds to depend on the apex count and the other fixed class parameters. The corollary and the following extension do not calculate a closed round formula; the transfer still uses the class's control function.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
            "title": "Meta-Theorems for Cuttable Distributed Problems",
            "location": "Corollary 4.4 and apex extension"
          },
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=88",
            "title": "Timothé Picavet's doctoral thesis",
            "location": "Corollary III.4.4 and its apex extension, PDF p. 88"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": true
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "a",
          "description": "Maximum number of vertices deleted from each radius-r ball to obtain Euler genus at most g",
          "tex": "a"
        },
        {
          "symbol": "d",
          "description": "Asymptotic dimension bound of the graph class",
          "tex": "d"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound for the radius-r balls after any stated apex deletions",
          "tex": "g"
        },
        {
          "symbol": "r",
          "description": "Fixed sufficiently large radius of the neighborhoods used in the local-class assumption",
          "tex": "r"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-923a099c9b7572b1569c",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-fafe049cf255bb2992b3"
        ],
        "assumptions": [
          "auto-assumption-e9f4409ff458ab752c46"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-e9f4409ff458ab752c46",
          "auto-graph-923a099c9b7572b1569c",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-fafe049cf255bb2992b3",
          "weights-unweighted"
        ]
      }
    },
    {
      "paperId": "pic-thesis-2026",
      "variant": "Unweighted",
      "objective": "min",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "verification": "primary",
      "year": 2026,
      "id": "pic-thesis-pw2-dom",
      "problem": "Dominating set",
      "graphClass": "H-minor-free; pw(H) ≤ 2",
      "approximation": "50",
      "rounds": "O_H(1)",
      "roundClass": "parameter",
      "parameters": "Fixed excluded graph H with pw(H) ≤ 2. The approximation ratio is independent of H.",
      "assumptions": "Distinct identifiers. The excluded graph H is fixed, and the proof chooses H-dependent structural diameter thresholds.",
      "theorem": "Chapter VIII, Theorem VIII.1.1 (PDF p. 204; proof completed p. 218)",
      "summary": "Extends Algorithm 5 from K₂,t-minor-free graphs to every fixed excluded minor H of pathwidth at most two. The pathwidth restriction is on H, not on the input graph.",
      "sourceUrl": "https://timothepicavet.fr/others/thesis.pdf#page=204",
      "relatedResults": [
        "pic-large-50-dom",
        "pic-thesis-pathwidth-lower"
      ],
      "algorithmFamily": "local-cutting-dominating-set-algorithm5",
      "graphParameterRoles": {
        "excluded-minor": "H"
      },
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "minor-pw2",
        "note": "H is a fixed excluded minor with pw(H) ≤ 2; the input graph need not have pathwidth at most 2."
      },
      "approximationDisplay": "50",
      "roundsDisplay": "f(H)",
      "roundParameters": [
        {
          "symbol": "H",
          "name": "excluded minor",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "f(H)",
        "tex": "f\\bigl(H\\bigr)",
        "basis": "unspecified-parameter-function",
        "explanation": "Theorem VIII.1.1 reuses Algorithm 5 with a new structural diameter analysis. The proof still chooses local-cut radii via the dimensional control function and H-dependent structural thresholds. The final residual weak-diameter estimate is D+4 in terms of a prior structural bound D; it does not by itself produce a closed communication bound in the excluded graph H.",
        "evidence": [
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=204",
            "title": "Timothé Picavet's doctoral thesis",
            "location": "Theorem VIII.1.1, PDF p. 204; proof of Theorem VIII.5.1 and conclusion of Chapter VIII, PDF pp. 217–218"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": true
      },
      "sota": {
        "scopeLabel": "pw(H) ≤ 2; ratio independent of H",
        "setting": "Unweighted minimum dominating set; deterministic LOCAL; every fixed excluded minor H with pw(H) ≤ 2; factor 50 against the integral optimum in f(H) rounds independent of n.",
        "reason": "Theorem VIII.1.1 extends the same Algorithm 5 to every fixed excluded minor H with pw(H)≤2, retaining factor 50 independent of H. For H=K₂,t the family uses the original control function and cut radii, so the original O(t) implementation is retained. This covers the original K₂,t theorem by strict extension of the family of excluded-minor settings; it does not claim faster rounds. The generic H-dependent bound remains f(H), and particular H can have better specialized algorithms.",
        "evidenceUrl": "https://timothepicavet.fr/others/thesis.pdf#page=204",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "sotaScopeTransfers": [
        {
          "resultId": "pic-thesis-pw2-dom",
          "graph": "k2t",
          "algorithmSpecialization": "algorithm5-k2t-specialization",
          "scopeLabel": "K₂,t-minor-free; t ≥ 49",
          "setting": "Unweighted K₂,t-minor-free MDS; H=K₂,t with fixed t≥2; deterministic LOCAL; factor 50 against integral OPT. Use the original Algorithm 5 configuration and its O(t) runtime. The SOTA review is for t≥49.",
          "reason": "Theorem VIII.1.1 extends the original Algorithm 5 to all fixed excluded minors of pathwidth at most two. The certified H=K₂,t branch uses the original linear-in-t implementation. Its uniform factor-50 SOTA scope retains t≥49, while the algorithm itself applies for every t≥2. The original paper remains linked as the source of this specialized algorithm.",
          "evidenceUrl": "https://timothepicavet.fr/others/thesis.pdf#page=204",
          "conditionIds": [
            "claim-t-ge49"
          ],
          "claimConditionIds": [
            "claim-t-ge49"
          ],
          "settingConditionIds": [
            "binding-excluded-minor-k2t",
            "parameter-fixed-t-ge2"
          ]
        }
      ],
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "pw(H)",
          "description": "Pathwidth of the excluded graph H",
          "tex": "\\operatorname{pw}(H)"
        },
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-23bbca89e52d93fabbc0",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-47b7ba76ac595cfa11be"
        ],
        "assumptions": [
          "auto-assumption-d180b40ee9f79668f8bb"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-d180b40ee9f79668f8bb",
          "auto-graph-23bbca89e52d93fabbc0",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-47b7ba76ac595cfa11be",
          "weights-unweighted"
        ]
      }
    },
    {
      "paperId": "pic-thesis-2026",
      "variant": "Unweighted",
      "objective": "min",
      "model": "Anonymous",
      "randomization": "Deterministic",
      "bound": "upper",
      "verification": "primary",
      "year": 2026,
      "id": "pic-thesis-degeneracy-vc",
      "problem": "Vertex cover",
      "graphClass": "Degeneracy ≤ d",
      "approximation": "2 + ε",
      "rounds": "((1 + 1/ε)d + 1)² + 1",
      "roundClass": "parameter",
      "parameters": "Integer degeneracy bound d ≥ 1 and accuracy ε > 0 are supplied. For 0 < ε ≤ 1 the round complexity is O((d/ε)²).",
      "assumptions": "Anonymous port numbering; each vertex initially knows its own degree. At most two bits per message. The round complexity is independent of n and the maximum degree.",
      "theorem": "Chapter X, Theorem X.1.3; proof round count (PDF pp. 235–236)",
      "summary": "Select vertices above a degree threshold, then run the anonymous factor-two algorithm on the residual bounded-degree graph. The displayed upper bound includes the preprocessing round.",
      "sourceUrl": "https://timothepicavet.fr/others/thesis.pdf#page=235",
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "density",
        "note": "Retain the stated numerical degeneracy bound d. Boundedness is equivalent to bounded arboricity, but their numerical parameters are not identified."
      },
      "approximationDisplay": "2 + ε",
      "roundsDisplay": "((1 + 1/ε)d + 1)² + 1",
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "((1 + 1/ε)d + 1)² + 1",
        "tex": "\\bigl((1+1/\\varepsilon)d+1\\bigr)^2+1",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=235",
            "title": "Algorithmes distribués et structures locales dans les graphes",
            "location": "Chapter X, Theorem X.1.3; proof round count (PDF pp. 235–236)"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "d",
          "description": "Supplied integer upper bound on graph degeneracy",
          "tex": "d"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-7d0e376814cb5e208e0f",
          "weights-unweighted",
          "model-port-numbering",
          "input-own-degree",
          "parameter-known-d-epsilon"
        ],
        "parameters": [],
        "assumptions": [],
        "detail": [
          "strength-two-bits",
          "parameter-degeneracy-runtime"
        ],
        "covered": [
          "auto-graph-7d0e376814cb5e208e0f",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-92362405df7c8f0d5040",
          "auto-output-7f07455ff69b3b347e9b",
          "input-own-degree",
          "model-port-numbering",
          "parameter-degeneracy-runtime",
          "parameter-known-d-epsilon",
          "strength-two-bits",
          "weights-unweighted"
        ]
      }
    },
    {
      "paperId": "pic-thesis-2026",
      "variant": "Unweighted",
      "objective": "min",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "verification": "primary",
      "year": 2026,
      "id": "pic-thesis-planar-distance-dom",
      "problem": "Distance-k dominating set",
      "graphClass": "Planar",
      "approximation": "k^{O(k)}",
      "rounds": "O(k)",
      "roundClass": "parameter",
      "parameters": "Fixed integer distance k ≥ 1.",
      "assumptions": "Distinct identifiers; Algorithm 8 uses only their order. Unrestricted LOCAL messages and local computation. No girth restriction.",
      "theorem": "Chapter X, Theorem X.2.5 and Algorithm 8 (PDF pp. 237–238; proof pp. 239–246)",
      "summary": "Local optimum computations give a distance-k dominating set on every planar graph. The theorem uses k; the radius r in the algorithm is the same parameter.",
      "sourceUrl": "https://timothepicavet.fr/others/thesis.pdf#page=237",
      "relatedResults": [
        "pic-thesis-genus-distance-dom"
      ],
      "problemScope": {
        "node": "distance-dominating-set"
      },
      "problemParameter": "k",
      "problemParameterName": "distance radius",
      "problemSource": "Distance dominating set",
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "k^{O(k)}",
      "roundsDisplay": "O(k)",
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O(k)",
        "tex": "O(k)",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=237",
            "title": "Algorithmes distribués et structures locales dans les graphes",
            "location": "Chapter X, Theorem X.2.5 and Algorithm 8 (PDF pp. 237–238; proof pp. 239–246)"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "k",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "k"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-beaf612e4f0193d5db76"
        ],
        "assumptions": [
          "auto-assumption-4d3da7dbdc858af64700"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-4d3da7dbdc858af64700",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-22413995976b0346df27",
          "auto-parameter-beaf612e4f0193d5db76",
          "weights-unweighted"
        ]
      }
    },
    {
      "paperId": "pic-thesis-2026",
      "variant": "Unweighted",
      "objective": "min",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "verification": "primary",
      "year": 2026,
      "id": "pic-thesis-genus-distance-dom",
      "problem": "Distance-k dominating set",
      "graphClass": "Euler genus ≤ g",
      "approximation": "k^{O(k)}",
      "rounds": "C(g,k)",
      "roundClass": "parameter",
      "parameters": "Fixed integer distance k ≥ 1 and Euler genus bound g. The approximation ratio is independent of g.",
      "assumptions": "Distinct identifiers; no knowledge of n is required. Apply Meta-Theorem I with asymptotic dimension two and the fixed Euler-genus control function. No girth restriction.",
      "theorem": "Chapter X, paragraph following Theorem X.2.5; Meta-Theorem I and Proposition III.7.6 (PDF pp. 237–238)",
      "summary": "The thesis explicitly gives this genus extension. If the planar factor is α(k)=k^{O(k)}, the transfer gives 3α(k)+1=k^{O(k)}, with round complexity depending on g and k.",
      "sourceUrl": "https://timothepicavet.fr/others/thesis.pdf#page=238",
      "relatedResults": [
        "pic-thesis-planar-distance-dom"
      ],
      "problemScope": {
        "node": "distance-dominating-set"
      },
      "problemParameter": "k",
      "problemParameterName": "distance radius",
      "problemSource": "Distance dominating set",
      "graphScope": {
        "node": "euler",
        "note": "Retain any connectivity condition stated by the source."
      },
      "approximationDisplay": "k^{O(k)}",
      "roundsDisplay": "f(g, k)",
      "roundParameters": [
        {
          "symbol": "g",
          "name": "Euler genus",
          "introduced": true,
          "displaySymbol": true
        },
        {
          "symbol": "k",
          "name": "radius",
          "introduced": true,
          "displaySymbol": true
        }
      ],
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "f(g, k)",
        "tex": "f\\bigl(g,k\\bigr)",
        "basis": "unspecified-parameter-function",
        "explanation": "The paragraph following Theorem X.2.5 explicitly obtains the genus extension by Meta-Theorem I and Proposition III.7.6. Algorithm 8 gives a radius-5k+1 neighbourhood inspection for the planar base algorithm, but this is not the runtime of its genus transfer. The transfer additionally depends on the uniformity transformation, the genus class's dimensional control function, and error-component diameter bounds. No complete g,k formula is calculated in this passage.",
        "evidence": [
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=237",
            "title": "Timothé Picavet's doctoral thesis",
            "location": "Theorem X.2.5, Algorithm 8 and the subsequent genus-extension paragraph, PDF pp. 237–238; Meta-Theorem I and Proposition III.7.6"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": true
      },
      "sota": {
        "scopeLabel": "General distance-k guarantee; ratio independent of g",
        "setting": "Unweighted distance-k dominating set on graphs of Euler genus at most g; fixed integer k ≥ 1 and genus bound g ≥ 0; deterministic LOCAL with distinct identifiers, unrestricted messages and local computation; approximation k^{O(k)}, independent of g, in f(g,k) rounds independent of n. No girth restriction.",
        "reason": "The paragraph following Theorem X.2.5 explicitly extends the planar algorithm using Meta-Theorem I and Proposition III.7.6. Its approximation ratio depends only on the distance parameter, while its round complexity may depend on both distance and genus. Faster planar and high-girth results require smaller graph classes; schemes with log-star or logarithmic dependence on n do not dominate this round complexity independent of n. This certifies the general distance-k tradeoff, without claiming the best coefficient at every special value of k, tightness or optimal parameter dependence.",
        "evidenceUrl": "https://timothepicavet.fr/others/thesis.pdf#page=238",
        "checked": "2026-11-17",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f",
          "description": "Unspecified function of the displayed parameters",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound",
          "tex": "g"
        },
        {
          "symbol": "k",
          "description": "Maximum distance from a vertex/request to its selected covering vertex",
          "tex": "k"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-4688deea0bc7a8a63f32",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-b0a4f6cca13712e0d8ac"
        ],
        "assumptions": [
          "auto-assumption-c29b65f0df3a5db56172"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-c29b65f0df3a5db56172",
          "auto-graph-4688deea0bc7a8a63f32",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-22413995976b0346df27",
          "auto-parameter-b0a4f6cca13712e0d8ac",
          "weights-unweighted"
        ]
      }
    },
    {
      "paperId": "pic-thesis-2026",
      "variant": "Unweighted; exact component optimum",
      "objective": "min",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "verification": "primary",
      "year": 2026,
      "id": "pic-thesis-path-excluded-exact",
      "problem": "Dominating set",
      "graphClass": "Pₜ-minor-free",
      "approximation": "1",
      "rounds": "t − 1",
      "roundClass": "parameter",
      "parameters": "Pₜ is the t-vertex path; fixed integer t ≥ 2.",
      "assumptions": "Distinct identifiers and unrestricted LOCAL messages. Disconnected graphs are handled component by component.",
      "theorem": "Chapter IV, Section IV.1, elementary observation (PDF p. 120)",
      "summary": "Every connected component has diameter at most t−2. Gather the component and compute its exact minimum dominating set with common lexicographic tie-breaking.",
      "sourceUrl": "https://timothepicavet.fr/others/thesis.pdf#page=120",
      "attribution": "folklore",
      "algorithm": "Gather the entire connected component in t−1 rounds, compute all minimum dominating sets, and select the lexicographically first using the distinct identifiers.",
      "proofSketch": "A shortest path of length t−1 would contain the forbidden t-vertex path. Thus each component has diameter at most t−2; t−1 rounds suffice to gather all its edges. Every vertex computes the same optimum, and component optima combine to a global optimum.",
      "proofFormula": "|D| = OPT",
      "provenanceNote": "Elementary baseline explicitly recalled in the thesis; 2026 is the source year, not a discovery claim.",
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "path-minor",
        "note": "t is the fixed number of vertices of the excluded path. Bounds apply separately to each connected component."
      },
      "approximationDisplay": "1",
      "roundsDisplay": "t − 1",
      "roundClassSource": "constant",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "t − 1",
        "tex": "t-1",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=120",
            "title": "Algorithmes distribués et structures locales dans les graphes",
            "location": "Chapter IV, Section IV.1, elementary observation (PDF p. 120)"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "OPT",
          "description": "Minimum cardinality of a feasible solution",
          "tex": "\\mathrm{OPT}"
        },
        {
          "symbol": "D",
          "description": "Vertex set selected by the algorithm",
          "tex": "D"
        },
        {
          "symbol": "t",
          "description": "Number of vertices in the excluded path P_t",
          "tex": "t"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-c40b643df6f08b5ef5f6",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-19cffd064800d231c334"
        ],
        "assumptions": [
          "auto-assumption-c037429316643f33df51"
        ],
        "detail": [
          "detail-exact-components"
        ],
        "covered": [
          "auto-assumption-c037429316643f33df51",
          "auto-graph-c40b643df6f08b5ef5f6",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-19cffd064800d231c334",
          "detail-exact-components",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "folklore-tree-mds",
      "problem": "Dominating set",
      "variant": "Unweighted; non-leaf rule",
      "objective": "min",
      "graphClass": "Pseudoforests",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "3",
      "rounds": "1",
      "roundClass": "constant",
      "parameters": "At most one cycle per component; no degree bound.",
      "assumptions": "Unweighted pseudoforest; each vertex initially knows its own degree. One-bit broadcasts suffice; identifiers are unnecessary. Isolated vertices are selected, and both endpoints of a two-vertex component are selected.",
      "paperId": "dory-arboricity-2022",
      "theorem": "Appendix A, Observation A.1 (forest construction); elementary pseudoforest extension proved here",
      "summary": "The one-round non-leaf rule works on forests and, by the elementary extension below, on pseudoforests.",
      "verification": "primary",
      "sourceUrl": "https://arxiv.org/pdf/2206.05174#page=17",
      "year": 2022,
      "attribution": "folklore",
      "algorithm": "Broadcast whether the local degree equals one. Select vertices of degree zero or at least two, and degree-one vertices whose neighbor also has degree one.",
      "proofSketch": "In a component with at least three vertices, non-leaves dominate. Assign each non-optimum vertex to an adjacent optimum vertex; the resulting disjoint stars use n−OPT edges. A pseudoforest component has at most n edges, so at most OPT edges remain outside the stars. Every non-optimum non-leaf touches a remaining edge, giving at most 2 OPT such vertices, plus at most OPT optimum vertices. Singleton and two-vertex components have ratios one and two. Sum over components.",
      "provenanceNote": "Folklore non-leaf construction; 2022 identifies the source documenting the forest case, not discovery credit. The broader pseudoforest statement is explicitly derived here.",
      "proofFormula": "|D| ≤ 3 OPT",
      "derivationNote": "The cited observation states the forest case. The pseudoforest scope is an elementary extension, with the same one-bit protocol and the proof given here; it is not attributed as a separate theorem in that paper.",
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "pseudoforest",
        "note": "The one-round non-leaf construction extends to this class by the elementary star-assignment proof in the result details."
      },
      "approximationDisplay": "3",
      "roundsDisplay": "1",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "1",
        "tex": "1",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2206.05174#page=17",
            "title": "Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs",
            "location": "Appendix A, Observation A.1 (forest construction); elementary pseudoforest extension proved here"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "One round; pseudoforests",
        "setting": "Unweighted MDS on pseudoforests, hence also forests; deterministic one-round CONGEST with initial local degree knowledge; no identifiers; integral OPT. The pseudoforest scope is an explicitly derived extension of the documented forest rule.",
        "reason": "The one-bit non-leaf construction and the star-assignment proof in the entry give factor 3 on the strictly larger pseudoforest class. The treewidth-one lower bound in Corollary 1.1 excludes every factor below 3 already on paths, even for constant-round LOCAL algorithms. Generic constant-round protocols are not assumed to run in one round.",
        "evidenceUrl": "https://arxiv.org/pdf/2611.02057#page=66",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "sotaScopeTransfers": [
        {
          "resultId": "folklore-tree-mds",
          "graph": "forest",
          "scopeLabel": "Forests · one round",
          "setting": "Unweighted MDS on trees or forests; exact factor 3 in one round, with initial local degree knowledge and no identifiers.",
          "reason": "Forests are contained in pseudoforests. The same non-leaf construction is documented in Observation A.1, and the constant-round factor-three barrier already holds on paths.",
          "evidenceUrl": "https://arxiv.org/pdf/2206.05174#page=17",
          "conditionIds": [],
          "claimConditionIds": [],
          "settingConditionIds": []
        }
      ],
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "tightness": [
        {
          "certificateId": "pseudoforest-factor-three",
          "resultId": "folklore-tree-mds",
          "graphs": [
            "pseudoforest",
            "forest",
            "degree-forest",
            "path",
            "oriented-path"
          ],
          "problems": [
            "dominating-set"
          ],
          "models": [
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": []
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "OPT",
          "description": "Minimum cardinality of a feasible solution",
          "tex": "\\mathrm{OPT}"
        },
        {
          "symbol": "D",
          "description": "Vertex set selected by the algorithm",
          "tex": "D"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a92a23ddd7d97c52a4a2",
          "weights-unweighted",
          "input-own-degree"
        ],
        "parameters": [
          "auto-parameter-db0be7437e2fe9433220"
        ],
        "assumptions": [],
        "detail": [
          "strength-one-bit",
          "strength-no-ids"
        ],
        "covered": [
          "auto-graph-a92a23ddd7d97c52a4a2",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-db0be7437e2fe9433220",
          "input-own-degree",
          "strength-no-ids",
          "strength-one-bit",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "folklore-degree-mds",
      "problem": "Dominating set",
      "variant": "Unweighted; select all vertices",
      "objective": "min",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "Δ + 1",
      "rounds": "0",
      "roundClass": "constant",
      "parameters": "Δ is the maximum degree; the algorithm need not know it.",
      "assumptions": "Unweighted graphs. No identifiers, degree knowledge, or communication are needed.",
      "paperId": "gen-aprsu10",
      "theorem": "Section 2, trivial dominating-set approximation",
      "summary": "Selecting every vertex provides the elementary degree-dependent benchmark.",
      "verification": "primary",
      "sourceUrl": "https://jukkasuomela.fi/doc/weakly-coloured.pdf#page=3",
      "year": 2010,
      "attribution": "folklore",
      "algorithm": "Every vertex selects itself.",
      "proofSketch": "A vertex dominates at most Δ + 1 vertices, so OPT is at least n/(Δ + 1). The output has n vertices.",
      "provenanceNote": "Folklore baseline documented by the cited source; 2010 is the source year, not a discovery claim.",
      "proofFormula": "|D| ≤ (Δ + 1) OPT",
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "general"
      },
      "graphClassSource": "General graphs",
      "approximationDisplay": "Δ + 1",
      "roundsDisplay": "0",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "0",
        "tex": "0",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/weakly-coloured.pdf#page=3",
            "title": "Local algorithms in (weakly) coloured graphs",
            "location": "Section 2, trivial dominating-set approximation"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "OPT",
          "description": "Minimum cardinality of a feasible solution",
          "tex": "\\mathrm{OPT}"
        },
        {
          "symbol": "D",
          "description": "Vertex set selected by the algorithm",
          "tex": "D"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-22a8f3875f4ed671e161"
        ],
        "assumptions": [
          "auto-assumption-7218db1f3f785e20d190"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-7218db1f3f785e20d190",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-22a8f3875f4ed671e161",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "folklore-star-minor-mds",
      "problem": "Dominating set",
      "variant": "Unweighted; select all vertices",
      "objective": "min",
      "graphClass": "K₁,ₜ-minor-free",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "t",
      "rounds": "0",
      "roundClass": "constant",
      "parameters": "Integer t ≥ 2; the algorithm need not know t.",
      "assumptions": "Unweighted. No identifiers, degree knowledge, or communication are needed.",
      "paperId": "pic-bgpw-large-2025",
      "theorem": "Table 1 and footnote 4",
      "summary": "The excluded-star condition bounds the cost of selecting all vertices.",
      "verification": "primary",
      "sourceUrl": "https://dept-info.labri.fr/~gavoille/article/BGPW25.pdf#page=3",
      "year": 2025,
      "attribution": "folklore",
      "algorithm": "Every vertex selects itself.",
      "proofSketch": "Excluding K₁,ₜ as a minor implies Δ ≤ t − 1. Thus every optimum vertex dominates at most t vertices, and n ≤ t · OPT.",
      "provenanceNote": "Folklore baseline documented by the cited source; 2025 is the source year, not a discovery claim.",
      "proofFormula": "|D| ≤ t OPT",
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "star-minor"
      },
      "approximationDisplay": "t",
      "roundsDisplay": "0",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "0",
        "tex": "0",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://dept-info.labri.fr/~gavoille/article/BGPW25.pdf#page=3",
            "title": "Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors",
            "location": "Table 1 and footnote 4"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierComparisons": [
        {
          "better": "folklore-degree-mds",
          "worse": "folklore-star-minor-mds",
          "strict": [
            "graphClass"
          ],
          "parameterDomain": "For every integer t ≥ 2, instantiate the general degree guarantee on the class of graphs with maximum degree Δ ≤ t−1.",
          "comparisonGraphClass": {
            "node": "degree",
            "label": "Maximum degree ≤ t−1"
          },
          "conditions": {
            "problem": "Both solve unweighted minimum dominating set by selecting every vertex.",
            "graphClass": "Every K1,t-minor-free graph has maximum degree at most t−1. The larger comparison class is maximum degree ≤ t−1, not all general graphs with a uniform factor t. For t ≥ 4 the containment is strict: a subcubic tree with t leaves contains K1,t as a minor while its degree is at most t−1. For t=2 or t=3 the two classes coincide.",
            "approximation": "On maximum-degree-(t−1) graphs, the general Δ+1 bound is at most t, matching the excluded-star guarantee.",
            "rounds": "Both use exactly zero communication rounds, with no parameter-dependent overhead.",
            "model": "Both are valid in CONGEST and use no messages or identifiers.",
            "randomness": "Both algorithms are deterministic.",
            "benchmark": "Both output integral dominating sets measured against integral OPT.",
            "assumptions": "Both are unweighted and need no degree or parameter knowledge. The parameter substitution is a property of the graph class, not extra information supplied to processors."
          },
          "evidenceUrl": "https://dept-info.labri.fr/~gavoille/article/BGPW25.pdf#page=3",
          "reason": "The excluded-star zero-round baseline is a specialization of the zero-round maximum-degree baseline. It has no separate frontier advantage for t ≥ 4 once the larger maximum-degree class is instantiated at Δ ≤ t−1. At t=2 or t=3 the classes coincide, so this is equivalence rather than strict dominance.",
          "domainGuard": "t ≥ 4"
        }
      ],
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "OPT",
          "description": "Minimum cardinality of a feasible solution",
          "tex": "\\mathrm{OPT}"
        },
        {
          "symbol": "D",
          "description": "Vertex set selected by the algorithm",
          "tex": "D"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "t",
          "description": "Number of leaves in the excluded star K_{1,t}",
          "tex": "t"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the input graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-f5f624e676f5e722507d",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-67f354a1ddafcbd4a3f4"
        ],
        "assumptions": [
          "auto-assumption-5a941652786b9818dce6"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-5a941652786b9818dce6",
          "auto-graph-f5f624e676f5e722507d",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-67f354a1ddafcbd4a3f4",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "folklore-regular-vc",
      "problem": "Vertex cover",
      "variant": "Unweighted; select all vertices",
      "objective": "min",
      "graphClass": "Regular; degree ≥ 1",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "2",
      "rounds": "0",
      "roundClass": "constant",
      "parameters": "All vertices have the same positive degree.",
      "assumptions": "Unweighted regular graphs of positive degree. No identifiers, degree knowledge, or communication are needed.",
      "paperId": "pic-bgpw-large-2025",
      "theorem": "Introduction, constant-round algorithms; footnote 1",
      "summary": "Selecting all vertices is a two-approximation on positive-degree regular graphs.",
      "verification": "primary",
      "sourceUrl": "https://dept-info.labri.fr/~gavoille/article/BGPW25.pdf#page=2",
      "year": 2025,
      "attribution": "folklore",
      "algorithm": "Every vertex selects itself.",
      "proofSketch": "A d-regular graph has dn/2 edges. A vertex cover of size p meets at most dp edges, so OPT ≥ n/2 for d ≥ 1.",
      "provenanceNote": "Folklore baseline documented by the cited source; 2025 is the source year, not a discovery claim.",
      "proofFormula": "|D| ≤ 2 OPT",
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "regular",
        "note": "The vertex-cover baseline assumes a positive regular degree. It does not select all vertices of a nonempty edgeless graph."
      },
      "prerequisite": "Positive regular degree",
      "approximationDisplay": "2",
      "roundsDisplay": "0",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "0",
        "tex": "0",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://dept-info.labri.fr/~gavoille/article/BGPW25.pdf#page=2",
            "title": "Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors",
            "location": "Introduction, constant-round algorithms; footnote 1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "sota": {
        "scopeLabel": "Positive-degree regular · zero rounds",
        "setting": "Unweighted vertex cover on positive-degree regular graphs; deterministic CONGEST; zero rounds; no identifiers or degree knowledge required; factor 2.",
        "reason": "The zero-round construction attains factor 2, and zero communication is minimal. The deterministic constant-locality factor-2 lower bound already applies to cycles, which are regular. General-graph exact-2 algorithms with degree-dependent or polylogarithmic round complexities do not dominate this zero-round point.",
        "evidenceUrl": "https://jukkasuomela.fi/doc/linear-order.pdf#page=4",
        "checked": "2026-11-16",
        "conditionIds": []
      },
      "frontierStatus": "frontier",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "tightness": [
        {
          "certificateId": "regular-vertex-cover-factor-two",
          "resultId": "folklore-regular-vc",
          "graphs": [
            "regular",
            "cycle"
          ],
          "problems": [
            "vertex-cover"
          ],
          "models": [
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": []
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "OPT",
          "description": "Minimum cardinality of a feasible solution",
          "tex": "\\mathrm{OPT}"
        },
        {
          "symbol": "D",
          "description": "Vertex set selected by the algorithm",
          "tex": "D"
        },
        {
          "symbol": "d",
          "description": "Common positive degree of every vertex in the regular input graph",
          "tex": "d"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the communication graph",
          "tex": "n"
        },
        {
          "symbol": "p",
          "description": "Cardinality of the comparison vertex cover in the proof",
          "tex": "p"
        }
      ],
      "setting": {
        "summary": [
          "graph-regular-positive",
          "weights-unweighted"
        ],
        "parameters": [],
        "assumptions": [],
        "detail": [
          "strength-no-ids",
          "strength-no-degree-knowledge"
        ],
        "covered": [
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-7f07455ff69b3b347e9b",
          "graph-regular",
          "graph-regular-positive",
          "input-positive-degree",
          "strength-no-communication",
          "strength-no-degree-knowledge",
          "strength-no-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "folklore-unitdisk-vc",
      "problem": "Vertex cover",
      "variant": "Unweighted; select nonisolated vertices",
      "objective": "min",
      "graphClass": "Unit-disk",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "6",
      "rounds": "1",
      "roundClass": "constant",
      "parameters": "Unit-disk graphs in the plane.",
      "assumptions": "Unweighted. No geometric representation or identifiers are needed. One empty-message round detects isolates; zero rounds suffice if local degree is initially known.",
      "paperId": "pic-bgpw-large-2025",
      "theorem": "Introduction, constant-round algorithms",
      "summary": "Selecting every nonisolated vertex gives a geometry-free constant approximation.",
      "verification": "primary",
      "sourceUrl": "https://dept-info.labri.fr/~gavoille/article/BGPW25.pdf#page=2",
      "year": 2025,
      "attribution": "folklore",
      "algorithm": "Send a dummy message on every incident edge, then select vertices that receive a message.",
      "proofSketch": "Outside an optimum cover, nonisolated vertices form an independent set and each has a neighbor in the cover. A unit-disk neighborhood contains at most five independent neighbors, so at most five such vertices are charged to each optimum vertex. Including the cover itself gives factor six.",
      "provenanceNote": "Folklore baseline documented by the cited source; 2025 is the source year, not a discovery claim. The one-round isolate detection is an explicit implementation choice.",
      "proofFormula": "|D| ≤ 6 OPT",
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "unit-disk"
      },
      "approximationDisplay": "6",
      "roundsDisplay": "1",
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "1",
        "tex": "1",
        "basis": "recorded",
        "explanation": "",
        "evidence": [
          {
            "url": "https://dept-info.labri.fr/~gavoille/article/BGPW25.pdf#page=2",
            "title": "Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors",
            "location": "Introduction, constant-round algorithms"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false
      },
      "frontierStatus": "unreviewed",
      "weightCondition": "weights-unweighted",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "OPT",
          "description": "Minimum cardinality of a feasible solution",
          "tex": "\\mathrm{OPT}"
        },
        {
          "symbol": "D",
          "description": "Vertex set selected by the algorithm",
          "tex": "D"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-422a8fcd40a47bc44c15",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-0b7cb0040f1e25baeba5"
        ],
        "assumptions": [
          "auto-assumption-8465d976c4ce42e13ba6"
        ],
        "detail": [],
        "covered": [
          "auto-assumption-8465d976c4ce42e13ba6",
          "auto-graph-422a8fcd40a47bc44c15",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-7f07455ff69b3b347e9b",
          "auto-parameter-0b7cb0040f1e25baeba5",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-sparse-expansion-constant--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Bounded expansion",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (f(∇₁))",
      "rounds": "(f(∇₁)) + 4",
      "roundClass": "parameter",
      "parameters": "Source result (sparse-expansion-constant), evaluated on its transformed instance: Fixed integer upper bound ∇₁ > 0 on the edge density of depth-1 minors. Both the approximation ratio and round complexity depend on ∇₁.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (sparse-expansion-constant), evaluated on its transformed instance: Unique identifiers; an upper bound on ∇₁ is supplied; no embedding is supplied.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "heydt-sparse-2022",
      "theorem": "Theorem 2.1 and following parameter-dependence discussion; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: The approximation ratio and round complexity are bounded functions of the depth-1 density bound.",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/pdf/2207.02669#page=5",
      "year": 2022,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "expansion"
      },
      "approximationDisplay": "(1 + 2∇₁) · (f(∇₁))",
      "roundsDisplay": "(f(∇₁)) + 4",
      "roundClassSource": "constant",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "sparse-expansion-constant",
      "parentResultId": "sparse-expansion-constant",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Bounded expansion",
      "sourceMath": {
        "rounds": "O(1)",
        "roundsDisplay": "f(∇₁)",
        "roundsTex": "O(1)",
        "roundsDisplayTex": "f\\bigl(\\nabla_1\\bigr)",
        "approximation": "O(1)",
        "approximationDisplay": "f(∇₁)",
        "approximationTex": "O(1)",
        "approximationDisplayTex": "f\\bigl(\\nabla_1\\bigr)",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "sparse-expansion-constant",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "expansion",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "expansion"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(f\\bigl(\\nabla_1\\bigr)\\bigr)+4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(f\\bigl(\\nabla_1\\bigr)\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "(f(∇₁)) + 4",
        "tex": "\\bigl(f\\bigl(\\nabla_1\\bigr)\\bigr)+4",
        "basis": "reduction",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2207.02669#page=5",
            "title": "Distributed domination on sparse graph classes",
            "location": "Theorem 2.1 and following parameter-dependence discussion"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "symbolic",
        "derivedFrom": "sparse-expansion-constant"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Supplied upper bound on depth-one minor density",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-18d80e24949ad78541c0",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-4b8d3e3588a5713a9505"
        ],
        "assumptions": [
          "auto-assumption-d1beb330b75a6fc6b73f"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-d1beb330b75a6fc6b73f",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-18d80e24949ad78541c0",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-4b8d3e3588a5713a9505",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-sparse-planar-eleven--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "7 · (11 + ε)",
      "rounds": "(f(ε)) + 4",
      "roundClass": "parameter",
      "parameters": "Source result (sparse-planar-eleven), evaluated on its transformed instance: Fixed ε > 0; the round complexity depends on ε.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (sparse-planar-eleven), evaluated on its transformed instance: Unique identifiers; no embedding is supplied.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "heydt-sparse-2022",
      "theorem": "Abstract; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: The planar specialization improves the approximation guarantee.",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/abs/2207.02669",
      "year": 2022,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "7 · (11 + ε)",
      "roundsDisplay": "(f(ε)) + 4",
      "roundClassSource": "constant",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "sparse-planar-eleven",
      "parentResultId": "sparse-planar-eleven",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Planar",
      "sourceMath": {
        "rounds": "O(1)",
        "roundsDisplay": "f(ε)",
        "roundsTex": "O(1)",
        "roundsDisplayTex": "f\\bigl(\\varepsilon\\bigr)",
        "approximation": "11 + ε",
        "approximationDisplay": "11 + ε",
        "approximationTex": "11 + \\varepsilon",
        "approximationDisplayTex": "11 + \\varepsilon",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "sparse-planar-eleven",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "planar",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "7",
            "tex": "7",
            "graph": "planar"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "planar"
              ],
              "edges": []
            },
            "bound": {
              "graph": "planar",
              "label": "7",
              "tex": "7",
              "certificate": "Planarity is minor-closed and planar minors have edge density at most three."
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(f\\bigl(\\varepsilon\\bigr)\\bigr)+4",
        "approximation": "7\\cdot\\bigl(11 + \\varepsilon\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "(f(ε)) + 4",
        "tex": "\\bigl(f\\bigl(\\varepsilon\\bigr)\\bigr)+4",
        "basis": "reduction",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2207.02669",
            "title": "Distributed domination on sparse graph classes",
            "location": "Abstract"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "symbolic",
        "derivedFrom": "sparse-planar-eleven"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-a746b2e1e9cbb39defe4"
        ],
        "assumptions": [
          "auto-assumption-8ab529c47831716b6bad"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-8ab529c47831716b6bad",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-a746b2e1e9cbb39defe4",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-dory-arboricity-lower--mds-to-local-covering",
      "problem": "Integral local covering",
      "variant": "Source algorithm: Unweighted",
      "objective": "min",
      "graphClass": "Arboricity 2",
      "model": "LOCAL",
      "randomization": "Randomized",
      "bound": "lower",
      "approximation": "Constant or polylogarithmic factor",
      "rounds": "Ω(log Δ / log log Δ)",
      "roundClass": "degree",
      "parameters": "Source result (dory-arboricity-lower), evaluated on its transformed instance: Δ is the maximum degree.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (dory-arboricity-lower), evaluated on its transformed instance: Unweighted graphs; the lower bound applies to deterministic and randomized LOCAL algorithms.\n\nClosed-neighborhood requests: Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags. Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination.",
      "paperId": "dory-arboricity-2022",
      "theorem": "Lower bound theorem; derived via mds-to-local-covering",
      "summary": "Derived lower bound via Closed-neighborhood requests. Original source: Bounded arboricity alone does not give constant-round domination.",
      "verification": "derived",
      "sourceUrl": "https://pmc.ncbi.nlm.nih.gov/articles/PMC11543758/",
      "year": 2022,
      "problemScope": {
        "node": "local-covering"
      },
      "graphScope": {
        "node": "arboricity-two"
      },
      "approximationDisplay": "Constant or polylogarithmic factor",
      "roundsDisplay": "Ω(log Δ / log log Δ)",
      "weightCondition": "weights-unweighted",
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "dory-arboricity-lower",
      "parentResultId": "dory-arboricity-lower",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Arboricity 2",
      "sourceMath": {
        "rounds": "Ω(log Δ / log log Δ)",
        "roundsDisplay": "Ω(log Δ / log log Δ)",
        "roundsTex": "\\Omega\\!\\left(\\frac{\\log\\Delta}{\\log\\log\\Delta}\\right)",
        "roundsDisplayTex": "\\Omega\\!\\left(\\frac{\\log\\Delta}{\\log\\log\\Delta}\\right)",
        "approximation": "Constant or polylogarithmic factor",
        "approximationDisplay": "Constant or polylogarithmic factor",
        "approximationTex": "\\text{Constant or polylogarithmic factor}",
        "approximationDisplayTex": "\\text{Constant or polylogarithmic factor}",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "mds-to-local-covering"
      ],
      "reductionDirection": "lower",
      "reductionSteps": [
        {
          "id": "mds-to-local-covering",
          "title": "Closed-neighborhood requests",
          "inputResultId": "dory-arboricity-lower",
          "outputProblem": "local-covering",
          "outputGraph": "arboricity-two",
          "from": "dominating-set",
          "to": "local-covering",
          "direction": "lower",
          "substitutions": {},
          "cost": "T",
          "factor": "identity",
          "conditions": [
            "Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags.",
            "Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved.",
            "The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required.",
            "T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated."
          ],
          "assumptions": [
            "Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination."
          ],
          "source": {
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "location": "Section 6.6; Appendix D"
          },
          "modelConversion": null
        }
      ],
      "derivedMath": {
        "rounds": "\\Omega\\!\\left(\\frac{\\log\\Delta}{\\log\\log\\Delta}\\right)",
        "approximation": "\\text{Constant or polylogarithmic factor}"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Ω(log Δ / log log Δ)",
        "tex": "\\Omega\\!\\left(\\frac{\\log\\Delta}{\\log\\log\\Delta}\\right)",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Closed-neighborhood requests.",
        "evidence": [
          {
            "url": "https://pmc.ncbi.nlm.nih.gov/articles/PMC11543758/",
            "title": "Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs",
            "location": "Lower bound theorem"
          },
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "location": "Section 6.6; Appendix D"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "dory-arboricity-lower"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a6106837b5e5e7d68a12",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-bdd72288e007121f64ba"
        ],
        "assumptions": [
          "auto-assumption-5b4f90dfd88d9c1219fb"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-5b4f90dfd88d9c1219fb",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-a6106837b5e5e7d68a12",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-output-d13f16e4e51c9b55f160",
          "auto-parameter-bdd72288e007121f64ba",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-heydt-planar-twenty--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "7 · (20)",
      "rounds": "(Constant) + 4",
      "roundClass": "constant",
      "parameters": "Source result (heydt-planar-twenty), evaluated on its transformed instance: No fixed degree bound is required.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (heydt-planar-twenty), evaluated on its transformed instance: Unique identifiers; no embedding is supplied.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "heydt-planar-2021",
      "theorem": "Abstract; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: Historical bound combining local reductions and greedy domination.",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/abs/2111.14506v1",
      "year": 2021,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "7 · (20)",
      "roundsDisplay": "(Constant) + 4",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "heydt-planar-twenty",
      "parentResultId": "heydt-planar-twenty",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Planar",
      "sourceMath": {
        "rounds": "O(1)",
        "roundsDisplay": "Constant",
        "roundsTex": "O(1)",
        "roundsDisplayTex": "\\text{Constant}",
        "approximation": "20",
        "approximationDisplay": "20",
        "approximationTex": "20",
        "approximationDisplayTex": "20",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "heydt-planar-twenty",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "planar",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "7",
            "tex": "7",
            "graph": "planar"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "planar"
              ],
              "edges": []
            },
            "bound": {
              "graph": "planar",
              "label": "7",
              "tex": "7",
              "certificate": "Planarity is minor-closed and planar minors have edge density at most three."
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(\\text{Constant}\\bigr)+4",
        "approximation": "7\\cdot\\bigl(20\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "(Constant) + 4",
        "tex": "\\bigl(\\text{Constant}\\bigr)+4",
        "basis": "reduction",
        "explanation": "The paper gives two rounds for D1 and two further rounds for D2, and mentions thirty greedy iterations. These are not a complete communication count: the residual-degree updates and selection notifications also require communication. The available description does not give a verified total for the full algorithm. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2111.14506v1",
            "title": "Primary source reviewed",
            "location": "Section 3 PDF p. 4; Section 4 PDF p. 5; Section 5 PDF p. 7; introduction PDF p. 2"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "not-specified",
        "derivedFrom": "heydt-planar-twenty"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-04d7672090e528040a29"
        ],
        "assumptions": [
          "auto-assumption-67acb8640b93dad1f4e1"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-67acb8640b93dad1f4e1",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-04d7672090e528040a29",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-morgan-arboricity--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Arboricity ≤ α",
      "model": "LOCAL",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (O(α))",
      "rounds": "(O(α log n)) + 4",
      "roundClass": "logarithmic",
      "parameters": "Source result (morgan-arboricity), evaluated on its transformed instance: α is the arboricity bound.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (morgan-arboricity), evaluated on its transformed instance: Unweighted; the stated round complexity is achieved with high probability.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.\n\nThe source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only.",
      "paperId": "morgan-arboricity-2021",
      "theorem": "Abstract; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: A combinatorial alternative to LP rounding.",
      "verification": "derived",
      "sourceUrl": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.33",
      "year": 2021,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "density",
        "note": "Use compatible fixed arboricity bounds; planar inputs permit an arboricity bound of 3."
      },
      "approximationDisplay": "(1 + 2∇₁) · (O(α))",
      "roundsDisplay": "(O(α log n)) + 4",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "morgan-arboricity",
      "parentResultId": "morgan-arboricity",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Arboricity ≤ α",
      "sourceMath": {
        "rounds": "O(α log n)",
        "roundsDisplay": "O(α log n)",
        "roundsTex": "O(\\alpha  \\log n)",
        "roundsDisplayTex": "O(\\alpha  \\log n)",
        "approximation": "O(α)",
        "approximationDisplay": "O(α)",
        "approximationTex": "O(\\alpha )",
        "approximationDisplayTex": "O(\\alpha )",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "morgan-arboricity",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "density",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": "The source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only.",
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "density"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(O(\\alpha  \\log n)\\bigr)+4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(O(\\alpha )\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "(O(α log n)) + 4",
        "tex": "\\bigl(O(\\alpha  \\log n)\\bigr)+4",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.33",
            "title": "Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs: Simpler, Faster, and Combinatorial",
            "location": "Abstract"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "morgan-arboricity"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "α",
          "description": "Arboricity bound of the input graph",
          "tex": "\\alpha"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-97a0a2af0e526b2ffcd5",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-b868ca1b58048808ce4c"
        ],
        "assumptions": [
          "auto-assumption-125ef2eb5cc82c9a0b8e"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-125ef2eb5cc82c9a0b8e",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-97a0a2af0e526b2ffcd5",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-b868ca1b58048808ce4c",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-outerplanar-five--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Outerplanar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "7 · (5)",
      "rounds": "5",
      "roundClass": "constant",
      "parameters": "Source result (outerplanar-five), evaluated on its transformed instance: No fixed degree bound is required.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (outerplanar-five), evaluated on its transformed instance: Only degrees and neighbors’ degree categories are needed; unique IDs are unnecessary.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.\n\nThe source Anonymous algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only.",
      "paperId": "bonamy-outerplanar-2021",
      "theorem": "Theorem 1; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: A degree-based algorithm with a tight constant guarantee.",
      "verification": "derived",
      "sourceUrl": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.13",
      "year": 2021,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "outerplanar"
      },
      "approximationDisplay": "7 · (5)",
      "roundsDisplay": "5",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "outerplanar-five",
      "parentResultId": "outerplanar-five",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Outerplanar",
      "sourceMath": {
        "rounds": "O(1)",
        "roundsDisplay": "1",
        "roundsTex": "O(1)",
        "roundsDisplayTex": "1",
        "approximation": "5",
        "approximationDisplay": "5",
        "approximationTex": "5",
        "approximationDisplayTex": "5",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "outerplanar-five",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "outerplanar",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": "The source Anonymous algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only.",
          "multiplier": {
            "label": "7",
            "tex": "7",
            "graph": "planar"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "outerplanar",
                "planar"
              ],
              "edges": [
                {
                  "subset": "outerplanar",
                  "superset": "planar",
                  "reason": "Every outerplanar embedding is planar.",
                  "lower": true
                }
              ]
            },
            "bound": {
              "graph": "planar",
              "label": "7",
              "tex": "7",
              "certificate": "Planarity is minor-closed and planar minors have edge density at most three."
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "5",
        "approximation": "7\\cdot\\bigl(5\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "5",
        "tex": "5",
        "basis": "reduction",
        "explanation": "Algorithm 1 explicitly uses the first round to exchange local degrees. Each vertex then selects itself if its degree is at least four or if it has no neighbor of degree at least four. The source assumes incident ports and local degree are initially available. Neither identifiers nor an embedding are needed. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol209-disc2021/LIPIcs.DISC.2021.13/LIPIcs.DISC.2021.13.pdf#page=2",
            "title": "Primary source communication schedule",
            "location": "Theorem 1; Algorithm 1, PDF p. 2 (printed 13:2)"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "stated",
        "derivedFrom": "outerplanar-five"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-2379fa66cc1a5f1d4e5c",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-31f43ac1ede1d376b459"
        ],
        "assumptions": [
          "auto-assumption-4a96ab7b728ad0de925f"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-4a96ab7b728ad0de925f",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-2379fa66cc1a5f1d4e5c",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-31f43ac1ede1d376b459",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-outerplanar-five-lower--mds-to-local-covering",
      "problem": "Integral local covering",
      "variant": "Source algorithm: Unweighted",
      "objective": "min",
      "graphClass": "Outerplanar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "approximation": "> 5 − ε",
      "rounds": "Constant rounds ruled out",
      "roundClass": "constant",
      "parameters": "Source result (outerplanar-five-lower), evaluated on its transformed instance: Any fixed ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (outerplanar-five-lower), evaluated on its transformed instance: Deterministic LOCAL algorithms, including algorithms with unique IDs.\n\nClosed-neighborhood requests: Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags. Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination.",
      "paperId": "bonamy-outerplanar-2021",
      "theorem": "Theorem 1; derived via mds-to-local-covering",
      "summary": "Derived lower bound via Closed-neighborhood requests. Original source: No smaller constant factor is possible in constant time.",
      "verification": "derived",
      "sourceUrl": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.13",
      "year": 2021,
      "roundBudgetExcluded": true,
      "problemScope": {
        "node": "local-covering"
      },
      "graphScope": {
        "node": "outerplanar"
      },
      "approximationDisplay": "> 5 − ε",
      "roundsDisplay": "Constant rounds ruled out",
      "weightCondition": "weights-unweighted",
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "outerplanar-five-lower",
      "parentResultId": "outerplanar-five-lower",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Outerplanar",
      "sourceMath": {
        "rounds": "O(1) rounds ruled out",
        "roundsDisplay": "Constant rounds ruled out",
        "roundsTex": "O(1)\\text{ rounds ruled out}",
        "roundsDisplayTex": "\\text{Constant rounds ruled out}",
        "approximation": "No (5 − ε)-approximation",
        "approximationDisplay": "> 5 − ε",
        "approximationTex": "\\text{No }(5-\\varepsilon)\\text{-approximation}",
        "approximationDisplayTex": "> 5-\\varepsilon",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "mds-to-local-covering"
      ],
      "reductionDirection": "lower",
      "reductionSteps": [
        {
          "id": "mds-to-local-covering",
          "title": "Closed-neighborhood requests",
          "inputResultId": "outerplanar-five-lower",
          "outputProblem": "local-covering",
          "outputGraph": "outerplanar",
          "from": "dominating-set",
          "to": "local-covering",
          "direction": "lower",
          "substitutions": {},
          "cost": "T",
          "factor": "identity",
          "conditions": [
            "Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags.",
            "Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved.",
            "The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required.",
            "T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated."
          ],
          "assumptions": [
            "Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination."
          ],
          "source": {
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "location": "Section 6.6; Appendix D"
          },
          "modelConversion": null
        }
      ],
      "derivedMath": {
        "rounds": "\\text{Constant rounds ruled out}",
        "approximation": "> 5-\\varepsilon"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Constant rounds ruled out",
        "tex": "\\text{Constant rounds ruled out}",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Closed-neighborhood requests.",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.13",
            "title": "A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs",
            "location": "Theorem 1"
          },
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "location": "Section 6.6; Appendix D"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "outerplanar-five-lower"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-2379fa66cc1a5f1d4e5c",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-7ba8fd91ab2741952600"
        ],
        "assumptions": [
          "auto-assumption-8f4170ff9b582f6956d9"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-8f4170ff9b582f6956d9",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-2379fa66cc1a5f1d4e5c",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-d13f16e4e51c9b55f160",
          "auto-parameter-7ba8fd91ab2741952600",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-kublenz-expansion--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Bounded expansion",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (f(∇₁))",
      "rounds": "≤ 15",
      "roundClass": "constant",
      "parameters": "Source result (kublenz-expansion), evaluated on its transformed instance: Known upper bound ∇₁ on the edge density of depth-1 minors; t is the least integer such that Kₜ,ₜ is absent as a subgraph, with t ≤ 2∇₁ + 1. The approximation ratio depends on these parameters; the number of LOCAL communication rounds is universally bounded.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (kublenz-expansion), evaluated on its transformed instance: Unique identifiers; an upper bound on ∇₁ is supplied; no embedding is supplied.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "kublenz-expansion-2020",
      "theorem": "Theorem 1.1; Section 6 (corrected v3); derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: The corrected algorithm uses a universal constant number of LOCAL communication phases; its approximation ratio depends on the depth-1 density.",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/html/2012.02701v3#S6",
      "year": 2020,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "expansion"
      },
      "approximationDisplay": "(1 + 2∇₁) · (f(∇₁))",
      "roundsDisplay": "≤ 15",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "kublenz-expansion",
      "parentResultId": "kublenz-expansion",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Bounded expansion",
      "sourceMath": {
        "rounds": "O(1)",
        "roundsDisplay": "≤ 11",
        "roundsTex": "O(1)",
        "roundsDisplayTex": "\\le 11",
        "approximation": "O(1)",
        "approximationDisplay": "f(∇₁)",
        "approximationTex": "O(1)",
        "approximationDisplayTex": "f\\bigl(\\nabla_1\\bigr)",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "kublenz-expansion",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "expansion",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "expansion"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\le 15",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(f\\bigl(\\nabla_1\\bigr)\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "≤ 15",
        "tex": "\\le 15",
        "basis": "reduction",
        "explanation": "A conservative sequential count is 3 + 7 + 1 = 11: two rounds to inspect radius-two neighborhoods and one to mark neighbors of D1; then two neighborhood exchanges, two rounds to compute sequences, two to report their endpoints, and one to mark neighbors of D2; finally, the source includes a last selection step. This includes that final step conservatively and does not claim an optimized schedule. The algorithm uses distinct identifiers and a supplied upper bound on depth-one density. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2012.02701v3#page=15",
            "title": "Primary source communication schedule",
            "location": "Section 2, PDF pp. 6–7; Section 6, PDF p. 15; corrected arXiv v3"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "phase-count",
        "derivedFrom": "kublenz-expansion"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Supplied upper bound on depth-one minor density",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "t",
          "description": "Least integer for which the complete bipartite graph K_{t,t} is absent as a subgraph; t ≤ 2∇₁+1",
          "tex": "t"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-18d80e24949ad78541c0",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-208c1f9cd2482ecf1568"
        ],
        "assumptions": [
          "auto-assumption-5c3131301b7d8b8ed732"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-5c3131301b7d8b8ed732",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-18d80e24949ad78541c0",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-208c1f9cd2482ecf1568",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-amiri-locally-embeddable--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Locally embeddable",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (6c²t + (2t + 5)c + 4)",
      "rounds": "≤ 10",
      "roundClass": "constant",
      "parameters": "Source result (amiri-locally-embeddable), evaluated on its transformed instance: ∇₁(G) is the maximum edge density |E(H)|/|V(H)| over nonempty depth-1 minors H of G. The supplied integer c satisfies c ≥ ∇₁(G); one may take c=⌈∇₁(G)⌉ if supplied. For a fixed integer t ≥ 3, K₃,ₜ is excluded as a depth-1 minor. The approximation ratio depends on c and t; the number of LOCAL communication rounds is universally bounded.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (amiri-locally-embeddable), evaluated on its transformed instance: Unique identifiers; a supplied integer c bounds the edge density of every depth-1 minor; no embedding is supplied.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "amiri-beyond-2017",
      "theorem": "Algorithm 1; Lemma 3.8; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: A fixed number of LOCAL communication phases gives an approximation depending on the local embeddability parameters.",
      "verification": "derived",
      "sourceUrl": "https://schmiste.github.io/talg19ds.pdf#page=11",
      "year": 2017,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "local-embedding"
      },
      "approximationDisplay": "(1 + 2∇₁) · (6c²t + (2t + 5)c + 4)",
      "roundsDisplay": "≤ 10",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "amiri-locally-embeddable",
      "parentResultId": "amiri-locally-embeddable",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Locally embeddable",
      "sourceMath": {
        "rounds": "O(1)",
        "roundsDisplay": "≤ 6",
        "roundsTex": "O(1)",
        "roundsDisplayTex": "\\le 6",
        "approximation": "6c²t + (2t + 5)c + 4",
        "approximationDisplay": "6c²t + (2t + 5)c + 4",
        "approximationTex": "6c^2t+(2t+5)c+4",
        "approximationDisplayTex": "6c^2t+(2t+5)c+4",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "amiri-locally-embeddable",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "local-embedding",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "local-embedding"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\le 10",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(6c^2t+(2t+5)c+4\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "≤ 10",
        "tex": "\\le 10",
        "basis": "reduction",
        "explanation": "Rounds 1–2: exchange identifiers then neighbor lists; decide phase-one set D using adjacencies from N(v) to candidate vertices in N²(v). Round 3: broadcast D membership; each vertex knows whether it lies in N[D]. Round 4: broadcast uncovered flags; each vertex computes residual closed-neighborhood degree. Round 5: broadcast residual degrees; each uncovered vertex chooses its dominator. Round 6: notify selected neighbors; all vertices know final membership. The source initially gives only each vertex its own ID. Unbounded LOCAL messages permit the lists. Auxiliary density c and excluded-depth-one-minor t affect local computation/analysis, not communication phases. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://schmiste.github.io/talg19ds.pdf#page=7",
            "title": "Primary source algorithm",
            "location": "Algorithm 1, PDF pp. 6–7; modified density threshold; Lemma 3.8"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "phase-count",
        "derivedFrom": "amiri-locally-embeddable"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁(G)",
          "description": "Maximum edge-to-vertex ratio over nonempty depth-one minors of G",
          "tex": "\\nabla_1(G)"
        },
        {
          "symbol": "∇₁",
          "description": "Depth-one minor density of the input graph",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "G",
          "description": "Input graph",
          "tex": "G"
        },
        {
          "symbol": "H",
          "description": "A minor of the input graph; depth one in the locally embeddable result",
          "tex": "H"
        },
        {
          "symbol": "c",
          "description": "Supplied integer upper bound on depth-one minor density ∇₁(G)",
          "tex": "c"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "t",
          "description": "Integer at least three such that K_{3,t} is excluded as a depth-one minor",
          "tex": "t"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-3e2ec5f6ef8ff6c28460",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-9840ca328d0bb8f0782a"
        ],
        "assumptions": [
          "auto-assumption-eb20cfb1e526e02dd11f"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-eb20cfb1e526e02dd11f",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-3e2ec5f6ef8ff6c28460",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-9840ca328d0bb8f0782a",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-amiri-genus-ptas--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Bounded genus",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (1 + ε)",
      "rounds": "(O(log* n)) + 4",
      "roundClass": "logstar",
      "parameters": "Source result (amiri-genus-ptas), evaluated on its transformed instance: Fixed genus g and ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (amiri-genus-ptas), evaluated on its transformed instance: Unique identifiers; no embedding is supplied.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "amiri-beyond-2017",
      "theorem": "Abstract; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: A local approximation scheme for bounded genus.",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/abs/1705.09617",
      "year": 2017,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "orientable",
        "note": "The historical record does not establish applicability to every bounded Euler-genus family."
      },
      "approximationDisplay": "(1 + 2∇₁) · (1 + ε)",
      "roundsDisplay": "(O(log* n)) + 4",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "amiri-genus-ptas",
      "parentResultId": "amiri-genus-ptas",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Bounded genus",
      "sourceMath": {
        "rounds": "O(log* n)",
        "roundsDisplay": "O(log* n)",
        "roundsTex": "O(\\log^* n)",
        "roundsDisplayTex": "O(\\log^* n)",
        "approximation": "1 + ε",
        "approximationDisplay": "1 + ε",
        "approximationTex": "1 + \\varepsilon",
        "approximationDisplayTex": "1 + \\varepsilon",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "amiri-genus-ptas",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "orientable",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "orientable"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(O(\\log^* n)\\bigr)+4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(1 + \\varepsilon\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "(O(log* n)) + 4",
        "tex": "\\bigl(O(\\log^* n)\\bigr)+4",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/1705.09617",
            "title": "Distributed Dominating Set Approximations beyond Planar Graphs",
            "location": "Abstract"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "amiri-genus-ptas"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "g",
          "description": "Fixed genus bound in the convention of the source",
          "tex": "g"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-328b3babf04eeaf07339",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-09e6a1e1be5f62731887"
        ],
        "assumptions": [
          "auto-assumption-8ca0d1f06e284f15af19"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-8ca0d1f06e284f15af19",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-328b3babf04eeaf07339",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-09e6a1e1be5f62731887",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-czygrinow-topological-dom--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Excluded topological Kₕ",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (f(h))",
      "rounds": "(f(h)) + 4",
      "roundClass": "parameter",
      "parameters": "Source result (czygrinow-topological-dom), evaluated on its transformed instance: Fixed h; both constants depend on h.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (czygrinow-topological-dom), evaluated on its transformed instance: Unique identifiers; no embedding is supplied.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "czygrinow-minor-2018",
      "theorem": "Abstract; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: Constant-factor domination under topological-minor exclusion.",
      "verification": "derived",
      "sourceUrl": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.22",
      "year": 2018,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "topological"
      },
      "approximationDisplay": "(1 + 2∇₁) · (f(h))",
      "roundsDisplay": "(f(h)) + 4",
      "roundClassSource": "constant",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "czygrinow-topological-dom",
      "parentResultId": "czygrinow-topological-dom",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Excluded topological Kₕ",
      "sourceMath": {
        "rounds": "O(1)",
        "roundsDisplay": "f(h)",
        "roundsTex": "O(1)",
        "roundsDisplayTex": "f\\bigl(h\\bigr)",
        "approximation": "O(1)",
        "approximationDisplay": "f(h)",
        "approximationTex": "O(1)",
        "approximationDisplayTex": "f\\bigl(h\\bigr)",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "czygrinow-topological-dom",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "topological",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "topological"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(f\\bigl(h\\bigr)\\bigr)+4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(f\\bigl(h\\bigr)\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "(f(h)) + 4",
        "tex": "\\bigl(f\\bigl(h\\bigr)\\bigr)+4",
        "basis": "reduction",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.22",
            "title": "Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs",
            "location": "Abstract"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "symbolic",
        "derivedFrom": "czygrinow-topological-dom"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "h",
          "description": "Number of vertices in the excluded complete graph K_h",
          "tex": "h"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-f06d27c0e3b1ee4832f6",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-6a2b0d26e0ee9796c468"
        ],
        "assumptions": [
          "auto-assumption-5343fe54e1eb1c50a5dd"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-5343fe54e1eb1c50a5dd",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-f06d27c0e3b1ee4832f6",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-6a2b0d26e0ee9796c468",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-czygrinow-minor-ptas--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Excluded Kₕ minor",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (1 + ε)",
      "rounds": "(O(log* n)) + 4",
      "roundClass": "logstar",
      "parameters": "Source result (czygrinow-minor-ptas), evaluated on its transformed instance: Fixed h and ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (czygrinow-minor-ptas), evaluated on its transformed instance: Unique identifiers; no embedding is supplied.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "czygrinow-minor-2018",
      "theorem": "Abstract; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: A scheme on a proper minor-closed family.",
      "verification": "derived",
      "sourceUrl": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.22",
      "year": 2018,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "(1 + 2∇₁) · (1 + ε)",
      "roundsDisplay": "(O(log* n)) + 4",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "czygrinow-minor-ptas",
      "parentResultId": "czygrinow-minor-ptas",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Excluded Kₕ minor",
      "sourceMath": {
        "rounds": "O(log* n)",
        "roundsDisplay": "O(log* n)",
        "roundsTex": "O(\\log^* n)",
        "roundsDisplayTex": "O(\\log^* n)",
        "approximation": "1 + ε",
        "approximationDisplay": "1 + ε",
        "approximationTex": "1 + \\varepsilon",
        "approximationDisplayTex": "1 + \\varepsilon",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "czygrinow-minor-ptas",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "minor",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "minor"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(O(\\log^* n)\\bigr)+4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(1 + \\varepsilon\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "(O(log* n)) + 4",
        "tex": "\\bigl(O(\\log^* n)\\bigr)+4",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.22",
            "title": "Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs",
            "location": "Abstract"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "czygrinow-minor-ptas"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "h",
          "description": "Number of vertices in the excluded complete graph K_h",
          "tex": "h"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-0c9054ce7c0f254cff8a",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-6147bcd81bc255ba9c01"
        ],
        "assumptions": [
          "auto-assumption-302732ef407345e0d47b"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-302732ef407345e0d47b",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-0c9054ce7c0f254cff8a",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-6147bcd81bc255ba9c01",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-amiri-planar-connected--mds-via-connected-domination",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "3 · (Constant)",
      "rounds": "≤ 10",
      "roundClass": "constant",
      "parameters": "Source result (amiri-planar-connected), evaluated on its transformed instance: No degree bound.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (amiri-planar-connected), evaluated on its transformed instance: Connected unweighted input; uses a constant-factor dominating set as a subroutine.\n\nReuse a connected dominating set: On a nonempty connected graph with unit vertex costs, run the source connected-dominating-set algorithm and return exactly its selected vertices as an ordinary dominating set. OPT_MDS ≤ OPT_CDS ≤ 3 OPT_MDS − 2. Thus an α-approximation against integral OPT_CDS gives a 3α-approximation against integral OPT_MDS, with no additional communication. The optimum comparison is unweighted. On a three-vertex path with costs (1,M,1), ordinary domination costs at most 2 while every connected dominating set costs at least M. The target remains restricted to connected inputs. Do not extend a connected-input algorithm to disconnected networks without checking component-wise operation, termination and global inputs. No fractional-MDS benchmark or lower-bound transfer is inferred by this factor-changing rule. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "amiri-distance-2017",
      "theorem": "Abstract; derived via mds-via-connected-domination",
      "summary": "Derived upper bound via Reuse a connected dominating set. Original source: A local connector multiplies the domination ratio by at most six.",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/abs/1702.02848",
      "year": 2017,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "3 · (Constant)",
      "roundsDisplay": "≤ 10",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "amiri-planar-connected",
      "parentResultId": "amiri-planar-connected",
      "sourceProblem": "Connected dominating set",
      "sourceGraphClass": "Planar",
      "sourceMath": {
        "rounds": "O(1)",
        "roundsDisplay": "≤ 10",
        "roundsTex": "O(1)",
        "roundsDisplayTex": "\\le 10",
        "approximation": "O(1)",
        "approximationDisplay": "Constant",
        "approximationTex": "O(1)",
        "approximationDisplayTex": "\\text{Constant}",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "mds-via-connected-domination"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "mds-via-connected-domination",
          "title": "Reuse a connected dominating set",
          "inputResultId": "amiri-planar-connected",
          "outputProblem": "dominating-set",
          "outputGraph": "planar",
          "from": "dominating-set",
          "to": "connected-dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T",
          "factor": "multiply",
          "conditions": [
            "On a nonempty connected graph with unit vertex costs, run the source connected-dominating-set algorithm and return exactly its selected vertices as an ordinary dominating set.",
            "OPT_MDS ≤ OPT_CDS ≤ 3 OPT_MDS − 2. Thus an α-approximation against integral OPT_CDS gives a 3α-approximation against integral OPT_MDS, with no additional communication.",
            "The optimum comparison is unweighted. On a three-vertex path with costs (1,M,1), ordinary domination costs at most 2 while every connected dominating set costs at least M.",
            "The target remains restricted to connected inputs. Do not extend a connected-input algorithm to disconnected networks without checking component-wise operation, termination and global inputs.",
            "No fractional-MDS benchmark or lower-bound transfer is inferred by this factor-changing rule."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Caro, West and Yuster, Connected Domination and Spanning Trees with Many Leaves",
            "url": "https://math.haifa.ac.il/raphy/papers/conndom.pdf#page=4",
            "location": "Lemma 2.1, Duchet–Meyniel inequality; zero-round output reuse is a direct consequence."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "3",
            "tex": "3"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Caro, West and Yuster, Connected Domination and Spanning Trees with Many Leaves",
              "url": "https://math.haifa.ac.il/raphy/papers/conndom.pdf#page=4",
              "location": "Lemma 2.1, Duchet–Meyniel inequality; zero-round output reuse is a direct consequence."
            },
            "graphPath": {
              "nodes": [
                "planar"
              ],
              "edges": []
            },
            "bound": {
              "label": "3",
              "tex": "3"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\le 10",
        "approximation": "3\\cdot\\bigl(\\text{Constant}\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "≤ 10",
        "tex": "\\le 10",
        "basis": "reduction",
        "explanation": "The connecting procedure takes 3r + 1 rounds. With r = 1, this adds four rounds to the six-round planar dominating-set algorithm explicitly used in the paper, giving at most ten rounds in total. This is an upper bound for that composition, not a minimum-round claim. Inputs are connected, unweighted planar graphs with distinct identifiers. The atlas applies the exact instance substitutions and communication cost of the reduction: Reuse a connected dominating set.",
        "evidence": [
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Primary source for the algorithm",
            "location": "Section 5 Connected Dominating Sets; LPW PDF page 14"
          },
          {
            "url": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf#page=14",
            "title": "Lenzen–Pignolet–Wattenhofer, six-round schedule",
            "location": "Lemma 6.1"
          },
          {
            "url": "https://math.haifa.ac.il/raphy/papers/conndom.pdf#page=4",
            "title": "Caro, West and Yuster, Connected Domination and Spanning Trees with Many Leaves",
            "location": "Lemma 2.1, Duchet–Meyniel inequality; zero-round output reuse is a direct consequence."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "phase-count",
        "derivedFrom": "amiri-planar-connected"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted",
          "input-connected"
        ],
        "parameters": [
          "auto-parameter-40ab6b5a993a38a0d206"
        ],
        "assumptions": [
          "auto-assumption-b042ca64db30e652176f"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-b042ca64db30e652176f",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-40ab6b5a993a38a0d206",
          "detail-integral-benchmark",
          "input-connected",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-amiri-genus-constant--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Orientable genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (24g + O(1))",
      "rounds": "(12g + O(1)) + 4",
      "roundClass": "parameter",
      "parameters": "Source result (amiri-genus-constant), evaluated on its transformed instance: Orientable genus at most g; both the approximation ratio and the number of communication rounds depend linearly on g.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (amiri-genus-constant), evaluated on its transformed instance: Unique identifiers; no embedding is supplied.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "amiri-genus-2016",
      "theorem": "Theorem 15; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: The preprocessing algorithm gives a 24g + O(1)-approximation in 12g + O(1) LOCAL rounds.",
      "verification": "derived",
      "sourceUrl": "https://schmiste.github.io/podc16.pdf#page=6",
      "year": 2016,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "orientable",
        "note": "The historical record does not establish applicability to every bounded Euler-genus family."
      },
      "approximationDisplay": "(1 + 2∇₁) · (24g + O(1))",
      "roundsDisplay": "(12g + O(1)) + 4",
      "roundClassSource": "constant",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "amiri-genus-constant",
      "parentResultId": "amiri-genus-constant",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Orientable genus ≤ g",
      "sourceMath": {
        "rounds": "12g + O(1)",
        "roundsDisplay": "12g + O(1)",
        "roundsTex": "12g+O(1)",
        "roundsDisplayTex": "12g+O(1)",
        "approximation": "24g + O(1)",
        "approximationDisplay": "24g + O(1)",
        "approximationTex": "24g+O(1)",
        "approximationDisplayTex": "24g+O(1)",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "amiri-genus-constant",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "orientable",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "orientable"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(12g+O(1)\\bigr)+4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(24g+O(1)\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "(12g + O(1)) + 4",
        "tex": "\\bigl(12g+O(1)\\bigr)+4",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://schmiste.github.io/podc16.pdf#page=6",
            "title": "A Local Constant Factor MDS Approximation for Bounded Genus Graphs",
            "location": "Theorem 15"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "amiri-genus-constant"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "g",
          "description": "Orientable genus upper bound",
          "tex": "g"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-924a81ff2b56320e8d33",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-3c2838dd23471cfed40f"
        ],
        "assumptions": [
          "auto-assumption-d7e60dec92b0c3e1d989"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-d7e60dec92b0c3e1d989",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-924a81ff2b56320e8d33",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-3c2838dd23471cfed40f",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-wawrzyniak-anonymous-694--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "7 · (694)",
      "rounds": "(Constant) + 4",
      "roundClass": "constant",
      "parameters": "Source result (wawrzyniak-anonymous-694), evaluated on its transformed instance: No fixed degree bound is required.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (wawrzyniak-anonymous-694), evaluated on its transformed instance: Port numbering; O(log n)-bit messages; no identifiers.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.\n\nThe source Anonymous algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only.",
      "paperId": "wawrzyniak-anonymous-2015",
      "theorem": "Abstract; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: Constant-factor domination with anonymity and bounded messages.",
      "verification": "derived",
      "sourceUrl": "https://link.springer.com/article/10.1007/s00446-015-0247-6",
      "year": 2015,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "7 · (694)",
      "roundsDisplay": "(Constant) + 4",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "wawrzyniak-anonymous-694",
      "parentResultId": "wawrzyniak-anonymous-694",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Planar",
      "sourceMath": {
        "rounds": "O(1)",
        "roundsDisplay": "Constant",
        "roundsTex": "O(1)",
        "roundsDisplayTex": "\\text{Constant}",
        "approximation": "694",
        "approximationDisplay": "694",
        "approximationTex": "694",
        "approximationDisplayTex": "694",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "wawrzyniak-anonymous-694",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "planar",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": "The source Anonymous algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only.",
          "multiplier": {
            "label": "7",
            "tex": "7",
            "graph": "planar"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "planar"
              ],
              "edges": []
            },
            "bound": {
              "graph": "planar",
              "label": "7",
              "tex": "7",
              "certificate": "Planarity is minor-closed and planar minors have edge density at most three."
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(\\text{Constant}\\bigr)+4",
        "approximation": "7\\cdot\\bigl(694\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "(Constant) + 4",
        "tex": "\\bigl(\\text{Constant}\\bigr)+4",
        "basis": "reduction",
        "explanation": "The journal abstract gives factor 694 and constant round complexity with short messages, but the full algorithm was unavailable. The public arXiv:1303.2514v2 preprint proves the earlier factor 636; without confirming that the corrected journal algorithm has the same schedule, it does not certify a count for the factor-694 entry. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://link.springer.com/article/10.1007/s00446-015-0247-6",
            "title": "Primary source reviewed",
            "location": "Journal abstract; full algorithm unavailable"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "unavailable",
        "derivedFrom": "wawrzyniak-anonymous-694"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-77985a5c248f93ab82fe"
        ],
        "assumptions": [
          "auto-assumption-e7f57578b692af0e4e8d"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-e7f57578b692af0e4e8d",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-77985a5c248f93ab82fe",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-wawrzyniak-planar-52--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "7 · (52)",
      "rounds": "10",
      "roundClass": "constant",
      "parameters": "Source result (wawrzyniak-planar-52), evaluated on its transformed instance: No fixed degree bound is required.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (wawrzyniak-planar-52), evaluated on its transformed instance: Unique identifiers; no embedding is supplied.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "wawrzyniak-52-2014",
      "theorem": "Abstract; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: Sharper analysis of the earlier planar algorithm.",
      "verification": "derived",
      "sourceUrl": "https://www.sciencedirect.com/science/article/abs/pii/S0020019013002767",
      "year": 2014,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "7 · (52)",
      "roundsDisplay": "10",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "wawrzyniak-planar-52",
      "parentResultId": "wawrzyniak-planar-52",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Planar",
      "sourceMath": {
        "rounds": "O(1)",
        "roundsDisplay": "6",
        "roundsTex": "O(1)",
        "roundsDisplayTex": "6",
        "approximation": "52",
        "approximationDisplay": "52",
        "approximationTex": "52",
        "approximationDisplayTex": "52",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "wawrzyniak-planar-52",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "planar",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "7",
            "tex": "7",
            "graph": "planar"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "planar"
              ],
              "edges": []
            },
            "bound": {
              "graph": "planar",
              "label": "7",
              "tex": "7",
              "certificate": "Planarity is minor-closed and planar minors have edge density at most three."
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "10",
        "approximation": "7\\cdot\\bigl(52\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "10",
        "tex": "10",
        "basis": "reduction",
        "explanation": "The 2014 paper proves factor 52 for the unchanged Lenzen–Pignolet–Wattenhofer algorithm. Its six-round schedule therefore remains valid. The count follows from the original Lemma 6.1; the accessible 2014 abstract does not state a separate total. Both results use the same identifiers and initial-information convention. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://www.sciencedirect.com/science/article/abs/pii/S0020019013002767",
            "title": "Primary source for the algorithm",
            "location": "Publisher abstract and section snippet; LPW PDF page 14"
          },
          {
            "url": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf#page=14",
            "title": "Lenzen–Pignolet–Wattenhofer, six-round schedule",
            "location": "Lemma 6.1"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "same-algorithm",
        "derivedFrom": "wawrzyniak-planar-52"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-e30a959e5799900ac29d"
        ],
        "assumptions": [
          "auto-assumption-39a23b387fb069491cef"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-39a23b387fb069491cef",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-e30a959e5799900ac29d",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-planar-seven-lower--mds-to-local-covering",
      "problem": "Integral local covering",
      "variant": "Source algorithm: Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "approximation": "> 7 − ε",
      "rounds": "Constant rounds ruled out",
      "roundClass": "constant",
      "parameters": "Source result (planar-seven-lower), evaluated on its transformed instance: Any fixed ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (planar-seven-lower), evaluated on its transformed instance: Unique identifiers; no embedding is supplied.\n\nClosed-neighborhood requests: Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags. Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination.",
      "paperId": "hilke-planar-lower-2014",
      "theorem": "Abstract; derived via mds-to-local-covering",
      "summary": "Derived lower bound via Closed-neighborhood requests. Original source: A deterministic constant-round approximation barrier.",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/abs/1402.2549",
      "year": 2014,
      "roundBudgetExcluded": true,
      "problemScope": {
        "node": "local-covering"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "> 7 − ε",
      "roundsDisplay": "Constant rounds ruled out",
      "weightCondition": "weights-unweighted",
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "planar-seven-lower",
      "parentResultId": "planar-seven-lower",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Planar",
      "sourceMath": {
        "rounds": "O(1) rounds ruled out",
        "roundsDisplay": "Constant rounds ruled out",
        "roundsTex": "O(1)\\text{ rounds ruled out}",
        "roundsDisplayTex": "\\text{Constant rounds ruled out}",
        "approximation": "No (7 − ε)-approximation",
        "approximationDisplay": "> 7 − ε",
        "approximationTex": "\\text{No }(7-\\varepsilon)\\text{-approximation}",
        "approximationDisplayTex": "> 7-\\varepsilon",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "mds-to-local-covering"
      ],
      "reductionDirection": "lower",
      "reductionSteps": [
        {
          "id": "mds-to-local-covering",
          "title": "Closed-neighborhood requests",
          "inputResultId": "planar-seven-lower",
          "outputProblem": "local-covering",
          "outputGraph": "planar",
          "from": "dominating-set",
          "to": "local-covering",
          "direction": "lower",
          "substitutions": {},
          "cost": "T",
          "factor": "identity",
          "conditions": [
            "Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags.",
            "Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved.",
            "The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required.",
            "T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated."
          ],
          "assumptions": [
            "Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination."
          ],
          "source": {
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "location": "Section 6.6; Appendix D"
          },
          "modelConversion": null
        }
      ],
      "derivedMath": {
        "rounds": "\\text{Constant rounds ruled out}",
        "approximation": "> 7-\\varepsilon"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Constant rounds ruled out",
        "tex": "\\text{Constant rounds ruled out}",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Closed-neighborhood requests.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/1402.2549",
            "title": "Local Approximability of Minimum Dominating Set on Planar Graphs",
            "location": "Abstract"
          },
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "location": "Section 6.6; Appendix D"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "planar-seven-lower"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-739767b3fac167cd69e8"
        ],
        "assumptions": [
          "auto-assumption-f24197d4ed38789c7117"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-f24197d4ed38789c7117",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-d13f16e4e51c9b55f160",
          "auto-parameter-739767b3fac167cd69e8",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-lenzen-planar-130--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "7 · (130)",
      "rounds": "10",
      "roundClass": "constant",
      "parameters": "Source result (lenzen-planar-130), evaluated on its transformed instance: No fixed degree bound is required.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (lenzen-planar-130), evaluated on its transformed instance: Unique identifiers; no embedding is supplied.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "lenzen-restricted-2013",
      "theorem": "Theorem 6.8; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: Historical constant-round planar bound.",
      "verification": "derived",
      "sourceUrl": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf",
      "year": 2013,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "7 · (130)",
      "roundsDisplay": "10",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "lenzen-planar-130",
      "parentResultId": "lenzen-planar-130",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Planar",
      "sourceMath": {
        "rounds": "O(1)",
        "roundsDisplay": "6",
        "roundsTex": "O(1)",
        "roundsDisplayTex": "6",
        "approximation": "130",
        "approximationDisplay": "130",
        "approximationTex": "130",
        "approximationDisplayTex": "130",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "lenzen-planar-130",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "planar",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "7",
            "tex": "7",
            "graph": "planar"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "planar"
              ],
              "edges": []
            },
            "bound": {
              "graph": "planar",
              "label": "7",
              "tex": "7",
              "certificate": "Planarity is minor-closed and planar minors have edge density at most three."
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "10",
        "approximation": "7\\cdot\\bigl(130\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "10",
        "tex": "10",
        "basis": "reduction",
        "explanation": "Lemma 6.1 explicitly states six rounds and gives the schedule: rounds 1–2 learn identifiers within distance two; round 3 announces membership in D; rounds 4–5 compute and exchange residual degrees; round 6 notifies chosen dominators. The algorithm uses unique identifiers and unrestricted LOCAL messages, without a supplied embedding or degree bound. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf#page=14",
            "title": "Primary source for the algorithm",
            "location": "PDF page 14 (round count), page 19 (130 factor)"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "stated",
        "derivedFrom": "lenzen-planar-130"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-08b712a57c6cb9c05853"
        ],
        "assumptions": [
          "auto-assumption-af3d77efa56066424f48"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-af3d77efa56066424f48",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-08b712a57c6cb9c05853",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-lenzen-unit-disk-lower--mds-to-local-covering",
      "problem": "Integral local covering",
      "variant": "Source algorithm: Unweighted",
      "objective": "min",
      "graphClass": "Unit-disk",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "approximation": "f(n)-approximation",
      "rounds": "f(n) · T(n) = Ω(log* n)",
      "roundClass": "logstar",
      "parameters": "Source result (lenzen-unit-disk-lower), evaluated on its transformed instance: f(n) is the approximation factor; T(n) the round complexity.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (lenzen-unit-disk-lower), evaluated on its transformed instance: Unique identifiers; no embedding is supplied.\n\nClosed-neighborhood requests: Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags. Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination.",
      "paperId": "lenzen-restricted-2013",
      "theorem": "Theorem 4.7; derived via mds-to-local-covering",
      "summary": "Derived lower bound via Closed-neighborhood requests. Original source: Tradeoff between deterministic running time and approximation.",
      "verification": "derived",
      "sourceUrl": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf",
      "year": 2013,
      "problemScope": {
        "node": "local-covering"
      },
      "graphScope": {
        "node": "unit-disk"
      },
      "approximationDisplay": "f(n)-approximation",
      "roundsDisplay": "f(n) · T(n) = Ω(log* n)",
      "weightCondition": "weights-unweighted",
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "lenzen-unit-disk-lower",
      "parentResultId": "lenzen-unit-disk-lower",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Unit-disk",
      "sourceMath": {
        "rounds": "f(n) · T(n) = Ω(log* n)",
        "roundsDisplay": "f(n) · T(n) = Ω(log* n)",
        "roundsTex": "f(n)\\,T(n)=\\Omega(\\log^*n)",
        "roundsDisplayTex": "f(n)\\,T(n)=\\Omega(\\log^*n)",
        "approximation": "f(n)-approximation",
        "approximationDisplay": "f(n)-approximation",
        "approximationTex": "f(n)\\text{-approximation}",
        "approximationDisplayTex": "f(n)\\text{-approximation}",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "mds-to-local-covering"
      ],
      "reductionDirection": "lower",
      "reductionSteps": [
        {
          "id": "mds-to-local-covering",
          "title": "Closed-neighborhood requests",
          "inputResultId": "lenzen-unit-disk-lower",
          "outputProblem": "local-covering",
          "outputGraph": "unit-disk",
          "from": "dominating-set",
          "to": "local-covering",
          "direction": "lower",
          "substitutions": {},
          "cost": "T",
          "factor": "identity",
          "conditions": [
            "Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags.",
            "Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved.",
            "The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required.",
            "T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated."
          ],
          "assumptions": [
            "Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination."
          ],
          "source": {
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "location": "Section 6.6; Appendix D"
          },
          "modelConversion": null
        }
      ],
      "derivedMath": {
        "rounds": "f(n)\\,T(n)=\\Omega(\\log^*n)",
        "approximation": "f(n)\\text{-approximation}"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "f(n) · T(n) = Ω(log* n)",
        "tex": "f(n)\\,T(n)=\\Omega(\\log^*n)",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Closed-neighborhood requests.",
        "evidence": [
          {
            "url": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf",
            "title": "Distributed minimum dominating set approximations in restricted families of graphs",
            "location": "Theorem 4.7"
          },
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "location": "Section 6.6; Appendix D"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "lenzen-unit-disk-lower"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "T(n)",
          "description": "Number of communication rounds at input size n",
          "tex": "T(n)"
        },
        {
          "symbol": "f(n)",
          "description": "Approximation factor at input size n",
          "tex": "f(n)"
        },
        {
          "symbol": "T",
          "description": "Round-complexity function of the number of vertices",
          "tex": "T"
        },
        {
          "symbol": "f",
          "description": "Approximation-factor function of the number of vertices",
          "tex": "f"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-422a8fcd40a47bc44c15",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-d3e1c3e71b7ad8cd335b"
        ],
        "assumptions": [
          "auto-assumption-9d25823721685c8719b5"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-9d25823721685c8719b5",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-422a8fcd40a47bc44c15",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-d13f16e4e51c9b55f160",
          "auto-parameter-d3e1c3e71b7ad8cd335b",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-lenzen-arboricity-random--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Arboricity ≤ α",
      "model": "LOCAL",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (O(α²))",
      "rounds": "(O(log n)) + 4",
      "roundClass": "logarithmic",
      "parameters": "Source result (lenzen-arboricity-random), evaluated on its transformed instance: α is the arboricity bound.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (lenzen-arboricity-random), evaluated on its transformed instance: Unweighted; running time holds with high probability.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "lenzen-restricted-2013",
      "theorem": "Section 5; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: Historical forest-decomposition approximation.",
      "verification": "derived",
      "sourceUrl": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf",
      "year": 2013,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "density",
        "note": "Use compatible fixed arboricity bounds; planar inputs permit an arboricity bound of 3."
      },
      "approximationDisplay": "(1 + 2∇₁) · (O(α²))",
      "roundsDisplay": "(O(log n)) + 4",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "lenzen-arboricity-random",
      "parentResultId": "lenzen-arboricity-random",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Arboricity ≤ α",
      "sourceMath": {
        "rounds": "O(log n)",
        "roundsDisplay": "O(log n)",
        "roundsTex": "O(\\log n)",
        "roundsDisplayTex": "O(\\log n)",
        "approximation": "O(α²)",
        "approximationDisplay": "O(α²)",
        "approximationTex": "O(\\alpha^2)",
        "approximationDisplayTex": "O(\\alpha^2)",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "lenzen-arboricity-random",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "density",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "density"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(O(\\log n)\\bigr)+4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(O(\\alpha^2)\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "(O(log n)) + 4",
        "tex": "\\bigl(O(\\log n)\\bigr)+4",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf",
            "title": "Distributed minimum dominating set approximations in restricted families of graphs",
            "location": "Section 5"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "lenzen-arboricity-random"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "α",
          "description": "Arboricity bound of the input graph",
          "tex": "\\alpha"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-97a0a2af0e526b2ffcd5",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-1f371cffbc3710ea2280"
        ],
        "assumptions": [
          "auto-assumption-ffac157bd645c23a2f4b"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-ffac157bd645c23a2f4b",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-97a0a2af0e526b2ffcd5",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-1f371cffbc3710ea2280",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-lenzen-arboricity-deterministic--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Arboricity ≤ α",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (O(α log Δ))",
      "rounds": "(O(log Δ)) + 4",
      "roundClass": "degree",
      "parameters": "Source result (lenzen-arboricity-deterministic), evaluated on its transformed instance: Δ is maximum degree.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (lenzen-arboricity-deterministic), evaluated on its transformed instance: Unweighted; uniform algorithm.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "lenzen-restricted-2013",
      "theorem": "Section 5; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: A deterministic degree-dependent tradeoff.",
      "verification": "derived",
      "sourceUrl": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf",
      "year": 2013,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "density",
        "note": "Use compatible fixed arboricity bounds; planar inputs permit an arboricity bound of 3."
      },
      "approximationDisplay": "(1 + 2∇₁) · (O(α log Δ))",
      "roundsDisplay": "(O(log Δ)) + 4",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "lenzen-arboricity-deterministic",
      "parentResultId": "lenzen-arboricity-deterministic",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Arboricity ≤ α",
      "sourceMath": {
        "rounds": "O(log Δ)",
        "roundsDisplay": "O(log Δ)",
        "roundsTex": "O(\\log \\Delta )",
        "roundsDisplayTex": "O(\\log \\Delta )",
        "approximation": "O(α log Δ)",
        "approximationDisplay": "O(α log Δ)",
        "approximationTex": "O(\\alpha  \\log \\Delta )",
        "approximationDisplayTex": "O(\\alpha  \\log \\Delta )",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "lenzen-arboricity-deterministic",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "density",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "density"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(O(\\log \\Delta )\\bigr)+4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(O(\\alpha  \\log \\Delta )\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "(O(log Δ)) + 4",
        "tex": "\\bigl(O(\\log \\Delta )\\bigr)+4",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://people.csail.mit.edu/clenzen/pubs/LPW12distributed.pdf",
            "title": "Distributed minimum dominating set approximations in restricted families of graphs",
            "location": "Section 5"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "lenzen-arboricity-deterministic"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "α",
          "description": "Arboricity bound of the input graph",
          "tex": "\\alpha"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-97a0a2af0e526b2ffcd5",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-9a74096f525c0e2a9623"
        ],
        "assumptions": [
          "auto-assumption-b27d9a00fa05fce7bb8f"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-b27d9a00fa05fce7bb8f",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-97a0a2af0e526b2ffcd5",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-9a74096f525c0e2a9623",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-planar-fast-dominating--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "7 · (1 + ε)",
      "rounds": "(O(log* n)) + 4",
      "roundClass": "logstar",
      "parameters": "Source result (planar-fast-dominating), evaluated on its transformed instance: Fixed 0 < ε < 1.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (planar-fast-dominating), evaluated on its transformed instance: Unique identifiers; no embedding is supplied.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "czygrinow-planar-fast-2008",
      "theorem": "Abstract; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: A deterministic local approximation scheme.",
      "verification": "derived",
      "sourceUrl": "https://link.springer.com/chapter/10.1007/978-3-540-87779-0_6",
      "year": 2008,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "7 · (1 + ε)",
      "roundsDisplay": "(O(log* n)) + 4",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "planar-fast-dominating",
      "parentResultId": "planar-fast-dominating",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Planar",
      "sourceMath": {
        "rounds": "O(log* n)",
        "roundsDisplay": "O(log* n)",
        "roundsTex": "O(\\log^* n)",
        "roundsDisplayTex": "O(\\log^* n)",
        "approximation": "1 + ε",
        "approximationDisplay": "1 + ε",
        "approximationTex": "1 + \\varepsilon",
        "approximationDisplayTex": "1 + \\varepsilon",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "planar-fast-dominating",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "planar",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "7",
            "tex": "7",
            "graph": "planar"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "planar"
              ],
              "edges": []
            },
            "bound": {
              "graph": "planar",
              "label": "7",
              "tex": "7",
              "certificate": "Planarity is minor-closed and planar minors have edge density at most three."
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(O(\\log^* n)\\bigr)+4",
        "approximation": "7\\cdot\\bigl(1 + \\varepsilon\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "(O(log* n)) + 4",
        "tex": "\\bigl(O(\\log^* n)\\bigr)+4",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://link.springer.com/chapter/10.1007/978-3-540-87779-0_6",
            "title": "Fast Distributed Approximations in Planar Graphs",
            "location": "Abstract"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "planar-fast-dominating"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-beb44901026e2e133562"
        ],
        "assumptions": [
          "auto-assumption-13f65215a03fc6b0b0fa"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-13f65215a03fc6b0b0fa",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-beb44901026e2e133562",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-minor-almost-dominating--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Excluded fixed minor",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (1 + o(1))",
      "rounds": "(polylog n) + 4",
      "roundClass": "polylog",
      "parameters": "Source result (minor-almost-dominating), evaluated on its transformed instance: Fixed proper minor-closed family; o(1) tends to zero as n grows.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (minor-almost-dominating), evaluated on its transformed instance: Unweighted; connected domination assumes connected input.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "czygrinow-minor-almost-2006",
      "theorem": "Abstract; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: Historical deterministic approximation approaching optimality.",
      "verification": "derived",
      "sourceUrl": "https://link.springer.com/chapter/10.1007/11841036_24",
      "year": 2006,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "(1 + 2∇₁) · (1 + o(1))",
      "roundsDisplay": "(polylog n) + 4",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "minor-almost-dominating",
      "parentResultId": "minor-almost-dominating",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Excluded fixed minor",
      "sourceMath": {
        "rounds": "polylog n",
        "roundsDisplay": "polylog n",
        "roundsTex": "\\operatorname{polylog}n",
        "roundsDisplayTex": "\\operatorname{polylog}n",
        "approximation": "1 + o(1)",
        "approximationDisplay": "1 + o(1)",
        "approximationTex": "1 + o(1)",
        "approximationDisplayTex": "1 + o(1)",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "minor-almost-dominating",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "minor",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "minor"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(\\operatorname{polylog}n\\bigr)+4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(1 + o(1)\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "(polylog n) + 4",
        "tex": "\\bigl(\\operatorname{polylog}n\\bigr)+4",
        "basis": "reduction",
        "explanation": "The publisher abstract states polylogarithmic rounds for a fixed proper minor-closed family. Only the abstract was accessible in this check; no numerical exponent is verified, and no conclusion is drawn about what the full paper might permit. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://link.springer.com/chapter/10.1007/11841036_24",
            "title": "Distributed Almost Exact Approximations for Minor-Closed Families",
            "location": "Publisher abstract"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [
          {
            "symbol": "n",
            "description": "Number of vertices",
            "tex": "n"
          }
        ],
        "checked": "2026-11-16",
        "audited": true,
        "sourceBasis": "stated-in-publisher-abstract",
        "derivedFrom": "minor-almost-dominating"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-e40ef97c3969c67aad8c",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-c4fbdbd86a2c0571aac7"
        ],
        "assumptions": [
          "auto-assumption-f1c56a4916b5d87196e8"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-f1c56a4916b5d87196e8",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-e40ef97c3969c67aad8c",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-c4fbdbd86a2c0571aac7",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-minor-almost-connected--mds-via-connected-domination",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Excluded fixed minor",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "3 · (1 + o(1))",
      "rounds": "polylog n",
      "roundClass": "polylog",
      "parameters": "Source result (minor-almost-connected), evaluated on its transformed instance: Fixed proper minor-closed family; o(1) tends to zero as n grows.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (minor-almost-connected), evaluated on its transformed instance: Unweighted; connected domination assumes connected input.\n\nReuse a connected dominating set: On a nonempty connected graph with unit vertex costs, run the source connected-dominating-set algorithm and return exactly its selected vertices as an ordinary dominating set. OPT_MDS ≤ OPT_CDS ≤ 3 OPT_MDS − 2. Thus an α-approximation against integral OPT_CDS gives a 3α-approximation against integral OPT_MDS, with no additional communication. The optimum comparison is unweighted. On a three-vertex path with costs (1,M,1), ordinary domination costs at most 2 while every connected dominating set costs at least M. The target remains restricted to connected inputs. Do not extend a connected-input algorithm to disconnected networks without checking component-wise operation, termination and global inputs. No fractional-MDS benchmark or lower-bound transfer is inferred by this factor-changing rule. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "czygrinow-minor-almost-2006",
      "theorem": "Abstract; derived via mds-via-connected-domination",
      "summary": "Derived upper bound via Reuse a connected dominating set. Original source: Historical deterministic approximation approaching optimality.",
      "verification": "derived",
      "sourceUrl": "https://link.springer.com/chapter/10.1007/11841036_24",
      "year": 2006,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "3 · (1 + o(1))",
      "roundsDisplay": "polylog n",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "minor-almost-connected",
      "parentResultId": "minor-almost-connected",
      "sourceProblem": "Connected dominating set",
      "sourceGraphClass": "Excluded fixed minor",
      "sourceMath": {
        "rounds": "polylog n",
        "roundsDisplay": "polylog n",
        "roundsTex": "\\operatorname{polylog}n",
        "roundsDisplayTex": "\\operatorname{polylog}n",
        "approximation": "1 + o(1)",
        "approximationDisplay": "1 + o(1)",
        "approximationTex": "1 + o(1)",
        "approximationDisplayTex": "1 + o(1)",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "mds-via-connected-domination"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "mds-via-connected-domination",
          "title": "Reuse a connected dominating set",
          "inputResultId": "minor-almost-connected",
          "outputProblem": "dominating-set",
          "outputGraph": "minor",
          "from": "dominating-set",
          "to": "connected-dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T",
          "factor": "multiply",
          "conditions": [
            "On a nonempty connected graph with unit vertex costs, run the source connected-dominating-set algorithm and return exactly its selected vertices as an ordinary dominating set.",
            "OPT_MDS ≤ OPT_CDS ≤ 3 OPT_MDS − 2. Thus an α-approximation against integral OPT_CDS gives a 3α-approximation against integral OPT_MDS, with no additional communication.",
            "The optimum comparison is unweighted. On a three-vertex path with costs (1,M,1), ordinary domination costs at most 2 while every connected dominating set costs at least M.",
            "The target remains restricted to connected inputs. Do not extend a connected-input algorithm to disconnected networks without checking component-wise operation, termination and global inputs.",
            "No fractional-MDS benchmark or lower-bound transfer is inferred by this factor-changing rule."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Caro, West and Yuster, Connected Domination and Spanning Trees with Many Leaves",
            "url": "https://math.haifa.ac.il/raphy/papers/conndom.pdf#page=4",
            "location": "Lemma 2.1, Duchet–Meyniel inequality; zero-round output reuse is a direct consequence."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "3",
            "tex": "3"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Caro, West and Yuster, Connected Domination and Spanning Trees with Many Leaves",
              "url": "https://math.haifa.ac.il/raphy/papers/conndom.pdf#page=4",
              "location": "Lemma 2.1, Duchet–Meyniel inequality; zero-round output reuse is a direct consequence."
            },
            "graphPath": {
              "nodes": [
                "minor"
              ],
              "edges": []
            },
            "bound": {
              "label": "3",
              "tex": "3"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\operatorname{polylog}n",
        "approximation": "3\\cdot\\bigl(1 + o(1)\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "polylog n",
        "tex": "\\operatorname{polylog}n",
        "basis": "reduction",
        "explanation": "The publisher abstract states polylogarithmic rounds for connected dominating set in a fixed proper minor-closed family. Full-text access was unavailable in this check, so no numerical exponent is verified. The atlas applies the exact instance substitutions and communication cost of the reduction: Reuse a connected dominating set.",
        "evidence": [
          {
            "url": "https://link.springer.com/chapter/10.1007/11841036_24",
            "title": "Distributed Almost Exact Approximations for Minor-Closed Families",
            "location": "Publisher abstract"
          },
          {
            "url": "https://math.haifa.ac.il/raphy/papers/conndom.pdf#page=4",
            "title": "Caro, West and Yuster, Connected Domination and Spanning Trees with Many Leaves",
            "location": "Lemma 2.1, Duchet–Meyniel inequality; zero-round output reuse is a direct consequence."
          }
        ],
        "parameters": [
          {
            "symbol": "n",
            "description": "Number of vertices",
            "tex": "n"
          }
        ],
        "checked": "2026-11-16",
        "audited": true,
        "sourceBasis": "stated-in-publisher-abstract",
        "derivedFrom": "minor-almost-connected"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-e40ef97c3969c67aad8c",
          "weights-unweighted",
          "input-connected"
        ],
        "parameters": [
          "auto-parameter-4ba0e86e5f1b19c7d722"
        ],
        "assumptions": [
          "auto-assumption-b289870bc848656a87eb"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-b289870bc848656a87eb",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-e40ef97c3969c67aad8c",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-4ba0e86e5f1b19c7d722",
          "detail-integral-benchmark",
          "input-connected",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-growth-local-dominating--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Polynomial neighborhood-independence growth",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (1 + ε)",
      "rounds": "(O(T_MIS + ε⁻O(1) log* n)) + 4",
      "roundClass": "other",
      "parameters": "Source result (growth-local-dominating), evaluated on its transformed instance: Fixed growth polynomial and ε > 0; T_MIS is an MIS subroutine’s time.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (growth-local-dominating), evaluated on its transformed instance: Includes unit-disk graphs; no coordinates are required.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "kuhn-local-schemes-2005",
      "theorem": "Abstract; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: An approximation scheme parameterized by a symmetry-breaking subroutine.",
      "verification": "derived",
      "sourceUrl": "https://www.microsoft.com/en-us/research/wp-content/uploads/2017/01/DIALM2005a.pdf",
      "year": 2005,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "independence-growth",
        "note": "Growth refers to independent sets in neighborhoods, not vertex counts."
      },
      "approximationDisplay": "(1 + 2∇₁) · (1 + ε)",
      "roundsDisplay": "(O(T_MIS + ε⁻O(1) log* n)) + 4",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "growth-local-dominating",
      "parentResultId": "growth-local-dominating",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Polynomial neighborhood-independence growth",
      "sourceMath": {
        "rounds": "O(T_MIS + ε⁻O(1) log* n)",
        "roundsDisplay": "O(T_MIS + ε⁻O(1) log* n)",
        "roundsTex": "O\\!\\left(T_{\\mathrm{MIS}}+\\varepsilon^{-O(1)}\\log^*n\\right)",
        "roundsDisplayTex": "O\\!\\left(T_{\\mathrm{MIS}}+\\varepsilon^{-O(1)}\\log^*n\\right)",
        "approximation": "1 + ε",
        "approximationDisplay": "1 + ε",
        "approximationTex": "1 + \\varepsilon",
        "approximationDisplayTex": "1 + \\varepsilon",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "growth-local-dominating",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "independence-growth",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "independence-growth"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(O\\!\\left(T_{\\mathrm{MIS}}+\\varepsilon^{-O(1)}\\log^*n\\right)\\bigr)+4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(1 + \\varepsilon\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "(O(T_MIS + ε⁻O(1) log* n)) + 4",
        "tex": "\\bigl(O\\!\\left(T_{\\mathrm{MIS}}+\\varepsilon^{-O(1)}\\log^*n\\right)\\bigr)+4",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://www.microsoft.com/en-us/research/wp-content/uploads/2017/01/DIALM2005a.pdf",
            "title": "Local approximation schemes for ad hoc and sensor networks",
            "location": "Abstract"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "growth-local-dominating"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "T_MIS",
          "description": "Round complexity of the maximal-independent-set subroutine",
          "tex": "T_{\\mathrm{MIS}}"
        },
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-7140d561f38288daeca5",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-dda3c3d8d334bffca0f6"
        ],
        "assumptions": [
          "auto-assumption-281e7424f0ee236503e2"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-281e7424f0ee236503e2",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-7140d561f38288daeca5",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-dda3c3d8d334bffca0f6",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-alipour-trianglefree-32--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Triangle-free planar",
      "model": "LOCAL",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "7 · (32)",
      "rounds": "6",
      "roundClass": "constant",
      "parameters": "Source result (alipour-trianglefree-32), evaluated on its transformed instance: Algorithm 1 with m = 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (alipour-trianglefree-32), evaluated on its transformed instance: No isolated vertices; the presented algorithm uses random tie-breaking.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "alipour-futuhi-2020",
      "theorem": "Theorem 2.1; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: A local degree-based procedure, analyzed on triangle-free graphs.",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/html/2012.04883v2",
      "year": 2020,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "triangle-planar"
      },
      "approximationDisplay": "7 · (32)",
      "roundsDisplay": "6",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "alipour-trianglefree-32",
      "parentResultId": "alipour-trianglefree-32",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Triangle-free planar",
      "sourceMath": {
        "rounds": "O(1)",
        "roundsDisplay": "2",
        "roundsTex": "O(1)",
        "roundsDisplayTex": "2",
        "approximation": "32",
        "approximationDisplay": "32",
        "approximationTex": "32",
        "approximationDisplayTex": "32",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "alipour-trianglefree-32",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "triangle-planar",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "7",
            "tex": "7",
            "graph": "planar"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "triangle-planar",
                "planar"
              ],
              "edges": [
                {
                  "subset": "triangle-planar",
                  "superset": "planar",
                  "reason": "Drop the triangle-free restriction.",
                  "lower": true
                }
              ]
            },
            "bound": {
              "graph": "planar",
              "label": "7",
              "tex": "7",
              "certificate": "Planarity is minor-closed and planar minors have edge density at most three."
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "6",
        "approximation": "7\\cdot\\bigl(32\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "6",
        "tex": "6",
        "basis": "reduction",
        "explanation": "In round 1, vertices broadcast their degree and random tie-breaking value. In round 2, each vertex marks a neighbor of maximum weight. The repeat loop is absent when m = 0. The selected vertices give total domination and hence ordinary domination. Vertices initially know their neighbors; the source excludes isolated vertices. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2012.04883v2#page=3",
            "title": "Primary source communication schedule",
            "location": "Algorithm 1 lines 1–2 and Theorem 2.1; arXiv v2 PDF p. 3"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "stated",
        "derivedFrom": "alipour-trianglefree-32"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-17b28995226fcbf3e00f",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-79664239916cf65ad5fa"
        ],
        "assumptions": [
          "auto-assumption-94566eade8d232e04542"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-94566eade8d232e04542",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-17b28995226fcbf3e00f",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-79664239916cf65ad5fa",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-alipour-fourcycle-18--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar without 4-cycles",
      "model": "LOCAL",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "7 · (18)",
      "rounds": "(Constant) + 4",
      "roundClass": "constant",
      "parameters": "Source result (alipour-fourcycle-18), evaluated on its transformed instance: Fixed graph-class restriction.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (alipour-fourcycle-18), evaluated on its transformed instance: Randomized LOCAL algorithm; the no-isolated-vertex setting is used here.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "alipour-jafari-2020",
      "theorem": "SPAA author-talk abstract; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: The conference abstract gives a bound under 4-cycle exclusion.",
      "verification": "derived",
      "sourceUrl": "https://papertalk.org/papertalks/24941",
      "year": 2020,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "fourcycle-planar"
      },
      "approximationDisplay": "7 · (18)",
      "roundsDisplay": "(Constant) + 4",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "alipour-fourcycle-18",
      "parentResultId": "alipour-fourcycle-18",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Planar without 4-cycles",
      "sourceMath": {
        "rounds": "O(1)",
        "roundsDisplay": "Constant",
        "roundsTex": "O(1)",
        "roundsDisplayTex": "\\text{Constant}",
        "approximation": "18",
        "approximationDisplay": "18",
        "approximationTex": "18",
        "approximationDisplayTex": "18",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "alipour-fourcycle-18",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "fourcycle-planar",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "7",
            "tex": "7",
            "graph": "planar"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "fourcycle-planar",
                "planar"
              ],
              "edges": [
                {
                  "subset": "fourcycle-planar",
                  "superset": "planar",
                  "reason": "Drop the restriction excluding 4-cycles.",
                  "lower": true
                }
              ]
            },
            "bound": {
              "graph": "planar",
              "label": "7",
              "tex": "7",
              "certificate": "Planarity is minor-closed and planar minors have edge density at most three."
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(\\text{Constant}\\bigr)+4",
        "approximation": "7\\cdot\\bigl(18\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "(Constant) + 4",
        "tex": "\\bigl(\\text{Constant}\\bigr)+4",
        "basis": "reduction",
        "explanation": "The primary author abstract confirms the approximation result but does not give a total round count. The full SPAA paper could not be accessed to verify its schedule. The count is not inferred from the separate triangle-free paper. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://papertalk.org/papertalks/24941",
            "title": "Primary source reviewed",
            "location": "Primary author abstract; full paper unavailable"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "unavailable",
        "derivedFrom": "alipour-fourcycle-18"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-3795dad9c1a1c4cfdd87",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-b0605bfeaa9de830f1b2"
        ],
        "assumptions": [
          "auto-assumption-9fb56d6e55e069b7a8e1"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-9fb56d6e55e069b7a8e1",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-3795dad9c1a1c4cfdd87",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-b0605bfeaa9de830f1b2",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-unitdisk-connected-2006--mds-via-connected-domination",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Unit-disk",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "3 · (1 + O(1 / logᵏ n))",
      "rounds": "polylog n",
      "roundClass": "polylog",
      "parameters": "Source result (unitdisk-connected-2006), evaluated on its transformed instance: Fixed positive integer k; polynomial exponent depends on k.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (unitdisk-connected-2006), evaluated on its transformed instance: No coordinates required; connected domination assumes connected input.\n\nReuse a connected dominating set: On a nonempty connected graph with unit vertex costs, run the source connected-dominating-set algorithm and return exactly its selected vertices as an ordinary dominating set. OPT_MDS ≤ OPT_CDS ≤ 3 OPT_MDS − 2. Thus an α-approximation against integral OPT_CDS gives a 3α-approximation against integral OPT_MDS, with no additional communication. The optimum comparison is unweighted. On a three-vertex path with costs (1,M,1), ordinary domination costs at most 2 while every connected dominating set costs at least M. The target remains restricted to connected inputs. Do not extend a connected-input algorithm to disconnected networks without checking component-wise operation, termination and global inputs. No fractional-MDS benchmark or lower-bound transfer is inferred by this factor-changing rule. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "czygrinow-unitdisk-2006",
      "theorem": "Abstract; derived via mds-via-connected-domination",
      "summary": "Derived upper bound via Reuse a connected dominating set. Original source: A deterministic geometric-graph approximation scheme.",
      "verification": "derived",
      "sourceUrl": "https://citeseerx.ist.psu.edu/document?doi=20dda508c20a6ecb0968d9df37651143c62702bc&repid=rep1&type=pdf",
      "year": 2006,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "unit-disk"
      },
      "approximationDisplay": "3 · (1 + O(1 / logᵏ n))",
      "roundsDisplay": "polylog n",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "unitdisk-connected-2006",
      "parentResultId": "unitdisk-connected-2006",
      "sourceProblem": "Connected dominating set",
      "sourceGraphClass": "Unit-disk",
      "sourceMath": {
        "rounds": "polylog n",
        "roundsDisplay": "polylog n",
        "roundsTex": "\\operatorname{polylog}n",
        "roundsDisplayTex": "\\operatorname{polylog}n",
        "approximation": "1 + O(1 / logᵏ n)",
        "approximationDisplay": "1 + O(1 / logᵏ n)",
        "approximationTex": "1+O\\!\\left(\\frac{1}{\\log^k n}\\right)",
        "approximationDisplayTex": "1+O\\!\\left(\\frac{1}{\\log^k n}\\right)",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "mds-via-connected-domination"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "mds-via-connected-domination",
          "title": "Reuse a connected dominating set",
          "inputResultId": "unitdisk-connected-2006",
          "outputProblem": "dominating-set",
          "outputGraph": "unit-disk",
          "from": "dominating-set",
          "to": "connected-dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T",
          "factor": "multiply",
          "conditions": [
            "On a nonempty connected graph with unit vertex costs, run the source connected-dominating-set algorithm and return exactly its selected vertices as an ordinary dominating set.",
            "OPT_MDS ≤ OPT_CDS ≤ 3 OPT_MDS − 2. Thus an α-approximation against integral OPT_CDS gives a 3α-approximation against integral OPT_MDS, with no additional communication.",
            "The optimum comparison is unweighted. On a three-vertex path with costs (1,M,1), ordinary domination costs at most 2 while every connected dominating set costs at least M.",
            "The target remains restricted to connected inputs. Do not extend a connected-input algorithm to disconnected networks without checking component-wise operation, termination and global inputs.",
            "No fractional-MDS benchmark or lower-bound transfer is inferred by this factor-changing rule."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Caro, West and Yuster, Connected Domination and Spanning Trees with Many Leaves",
            "url": "https://math.haifa.ac.il/raphy/papers/conndom.pdf#page=4",
            "location": "Lemma 2.1, Duchet–Meyniel inequality; zero-round output reuse is a direct consequence."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "3",
            "tex": "3"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Caro, West and Yuster, Connected Domination and Spanning Trees with Many Leaves",
              "url": "https://math.haifa.ac.il/raphy/papers/conndom.pdf#page=4",
              "location": "Lemma 2.1, Duchet–Meyniel inequality; zero-round output reuse is a direct consequence."
            },
            "graphPath": {
              "nodes": [
                "unit-disk"
              ],
              "edges": []
            },
            "bound": {
              "label": "3",
              "tex": "3"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\operatorname{polylog}n",
        "approximation": "3\\cdot\\bigl(1+O\\!\\left(\\frac{1}{\\log^k n}\\right)\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "polylog n",
        "tex": "\\operatorname{polylog}n",
        "basis": "reduction",
        "explanation": "A numerical polynomial exponent has not yet been extracted for this record. The displayed expression retains all currently recorded parameter dependence. The atlas applies the exact instance substitutions and communication cost of the reduction: Reuse a connected dominating set.",
        "evidence": [
          {
            "url": "https://citeseerx.ist.psu.edu/document?doi=20dda508c20a6ecb0968d9df37651143c62702bc&repid=rep1&type=pdf",
            "title": "Distributed Approximation Algorithms in Unit-Disk Graphs",
            "location": "Abstract"
          },
          {
            "url": "https://math.haifa.ac.il/raphy/papers/conndom.pdf#page=4",
            "title": "Caro, West and Yuster, Connected Domination and Spanning Trees with Many Leaves",
            "location": "Lemma 2.1, Duchet–Meyniel inequality; zero-round output reuse is a direct consequence."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "symbolic",
        "derivedFrom": "unitdisk-connected-2006"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "k",
          "description": "Fixed positive exponent controlling the inverse-polylogarithmic accuracy",
          "tex": "k"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-422a8fcd40a47bc44c15",
          "weights-unweighted",
          "input-connected"
        ],
        "parameters": [
          "auto-parameter-8f78c29c881a4d777152"
        ],
        "assumptions": [
          "auto-assumption-837dc6d0776f101e23fe"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-837dc6d0776f101e23fe",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-422a8fcd40a47bc44c15",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-8f78c29c881a4d777152",
          "detail-integral-benchmark",
          "input-connected",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-gen-aprsu10-dom--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Weakly 2-colored",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · ((Δ + 1)/2)",
      "rounds": "≤ 8",
      "roundClass": "constant",
      "parameters": "Source result (gen-aprsu10-dom), evaluated on its transformed instance: The maximum degree Δ affects the approximation ratio. The supplied weak 2-colouring permits a universal constant number of communication rounds, independently of Δ.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (gen-aprsu10-dom), evaluated on its transformed instance: A weak 2-colouring is supplied; no isolated vertices.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "gen-aprsu10",
      "theorem": "Theorem 6; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: Matches the paper’s local lower bound.",
      "verification": "derived",
      "sourceUrl": "https://jukkasuomela.fi/doc/weakly-coloured.pdf",
      "year": 2010,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "weak-colored",
        "note": "Requires a supplied weak two-coloring and no isolated vertices."
      },
      "prerequisite": "Supplied weak 2-coloring; no isolates",
      "approximationDisplay": "(1 + 2∇₁) · ((Δ + 1)/2)",
      "roundsDisplay": "≤ 8",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "gen-aprsu10-dom",
      "parentResultId": "gen-aprsu10-dom",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Weakly 2-colored",
      "sourceMath": {
        "rounds": "O(1)",
        "roundsDisplay": "≤ 4",
        "roundsTex": "O(1)",
        "roundsDisplayTex": "\\le 4",
        "approximation": "(Δ + 1)/2",
        "approximationDisplay": "(Δ + 1)/2",
        "approximationTex": "\\frac{\\Delta+1}{2}",
        "approximationDisplayTex": "\\frac{\\Delta+1}{2}",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "gen-aprsu10-dom",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "weak-colored",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "weak-colored"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\le 8",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(\\frac{\\Delta+1}{2}\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "≤ 8",
        "tex": "\\le 8",
        "basis": "reduction",
        "explanation": "The supplied weak two-colouring permits the Section 4 star-forest construction in an absolute constant number of rounds. The four-round schedule below computes exactly its final star centres without communicating the final edge orientations. Every black vertex with white children becomes a centre. An original white root remains a centre exactly when at least one of its black children has no white children. A white vertex that proposed to a black vertex is a leaf. In the all-depth-two case a root chooses one child for edge reversal, but the choice does not affect the set of centres, so the dominating-set output needs no extra round. This is an implementation upper bound derived from the paper, not a printed exact runtime or a claim of round optimality. Δ occurs in the approximation guarantee, not in the communication radius. The catalogue’s f(Δ) classification can be strengthened to constant. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/weakly-coloured.pdf#page=8",
            "title": "Local algorithms in (weakly) coloured graphs",
            "location": "Section 4 star-forest construction and Theorem 6"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": true,
        "sourceBasis": "derived-phase-bound",
        "derivedFrom": "gen-aprsu10-dom"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-009b17c9926b5eac5d12",
          "weights-unweighted",
          "input-weak-coloring-no-isolates",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-aaedfbca93b74b696129"
        ],
        "assumptions": [
          "auto-assumption-1d56aa27f90d88dc37e1"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-1d56aa27f90d88dc37e1",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-009b17c9926b5eac5d12",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-aaedfbca93b74b696129",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "input-isolate-free",
          "input-weak-coloring-no-isolates",
          "input-weak-two-coloring",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-gen-w25-dom--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Triangle-free planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "7 · (6)",
      "rounds": "≤ 11",
      "roundClass": "constant",
      "parameters": "Source result (gen-w25-dom), evaluated on its transformed instance: \n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (gen-w25-dom), evaluated on its transformed instance: \n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "gen-w25",
      "theorem": "Abstract; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: A local construction based on bunches.",
      "verification": "derived",
      "sourceUrl": "https://www.mdpi.com/1999-4893/18/5/280",
      "year": 2025,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "triangle-planar"
      },
      "approximationDisplay": "7 · (6)",
      "roundsDisplay": "≤ 11",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "gen-w25-dom",
      "parentResultId": "gen-w25-dom",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Triangle-free planar",
      "sourceMath": {
        "rounds": "O(1)",
        "roundsDisplay": "≤ 7",
        "roundsTex": "O(1)",
        "roundsDisplayTex": "\\le 7",
        "approximation": "6",
        "approximationDisplay": "6",
        "approximationTex": "6",
        "approximationDisplayTex": "6",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "gen-w25-dom",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "triangle-planar",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "7",
            "tex": "7",
            "graph": "planar"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "triangle-planar",
                "planar"
              ],
              "edges": [
                {
                  "subset": "triangle-planar",
                  "superset": "planar",
                  "reason": "Drop the triangle-free restriction.",
                  "lower": true
                }
              ]
            },
            "bound": {
              "graph": "planar",
              "label": "7",
              "tex": "7",
              "certificate": "Planarity is minor-closed and planar minors have edge density at most three."
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\le 11",
        "approximation": "7\\cdot\\bigl(6\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "≤ 11",
        "tex": "\\le 11",
        "basis": "reduction",
        "explanation": "The paper gives two phases without a total round count. A conservative implementation floods identifiers and neighbor lists for six rounds, then uses one round to notify selected neighbors. The first six rounds reveal degrees through distance five, sufficient to reconstruct the first selection and uncovered vertices within distance two. Every replacement candidate covers the selecting vertex, so it lies in its closed neighborhood. This is an implementation upper bound, not a source-stated or optimal count. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://mdpi-res.com/d_attachment/algorithms/algorithms-18-00280/article_deploy/algorithms-18-00280.pdf#page=9",
            "title": "Wawrzyniak, local six-approximation on triangle-free planar graphs",
            "location": "Section 3, pseudocode, PDF pp. 9–10"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "phase-count",
        "derivedFrom": "gen-w25-dom"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-17b28995226fcbf3e00f",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-f11719f7c60eb8983173"
        ],
        "assumptions": [
          "auto-assumption-0587f0dcf73a8b1728de"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-0587f0dcf73a8b1728de",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-17b28995226fcbf3e00f",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-f11719f7c60eb8983173",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-gen-bdgpsw26-dom--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Euler genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (34 + ε)",
      "rounds": "(f(g, ε)) + 4",
      "roundClass": "parameter",
      "parameters": "Source result (gen-bdgpsw26-dom), evaluated on its transformed instance: Fixed Euler genus g and ε.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (gen-bdgpsw26-dom), evaluated on its transformed instance: Uses the planar 11+ε source approximation.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "gen-bdgpsw26",
      "theorem": "Abstract; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: A transfer theorem gives factor 3α+1 from a planar α-approximation.",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/abs/2605.19157",
      "year": 2026,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "euler",
        "note": "Retain any connectivity condition stated by the source."
      },
      "approximationDisplay": "(1 + 2∇₁) · (34 + ε)",
      "roundsDisplay": "(f(g, ε)) + 4",
      "roundClassSource": "constant",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "gen-bdgpsw26-dom",
      "parentResultId": "gen-bdgpsw26-dom",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Euler genus ≤ g",
      "sourceMath": {
        "rounds": "f(g, ε)",
        "roundsDisplay": "f(g, ε)",
        "roundsTex": "f\\bigl(g,\\varepsilon\\bigr)",
        "roundsDisplayTex": "f\\bigl(g,\\varepsilon\\bigr)",
        "approximation": "34 + ε",
        "approximationDisplay": "34 + ε",
        "approximationTex": "34 + \\varepsilon",
        "approximationDisplayTex": "34 + \\varepsilon",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "gen-bdgpsw26-dom",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "euler",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "euler"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(f\\bigl(g,\\varepsilon\\bigr)\\bigr)+4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(34 + \\varepsilon\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "partial",
        "formula": "(T + δ + 2) + 4, where T = F(2u+2ρ) + max{u+ρ, b}",
        "tex": "\\bigl(T+\\delta+2\\bigr)+4,\\qquad T=F(2u+2\\rho)+\\max\\{u+\\rho,b\\}",
        "basis": "reduction",
        "explanation": "Corollary 4.3 states a parameter-dependent constant C(ε,g). Meta-Theorem I gives a transparent composition of the base algorithm, a dimensional control function, and an error-component diameter bound, but this does not compute a closed function of g and ε. In particular the runtime of the planar (11+ε)-approximation and the control-function constants are not expanded here. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
            "title": "Meta-Theorems for Cuttable Distributed Problems",
            "location": "Theorem 4.2 (Meta-Theorem I); Corollary 4.3; proof of Meta-Theorem I"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [
          {
            "symbol": "T",
            "description": "Intermediate algorithm radius from the displayed composition",
            "tex": "T"
          },
          {
            "symbol": "δ",
            "description": "Upper bound on weak diameters of the local error components",
            "tex": "\\delta"
          },
          {
            "symbol": "F",
            "description": "Dimensional control function of the target graph class",
            "tex": "F"
          },
          {
            "symbol": "u",
            "description": "Uniformity radius of the base algorithm",
            "tex": "u"
          },
          {
            "symbol": "b",
            "description": "Round complexity of the base algorithm",
            "tex": "b"
          },
          {
            "symbol": "ρ",
            "description": "Verification radius of the distributed problem",
            "tex": "\\rho"
          }
        ],
        "checked": "2026-11-16",
        "audited": true,
        "expression": {
          "formula": "(T + δ + 2) + 4",
          "tex": "\\bigl(T+\\delta+2\\bigr)+4"
        },
        "suffix": {
          "formula": ", where T = F(2u+2ρ) + max{u+ρ, b}",
          "tex": ",\\qquad T=F(2u+2\\rho)+\\max\\{u+\\rho,b\\}"
        },
        "sourceBasis": "stated-composition",
        "derivedFrom": "gen-bdgpsw26-dom"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "F",
          "description": "Dimensional control function of the target graph class",
          "tex": "F"
        },
        {
          "symbol": "T",
          "description": "Intermediate algorithm radius from the displayed composition",
          "tex": "T"
        },
        {
          "symbol": "b",
          "description": "Round complexity of the base algorithm",
          "tex": "b"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound",
          "tex": "g"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "u",
          "description": "Uniformity radius of the base algorithm",
          "tex": "u"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "δ",
          "description": "Upper bound on weak diameters of the local error components",
          "tex": "\\delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        },
        {
          "symbol": "ρ",
          "description": "Verification radius of the distributed problem",
          "tex": "\\rho"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-4688deea0bc7a8a63f32",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-dcdc30d57dc32ad13f6c"
        ],
        "assumptions": [
          "auto-assumption-fff39ba43ef891a8d0d4"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-fff39ba43ef891a8d0d4",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-4688deea0bc7a8a63f32",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-dcdc30d57dc32ad13f6c",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-gen-af26-dom--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Bounded arboricity",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (O(α log Δ / log log Δ))",
      "rounds": "(O(log Δ / log log Δ)) + 4",
      "roundClass": "degree",
      "parameters": "Source result (gen-af26-dom), evaluated on its transformed instance: α is arboricity; logs truncated at constants.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (gen-af26-dom), evaluated on its transformed instance: Δ known; α need not be known; one-bit messages suffice.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.\n\nThe source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only.",
      "paperId": "gen-af26",
      "theorem": "Abstract; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: A degree-dependent approximation with very small messages.",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/abs/2606.15411",
      "year": 2026,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "density",
        "note": "Use compatible fixed arboricity bounds; planar inputs permit an arboricity bound of 3."
      },
      "prerequisite": "Known Δ",
      "approximationDisplay": "(1 + 2∇₁) · (O(α log Δ / log log Δ))",
      "roundsDisplay": "(O(log Δ / log log Δ)) + 4",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "gen-af26-dom",
      "parentResultId": "gen-af26-dom",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Bounded arboricity",
      "sourceMath": {
        "rounds": "O(log Δ / log log Δ)",
        "roundsDisplay": "O(log Δ / log log Δ)",
        "roundsTex": "O\\!\\left(\\frac{\\log\\Delta}{\\log\\log\\Delta}\\right)",
        "roundsDisplayTex": "O\\!\\left(\\frac{\\log\\Delta}{\\log\\log\\Delta}\\right)",
        "approximation": "O(α log Δ / log log Δ)",
        "approximationDisplay": "O(α log Δ / log log Δ)",
        "approximationTex": "O\\!\\left(\\frac{\\alpha\\log\\Delta}{\\log\\log\\Delta}\\right)",
        "approximationDisplayTex": "O\\!\\left(\\frac{\\alpha\\log\\Delta}{\\log\\log\\Delta}\\right)",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "gen-af26-dom",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "density",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": "The source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only.",
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "density"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(O\\!\\left(\\frac{\\log\\Delta}{\\log\\log\\Delta}\\right)\\bigr)+4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(O\\!\\left(\\frac{\\alpha\\log\\Delta}{\\log\\log\\Delta}\\right)\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "(O(log Δ / log log Δ)) + 4",
        "tex": "\\bigl(O\\!\\left(\\frac{\\log\\Delta}{\\log\\log\\Delta}\\right)\\bigr)+4",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2606.15411",
            "title": "Distributed Dominating Set With Optimal Rounds and Message Size in Bounded Arboricity Graphs",
            "location": "Abstract"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "gen-af26-dom"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "α",
          "description": "Arboricity bound of the input graph",
          "tex": "\\alpha"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a31601ba12c5c7bcb524",
          "weights-unweighted",
          "input-known-degree",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-853e9d46aefaa69dd895"
        ],
        "assumptions": [
          "auto-assumption-cc6fcc0cb330d5280ad4"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-cc6fcc0cb330d5280ad4",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-a31601ba12c5c7bcb524",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-853e9d46aefaa69dd895",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "input-known-degree",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-gen-w26-planar-dom--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "7 · (8 + ε)",
      "rounds": "(f(ε)) + 4",
      "roundClass": "parameter",
      "parameters": "Source result (gen-w26-planar-dom), evaluated on its transformed instance: Fixed ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (gen-w26-planar-dom), evaluated on its transformed instance: Neither embedding nor n is required.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "gen-w26-planar",
      "theorem": "Abstract; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: An improved analysis of the three-phase domination framework.",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/abs/2609.32736",
      "year": 2026,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "7 · (8 + ε)",
      "roundsDisplay": "(f(ε)) + 4",
      "roundClassSource": "constant",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "gen-w26-planar-dom",
      "parentResultId": "gen-w26-planar-dom",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Planar",
      "sourceMath": {
        "rounds": "O_ε(1)",
        "roundsDisplay": "f(ε)",
        "roundsTex": "O_\\varepsilon(1)",
        "roundsDisplayTex": "f\\bigl(\\varepsilon\\bigr)",
        "approximation": "8 + ε",
        "approximationDisplay": "8 + ε",
        "approximationTex": "8 + \\varepsilon",
        "approximationDisplayTex": "8 + \\varepsilon",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "gen-w26-planar-dom",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "planar",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "7",
            "tex": "7",
            "graph": "planar"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "planar"
              ],
              "edges": []
            },
            "bound": {
              "graph": "planar",
              "label": "7",
              "tex": "7",
              "certificate": "Planarity is minor-closed and planar minors have edge density at most three."
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(f\\bigl(\\varepsilon\\bigr)\\bigr)+4",
        "approximation": "7\\cdot\\bigl(8 + \\varepsilon\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "(f(ε)) + 4",
        "tex": "\\bigl(f\\bigl(\\varepsilon\\bigr)\\bigr)+4",
        "basis": "reduction",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2609.32736",
            "title": "Near-Optimal Distributed Domination in Planar Graphs",
            "location": "Abstract"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "symbolic",
        "derivedFrom": "gen-w26-planar-dom"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-25954594c905b764692f"
        ],
        "assumptions": [
          "auto-assumption-2d4d238491d777d5feae"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-2d4d238491d777d5feae",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-25954594c905b764692f",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-gen-as26-planar--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "7 · (7 + ε)",
      "rounds": "(f(ε)) + 4",
      "roundClass": "parameter",
      "parameters": "Source result (gen-as26-planar), evaluated on its transformed instance: Fixed ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (gen-as26-planar), evaluated on its transformed instance: Guarantee also holds against fractional OPT.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "gen-as26",
      "theorem": "Abstract; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: Planar specialization.",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/abs/2610.09618",
      "year": 2026,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "7 · (7 + ε)",
      "roundsDisplay": "(f(ε)) + 4",
      "roundClassSource": "constant",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "gen-as26-planar",
      "parentResultId": "gen-as26-planar",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Planar",
      "sourceMath": {
        "rounds": "O_ε(1)",
        "roundsDisplay": "f(ε)",
        "roundsTex": "O_\\varepsilon(1)",
        "roundsDisplayTex": "f\\bigl(\\varepsilon\\bigr)",
        "approximation": "7 + ε",
        "approximationDisplay": "7 + ε",
        "approximationTex": "7 + \\varepsilon",
        "approximationDisplayTex": "7 + \\varepsilon",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "gen-as26-planar",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "planar",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "7",
            "tex": "7",
            "graph": "planar"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "planar"
              ],
              "edges": []
            },
            "bound": {
              "graph": "planar",
              "label": "7",
              "tex": "7",
              "certificate": "Planarity is minor-closed and planar minors have edge density at most three."
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(f\\bigl(\\varepsilon\\bigr)\\bigr)+4",
        "approximation": "7\\cdot\\bigl(7 + \\varepsilon\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "(f(ε)) + 4",
        "tex": "\\bigl(f\\bigl(\\varepsilon\\bigr)\\bigr)+4",
        "basis": "reduction",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2610.09618",
            "title": "Almost Optimal Constant-Round Approximation of Dominating Set in Graph Classes with Excluded Minors",
            "location": "Abstract"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "symbolic",
        "derivedFrom": "gen-as26-planar"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-60e88e5bcaa0c1b35889"
        ],
        "assumptions": [
          "auto-assumption-1c75a5d26563a57273bc"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-1c75a5d26563a57273bc",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-60e88e5bcaa0c1b35889",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-gen-as26-minor--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Proper minor-closed classes",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (2a(𝒞) + 1 + ε)",
      "rounds": "(f(𝒞, ε)) + 4",
      "roundClass": "parameter",
      "parameters": "Source result (gen-as26-minor), evaluated on its transformed instance: Fixed class 𝒞 and ε; a(𝒞) = sup |E|/|V|.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (gen-as26-minor), evaluated on its transformed instance: Measured against fractional OPT.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "gen-as26",
      "theorem": "Abstract; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: A class-density bound.",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/abs/2610.09618",
      "year": 2026,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "(1 + 2∇₁) · (2a(𝒞) + 1 + ε)",
      "roundsDisplay": "(f(𝒞, ε)) + 4",
      "roundClassSource": "constant",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "gen-as26-minor",
      "parentResultId": "gen-as26-minor",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Proper minor-closed classes",
      "sourceMath": {
        "rounds": "O_𝒞,ε(1)",
        "roundsDisplay": "f(𝒞, ε)",
        "roundsTex": "O_{\\mathcal{C},\\varepsilon}(1)",
        "roundsDisplayTex": "f\\bigl(\\mathcal{C},\\varepsilon\\bigr)",
        "approximation": "2a(𝒞) + 1 + ε",
        "approximationDisplay": "2a(𝒞) + 1 + ε",
        "approximationTex": "2a(\\mathcal{C})+1+\\varepsilon",
        "approximationDisplayTex": "2a(\\mathcal{C})+1+\\varepsilon",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "gen-as26-minor",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "minor",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "minor"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(f\\bigl(\\mathcal{C},\\varepsilon\\bigr)\\bigr)+4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(2a(\\mathcal{C})+1+\\varepsilon\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "(f(𝒞, ε)) + 4",
        "tex": "\\bigl(f\\bigl(\\mathcal{C},\\varepsilon\\bigr)\\bigr)+4",
        "basis": "reduction",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2610.09618",
            "title": "Almost Optimal Constant-Round Approximation of Dominating Set in Graph Classes with Excluded Minors",
            "location": "Abstract"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "symbolic",
        "derivedFrom": "gen-as26-minor"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "a(𝒞)",
          "description": "Supremum of the edge-to-vertex ratio over graphs in the fixed minor-closed class 𝒞",
          "tex": "a(\\mathcal{C})"
        },
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "a",
          "description": "Edge-density bound of the fixed minor-closed graph class",
          "tex": "a"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        },
        {
          "symbol": "𝒞",
          "description": "Fixed input graph class",
          "tex": "\\mathcal{C}"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-3ffeda864faf117fac90",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-a068089182c38c178d48"
        ],
        "assumptions": [
          "auto-assumption-70bdbc914fc2a76049b7"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-70bdbc914fc2a76049b7",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-3ffeda864faf117fac90",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-a068089182c38c178d48",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-gen-as26-random--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Proper minor-closed classes",
      "model": "LOCAL",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (1 + ε in expectation)",
      "rounds": "(f(𝒞, ε)) + 4",
      "roundClass": "parameter",
      "parameters": "Source result (gen-as26-random), evaluated on its transformed instance: Fixed class 𝒞 and ε.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (gen-as26-random), evaluated on its transformed instance: Always feasible; expected size ≤ (1+ε)OPT.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "gen-as26",
      "theorem": "Abstract; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: An expectation guarantee, not a high-probability ratio.",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/abs/2610.09618",
      "year": 2026,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "(1 + 2∇₁) · (1 + ε in expectation)",
      "roundsDisplay": "(f(𝒞, ε)) + 4",
      "roundClassSource": "constant",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "gen-as26-random",
      "parentResultId": "gen-as26-random",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Proper minor-closed classes",
      "sourceMath": {
        "rounds": "O_𝒞,ε(1)",
        "roundsDisplay": "f(𝒞, ε)",
        "roundsTex": "O_{\\mathcal{C},\\varepsilon}(1)",
        "roundsDisplayTex": "f\\bigl(\\mathcal{C},\\varepsilon\\bigr)",
        "approximation": "1 + ε in expectation",
        "approximationDisplay": "1 + ε in expectation",
        "approximationTex": "1+\\varepsilon\\;\\text{in expectation}",
        "approximationDisplayTex": "1+\\varepsilon\\;\\text{in expectation}",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "gen-as26-random",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "minor",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "minor"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(f\\bigl(\\mathcal{C},\\varepsilon\\bigr)\\bigr)+4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(1+\\varepsilon\\;\\text{in expectation}\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "(f(𝒞, ε)) + 4",
        "tex": "\\bigl(f\\bigl(\\mathcal{C},\\varepsilon\\bigr)\\bigr)+4",
        "basis": "reduction",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2610.09618",
            "title": "Almost Optimal Constant-Round Approximation of Dominating Set in Graph Classes with Excluded Minors",
            "location": "Abstract"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "symbolic",
        "derivedFrom": "gen-as26-random"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        },
        {
          "symbol": "𝒞",
          "description": "Fixed input graph class",
          "tex": "\\mathcal{C}"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-3ffeda864faf117fac90",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-2a0f75743ae4b2e86b36"
        ],
        "assumptions": [
          "auto-assumption-603a887dcfe3861601f4"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-603a887dcfe3861601f4",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-3ffeda864faf117fac90",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-2a0f75743ae4b2e86b36",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-gen-as26-power-lower--mds-to-local-covering",
      "problem": "Integral local covering",
      "variant": "Source algorithm: Unweighted",
      "objective": "min",
      "graphClass": "r-th powers of paths",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "approximation": "≥ 2r + 1",
      "rounds": "f(r, ε) rounds ruled out",
      "roundClass": "parameter",
      "parameters": "Source result (gen-as26-power-lower), evaluated on its transformed instance: Fixed integer r ≥ 1; ε > 0 is a gap below 2r + 1. The excluded round complexity may depend on r and ε, but not on n.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (gen-as26-power-lower), evaluated on its transformed instance: Deterministic; n may be known.\n\nClosed-neighborhood requests: Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags. Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination.",
      "paperId": "gen-as26",
      "theorem": "Theorem 8.7 (arXiv v2); derived via mds-to-local-covering",
      "summary": "Derived lower bound via Closed-neighborhood requests. Original source: Pure path powers suffice. Related lower bounds in Picavet’s thesis use endpoint leaves or excluded-minor pathwidth.",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/html/2610.09618v2#S8.SS4",
      "year": 2026,
      "problemScope": {
        "node": "local-covering"
      },
      "graphScope": {
        "node": "path-powers"
      },
      "approximationDisplay": "≥ 2r + 1",
      "roundsDisplay": "f(r, ε) rounds ruled out",
      "roundBudgetExcluded": true,
      "roundClassSource": "constant",
      "weightCondition": "weights-unweighted",
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "gen-as26-power-lower",
      "parentResultId": "gen-as26-power-lower",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "r-th powers of paths",
      "sourceMath": {
        "rounds": "O(1)-round impossibility",
        "roundsDisplay": "f(r, ε) rounds ruled out",
        "roundsTex": "O(1)\\text{-round impossibility}",
        "roundsDisplayTex": "f\\bigl(r,\\varepsilon\\bigr)\\text{ rounds ruled out}",
        "approximation": "No ratio < 2r + 1",
        "approximationDisplay": "≥ 2r + 1",
        "approximationTex": "\\text{No ratio }<2r+1",
        "approximationDisplayTex": "\\ge 2r+1",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "mds-to-local-covering"
      ],
      "reductionDirection": "lower",
      "reductionSteps": [
        {
          "id": "mds-to-local-covering",
          "title": "Closed-neighborhood requests",
          "inputResultId": "gen-as26-power-lower",
          "outputProblem": "local-covering",
          "outputGraph": "path-powers",
          "from": "dominating-set",
          "to": "local-covering",
          "direction": "lower",
          "substitutions": {},
          "cost": "T",
          "factor": "identity",
          "conditions": [
            "Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags.",
            "Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved.",
            "The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required.",
            "T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated."
          ],
          "assumptions": [
            "Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination."
          ],
          "source": {
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "location": "Section 6.6; Appendix D"
          },
          "modelConversion": null
        }
      ],
      "derivedMath": {
        "rounds": "f\\bigl(r,\\varepsilon\\bigr)\\text{ rounds ruled out}",
        "approximation": "\\ge 2r+1"
      },
      "roundComplexityDetails": {
        "status": "impossibility",
        "formula": "Any T(r, ε) independent of n",
        "tex": "\\text{Any }T\\bigl(r,\\varepsilon\\bigr)\\text{ independent of }n",
        "basis": "reduction",
        "explanation": "This excludes every round complexity depending only on the listed fixed parameters, independently of n. It is a lower-bound budget, not the running time of an algorithm. The atlas applies the exact instance substitutions and communication cost of the reduction: Closed-neighborhood requests.",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2610.09618v2#S8.SS4",
            "title": "Almost Optimal Constant-Round Approximation of Dominating Set in Graph Classes with Excluded Minors",
            "location": "Theorem 8.7 (arXiv v2)"
          },
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "location": "Section 6.6; Appendix D"
          }
        ],
        "parameters": [
          {
            "symbol": "T",
            "description": "An arbitrary number of communication rounds depending only on the listed fixed parameters",
            "tex": "T"
          }
        ],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "quantified-impossibility",
        "derivedFrom": "gen-as26-power-lower"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "T",
          "description": "An arbitrary number of communication rounds depending only on the listed fixed parameters",
          "tex": "T"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Power of the underlying path: vertices at distance at most this value are adjacent",
          "tex": "r"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-5576afcd0ec58ee432cc",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-741c702feb1cd68e99f0"
        ],
        "assumptions": [
          "auto-assumption-2964335fb67c92c6fa43"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-2964335fb67c92c6fa43",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-5576afcd0ec58ee432cc",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-d13f16e4e51c9b55f160",
          "auto-parameter-741c702feb1cd68e99f0",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-gen-w26-clique-dom--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar with a clique attached at one vertex",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (7 + ε)",
      "rounds": "(f(ε)) + 4",
      "roundClass": "parameter",
      "parameters": "Source result (gen-w26-clique-dom), evaluated on its transformed instance: Fixed ε > 0; clique size unbounded.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (gen-w26-clique-dom), evaluated on its transformed instance: Distinct IDs; n need not be known.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "gen-w26-transfer",
      "theorem": "Abstract; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: The target class can have unbounded genus.",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/abs/2610.15596",
      "year": 2026,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "planar-clique"
      },
      "approximationDisplay": "(1 + 2∇₁) · (7 + ε)",
      "roundsDisplay": "(f(ε)) + 4",
      "roundClassSource": "constant",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "gen-w26-clique-dom",
      "parentResultId": "gen-w26-clique-dom",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Planar with a clique attached at one vertex",
      "sourceMath": {
        "rounds": "O_ε(1)",
        "roundsDisplay": "f(ε)",
        "roundsTex": "O_\\varepsilon(1)",
        "roundsDisplayTex": "f\\bigl(\\varepsilon\\bigr)",
        "approximation": "7 + ε",
        "approximationDisplay": "7 + ε",
        "approximationTex": "7 + \\varepsilon",
        "approximationDisplayTex": "7 + \\varepsilon",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "gen-w26-clique-dom",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "planar-clique",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "planar-clique"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(f\\bigl(\\varepsilon\\bigr)\\bigr)+4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(7 + \\varepsilon\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "(f(ε)) + 4",
        "tex": "\\bigl(f\\bigl(\\varepsilon\\bigr)\\bigr)+4",
        "basis": "reduction",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2610.15596",
            "title": "Almost Lossless Transfer for Cuttable Distributed Problems",
            "location": "Abstract"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "symbolic",
        "derivedFrom": "gen-w26-clique-dom"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-88416e0fa2d902c6bf6e",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-c09ae0a60fc23b13685a"
        ],
        "assumptions": [
          "auto-assumption-856f6022043b0de9b5df"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-856f6022043b0de9b5df",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-88416e0fa2d902c6bf6e",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-c09ae0a60fc23b13685a",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-gen-p26-density--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Bounded maximum average degree and depth-one density",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (d + 1 + ε)",
      "rounds": "(f(d, ∇₁, ε)) + 4",
      "roundClass": "parameter",
      "parameters": "Source result (gen-p26-density), evaluated on its transformed instance: Fixed mad bound d, shallow-minor density ∇₁, ε.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (gen-p26-density), evaluated on its transformed instance: \n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "gen-p26",
      "theorem": "Abstract; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: Extends beyond minor-closed classes.",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/abs/2610.31203",
      "year": 2026,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "depth-one"
      },
      "approximationDisplay": "(1 + 2∇₁) · (d + 1 + ε)",
      "roundsDisplay": "(f(d, ∇₁, ε)) + 4",
      "roundClassSource": "constant",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "gen-p26-density",
      "parentResultId": "gen-p26-density",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Bounded maximum average degree and depth-one density",
      "sourceMath": {
        "rounds": "O_d,∇₁,ε(1)",
        "roundsDisplay": "f(d, ∇₁, ε)",
        "roundsTex": "O_{d,\\nabla_1,\\varepsilon}(1)",
        "roundsDisplayTex": "f\\bigl(d,\\nabla_1,\\varepsilon\\bigr)",
        "approximation": "d + 1 + ε",
        "approximationDisplay": "d + 1 + ε",
        "approximationTex": "d + 1 + \\varepsilon",
        "approximationDisplayTex": "d + 1 + \\varepsilon",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "gen-p26-density",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "depth-one",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "depth-one"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(f\\bigl(d,\\nabla_1,\\varepsilon\\bigr)\\bigr)+4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(d + 1 + \\varepsilon\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "(f(d, ∇₁, ε)) + 4",
        "tex": "\\bigl(f\\bigl(d,\\nabla_1,\\varepsilon\\bigr)\\bigr)+4",
        "basis": "reduction",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2610.31203",
            "title": "Almost tight distributed approximation for domination in sparse graph classes",
            "location": "Abstract"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "symbolic",
        "derivedFrom": "gen-p26-density"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Upper bound on depth-one minor density",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "d",
          "description": "Maximum average degree bound of the input graph",
          "tex": "d"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-c176f5851daf0691e2c9",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-2ce51cdc659fec78a3e5"
        ],
        "assumptions": [
          "auto-assumption-3faaa0672726ae6c2e58"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-3faaa0672726ae6c2e58",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-c176f5851daf0691e2c9",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-2ce51cdc659fec78a3e5",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-gen-p26-genus--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Euler genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (7 + ε)",
      "rounds": "(f(g, ε)) + 4",
      "roundClass": "parameter",
      "parameters": "Source result (gen-p26-genus), evaluated on its transformed instance: Fixed Euler genus g and ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (gen-p26-genus), evaluated on its transformed instance: \n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "gen-p26",
      "theorem": "Abstract; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: Includes planar graphs.",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/abs/2610.31203",
      "year": 2026,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "euler",
        "note": "Retain any connectivity condition stated by the source."
      },
      "approximationDisplay": "(1 + 2∇₁) · (7 + ε)",
      "roundsDisplay": "(f(g, ε)) + 4",
      "roundClassSource": "constant",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "gen-p26-genus",
      "parentResultId": "gen-p26-genus",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Euler genus ≤ g",
      "sourceMath": {
        "rounds": "O_g,ε(1)",
        "roundsDisplay": "f(g, ε)",
        "roundsTex": "O_{g,\\varepsilon}(1)",
        "roundsDisplayTex": "f\\bigl(g,\\varepsilon\\bigr)",
        "approximation": "7 + ε",
        "approximationDisplay": "7 + ε",
        "approximationTex": "7 + \\varepsilon",
        "approximationDisplayTex": "7 + \\varepsilon",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "gen-p26-genus",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "euler",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "euler"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(f\\bigl(g,\\varepsilon\\bigr)\\bigr)+4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(7 + \\varepsilon\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "(f(g, ε)) + 4",
        "tex": "\\bigl(f\\bigl(g,\\varepsilon\\bigr)\\bigr)+4",
        "basis": "reduction",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2610.31203",
            "title": "Almost tight distributed approximation for domination in sparse graph classes",
            "location": "Abstract"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "symbolic",
        "derivedFrom": "gen-p26-genus"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound",
          "tex": "g"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-4688deea0bc7a8a63f32",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-9c4344caef616bad0511"
        ],
        "assumptions": [
          "auto-assumption-ae89b3d9b9367b2b2c9e"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-ae89b3d9b9367b2b2c9e",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-4688deea0bc7a8a63f32",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-9c4344caef616bad0511",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-gen-p26-trianglefree--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Triangle-free; Euler genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (5 + ε)",
      "rounds": "(f(g, ε)) + 4",
      "roundClass": "parameter",
      "parameters": "Source result (gen-p26-trianglefree), evaluated on its transformed instance: Fixed Euler genus g and ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (gen-p26-trianglefree), evaluated on its transformed instance: \n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "gen-p26",
      "theorem": "Abstract; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: Includes triangle-free planar graphs.",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/abs/2610.31203",
      "year": 2026,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "triangle-genus"
      },
      "approximationDisplay": "(1 + 2∇₁) · (5 + ε)",
      "roundsDisplay": "(f(g, ε)) + 4",
      "roundClassSource": "constant",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "gen-p26-trianglefree",
      "parentResultId": "gen-p26-trianglefree",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Triangle-free; Euler genus ≤ g",
      "sourceMath": {
        "rounds": "O_g,ε(1)",
        "roundsDisplay": "f(g, ε)",
        "roundsTex": "O_{g,\\varepsilon}(1)",
        "roundsDisplayTex": "f\\bigl(g,\\varepsilon\\bigr)",
        "approximation": "5 + ε",
        "approximationDisplay": "5 + ε",
        "approximationTex": "5 + \\varepsilon",
        "approximationDisplayTex": "5 + \\varepsilon",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "gen-p26-trianglefree",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "triangle-genus",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "triangle-genus"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(f\\bigl(g,\\varepsilon\\bigr)\\bigr)+4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(5 + \\varepsilon\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "(f(g, ε)) + 4",
        "tex": "\\bigl(f\\bigl(g,\\varepsilon\\bigr)\\bigr)+4",
        "basis": "reduction",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://arxiv.org/abs/2610.31203",
            "title": "Almost tight distributed approximation for domination in sparse graph classes",
            "location": "Abstract"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "symbolic",
        "derivedFrom": "gen-p26-trianglefree"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound",
          "tex": "g"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-4cb0180200cc86776426",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-dc5b5489116b1c8c0736"
        ],
        "assumptions": [
          "auto-assumption-b8ecc2c1afd8ae143dab"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-b8ecc2c1afd8ae143dab",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-4cb0180200cc86776426",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-dc5b5489116b1c8c0736",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-gen-asw26-planar--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "7 · (7)",
      "rounds": "(Constant) + 4",
      "roundClass": "constant",
      "parameters": "Source result (gen-asw26-planar), evaluated on its transformed instance: \n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (gen-asw26-planar), evaluated on its transformed instance: Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.\n\nThe source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only.",
      "paperId": "gen-asw26",
      "theorem": "Theorem C(i); Corollary 1.1; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: ",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "7 · (7)",
      "roundsDisplay": "(Constant) + 4",
      "approximationBenchmark": "integral",
      "weightCondition": "weights-unweighted",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted; fractional benchmark",
      "sourceVerification": "primary",
      "sourceResultId": "gen-asw26-planar",
      "parentResultId": "gen-asw26-planar",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Planar",
      "sourceMath": {
        "rounds": "O(1)",
        "roundsDisplay": "Constant",
        "roundsTex": "O(1)",
        "roundsDisplayTex": "\\text{Constant}",
        "approximation": "7 against fractional OPT",
        "approximationDisplay": "7",
        "approximationTex": "7\\;\\text{against fractional OPT}",
        "approximationDisplayTex": "7",
        "approximationBenchmark": "fractional"
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "gen-asw26-planar",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "planar",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": "The source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only.",
          "multiplier": {
            "label": "7",
            "tex": "7",
            "graph": "planar"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "planar"
              ],
              "edges": []
            },
            "bound": {
              "graph": "planar",
              "label": "7",
              "tex": "7",
              "certificate": "Planarity is minor-closed and planar minors have edge density at most three."
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(\\text{Constant}\\bigr)+4",
        "approximation": "7\\cdot\\bigl(7\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "(Constant) + 4",
        "tex": "\\bigl(\\text{Constant}\\bigr)+4",
        "basis": "reduction",
        "explanation": "Theorem C and Corollary 1.1 give universal constant-round algorithms for these fixed graph classes. Section 6.5, Theorem 6.13, bounds the fractional algorithm by fixed parameters, but gives no end-to-end numerical total. The partition in Lemma 6.9 also uses parameter-dependent constants without numerical instantiation. The three broadcasts after the fractional stage in Section 5.4 are only the final stage, not the total round count. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=24",
            "title": "Amiri–Siebertz–Wawrzyniak, implementation",
            "location": "Section 5.4, final implementation paragraph"
          },
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=35",
            "title": "Partition and fractional algorithm",
            "location": "Lemma 6.9 and Theorem 6.13, PDF pp. 35 and 40"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "not-specified",
        "derivedFrom": "gen-asw26-planar"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-68f97a5e384ab2cf609a"
        ],
        "assumptions": [
          "auto-assumption-0bf8cd25176054dabaa5"
        ],
        "detail": [
          "auto-detail-bcdea068c1168a6e72e9"
        ],
        "covered": [
          "auto-assumption-0bf8cd25176054dabaa5",
          "auto-detail-bcdea068c1168a6e72e9",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-68f97a5e384ab2cf609a",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-gen-asw26-trianglefree--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Triangle-free planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "7 · (5)",
      "rounds": "(Constant) + 4",
      "roundClass": "constant",
      "parameters": "Source result (gen-asw26-trianglefree), evaluated on its transformed instance: \n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (gen-asw26-trianglefree), evaluated on its transformed instance: Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.\n\nThe source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only.",
      "paperId": "gen-asw26",
      "theorem": "Theorem C(iii); Corollary 1.1; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: ",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "triangle-planar"
      },
      "approximationDisplay": "7 · (5)",
      "roundsDisplay": "(Constant) + 4",
      "approximationBenchmark": "integral",
      "weightCondition": "weights-unweighted",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted; fractional benchmark",
      "sourceVerification": "primary",
      "sourceResultId": "gen-asw26-trianglefree",
      "parentResultId": "gen-asw26-trianglefree",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Triangle-free planar",
      "sourceMath": {
        "rounds": "O(1)",
        "roundsDisplay": "Constant",
        "roundsTex": "O(1)",
        "roundsDisplayTex": "\\text{Constant}",
        "approximation": "5 against fractional OPT",
        "approximationDisplay": "5",
        "approximationTex": "5\\;\\text{against fractional OPT}",
        "approximationDisplayTex": "5",
        "approximationBenchmark": "fractional"
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "gen-asw26-trianglefree",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "triangle-planar",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": "The source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only.",
          "multiplier": {
            "label": "7",
            "tex": "7",
            "graph": "planar"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "triangle-planar",
                "planar"
              ],
              "edges": [
                {
                  "subset": "triangle-planar",
                  "superset": "planar",
                  "reason": "Drop the triangle-free restriction.",
                  "lower": true
                }
              ]
            },
            "bound": {
              "graph": "planar",
              "label": "7",
              "tex": "7",
              "certificate": "Planarity is minor-closed and planar minors have edge density at most three."
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(\\text{Constant}\\bigr)+4",
        "approximation": "7\\cdot\\bigl(5\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "(Constant) + 4",
        "tex": "\\bigl(\\text{Constant}\\bigr)+4",
        "basis": "reduction",
        "explanation": "Theorem C and Corollary 1.1 give universal constant-round algorithms for these fixed graph classes. Section 6.5, Theorem 6.13, bounds the fractional algorithm by fixed parameters, but gives no end-to-end numerical total. The partition in Lemma 6.9 also uses parameter-dependent constants without numerical instantiation. The three broadcasts after the fractional stage in Section 5.4 are only the final stage, not the total round count. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=24",
            "title": "Amiri–Siebertz–Wawrzyniak, implementation",
            "location": "Section 5.4, final implementation paragraph"
          },
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=35",
            "title": "Partition and fractional algorithm",
            "location": "Lemma 6.9 and Theorem 6.13, PDF pp. 35 and 40"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "not-specified",
        "derivedFrom": "gen-asw26-trianglefree"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-17b28995226fcbf3e00f",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-aeda0a5fc156d8327143"
        ],
        "assumptions": [
          "auto-assumption-d88980040733e2436cd7"
        ],
        "detail": [
          "auto-detail-bcdea068c1168a6e72e9"
        ],
        "covered": [
          "auto-assumption-d88980040733e2436cd7",
          "auto-detail-bcdea068c1168a6e72e9",
          "auto-graph-17b28995226fcbf3e00f",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-aeda0a5fc156d8327143",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-gen-asw26-minordensity--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Every minor H satisfies |E(H)| ≤ a|V(H)|",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (2a + 1)",
      "rounds": "(f(a)) + 4",
      "roundClass": "parameter",
      "parameters": "Source result (gen-asw26-minordensity), evaluated on its transformed instance: Fixed rational a ≥ 1.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (gen-asw26-minordensity), evaluated on its transformed instance: Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.\n\nThe source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only.",
      "paperId": "gen-asw26",
      "theorem": "Theorem C(i); derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: ",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "(1 + 2∇₁) · (2a + 1)",
      "roundsDisplay": "(f(a)) + 4",
      "approximationBenchmark": "integral",
      "roundClassSource": "constant",
      "weightCondition": "weights-unweighted",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted; fractional benchmark",
      "sourceVerification": "primary",
      "sourceResultId": "gen-asw26-minordensity",
      "parentResultId": "gen-asw26-minordensity",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Every minor H satisfies |E(H)| ≤ a|V(H)|",
      "sourceMath": {
        "rounds": "Oₐ(1)",
        "roundsDisplay": "f(a)",
        "roundsTex": "O_a(1)",
        "roundsDisplayTex": "f\\bigl(a\\bigr)",
        "approximation": "2a + 1 against fractional OPT",
        "approximationDisplay": "2a + 1",
        "approximationTex": "2a+1\\;\\text{against fractional OPT}",
        "approximationDisplayTex": "2a+1",
        "approximationBenchmark": "fractional"
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "gen-asw26-minordensity",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "minor",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": "The source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only.",
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "minor"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(f\\bigl(a\\bigr)\\bigr)+4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(2a+1\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "(f(a)) + 4",
        "tex": "\\bigl(f\\bigl(a\\bigr)\\bigr)+4",
        "basis": "reduction",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057",
            "title": "Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts",
            "location": "Theorem C(i)"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "symbolic",
        "derivedFrom": "gen-asw26-minordensity"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "G",
          "description": "Input graph",
          "tex": "G"
        },
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "a",
          "description": "Fixed rational upper bound on |E(H)|/|V(H)| for every minor H",
          "tex": "a"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a0de36fa1bbd12a5b487",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-ac6deabc8033886af39f"
        ],
        "assumptions": [
          "auto-assumption-afa657848aef5475df06"
        ],
        "detail": [
          "auto-detail-bcdea068c1168a6e72e9"
        ],
        "covered": [
          "auto-assumption-afa657848aef5475df06",
          "auto-detail-bcdea068c1168a6e72e9",
          "auto-graph-a0de36fa1bbd12a5b487",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-ac6deabc8033886af39f",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-gen-asw26-genus--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Euler genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (7)",
      "rounds": "(f(g)) + 4",
      "roundClass": "parameter",
      "parameters": "Source result (gen-asw26-genus), evaluated on its transformed instance: Fixed g.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (gen-asw26-genus), evaluated on its transformed instance: Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs. No embedding required. Benchmark is integral OPT.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.\n\nThe source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only.",
      "paperId": "gen-asw26",
      "theorem": "Theorem E; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: ",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "euler",
        "note": "Retain any connectivity condition stated by the source."
      },
      "notationChanges": [
        {
          "name": "Euler genus",
          "sourceSymbol": "e",
          "symbol": "g"
        }
      ],
      "parametersSource": "Fixed e.",
      "approximationDisplay": "(1 + 2∇₁) · (7)",
      "roundsDisplay": "(f(g)) + 4",
      "roundClassSource": "constant",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted; integral benchmark",
      "sourceVerification": "primary",
      "sourceResultId": "gen-asw26-genus",
      "parentResultId": "gen-asw26-genus",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Euler genus ≤ g",
      "sourceMath": {
        "rounds": "Oₑ(1)",
        "roundsDisplay": "f(g)",
        "roundsTex": "O_e(1)",
        "roundsDisplayTex": "f\\bigl(g\\bigr)",
        "approximation": "7",
        "approximationDisplay": "7",
        "approximationTex": "7",
        "approximationDisplayTex": "7",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "gen-asw26-genus",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "euler",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": "The source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only.",
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "euler"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(f\\bigl(g\\bigr)\\bigr)+4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(7\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "(f(g)) + 4",
        "tex": "\\bigl(f\\bigl(g\\bigr)\\bigr)+4",
        "basis": "reduction",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057",
            "title": "Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts",
            "location": "Theorem E"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "symbolic",
        "derivedFrom": "gen-asw26-genus"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound",
          "tex": "g"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-4688deea0bc7a8a63f32",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-85c37cacdfffb4767e8c"
        ],
        "assumptions": [
          "auto-assumption-a90e03b7de4f713759b3"
        ],
        "detail": [
          "auto-detail-a3a5696b4f285190f192"
        ],
        "covered": [
          "auto-assumption-a90e03b7de4f713759b3",
          "auto-detail-a3a5696b4f285190f192",
          "auto-graph-4688deea0bc7a8a63f32",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-85c37cacdfffb4767e8c",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-gen-asw26-setcover--vertex-cover-to-set-cover",
      "problem": "Vertex cover",
      "variant": "Source algorithm: Bounded costs; also red-blue domination / hitting set",
      "objective": "min",
      "graphClass": "Planar",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "4 + ε",
      "rounds": "(f(b, ε)) + 1",
      "roundClass": "parameter",
      "parameters": "Source result (gen-asw26-setcover), evaluated on its transformed instance: Fixed ε > 0 and integer b ≥ 1. Each set has a positive integer cost at most b.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.\n\nEdges as universe elements: exact instance substitutions n=n+m, Δ=max{Δ,2}, f=2, k=Δ, m=2m.",
      "assumptions": "Source result (gen-asw26-setcover), evaluated on its transformed instance: Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs. Feasible instance; costs in {1,…,b}; unbounded set size and frequency.\n\nEdges as universe elements: Use universe E and one set of incident edges for each vertex, with the same vertex cost. Every element has frequency two, and each set has size at most Δ. A one-round identifier exchange lets endpoints agree on ownership and unique identifiers for virtual edge processors. One incidence round can then be simulated in one physical round, with local messages at the owner delivered locally. If the necessary endpoint identifiers are initially known, the setup can be omitted. The source theorem’s global instance-size or degree information must also be supplied; obtaining it is not hidden in T+1. Subdividing edges preserves planarity, but arbitrary incidence-network and minor promises still need checking. A generic per-edge simulation does not preserve a broadcast-only restriction. Anonymous broadcast algorithms can sometimes avoid identifier-based ownership; such a specialized simulation is not certified by this generic recipe. The displayed maximum degree max{Δ,2} applies when G has at least one edge. An edgeless instance is handled locally with the empty output; it is not passed to the incidence algorithm. The edge-subdivision incidence graph has exactly 2m edges, with two incidences for each original edge. Universe E with one incident-edge set per original vertex; the incidence graph subdivides every edge. One identifier-exchange setup round assigns virtual edge processors. Source global algorithm inputs must already be supplied or separately obtained. For the simulated algorithm, G has at least one edge. Edgeless instances have an empty optimal output handled locally.",
      "paperId": "gen-asw26",
      "theorem": "Corollary H.1(ii); derived via vertex-cover-to-set-cover",
      "summary": "Derived upper bound via Edges as universe elements. Original source: ",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "4 + ε",
      "roundsDisplay": "(f(b, ε)) + 1",
      "approximationBenchmark": "fractional",
      "roundClassSource": "constant",
      "weightCondition": "costs-integer-b",
      "sourceVariant": "Bounded costs; also red-blue domination / hitting set",
      "sourceVerification": "primary",
      "sourceResultId": "gen-asw26-setcover",
      "parentResultId": "gen-asw26-setcover",
      "sourceProblem": "Set cover",
      "sourceGraphClass": "Planar incidence graphs",
      "sourceMath": {
        "rounds": "Oᵦ,ε(1)",
        "roundsDisplay": "f(b, ε)",
        "roundsTex": "O_{b,\\varepsilon}(1)",
        "roundsDisplayTex": "f\\bigl(b,\\varepsilon\\bigr)",
        "approximation": "4 + ε against fractional OPT",
        "approximationDisplay": "4 + ε",
        "approximationTex": "4+\\varepsilon\\;\\text{against fractional OPT}",
        "approximationDisplayTex": "4+\\varepsilon",
        "approximationBenchmark": "fractional"
      },
      "reductionPath": [
        "vertex-cover-to-set-cover"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "vertex-cover-to-set-cover",
          "title": "Edges as universe elements",
          "inputResultId": "gen-asw26-setcover",
          "outputProblem": "vertex-cover",
          "outputGraph": "planar",
          "from": "vertex-cover",
          "to": "set-cover",
          "direction": "upper",
          "substitutions": {
            "n": "n+m",
            "Δ": "max{Δ,2}",
            "f": "2",
            "k": "Δ",
            "m": "2m"
          },
          "cost": "T+1",
          "factor": "identity",
          "conditions": [
            "Use universe E and one set of incident edges for each vertex, with the same vertex cost. Every element has frequency two, and each set has size at most Δ.",
            "A one-round identifier exchange lets endpoints agree on ownership and unique identifiers for virtual edge processors. One incidence round can then be simulated in one physical round, with local messages at the owner delivered locally. If the necessary endpoint identifiers are initially known, the setup can be omitted.",
            "The source theorem’s global instance-size or degree information must also be supplied; obtaining it is not hidden in T+1.",
            "Subdividing edges preserves planarity, but arbitrary incidence-network and minor promises still need checking. A generic per-edge simulation does not preserve a broadcast-only restriction.",
            "Anonymous broadcast algorithms can sometimes avoid identifier-based ownership; such a specialized simulation is not certified by this generic recipe.",
            "The displayed maximum degree max{Δ,2} applies when G has at least one edge. An edgeless instance is handled locally with the empty output; it is not passed to the incidence algorithm.",
            "The edge-subdivision incidence graph has exactly 2m edges, with two incidences for each original edge."
          ],
          "assumptions": [
            "Universe E with one incident-edge set per original vertex; the incidence graph subdivides every edge.",
            "One identifier-exchange setup round assigns virtual edge processors. Source global algorithm inputs must already be supplied or separately obtained.",
            "For the simulated algorithm, G has at least one edge. Edgeless instances have an empty optimal output handled locally."
          ],
          "source": {
            "title": "Åstrand and Suomela, Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks",
            "url": "https://jukkasuomela.fi/doc/vc-sc.pdf",
            "location": "Sections 1 and 5; edge-processor simulation specified here"
          },
          "modelConversion": null
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(f\\bigl(b,\\varepsilon\\bigr)\\bigr)+1",
        "approximation": "4+\\varepsilon"
      },
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "(f(b, ε)) + 1",
        "tex": "\\bigl(f\\bigl(b,\\varepsilon\\bigr)\\bigr)+1",
        "basis": "reduction",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate. The atlas applies the exact instance substitutions and communication cost of the reduction: Edges as universe elements.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057",
            "title": "Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts",
            "location": "Corollary H.1(ii)"
          },
          {
            "url": "https://jukkasuomela.fi/doc/vc-sc.pdf",
            "title": "Åstrand and Suomela, Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks",
            "location": "Sections 1 and 5; edge-processor simulation specified here"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "symbolic",
        "derivedFrom": "gen-asw26-setcover"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "b",
          "description": "Upper bound on the positive integer cost of each set",
          "tex": "b"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "costs-integer-b"
        ],
        "parameters": [
          "auto-parameter-39a561a6f3ee94c8a10b"
        ],
        "assumptions": [
          "auto-assumption-5a9f92a24cd09ad360df"
        ],
        "detail": [
          "auto-detail-82557c9d0ebfe7589d0a"
        ],
        "covered": [
          "auto-assumption-5a9f92a24cd09ad360df",
          "auto-detail-82557c9d0ebfe7589d0a",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-7f07455ff69b3b347e9b",
          "auto-parameter-39a561a6f3ee94c8a10b",
          "costs-integer-b",
          "detail-fractional-benchmark",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "derived-gen-asw26-fractional--fractional-domination-to-local-covering",
      "problem": "Fractional dominating set",
      "variant": "Source algorithm: Local covering constraints; bounded costs",
      "objective": "min",
      "graphClass": "Every minor H satisfies |E(H)| ≤ ρ|V(H)|",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "f(ρ, b, ε)",
      "roundClass": "parameter",
      "parameters": "Source result (gen-asw26-fractional), evaluated on its transformed instance: Fixed rational ρ ≥ 1, integer b ≥ 1 and ε > 0. Each candidate vertex has a positive integer cost at most b.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (gen-asw26-fractional), evaluated on its transformed instance: Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs. Feasible locally known candidates C(r) ⊆ N[r]; costs in {1,…,b}.\n\nFractional closed neighborhoods: Use requests V, candidates C(v)=N[v], and the same nonnegative vertex variables. These flags are locally constructible. The fractional feasible region and objective are identical. Use unit costs for the unweighted relaxation; a weighted algorithm must accept the supplied costs. This produces fractional vertex values, not an integral dominating set. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate requests V and candidate sets C(v)=N[v]; retain fractional output.",
      "paperId": "gen-asw26",
      "theorem": "Theorem A; derived via fractional-domination-to-local-covering",
      "summary": "Derived upper bound via Fractional closed neighborhoods. Original source: ",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "fractional-dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "notationChanges": [
        {
          "name": "accuracy",
          "sourceSymbol": "δ",
          "symbol": "ε"
        }
      ],
      "parametersSource": "Fixed rational ρ ≥ 1, integer b ≥ 1 and δ > 0. Each candidate vertex has a positive integer cost at most b.",
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "f(ρ, b, ε)",
      "approximationBenchmark": "fractional",
      "roundClassSource": "constant",
      "weightCondition": "costs-integer-b",
      "sourceVariant": "Local covering constraints; bounded costs",
      "sourceVerification": "primary",
      "sourceResultId": "gen-asw26-fractional",
      "parentResultId": "gen-asw26-fractional",
      "sourceProblem": "Fractional local covering",
      "sourceGraphClass": "Every minor H satisfies |E(H)| ≤ ρ|V(H)|",
      "sourceMath": {
        "rounds": "Oρ,ᵦ,δ(1)",
        "roundsDisplay": "f(ρ, b, ε)",
        "roundsTex": "O_{\\rho,b,\\delta}(1)",
        "roundsDisplayTex": "f\\bigl(\\rho,b,\\varepsilon\\bigr)",
        "approximation": "1 + δ against fractional OPT",
        "approximationDisplay": "1 + ε",
        "approximationTex": "1+\\delta\\;\\text{against fractional OPT}",
        "approximationDisplayTex": "1 + \\varepsilon",
        "approximationBenchmark": "fractional"
      },
      "reductionPath": [
        "fractional-domination-to-local-covering"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "fractional-domination-to-local-covering",
          "title": "Fractional closed neighborhoods",
          "inputResultId": "gen-asw26-fractional",
          "outputProblem": "fractional-dominating-set",
          "outputGraph": "minor",
          "from": "fractional-dominating-set",
          "to": "fractional-local-covering",
          "direction": "upper",
          "substitutions": {},
          "cost": "T",
          "factor": "identity",
          "conditions": [
            "Use requests V, candidates C(v)=N[v], and the same nonnegative vertex variables. These flags are locally constructible.",
            "The fractional feasible region and objective are identical. Use unit costs for the unweighted relaxation; a weighted algorithm must accept the supplied costs.",
            "This produces fractional vertex values, not an integral dominating set.",
            "The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required.",
            "T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated."
          ],
          "assumptions": [
            "Instantiate requests V and candidate sets C(v)=N[v]; retain fractional output."
          ],
          "source": {
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "location": "Section 6.6; Appendix D"
          },
          "modelConversion": null
        }
      ],
      "derivedMath": {
        "rounds": "f\\bigl(\\rho,b,\\varepsilon\\bigr)",
        "approximation": "1 + \\varepsilon"
      },
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(ρ, b, ε)",
        "tex": "f\\bigl(\\rho,b,\\varepsilon\\bigr)",
        "basis": "reduction",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate. The atlas applies the exact instance substitutions and communication cost of the reduction: Fractional closed neighborhoods.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057",
            "title": "Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts",
            "location": "Theorem A"
          },
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "location": "Section 6.6; Appendix D"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "symbolic",
        "derivedFrom": "gen-asw26-fractional"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "C(r)",
          "description": "Candidate vertices permitted to cover request r",
          "tex": "C(r)"
        },
        {
          "symbol": "C",
          "description": "Locally known candidate sets for the requests",
          "tex": "C"
        },
        {
          "symbol": "G",
          "description": "Input graph",
          "tex": "G"
        },
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "b",
          "description": "Upper bound on the positive integer cost of each candidate vertex",
          "tex": "b"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Request vertex of the local covering instance",
          "tex": "r"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        },
        {
          "symbol": "ρ",
          "description": "Fixed rational upper bound on |E(H)|/|V(H)| for every minor H",
          "tex": "\\rho"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-ba929dd9ea7a6101c7cf",
          "costs-integer-b"
        ],
        "parameters": [
          "auto-parameter-b07c3dacce1d03994dd5"
        ],
        "assumptions": [
          "auto-assumption-79da78df99866eb51e41"
        ],
        "detail": [
          "auto-detail-298d3915bfb97c889e62"
        ],
        "covered": [
          "auto-assumption-79da78df99866eb51e41",
          "auto-detail-298d3915bfb97c889e62",
          "auto-graph-ba929dd9ea7a6101c7cf",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-19e536b10b8d7f071a79",
          "auto-parameter-b07c3dacce1d03994dd5",
          "costs-integer-b",
          "detail-fractional-benchmark",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "derived-gen-asw26-cover-random--mds-to-local-covering",
      "problem": "Dominating set",
      "variant": "Source algorithm: Integral local cover; bounded costs",
      "objective": "min",
      "graphClass": "Every minor H satisfies |E(H)| ≤ ρ|V(H)|",
      "model": "CONGEST",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "1 + ε in expectation",
      "rounds": "f(ρ, b, ε)",
      "roundClass": "parameter",
      "parameters": "Source result (gen-asw26-cover-random), evaluated on its transformed instance: Fixed rational ρ ≥ 1, integer b ≥ 1 and ε > 0. Each candidate vertex has a positive integer cost at most b.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (gen-asw26-cover-random), evaluated on its transformed instance: Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs. Feasible locally known candidates C(r) ⊆ N[r]; costs in {1,…,b}. Output always feasible.\n\nClosed-neighborhood requests: Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags. Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination.",
      "paperId": "gen-asw26",
      "theorem": "Theorem D(i); derived via mds-to-local-covering",
      "summary": "Derived upper bound via Closed-neighborhood requests. Original source: ",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "1 + ε in expectation",
      "roundsDisplay": "f(ρ, b, ε)",
      "roundClassSource": "constant",
      "weightCondition": "costs-integer-b",
      "sourceVariant": "Integral local cover; bounded costs",
      "sourceVerification": "primary",
      "sourceResultId": "gen-asw26-cover-random",
      "parentResultId": "gen-asw26-cover-random",
      "sourceProblem": "Integral local covering",
      "sourceGraphClass": "Every minor H satisfies |E(H)| ≤ ρ|V(H)|",
      "sourceMath": {
        "rounds": "Oρ,ᵦ,ε(1)",
        "roundsDisplay": "f(ρ, b, ε)",
        "roundsTex": "O_{\\rho,b,\\varepsilon}(1)",
        "roundsDisplayTex": "f\\bigl(\\rho,b,\\varepsilon\\bigr)",
        "approximation": "1 + ε in expectation",
        "approximationDisplay": "1 + ε in expectation",
        "approximationTex": "1+\\varepsilon\\;\\text{in expectation}",
        "approximationDisplayTex": "1+\\varepsilon\\;\\text{in expectation}",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "mds-to-local-covering"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "mds-to-local-covering",
          "title": "Closed-neighborhood requests",
          "inputResultId": "gen-asw26-cover-random",
          "outputProblem": "dominating-set",
          "outputGraph": "minor",
          "from": "dominating-set",
          "to": "local-covering",
          "direction": "upper",
          "substitutions": {},
          "cost": "T",
          "factor": "identity",
          "conditions": [
            "Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags.",
            "Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved.",
            "The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required.",
            "T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated."
          ],
          "assumptions": [
            "Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination."
          ],
          "source": {
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "location": "Section 6.6; Appendix D"
          },
          "modelConversion": null
        }
      ],
      "derivedMath": {
        "rounds": "f\\bigl(\\rho,b,\\varepsilon\\bigr)",
        "approximation": "1+\\varepsilon\\;\\text{in expectation}"
      },
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(ρ, b, ε)",
        "tex": "f\\bigl(\\rho,b,\\varepsilon\\bigr)",
        "basis": "reduction",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate. The atlas applies the exact instance substitutions and communication cost of the reduction: Closed-neighborhood requests.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057",
            "title": "Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts",
            "location": "Theorem D(i)"
          },
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "location": "Section 6.6; Appendix D"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "symbolic",
        "derivedFrom": "gen-asw26-cover-random"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "C(r)",
          "description": "Candidate vertices permitted to cover request r",
          "tex": "C(r)"
        },
        {
          "symbol": "C",
          "description": "Locally known candidate sets for the requests",
          "tex": "C"
        },
        {
          "symbol": "G",
          "description": "Input graph",
          "tex": "G"
        },
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "b",
          "description": "Upper bound on the positive integer cost of each candidate vertex",
          "tex": "b"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Request vertex of the local covering instance",
          "tex": "r"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        },
        {
          "symbol": "ρ",
          "description": "Fixed rational upper bound on |E(H)|/|V(H)| for every minor H",
          "tex": "\\rho"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-ba929dd9ea7a6101c7cf",
          "costs-integer-b"
        ],
        "parameters": [
          "auto-parameter-7433dcdc316a8ed884e4"
        ],
        "assumptions": [
          "auto-assumption-dda5ba94931ca13b8243"
        ],
        "detail": [
          "auto-detail-75079e65b7958e1a3ca5"
        ],
        "covered": [
          "auto-assumption-dda5ba94931ca13b8243",
          "auto-detail-75079e65b7958e1a3ca5",
          "auto-graph-ba929dd9ea7a6101c7cf",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-7433dcdc316a8ed884e4",
          "costs-integer-b",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "derived-gen-asw26-cover-random--total-domination-to-local-covering",
      "problem": "Total dominating set",
      "variant": "Source algorithm: Integral local cover; bounded costs",
      "objective": "min",
      "graphClass": "Every minor H satisfies |E(H)| ≤ ρ|V(H)|",
      "model": "CONGEST",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "1 + ε in expectation",
      "rounds": "f(ρ, b, ε)",
      "roundClass": "parameter",
      "parameters": "Source result (gen-asw26-cover-random), evaluated on its transformed instance: Fixed rational ρ ≥ 1, integer b ≥ 1 and ε > 0. Each candidate vertex has a positive integer cost at most b.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (gen-asw26-cover-random), evaluated on its transformed instance: Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs. Feasible locally known candidates C(r) ⊆ N[r]; costs in {1,…,b}. Output always feasible.\n\nOpen-neighborhood requests: Make every vertex a request and put C(v)=N(v), excluding self-coverage. These incidence flags are locally known from the input edges. The input must have no isolated vertices. Use unit costs for the unweighted problem; retain cost restrictions in weighted instances. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate requests V and candidate sets C(v)=N(v); the input has no isolated vertices.",
      "paperId": "gen-asw26",
      "theorem": "Theorem D(i); derived via total-domination-to-local-covering",
      "summary": "Derived upper bound via Open-neighborhood requests. Original source: ",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "total-dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "1 + ε in expectation",
      "roundsDisplay": "f(ρ, b, ε)",
      "roundClassSource": "constant",
      "weightCondition": "costs-integer-b",
      "sourceVariant": "Integral local cover; bounded costs",
      "sourceVerification": "primary",
      "sourceResultId": "gen-asw26-cover-random",
      "parentResultId": "gen-asw26-cover-random",
      "sourceProblem": "Integral local covering",
      "sourceGraphClass": "Every minor H satisfies |E(H)| ≤ ρ|V(H)|",
      "sourceMath": {
        "rounds": "Oρ,ᵦ,ε(1)",
        "roundsDisplay": "f(ρ, b, ε)",
        "roundsTex": "O_{\\rho,b,\\varepsilon}(1)",
        "roundsDisplayTex": "f\\bigl(\\rho,b,\\varepsilon\\bigr)",
        "approximation": "1 + ε in expectation",
        "approximationDisplay": "1 + ε in expectation",
        "approximationTex": "1+\\varepsilon\\;\\text{in expectation}",
        "approximationDisplayTex": "1+\\varepsilon\\;\\text{in expectation}",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "total-domination-to-local-covering"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "total-domination-to-local-covering",
          "title": "Open-neighborhood requests",
          "inputResultId": "gen-asw26-cover-random",
          "outputProblem": "total-dominating-set",
          "outputGraph": "minor",
          "from": "total-dominating-set",
          "to": "local-covering",
          "direction": "upper",
          "substitutions": {},
          "cost": "T",
          "factor": "identity",
          "conditions": [
            "Make every vertex a request and put C(v)=N(v), excluding self-coverage. These incidence flags are locally known from the input edges.",
            "The input must have no isolated vertices. Use unit costs for the unweighted problem; retain cost restrictions in weighted instances.",
            "The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required.",
            "T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated."
          ],
          "assumptions": [
            "Instantiate requests V and candidate sets C(v)=N(v); the input has no isolated vertices."
          ],
          "source": {
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "location": "Section 6.6; Appendix D"
          },
          "modelConversion": null
        }
      ],
      "derivedMath": {
        "rounds": "f\\bigl(\\rho,b,\\varepsilon\\bigr)",
        "approximation": "1+\\varepsilon\\;\\text{in expectation}"
      },
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "f(ρ, b, ε)",
        "tex": "f\\bigl(\\rho,b,\\varepsilon\\bigr)",
        "basis": "reduction",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate. The atlas applies the exact instance substitutions and communication cost of the reduction: Open-neighborhood requests.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057",
            "title": "Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts",
            "location": "Theorem D(i)"
          },
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "location": "Section 6.6; Appendix D"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "symbolic",
        "derivedFrom": "gen-asw26-cover-random"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "C(r)",
          "description": "Candidate vertices permitted to cover request r",
          "tex": "C(r)"
        },
        {
          "symbol": "C",
          "description": "Locally known candidate sets for the requests",
          "tex": "C"
        },
        {
          "symbol": "G",
          "description": "Input graph",
          "tex": "G"
        },
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "b",
          "description": "Upper bound on the positive integer cost of each candidate vertex",
          "tex": "b"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Request vertex of the local covering instance",
          "tex": "r"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        },
        {
          "symbol": "ρ",
          "description": "Fixed rational upper bound on |E(H)|/|V(H)| for every minor H",
          "tex": "\\rho"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-ba929dd9ea7a6101c7cf",
          "costs-integer-b"
        ],
        "parameters": [
          "auto-parameter-7433dcdc316a8ed884e4"
        ],
        "assumptions": [
          "auto-assumption-663311027e6d97ad5d18"
        ],
        "detail": [
          "auto-detail-75079e65b7958e1a3ca5"
        ],
        "covered": [
          "auto-assumption-663311027e6d97ad5d18",
          "auto-detail-75079e65b7958e1a3ca5",
          "auto-graph-ba929dd9ea7a6101c7cf",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-f7056f83774cd9f78096",
          "auto-parameter-7433dcdc316a8ed884e4",
          "costs-integer-b",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "derived-gen-asw26-cover-random--client-domination-to-local-covering",
      "problem": "Client dominating set",
      "variant": "Source algorithm: Integral local cover; bounded costs",
      "objective": "min",
      "graphClass": "Every minor H satisfies |E(H)| ≤ ρ|V(H)|",
      "model": "CONGEST",
      "randomization": "Randomized",
      "bound": "upper",
      "approximation": "1 + ε in expectation",
      "rounds": "(f(ρ, b, ε)) + 1",
      "roundClass": "parameter",
      "parameters": "Source result (gen-asw26-cover-random), evaluated on its transformed instance: Fixed rational ρ ≥ 1, integer b ≥ 1 and ε > 0. Each candidate vertex has a positive integer cost at most b.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (gen-asw26-cover-random), evaluated on its transformed instance: Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs. Feasible locally known candidates C(r) ⊆ N[r]; costs in {1,…,b}. Output always feasible.\n\nPrescribed client requests: Use the client set R as the requests and put C(r)=N[r]. Each client initially knows its own membership in R. One setup round broadcasts client membership so both endpoints know request–candidate incidences. If these incidence flags are already supplied, the setup round can be omitted. Preserve any preprocessing allowed by SUPPORTED and every other source input convention. Upper-bound examples include this one-round setup. A client lower bound would shift by one round under this convention; unchanged exact lower-bound import is therefore disabled. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate the client requests R and C(r)=N[r]. One setup round advertises membership in R, unless those incidence flags are initially supplied.",
      "paperId": "gen-asw26",
      "theorem": "Theorem D(i); derived via client-domination-to-local-covering",
      "summary": "Derived upper bound via Prescribed client requests. Original source: ",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "client-dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "1 + ε in expectation",
      "roundsDisplay": "(f(ρ, b, ε)) + 1",
      "roundClassSource": "constant",
      "weightCondition": "costs-integer-b",
      "sourceVariant": "Integral local cover; bounded costs",
      "sourceVerification": "primary",
      "sourceResultId": "gen-asw26-cover-random",
      "parentResultId": "gen-asw26-cover-random",
      "sourceProblem": "Integral local covering",
      "sourceGraphClass": "Every minor H satisfies |E(H)| ≤ ρ|V(H)|",
      "sourceMath": {
        "rounds": "Oρ,ᵦ,ε(1)",
        "roundsDisplay": "f(ρ, b, ε)",
        "roundsTex": "O_{\\rho,b,\\varepsilon}(1)",
        "roundsDisplayTex": "f\\bigl(\\rho,b,\\varepsilon\\bigr)",
        "approximation": "1 + ε in expectation",
        "approximationDisplay": "1 + ε in expectation",
        "approximationTex": "1+\\varepsilon\\;\\text{in expectation}",
        "approximationDisplayTex": "1+\\varepsilon\\;\\text{in expectation}",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "client-domination-to-local-covering"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "client-domination-to-local-covering",
          "title": "Prescribed client requests",
          "inputResultId": "gen-asw26-cover-random",
          "outputProblem": "client-dominating-set",
          "outputGraph": "minor",
          "from": "client-dominating-set",
          "to": "local-covering",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+1",
          "factor": "identity",
          "conditions": [
            "Use the client set R as the requests and put C(r)=N[r]. Each client initially knows its own membership in R.",
            "One setup round broadcasts client membership so both endpoints know request–candidate incidences. If these incidence flags are already supplied, the setup round can be omitted.",
            "Preserve any preprocessing allowed by SUPPORTED and every other source input convention.",
            "Upper-bound examples include this one-round setup. A client lower bound would shift by one round under this convention; unchanged exact lower-bound import is therefore disabled.",
            "The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required.",
            "T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated."
          ],
          "assumptions": [
            "Instantiate the client requests R and C(r)=N[r]. One setup round advertises membership in R, unless those incidence flags are initially supplied."
          ],
          "source": {
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "location": "Section 6.6; Appendix D"
          },
          "modelConversion": null
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(f\\bigl(\\rho,b,\\varepsilon\\bigr)\\bigr)+1",
        "approximation": "1+\\varepsilon\\;\\text{in expectation}"
      },
      "roundComplexityDetails": {
        "status": "not-extracted",
        "formula": "(f(ρ, b, ε)) + 1",
        "tex": "\\bigl(f\\bigl(\\rho,b,\\varepsilon\\bigr)\\bigr)+1",
        "basis": "reduction",
        "explanation": "A more explicit dependence on these parameters has not yet been extracted for this record. The displayed function records the dependence without assigning a numerical growth rate. The atlas applies the exact instance substitutions and communication cost of the reduction: Prescribed client requests.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057",
            "title": "Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts",
            "location": "Theorem D(i)"
          },
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "location": "Section 6.6; Appendix D"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "symbolic",
        "derivedFrom": "gen-asw26-cover-random"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "C(r)",
          "description": "Candidate vertices permitted to cover request r",
          "tex": "C(r)"
        },
        {
          "symbol": "C",
          "description": "Locally known candidate sets for the requests",
          "tex": "C"
        },
        {
          "symbol": "G",
          "description": "Input graph",
          "tex": "G"
        },
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "b",
          "description": "Upper bound on the positive integer cost of each candidate vertex",
          "tex": "b"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Request vertex of the local covering instance",
          "tex": "r"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        },
        {
          "symbol": "ρ",
          "description": "Fixed rational upper bound on |E(H)|/|V(H)| for every minor H",
          "tex": "\\rho"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-ba929dd9ea7a6101c7cf",
          "costs-integer-b"
        ],
        "parameters": [
          "auto-parameter-7433dcdc316a8ed884e4"
        ],
        "assumptions": [
          "auto-assumption-21a73d25dd3d19517ff3"
        ],
        "detail": [
          "auto-detail-75079e65b7958e1a3ca5"
        ],
        "covered": [
          "auto-assumption-21a73d25dd3d19517ff3",
          "auto-detail-75079e65b7958e1a3ca5",
          "auto-graph-ba929dd9ea7a6101c7cf",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-750423ed7257675c4903",
          "auto-parameter-7433dcdc316a8ed884e4",
          "costs-integer-b",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "derived-gen-asw26-cover-det--mds-to-local-covering",
      "problem": "Dominating set",
      "variant": "Source algorithm: Integral local cover; bounded costs",
      "objective": "min",
      "graphClass": "Every minor H satisfies |E(H)| ≤ ρ|V(H)|",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "Oρ,ᵦ,ε(log* n)",
      "roundClass": "logstar",
      "parameters": "Source result (gen-asw26-cover-det), evaluated on its transformed instance: Fixed rational ρ ≥ 1, integer b ≥ 1 and ε > 0. Each candidate vertex has a positive integer cost at most b.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (gen-asw26-cover-det), evaluated on its transformed instance: Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs. Feasible locally known candidates C(r) ⊆ N[r]; costs in {1,…,b}. Common polynomial upper bound on IDs known.\n\nClosed-neighborhood requests: Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags. Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination.",
      "paperId": "gen-asw26",
      "theorem": "Theorem D(ii); derived via mds-to-local-covering",
      "summary": "Derived upper bound via Closed-neighborhood requests. Original source: ",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "prerequisite": "Known common polynomial ID bound",
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "Oρ,ᵦ,ε(log* n)",
      "weightCondition": "costs-integer-b",
      "sourceVariant": "Integral local cover; bounded costs",
      "sourceVerification": "primary",
      "sourceResultId": "gen-asw26-cover-det",
      "parentResultId": "gen-asw26-cover-det",
      "sourceProblem": "Integral local covering",
      "sourceGraphClass": "Every minor H satisfies |E(H)| ≤ ρ|V(H)|",
      "sourceMath": {
        "rounds": "Oρ,ᵦ,ε(log* n)",
        "roundsDisplay": "Oρ,ᵦ,ε(log* n)",
        "roundsTex": "O_{\\rho,b,\\varepsilon}(\\log^*n)",
        "roundsDisplayTex": "O_{\\rho,b,\\varepsilon}(\\log^*n)",
        "approximation": "1 + ε",
        "approximationDisplay": "1 + ε",
        "approximationTex": "1 + \\varepsilon",
        "approximationDisplayTex": "1 + \\varepsilon",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "mds-to-local-covering"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "mds-to-local-covering",
          "title": "Closed-neighborhood requests",
          "inputResultId": "gen-asw26-cover-det",
          "outputProblem": "dominating-set",
          "outputGraph": "minor",
          "from": "dominating-set",
          "to": "local-covering",
          "direction": "upper",
          "substitutions": {},
          "cost": "T",
          "factor": "identity",
          "conditions": [
            "Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags.",
            "Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved.",
            "The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required.",
            "T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated."
          ],
          "assumptions": [
            "Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination."
          ],
          "source": {
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "location": "Section 6.6; Appendix D"
          },
          "modelConversion": null
        }
      ],
      "derivedMath": {
        "rounds": "O_{\\rho,b,\\varepsilon}(\\log^*n)",
        "approximation": "1 + \\varepsilon"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Oρ,ᵦ,ε(log* n)",
        "tex": "O_{\\rho,b,\\varepsilon}(\\log^*n)",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Closed-neighborhood requests.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057",
            "title": "Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts",
            "location": "Theorem D(ii)"
          },
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "location": "Section 6.6; Appendix D"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "gen-asw26-cover-det"
      },
      "frontierStatus": "unreviewed",
      "sotaProjections": [
        {
          "resultId": "gen-asw26-cover-det",
          "graph": "planar",
          "problem": "dominating-set",
          "scopeLabel": "Planar MDS · log-star",
          "setting": "Planar unweighted MDS; instantiate local covering with requests V, C(v)=N[v], unit costs and minor-density bound ρ=3. Deterministic broadcast CONGEST gives ratio 1+ε in the stated parameter-dependent log-star bound, with the known common polynomial ID bound.",
          "reason": "Theorem D(ii) supplies this specialization. Proposition C.1 makes the dependence on n optimal already on cycles. Full accuracy dependence and the supplied ID-bound convention remain part of the tradeoff.",
          "evidenceUrl": "https://arxiv.org/pdf/2611.02057#page=51",
          "checked": "2026-11-16",
          "sourceResultId": "gen-asw26-cover-det",
          "conditionIds": [
            "parameter-epsilon-quarter"
          ],
          "claimConditionIds": [
            "parameter-epsilon-quarter"
          ],
          "settingConditionIds": [
            "binding-rho-three",
            "binding-unit-costs",
            "binding-closed-neighborhood-requests"
          ]
        }
      ],
      "constantApproximation": false,
      "tightness": [
        {
          "certificateId": "dominating-logstar-rounds",
          "resultId": "derived-gen-asw26-cover-det--mds-to-local-covering",
          "graphs": [
            "minor",
            "planar",
            "outerplanar",
            "euler",
            "orientable",
            "cycle"
          ],
          "problems": [
            "dominating-set"
          ],
          "models": [
            "CONGEST",
            "LOCAL"
          ],
          "conditionIds": [
            "scope-rounds-n-rho-b-epsilon",
            "parameter-epsilon-quarter"
          ]
        }
      ],
      "parameterDefinitions": [
        {
          "symbol": "C(r)",
          "description": "Candidate vertices permitted to cover request r",
          "tex": "C(r)"
        },
        {
          "symbol": "C",
          "description": "Locally known candidate sets for the requests",
          "tex": "C"
        },
        {
          "symbol": "G",
          "description": "Input graph",
          "tex": "G"
        },
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "b",
          "description": "Upper bound on the positive integer cost of each candidate vertex",
          "tex": "b"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Request vertex of the local covering instance",
          "tex": "r"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        },
        {
          "symbol": "ρ",
          "description": "Fixed rational upper bound on |E(H)|/|V(H)| for every minor H",
          "tex": "\\rho"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-ba929dd9ea7a6101c7cf",
          "costs-integer-b",
          "input-common-polynomial-id-bound"
        ],
        "parameters": [
          "auto-parameter-85cc282370b1fcb04d28"
        ],
        "assumptions": [
          "auto-assumption-467e3336a379ac78880d"
        ],
        "detail": [
          "auto-detail-75079e65b7958e1a3ca5"
        ],
        "covered": [
          "auto-assumption-467e3336a379ac78880d",
          "auto-detail-75079e65b7958e1a3ca5",
          "auto-graph-ba929dd9ea7a6101c7cf",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-85cc282370b1fcb04d28",
          "costs-integer-b",
          "input-common-polynomial-id-bound",
          "parameter-epsilon-positive",
          "parameter-fixed-epsilon",
          "parameter-fixed-rho-b-epsilon",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "derived-gen-asw26-cover-det--total-domination-to-local-covering",
      "problem": "Total dominating set",
      "variant": "Source algorithm: Integral local cover; bounded costs",
      "objective": "min",
      "graphClass": "Every minor H satisfies |E(H)| ≤ ρ|V(H)|",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "Oρ,ᵦ,ε(log* n)",
      "roundClass": "logstar",
      "parameters": "Source result (gen-asw26-cover-det), evaluated on its transformed instance: Fixed rational ρ ≥ 1, integer b ≥ 1 and ε > 0. Each candidate vertex has a positive integer cost at most b.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (gen-asw26-cover-det), evaluated on its transformed instance: Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs. Feasible locally known candidates C(r) ⊆ N[r]; costs in {1,…,b}. Common polynomial upper bound on IDs known.\n\nOpen-neighborhood requests: Make every vertex a request and put C(v)=N(v), excluding self-coverage. These incidence flags are locally known from the input edges. The input must have no isolated vertices. Use unit costs for the unweighted problem; retain cost restrictions in weighted instances. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate requests V and candidate sets C(v)=N(v); the input has no isolated vertices.",
      "paperId": "gen-asw26",
      "theorem": "Theorem D(ii); derived via total-domination-to-local-covering",
      "summary": "Derived upper bound via Open-neighborhood requests. Original source: ",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "total-dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "prerequisite": "Known common polynomial ID bound",
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "Oρ,ᵦ,ε(log* n)",
      "weightCondition": "costs-integer-b",
      "sourceVariant": "Integral local cover; bounded costs",
      "sourceVerification": "primary",
      "sourceResultId": "gen-asw26-cover-det",
      "parentResultId": "gen-asw26-cover-det",
      "sourceProblem": "Integral local covering",
      "sourceGraphClass": "Every minor H satisfies |E(H)| ≤ ρ|V(H)|",
      "sourceMath": {
        "rounds": "Oρ,ᵦ,ε(log* n)",
        "roundsDisplay": "Oρ,ᵦ,ε(log* n)",
        "roundsTex": "O_{\\rho,b,\\varepsilon}(\\log^*n)",
        "roundsDisplayTex": "O_{\\rho,b,\\varepsilon}(\\log^*n)",
        "approximation": "1 + ε",
        "approximationDisplay": "1 + ε",
        "approximationTex": "1 + \\varepsilon",
        "approximationDisplayTex": "1 + \\varepsilon",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "total-domination-to-local-covering"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "total-domination-to-local-covering",
          "title": "Open-neighborhood requests",
          "inputResultId": "gen-asw26-cover-det",
          "outputProblem": "total-dominating-set",
          "outputGraph": "minor",
          "from": "total-dominating-set",
          "to": "local-covering",
          "direction": "upper",
          "substitutions": {},
          "cost": "T",
          "factor": "identity",
          "conditions": [
            "Make every vertex a request and put C(v)=N(v), excluding self-coverage. These incidence flags are locally known from the input edges.",
            "The input must have no isolated vertices. Use unit costs for the unweighted problem; retain cost restrictions in weighted instances.",
            "The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required.",
            "T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated."
          ],
          "assumptions": [
            "Instantiate requests V and candidate sets C(v)=N(v); the input has no isolated vertices."
          ],
          "source": {
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "location": "Section 6.6; Appendix D"
          },
          "modelConversion": null
        }
      ],
      "derivedMath": {
        "rounds": "O_{\\rho,b,\\varepsilon}(\\log^*n)",
        "approximation": "1 + \\varepsilon"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Oρ,ᵦ,ε(log* n)",
        "tex": "O_{\\rho,b,\\varepsilon}(\\log^*n)",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Open-neighborhood requests.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057",
            "title": "Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts",
            "location": "Theorem D(ii)"
          },
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "location": "Section 6.6; Appendix D"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "gen-asw26-cover-det"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "C(r)",
          "description": "Candidate vertices permitted to cover request r",
          "tex": "C(r)"
        },
        {
          "symbol": "C",
          "description": "Locally known candidate sets for the requests",
          "tex": "C"
        },
        {
          "symbol": "G",
          "description": "Input graph",
          "tex": "G"
        },
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "b",
          "description": "Upper bound on the positive integer cost of each candidate vertex",
          "tex": "b"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Request vertex of the local covering instance",
          "tex": "r"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        },
        {
          "symbol": "ρ",
          "description": "Fixed rational upper bound on |E(H)|/|V(H)| for every minor H",
          "tex": "\\rho"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-ba929dd9ea7a6101c7cf",
          "costs-integer-b",
          "input-common-polynomial-id-bound"
        ],
        "parameters": [
          "auto-parameter-85cc282370b1fcb04d28"
        ],
        "assumptions": [
          "auto-assumption-11c60a7cecfb4bc3688a"
        ],
        "detail": [
          "auto-detail-75079e65b7958e1a3ca5"
        ],
        "covered": [
          "auto-assumption-11c60a7cecfb4bc3688a",
          "auto-detail-75079e65b7958e1a3ca5",
          "auto-graph-ba929dd9ea7a6101c7cf",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-f7056f83774cd9f78096",
          "auto-parameter-85cc282370b1fcb04d28",
          "costs-integer-b",
          "input-common-polynomial-id-bound",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "derived-gen-asw26-cover-det--client-domination-to-local-covering",
      "problem": "Client dominating set",
      "variant": "Source algorithm: Integral local cover; bounded costs",
      "objective": "min",
      "graphClass": "Every minor H satisfies |E(H)| ≤ ρ|V(H)|",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "(Oρ,ᵦ,ε(log* n)) + 1",
      "roundClass": "logstar",
      "parameters": "Source result (gen-asw26-cover-det), evaluated on its transformed instance: Fixed rational ρ ≥ 1, integer b ≥ 1 and ε > 0. Each candidate vertex has a positive integer cost at most b.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (gen-asw26-cover-det), evaluated on its transformed instance: Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs. Feasible locally known candidates C(r) ⊆ N[r]; costs in {1,…,b}. Common polynomial upper bound on IDs known.\n\nPrescribed client requests: Use the client set R as the requests and put C(r)=N[r]. Each client initially knows its own membership in R. One setup round broadcasts client membership so both endpoints know request–candidate incidences. If these incidence flags are already supplied, the setup round can be omitted. Preserve any preprocessing allowed by SUPPORTED and every other source input convention. Upper-bound examples include this one-round setup. A client lower bound would shift by one round under this convention; unchanged exact lower-bound import is therefore disabled. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate the client requests R and C(r)=N[r]. One setup round advertises membership in R, unless those incidence flags are initially supplied.",
      "paperId": "gen-asw26",
      "theorem": "Theorem D(ii); derived via client-domination-to-local-covering",
      "summary": "Derived upper bound via Prescribed client requests. Original source: ",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "client-dominating-set"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "prerequisite": "Known common polynomial ID bound",
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "(Oρ,ᵦ,ε(log* n)) + 1",
      "weightCondition": "costs-integer-b",
      "sourceVariant": "Integral local cover; bounded costs",
      "sourceVerification": "primary",
      "sourceResultId": "gen-asw26-cover-det",
      "parentResultId": "gen-asw26-cover-det",
      "sourceProblem": "Integral local covering",
      "sourceGraphClass": "Every minor H satisfies |E(H)| ≤ ρ|V(H)|",
      "sourceMath": {
        "rounds": "Oρ,ᵦ,ε(log* n)",
        "roundsDisplay": "Oρ,ᵦ,ε(log* n)",
        "roundsTex": "O_{\\rho,b,\\varepsilon}(\\log^*n)",
        "roundsDisplayTex": "O_{\\rho,b,\\varepsilon}(\\log^*n)",
        "approximation": "1 + ε",
        "approximationDisplay": "1 + ε",
        "approximationTex": "1 + \\varepsilon",
        "approximationDisplayTex": "1 + \\varepsilon",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "client-domination-to-local-covering"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "client-domination-to-local-covering",
          "title": "Prescribed client requests",
          "inputResultId": "gen-asw26-cover-det",
          "outputProblem": "client-dominating-set",
          "outputGraph": "minor",
          "from": "client-dominating-set",
          "to": "local-covering",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+1",
          "factor": "identity",
          "conditions": [
            "Use the client set R as the requests and put C(r)=N[r]. Each client initially knows its own membership in R.",
            "One setup round broadcasts client membership so both endpoints know request–candidate incidences. If these incidence flags are already supplied, the setup round can be omitted.",
            "Preserve any preprocessing allowed by SUPPORTED and every other source input convention.",
            "Upper-bound examples include this one-round setup. A client lower bound would shift by one round under this convention; unchanged exact lower-bound import is therefore disabled.",
            "The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required.",
            "T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated."
          ],
          "assumptions": [
            "Instantiate the client requests R and C(r)=N[r]. One setup round advertises membership in R, unless those incidence flags are initially supplied."
          ],
          "source": {
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "location": "Section 6.6; Appendix D"
          },
          "modelConversion": null
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(O_{\\rho,b,\\varepsilon}(\\log^*n)\\bigr)+1",
        "approximation": "1 + \\varepsilon"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "(Oρ,ᵦ,ε(log* n)) + 1",
        "tex": "\\bigl(O_{\\rho,b,\\varepsilon}(\\log^*n)\\bigr)+1",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Prescribed client requests.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057",
            "title": "Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts",
            "location": "Theorem D(ii)"
          },
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "location": "Section 6.6; Appendix D"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "gen-asw26-cover-det"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "C(r)",
          "description": "Candidate vertices permitted to cover request r",
          "tex": "C(r)"
        },
        {
          "symbol": "C",
          "description": "Locally known candidate sets for the requests",
          "tex": "C"
        },
        {
          "symbol": "G",
          "description": "Input graph",
          "tex": "G"
        },
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "b",
          "description": "Upper bound on the positive integer cost of each candidate vertex",
          "tex": "b"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Request vertex of the local covering instance",
          "tex": "r"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        },
        {
          "symbol": "ρ",
          "description": "Fixed rational upper bound on |E(H)|/|V(H)| for every minor H",
          "tex": "\\rho"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-ba929dd9ea7a6101c7cf",
          "costs-integer-b",
          "input-common-polynomial-id-bound"
        ],
        "parameters": [
          "auto-parameter-85cc282370b1fcb04d28"
        ],
        "assumptions": [
          "auto-assumption-a60624ad6fd3cedf37f3"
        ],
        "detail": [
          "auto-detail-75079e65b7958e1a3ca5"
        ],
        "covered": [
          "auto-assumption-a60624ad6fd3cedf37f3",
          "auto-detail-75079e65b7958e1a3ca5",
          "auto-graph-ba929dd9ea7a6101c7cf",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-750423ed7257675c4903",
          "auto-parameter-85cc282370b1fcb04d28",
          "costs-integer-b",
          "input-common-polynomial-id-bound",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "derived-gen-asw26-cycle-lower--mds-to-local-covering",
      "problem": "Integral local covering",
      "variant": "Source algorithm: Unweighted",
      "objective": "min",
      "graphClass": "Cycles",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "approximation": "1 + ε",
      "rounds": "Ω(log* n)",
      "roundClass": "logstar",
      "parameters": "Source result (gen-asw26-cycle-lower), evaluated on its transformed instance: Fixed 0 < ε < 1/4.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (gen-asw26-cycle-lower), evaluated on its transformed instance: Deterministic; even with known n and IDs {1,…,n}.\n\nClosed-neighborhood requests: Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags. Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination.",
      "paperId": "gen-asw26",
      "theorem": "Proposition C.1; derived via mds-to-local-covering",
      "summary": "Derived lower bound via Closed-neighborhood requests. Original source: ",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/pdf/2611.02057",
      "year": 2026,
      "problemScope": {
        "node": "local-covering"
      },
      "graphScope": {
        "node": "cycle"
      },
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "Ω(log* n)",
      "weightCondition": "weights-unweighted",
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "gen-asw26-cycle-lower",
      "parentResultId": "gen-asw26-cycle-lower",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Cycles",
      "sourceMath": {
        "rounds": "Ω(log* n)",
        "roundsDisplay": "Ω(log* n)",
        "roundsTex": "\\Omega (\\log^* n)",
        "roundsDisplayTex": "\\Omega (\\log^* n)",
        "approximation": "1 + ε",
        "approximationDisplay": "1 + ε",
        "approximationTex": "1 + \\varepsilon",
        "approximationDisplayTex": "1 + \\varepsilon",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "mds-to-local-covering"
      ],
      "reductionDirection": "lower",
      "reductionSteps": [
        {
          "id": "mds-to-local-covering",
          "title": "Closed-neighborhood requests",
          "inputResultId": "gen-asw26-cycle-lower",
          "outputProblem": "local-covering",
          "outputGraph": "cycle",
          "from": "dominating-set",
          "to": "local-covering",
          "direction": "lower",
          "substitutions": {},
          "cost": "T",
          "factor": "identity",
          "conditions": [
            "Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags.",
            "Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved.",
            "The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required.",
            "T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated."
          ],
          "assumptions": [
            "Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination."
          ],
          "source": {
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "location": "Section 6.6; Appendix D"
          },
          "modelConversion": null
        }
      ],
      "derivedMath": {
        "rounds": "\\Omega (\\log^* n)",
        "approximation": "1 + \\varepsilon"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Ω(log* n)",
        "tex": "\\Omega (\\log^* n)",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Closed-neighborhood requests.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2611.02057",
            "title": "Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts",
            "location": "Proposition C.1"
          },
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "location": "Section 6.6; Appendix D"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "gen-asw26-cycle-lower"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-581d3bad24d9045aad04",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-55c8948d452b244605bd"
        ],
        "assumptions": [
          "auto-assumption-f568bf7844ef58527c79"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-f568bf7844ef58527c79",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-581d3bad24d9045aad04",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-d13f16e4e51c9b55f160",
          "auto-parameter-55c8948d452b244605bd",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-gen-low24-cover--fractional-domination-to-covering-lp",
      "problem": "Fractional dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "2 · (O((Δ+1) · log (Δ+1) / ε²))",
      "roundClass": "degree",
      "parameters": "Source result (gen-low24-cover), evaluated on its transformed instance: Γₚ = max column sum, Γd = max row sum of normalized A; ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.\n\nClosed-neighborhood covering matrix: exact instance substitutions n=2n, Δ=Δ+1, Γd=Δ+1, Γₚ=Δ+1, Γp=Δ+1, Amax=1, m=n+2m.",
      "assumptions": "Source result (gen-low24-cover), evaluated on its transformed instance: Communication graph is variable–constraint incidence graph. Normalized nonzero Aᵢⱼ ≥ 1; coefficient sizes follow the paper’s CONGEST encoding.\n\nClosed-neighborhood covering matrix: Use A_uv=1 when u belongs to N[v], and zero otherwise, with one covering constraint per original vertex. Variables remain fractional. Host variable and constraint copies at each real vertex and simulate a virtual round in two role phases. The objective is preserved after any required cost normalization. The source algorithm’s coefficient, precision, normalization and initial-information assumptions must hold; these are not consequences of graph inclusion. In the unweighted 0–1 instance, maximum row and column sums are both Δ+1. Planarity of G does not imply planarity of this incidence graph. The transformed closed-neighborhood incidence graph has exactly n+2m edges: n self-incidences and two incidences for every original edge. Use the unweighted 0–1 closed-neighborhood covering matrix, with Γd=Γp=Δ+1; retain fractional output. Source normalized-coefficient, precision, bit-encoding and supplied-parameter assumptions remain.",
      "paperId": "gen-low24",
      "theorem": "Theorem 2.1; derived via fractional-domination-to-covering-lp",
      "summary": "Derived upper bound via Closed-neighborhood covering matrix. Original source: Simultaneously computes a feasible primal and dual approximation.",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/html/2409.16168v1",
      "year": 2024,
      "problemScope": {
        "node": "fractional-dominating-set"
      },
      "graphScope": {
        "node": "general"
      },
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "2 · (O((Δ+1) · log (Δ+1) / ε²))",
      "approximationBenchmark": "fractional",
      "weightCondition": "weights-unweighted",
      "sourceVariant": "Fractional positive LP",
      "sourceVerification": "primary",
      "sourceResultId": "gen-low24-cover",
      "parentResultId": "gen-low24-cover",
      "sourceProblem": "Fractional covering LP",
      "sourceGraphClass": "Incidence graphs",
      "sourceMath": {
        "rounds": "O(Γd · log Γₚ / ε²)",
        "roundsDisplay": "O(Γd · log Γₚ / ε²)",
        "roundsTex": "O\\!\\left(\\frac{\\Gamma_d\\,\\log\\Gamma_p}{\\varepsilon^2}\\right)",
        "roundsDisplayTex": "O\\!\\left(\\frac{\\Gamma_d\\,\\log\\Gamma_p}{\\varepsilon^2}\\right)",
        "approximation": "1 + ε",
        "approximationDisplay": "1 + ε",
        "approximationTex": "1 + \\varepsilon",
        "approximationDisplayTex": "1 + \\varepsilon",
        "approximationBenchmark": "fractional"
      },
      "reductionPath": [
        "fractional-domination-to-covering-lp"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "fractional-domination-to-covering-lp",
          "title": "Closed-neighborhood covering matrix",
          "inputResultId": "gen-low24-cover",
          "outputProblem": "fractional-dominating-set",
          "outputGraph": "general",
          "from": "fractional-dominating-set",
          "to": "covering-lp",
          "direction": "upper",
          "substitutions": {
            "n": "2n",
            "Δ": "Δ+1",
            "Γd": "Δ+1",
            "Γₚ": "Δ+1",
            "Γp": "Δ+1",
            "Amax": "1",
            "m": "n+2m"
          },
          "cost": "2T",
          "factor": "identity",
          "conditions": [
            "Use A_uv=1 when u belongs to N[v], and zero otherwise, with one covering constraint per original vertex. Variables remain fractional.",
            "Host variable and constraint copies at each real vertex and simulate a virtual round in two role phases. The objective is preserved after any required cost normalization.",
            "The source algorithm’s coefficient, precision, normalization and initial-information assumptions must hold; these are not consequences of graph inclusion.",
            "In the unweighted 0–1 instance, maximum row and column sums are both Δ+1. Planarity of G does not imply planarity of this incidence graph.",
            "The transformed closed-neighborhood incidence graph has exactly n+2m edges: n self-incidences and two incidences for every original edge."
          ],
          "assumptions": [
            "Use the unweighted 0–1 closed-neighborhood covering matrix, with Γd=Γp=Δ+1; retain fractional output.",
            "Source normalized-coefficient, precision, bit-encoding and supplied-parameter assumptions remain."
          ],
          "source": {
            "title": "Li, Ouyang and Wang, A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems",
            "url": "https://arxiv.org/html/2409.16168v1#S1",
            "location": "Section 1 (positive LPs and incidence communication); Theorem 2.1"
          },
          "modelConversion": null
        }
      ],
      "derivedMath": {
        "rounds": "2\\cdot\\bigl(O\\!\\left(\\frac{\\left(\\Delta+1\\right)\\,\\log\\left(\\Delta+1\\right)}{\\varepsilon^2}\\right)\\bigr)",
        "approximation": "1 + \\varepsilon"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "2 · (O((Δ+1) · log (Δ+1) / ε²))",
        "tex": "2\\cdot\\bigl(O\\!\\left(\\frac{\\left(\\Delta+1\\right)\\,\\log\\left(\\Delta+1\\right)}{\\varepsilon^2}\\right)\\bigr)",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Closed-neighborhood covering matrix.",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2409.16168v1",
            "title": "A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems",
            "location": "Theorem 2.1"
          },
          {
            "url": "https://arxiv.org/html/2409.16168v1#S1",
            "title": "Li, Ouyang and Wang, A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems",
            "location": "Section 1 (positive LPs and incidence communication); Theorem 2.1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "gen-low24-cover"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "Aᵢⱼ",
          "description": "Coefficient in row i and column j of the normalized constraint matrix",
          "tex": "A_{ij}"
        },
        {
          "symbol": "Γd",
          "description": "Maximum row sum of the normalized constraint matrix A",
          "tex": "\\Gamma_d"
        },
        {
          "symbol": "Γₚ",
          "description": "Maximum column sum of the normalized constraint matrix A",
          "tex": "\\Gamma_p"
        },
        {
          "symbol": "A",
          "description": "Normalized constraint matrix, whose nonzero coefficients are at least one",
          "tex": "A"
        },
        {
          "symbol": "i",
          "description": "Row index of the normalized constraint matrix",
          "tex": "i"
        },
        {
          "symbol": "j",
          "description": "Column index of the normalized constraint matrix",
          "tex": "j"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-5dccb1a902150379e010"
        ],
        "assumptions": [
          "auto-assumption-308ad576c101fb4cb941"
        ],
        "detail": [
          "auto-detail-936b7cf395abca76c67d"
        ],
        "covered": [
          "auto-assumption-308ad576c101fb4cb941",
          "auto-detail-936b7cf395abca76c67d",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-19e536b10b8d7f071a79",
          "auto-parameter-5dccb1a902150379e010",
          "detail-fractional-benchmark",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-gen-low24-cover--fractional-vertex-cover-to-covering-lp",
      "problem": "Fractional vertex cover",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 + ε",
      "rounds": "(O(2 · log Δ / ε²)) + 1",
      "roundClass": "degree",
      "parameters": "Source result (gen-low24-cover), evaluated on its transformed instance: Γₚ = max column sum, Γd = max row sum of normalized A; ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.\n\nEdge constraints: exact instance substitutions n=n+m, Δ=max{Δ,2}, Γd=2, Γₚ=Δ, Γp=Δ, Amax=1, m=2m.",
      "assumptions": "Source result (gen-low24-cover), evaluated on its transformed instance: Communication graph is variable–constraint incidence graph. Normalized nonzero Aᵢⱼ ≥ 1; coefficient sizes follow the paper’s CONGEST encoding.\n\nEdge constraints: Use one variable x_v per vertex and the inequality x_u+x_v≥1 for every edge uv. The positive objective uses the original vertex costs. Use identifier-based edge-processor ownership with at most one setup round, as in the vertex-cover incidence simulation. Any extra global algorithm input must be supplied separately. For unit costs, each row has sum two and each column has sum at most Δ. Weighted normalization must meet the chosen LP algorithm’s coefficient and encoding requirements. The output is fractional. Integral vertex cover requires a separate rounding step, such as the threshold recipe. The displayed maximum degree max{Δ,2} applies when G has at least one edge. An edgeless instance is handled locally with the empty output; it is not passed to the incidence algorithm. The edge-subdivision incidence graph has exactly 2m edges, with two incidences for each original edge. Use the unweighted 0–1 matrix A with one row per edge and one column per vertex; Γd=2 and Γp≤Δ. One identifier-exchange setup round assigns edge-constraint processors; preserve the source normalization, precision, encoding and global-input assumptions. For the simulated algorithm, G has at least one edge. Edgeless instances have an empty optimal output handled locally.",
      "paperId": "gen-low24",
      "theorem": "Theorem 2.1; derived via fractional-vertex-cover-to-covering-lp",
      "summary": "Derived upper bound via Edge constraints. Original source: Simultaneously computes a feasible primal and dual approximation.",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/html/2409.16168v1",
      "year": 2024,
      "problemScope": {
        "node": "fractional-vertex-cover"
      },
      "graphScope": {
        "node": "general"
      },
      "approximationDisplay": "1 + ε",
      "roundsDisplay": "(O(2 · log Δ / ε²)) + 1",
      "approximationBenchmark": "fractional",
      "weightCondition": "weights-unweighted",
      "sourceVariant": "Fractional positive LP",
      "sourceVerification": "primary",
      "sourceResultId": "gen-low24-cover",
      "parentResultId": "gen-low24-cover",
      "sourceProblem": "Fractional covering LP",
      "sourceGraphClass": "Incidence graphs",
      "sourceMath": {
        "rounds": "O(Γd · log Γₚ / ε²)",
        "roundsDisplay": "O(Γd · log Γₚ / ε²)",
        "roundsTex": "O\\!\\left(\\frac{\\Gamma_d\\,\\log\\Gamma_p}{\\varepsilon^2}\\right)",
        "roundsDisplayTex": "O\\!\\left(\\frac{\\Gamma_d\\,\\log\\Gamma_p}{\\varepsilon^2}\\right)",
        "approximation": "1 + ε",
        "approximationDisplay": "1 + ε",
        "approximationTex": "1 + \\varepsilon",
        "approximationDisplayTex": "1 + \\varepsilon",
        "approximationBenchmark": "fractional"
      },
      "reductionPath": [
        "fractional-vertex-cover-to-covering-lp"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "fractional-vertex-cover-to-covering-lp",
          "title": "Edge constraints",
          "inputResultId": "gen-low24-cover",
          "outputProblem": "fractional-vertex-cover",
          "outputGraph": "general",
          "from": "fractional-vertex-cover",
          "to": "covering-lp",
          "direction": "upper",
          "substitutions": {
            "n": "n+m",
            "Δ": "max{Δ,2}",
            "Γd": "2",
            "Γₚ": "Δ",
            "Γp": "Δ",
            "Amax": "1",
            "m": "2m"
          },
          "cost": "T+1",
          "factor": "identity",
          "conditions": [
            "Use one variable x_v per vertex and the inequality x_u+x_v≥1 for every edge uv. The positive objective uses the original vertex costs.",
            "Use identifier-based edge-processor ownership with at most one setup round, as in the vertex-cover incidence simulation. Any extra global algorithm input must be supplied separately.",
            "For unit costs, each row has sum two and each column has sum at most Δ. Weighted normalization must meet the chosen LP algorithm’s coefficient and encoding requirements.",
            "The output is fractional. Integral vertex cover requires a separate rounding step, such as the threshold recipe.",
            "The displayed maximum degree max{Δ,2} applies when G has at least one edge. An edgeless instance is handled locally with the empty output; it is not passed to the incidence algorithm.",
            "The edge-subdivision incidence graph has exactly 2m edges, with two incidences for each original edge."
          ],
          "assumptions": [
            "Use the unweighted 0–1 matrix A with one row per edge and one column per vertex; Γd=2 and Γp≤Δ.",
            "One identifier-exchange setup round assigns edge-constraint processors; preserve the source normalization, precision, encoding and global-input assumptions.",
            "For the simulated algorithm, G has at least one edge. Edgeless instances have an empty optimal output handled locally."
          ],
          "source": {
            "title": "Li, Ouyang and Wang, A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems",
            "url": "https://arxiv.org/html/2409.16168v1#S1",
            "location": "Section 1 (positive LPs and incidence communication); Theorem 2.1"
          },
          "modelConversion": null
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(O\\!\\left(\\frac{2\\,\\log\\Delta}{\\varepsilon^2}\\right)\\bigr)+1",
        "approximation": "1 + \\varepsilon"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "(O(2 · log Δ / ε²)) + 1",
        "tex": "\\bigl(O\\!\\left(\\frac{2\\,\\log\\Delta}{\\varepsilon^2}\\right)\\bigr)+1",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Edge constraints.",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2409.16168v1",
            "title": "A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems",
            "location": "Theorem 2.1"
          },
          {
            "url": "https://arxiv.org/html/2409.16168v1#S1",
            "title": "Li, Ouyang and Wang, A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems",
            "location": "Section 1 (positive LPs and incidence communication); Theorem 2.1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "gen-low24-cover"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "Aᵢⱼ",
          "description": "Coefficient in row i and column j of the normalized constraint matrix",
          "tex": "A_{ij}"
        },
        {
          "symbol": "Γd",
          "description": "Maximum row sum of the normalized constraint matrix A",
          "tex": "\\Gamma_d"
        },
        {
          "symbol": "Γₚ",
          "description": "Maximum column sum of the normalized constraint matrix A",
          "tex": "\\Gamma_p"
        },
        {
          "symbol": "A",
          "description": "Normalized constraint matrix, whose nonzero coefficients are at least one",
          "tex": "A"
        },
        {
          "symbol": "i",
          "description": "Row index of the normalized constraint matrix",
          "tex": "i"
        },
        {
          "symbol": "j",
          "description": "Column index of the normalized constraint matrix",
          "tex": "j"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-35f5fdb6626e97dacfef"
        ],
        "assumptions": [
          "auto-assumption-9f5a3496ba688047c763"
        ],
        "detail": [
          "auto-detail-936b7cf395abca76c67d"
        ],
        "covered": [
          "auto-assumption-9f5a3496ba688047c763",
          "auto-detail-936b7cf395abca76c67d",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-498ca814bcbfb2d5db15",
          "auto-parameter-35f5fdb6626e97dacfef",
          "detail-fractional-benchmark",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-gen-low24-cover--vertex-cover-to-fractional-cover-rounding--fractional-vertex-cover-to-covering-lp",
      "problem": "Vertex cover",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "2 · (1 + ε)",
      "rounds": "(O(2 · log Δ / ε²)) + 1",
      "roundClass": "degree",
      "parameters": "Source result (gen-low24-cover), evaluated on its transformed instance: Γₚ = max column sum, Γd = max row sum of normalized A; ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.\n\nEdge constraints: exact instance substitutions n=n+m, Δ=max{Δ,2}, Γd=2, Γₚ=Δ, Γp=Δ, Amax=1, m=2m.",
      "assumptions": "Source result (gen-low24-cover), evaluated on its transformed instance: Communication graph is variable–constraint incidence graph. Normalized nonzero Aᵢⱼ ≥ 1; coefficient sizes follow the paper’s CONGEST encoding.\n\nThreshold at one half: The algorithm returns a feasible fractional vertex cover x on the original graph, and each vertex knows its own coordinate. Let D contain exactly the vertices with x_v≥1/2. Every edge has an endpoint in D because x_u+x_v≥1. For nonnegative vertex costs, cost(D) is at most twice the fractional solution cost, hence at most 2α times integral OPT. Thresholding is local and needs no extra communication. If the fractional algorithm runs on a separate incidence network, its simulation cost must be added before using this recipe. This recipe changes the factor from α to 2α and is therefore separate from the unrounded relaxation link; it is not an approximation-preserving automatic import. The source provides a feasible fractional vertex cover on the physical input graph, with x_v locally known. Select v exactly when x_v≥1/2. This local operation multiplies a minimization approximation factor by two and preserves the source weight assumptions.\n\nEdge constraints: Use one variable x_v per vertex and the inequality x_u+x_v≥1 for every edge uv. The positive objective uses the original vertex costs. Use identifier-based edge-processor ownership with at most one setup round, as in the vertex-cover incidence simulation. Any extra global algorithm input must be supplied separately. For unit costs, each row has sum two and each column has sum at most Δ. Weighted normalization must meet the chosen LP algorithm’s coefficient and encoding requirements. The output is fractional. Integral vertex cover requires a separate rounding step, such as the threshold recipe. The displayed maximum degree max{Δ,2} applies when G has at least one edge. An edgeless instance is handled locally with the empty output; it is not passed to the incidence algorithm. The edge-subdivision incidence graph has exactly 2m edges, with two incidences for each original edge. Use the unweighted 0–1 matrix A with one row per edge and one column per vertex; Γd=2 and Γp≤Δ. One identifier-exchange setup round assigns edge-constraint processors; preserve the source normalization, precision, encoding and global-input assumptions. For the simulated algorithm, G has at least one edge. Edgeless instances have an empty optimal output handled locally.",
      "paperId": "gen-low24",
      "theorem": "Theorem 2.1; derived via vertex-cover-to-fractional-cover-rounding → fractional-vertex-cover-to-covering-lp",
      "summary": "Derived upper bound via Threshold at one half → Edge constraints. Original source: Simultaneously computes a feasible primal and dual approximation.",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/html/2409.16168v1",
      "year": 2024,
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "general"
      },
      "approximationDisplay": "2 · (1 + ε)",
      "roundsDisplay": "(O(2 · log Δ / ε²)) + 1",
      "approximationBenchmark": "fractional",
      "weightCondition": "weights-unweighted",
      "sourceVariant": "Fractional positive LP",
      "sourceVerification": "primary",
      "sourceResultId": "gen-low24-cover",
      "parentResultId": "derived-gen-low24-cover--fractional-vertex-cover-to-covering-lp",
      "sourceProblem": "Fractional covering LP",
      "sourceGraphClass": "Incidence graphs",
      "sourceMath": {
        "rounds": "O(Γd · log Γₚ / ε²)",
        "roundsDisplay": "O(Γd · log Γₚ / ε²)",
        "roundsTex": "O\\!\\left(\\frac{\\Gamma_d\\,\\log\\Gamma_p}{\\varepsilon^2}\\right)",
        "roundsDisplayTex": "O\\!\\left(\\frac{\\Gamma_d\\,\\log\\Gamma_p}{\\varepsilon^2}\\right)",
        "approximation": "1 + ε",
        "approximationDisplay": "1 + ε",
        "approximationTex": "1 + \\varepsilon",
        "approximationDisplayTex": "1 + \\varepsilon",
        "approximationBenchmark": "fractional"
      },
      "reductionPath": [
        "vertex-cover-to-fractional-cover-rounding",
        "fractional-vertex-cover-to-covering-lp"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "vertex-cover-to-fractional-cover-rounding",
          "title": "Threshold at one half",
          "inputResultId": "derived-gen-low24-cover--fractional-vertex-cover-to-covering-lp",
          "outputProblem": "vertex-cover",
          "outputGraph": "general",
          "from": "vertex-cover",
          "to": "fractional-vertex-cover",
          "direction": "upper",
          "substitutions": {},
          "cost": "T",
          "factor": "double",
          "conditions": [
            "The algorithm returns a feasible fractional vertex cover x on the original graph, and each vertex knows its own coordinate. Let D contain exactly the vertices with x_v≥1/2.",
            "Every edge has an endpoint in D because x_u+x_v≥1. For nonnegative vertex costs, cost(D) is at most twice the fractional solution cost, hence at most 2α times integral OPT.",
            "Thresholding is local and needs no extra communication. If the fractional algorithm runs on a separate incidence network, its simulation cost must be added before using this recipe.",
            "This recipe changes the factor from α to 2α and is therefore separate from the unrounded relaxation link; it is not an approximation-preserving automatic import."
          ],
          "assumptions": [
            "The source provides a feasible fractional vertex cover on the physical input graph, with x_v locally known. Select v exactly when x_v≥1/2.",
            "This local operation multiplies a minimization approximation factor by two and preserves the source weight assumptions."
          ],
          "source": {
            "title": "Kuhn, Moscibroda and Wattenhofer, Local Computation: Lower and Upper Bounds",
            "url": "https://disco.ethz.ch/courses/fs11/podc/readingAssignment/localComputationJACM.pdf#page=31",
            "location": "Section 5.1 (threshold rounding of fractional vertex cover)"
          },
          "modelConversion": null
        },
        {
          "id": "fractional-vertex-cover-to-covering-lp",
          "title": "Edge constraints",
          "inputResultId": "gen-low24-cover",
          "outputProblem": "fractional-vertex-cover",
          "outputGraph": "general",
          "from": "fractional-vertex-cover",
          "to": "covering-lp",
          "direction": "upper",
          "substitutions": {
            "n": "n+m",
            "Δ": "max{Δ,2}",
            "Γd": "2",
            "Γₚ": "Δ",
            "Γp": "Δ",
            "Amax": "1",
            "m": "2m"
          },
          "cost": "T+1",
          "factor": "identity",
          "conditions": [
            "Use one variable x_v per vertex and the inequality x_u+x_v≥1 for every edge uv. The positive objective uses the original vertex costs.",
            "Use identifier-based edge-processor ownership with at most one setup round, as in the vertex-cover incidence simulation. Any extra global algorithm input must be supplied separately.",
            "For unit costs, each row has sum two and each column has sum at most Δ. Weighted normalization must meet the chosen LP algorithm’s coefficient and encoding requirements.",
            "The output is fractional. Integral vertex cover requires a separate rounding step, such as the threshold recipe.",
            "The displayed maximum degree max{Δ,2} applies when G has at least one edge. An edgeless instance is handled locally with the empty output; it is not passed to the incidence algorithm.",
            "The edge-subdivision incidence graph has exactly 2m edges, with two incidences for each original edge."
          ],
          "assumptions": [
            "Use the unweighted 0–1 matrix A with one row per edge and one column per vertex; Γd=2 and Γp≤Δ.",
            "One identifier-exchange setup round assigns edge-constraint processors; preserve the source normalization, precision, encoding and global-input assumptions.",
            "For the simulated algorithm, G has at least one edge. Edgeless instances have an empty optimal output handled locally."
          ],
          "source": {
            "title": "Li, Ouyang and Wang, A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems",
            "url": "https://arxiv.org/html/2409.16168v1#S1",
            "location": "Section 1 (positive LPs and incidence communication); Theorem 2.1"
          },
          "modelConversion": null
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(O\\!\\left(\\frac{2\\,\\log\\Delta}{\\varepsilon^2}\\right)\\bigr)+1",
        "approximation": "2\\cdot\\bigl(1 + \\varepsilon\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "(O(2 · log Δ / ε²)) + 1",
        "tex": "\\bigl(O\\!\\left(\\frac{2\\,\\log\\Delta}{\\varepsilon^2}\\right)\\bigr)+1",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Edge constraints. The atlas applies the exact instance substitutions and communication cost of the reduction: Threshold at one half.",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2409.16168v1",
            "title": "A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems",
            "location": "Theorem 2.1"
          },
          {
            "url": "https://arxiv.org/html/2409.16168v1#S1",
            "title": "Li, Ouyang and Wang, A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems",
            "location": "Section 1 (positive LPs and incidence communication); Theorem 2.1"
          },
          {
            "url": "https://disco.ethz.ch/courses/fs11/podc/readingAssignment/localComputationJACM.pdf#page=31",
            "title": "Kuhn, Moscibroda and Wattenhofer, Local Computation: Lower and Upper Bounds",
            "location": "Section 5.1 (threshold rounding of fractional vertex cover)"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "derived-gen-low24-cover--fractional-vertex-cover-to-covering-lp"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "Aᵢⱼ",
          "description": "Coefficient in row i and column j of the normalized constraint matrix",
          "tex": "A_{ij}"
        },
        {
          "symbol": "Γd",
          "description": "Maximum row sum of the normalized constraint matrix A",
          "tex": "\\Gamma_d"
        },
        {
          "symbol": "Γₚ",
          "description": "Maximum column sum of the normalized constraint matrix A",
          "tex": "\\Gamma_p"
        },
        {
          "symbol": "A",
          "description": "Normalized constraint matrix, whose nonzero coefficients are at least one",
          "tex": "A"
        },
        {
          "symbol": "i",
          "description": "Row index of the normalized constraint matrix",
          "tex": "i"
        },
        {
          "symbol": "j",
          "description": "Column index of the normalized constraint matrix",
          "tex": "j"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-35f5fdb6626e97dacfef"
        ],
        "assumptions": [
          "auto-assumption-5aa54fe311f2058f99f3"
        ],
        "detail": [
          "auto-detail-936b7cf395abca76c67d"
        ],
        "covered": [
          "auto-assumption-5aa54fe311f2058f99f3",
          "auto-detail-936b7cf395abca76c67d",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-7f07455ff69b3b347e9b",
          "auto-parameter-35f5fdb6626e97dacfef",
          "detail-fractional-benchmark",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-gen-low24-pack--fractional-matching-to-packing-lp",
      "problem": "Fractional matching",
      "variant": "Unweighted",
      "objective": "max",
      "graphClass": "General",
      "model": "CONGEST",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1/(1+ε)",
      "rounds": "O((O(2 · log Δ / ε²)) + 1)",
      "roundClass": "degree",
      "parameters": "Source result (gen-low24-pack), evaluated on its transformed instance: Γₚ = max column sum, Γd = max row sum of normalized A; ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.\n\nVertex-capacity packing constraints: exact instance substitutions n=n+m, Δ=max{Δ,2}, Γd=2, Γₚ=Δ, Γp=Δ, Amax=1, m=2m.",
      "assumptions": "Source result (gen-low24-pack), evaluated on its transformed instance: Communication graph is variable–constraint incidence graph. Normalized nonzero Aᵢⱼ ≥ 1; coefficient sizes follow the paper’s CONGEST encoding.\n\nVertex-capacity packing constraints: Use one nonnegative variable per edge, with incident-variable sum at most one at each vertex. The objective is matching cardinality or the supplied edge weights. Host an edge-variable processor at an endpoint agreed by an identifier exchange; one incidence round then takes one physical round. A final output notification lets both endpoints learn their edge value. Setup and notification give O(T+1); any extra source parameter knowledge must be supplied separately. For unit edge weights, write the algorithm’s dual as max 1ᵀy subject to Aᵀy≤1, with A the edge-by-vertex 0–1 incidence matrix. Then Γd=2 and Γp≤Δ. The selected packing theorem’s normalization and bit encoding must hold. Fractional degree constraints do not enforce integral matching on nonbipartite graphs. No rounding or odd-set constraints are included. The displayed maximum degree max{Δ,2} applies when G has at least one edge. An edgeless instance is handled locally with the empty output; it is not passed to the incidence algorithm. The edge-subdivision incidence graph has exactly 2m edges, with two incidences for each original edge. Use the unweighted 0–1 matrix A=edge×vertex in the source dual form max 1ᵀy subject to Aᵀy≤1, so Γd=2 and Γp≤Δ. Setup assigns an edge-variable host; output notification makes the edge value known at both endpoints. Retain all source precision, encoding and global-input assumptions. For the simulated algorithm, G has at least one edge. Edgeless instances have an empty optimal output handled locally.",
      "paperId": "gen-low24",
      "theorem": "Theorem 2.1; derived via fractional-matching-to-packing-lp",
      "summary": "Derived upper bound via Vertex-capacity packing constraints. Original source: For fixed row sparsity k, Γd ≤ k Amax.",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/html/2409.16168v1",
      "year": 2024,
      "problemScope": {
        "node": "fractional-matching"
      },
      "graphScope": {
        "node": "general"
      },
      "approximationDisplay": "1/(1+ε)",
      "roundsDisplay": "O((O(2 · log Δ / ε²)) + 1)",
      "approximationBenchmark": "fractional",
      "weightCondition": "weights-unweighted",
      "sourceVariant": "Dual fractional positive LP",
      "sourceVerification": "primary",
      "sourceResultId": "gen-low24-pack",
      "parentResultId": "gen-low24-pack",
      "sourceProblem": "Fractional packing LP",
      "sourceGraphClass": "Incidence graphs",
      "sourceMath": {
        "rounds": "O(Γd · log Γₚ / ε²)",
        "roundsDisplay": "O(Γd · log Γₚ / ε²)",
        "roundsTex": "O\\!\\left(\\frac{\\Gamma_d\\,\\log\\Gamma_p}{\\varepsilon^2}\\right)",
        "roundsDisplayTex": "O\\!\\left(\\frac{\\Gamma_d\\,\\log\\Gamma_p}{\\varepsilon^2}\\right)",
        "approximation": "1/(1+ε) of fractional OPT",
        "approximationDisplay": "1/(1+ε)",
        "approximationTex": "\\frac{1}{1+\\varepsilon}\\,\\mathrm{OPT}_{\\mathrm{frac}}",
        "approximationDisplayTex": "\\frac{1}{1+\\varepsilon}",
        "approximationBenchmark": "fractional"
      },
      "reductionPath": [
        "fractional-matching-to-packing-lp"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "fractional-matching-to-packing-lp",
          "title": "Vertex-capacity packing constraints",
          "inputResultId": "gen-low24-pack",
          "outputProblem": "fractional-matching",
          "outputGraph": "general",
          "from": "fractional-matching",
          "to": "packing-lp",
          "direction": "upper",
          "substitutions": {
            "n": "n+m",
            "Δ": "max{Δ,2}",
            "Γd": "2",
            "Γₚ": "Δ",
            "Γp": "Δ",
            "Amax": "1",
            "m": "2m"
          },
          "cost": "O(T+1)",
          "factor": "identity",
          "conditions": [
            "Use one nonnegative variable per edge, with incident-variable sum at most one at each vertex. The objective is matching cardinality or the supplied edge weights.",
            "Host an edge-variable processor at an endpoint agreed by an identifier exchange; one incidence round then takes one physical round. A final output notification lets both endpoints learn their edge value. Setup and notification give O(T+1); any extra source parameter knowledge must be supplied separately.",
            "For unit edge weights, write the algorithm’s dual as max 1ᵀy subject to Aᵀy≤1, with A the edge-by-vertex 0–1 incidence matrix. Then Γd=2 and Γp≤Δ. The selected packing theorem’s normalization and bit encoding must hold.",
            "Fractional degree constraints do not enforce integral matching on nonbipartite graphs. No rounding or odd-set constraints are included.",
            "The displayed maximum degree max{Δ,2} applies when G has at least one edge. An edgeless instance is handled locally with the empty output; it is not passed to the incidence algorithm.",
            "The edge-subdivision incidence graph has exactly 2m edges, with two incidences for each original edge."
          ],
          "assumptions": [
            "Use the unweighted 0–1 matrix A=edge×vertex in the source dual form max 1ᵀy subject to Aᵀy≤1, so Γd=2 and Γp≤Δ.",
            "Setup assigns an edge-variable host; output notification makes the edge value known at both endpoints. Retain all source precision, encoding and global-input assumptions.",
            "For the simulated algorithm, G has at least one edge. Edgeless instances have an empty optimal output handled locally."
          ],
          "source": {
            "title": "Li, Ouyang and Wang, A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems",
            "url": "https://arxiv.org/html/2409.16168v1#S1",
            "location": "Section 1 (positive LPs and incidence communication); Theorem 2.1"
          },
          "modelConversion": null
        }
      ],
      "derivedMath": {
        "rounds": "O\\!\\left(\\bigl(O\\!\\left(\\frac{2\\,\\log\\Delta}{\\varepsilon^2}\\right)\\bigr)+1\\right)",
        "approximation": "\\frac{1}{1+\\varepsilon}"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O((O(2 · log Δ / ε²)) + 1)",
        "tex": "O\\!\\left(\\bigl(O\\!\\left(\\frac{2\\,\\log\\Delta}{\\varepsilon^2}\\right)\\bigr)+1\\right)",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Vertex-capacity packing constraints.",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2409.16168v1",
            "title": "A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems",
            "location": "Theorem 2.1"
          },
          {
            "url": "https://arxiv.org/html/2409.16168v1#S1",
            "title": "Li, Ouyang and Wang, A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems",
            "location": "Section 1 (positive LPs and incidence communication); Theorem 2.1"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "gen-low24-pack"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "Aᵢⱼ",
          "description": "Coefficient in row i and column j of the normalized constraint matrix",
          "tex": "A_{ij}"
        },
        {
          "symbol": "Γd",
          "description": "Maximum row sum of the normalized constraint matrix A",
          "tex": "\\Gamma_d"
        },
        {
          "symbol": "Γₚ",
          "description": "Maximum column sum of the normalized constraint matrix A",
          "tex": "\\Gamma_p"
        },
        {
          "symbol": "A",
          "description": "Normalized constraint matrix, whose nonzero coefficients are at least one",
          "tex": "A"
        },
        {
          "symbol": "i",
          "description": "Row index of the normalized constraint matrix",
          "tex": "i"
        },
        {
          "symbol": "j",
          "description": "Column index of the normalized constraint matrix",
          "tex": "j"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-59066c24e5e11e21d868"
        ],
        "assumptions": [
          "auto-assumption-61fef3548fc66ff5d982"
        ],
        "detail": [
          "auto-detail-bd6d3996f60e48f6aaf2"
        ],
        "covered": [
          "auto-assumption-61fef3548fc66ff5d982",
          "auto-detail-bd6d3996f60e48f6aaf2",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-a7eb1105eb53acec3508",
          "auto-output-9ba84324ac5813181686",
          "auto-parameter-59066c24e5e11e21d868",
          "detail-fractional-benchmark",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-gen-as10-setcover--mds-to-set-cover",
      "problem": "Dominating set",
      "variant": "Source algorithm: Weighted",
      "objective": "min",
      "graphClass": "General",
      "model": "Anonymous",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(Δ+1)",
      "rounds": "2 · (O((Δ+1)²(Δ+1)² + (Δ+1)(Δ+1) log* W))",
      "roundClass": "degree",
      "parameters": "Source result (gen-as10-setcover), evaluated on its transformed instance: Positive integer weights ≤ W; bounded f,k,W gives constant rounds.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.\n\nNeighborhood set cover: exact instance substitutions n=2n, Δ=Δ+1, f=Δ+1, k=Δ+1, m=n+2m.",
      "assumptions": "Source result (gen-as10-setcover), evaluated on its transformed instance: Anonymous broadcast network; no unique identifiers.\n\nNeighborhood set cover: Use universe V and the set N[v] for each candidate vertex v, with the candidate’s cost. A chosen set corresponds to choosing its vertex, so integral OPT is unchanged. Each real vertex hosts its two virtual copies. Precompute both outgoing message sets at a virtual round’s start, then deliver the set-copy and element-copy messages in two physical phases. This gives the displayed 2T schedule, including T=0. The maximum set size and element frequency are both at most Δ+1. Any source theorem’s initial labels and global parameter knowledge must be supplied or their setup cost added. Apply graph-class assumptions to the transformed incidence graph. Planarity is not preserved: planar K4 has closed-neighborhood incidence graph K4,4. The displayed CONGEST simulation is per-edge. Additional broadcast or stronger anonymity conventions must be checked for the particular algorithm. The transformed closed-neighborhood incidence graph has exactly n+2m edges: n self-incidences and two incidences for every original edge. Closed-neighborhood incidence network; each processor hosts a set-copy and an element-copy. Two role phases simulate one source round. Both set size and element frequency are at most Δ+1. Global algorithm inputs and stronger broadcast conventions require the source assumptions. Planar-incidence source algorithms are excluded: planar K4 transforms to K4,4.",
      "paperId": "gen-as10",
      "theorem": "Section 4; derived via mds-to-set-cover",
      "summary": "Derived upper bound via Neighborhood set cover. Original source: ",
      "verification": "derived",
      "sourceUrl": "https://jukkasuomela.fi/doc/vc-sc.pdf",
      "year": 2010,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "general"
      },
      "approximationDisplay": "(Δ+1)",
      "roundsDisplay": "2 · (O((Δ+1)²(Δ+1)² + (Δ+1)(Δ+1) log* W))",
      "weightCondition": "weights-integer-W",
      "sourceVariant": "Weighted",
      "sourceVerification": "primary",
      "sourceResultId": "gen-as10-setcover",
      "parentResultId": "gen-as10-setcover",
      "sourceProblem": "Set cover",
      "sourceGraphClass": "Incidence graphs; set size ≤ k, frequency ≤ f",
      "sourceMath": {
        "rounds": "O(f²k² + fk log* W)",
        "roundsDisplay": "O(f²k² + fk log* W)",
        "roundsTex": "O(f^2k^2+fk\\log^*W)",
        "roundsDisplayTex": "O(f^2k^2+fk\\log^*W)",
        "approximation": "f",
        "approximationDisplay": "f",
        "approximationTex": "f",
        "approximationDisplayTex": "f",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "mds-to-set-cover"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "mds-to-set-cover",
          "title": "Neighborhood set cover",
          "inputResultId": "gen-as10-setcover",
          "outputProblem": "dominating-set",
          "outputGraph": "general",
          "from": "dominating-set",
          "to": "set-cover",
          "direction": "upper",
          "substitutions": {
            "n": "2n",
            "Δ": "Δ+1",
            "f": "Δ+1",
            "k": "Δ+1",
            "m": "n+2m"
          },
          "cost": "2T",
          "factor": "identity",
          "conditions": [
            "Use universe V and the set N[v] for each candidate vertex v, with the candidate’s cost. A chosen set corresponds to choosing its vertex, so integral OPT is unchanged.",
            "Each real vertex hosts its two virtual copies. Precompute both outgoing message sets at a virtual round’s start, then deliver the set-copy and element-copy messages in two physical phases. This gives the displayed 2T schedule, including T=0.",
            "The maximum set size and element frequency are both at most Δ+1. Any source theorem’s initial labels and global parameter knowledge must be supplied or their setup cost added.",
            "Apply graph-class assumptions to the transformed incidence graph. Planarity is not preserved: planar K4 has closed-neighborhood incidence graph K4,4.",
            "The displayed CONGEST simulation is per-edge. Additional broadcast or stronger anonymity conventions must be checked for the particular algorithm.",
            "The transformed closed-neighborhood incidence graph has exactly n+2m edges: n self-incidences and two incidences for every original edge."
          ],
          "assumptions": [
            "Closed-neighborhood incidence network; each processor hosts a set-copy and an element-copy. Two role phases simulate one source round.",
            "Both set size and element frequency are at most Δ+1. Global algorithm inputs and stronger broadcast conventions require the source assumptions.",
            "Planar-incidence source algorithms are excluded: planar K4 transforms to K4,4."
          ],
          "source": {
            "title": "Kuhn and Wattenhofer, Constant-time distributed dominating set approximation",
            "url": "https://disco.ethz.ch/publications/distcomp05.pdf#page=2",
            "location": "Section 4; the incidence simulation is specified here"
          },
          "modelConversion": null
        }
      ],
      "derivedMath": {
        "rounds": "2\\cdot\\bigl(O(\\left(\\Delta+1\\right)^2\\left(\\Delta+1\\right)^2+\\left(\\Delta+1\\right)\\left(\\Delta+1\\right)\\log^*W)\\bigr)",
        "approximation": "\\left(\\Delta+1\\right)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "2 · (O((Δ+1)²(Δ+1)² + (Δ+1)(Δ+1) log* W))",
        "tex": "2\\cdot\\bigl(O(\\left(\\Delta+1\\right)^2\\left(\\Delta+1\\right)^2+\\left(\\Delta+1\\right)\\left(\\Delta+1\\right)\\log^*W)\\bigr)",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Neighborhood set cover.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/vc-sc.pdf",
            "title": "Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks",
            "location": "Section 4"
          },
          {
            "url": "https://disco.ethz.ch/publications/distcomp05.pdf#page=2",
            "title": "Kuhn and Wattenhofer, Constant-time distributed dominating set approximation",
            "location": "Section 4; the incidence simulation is specified here"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "gen-as10-setcover"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "W",
          "description": "Upper bound on positive integer input set weights",
          "tex": "W"
        },
        {
          "symbol": "f",
          "description": "Maximum frequency: number of sets containing an element",
          "tex": "f"
        },
        {
          "symbol": "k",
          "description": "Maximum cardinality of a set",
          "tex": "k"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-integer-W"
        ],
        "parameters": [
          "auto-parameter-3f69af196662b3f1d741"
        ],
        "assumptions": [
          "auto-assumption-45e92e95e7967d02f44a"
        ],
        "detail": [
          "auto-detail-a49b44d4581b55175582"
        ],
        "covered": [
          "auto-assumption-45e92e95e7967d02f44a",
          "auto-detail-a49b44d4581b55175582",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-557b5d489bacf2f8f758",
          "auto-model-92362405df7c8f0d5040",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-3f69af196662b3f1d741",
          "weights-integer-W",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "derived-gen-as10-setcover--vertex-cover-to-set-cover",
      "problem": "Vertex cover",
      "variant": "Source algorithm: Weighted",
      "objective": "min",
      "graphClass": "General",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "2",
      "rounds": "(O(2²Δ² + 2Δ log* W)) + 1",
      "roundClass": "degree",
      "parameters": "Source result (gen-as10-setcover), evaluated on its transformed instance: Positive integer weights ≤ W; bounded f,k,W gives constant rounds.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.\n\nEdges as universe elements: exact instance substitutions n=n+m, Δ=max{Δ,2}, f=2, k=Δ, m=2m.",
      "assumptions": "Source result (gen-as10-setcover), evaluated on its transformed instance: Anonymous broadcast network; no unique identifiers.\n\nEdges as universe elements: Use universe E and one set of incident edges for each vertex, with the same vertex cost. Every element has frequency two, and each set has size at most Δ. A one-round identifier exchange lets endpoints agree on ownership and unique identifiers for virtual edge processors. One incidence round can then be simulated in one physical round, with local messages at the owner delivered locally. If the necessary endpoint identifiers are initially known, the setup can be omitted. The source theorem’s global instance-size or degree information must also be supplied; obtaining it is not hidden in T+1. Subdividing edges preserves planarity, but arbitrary incidence-network and minor promises still need checking. A generic per-edge simulation does not preserve a broadcast-only restriction. Anonymous broadcast algorithms can sometimes avoid identifier-based ownership; such a specialized simulation is not certified by this generic recipe. The displayed maximum degree max{Δ,2} applies when G has at least one edge. An edgeless instance is handled locally with the empty output; it is not passed to the incidence algorithm. The edge-subdivision incidence graph has exactly 2m edges, with two incidences for each original edge. Universe E with one incident-edge set per original vertex; the incidence graph subdivides every edge. One identifier-exchange setup round assigns virtual edge processors. Source global algorithm inputs must already be supplied or separately obtained. For the simulated algorithm, G has at least one edge. Edgeless instances have an empty optimal output handled locally.\n\nThe source Anonymous algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only.",
      "paperId": "gen-as10",
      "theorem": "Section 4; derived via vertex-cover-to-set-cover",
      "summary": "Derived upper bound via Edges as universe elements. Original source: ",
      "verification": "derived",
      "sourceUrl": "https://jukkasuomela.fi/doc/vc-sc.pdf",
      "year": 2010,
      "problemScope": {
        "node": "vertex-cover"
      },
      "graphScope": {
        "node": "general"
      },
      "approximationDisplay": "2",
      "roundsDisplay": "(O(2²Δ² + 2Δ log* W)) + 1",
      "weightCondition": "weights-integer-W",
      "sourceVariant": "Weighted",
      "sourceVerification": "primary",
      "sourceResultId": "gen-as10-setcover",
      "parentResultId": "gen-as10-setcover",
      "sourceProblem": "Set cover",
      "sourceGraphClass": "Incidence graphs; set size ≤ k, frequency ≤ f",
      "sourceMath": {
        "rounds": "O(f²k² + fk log* W)",
        "roundsDisplay": "O(f²k² + fk log* W)",
        "roundsTex": "O(f^2k^2+fk\\log^*W)",
        "roundsDisplayTex": "O(f^2k^2+fk\\log^*W)",
        "approximation": "f",
        "approximationDisplay": "f",
        "approximationTex": "f",
        "approximationDisplayTex": "f",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "vertex-cover-to-set-cover"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "vertex-cover-to-set-cover",
          "title": "Edges as universe elements",
          "inputResultId": "gen-as10-setcover",
          "outputProblem": "vertex-cover",
          "outputGraph": "general",
          "from": "vertex-cover",
          "to": "set-cover",
          "direction": "upper",
          "substitutions": {
            "n": "n+m",
            "Δ": "max{Δ,2}",
            "f": "2",
            "k": "Δ",
            "m": "2m"
          },
          "cost": "T+1",
          "factor": "identity",
          "conditions": [
            "Use universe E and one set of incident edges for each vertex, with the same vertex cost. Every element has frequency two, and each set has size at most Δ.",
            "A one-round identifier exchange lets endpoints agree on ownership and unique identifiers for virtual edge processors. One incidence round can then be simulated in one physical round, with local messages at the owner delivered locally. If the necessary endpoint identifiers are initially known, the setup can be omitted.",
            "The source theorem’s global instance-size or degree information must also be supplied; obtaining it is not hidden in T+1.",
            "Subdividing edges preserves planarity, but arbitrary incidence-network and minor promises still need checking. A generic per-edge simulation does not preserve a broadcast-only restriction.",
            "Anonymous broadcast algorithms can sometimes avoid identifier-based ownership; such a specialized simulation is not certified by this generic recipe.",
            "The displayed maximum degree max{Δ,2} applies when G has at least one edge. An edgeless instance is handled locally with the empty output; it is not passed to the incidence algorithm.",
            "The edge-subdivision incidence graph has exactly 2m edges, with two incidences for each original edge."
          ],
          "assumptions": [
            "Universe E with one incident-edge set per original vertex; the incidence graph subdivides every edge.",
            "One identifier-exchange setup round assigns virtual edge processors. Source global algorithm inputs must already be supplied or separately obtained.",
            "For the simulated algorithm, G has at least one edge. Edgeless instances have an empty optimal output handled locally."
          ],
          "source": {
            "title": "Åstrand and Suomela, Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks",
            "url": "https://jukkasuomela.fi/doc/vc-sc.pdf",
            "location": "Sections 1 and 5; edge-processor simulation specified here"
          },
          "modelConversion": "The source Anonymous algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only."
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(O(2^2\\Delta^2+2\\Delta\\log^*W)\\bigr)+1",
        "approximation": "2"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "(O(2²Δ² + 2Δ log* W)) + 1",
        "tex": "\\bigl(O(2^2\\Delta^2+2\\Delta\\log^*W)\\bigr)+1",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Edges as universe elements.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/vc-sc.pdf",
            "title": "Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks",
            "location": "Section 4"
          },
          {
            "url": "https://jukkasuomela.fi/doc/vc-sc.pdf",
            "title": "Åstrand and Suomela, Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks",
            "location": "Sections 1 and 5; edge-processor simulation specified here"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "gen-as10-setcover"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "W",
          "description": "Upper bound on positive integer input set weights",
          "tex": "W"
        },
        {
          "symbol": "f",
          "description": "Maximum frequency: number of sets containing an element",
          "tex": "f"
        },
        {
          "symbol": "k",
          "description": "Maximum cardinality of a set",
          "tex": "k"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-integer-W"
        ],
        "parameters": [
          "auto-parameter-1dd77a279ac759790df4"
        ],
        "assumptions": [
          "auto-assumption-a1ac84c2a18e7732247d"
        ],
        "detail": [
          "auto-detail-a49b44d4581b55175582"
        ],
        "covered": [
          "auto-assumption-a1ac84c2a18e7732247d",
          "auto-detail-a49b44d4581b55175582",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-7f07455ff69b3b347e9b",
          "auto-parameter-1dd77a279ac759790df4",
          "weights-integer-W",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "derived-gen-as10-setcover--edge-domination-to-domination--mds-to-set-cover",
      "problem": "Edge dominating set",
      "variant": "Source algorithm: Weighted",
      "objective": "min",
      "graphClass": "General",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "((Δ_L)+1)",
      "rounds": "O((2 · (O(((Δ_L)+1)²((Δ_L)+1)² + ((Δ_L)+1)((Δ_L)+1) log* W))) + 1)",
      "roundClass": "degree",
      "parameters": "Source result (gen-as10-setcover), evaluated on its transformed instance: Positive integer weights ≤ W; bounded f,k,W gives constant rounds.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.\n\nDomination on the line graph: exact instance substitutions n=m, Δ=Δ_L, m=m_L.\n\nNeighborhood set cover: exact instance substitutions n=2n, Δ=Δ+1, f=Δ+1, k=Δ+1, m=n+2m.",
      "assumptions": "Source result (gen-as10-setcover), evaluated on its transformed instance: Anonymous broadcast network; no unique identifiers.\n\nDomination on the line graph: A selected vertex of L(G) corresponds to the original edge. Feasibility and cardinality OPT agree; weighted transfer additionally requires an algorithm accepting the corresponding vertex weights. Assign each virtual edge-node to an endpoint. With unrestricted LOCAL messages, a virtual round routes through shared endpoints in at most two physical rounds; constant setup and output notification give O(T+1). The source algorithm must accept the line graph’s n′, Δ′, IDs and any supplied parameters. Obtaining global information is not free. A line graph can be much denser and need not preserve planarity: the line graph of a star is a clique. This recipe claims LOCAL only. Arbitrary different messages along virtual adjacencies can create congestion at physical edges, so an O(T) CONGEST simulation is not inferred. Exact algorithm substitutions use n′=m and Δ′=Δ_L, where Δ_L=max_{uv∈E(G)}(deg(u)+deg(v)−2). The displayed 2Δ−2 is an upper bound, not an exact substitution in a nonmonotone theorem. For simple G, m_L=sum_v binom(deg(v),2) is the exact number of edges of L(G). It is retained symbolically rather than replaced by a monotone upper bound. Apply the dominating-set algorithm to L(G); generic transfer is certified only from unrestricted general-graph LOCAL algorithms. Virtual line-graph rounds route through shared endpoints in at most two physical rounds. Retain global-input assumptions; setup and output notification are included. Here m=|E(G)| and Δ_L=max over uv∈E(G) of (deg(u)+deg(v)−2), the exact maximum degree of L(G); Δ_L≤2Δ−2. If m=0, return the empty edge set locally. For simple G, m_L=sum_v binom(deg(v),2) is the exact number of edges of L(G). It is retained symbolically rather than replaced by a monotone upper bound.\n\nThe source Anonymous algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only.\n\nNeighborhood set cover: Use universe V and the set N[v] for each candidate vertex v, with the candidate’s cost. A chosen set corresponds to choosing its vertex, so integral OPT is unchanged. Each real vertex hosts its two virtual copies. Precompute both outgoing message sets at a virtual round’s start, then deliver the set-copy and element-copy messages in two physical phases. This gives the displayed 2T schedule, including T=0. The maximum set size and element frequency are both at most Δ+1. Any source theorem’s initial labels and global parameter knowledge must be supplied or their setup cost added. Apply graph-class assumptions to the transformed incidence graph. Planarity is not preserved: planar K4 has closed-neighborhood incidence graph K4,4. The displayed CONGEST simulation is per-edge. Additional broadcast or stronger anonymity conventions must be checked for the particular algorithm. The transformed closed-neighborhood incidence graph has exactly n+2m edges: n self-incidences and two incidences for every original edge. Closed-neighborhood incidence network; each processor hosts a set-copy and an element-copy. Two role phases simulate one source round. Both set size and element frequency are at most Δ+1. Global algorithm inputs and stronger broadcast conventions require the source assumptions. Planar-incidence source algorithms are excluded: planar K4 transforms to K4,4.",
      "paperId": "gen-as10",
      "theorem": "Section 4; derived via edge-domination-to-domination → mds-to-set-cover",
      "summary": "Derived upper bound via Domination on the line graph → Neighborhood set cover. Original source: ",
      "verification": "derived",
      "sourceUrl": "https://jukkasuomela.fi/doc/vc-sc.pdf",
      "year": 2010,
      "problemScope": {
        "node": "edge-dominating-set"
      },
      "graphScope": {
        "node": "general"
      },
      "approximationDisplay": "((Δ_L)+1)",
      "roundsDisplay": "O((2 · (O(((Δ_L)+1)²((Δ_L)+1)² + ((Δ_L)+1)((Δ_L)+1) log* W))) + 1)",
      "weightCondition": "weights-integer-W",
      "sourceVariant": "Weighted",
      "sourceVerification": "primary",
      "sourceResultId": "gen-as10-setcover",
      "parentResultId": "derived-gen-as10-setcover--mds-to-set-cover",
      "sourceProblem": "Set cover",
      "sourceGraphClass": "Incidence graphs; set size ≤ k, frequency ≤ f",
      "sourceMath": {
        "rounds": "O(f²k² + fk log* W)",
        "roundsDisplay": "O(f²k² + fk log* W)",
        "roundsTex": "O(f^2k^2+fk\\log^*W)",
        "roundsDisplayTex": "O(f^2k^2+fk\\log^*W)",
        "approximation": "f",
        "approximationDisplay": "f",
        "approximationTex": "f",
        "approximationDisplayTex": "f",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "edge-domination-to-domination",
        "mds-to-set-cover"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "edge-domination-to-domination",
          "title": "Domination on the line graph",
          "inputResultId": "derived-gen-as10-setcover--mds-to-set-cover",
          "outputProblem": "edge-dominating-set",
          "outputGraph": "general",
          "from": "edge-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {
            "n": "m",
            "Δ": "Δ_L",
            "m": "m_L"
          },
          "cost": "O(T+1)",
          "factor": "identity",
          "conditions": [
            "A selected vertex of L(G) corresponds to the original edge. Feasibility and cardinality OPT agree; weighted transfer additionally requires an algorithm accepting the corresponding vertex weights.",
            "Assign each virtual edge-node to an endpoint. With unrestricted LOCAL messages, a virtual round routes through shared endpoints in at most two physical rounds; constant setup and output notification give O(T+1).",
            "The source algorithm must accept the line graph’s n′, Δ′, IDs and any supplied parameters. Obtaining global information is not free.",
            "A line graph can be much denser and need not preserve planarity: the line graph of a star is a clique.",
            "This recipe claims LOCAL only. Arbitrary different messages along virtual adjacencies can create congestion at physical edges, so an O(T) CONGEST simulation is not inferred.",
            "Exact algorithm substitutions use n′=m and Δ′=Δ_L, where Δ_L=max_{uv∈E(G)}(deg(u)+deg(v)−2). The displayed 2Δ−2 is an upper bound, not an exact substitution in a nonmonotone theorem.",
            "For simple G, m_L=sum_v binom(deg(v),2) is the exact number of edges of L(G). It is retained symbolically rather than replaced by a monotone upper bound."
          ],
          "assumptions": [
            "Apply the dominating-set algorithm to L(G); generic transfer is certified only from unrestricted general-graph LOCAL algorithms.",
            "Virtual line-graph rounds route through shared endpoints in at most two physical rounds. Retain global-input assumptions; setup and output notification are included.",
            "Here m=|E(G)| and Δ_L=max over uv∈E(G) of (deg(u)+deg(v)−2), the exact maximum degree of L(G); Δ_L≤2Δ−2. If m=0, return the empty edge set locally.",
            "For simple G, m_L=sum_v binom(deg(v),2) is the exact number of edges of L(G). It is retained symbolically rather than replaced by a monotone upper bound."
          ],
          "source": {
            "title": "Suomela, Distributed Algorithms for Edge Dominating Sets",
            "url": "https://jukkasuomela.fi/doc/eds.pdf#page=1",
            "location": "Section 1.1 (line-graph correspondence); LOCAL simulation specified here"
          },
          "modelConversion": "The source Anonymous algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only."
        },
        {
          "id": "mds-to-set-cover",
          "title": "Neighborhood set cover",
          "inputResultId": "gen-as10-setcover",
          "outputProblem": "dominating-set",
          "outputGraph": "general",
          "from": "dominating-set",
          "to": "set-cover",
          "direction": "upper",
          "substitutions": {
            "n": "2n",
            "Δ": "Δ+1",
            "f": "Δ+1",
            "k": "Δ+1",
            "m": "n+2m"
          },
          "cost": "2T",
          "factor": "identity",
          "conditions": [
            "Use universe V and the set N[v] for each candidate vertex v, with the candidate’s cost. A chosen set corresponds to choosing its vertex, so integral OPT is unchanged.",
            "Each real vertex hosts its two virtual copies. Precompute both outgoing message sets at a virtual round’s start, then deliver the set-copy and element-copy messages in two physical phases. This gives the displayed 2T schedule, including T=0.",
            "The maximum set size and element frequency are both at most Δ+1. Any source theorem’s initial labels and global parameter knowledge must be supplied or their setup cost added.",
            "Apply graph-class assumptions to the transformed incidence graph. Planarity is not preserved: planar K4 has closed-neighborhood incidence graph K4,4.",
            "The displayed CONGEST simulation is per-edge. Additional broadcast or stronger anonymity conventions must be checked for the particular algorithm.",
            "The transformed closed-neighborhood incidence graph has exactly n+2m edges: n self-incidences and two incidences for every original edge."
          ],
          "assumptions": [
            "Closed-neighborhood incidence network; each processor hosts a set-copy and an element-copy. Two role phases simulate one source round.",
            "Both set size and element frequency are at most Δ+1. Global algorithm inputs and stronger broadcast conventions require the source assumptions.",
            "Planar-incidence source algorithms are excluded: planar K4 transforms to K4,4."
          ],
          "source": {
            "title": "Kuhn and Wattenhofer, Constant-time distributed dominating set approximation",
            "url": "https://disco.ethz.ch/publications/distcomp05.pdf#page=2",
            "location": "Section 4; the incidence simulation is specified here"
          },
          "modelConversion": null
        }
      ],
      "derivedMath": {
        "rounds": "O\\!\\left(\\bigl(2\\cdot\\bigl(O(\\left(\\Delta_L+1\\right)^2\\left(\\Delta_L+1\\right)^2+\\left(\\Delta_L+1\\right)\\left(\\Delta_L+1\\right)\\log^*W)\\bigr)\\bigr)+1\\right)",
        "approximation": "\\left(\\Delta_L+1\\right)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O((2 · (O(((Δ_L)+1)²((Δ_L)+1)² + ((Δ_L)+1)((Δ_L)+1) log* W))) + 1)",
        "tex": "O\\!\\left(\\bigl(2\\cdot\\bigl(O(\\left(\\Delta_L+1\\right)^2\\left(\\Delta_L+1\\right)^2+\\left(\\Delta_L+1\\right)\\left(\\Delta_L+1\\right)\\log^*W)\\bigr)\\bigr)+1\\right)",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Neighborhood set cover. The atlas applies the exact instance substitutions and communication cost of the reduction: Domination on the line graph.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/vc-sc.pdf",
            "title": "Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks",
            "location": "Section 4"
          },
          {
            "url": "https://disco.ethz.ch/publications/distcomp05.pdf#page=2",
            "title": "Kuhn and Wattenhofer, Constant-time distributed dominating set approximation",
            "location": "Section 4; the incidence simulation is specified here"
          },
          {
            "url": "https://jukkasuomela.fi/doc/eds.pdf#page=1",
            "title": "Suomela, Distributed Algorithms for Edge Dominating Sets",
            "location": "Section 1.1 (line-graph correspondence); LOCAL simulation specified here"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "derived-gen-as10-setcover--mds-to-set-cover"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "m_L",
          "description": "Number of edges of the line graph L(G)",
          "tex": "m_L"
        },
        {
          "symbol": "Δ_L",
          "description": "Maximum degree of the line graph L(G)",
          "tex": "\\Delta_L"
        },
        {
          "symbol": "W",
          "description": "Upper bound on positive integer input set weights",
          "tex": "W"
        },
        {
          "symbol": "f",
          "description": "Maximum frequency: number of sets containing an element",
          "tex": "f"
        },
        {
          "symbol": "k",
          "description": "Maximum cardinality of a set",
          "tex": "k"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-integer-W"
        ],
        "parameters": [
          "auto-parameter-399f8208acfb654f4092"
        ],
        "assumptions": [
          "auto-assumption-958650232c250834d58d"
        ],
        "detail": [
          "auto-detail-a49b44d4581b55175582"
        ],
        "covered": [
          "auto-assumption-958650232c250834d58d",
          "auto-detail-a49b44d4581b55175582",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c9185b7551a9732c9cf5",
          "auto-parameter-399f8208acfb654f4092",
          "weights-integer-W",
          "weights-integer-positive",
          "weights-weighted"
        ]
      }
    },
    {
      "id": "derived-gen-bdgpsw26-apex--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Euler genus ≤ g; at most a apices",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (34 + ε)",
      "rounds": "(f(g, a, ε)) + 4",
      "roundClass": "parameter",
      "parameters": "Source result (gen-bdgpsw26-apex), evaluated on its transformed instance: Fixed g and a; fixed ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (gen-bdgpsw26-apex), evaluated on its transformed instance: \n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "gen-bdgpsw26",
      "theorem": "Corollary 4.3 and following extension; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: Apex neighborhoods may be arbitrary.",
      "verification": "derived",
      "sourceUrl": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
      "year": 2026,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "apex"
      },
      "approximationDisplay": "(1 + 2∇₁) · (34 + ε)",
      "roundsDisplay": "(f(g, a, ε)) + 4",
      "roundClassSource": "constant",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "gen-bdgpsw26-apex",
      "parentResultId": "gen-bdgpsw26-apex",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Euler genus ≤ g; at most a apices",
      "sourceMath": {
        "rounds": "C(g,a,ε)",
        "roundsDisplay": "f(g, a, ε)",
        "roundsTex": "C(g,a,\\varepsilon )",
        "roundsDisplayTex": "f\\bigl(g,a,\\varepsilon\\bigr)",
        "approximation": "34 + ε",
        "approximationDisplay": "34 + ε",
        "approximationTex": "34 + \\varepsilon",
        "approximationDisplayTex": "34 + \\varepsilon",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "gen-bdgpsw26-apex",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "apex",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "apex"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(f\\bigl(g,a,\\varepsilon\\bigr)\\bigr)+4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(34 + \\varepsilon\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "(f(g, a, ε)) + 4",
        "tex": "\\bigl(f\\bigl(g,a,\\varepsilon\\bigr)\\bigr)+4",
        "basis": "reduction",
        "explanation": "The text after Corollary 4.3 extends the genus approximation to graphs with at most a apices. It explains the structural changes (including shortcuts through at most a apices), but does not give a closed round-complexity formula in g,a,ε. The meta-theorem composition still requires the appropriate class control function and local-error diameter threshold. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
            "title": "Meta-Theorems for Cuttable Distributed Problems",
            "location": "Corollary 4.3 and subsequent apex extension; Theorem 4.2"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": true,
        "sourceBasis": "unspecified-parameter-function",
        "derivedFrom": "gen-bdgpsw26-apex"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "a",
          "description": "Maximum number of apex vertices deleted to obtain Euler genus at most g",
          "tex": "a"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound",
          "tex": "g"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-cdc1893875a9dac727a7",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-2dd1547065070f9ff592"
        ],
        "assumptions": [
          "auto-assumption-a8f703cc27760cd8f5b2"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-a8f703cc27760cd8f5b2",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-cdc1893875a9dac727a7",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-2dd1547065070f9ff592",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-gen-bdgpsw26-localgenus--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Asymptotic dimension d; radius-r balls of Euler genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (34.01(d + 1))",
      "rounds": "(f(d, g, r)) + 4",
      "roundClass": "parameter",
      "parameters": "Source result (gen-bdgpsw26-localgenus), evaluated on its transformed instance: Fixed d,g and sufficiently large fixed radius r.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (gen-bdgpsw26-localgenus), evaluated on its transformed instance: The local-class condition is as defined in the paper; the apex extension also holds.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "gen-bdgpsw26",
      "theorem": "Corollary 4.4; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: ",
      "verification": "derived",
      "sourceUrl": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
      "year": 2026,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "local-genus",
        "note": "Asymptotic dimension, its control function and sufficiently large local radius remain fixed prerequisites."
      },
      "approximationDisplay": "(1 + 2∇₁) · (34.01(d + 1))",
      "roundsDisplay": "(f(d, g, r)) + 4",
      "roundClassSource": "constant",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "gen-bdgpsw26-localgenus",
      "parentResultId": "gen-bdgpsw26-localgenus",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Asymptotic dimension d; radius-r balls of Euler genus ≤ g",
      "sourceMath": {
        "rounds": "C(d,g,r)",
        "roundsDisplay": "f(d, g, r)",
        "roundsTex": "C(d,g,r)",
        "roundsDisplayTex": "f\\bigl(d,g,r\\bigr)",
        "approximation": "34.01(d + 1)",
        "approximationDisplay": "34.01(d + 1)",
        "approximationTex": "34.01(d + 1)",
        "approximationDisplayTex": "34.01(d + 1)",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "gen-bdgpsw26-localgenus",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "local-genus",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "local-genus"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(f\\bigl(d,g,r\\bigr)\\bigr)+4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(34.01(d + 1)\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "(f(d, g, r)) + 4",
        "tex": "\\bigl(f\\bigl(d,g,r\\bigr)\\bigr)+4",
        "basis": "reduction",
        "explanation": "Corollary 4.4 fixes the dimensional control function and a sufficiently large local radius. These are substantive prerequisites: d,g,r alone do not specify the numerical control-function values used by the proof. Do not describe its runtime as an absolute constant independent of the graph-class parameters. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
            "title": "Meta-Theorems for Cuttable Distributed Problems",
            "location": "Corollary 4.4, its application of Meta-Theorem I, and the definition of the dimensional control function"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": true,
        "sourceBasis": "unspecified-parameter-function",
        "derivedFrom": "gen-bdgpsw26-localgenus"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "d",
          "description": "Asymptotic dimension bound of the graph class",
          "tex": "d"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound for the radius-r balls after any stated apex deletions",
          "tex": "g"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Fixed sufficiently large radius of the neighborhoods used in the local-class assumption",
          "tex": "r"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-cc88dac74423991e2fb4",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-38b877417a6040168599"
        ],
        "assumptions": [
          "auto-assumption-ad7a9161800b32288659"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-ad7a9161800b32288659",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-cc88dac74423991e2fb4",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-38b877417a6040168599",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-gen-bdgpsw26-connected--mds-via-connected-domination",
      "problem": "Dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Connected; Euler genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "3 · (O(√g + 1))",
      "rounds": "f(g)",
      "roundClass": "parameter",
      "parameters": "Source result (gen-bdgpsw26-connected), evaluated on its transformed instance: Fixed g.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (gen-bdgpsw26-connected), evaluated on its transformed instance: \n\nReuse a connected dominating set: On a nonempty connected graph with unit vertex costs, run the source connected-dominating-set algorithm and return exactly its selected vertices as an ordinary dominating set. OPT_MDS ≤ OPT_CDS ≤ 3 OPT_MDS − 2. Thus an α-approximation against integral OPT_CDS gives a 3α-approximation against integral OPT_MDS, with no additional communication. The optimum comparison is unweighted. On a three-vertex path with costs (1,M,1), ordinary domination costs at most 2 while every connected dominating set costs at least M. The target remains restricted to connected inputs. Do not extend a connected-input algorithm to disconnected networks without checking component-wise operation, termination and global inputs. No fractional-MDS benchmark or lower-bound transfer is inferred by this factor-changing rule. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "paperId": "gen-bdgpsw26",
      "theorem": "Section 4, after Corollary 4.5; derived via mds-via-connected-domination",
      "summary": "Derived upper bound via Reuse a connected dominating set. Original source: The paper states the more detailed bound 68√(3g/2) + O(1).",
      "verification": "derived",
      "sourceUrl": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
      "year": 2026,
      "problemScope": {
        "node": "dominating-set"
      },
      "graphScope": {
        "node": "euler",
        "note": "Retain any connectivity condition stated by the source."
      },
      "approximationDisplay": "3 · (O(√g + 1))",
      "roundsDisplay": "f(g)",
      "roundClassSource": "constant",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "gen-bdgpsw26-connected",
      "parentResultId": "gen-bdgpsw26-connected",
      "sourceProblem": "Connected dominating set",
      "sourceGraphClass": "Connected; Euler genus ≤ g",
      "sourceMath": {
        "rounds": "C(g)",
        "roundsDisplay": "f(g)",
        "roundsTex": "C(g)",
        "roundsDisplayTex": "f\\bigl(g\\bigr)",
        "approximation": "O(√g + 1)",
        "approximationDisplay": "O(√g + 1)",
        "approximationTex": "O(\\sqrt{g}+1)",
        "approximationDisplayTex": "O(\\sqrt{g}+1)",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "mds-via-connected-domination"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "mds-via-connected-domination",
          "title": "Reuse a connected dominating set",
          "inputResultId": "gen-bdgpsw26-connected",
          "outputProblem": "dominating-set",
          "outputGraph": "euler",
          "from": "dominating-set",
          "to": "connected-dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T",
          "factor": "multiply",
          "conditions": [
            "On a nonempty connected graph with unit vertex costs, run the source connected-dominating-set algorithm and return exactly its selected vertices as an ordinary dominating set.",
            "OPT_MDS ≤ OPT_CDS ≤ 3 OPT_MDS − 2. Thus an α-approximation against integral OPT_CDS gives a 3α-approximation against integral OPT_MDS, with no additional communication.",
            "The optimum comparison is unweighted. On a three-vertex path with costs (1,M,1), ordinary domination costs at most 2 while every connected dominating set costs at least M.",
            "The target remains restricted to connected inputs. Do not extend a connected-input algorithm to disconnected networks without checking component-wise operation, termination and global inputs.",
            "No fractional-MDS benchmark or lower-bound transfer is inferred by this factor-changing rule."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Caro, West and Yuster, Connected Domination and Spanning Trees with Many Leaves",
            "url": "https://math.haifa.ac.il/raphy/papers/conndom.pdf#page=4",
            "location": "Lemma 2.1, Duchet–Meyniel inequality; zero-round output reuse is a direct consequence."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "3",
            "tex": "3"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Caro, West and Yuster, Connected Domination and Spanning Trees with Many Leaves",
              "url": "https://math.haifa.ac.il/raphy/papers/conndom.pdf#page=4",
              "location": "Lemma 2.1, Duchet–Meyniel inequality; zero-round output reuse is a direct consequence."
            },
            "graphPath": {
              "nodes": [
                "euler"
              ],
              "edges": []
            },
            "bound": {
              "label": "3",
              "tex": "3"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "f\\bigl(g\\bigr)",
        "approximation": "3\\cdot\\bigl(O(\\sqrt{g}+1)\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "f(g)",
        "tex": "f\\bigl(g\\bigr)",
        "basis": "reduction",
        "explanation": "The connected dominating set paragraph derives its approximation guarantee using the cited connected-domination reduction, but does not expand the round complexity of the composition as a formula in g. Its explicit O(sqrt(g)) approximation factor is not a runtime formula. The atlas applies the exact instance substitutions and communication cost of the reduction: Reuse a connected dominating set.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
            "title": "Meta-Theorems for Cuttable Distributed Problems",
            "location": "Section 4, connected dominating set application following Corollary 4.5"
          },
          {
            "url": "https://math.haifa.ac.il/raphy/papers/conndom.pdf#page=4",
            "title": "Caro, West and Yuster, Connected Domination and Spanning Trees with Many Leaves",
            "location": "Lemma 2.1, Duchet–Meyniel inequality; zero-round output reuse is a direct consequence."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": true,
        "sourceBasis": "unspecified-parameter-function",
        "derivedFrom": "gen-bdgpsw26-connected"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "g",
          "description": "Euler genus bound",
          "tex": "g"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "graph-connected-euler",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-9db041050fd545202dcf"
        ],
        "assumptions": [
          "auto-assumption-35b25ca4662d26f8109b"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-35b25ca4662d26f8109b",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-b321139eea50286d2951",
          "auto-parameter-9db041050fd545202dcf",
          "detail-integral-benchmark",
          "graph-connected-euler",
          "input-connected",
          "weights-unweighted"
        ]
      }
    },
    {
      "paperId": "gen-kmw16",
      "variant": "Source algorithm: Unweighted; constant or polylogarithmic approximation",
      "objective": "min",
      "graphClass": "General",
      "model": "LOCAL",
      "randomization": "Randomized",
      "bound": "lower",
      "approximation": "Constant or polylogarithmic factor",
      "rounds": "Ω(min{√(log n / log log n), log Δ / log log Δ})",
      "roundClass": "other",
      "parameters": "Source result (gen-kmw16-mds-lower), evaluated on its transformed instance: n is the number of vertices; Δ is the maximum degree. The exponents in polylogarithmic factors are fixed.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (gen-kmw16-mds-lower), evaluated on its transformed instance: Also applies to deterministic algorithms. Randomized lower bound concerns expected approximation with a fixed worst-case round budget. There are hard graph families; n and Δ are coupled by the construction, so this is not a guarantee for every independently prescribed pair (n, Δ).\n\nClosed-neighborhood requests: Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags. Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination.",
      "verification": "derived",
      "year": 2016,
      "id": "derived-gen-kmw16-mds-lower--mds-to-local-covering",
      "problem": "Integral local covering",
      "theorem": "Theorem 15 and Corollary 16 (arXiv v2, PDF pp.21–23); derived via mds-to-local-covering",
      "summary": "Derived lower bound via Closed-neighborhood requests. Original source: A locality-preserving line-graph reduction transfers the vertex-cover lower bound to minimum dominating set.",
      "sourceUrl": "https://arxiv.org/pdf/1011.5470v2#page=22",
      "problemScope": {
        "node": "local-covering"
      },
      "graphScope": {
        "node": "general"
      },
      "approximationDisplay": "Constant or polylogarithmic factor",
      "roundsDisplay": "Ω(min{√(log n / log log n), log Δ / log log Δ})",
      "weightCondition": "weights-unweighted",
      "sourceVariant": "Unweighted; constant or polylogarithmic approximation",
      "sourceVerification": "primary",
      "sourceResultId": "gen-kmw16-mds-lower",
      "parentResultId": "gen-kmw16-mds-lower",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "General",
      "sourceMath": {
        "rounds": "Ω(min{√(log n / log log n), log Δ / log log Δ})",
        "roundsDisplay": "Ω(min{√(log n / log log n), log Δ / log log Δ})",
        "roundsTex": "\\Omega\\!\\left(\\min\\!\\left\\{\\sqrt{\\frac{\\log n}{\\log\\log n}},\\frac{\\log\\Delta}{\\log\\log\\Delta}\\right\\}\\right)",
        "roundsDisplayTex": "\\Omega\\!\\left(\\min\\!\\left\\{\\sqrt{\\frac{\\log n}{\\log\\log n}},\\frac{\\log\\Delta}{\\log\\log\\Delta}\\right\\}\\right)",
        "approximation": "Constant or polylogarithmic factor",
        "approximationDisplay": "Constant or polylogarithmic factor",
        "approximationTex": "\\text{Constant or polylogarithmic factor}",
        "approximationDisplayTex": "\\text{Constant or polylogarithmic factor}",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "mds-to-local-covering"
      ],
      "reductionDirection": "lower",
      "reductionSteps": [
        {
          "id": "mds-to-local-covering",
          "title": "Closed-neighborhood requests",
          "inputResultId": "gen-kmw16-mds-lower",
          "outputProblem": "local-covering",
          "outputGraph": "general",
          "from": "dominating-set",
          "to": "local-covering",
          "direction": "lower",
          "substitutions": {},
          "cost": "T",
          "factor": "identity",
          "conditions": [
            "Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags.",
            "Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved.",
            "The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required.",
            "T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated."
          ],
          "assumptions": [
            "Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination."
          ],
          "source": {
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "location": "Section 6.6; Appendix D"
          },
          "modelConversion": null
        }
      ],
      "derivedMath": {
        "rounds": "\\Omega\\!\\left(\\min\\!\\left\\{\\sqrt{\\frac{\\log n}{\\log\\log n}},\\frac{\\log\\Delta}{\\log\\log\\Delta}\\right\\}\\right)",
        "approximation": "\\text{Constant or polylogarithmic factor}"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Ω(min{√(log n / log log n), log Δ / log log Δ})",
        "tex": "\\Omega\\!\\left(\\min\\!\\left\\{\\sqrt{\\frac{\\log n}{\\log\\log n}},\\frac{\\log\\Delta}{\\log\\log\\Delta}\\right\\}\\right)",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Closed-neighborhood requests.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/1011.5470v2#page=22",
            "title": "Local Computation: Lower and Upper Bounds",
            "location": "Theorem 15 and Corollary 16 (arXiv v2, PDF pp.21–23)"
          },
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "location": "Section 6.6; Appendix D"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "gen-kmw16-mds-lower"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-6d8656e375cec5630dc1"
        ],
        "assumptions": [
          "auto-assumption-71f1c18f07ae2c1a4590"
        ],
        "detail": [
          "auto-detail-5b982b65b05eef70c96a"
        ],
        "covered": [
          "auto-assumption-71f1c18f07ae2c1a4590",
          "auto-detail-5b982b65b05eef70c96a",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-8c23ea8df7a704e9d465",
          "auto-output-d13f16e4e51c9b55f160",
          "auto-parameter-6d8656e375cec5630dc1",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-pic-large-50-dom--connected-domination-via-mds",
      "paperId": "pic-bgpw-large-2025",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "K₂,t-minor-free",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (50)",
      "rounds": "(O(t)) + 4",
      "roundClass": "parameter",
      "parameters": "Source result (pic-large-50-dom), evaluated on its transformed instance: Fixed integer t ≥ 2.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (pic-large-50-dom), evaluated on its transformed instance: Distinct identifiers.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "theorem": "Theorem 4.1; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: Ratio independent of t.",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/html/2504.01091v2",
      "year": 2025,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "k2t"
      },
      "approximationDisplay": "(1 + 2∇₁) · (50)",
      "roundsDisplay": "(O(t)) + 4",
      "roundClassSource": "constant",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "pic-large-50-dom",
      "parentResultId": "pic-large-50-dom",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "K₂,t-minor-free",
      "sourceMath": {
        "rounds": "Oₜ(1)",
        "roundsDisplay": "O(t)",
        "roundsTex": "O_t(1)",
        "roundsDisplayTex": "O(t)",
        "approximation": "50",
        "approximationDisplay": "50",
        "approximationTex": "50",
        "approximationDisplayTex": "50",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "pic-large-50-dom",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "k2t",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "k2t"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(O(t)\\bigr)+4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(50\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "(O(t)) + 4",
        "tex": "\\bigl(O(t)\\bigr)+4",
        "basis": "reduction",
        "explanation": "The original paper states Oₜ(1), while the thesis explicitly analyzes the same Algorithm 5 in O(t) rounds. It chooses the class control function F_t(r)=(5r+18)t; the remaining residual-diameter term is linear in t. The printed composition is 3 max{F_t(5)+2,F_t(11)+5}+g(t)+3, with g linear. This is an asymptotic bound, not a fully specified exact round count. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=125",
            "title": "Timothé Picavet’s doctoral thesis",
            "location": "Chapter IV, Theorem IV.3.1 and following explicit linear-in-t runtime analysis (PDF p. 125)"
          },
          {
            "url": "https://arxiv.org/html/2504.01091v2",
            "title": "Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors",
            "location": "Theorem 4.1, Lemma 4.2 and following runtime composition"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [
          {
            "symbol": "t",
            "description": "Size of the second bipartition class of the excluded minor K₂,t; fixed integer t≥2",
            "tex": "t"
          }
        ],
        "checked": "2026-11-16",
        "audited": true,
        "displayInTable": true,
        "sourceBasis": "stated",
        "derivedFrom": "pic-large-50-dom"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "t",
          "description": "Size of the second bipartition class of the excluded minor K₂,t; fixed integer t≥2",
          "tex": "t"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-bb37704c123e99aa335b",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-9dbb947b6d84ae7a6543"
        ],
        "assumptions": [
          "auto-assumption-758bbb474368354c283b"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-758bbb474368354c283b",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-bb37704c123e99aa335b",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-9dbb947b6d84ae7a6543",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-pic-large-linear-dom--connected-domination-via-mds",
      "paperId": "pic-bgpw-large-2025",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "K₂,t-minor-free",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (2t − 1)",
      "rounds": "7",
      "roundClass": "constant",
      "parameters": "Source result (pic-large-linear-dom), evaluated on its transformed instance: Integer t ≥ 2; rounds independent of t.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (pic-large-linear-dom), evaluated on its transformed instance: \n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "theorem": "Theorem 4.4; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: ",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/html/2504.01091v2",
      "year": 2025,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "k2t"
      },
      "approximationDisplay": "(1 + 2∇₁) · (2t − 1)",
      "roundsDisplay": "7",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "pic-large-linear-dom",
      "parentResultId": "pic-large-linear-dom",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "K₂,t-minor-free",
      "sourceMath": {
        "rounds": "3",
        "roundsDisplay": "3",
        "roundsTex": "3",
        "roundsDisplayTex": "3",
        "approximation": "2t − 1",
        "approximationDisplay": "2t − 1",
        "approximationTex": "2t - 1",
        "approximationDisplayTex": "2t - 1",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "pic-large-linear-dom",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "k2t",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "k2t"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "7",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(2t - 1\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "7",
        "tex": "7",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2504.01091v2",
            "title": "Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors",
            "location": "Theorem 4.4"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "pic-large-linear-dom"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "t",
          "description": "Size of the second bipartition class of the excluded minor K_{2,t}",
          "tex": "t"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-bb37704c123e99aa335b",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-05c0bf8040d6edb94768"
        ],
        "assumptions": [
          "auto-assumption-927f172acd661a22819b"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-927f172acd661a22819b",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-bb37704c123e99aa335b",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-05c0bf8040d6edb94768",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-pic-nice-planar-uniform--connected-domination-via-mds",
      "paperId": "pic-bgpw-nice-2025",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Planar",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "7 · (302)",
      "rounds": "9",
      "roundClass": "constant",
      "parameters": "Source result (pic-nice-planar-uniform), evaluated on its transformed instance: \n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (pic-nice-planar-uniform), evaluated on its transformed instance: \n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "theorem": "Proposition 5; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: Uniformity supports transfer to other graph classes.",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/html/2507.04960v1",
      "year": 2025,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "7 · (302)",
      "roundsDisplay": "9",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted; 4-uniform guarantee",
      "sourceVerification": "primary",
      "sourceResultId": "pic-nice-planar-uniform",
      "parentResultId": "pic-nice-planar-uniform",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Planar",
      "sourceMath": {
        "rounds": "5",
        "roundsDisplay": "5",
        "roundsTex": "5",
        "roundsDisplayTex": "5",
        "approximation": "302",
        "approximationDisplay": "302",
        "approximationTex": "302",
        "approximationDisplayTex": "302",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "pic-nice-planar-uniform",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "planar",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "7",
            "tex": "7",
            "graph": "planar"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "planar"
              ],
              "edges": []
            },
            "bound": {
              "graph": "planar",
              "label": "7",
              "tex": "7",
              "certificate": "Planarity is minor-closed and planar minors have edge density at most three."
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "9",
        "approximation": "7\\cdot\\bigl(302\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "9",
        "tex": "9",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2507.04960v1",
            "title": "Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs",
            "location": "Proposition 5"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "pic-nice-planar-uniform"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-b2271c458a560813ef31"
        ],
        "assumptions": [
          "auto-assumption-e854ad7bc55846e48592"
        ],
        "detail": [
          "auto-detail-83ffa327ecdc25adfa68"
        ],
        "covered": [
          "auto-assumption-e854ad7bc55846e48592",
          "auto-detail-83ffa327ecdc25adfa68",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-b2271c458a560813ef31",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-pic-nice-localgenus--connected-domination-via-mds",
      "paperId": "pic-bgpw-nice-2025",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Asymptotic dimension d; radius-r balls of Euler genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (35(d + 1))",
      "rounds": "(f(d, g, r)) + 4",
      "roundClass": "parameter",
      "parameters": "Source result (pic-nice-localgenus), evaluated on its transformed instance: Fixed d,g,r and dimensional control function; r sufficiently large.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (pic-nice-localgenus), evaluated on its transformed instance: Every radius-r induced ball lies in the Euler-genus-g class.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "theorem": "Theorem 8; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: ",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/html/2507.04960v1",
      "year": 2025,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "local-genus",
        "note": "Asymptotic dimension, its control function and sufficiently large local radius remain fixed prerequisites."
      },
      "approximationDisplay": "(1 + 2∇₁) · (35(d + 1))",
      "roundsDisplay": "(f(d, g, r)) + 4",
      "roundClassSource": "constant",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "pic-nice-localgenus",
      "parentResultId": "pic-nice-localgenus",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Asymptotic dimension d; radius-r balls of Euler genus ≤ g",
      "sourceMath": {
        "rounds": "C(d,g,r)",
        "roundsDisplay": "f(d, g, r)",
        "roundsTex": "C(d,g,r)",
        "roundsDisplayTex": "f\\bigl(d,g,r\\bigr)",
        "approximation": "35(d + 1)",
        "approximationDisplay": "35(d + 1)",
        "approximationTex": "35(d + 1)",
        "approximationDisplayTex": "35(d + 1)",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "pic-nice-localgenus",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "local-genus",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "local-genus"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(f\\bigl(d,g,r\\bigr)\\bigr)+4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(35(d + 1)\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "partial",
        "formula": "(T + δ + 2) + 4, where T = F(2u+2) + max{u+1, b}",
        "tex": "\\bigl(T+\\delta+2\\bigr)+4,\\qquad T=F(2u+2)+\\max\\{u+1,b\\}",
        "basis": "reduction",
        "explanation": "Theorem 8 gives a class-dependent constant and applies Proposition 2 to Theorem 7. Proposition 3 does give a precise generic composition, but the dimensional control function and the genus base runtime are not reduced to closed expressions in the displayed parameters. The local-genus row therefore has no computed full formula to substitute for f(d,g,r). The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://arxiv.org/html/2507.04960v1",
            "title": "Approximation Algorithms for Dominating Set on Locally Nice Graph Classes",
            "location": "Proposition 3; Theorems 7 and 8; Claim 4"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [
          {
            "symbol": "T",
            "description": "Intermediate algorithm radius from the displayed composition",
            "tex": "T"
          },
          {
            "symbol": "δ",
            "description": "Upper bound on weak diameters of the local error components",
            "tex": "\\delta"
          },
          {
            "symbol": "F",
            "description": "Dimensional control function of the target graph class",
            "tex": "F"
          },
          {
            "symbol": "u",
            "description": "Uniformity radius of the base algorithm",
            "tex": "u"
          },
          {
            "symbol": "b",
            "description": "Round complexity of the base algorithm",
            "tex": "b"
          }
        ],
        "checked": "2026-11-16",
        "audited": true,
        "expression": {
          "formula": "(T + δ + 2) + 4",
          "tex": "\\bigl(T+\\delta+2\\bigr)+4"
        },
        "suffix": {
          "formula": ", where T = F(2u+2) + max{u+1, b}",
          "tex": ",\\qquad T=F(2u+2)+\\max\\{u+1,b\\}"
        },
        "sourceBasis": "stated-composition",
        "derivedFrom": "pic-nice-localgenus"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "F",
          "description": "Dimensional control function of the target graph class",
          "tex": "F"
        },
        {
          "symbol": "T",
          "description": "Intermediate algorithm radius from the displayed composition",
          "tex": "T"
        },
        {
          "symbol": "b",
          "description": "Round complexity of the base algorithm",
          "tex": "b"
        },
        {
          "symbol": "d",
          "description": "Asymptotic dimension bound of the graph class",
          "tex": "d"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound for the radius-r balls after any stated apex deletions",
          "tex": "g"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Fixed sufficiently large radius of the neighborhoods used in the local-class assumption",
          "tex": "r"
        },
        {
          "symbol": "u",
          "description": "Uniformity radius of the base algorithm",
          "tex": "u"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "δ",
          "description": "Upper bound on weak diameters of the local error components",
          "tex": "\\delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-cc88dac74423991e2fb4",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-4ce932d2e764804d25ca"
        ],
        "assumptions": [
          "auto-assumption-72ec5161908ff799d58a"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-72ec5161908ff799d58a",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-cc88dac74423991e2fb4",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-4ce932d2e764804d25ca",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-pic-genus-broadcast-historical--connected-domination-via-mds",
      "paperId": "pic-chww-broadcast-2019",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Orientable genus ≤ g",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (f(g))",
      "rounds": "14",
      "roundClass": "constant",
      "parameters": "Source result (pic-genus-broadcast-historical), evaluated on its transformed instance: Fixed g.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (pic-genus-broadcast-historical), evaluated on its transformed instance: CONGEST_BC: each vertex broadcasts the same O(log n)-bit message to neighbors.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.\n\nThe source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only.",
      "theorem": "Abstract; Lemma 10; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: Publisher text specifies ten rounds.",
      "verification": "derived",
      "sourceUrl": "https://www.sciencedirect.com/science/article/pii/S0304397518304894",
      "year": 2019,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "orientable",
        "note": "The historical record does not establish applicability to every bounded Euler-genus family."
      },
      "approximationDisplay": "(1 + 2∇₁) · (f(g))",
      "roundsDisplay": "14",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "pic-genus-broadcast-historical",
      "parentResultId": "pic-genus-broadcast-historical",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Orientable genus ≤ g",
      "sourceMath": {
        "rounds": "10",
        "roundsDisplay": "10",
        "roundsTex": "10",
        "roundsDisplayTex": "10",
        "approximation": "O𝗀(1)",
        "approximationDisplay": "f(g)",
        "approximationTex": "O_g(1)",
        "approximationDisplayTex": "f\\bigl(g\\bigr)",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "pic-genus-broadcast-historical",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "orientable",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": "The source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only.",
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "orientable"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "14",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(f\\bigl(g\\bigr)\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "14",
        "tex": "14",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://www.sciencedirect.com/science/article/pii/S0304397518304894",
            "title": "Distributed CONGEST_BC constant approximation of MDS in bounded genus graphs",
            "location": "Abstract; Lemma 10"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "pic-genus-broadcast-historical"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "g",
          "description": "Orientable genus upper bound",
          "tex": "g",
          "sourceSymbol": "𝗀"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-924a81ff2b56320e8d33",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-f9aaf82a8aa5350d440a"
        ],
        "assumptions": [
          "auto-assumption-284bc13b07bfe0df7180"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-284bc13b07bfe0df7180",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-924a81ff2b56320e8d33",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-f9aaf82a8aa5350d440a",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-pic-sublog-fmatching--matching-to-f-matching",
      "paperId": "pic-chw-capacitated-2021",
      "problem": "Maximum matching",
      "variant": "Unit-capacity specialization; source algorithm: Maximum f-matching; edges used at most once",
      "objective": "max",
      "graphClass": "Sub-logarithmic expansion g(r) = o(log r)",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − ε",
      "rounds": "Oε,𝗀(log* n)",
      "roundClass": "logstar",
      "parameters": "Source result (pic-sublog-fmatching), evaluated on its transformed instance: Fixed ε > 0 and expansion function g.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.\n\nUnit simple capacities: exact instance substitutions f=1.",
      "assumptions": "Source result (pic-sublog-fmatching), evaluated on its transformed instance: Integer vertex capacities f(v); expansion information supplied.\n\nUnit simple capacities: Set every vertex capacity f(v)=1. Then every feasible f-matching is an ordinary matching, with the same cardinality OPT. The indexed f-matching theorem is unweighted; no weighted guarantee is inferred unless the source algorithm explicitly supports weights. Source expansion bounds, identifiers and any supplied structural parameters remain required. Choosing unit capacities does not remove them. Set the capacity function f(v)=1 everywhere. The source objective, weight support and structural-input assumptions remain.",
      "theorem": "Theorem 7; derived via matching-to-f-matching",
      "summary": "Derived upper bound via Unit simple capacities. Original source: ",
      "verification": "derived",
      "sourceUrl": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol212-isaac2021/LIPIcs.ISAAC.2021.59/LIPIcs.ISAAC.2021.59.pdf",
      "year": 2021,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "sublog"
      },
      "prerequisite": "Expansion bounds supplied",
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "Oε,𝗀(log* n)",
      "weightCondition": "weights-unweighted",
      "sourceVariant": "Maximum f-matching; edges used at most once",
      "sourceVerification": "primary",
      "sourceResultId": "pic-sublog-fmatching",
      "parentResultId": "pic-sublog-fmatching",
      "sourceProblem": "Maximum f-matching",
      "sourceGraphClass": "Sub-logarithmic expansion g(r) = o(log r)",
      "sourceMath": {
        "rounds": "Oε,𝗀(log* n)",
        "roundsDisplay": "Oε,𝗀(log* n)",
        "roundsTex": "O_{\\varepsilon,g}(\\log^*n)",
        "roundsDisplayTex": "O_{\\varepsilon,g}(\\log^*n)",
        "approximation": "1 − ε",
        "approximationDisplay": "1 − ε",
        "approximationTex": "1 - \\varepsilon",
        "approximationDisplayTex": "1 - \\varepsilon",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "matching-to-f-matching"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "matching-to-f-matching",
          "title": "Unit simple capacities",
          "inputResultId": "pic-sublog-fmatching",
          "outputProblem": "maximum-matching",
          "outputGraph": "sublog",
          "from": "maximum-matching",
          "to": "f-matching",
          "direction": "upper",
          "substitutions": {
            "f": "1"
          },
          "cost": "T",
          "factor": "identity",
          "conditions": [
            "Set every vertex capacity f(v)=1. Then every feasible f-matching is an ordinary matching, with the same cardinality OPT.",
            "The indexed f-matching theorem is unweighted; no weighted guarantee is inferred unless the source algorithm explicitly supports weights.",
            "Source expansion bounds, identifiers and any supplied structural parameters remain required. Choosing unit capacities does not remove them."
          ],
          "assumptions": [
            "Set the capacity function f(v)=1 everywhere. The source objective, weight support and structural-input assumptions remain."
          ],
          "source": {
            "title": "Czygrinow, Hańćkowiak and Witkowski, Distributed Approximations of f-Matchings and b-Matchings",
            "url": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol212-isaac2021/LIPIcs.ISAAC.2021.59/LIPIcs.ISAAC.2021.59.pdf#page=1",
            "location": "Section 1 (unit-capacity specializations)"
          },
          "modelConversion": null
        }
      ],
      "derivedMath": {
        "rounds": "O_{\\varepsilon,g}(\\log^*n)",
        "approximation": "1 - \\varepsilon"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Oε,𝗀(log* n)",
        "tex": "O_{\\varepsilon,g}(\\log^*n)",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Unit simple capacities.",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol212-isaac2021/LIPIcs.ISAAC.2021.59/LIPIcs.ISAAC.2021.59.pdf",
            "title": "Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion",
            "location": "Theorem 7"
          },
          {
            "url": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol212-isaac2021/LIPIcs.ISAAC.2021.59/LIPIcs.ISAAC.2021.59.pdf#page=1",
            "title": "Czygrinow, Hańćkowiak and Witkowski, Distributed Approximations of f-Matchings and b-Matchings",
            "location": "Section 1 (unit-capacity specializations)"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "pic-sublog-fmatching"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f(v)",
          "description": "Positive integer capacity of vertex v in the f-matching problem",
          "tex": "f(v)"
        },
        {
          "symbol": "g(r)",
          "description": "Upper bound on the edge-to-vertex ratio of depth-r minors",
          "tex": "g(r)"
        },
        {
          "symbol": "f",
          "description": "Positive integer vertex-capacity function: a vertex v may meet at most f(v) selected edges",
          "tex": "f"
        },
        {
          "symbol": "g",
          "description": "Expansion function of the fixed input graph class; g(r)=o(log r)",
          "tex": "g",
          "sourceSymbol": "𝗀"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Radius parameter in the expansion function",
          "tex": "r"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-9fd58cfedeb677601608",
          "weights-unweighted",
          "input-expansion-bounds"
        ],
        "parameters": [
          "auto-parameter-7036a2ebe04667730f7e"
        ],
        "assumptions": [
          "auto-assumption-4fc104291a1b11a9344c"
        ],
        "detail": [
          "auto-detail-6de5dbe727f3722164d2"
        ],
        "covered": [
          "auto-assumption-4fc104291a1b11a9344c",
          "auto-detail-6de5dbe727f3722164d2",
          "auto-graph-9fd58cfedeb677601608",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-7036a2ebe04667730f7e",
          "input-expansion-bounds",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-pic-sublog-bmatching--matching-to-b-matching",
      "paperId": "pic-chw-capacitated-2021",
      "problem": "Maximum matching",
      "variant": "Unit-capacity specialization; source algorithm: Maximum b-matching; integer edge multiplicities",
      "objective": "max",
      "graphClass": "Sub-logarithmic expansion g(r) = o(log r)",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "1 − ε",
      "rounds": "Oε,1,𝗀(log* n)",
      "roundClass": "logstar",
      "parameters": "Source result (pic-sublog-bmatching), evaluated on its transformed instance: Fixed ε > 0, L, and expansion function g.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.\n\nUnit multiplicity capacities: exact instance substitutions b=1, L=1.",
      "assumptions": "Source result (pic-sublog-bmatching), evaluated on its transformed instance: Positive integer capacities b; |b(u)−b(v)| ≤ L dist(u,v); L known.\n\nUnit multiplicity capacities: Set b(v)=1 at every vertex. This forces every edge multiplicity to be zero or one, and the feasible solutions and cardinality optimum equal ordinary matching. Unit capacities satisfy the source Lipschitz condition with L=1; supply that value if the algorithm requires it. The indexed result is unweighted and its expansion, identifiers and structural-parameter assumptions remain. No arbitrary weighted version is inferred. Set b(v)=1 everywhere and supply L=1 where the source asks for a Lipschitz bound. The source objective, weight support and structural-input assumptions remain.",
      "theorem": "Theorem 17; derived via matching-to-b-matching",
      "summary": "Derived upper bound via Unit multiplicity capacities. Original source: ",
      "verification": "derived",
      "sourceUrl": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol212-isaac2021/LIPIcs.ISAAC.2021.59/LIPIcs.ISAAC.2021.59.pdf",
      "year": 2021,
      "problemScope": {
        "node": "maximum-matching"
      },
      "graphScope": {
        "node": "sublog"
      },
      "prerequisite": "Known Lipschitz capacity bound",
      "approximationDisplay": "1 − ε",
      "roundsDisplay": "Oε,1,𝗀(log* n)",
      "weightCondition": "weights-unweighted",
      "sourceVariant": "Maximum b-matching; integer edge multiplicities",
      "sourceVerification": "primary",
      "sourceResultId": "pic-sublog-bmatching",
      "parentResultId": "pic-sublog-bmatching",
      "sourceProblem": "Maximum b-matching",
      "sourceGraphClass": "Sub-logarithmic expansion g(r) = o(log r)",
      "sourceMath": {
        "rounds": "Oε,ᴸ,𝗀(log* n)",
        "roundsDisplay": "Oε,ᴸ,𝗀(log* n)",
        "roundsTex": "O_{\\varepsilon,L,g}(\\log^*n)",
        "roundsDisplayTex": "O_{\\varepsilon,L,g}(\\log^*n)",
        "approximation": "1 − ε",
        "approximationDisplay": "1 − ε",
        "approximationTex": "1 - \\varepsilon",
        "approximationDisplayTex": "1 - \\varepsilon",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "matching-to-b-matching"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "matching-to-b-matching",
          "title": "Unit multiplicity capacities",
          "inputResultId": "pic-sublog-bmatching",
          "outputProblem": "maximum-matching",
          "outputGraph": "sublog",
          "from": "maximum-matching",
          "to": "b-matching",
          "direction": "upper",
          "substitutions": {
            "b": "1",
            "L": "1"
          },
          "cost": "T",
          "factor": "identity",
          "conditions": [
            "Set b(v)=1 at every vertex. This forces every edge multiplicity to be zero or one, and the feasible solutions and cardinality optimum equal ordinary matching.",
            "Unit capacities satisfy the source Lipschitz condition with L=1; supply that value if the algorithm requires it.",
            "The indexed result is unweighted and its expansion, identifiers and structural-parameter assumptions remain. No arbitrary weighted version is inferred."
          ],
          "assumptions": [
            "Set b(v)=1 everywhere and supply L=1 where the source asks for a Lipschitz bound. The source objective, weight support and structural-input assumptions remain."
          ],
          "source": {
            "title": "Czygrinow, Hańćkowiak and Witkowski, Distributed Approximations of f-Matchings and b-Matchings",
            "url": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol212-isaac2021/LIPIcs.ISAAC.2021.59/LIPIcs.ISAAC.2021.59.pdf#page=1",
            "location": "Section 1 (unit-capacity specializations)"
          },
          "modelConversion": null
        }
      ],
      "derivedMath": {
        "rounds": "O_{\\varepsilon,1,g}(\\log^*n)",
        "approximation": "1 - \\varepsilon"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "Oε,1,𝗀(log* n)",
        "tex": "O_{\\varepsilon,1,g}(\\log^*n)",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Unit multiplicity capacities.",
        "evidence": [
          {
            "url": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol212-isaac2021/LIPIcs.ISAAC.2021.59/LIPIcs.ISAAC.2021.59.pdf",
            "title": "Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion",
            "location": "Theorem 17"
          },
          {
            "url": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol212-isaac2021/LIPIcs.ISAAC.2021.59/LIPIcs.ISAAC.2021.59.pdf#page=1",
            "title": "Czygrinow, Hańćkowiak and Witkowski, Distributed Approximations of f-Matchings and b-Matchings",
            "location": "Section 1 (unit-capacity specializations)"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "pic-sublog-bmatching"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "b(v)",
          "description": "Positive integer capacity of vertex v in the b-matching problem",
          "tex": "b(v)"
        },
        {
          "symbol": "g(r)",
          "description": "Upper bound on the edge-to-vertex ratio of depth-r minors",
          "tex": "g(r)"
        },
        {
          "symbol": "L",
          "description": "Known Lipschitz constant: |b(u)−b(v)|≤L·dist(u,v)",
          "tex": "L"
        },
        {
          "symbol": "b",
          "description": "Positive integer vertex-capacity function bounding incident edge multiplicities",
          "tex": "b"
        },
        {
          "symbol": "g",
          "description": "Expansion function of the fixed input graph class; g(r)=o(log r)",
          "tex": "g",
          "sourceSymbol": "𝗀"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Radius parameter in the expansion function",
          "tex": "r"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-9fd58cfedeb677601608",
          "weights-unweighted",
          "input-lipschitz-capacity-bound"
        ],
        "parameters": [
          "auto-parameter-b51ad9c382afc1897d3d"
        ],
        "assumptions": [
          "auto-assumption-ba292d44cd90c45cb53f"
        ],
        "detail": [
          "auto-detail-be2ee3bcd4a552afd1a8"
        ],
        "covered": [
          "auto-assumption-ba292d44cd90c45cb53f",
          "auto-detail-be2ee3bcd4a552afd1a8",
          "auto-graph-9fd58cfedeb677601608",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-d95ef193bcfe270b3957",
          "auto-parameter-b51ad9c382afc1897d3d",
          "input-lipschitz-capacity-bound",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-pic-ass-sublog-refine--connected-domination-via-mds",
      "paperId": "amiri-beyond-2017",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Sub-logarithmic expansion f(r) = o(log r)",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (1 + ε)",
      "rounds": "(Oε,꜀(log* n)) + 4",
      "roundClass": "logstar",
      "parameters": "Source result (pic-ass-sublog-refine), evaluated on its transformed instance: Fixed expansion class, ε > 0, c.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (pic-ass-sublog-refine), evaluated on its transformed instance: A c-approximate dominating set is provided as input.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "theorem": "Journal version, Theorem 4.6; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: Conditional refinement; seed cost is additional.",
      "verification": "derived",
      "sourceUrl": "https://schmiste.github.io/talg19ds.pdf",
      "year": 2019,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "sublog"
      },
      "prerequisite": "Supplied c-approximate dominating set; seed cost additional",
      "approximationDisplay": "(1 + 2∇₁) · (1 + ε)",
      "roundsDisplay": "(Oε,꜀(log* n)) + 4",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "pic-ass-sublog-refine",
      "parentResultId": "pic-ass-sublog-refine",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Sub-logarithmic expansion f(r) = o(log r)",
      "sourceMath": {
        "rounds": "Oε,꜀(log* n)",
        "roundsDisplay": "Oε,꜀(log* n)",
        "roundsTex": "O_{\\varepsilon,c}(\\log^*n)",
        "roundsDisplayTex": "O_{\\varepsilon,c}(\\log^*n)",
        "approximation": "1 + ε",
        "approximationDisplay": "1 + ε",
        "approximationTex": "1 + \\varepsilon",
        "approximationDisplayTex": "1 + \\varepsilon",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "pic-ass-sublog-refine",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "sublog",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "sublog"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(O_{\\varepsilon,c}(\\log^*n)\\bigr)+4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(1 + \\varepsilon\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "(Oε,꜀(log* n)) + 4",
        "tex": "\\bigl(O_{\\varepsilon,c}(\\log^*n)\\bigr)+4",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://schmiste.github.io/talg19ds.pdf",
            "title": "Distributed Dominating Set Approximations beyond Planar Graphs",
            "location": "Journal version, Theorem 4.6"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "pic-ass-sublog-refine"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f(r)",
          "description": "Upper bound on the edge-to-vertex ratio of depth-r minors",
          "tex": "f(r)"
        },
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "c",
          "description": "Approximation factor of the initial dominating set supplied as input",
          "tex": "c"
        },
        {
          "symbol": "f",
          "description": "Expansion function of the fixed graph class; f(r)=o(log r)",
          "tex": "f"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Radius parameter in the expansion function",
          "tex": "r"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-8522d0de3c4afaf02c91",
          "weights-unweighted",
          "input-c-approx-seed",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-4243edb366be8548a75b"
        ],
        "assumptions": [
          "auto-assumption-a0adcc81a6a94e67a1c8"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-a0adcc81a6a94e67a1c8",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-8522d0de3c4afaf02c91",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-4243edb366be8548a75b",
          "detail-integral-benchmark",
          "input-c-approx-seed",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-pic-ass-sublog-full--connected-domination-via-mds",
      "paperId": "amiri-beyond-2017",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Sub-logarithmic expansion f(r) = o(log r)",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (1 + ε)",
      "rounds": "(O(log n)) + 4",
      "roundClass": "logarithmic",
      "parameters": "Source result (pic-ass-sublog-full), evaluated on its transformed instance: Fixed expansion class and ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (pic-ass-sublog-full), evaluated on its transformed instance: \n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "theorem": "Journal version, Corollary 4.7 and following paragraph; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: Includes the cited bounded-expansion seed construction.",
      "verification": "derived",
      "sourceUrl": "https://schmiste.github.io/talg19ds.pdf",
      "year": 2019,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "sublog"
      },
      "approximationDisplay": "(1 + 2∇₁) · (1 + ε)",
      "roundsDisplay": "(O(log n)) + 4",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "pic-ass-sublog-full",
      "parentResultId": "pic-ass-sublog-full",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Sub-logarithmic expansion f(r) = o(log r)",
      "sourceMath": {
        "rounds": "O(log n)",
        "roundsDisplay": "O(log n)",
        "roundsTex": "O(\\log n)",
        "roundsDisplayTex": "O(\\log n)",
        "approximation": "1 + ε",
        "approximationDisplay": "1 + ε",
        "approximationTex": "1 + \\varepsilon",
        "approximationDisplayTex": "1 + \\varepsilon",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "pic-ass-sublog-full",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "sublog",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "sublog"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(O(\\log n)\\bigr)+4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(1 + \\varepsilon\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "(O(log n)) + 4",
        "tex": "\\bigl(O(\\log n)\\bigr)+4",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://schmiste.github.io/talg19ds.pdf",
            "title": "Distributed Dominating Set Approximations beyond Planar Graphs",
            "location": "Journal version, Corollary 4.7 and following paragraph"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "pic-ass-sublog-full"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "f(r)",
          "description": "Upper bound on the edge-to-vertex ratio of depth-r minors",
          "tex": "f(r)"
        },
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "f",
          "description": "Expansion function of the fixed graph class; f(r)=o(log r)",
          "tex": "f"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Radius parameter in the expansion function",
          "tex": "r"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-8522d0de3c4afaf02c91",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-b286c4976032037dd207"
        ],
        "assumptions": [
          "auto-assumption-2423bbc3ae186b6c0251"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-2423bbc3ae186b6c0251",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-8522d0de3c4afaf02c91",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-b286c4976032037dd207",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "problem": "Integral local covering",
      "variant": "Source algorithm: Unweighted",
      "objective": "min",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "rounds": "f(H, ε) rounds ruled out",
      "roundClass": "parameter",
      "paperId": "pic-thesis-2026",
      "verification": "derived",
      "year": 2026,
      "id": "derived-pic-thesis-pathwidth-lower--mds-to-local-covering",
      "graphClass": "H-minor-free graphs",
      "approximation": "> 2 pw(H) − 1 − ε",
      "parameters": "Source result (pic-thesis-pathwidth-lower), evaluated on its transformed instance: Fixed excluded minor H and ε > 0; pw(H) is its pathwidth.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (pic-thesis-pathwidth-lower), evaluated on its transformed instance: The number of rounds may depend arbitrarily on H, independently of n.\n\nClosed-neighborhood requests: Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags. Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination.",
      "theorem": "Chapter V, Theorem V.1.1 (PDF p. 146); derived via mds-to-local-covering",
      "sourceUrl": "https://timothepicavet.fr/others/thesis.pdf#page=146",
      "summary": "Derived lower bound via Closed-neighborhood requests. Original source: Pathwidth of the excluded minor controls this lower bound.",
      "problemScope": {
        "node": "local-covering"
      },
      "graphScope": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "approximationDisplay": "> 2 pw(H) − 1 − ε",
      "roundsDisplay": "f(H, ε) rounds ruled out",
      "roundBudgetExcluded": true,
      "roundClassSource": "constant",
      "weightCondition": "weights-unweighted",
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "pic-thesis-pathwidth-lower",
      "parentResultId": "pic-thesis-pathwidth-lower",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "H-minor-free graphs",
      "sourceMath": {
        "rounds": "O(1)-round impossibility",
        "roundsDisplay": "f(H, ε) rounds ruled out",
        "roundsTex": "O(1)\\text{-round impossibility}",
        "roundsDisplayTex": "f\\bigl(H,\\varepsilon\\bigr)\\text{ rounds ruled out}",
        "approximation": "No (2 pw(H) − 1 − ε)-approximation",
        "approximationDisplay": "> 2 pw(H) − 1 − ε",
        "approximationTex": "\\text{No }(2\\operatorname{pw}(H)-1-\\varepsilon)\\text{-approximation}",
        "approximationDisplayTex": "> 2\\operatorname{pw}(H)-1-\\varepsilon",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "mds-to-local-covering"
      ],
      "reductionDirection": "lower",
      "reductionSteps": [
        {
          "id": "mds-to-local-covering",
          "title": "Closed-neighborhood requests",
          "inputResultId": "pic-thesis-pathwidth-lower",
          "outputProblem": "local-covering",
          "outputGraph": "minor",
          "from": "dominating-set",
          "to": "local-covering",
          "direction": "lower",
          "substitutions": {},
          "cost": "T",
          "factor": "identity",
          "conditions": [
            "Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags.",
            "Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved.",
            "The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required.",
            "T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated."
          ],
          "assumptions": [
            "Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination."
          ],
          "source": {
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "location": "Section 6.6; Appendix D"
          },
          "modelConversion": null
        }
      ],
      "derivedMath": {
        "rounds": "f\\bigl(H,\\varepsilon\\bigr)\\text{ rounds ruled out}",
        "approximation": "> 2\\operatorname{pw}(H)-1-\\varepsilon"
      },
      "roundComplexityDetails": {
        "status": "impossibility",
        "formula": "Any T(H, ε) independent of n",
        "tex": "\\text{Any }T\\bigl(H,\\varepsilon\\bigr)\\text{ independent of }n",
        "basis": "reduction",
        "explanation": "This excludes every round complexity depending only on the listed fixed parameters, independently of n. It is a lower-bound budget, not the running time of an algorithm. The atlas applies the exact instance substitutions and communication cost of the reduction: Closed-neighborhood requests.",
        "evidence": [
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=146",
            "title": "Algorithmes distribués et structures locales dans les graphes",
            "location": "Chapter V, Theorem V.1.1 (PDF p. 146)"
          },
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "location": "Section 6.6; Appendix D"
          }
        ],
        "parameters": [
          {
            "symbol": "T",
            "description": "An arbitrary number of communication rounds depending only on the listed fixed parameters",
            "tex": "T"
          }
        ],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "quantified-impossibility",
        "derivedFrom": "pic-thesis-pathwidth-lower"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "pw(H)",
          "description": "Pathwidth of the excluded graph H",
          "tex": "\\operatorname{pw}(H)"
        },
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "T",
          "description": "An arbitrary number of communication rounds depending only on the listed fixed parameters",
          "tex": "T"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        },
        {
          "symbol": "ε",
          "description": "Approximation accuracy or slack",
          "tex": "\\varepsilon"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-147b06bde51054bdc0f1",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-c81ac640bcf6dd797870"
        ],
        "assumptions": [
          "auto-assumption-8db585b7967f15e1d6c8"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-8db585b7967f15e1d6c8",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-147b06bde51054bdc0f1",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-d13f16e4e51c9b55f160",
          "auto-parameter-c81ac640bcf6dd797870",
          "weights-unweighted"
        ]
      }
    },
    {
      "problem": "Integral local covering",
      "variant": "Source algorithm: Unweighted",
      "objective": "min",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "lower",
      "rounds": "f(t) rounds ruled out",
      "roundClass": "parameter",
      "paperId": "pic-thesis-2026",
      "verification": "derived",
      "year": 2026,
      "id": "derived-pic-thesis-pathpower-lower--mds-to-local-covering",
      "graphClass": "t-th powers of paths with endpoint leaves",
      "approximation": "≥ 2t + 1",
      "parameters": "Source result (pic-thesis-pathpower-lower), evaluated on its transformed instance: Fixed integer t ≥ 1; arbitrary round complexity f(t).\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (pic-thesis-pathpower-lower), evaluated on its transformed instance: Witnesses allow extra degree-one vertices attached at one endpoint. Distinct identifiers in {1,…,|V(G)|}.\n\nClosed-neighborhood requests: Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags. Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination.",
      "theorem": "Chapter V, Lemma V.2.1 (PDF p. 148; proof p. 149); derived via mds-to-local-covering",
      "sourceUrl": "https://timothepicavet.fr/others/thesis.pdf#page=148",
      "summary": "Derived lower bound via Closed-neighborhood requests. Original source: A related path-power lower bound with endpoint leaves.",
      "problemScope": {
        "node": "local-covering"
      },
      "graphScope": {
        "node": "path-powers-leaves"
      },
      "approximationDisplay": "≥ 2t + 1",
      "roundsDisplay": "f(t) rounds ruled out",
      "roundBudgetExcluded": true,
      "roundClassSource": "constant",
      "weightCondition": "weights-unweighted",
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "pic-thesis-pathpower-lower",
      "parentResultId": "pic-thesis-pathpower-lower",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "t-th powers of paths with endpoint leaves",
      "sourceMath": {
        "rounds": "O(1)-round impossibility",
        "roundsDisplay": "f(t) rounds ruled out",
        "roundsTex": "O(1)\\text{-round impossibility}",
        "roundsDisplayTex": "f\\bigl(t\\bigr)\\text{ rounds ruled out}",
        "approximation": "No ratio < 2t + 1",
        "approximationDisplay": "≥ 2t + 1",
        "approximationTex": "\\text{No ratio }<2t+1",
        "approximationDisplayTex": "\\ge 2t+1",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "mds-to-local-covering"
      ],
      "reductionDirection": "lower",
      "reductionSteps": [
        {
          "id": "mds-to-local-covering",
          "title": "Closed-neighborhood requests",
          "inputResultId": "pic-thesis-pathpower-lower",
          "outputProblem": "local-covering",
          "outputGraph": "path-powers-leaves",
          "from": "dominating-set",
          "to": "local-covering",
          "direction": "lower",
          "substitutions": {},
          "cost": "T",
          "factor": "identity",
          "conditions": [
            "Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags.",
            "Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved.",
            "The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required.",
            "T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated."
          ],
          "assumptions": [
            "Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination."
          ],
          "source": {
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "location": "Section 6.6; Appendix D"
          },
          "modelConversion": null
        }
      ],
      "derivedMath": {
        "rounds": "f\\bigl(t\\bigr)\\text{ rounds ruled out}",
        "approximation": "\\ge 2t+1"
      },
      "roundComplexityDetails": {
        "status": "impossibility",
        "formula": "Any T(t) independent of n",
        "tex": "\\text{Any }T\\bigl(t\\bigr)\\text{ independent of }n",
        "basis": "reduction",
        "explanation": "This excludes every round complexity depending only on the listed fixed parameters, independently of n. It is a lower-bound budget, not the running time of an algorithm. The atlas applies the exact instance substitutions and communication cost of the reduction: Closed-neighborhood requests.",
        "evidence": [
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=148",
            "title": "Algorithmes distribués et structures locales dans les graphes",
            "location": "Chapter V, Lemma V.2.1 (PDF p. 148; proof p. 149)"
          },
          {
            "url": "https://arxiv.org/pdf/2611.02057#page=43",
            "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
            "location": "Section 6.6; Appendix D"
          }
        ],
        "parameters": [
          {
            "symbol": "T",
            "description": "An arbitrary number of communication rounds depending only on the listed fixed parameters",
            "tex": "T"
          }
        ],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "quantified-impossibility",
        "derivedFrom": "pic-thesis-pathpower-lower"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "G",
          "description": "Input graph",
          "tex": "G"
        },
        {
          "symbol": "T",
          "description": "An arbitrary number of communication rounds depending only on the listed fixed parameters",
          "tex": "T"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "t",
          "description": "Power of the underlying path: original path vertices at distance at most t are adjacent",
          "tex": "t"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-580cce8ae5a0654250af",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-e1e8d0a35a054dedef76"
        ],
        "assumptions": [
          "auto-assumption-b24827fc82c679b4d0eb"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-b24827fc82c679b4d0eb",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-580cce8ae5a0654250af",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-d13f16e4e51c9b55f160",
          "auto-parameter-e1e8d0a35a054dedef76",
          "weights-unweighted"
        ]
      }
    },
    {
      "paperId": "gen-bdgpsw26",
      "problem": "Connected dominating set",
      "objective": "min",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "verification": "derived",
      "year": 2026,
      "id": "derived-pic-thesis-planar-205--connected-domination-via-mds",
      "variant": "Unweighted",
      "graphClass": "Planar",
      "approximation": "7 · (205)",
      "rounds": "10",
      "roundClass": "constant",
      "parameters": "Source result (pic-thesis-planar-205), evaluated on its transformed instance: \n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (pic-thesis-planar-205), evaluated on its transformed instance: Distinct identifiers; the algorithm uses local computation without a time bound.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "theorem": "Proposition 3.1; thesis Proposition III.3.1 (PDF p. 82); derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: The local optimum-based Algorithm 1 has an explicit six-round schedule.",
      "sourceUrl": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf#page=5",
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "planar"
      },
      "approximationDisplay": "7 · (205)",
      "roundsDisplay": "10",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "pic-thesis-planar-205",
      "parentResultId": "pic-thesis-planar-205",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Planar",
      "sourceMath": {
        "rounds": "6",
        "roundsDisplay": "6",
        "roundsTex": "6",
        "roundsDisplayTex": "6",
        "approximation": "205",
        "approximationDisplay": "205",
        "approximationTex": "205",
        "approximationDisplayTex": "205",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "pic-thesis-planar-205",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "planar",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "7",
            "tex": "7",
            "graph": "planar"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "planar"
              ],
              "edges": []
            },
            "bound": {
              "graph": "planar",
              "label": "7",
              "tex": "7",
              "certificate": "Planarity is minor-closed and planar minors have edge density at most three."
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "10",
        "approximation": "7\\cdot\\bigl(205\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "10",
        "tex": "10",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf#page=5",
            "title": "Meta-Theorems for Cuttable Distributed Problems",
            "location": "Proposition 3.1; thesis Proposition III.3.1 (PDF p. 82)"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "pic-thesis-planar-205"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-315a624a2fe052ad3bab",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-e9790360007ba7ff449a"
        ],
        "assumptions": [
          "auto-assumption-9eb294b251a46ab9ce6c"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-9eb294b251a46ab9ce6c",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-315a624a2fe052ad3bab",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-e9790360007ba7ff449a",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "paperId": "gen-bdgpsw26",
      "problem": "Connected dominating set",
      "objective": "min",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "verification": "derived",
      "year": 2026,
      "id": "derived-pic-thesis-genus-616--connected-domination-via-mds",
      "variant": "Unweighted",
      "graphClass": "Euler genus ≤ g",
      "approximation": "(1 + 2∇₁) · (616)",
      "rounds": "(f(g)) + 4",
      "roundClass": "parameter",
      "parameters": "Source result (pic-thesis-genus-616), evaluated on its transformed instance: Fixed Euler genus bound g; the approximation ratio is independent of g.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (pic-thesis-genus-616), evaluated on its transformed instance: Distinct identifiers; the class-dependent control function and genus bound determine the number of rounds.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "theorem": "Theorem 3.2; thesis Theorem III.3.2 (PDF pp. 82–83); derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: An introductory genus-transfer algorithm with ratio independent of g; the round complexity depends on g.",
      "sourceUrl": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf#page=6",
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "euler",
        "note": "Retain any connectivity condition stated by the source."
      },
      "approximationDisplay": "(1 + 2∇₁) · (616)",
      "roundsDisplay": "(f(g)) + 4",
      "roundClassSource": "constant",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "pic-thesis-genus-616",
      "parentResultId": "pic-thesis-genus-616",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Euler genus ≤ g",
      "sourceMath": {
        "rounds": "C(g)",
        "roundsDisplay": "f(g)",
        "roundsTex": "C(g)",
        "roundsDisplayTex": "f\\bigl(g\\bigr)",
        "approximation": "616",
        "approximationDisplay": "616",
        "approximationTex": "616",
        "approximationDisplayTex": "616",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "pic-thesis-genus-616",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "euler",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "euler"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(f\\bigl(g\\bigr)\\bigr)+4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(616\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "partial",
        "formula": "(O((g+1)(F_g(10)+6))) + 4",
        "tex": "\\bigl(O\\!\\left((g+1)(F_g(10)+6)\\right)\\bigr)+4",
        "basis": "reduction",
        "explanation": "Theorem 3.2 states C(g). Algorithm 2 inspects radius F_g(10)+5, and Claim 3.3 bounds the residual two-hop components' weak diameters by less than 2(F_g(10)+6)g. Gathering the necessary bounded-radius views and applying the constant-round planar algorithm therefore gives the partial asymptotic expansion below. The proof does not compute F_g(10) as a closed function of g; do not label this an elementary explicit dependence on g or an exact integer runtime. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
            "title": "Meta-Theorems for Cuttable Distributed Problems",
            "location": "Theorem 3.2, Algorithm 2, Claim 3.3"
          },
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=82",
            "title": "Timothé Picavet's doctoral thesis",
            "location": "Theorem III.3.2, PDF pp. 82–83"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [
          {
            "symbol": "F_g",
            "description": "A two-dimensional control function for the class of graphs of Euler genus at most g",
            "tex": "F_g"
          }
        ],
        "checked": "2026-11-16",
        "audited": true,
        "sourceBasis": "derived-phase-bound",
        "derivedFrom": "pic-thesis-genus-616"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "F_g",
          "description": "A two-dimensional control function for the class of graphs of Euler genus at most g",
          "tex": "F_g"
        },
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound",
          "tex": "g"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-4688deea0bc7a8a63f32",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-8ca3d5925c503f9a8f34"
        ],
        "assumptions": [
          "auto-assumption-4adbaf03e6a810acabdd"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-4adbaf03e6a810acabdd",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-4688deea0bc7a8a63f32",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-8ca3d5925c503f9a8f34",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "paperId": "gen-bdgpsw26",
      "problem": "Connected dominating set",
      "objective": "min",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "verification": "derived",
      "year": 2026,
      "id": "derived-pic-thesis-local-apex--connected-domination-via-mds",
      "variant": "Unweighted",
      "graphClass": "Asymptotic dimension d; radius-r balls of Euler genus ≤ g with at most a apices",
      "approximation": "(1 + 2∇₁) · (34.01(d + 1))",
      "rounds": "(f(d, g, a, r)) + 4",
      "roundClass": "parameter",
      "parameters": "Source result (pic-thesis-local-apex), evaluated on its transformed instance: Fixed d, g, a and sufficiently large fixed radius r, together with a fixed dimensional control function.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (pic-thesis-local-apex), evaluated on its transformed instance: For every vertex, its induced radius-r ball becomes a graph of Euler genus at most g after deleting at most a vertices. The bound is for a class of asymptotic dimension at most d; its control function is fixed.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "theorem": "Corollary 4.4 and apex extension; thesis Corollary III.4.4 (PDF p. 88); derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: The text explicitly extends the local-genus corollary to the a-apex version, preserving its ratio while allowing a-dependent round complexity.",
      "sourceUrl": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf#page=10",
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "local-apex",
        "note": "Retain fixed d, g, a, a sufficiently large radius r, and the class-dimensional control function; the deletion set of at most a apices may differ between balls."
      },
      "approximationDisplay": "(1 + 2∇₁) · (34.01(d + 1))",
      "roundsDisplay": "(f(d, g, a, r)) + 4",
      "roundClassSource": "constant",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "pic-thesis-local-apex",
      "parentResultId": "pic-thesis-local-apex",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Asymptotic dimension d; radius-r balls of Euler genus ≤ g with at most a apices",
      "sourceMath": {
        "rounds": "C(d,g,a,r)",
        "roundsDisplay": "f(d, g, a, r)",
        "roundsTex": "C(d,g,a,r)",
        "roundsDisplayTex": "f\\bigl(d,g,a,r\\bigr)",
        "approximation": "34.01(d + 1)",
        "approximationDisplay": "34.01(d + 1)",
        "approximationTex": "34.01(d + 1)",
        "approximationDisplayTex": "34.01(d + 1)",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "pic-thesis-local-apex",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "local-apex",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "local-apex"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(f\\bigl(d,g,a,r\\bigr)\\bigr)+4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(34.01(d + 1)\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "(f(d, g, a, r)) + 4",
        "tex": "\\bigl(f\\bigl(d,g,a,r\\bigr)\\bigr)+4",
        "basis": "reduction",
        "explanation": "The local-apex extension preserves the approximation ratio while allowing the number of rounds to depend on the apex count and the other fixed class parameters. The corollary and the following extension do not calculate a closed round formula; the transfer still uses the class's control function. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf",
            "title": "Meta-Theorems for Cuttable Distributed Problems",
            "location": "Corollary 4.4 and apex extension"
          },
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=88",
            "title": "Timothé Picavet's doctoral thesis",
            "location": "Corollary III.4.4 and its apex extension, PDF p. 88"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": true,
        "sourceBasis": "unspecified-parameter-function",
        "derivedFrom": "pic-thesis-local-apex"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "a",
          "description": "Maximum number of vertices deleted from each radius-r ball to obtain Euler genus at most g",
          "tex": "a"
        },
        {
          "symbol": "d",
          "description": "Asymptotic dimension bound of the graph class",
          "tex": "d"
        },
        {
          "symbol": "g",
          "description": "Euler genus bound for the radius-r balls after any stated apex deletions",
          "tex": "g"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "r",
          "description": "Fixed sufficiently large radius of the neighborhoods used in the local-class assumption",
          "tex": "r"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-923a099c9b7572b1569c",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-47819a7e8d9c09e581bf"
        ],
        "assumptions": [
          "auto-assumption-503d86d8b8cea576d4ec"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-503d86d8b8cea576d4ec",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-923a099c9b7572b1569c",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-47819a7e8d9c09e581bf",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "paperId": "pic-thesis-2026",
      "variant": "Unweighted",
      "objective": "min",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "verification": "derived",
      "year": 2026,
      "id": "derived-pic-thesis-pw2-dom--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "graphClass": "H-minor-free; pw(H) ≤ 2",
      "approximation": "(1 + 2∇₁) · (50)",
      "rounds": "(f(H)) + 4",
      "roundClass": "parameter",
      "parameters": "Source result (pic-thesis-pw2-dom), evaluated on its transformed instance: Fixed excluded graph H with pw(H) ≤ 2. The approximation ratio is independent of H.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (pic-thesis-pw2-dom), evaluated on its transformed instance: Distinct identifiers. The excluded graph H is fixed, and the proof chooses H-dependent structural diameter thresholds.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "theorem": "Chapter VIII, Theorem VIII.1.1 (PDF p. 204; proof completed p. 218); derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: Extends Algorithm 5 from K₂,t-minor-free graphs to every fixed excluded minor H of pathwidth at most two. The pathwidth restriction is on H, not on the input graph.",
      "sourceUrl": "https://timothepicavet.fr/others/thesis.pdf#page=204",
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "minor-pw2",
        "note": "H is a fixed excluded minor with pw(H) ≤ 2; the input graph need not have pathwidth at most 2."
      },
      "approximationDisplay": "(1 + 2∇₁) · (50)",
      "roundsDisplay": "(f(H)) + 4",
      "roundClassSource": "constant",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted",
      "sourceVerification": "primary",
      "sourceResultId": "pic-thesis-pw2-dom",
      "parentResultId": "pic-thesis-pw2-dom",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "H-minor-free; pw(H) ≤ 2",
      "sourceMath": {
        "rounds": "O_H(1)",
        "roundsDisplay": "f(H)",
        "roundsTex": "O_H(1)",
        "roundsDisplayTex": "f\\bigl(H\\bigr)",
        "approximation": "50",
        "approximationDisplay": "50",
        "approximationTex": "50",
        "approximationDisplayTex": "50",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "pic-thesis-pw2-dom",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "minor-pw2",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "minor-pw2"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(f\\bigl(H\\bigr)\\bigr)+4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(50\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "not-stated",
        "formula": "(f(H)) + 4",
        "tex": "\\bigl(f\\bigl(H\\bigr)\\bigr)+4",
        "basis": "reduction",
        "explanation": "Theorem VIII.1.1 reuses Algorithm 5 with a new structural diameter analysis. The proof still chooses local-cut radii via the dimensional control function and H-dependent structural thresholds. The final residual weak-diameter estimate is D+4 in terms of a prior structural bound D; it does not by itself produce a closed communication bound in the excluded graph H. The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=204",
            "title": "Timothé Picavet's doctoral thesis",
            "location": "Theorem VIII.1.1, PDF p. 204; proof of Theorem VIII.5.1 and conclusion of Chapter VIII, PDF pp. 217–218"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": true,
        "sourceBasis": "unspecified-parameter-function",
        "derivedFrom": "pic-thesis-pw2-dom"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "pw(H)",
          "description": "Pathwidth of the excluded graph H",
          "tex": "\\operatorname{pw}(H)"
        },
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "H",
          "description": "Fixed graph excluded as a minor",
          "tex": "H"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-23bbca89e52d93fabbc0",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-6d3b55fa9bd0982d7651"
        ],
        "assumptions": [
          "auto-assumption-9dd32f29169f9c39c172"
        ],
        "detail": [
          "auto-detail-f3b5d7665a7f0847c453"
        ],
        "covered": [
          "auto-assumption-9dd32f29169f9c39c172",
          "auto-detail-f3b5d7665a7f0847c453",
          "auto-graph-23bbca89e52d93fabbc0",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-6d3b55fa9bd0982d7651",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "paperId": "pic-thesis-2026",
      "variant": "Unweighted",
      "objective": "min",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "verification": "derived",
      "year": 2026,
      "id": "derived-pic-thesis-path-excluded-exact--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "graphClass": "Pₜ-minor-free",
      "approximation": "(1 + 2∇₁) · (1)",
      "rounds": "(t − 1) + 4",
      "roundClass": "parameter",
      "parameters": "Source result (pic-thesis-path-excluded-exact), evaluated on its transformed instance: Pₜ is the t-vertex path; fixed integer t ≥ 2.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (pic-thesis-path-excluded-exact), evaluated on its transformed instance: Distinct identifiers and unrestricted LOCAL messages. Disconnected graphs are handled component by component.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.",
      "theorem": "Chapter IV, Section IV.1, elementary observation (PDF p. 120); derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: Every connected component has diameter at most t−2. Gather the component and compute its exact minimum dominating set with common lexicographic tie-breaking.",
      "sourceUrl": "https://timothepicavet.fr/others/thesis.pdf#page=120",
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "path-minor",
        "note": "t is the fixed number of vertices of the excluded path. Bounds apply separately to each connected component."
      },
      "approximationDisplay": "(1 + 2∇₁) · (1)",
      "roundsDisplay": "(t − 1) + 4",
      "roundClassSource": "constant",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted; exact component optimum",
      "sourceVerification": "primary",
      "sourceResultId": "pic-thesis-path-excluded-exact",
      "parentResultId": "pic-thesis-path-excluded-exact",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Pₜ-minor-free",
      "sourceMath": {
        "rounds": "t − 1",
        "roundsDisplay": "t − 1",
        "roundsTex": "t-1",
        "roundsDisplayTex": "t-1",
        "approximation": "1",
        "approximationDisplay": "1",
        "approximationTex": "1",
        "approximationDisplayTex": "1",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "pic-thesis-path-excluded-exact",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "path-minor",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": null,
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "path-minor"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "\\bigl(t-1\\bigr)+4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(1\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "(t − 1) + 4",
        "tex": "\\bigl(t-1\\bigr)+4",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=120",
            "title": "Algorithmes distribués et structures locales dans les graphes",
            "location": "Chapter IV, Section IV.1, elementary observation (PDF p. 120)"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "pic-thesis-path-excluded-exact"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "OPT",
          "description": "Minimum cardinality of a feasible solution",
          "tex": "\\mathrm{OPT}"
        },
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "D",
          "description": "Vertex set selected by the algorithm",
          "tex": "D"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "t",
          "description": "Number of vertices in the excluded path P_t",
          "tex": "t"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-c40b643df6f08b5ef5f6",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-88557e30a3a34fe83792"
        ],
        "assumptions": [
          "auto-assumption-4874045a5887943fc598"
        ],
        "detail": [
          "auto-detail-fe19580c0e36745bb924"
        ],
        "covered": [
          "auto-assumption-4874045a5887943fc598",
          "auto-detail-fe19580c0e36745bb924",
          "auto-graph-c40b643df6f08b5ef5f6",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-88557e30a3a34fe83792",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-folklore-tree-mds--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "Pseudoforests",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "3 · (3)",
      "rounds": "5",
      "roundClass": "constant",
      "parameters": "Source result (folklore-tree-mds), evaluated on its transformed instance: At most one cycle per component; no degree bound.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (folklore-tree-mds), evaluated on its transformed instance: Unweighted pseudoforest; each vertex initially knows its own degree. One-bit broadcasts suffice; identifiers are unnecessary. Isolated vertices are selected, and both endpoints of a two-vertex component are selected.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.\n\nThe source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only.",
      "paperId": "dory-arboricity-2022",
      "theorem": "Appendix A, Observation A.1 (forest construction); elementary pseudoforest extension proved here; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: The one-round non-leaf rule works on forests and, by the elementary extension below, on pseudoforests.",
      "verification": "derived",
      "sourceUrl": "https://arxiv.org/pdf/2206.05174#page=17",
      "year": 2022,
      "derivationNote": "The cited observation states the forest case. The pseudoforest scope is an elementary extension, with the same one-bit protocol and the proof given here; it is not attributed as a separate theorem in that paper.",
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "pseudoforest",
        "note": "The one-round non-leaf construction extends to this class by the elementary star-assignment proof in the result details."
      },
      "approximationDisplay": "3 · (3)",
      "roundsDisplay": "5",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted; non-leaf rule",
      "sourceVerification": "primary",
      "sourceResultId": "folklore-tree-mds",
      "parentResultId": "folklore-tree-mds",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "Pseudoforests",
      "sourceMath": {
        "rounds": "1",
        "roundsDisplay": "1",
        "roundsTex": "1",
        "roundsDisplayTex": "1",
        "approximation": "3",
        "approximationDisplay": "3",
        "approximationTex": "3",
        "approximationDisplayTex": "3",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "folklore-tree-mds",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "pseudoforest",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": "The source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only.",
          "multiplier": {
            "label": "3",
            "tex": "3",
            "graph": "pseudoforest"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "pseudoforest"
              ],
              "edges": []
            },
            "bound": {
              "graph": "pseudoforest",
              "label": "3",
              "tex": "3",
              "certificate": "Pseudoforests are minor-closed and their edge density is at most one."
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "5",
        "approximation": "3\\cdot\\bigl(3\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "5",
        "tex": "5",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://arxiv.org/pdf/2206.05174#page=17",
            "title": "Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs",
            "location": "Appendix A, Observation A.1 (forest construction); elementary pseudoforest extension proved here"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "folklore-tree-mds"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": true,
      "parameterDefinitions": [
        {
          "symbol": "OPT",
          "description": "Minimum cardinality of a feasible solution",
          "tex": "\\mathrm{OPT}"
        },
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "D",
          "description": "Vertex set selected by the algorithm",
          "tex": "D"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a92a23ddd7d97c52a4a2",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-e6baeb8325eebdc9f0ba"
        ],
        "assumptions": [
          "auto-assumption-effb829d587ccfd6a3f6"
        ],
        "detail": [
          "auto-detail-36479494074ad41ee009"
        ],
        "covered": [
          "auto-assumption-effb829d587ccfd6a3f6",
          "auto-detail-36479494074ad41ee009",
          "auto-graph-a92a23ddd7d97c52a4a2",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-e6baeb8325eebdc9f0ba",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-folklore-degree-mds--edge-domination-to-domination",
      "problem": "Edge dominating set",
      "variant": "Source algorithm: Unweighted; select all vertices",
      "objective": "min",
      "graphClass": "General",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(Δ_L) + 1",
      "rounds": "O((0) + 1)",
      "roundClass": "constant",
      "parameters": "Source result (folklore-degree-mds), evaluated on its transformed instance: Δ is the maximum degree; the algorithm need not know it.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.\n\nDomination on the line graph: exact instance substitutions n=m, Δ=Δ_L, m=m_L.",
      "assumptions": "Source result (folklore-degree-mds), evaluated on its transformed instance: Unweighted graphs. No identifiers, degree knowledge, or communication are needed.\n\nDomination on the line graph: A selected vertex of L(G) corresponds to the original edge. Feasibility and cardinality OPT agree; weighted transfer additionally requires an algorithm accepting the corresponding vertex weights. Assign each virtual edge-node to an endpoint. With unrestricted LOCAL messages, a virtual round routes through shared endpoints in at most two physical rounds; constant setup and output notification give O(T+1). The source algorithm must accept the line graph’s n′, Δ′, IDs and any supplied parameters. Obtaining global information is not free. A line graph can be much denser and need not preserve planarity: the line graph of a star is a clique. This recipe claims LOCAL only. Arbitrary different messages along virtual adjacencies can create congestion at physical edges, so an O(T) CONGEST simulation is not inferred. Exact algorithm substitutions use n′=m and Δ′=Δ_L, where Δ_L=max_{uv∈E(G)}(deg(u)+deg(v)−2). The displayed 2Δ−2 is an upper bound, not an exact substitution in a nonmonotone theorem. For simple G, m_L=sum_v binom(deg(v),2) is the exact number of edges of L(G). It is retained symbolically rather than replaced by a monotone upper bound. Apply the dominating-set algorithm to L(G); generic transfer is certified only from unrestricted general-graph LOCAL algorithms. Virtual line-graph rounds route through shared endpoints in at most two physical rounds. Retain global-input assumptions; setup and output notification are included. Here m=|E(G)| and Δ_L=max over uv∈E(G) of (deg(u)+deg(v)−2), the exact maximum degree of L(G); Δ_L≤2Δ−2. If m=0, return the empty edge set locally. For simple G, m_L=sum_v binom(deg(v),2) is the exact number of edges of L(G). It is retained symbolically rather than replaced by a monotone upper bound.\n\nThe source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only.",
      "paperId": "gen-aprsu10",
      "theorem": "Section 2, trivial dominating-set approximation; derived via edge-domination-to-domination",
      "summary": "Derived upper bound via Domination on the line graph. Original source: Selecting every vertex provides the elementary degree-dependent benchmark.",
      "verification": "derived",
      "sourceUrl": "https://jukkasuomela.fi/doc/weakly-coloured.pdf#page=3",
      "year": 2010,
      "problemScope": {
        "node": "edge-dominating-set"
      },
      "graphScope": {
        "node": "general"
      },
      "approximationDisplay": "(Δ_L) + 1",
      "roundsDisplay": "O((0) + 1)",
      "weightCondition": "weights-unweighted",
      "sourceVariant": "Unweighted; select all vertices",
      "sourceVerification": "primary",
      "sourceResultId": "folklore-degree-mds",
      "parentResultId": "folklore-degree-mds",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "General",
      "sourceMath": {
        "rounds": "0",
        "roundsDisplay": "0",
        "roundsTex": "0",
        "roundsDisplayTex": "0",
        "approximation": "Δ + 1",
        "approximationDisplay": "Δ + 1",
        "approximationTex": "\\Delta+1",
        "approximationDisplayTex": "\\Delta+1",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "edge-domination-to-domination"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "edge-domination-to-domination",
          "title": "Domination on the line graph",
          "inputResultId": "folklore-degree-mds",
          "outputProblem": "edge-dominating-set",
          "outputGraph": "general",
          "from": "edge-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {
            "n": "m",
            "Δ": "Δ_L",
            "m": "m_L"
          },
          "cost": "O(T+1)",
          "factor": "identity",
          "conditions": [
            "A selected vertex of L(G) corresponds to the original edge. Feasibility and cardinality OPT agree; weighted transfer additionally requires an algorithm accepting the corresponding vertex weights.",
            "Assign each virtual edge-node to an endpoint. With unrestricted LOCAL messages, a virtual round routes through shared endpoints in at most two physical rounds; constant setup and output notification give O(T+1).",
            "The source algorithm must accept the line graph’s n′, Δ′, IDs and any supplied parameters. Obtaining global information is not free.",
            "A line graph can be much denser and need not preserve planarity: the line graph of a star is a clique.",
            "This recipe claims LOCAL only. Arbitrary different messages along virtual adjacencies can create congestion at physical edges, so an O(T) CONGEST simulation is not inferred.",
            "Exact algorithm substitutions use n′=m and Δ′=Δ_L, where Δ_L=max_{uv∈E(G)}(deg(u)+deg(v)−2). The displayed 2Δ−2 is an upper bound, not an exact substitution in a nonmonotone theorem.",
            "For simple G, m_L=sum_v binom(deg(v),2) is the exact number of edges of L(G). It is retained symbolically rather than replaced by a monotone upper bound."
          ],
          "assumptions": [
            "Apply the dominating-set algorithm to L(G); generic transfer is certified only from unrestricted general-graph LOCAL algorithms.",
            "Virtual line-graph rounds route through shared endpoints in at most two physical rounds. Retain global-input assumptions; setup and output notification are included.",
            "Here m=|E(G)| and Δ_L=max over uv∈E(G) of (deg(u)+deg(v)−2), the exact maximum degree of L(G); Δ_L≤2Δ−2. If m=0, return the empty edge set locally.",
            "For simple G, m_L=sum_v binom(deg(v),2) is the exact number of edges of L(G). It is retained symbolically rather than replaced by a monotone upper bound."
          ],
          "source": {
            "title": "Suomela, Distributed Algorithms for Edge Dominating Sets",
            "url": "https://jukkasuomela.fi/doc/eds.pdf#page=1",
            "location": "Section 1.1 (line-graph correspondence); LOCAL simulation specified here"
          },
          "modelConversion": "The source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only."
        }
      ],
      "derivedMath": {
        "rounds": "O\\!\\left(\\bigl(0\\bigr)+1\\right)",
        "approximation": "\\Delta_L+1"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "O((0) + 1)",
        "tex": "O\\!\\left(\\bigl(0\\bigr)+1\\right)",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Domination on the line graph.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/weakly-coloured.pdf#page=3",
            "title": "Local algorithms in (weakly) coloured graphs",
            "location": "Section 2, trivial dominating-set approximation"
          },
          {
            "url": "https://jukkasuomela.fi/doc/eds.pdf#page=1",
            "title": "Suomela, Distributed Algorithms for Edge Dominating Sets",
            "location": "Section 1.1 (line-graph correspondence); LOCAL simulation specified here"
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "folklore-degree-mds"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "OPT",
          "description": "Minimum cardinality of a feasible solution",
          "tex": "\\mathrm{OPT}"
        },
        {
          "symbol": "m_L",
          "description": "Number of edges of the line graph L(G)",
          "tex": "m_L"
        },
        {
          "symbol": "Δ_L",
          "description": "Maximum degree of the line graph L(G)",
          "tex": "\\Delta_L"
        },
        {
          "symbol": "D",
          "description": "Vertex set selected by the algorithm",
          "tex": "D"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-unweighted"
        ],
        "parameters": [
          "auto-parameter-af4c082dcc79eba8a80c"
        ],
        "assumptions": [
          "auto-assumption-52f256415b7263f3baa1"
        ],
        "detail": [
          "auto-detail-609f5fa207e771a76a73"
        ],
        "covered": [
          "auto-assumption-52f256415b7263f3baa1",
          "auto-detail-609f5fa207e771a76a73",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c9185b7551a9732c9cf5",
          "auto-parameter-af4c082dcc79eba8a80c",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-folklore-degree-mds--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "General",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (Δ + 1)",
      "rounds": "4",
      "roundClass": "constant",
      "parameters": "Source result (folklore-degree-mds), evaluated on its transformed instance: Δ is the maximum degree; the algorithm need not know it.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (folklore-degree-mds), evaluated on its transformed instance: Unweighted graphs. No identifiers, degree knowledge, or communication are needed.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.\n\nThe source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only.",
      "paperId": "gen-aprsu10",
      "theorem": "Section 2, trivial dominating-set approximation; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: Selecting every vertex provides the elementary degree-dependent benchmark.",
      "verification": "derived",
      "sourceUrl": "https://jukkasuomela.fi/doc/weakly-coloured.pdf#page=3",
      "year": 2010,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "general"
      },
      "approximationDisplay": "(1 + 2∇₁) · (Δ + 1)",
      "roundsDisplay": "4",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted; select all vertices",
      "sourceVerification": "primary",
      "sourceResultId": "folklore-degree-mds",
      "parentResultId": "folklore-degree-mds",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "General",
      "sourceMath": {
        "rounds": "0",
        "roundsDisplay": "0",
        "roundsTex": "0",
        "roundsDisplayTex": "0",
        "approximation": "Δ + 1",
        "approximationDisplay": "Δ + 1",
        "approximationTex": "\\Delta+1",
        "approximationDisplayTex": "\\Delta+1",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "folklore-degree-mds",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "general",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": "The source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only.",
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "general"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(\\Delta+1\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "4",
        "tex": "4",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://jukkasuomela.fi/doc/weakly-coloured.pdf#page=3",
            "title": "Local algorithms in (weakly) coloured graphs",
            "location": "Section 2, trivial dominating-set approximation"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "folklore-degree-mds"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "OPT",
          "description": "Minimum cardinality of a feasible solution",
          "tex": "\\mathrm{OPT}"
        },
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "D",
          "description": "Vertex set selected by the algorithm",
          "tex": "D"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-a3136e606c6eb1327041",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-a98fee40ff9def4f93d2"
        ],
        "assumptions": [
          "auto-assumption-8de2c9a44dbb614c812e"
        ],
        "detail": [
          "auto-detail-609f5fa207e771a76a73"
        ],
        "covered": [
          "auto-assumption-8de2c9a44dbb614c812e",
          "auto-detail-609f5fa207e771a76a73",
          "auto-graph-a3136e606c6eb1327041",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-a98fee40ff9def4f93d2",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    },
    {
      "id": "derived-folklore-star-minor-mds--connected-domination-via-mds",
      "problem": "Connected dominating set",
      "variant": "Unweighted",
      "objective": "min",
      "graphClass": "K₁,ₜ-minor-free",
      "model": "LOCAL",
      "randomization": "Deterministic",
      "bound": "upper",
      "approximation": "(1 + 2∇₁) · (t)",
      "rounds": "4",
      "roundClass": "constant",
      "parameters": "Source result (folklore-star-minor-mds), evaluated on its transformed instance: Integer t ≥ 2; the algorithm need not know t.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "assumptions": "Source result (folklore-star-minor-mds), evaluated on its transformed instance: Unweighted. No identifiers, degree knowledge, or communication are needed.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.\n\nThe source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only.",
      "paperId": "pic-bgpw-large-2025",
      "theorem": "Table 1 and footnote 4; derived via connected-domination-via-mds",
      "summary": "Derived upper bound via Connect a dominating set locally. Original source: The excluded-star condition bounds the cost of selecting all vertices.",
      "verification": "derived",
      "sourceUrl": "https://dept-info.labri.fr/~gavoille/article/BGPW25.pdf#page=3",
      "year": 2025,
      "problemScope": {
        "node": "connected-dominating-set"
      },
      "graphScope": {
        "node": "star-minor"
      },
      "approximationDisplay": "(1 + 2∇₁) · (t)",
      "roundsDisplay": "4",
      "weightCondition": "weights-unweighted",
      "approximationBenchmark": "integral",
      "inputConditions": [
        "input-connected",
        "input-distinct-ids"
      ],
      "sourceVariant": "Unweighted; select all vertices",
      "sourceVerification": "primary",
      "sourceResultId": "folklore-star-minor-mds",
      "parentResultId": "folklore-star-minor-mds",
      "sourceProblem": "Dominating set",
      "sourceGraphClass": "K₁,ₜ-minor-free",
      "sourceMath": {
        "rounds": "0",
        "roundsDisplay": "0",
        "roundsTex": "0",
        "roundsDisplayTex": "0",
        "approximation": "t",
        "approximationDisplay": "t",
        "approximationTex": "t",
        "approximationDisplayTex": "t",
        "approximationBenchmark": null
      },
      "reductionPath": [
        "connected-domination-via-mds"
      ],
      "reductionDirection": "upper",
      "reductionSteps": [
        {
          "id": "connected-domination-via-mds",
          "title": "Connect a dominating set locally",
          "inputResultId": "folklore-star-minor-mds",
          "outputProblem": "connected-dominating-set",
          "outputGraph": "star-minor",
          "from": "connected-dominating-set",
          "to": "dominating-set",
          "direction": "upper",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "conditions": [
            "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
            "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
            "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
            "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
            "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
            "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
            "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
          ],
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ],
          "source": {
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          },
          "modelConversion": "The source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only.",
          "multiplier": {
            "label": "1 + 2∇₁",
            "tex": "1+2\\nabla_1"
          },
          "multiplierCertificate": {
            "source": {
              "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
              "url": "https://arxiv.org/html/1702.02848v2#S5",
              "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
            },
            "graphPath": {
              "nodes": [
                "star-minor"
              ],
              "edges": []
            },
            "bound": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            }
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ]
        }
      ],
      "derivedMath": {
        "rounds": "4",
        "approximation": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(t\\bigr)"
      },
      "roundComplexityDetails": {
        "status": "explicit",
        "formula": "4",
        "tex": "4",
        "basis": "reduction",
        "explanation": "The atlas applies the exact instance substitutions and communication cost of the reduction: Connect a dominating set locally.",
        "evidence": [
          {
            "url": "https://dept-info.labri.fr/~gavoille/article/BGPW25.pdf#page=3",
            "title": "Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors",
            "location": "Table 1 and footnote 4"
          },
          {
            "url": "https://arxiv.org/html/1702.02848v2#S5",
            "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
            "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
          }
        ],
        "parameters": [],
        "checked": "2026-11-16",
        "audited": false,
        "sourceBasis": "recorded",
        "derivedFrom": "folklore-star-minor-mds"
      },
      "frontierStatus": "unreviewed",
      "constantApproximation": false,
      "parameterDefinitions": [
        {
          "symbol": "OPT",
          "description": "Minimum cardinality of a feasible solution",
          "tex": "\\mathrm{OPT}"
        },
        {
          "symbol": "∇₁",
          "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis",
          "tex": "\\nabla_1"
        },
        {
          "symbol": "D",
          "description": "Vertex set selected by the algorithm",
          "tex": "D"
        },
        {
          "symbol": "m",
          "description": "Number of edges in the original communication graph",
          "tex": "m"
        },
        {
          "symbol": "n",
          "description": "Number of vertices in the original communication graph",
          "tex": "n"
        },
        {
          "symbol": "t",
          "description": "Number of leaves in the excluded star K_{1,t}",
          "tex": "t"
        },
        {
          "symbol": "Δ",
          "description": "Maximum degree of the original communication graph",
          "tex": "\\Delta"
        }
      ],
      "setting": {
        "summary": [
          "auto-graph-f5f624e676f5e722507d",
          "weights-unweighted",
          "input-connected",
          "input-distinct-ids"
        ],
        "parameters": [
          "auto-parameter-5f6daa5e2fae4fedc9cf"
        ],
        "assumptions": [
          "auto-assumption-d7bc4e586d62a195bfd4"
        ],
        "detail": [
          "auto-detail-609f5fa207e771a76a73"
        ],
        "covered": [
          "auto-assumption-d7bc4e586d62a195bfd4",
          "auto-detail-609f5fa207e771a76a73",
          "auto-graph-f5f624e676f5e722507d",
          "auto-model-0109be7e98692221e7ec",
          "auto-model-557b5d489bacf2f8f758",
          "auto-output-c3aa2eb288e53d5419d5",
          "auto-parameter-5f6daa5e2fae4fedc9cf",
          "detail-integral-benchmark",
          "input-connected",
          "input-distinct-ids",
          "weights-unweighted"
        ]
      }
    }
  ],
  "notation": {
    "(1 − ε)(g − 1)/g of OPT": "(1-\\varepsilon)\\frac{g-1}{g}\\,\\mathrm{OPT}",
    "(2α + 1)(1 + ε)": "(2\\alpha+1)(1+\\varepsilon)",
    "(Δ + 1)/2": "\\frac{\\Delta+1}{2}",
    "1 + 1 / logᵈ n": "1+\\frac{1}{\\log^d n}",
    "1 + O(1 / log n)": "1+O\\!\\left(\\frac{1}{\\log n}\\right)",
    "1 + O(1 / logᵏ n)": "1+O\\!\\left(\\frac{1}{\\log^k n}\\right)",
    "1 + o(1)": "1 + o(1)",
    "1 + δ against fractional OPT": "1+\\delta\\;\\text{against fractional OPT}",
    "1 + ε": "1 + \\varepsilon",
    "1 + ε in expectation": "1+\\varepsilon\\;\\text{in expectation}",
    "1 / (1 + ε)": "\\frac{1}{1+\\varepsilon}",
    "1 round": "1\\text{ round}",
    "1 − 1/(k + 1)": "1-\\frac{1}{k+1}",
    "1 − O(1 / log n)": "1-O\\!\\left(\\frac{1}{\\log n}\\right)",
    "1 − O(1 / logᵏ n)": "1-O\\!\\left(\\frac{1}{\\log^k n}\\right)",
    "1 − o(1)": "1 - o(1)",
    "1 − ε": "1 - \\varepsilon",
    "1 − ε of OPT": "(1-\\varepsilon)\\,\\mathrm{OPT}",
    "1 − ε of fractional OPT": "(1-\\varepsilon)\\,\\mathrm{OPT}_{\\mathrm{frac}}",
    "1/(1 + ε) of OPT": "\\frac{1}{1+\\varepsilon}\\,\\mathrm{OPT}",
    "1/(1+ε) of fractional OPT": "\\frac{1}{1+\\varepsilon}\\,\\mathrm{OPT}_{\\mathrm{frac}}",
    "1/(2 + ε) of OPT": "\\frac{1}{2+\\varepsilon}\\,\\mathrm{OPT}",
    "1/(2+ε) of OPT": "\\frac{1}{2+\\varepsilon}\\,\\mathrm{OPT}",
    "1/2 of OPT": "\\frac{1}{2}\\,\\mathrm{OPT}",
    "1/Δ of OPT": "\\frac{1}{\\Delta}\\,\\mathrm{OPT}",
    "10": "10",
    "11 + ε": "11 + \\varepsilon",
    "130": "130",
    "16": "16",
    "18": "18",
    "19 if k = 2; 3k/(k−2) + 1 if k > 2": "\\begin{cases}19 & k=2,\\\\ \\frac{3k}{k-2}+1 & k>2.\\end{cases}",
    "2": "2",
    "2 + (log Δ)⁻ᶜ": "2+(\\log\\Delta)^{-c}",
    "2 + ε": "2 + \\varepsilon",
    "20": "20",
    "2a + 1 against fractional OPT": "2a+1\\;\\text{against fractional OPT}",
    "2a against fractional OPT": "2a\\;\\text{against fractional OPT}",
    "2a(𝒞) + 1 + ε": "2a(\\mathcal{C})+1+\\varepsilon",
    "2k f(k) + 1": "2k f(k) + 1",
    "2t − 1": "2t - 1",
    "2Δ + 1": "2\\Delta  + 1",
    "2ᴼ⁽¹⁄ε⁾ · (log(ΔW) + log² Δ + log* n) · log³(1/δ)": "2^{O(1/\\varepsilon)}\\bigl(\\log(\\Delta W)+\\log^2\\Delta+\\log^*n\\bigr)\\log^3(1/\\delta)",
    "2ᴼ⁽¹⁄ε⁾ · polylog n": "2^{O(1/\\varepsilon)}\\operatorname{polylog}n",
    "3": "3",
    "302": "302",
    "32": "32",
    "34 + ε": "34 + \\varepsilon",
    "34.01(d + 1)": "34.01(d + 1)",
    "35(d + 1)": "35(d + 1)",
    "3k": "3k",
    "4 + ε against fractional OPT": "4+\\varepsilon\\;\\text{against fractional OPT}",
    "5": "5",
    "5 + ε": "5 + \\varepsilon",
    "5 against fractional OPT": "5\\;\\text{against fractional OPT}",
    "50": "50",
    "52": "52",
    "6": "6",
    "6 + η": "6 + \\eta",
    "694": "694",
    "7": "7",
    "7 + ε": "7 + \\varepsilon",
    "7 against fractional OPT": "7\\;\\text{against fractional OPT}",
    "8 + ε": "8 + \\varepsilon",
    "C(d,g,r)": "C(d,g,r)",
    "C(g)": "C(g)",
    "C(g,a,ε)": "C(g,a,\\varepsilon )",
    "C(g,k)": "C(g,k)",
    "Constant or polylogarithmic factor": "\\text{Constant or polylogarithmic factor}",
    "No (2r + 1 − δ)-approximation": "\\text{No }(2r+1-\\delta)\\text{-approximation}",
    "No (4 − ε)-approximation": "\\text{No }(4-\\varepsilon)\\text{-approximation}",
    "No (5 − ε)-approximation": "\\text{No }(5-\\varepsilon)\\text{-approximation}",
    "No (7 − ε)-approximation": "\\text{No }(7-\\varepsilon)\\text{-approximation}",
    "No (k/(k − 2) − ε)-approximation": "\\text{No }\\left(\\frac{k}{k-2}-\\varepsilon\\right)\\text{-approximation}",
    "No factor smaller than Δ": "\\text{No factor smaller than }\\Delta",
    "No o(k + f(k)^(k/(k+1)))-approximation": "\\text{No }o\\!\\left(k+f(k)^{\\frac{k}{k+1}}\\right)\\text{-approximation}",
    "No ratio < 2r + 1": "\\text{No ratio }<2r+1",
    "No ratio < 4 − 1/⌊Δ/2⌋": "\\text{No ratio }<4-\\frac{1}{\\lfloor\\Delta/2\\rfloor}",
    "O(1)": "O(1)",
    "O(1) rounds ruled out": "O(1)\\text{ rounds ruled out}",
    "O(1)-round impossibility": "O(1)\\text{-round impossibility}",
    "O(T_MIS + ε⁻O(1) log* n)": "O\\!\\left(T_{\\mathrm{MIS}}+\\varepsilon^{-O(1)}\\log^*n\\right)",
    "O(f²k² + fk log* W)": "O(f^2k^2+fk\\log^*W)",
    "O(k + f(k)^(k/(k+1)))": "O\\!\\left(k+f(k)^{\\frac{k}{k+1}}\\right)",
    "O(k)": "O(k)",
    "O(log n / log² log n)": "O\\!\\left(\\frac{\\log n}{(\\log\\log n)^2}\\right)",
    "O(log n · log Δ / log² log Δ)": "O\\!\\left(\\frac{\\log n\\,\\log\\Delta}{(\\log\\log\\Delta)^2}\\right)",
    "O(log n)": "O(\\log n)",
    "O(log n/log² log n + log n · log(1/ε)/log³ log n)": "O\\!\\left(\\frac{\\log n}{(\\log\\log n)^2}+\\frac{\\log n\\,\\log(1/\\varepsilon)}{(\\log\\log n)^3}\\right)",
    "O(log Δ / (ε log log Δ))": "O\\!\\left(\\frac{\\log\\Delta}{\\varepsilon\\log\\log\\Delta}\\right)",
    "O(log Δ / log log Δ)": "O\\!\\left(\\frac{\\log\\Delta}{\\log\\log\\Delta}\\right)",
    "O(log Δ)": "O(\\log \\Delta )",
    "O(log Δ) in expectation": "O(\\log\\Delta)\\;\\text{in expectation}",
    "O(log(ΔW) / ε²)": "O\\!\\left(\\frac{\\log(\\Delta W)}{\\varepsilon^2}\\right)",
    "O(log(ΔW)/ε² + (log² Δ + log* n)/ε)": "O\\!\\left(\\frac{\\log(\\Delta W)}{\\varepsilon^2}+\\frac{\\log^2\\Delta+\\log^*n}{\\varepsilon}\\right)",
    "O(log* n / ε)": "O\\!\\left(\\frac{\\log^*n}{\\varepsilon}\\right)",
    "O(log* n)": "O(\\log^* n)",
    "O(log² Δ) total; O(log Δ) awake": "O(\\log^2\\Delta)\\text{ total};\\quad O(\\log\\Delta)\\text{ awake}",
    "O(log²(β/ε)/ε + log* n)": "O\\!\\left(\\frac{\\log^2(\\beta/\\varepsilon)}{\\varepsilon}+\\log^*n\\right)",
    "O(log³ β · log(1/ε) · log n / ε²)": "O\\!\\left(\\frac{\\log^3\\beta\\,\\log(1/\\varepsilon)\\,\\log n}{\\varepsilon^2}\\right)",
    "O(logᴰ⁽ᵏ⁾ n)": "O\\!\\left(\\log^{D(k)}n\\right)",
    "O(r f(r))": "O(r f(r))",
    "O(r)": "O(r)",
    "O(r² log n)": "O(r^2\\log n)",
    "O(Γd · log Γₚ / ε²)": "O\\!\\left(\\frac{\\Gamma_d\\,\\log\\Gamma_p}{\\varepsilon^2}\\right)",
    "O(Δ + log* W)": "O(\\Delta  + \\log^* W)",
    "O(Δ + log* n)": "O(\\Delta  + \\log^* n)",
    "O(α log n)": "O(\\alpha  \\log n)",
    "O(α log Δ / log log Δ)": "O\\!\\left(\\frac{\\alpha\\log\\Delta}{\\log\\log\\Delta}\\right)",
    "O(α log Δ)": "O(\\alpha  \\log \\Delta )",
    "O(α)": "O(\\alpha )",
    "O(α²)": "O(\\alpha^2)",
    "O(ε⁻² log² n)": "O(\\varepsilon^{-2}\\log^2n)",
    "O(ε⁻¹ log Δ)": "O(\\varepsilon^{-1}\\log\\Delta)",
    "O(ε⁻¹ log* n) + ε⁻O(1)": "O(\\varepsilon^{-1}\\log^*n)+\\varepsilon^{-O(1)}",
    "O(ε⁻⁴ · MM(ε⁻² n))": "O\\!\\left(\\varepsilon^{-4}\\,\\mathrm{MM}(\\varepsilon^{-2}n)\\right)",
    "O(√g + 1)": "O(\\sqrt{g}+1)",
    "OPT": "\\mathrm{OPT}",
    "O_d,∇₁,ε(1)": "O_{d,\\nabla_1,\\varepsilon}(1)",
    "O_g,ε(1)": "O_{g,\\varepsilon}(1)",
    "O_g,η(1)": "O_{g,\\eta}(1)",
    "O_Δ(1)": "O_\\Delta(1)",
    "O_Δ,ε(1)": "O_{\\Delta,\\varepsilon}(1)",
    "O_ε(1)": "O_\\varepsilon(1)",
    "O_𝒞,ε(1)": "O_{\\mathcal{C},\\varepsilon}(1)",
    "Oε,ᴸ,𝗀(log* n)": "O_{\\varepsilon,L,g}(\\log^*n)",
    "Oε,꜀(log* n)": "O_{\\varepsilon,c}(\\log^*n)",
    "Oε,𝗀(log* n)": "O_{\\varepsilon,g}(\\log^*n)",
    "Oρ,ᵦ,δ(1)": "O_{\\rho,b,\\delta}(1)",
    "Oρ,ᵦ,ε(1)": "O_{\\rho,b,\\varepsilon}(1)",
    "Oρ,ᵦ,ε(log* n)": "O_{\\rho,b,\\varepsilon}(\\log^*n)",
    "Oᵦ,ε(1)": "O_{b,\\varepsilon}(1)",
    "Oₐ(1)": "O_a(1)",
    "Oₑ(1)": "O_e(1)",
    "Oₖ(1)": "O_k(1)",
    "Oₖ,ε(log* n)": "O_{k,\\varepsilon}(\\log^*n)",
    "Oₖ,ₜ(1)": "O_{k,t}(1)",
    "Oₖ,ₜ,ε(log* n)": "O_{k,t,\\varepsilon}(\\log^*n)",
    "Oₖ,𝗀(1)": "O_{k,g}(1)",
    "Oₖ,𝗀,ε(log* n)": "O_{k,g,\\varepsilon}(\\log^*n)",
    "Oₜ(1)": "O_t(1)",
    "O꜀,ₖ,ₜ,ε(log* n)": "O_{c,k,t,\\varepsilon}(\\log^*n)",
    "O𝗀(1)": "O_g(1)",
    "Within factor 1 + ε": "\\text{Within factor }1+\\varepsilon",
    "d + 1 + ε": "d + 1 + \\varepsilon",
    "f": "f",
    "f(g, ε)": "f\\bigl(g,\\varepsilon\\bigr)",
    "f(n) · T(n) = Ω(log* n)": "f(n)\\,T(n)=\\Omega(\\log^*n)",
    "f(n)-approximation": "f(n)\\text{-approximation}",
    "f(Δ, …)": "f(\\Delta,\\ldots)",
    "g": "g",
    "k": "k",
    "k / (k − 2)": "\\frac{k}{k-2}",
    "k − 1": "k - 1",
    "log n": "\\log n",
    "log(min{1/w_min, n/ε})ᴼ⁽¹⁄ε⁾ · (Δᴼ⁽¹⁄ε⁾ + log* n)": "\\log^{O(1/\\varepsilon)}\\!\\left(\\min\\left\\{\\frac{1}{w_{\\min}},\\frac{n}{\\varepsilon}\\right\\}\\right)\\left(\\Delta^{O(1/\\varepsilon)}+\\log^*n\\right)",
    "log* n": "\\log^*n",
    "n": "n",
    "poly(1/ε, log n)": "\\operatorname{poly}(1/\\varepsilon,\\log n)",
    "poly(log n / ε)": "\\operatorname{poly}(\\log n/\\varepsilon)",
    "poly(log n, 1/ε)": "\\operatorname{poly}(\\log n,1/\\varepsilon)",
    "poly(log n, ε⁻¹) · 2ᴼ⁽√ˡᵒᵍ ⁿ⁾": "\\operatorname{poly}(\\log n,\\varepsilon^{-1})\\,2^{O(\\sqrt{\\log n})}",
    "polylog n": "\\operatorname{polylog}n",
    "t": "t",
    "Δ": "\\Delta",
    "Δᴼ⁽¹⁄ε⁾ + O(ε⁻²) log* n": "\\Delta^{O(1/\\varepsilon)}+O(\\varepsilon^{-2})\\log^*n",
    "Ω(log n / ε)": "\\Omega\\!\\left(\\frac{\\log n}{\\varepsilon}\\right)",
    "Ω(log Δ / log log Δ)": "\\Omega\\!\\left(\\frac{\\log\\Delta}{\\log\\log\\Delta}\\right)",
    "Ω(log* n / ε)": "\\Omega\\!\\left(\\frac{\\log^*n}{\\varepsilon}\\right)",
    "Ω(log* n)": "\\Omega (\\log^* n)",
    "α": "\\alpha",
    "ε": "\\varepsilon",
    "ρ": "\\rho",
    "≥ (1−ε) w(V)/(2β+1)": "\\geq\\frac{(1-\\varepsilon)\\,w(V)}{2\\beta+1}",
    "≥ (1−ε) w(V)/(4β)": "\\geq\\frac{(1-\\varepsilon)\\,w(V)}{4\\beta}",
    "f(": "f(",
    ")": ")",
    "f(parameters)": "f(\\text{parameters})",
    "No ratio < 2t + 1": "\\text{No ratio }<2t+1",
    "No (2 pw(H) − 1 − ε)-approximation": "\\text{No }(2\\operatorname{pw}(H)-1-\\varepsilon)\\text{-approximation}",
    "0": "0",
    "1": "1",
    "Δ + 1": "\\Delta+1",
    "|D| ≤ 3 OPT": "\\lvert D\\rvert\\le 3\\,\\mathrm{OPT}",
    "|D| ≤ (Δ + 1) OPT": "\\lvert D\\rvert\\le (\\Delta+1)\\,\\mathrm{OPT}",
    "|D| ≤ t OPT": "\\lvert D\\rvert\\le t\\,\\mathrm{OPT}",
    "|D| ≤ 2 OPT": "\\lvert D\\rvert\\le 2\\,\\mathrm{OPT}",
    "|D| ≤ 6 OPT": "\\lvert D\\rvert\\le 6\\,\\mathrm{OPT}",
    "O(log Δ / log log Δ + log(1/ε) · log Δ / log² log Δ)": "O\\!\\left(\\frac{\\log\\Delta}{\\log\\log\\Delta}+\\frac{\\log(1/\\varepsilon)\\,\\log\\Delta}{(\\log\\log\\Delta)^2}\\right)",
    "O(log(2/ε) + log Δ / log log Δ + min{log Δ, log(2/ε) · (log Δ)^0.001})": "O\\!\\left(\\log(2/\\varepsilon)+\\frac{\\log\\Delta}{\\log\\log\\Delta}+\\min\\{\\log\\Delta,\\log(2/\\varepsilon)(\\log\\Delta)^{0.001}\\}\\right)",
    "24g + O(1)": "24g+O(1)",
    "12g + O(1)": "12g+O(1)",
    "6c²t + (2t + 5)c + 4": "6c^2t+(2t+5)c+4",
    "OPT_f": "\\mathrm{OPT}_{f}",
    "205": "205",
    "616": "616",
    "O_H(1)": "O_H(1)",
    "C(d,g,a,r)": "C(d,g,a,r)",
    "((1 + 1/ε)d + 1)² + 1": "\\bigl((1+1/\\varepsilon)d+1\\bigr)^2+1",
    "k^{O(k)}": "k^{O(k)}",
    "t − 1": "t-1",
    "|D| = OPT": "|D|=\\mathrm{OPT}",
    "Ω(min{√(log n / log log n), log Δ / log log Δ})": "\\Omega\\!\\left(\\min\\!\\left\\{\\sqrt{\\frac{\\log n}{\\log\\log n}},\\frac{\\log\\Delta}{\\log\\log\\Delta}\\right\\}\\right)",
    "≤ 6": "\\le 6",
    "≤ 2": "\\le 2",
    "≤ 11": "\\le 11",
    "≤ 10": "\\le 10",
    "≤ 7": "\\le 7",
    "K₃,ₜ": "K_{3,t}",
    "t ≥ 3": "t\\ge 3",
    "c ≥ ∇₁(G)": "c\\ge\\nabla_1(G)",
    "∇₁(G)": "\\nabla_1(G)",
    "|E(H)|/|V(H)|": "\\lvert E(H)\\rvert/\\lvert V(H)\\rvert",
    "c=⌈∇₁(G)⌉": "c=\\lceil\\nabla_1(G)\\rceil",
    "O_C,k,t,ε(log* n)": "O_{C,k,t,\\varepsilon}(\\log^*n)",
    "≤ 4": "\\le 4",
    "H = K₂,t": "H=K_{2,t}",
    "K₂,t": "K_{2,t}",
    "∇₁": "\\nabla_1",
    "H": "H",
    "c": "c",
    "G": "G",
    "h": "h",
    "r": "r",
    "f(n)": "f(n)",
    "T": "T",
    "T(n)": "T(n)",
    "T_MIS": "T_{\\mathrm{MIS}}",
    "D(k)": "D(k)",
    "D": "D",
    "m": "m",
    "d": "d",
    "W": "W",
    "B": "B",
    "w_min": "w_{\\min}",
    "δ": "\\delta",
    "ε₀": "\\varepsilon_0",
    "𝒞": "\\mathcal{C}",
    "a(𝒞)": "a(\\mathcal{C})",
    "a": "a",
    "b": "b",
    "C": "C",
    "C(r)": "C(r)",
    "β": "\\beta",
    "w": "w",
    "w(V)": "w(V)",
    "Γₚ": "\\Gamma_p",
    "Γd": "\\Gamma_d",
    "A": "A",
    "Aᵢⱼ": "A_{ij}",
    "i": "i",
    "j": "j",
    "MM": "\\mathrm{MM}",
    "N": "N",
    "ρ*(v)": "\\rho^*(v)",
    "v": "v",
    "γ": "\\gamma",
    "f(r)": "f(r)",
    "γ₁(G)": "\\gamma_1(G)",
    "γₖ(G)": "\\gamma_k(G)",
    "f(k)": "f\\bigl(k\\bigr)",
    "g(r)": "g(r)",
    "f(v)": "f(v)",
    "b(v)": "b(v)",
    "L": "L",
    "pw(H)": "\\operatorname{pw}(H)",
    "p": "p",
    "Constant": "\\text{Constant}",
    "Constant rounds ruled out": "\\text{Constant rounds ruled out}",
    "Constant-round impossibility": "\\text{Constant-round impossibility}",
    "f(∇₁)": "f\\bigl(\\nabla_1\\bigr)",
    "f(ε)": "f\\bigl(\\varepsilon\\bigr)",
    "> 5 − ε": "> 5-\\varepsilon",
    "f(h)": "f\\bigl(h\\bigr)",
    "F(r, f)": "F\\bigl(r,f\\bigr)",
    "> 4 − ε": "> 4-\\varepsilon",
    "> k/(k − 2) − ε": "> \\frac{k}{k-2}-\\varepsilon",
    "> 7 − ε": "> 7-\\varepsilon",
    "1/Δ": "\\frac{1}{\\Delta}",
    "1/2": "\\frac{1}{2}",
    "1/(2 + ε)": "\\frac{1}{2+\\varepsilon}",
    "1/(1 + ε)": "\\frac{1}{1+\\varepsilon}",
    "(1 − ε)(g − 1)/g": "(1-\\varepsilon)\\frac{g-1}{g}",
    "f(Δ, ε)": "f\\bigl(\\Delta,\\varepsilon\\bigr)",
    "≥ 4 − 1/⌊Δ/2⌋": "\\ge 4-\\frac{1}{\\lfloor\\Delta/2\\rfloor}",
    "f(Δ)": "f\\bigl(\\Delta\\bigr)",
    "f(Δ) rounds ruled out": "f\\bigl(\\Delta\\bigr)\\text{ rounds ruled out}",
    "f(𝒞, ε)": "f\\bigl(\\mathcal{C},\\varepsilon\\bigr)",
    "≥ 2r + 1": "\\ge 2r+1",
    "f(r, ε)": "f\\bigl(r,\\varepsilon\\bigr)",
    "f(r, ε) rounds ruled out": "f\\bigl(r,\\varepsilon\\bigr)\\text{ rounds ruled out}",
    "6 + ε": "6 + \\varepsilon",
    "f(d, ∇₁, ε)": "f\\bigl(d,\\nabla_1,\\varepsilon\\bigr)",
    "2a + 1": "2a+1",
    "f(a)": "f\\bigl(a\\bigr)",
    "f(g)": "f\\bigl(g\\bigr)",
    "2a": "2a",
    "4 + ε": "4+\\varepsilon",
    "f(b, ε)": "f\\bigl(b,\\varepsilon\\bigr)",
    "1 + ε against fractional OPT": "1+\\varepsilon\\;\\text{against fractional OPT}",
    "f(ρ, b, ε)": "f\\bigl(\\rho,b,\\varepsilon\\bigr)",
    "1/(1+ε)": "\\frac{1}{1+\\varepsilon}",
    "1/(2+ε)": "\\frac{1}{2+\\varepsilon}",
    "f(g, a, ε)": "f\\bigl(g,a,\\varepsilon\\bigr)",
    "f(d, g, r)": "f\\bigl(d,g,r\\bigr)",
    "f(g, k)": "f\\bigl(g,k\\bigr)",
    "f(t)": "f\\bigl(t\\bigr)",
    "No (2r + 1 − ε)-approximation": "\\text{No }(2r+1-\\varepsilon)\\text{-approximation}",
    "> 2r + 1 − ε": "> 2r+1-\\varepsilon",
    "f(k, t)": "f\\bigl(k,t\\bigr)",
    "Ω(k + f(k)^(k/(k+1)))": "\\Omega\\!\\left(k+f(k)^{\\frac{k}{k+1}}\\right)",
    "F(k, f(k))": "F\\bigl(k,f\\bigl(k\\bigr)\\bigr)",
    "F(k, f(k)) rounds ruled out": "F\\bigl(k,f\\bigl(k\\bigr)\\bigr)\\text{ rounds ruled out}",
    "≥ Δ": "\\ge \\Delta",
    "> 2 pw(H) − 1 − ε": "> 2\\operatorname{pw}(H)-1-\\varepsilon",
    "f(H, ε)": "f\\bigl(H,\\varepsilon\\bigr)",
    "f(H, ε) rounds ruled out": "f\\bigl(H,\\varepsilon\\bigr)\\text{ rounds ruled out}",
    "≥ 2t + 1": "\\ge 2t+1",
    "f(t) rounds ruled out": "f\\bigl(t\\bigr)\\text{ rounds ruled out}",
    "f(d, g, a, r)": "f\\bigl(d,g,a,r\\bigr)",
    "f(H)": "f\\bigl(H\\bigr)",
    "O(log log n · log* n · (log n)^(d+1)), where d = log 3 / log(12/11)": "O\\!\\left(\\log\\log n\\cdot\\log^* n\\cdot(\\log n)^{d+1}\\right),\\qquad d=\\frac{\\log 3}{\\log(12/11)}",
    "O(Δ Σ_{i=1}^{K} (2i−1)(Δ−1)^{i−1}) for Δ ≥ 2, where K = ceil(1/ε); constant for Δ ≤ 1": "O\\!\\left(\\Delta\\sum_{i=1}^{K}(2i-1)(\\Delta-1)^{i-1}\\right)\\ (\\Delta\\ge 2),\\qquad K=\\lceil 1/\\varepsilon\\rceil",
    "Any T(Δ) independent of n": "\\text{Any }T\\bigl(\\Delta\\bigr)\\text{ independent of }n",
    "T + δ + 2, where T = F(2u+2ρ) + max{u+ρ, b}": "T+\\delta+2,\\qquad T=F(2u+2\\rho)+\\max\\{u+\\rho,b\\}",
    "Any T(r, ε) independent of n": "\\text{Any }T\\bigl(r,\\varepsilon\\bigr)\\text{ independent of }n",
    "O(t)": "O(t)",
    "T + δ + 2, where T = F(2u+2) + max{u+1, b}": "T+\\delta+2,\\qquad T=F(2u+2)+\\max\\{u+1,b\\}",
    "Any T(k, f(k)) independent of n": "\\text{Any }T\\bigl(k,f\\bigl(k\\bigr)\\bigr)\\text{ independent of }n",
    "Any T(H, ε) independent of n": "\\text{Any }T\\bigl(H,\\varepsilon\\bigr)\\text{ independent of }n",
    "Any T(t) independent of n": "\\text{Any }T\\bigl(t\\bigr)\\text{ independent of }n",
    "O((g+1)(F_g(10)+6))": "O\\!\\left((g+1)(F_g(10)+6)\\right)",
    "T + 1": "T+1",
    "2T": "2T",
    "O(T + 1)": "O(T+1)",
    "α → α": "\\alpha\\longmapsto\\alpha",
    "α → 2α": "\\alpha\\longmapsto2\\alpha",
    "2n": "2n",
    "n + m": "n+m",
    "max{Δ,2}": "\\max\\{\\Delta,2\\}",
    "m ≤ nΔ/2": "m\\le n\\Delta/2",
    "2Δ − 2": "2\\Delta-2",
    "Inc(N[G])": "\\operatorname{Inc}(N[G])",
    "Inc(E,V)": "\\operatorname{Inc}(E,V)",
    "L(G)": "L(G)",
    "Rounding required": "\\text{Rounding required}",
    "No integral guarantee": "\\text{No integral guarantee}",
    "Δ_L": "\\Delta_L",
    "n + 2m": "n+2m",
    "n+2m": "n+2m",
    "2m": "2m",
    "m_L": "m_L",
    "m_L = Σ_v binom(deg(v),2)": "m_L=\\sum_{v\\in V(G)}\\binom{\\deg(v)}{2}",
    "T + 4": "T+4",
    "α → 3α": "\\alpha\\mapsto3\\alpha",
    "α → (1 + 2∇₁)α": "\\alpha\\mapsto(1+2\\nabla_1)\\alpha",
    "1 + 2∇₁": "1+2\\nabla_1",
    "(f(∇₁)) + 4": "\\bigl(f\\bigl(\\nabla_1\\bigr)\\bigr)+4",
    "(1 + 2∇₁) · (f(∇₁))": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(f\\bigl(\\nabla_1\\bigr)\\bigr)",
    "(f(ε)) + 4": "\\bigl(f\\bigl(\\varepsilon\\bigr)\\bigr)+4",
    "7 · (11 + ε)": "7\\cdot\\bigl(11 + \\varepsilon\\bigr)",
    "(Constant) + 4": "\\bigl(\\text{Constant}\\bigr)+4",
    "7 · (20)": "7\\cdot\\bigl(20\\bigr)",
    "(O(α log n)) + 4": "\\bigl(O(\\alpha  \\log n)\\bigr)+4",
    "(1 + 2∇₁) · (O(α))": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(O(\\alpha )\\bigr)",
    "7 · (5)": "7\\cdot\\bigl(5\\bigr)",
    "≤ 15": "\\le 15",
    "(1 + 2∇₁) · (6c²t + (2t + 5)c + 4)": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(6c^2t+(2t+5)c+4\\bigr)",
    "(O(log* n)) + 4": "\\bigl(O(\\log^* n)\\bigr)+4",
    "(1 + 2∇₁) · (1 + ε)": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(1 + \\varepsilon\\bigr)",
    "(f(h)) + 4": "\\bigl(f\\bigl(h\\bigr)\\bigr)+4",
    "(1 + 2∇₁) · (f(h))": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(f\\bigl(h\\bigr)\\bigr)",
    "3 · (Constant)": "3\\cdot\\bigl(\\text{Constant}\\bigr)",
    "(12g + O(1)) + 4": "\\bigl(12g+O(1)\\bigr)+4",
    "(1 + 2∇₁) · (24g + O(1))": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(24g+O(1)\\bigr)",
    "7 · (694)": "7\\cdot\\bigl(694\\bigr)",
    "7 · (52)": "7\\cdot\\bigl(52\\bigr)",
    "7 · (130)": "7\\cdot\\bigl(130\\bigr)",
    "(O(log n)) + 4": "\\bigl(O(\\log n)\\bigr)+4",
    "(1 + 2∇₁) · (O(α²))": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(O(\\alpha^2)\\bigr)",
    "(O(log Δ)) + 4": "\\bigl(O(\\log \\Delta )\\bigr)+4",
    "(1 + 2∇₁) · (O(α log Δ))": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(O(\\alpha  \\log \\Delta )\\bigr)",
    "7 · (1 + ε)": "7\\cdot\\bigl(1 + \\varepsilon\\bigr)",
    "(polylog n) + 4": "\\bigl(\\operatorname{polylog}n\\bigr)+4",
    "(1 + 2∇₁) · (1 + o(1))": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(1 + o(1)\\bigr)",
    "3 · (1 + o(1))": "3\\cdot\\bigl(1 + o(1)\\bigr)",
    "(O(T_MIS + ε⁻O(1) log* n)) + 4": "\\bigl(O\\!\\left(T_{\\mathrm{MIS}}+\\varepsilon^{-O(1)}\\log^*n\\right)\\bigr)+4",
    "7 · (32)": "7\\cdot\\bigl(32\\bigr)",
    "7 · (18)": "7\\cdot\\bigl(18\\bigr)",
    "3 · (1 + O(1 / logᵏ n))": "3\\cdot\\bigl(1+O\\!\\left(\\frac{1}{\\log^k n}\\right)\\bigr)",
    "≤ 8": "\\le 8",
    "(1 + 2∇₁) · ((Δ + 1)/2)": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(\\frac{\\Delta+1}{2}\\bigr)",
    "7 · (6)": "7\\cdot\\bigl(6\\bigr)",
    "(f(g, ε)) + 4": "\\bigl(f\\bigl(g,\\varepsilon\\bigr)\\bigr)+4",
    "(1 + 2∇₁) · (34 + ε)": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(34 + \\varepsilon\\bigr)",
    "(T + δ + 2) + 4, where T = F(2u+2ρ) + max{u+ρ, b}": "\\bigl(T+\\delta+2\\bigr)+4,\\qquad T=F(2u+2\\rho)+\\max\\{u+\\rho,b\\}",
    "(O(log Δ / log log Δ)) + 4": "\\bigl(O\\!\\left(\\frac{\\log\\Delta}{\\log\\log\\Delta}\\right)\\bigr)+4",
    "(1 + 2∇₁) · (O(α log Δ / log log Δ))": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(O\\!\\left(\\frac{\\alpha\\log\\Delta}{\\log\\log\\Delta}\\right)\\bigr)",
    "7 · (8 + ε)": "7\\cdot\\bigl(8 + \\varepsilon\\bigr)",
    "7 · (7 + ε)": "7\\cdot\\bigl(7 + \\varepsilon\\bigr)",
    "(f(𝒞, ε)) + 4": "\\bigl(f\\bigl(\\mathcal{C},\\varepsilon\\bigr)\\bigr)+4",
    "(1 + 2∇₁) · (2a(𝒞) + 1 + ε)": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(2a(\\mathcal{C})+1+\\varepsilon\\bigr)",
    "(1 + 2∇₁) · (1 + ε in expectation)": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(1+\\varepsilon\\;\\text{in expectation}\\bigr)",
    "(1 + 2∇₁) · (7 + ε)": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(7 + \\varepsilon\\bigr)",
    "(f(d, ∇₁, ε)) + 4": "\\bigl(f\\bigl(d,\\nabla_1,\\varepsilon\\bigr)\\bigr)+4",
    "(1 + 2∇₁) · (d + 1 + ε)": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(d + 1 + \\varepsilon\\bigr)",
    "(1 + 2∇₁) · (5 + ε)": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(5 + \\varepsilon\\bigr)",
    "7 · (7)": "7\\cdot\\bigl(7\\bigr)",
    "(f(a)) + 4": "\\bigl(f\\bigl(a\\bigr)\\bigr)+4",
    "(1 + 2∇₁) · (2a + 1)": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(2a+1\\bigr)",
    "(f(g)) + 4": "\\bigl(f\\bigl(g\\bigr)\\bigr)+4",
    "(1 + 2∇₁) · (7)": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(7\\bigr)",
    "(f(b, ε)) + 1": "\\bigl(f\\bigl(b,\\varepsilon\\bigr)\\bigr)+1",
    "(f(ρ, b, ε)) + 1": "\\bigl(f\\bigl(\\rho,b,\\varepsilon\\bigr)\\bigr)+1",
    "(Oρ,ᵦ,ε(log* n)) + 1": "\\bigl(O_{\\rho,b,\\varepsilon}(\\log^*n)\\bigr)+1",
    "2 · (O((Δ+1) · log (Δ+1) / ε²))": "2\\cdot\\bigl(O\\!\\left(\\frac{\\left(\\Delta+1\\right)\\,\\log\\left(\\Delta+1\\right)}{\\varepsilon^2}\\right)\\bigr)",
    "(O(2 · log Δ / ε²)) + 1": "\\bigl(O\\!\\left(\\frac{2\\,\\log\\Delta}{\\varepsilon^2}\\right)\\bigr)+1",
    "2 · (1 + ε)": "2\\cdot\\bigl(1 + \\varepsilon\\bigr)",
    "O((O(2 · log Δ / ε²)) + 1)": "O\\!\\left(\\bigl(O\\!\\left(\\frac{2\\,\\log\\Delta}{\\varepsilon^2}\\right)\\bigr)+1\\right)",
    "2 · (O((Δ+1)²(Δ+1)² + (Δ+1)(Δ+1) log* W))": "2\\cdot\\bigl(O(\\left(\\Delta+1\\right)^2\\left(\\Delta+1\\right)^2+\\left(\\Delta+1\\right)\\left(\\Delta+1\\right)\\log^*W)\\bigr)",
    "(Δ+1)": "\\left(\\Delta+1\\right)",
    "(O(2²Δ² + 2Δ log* W)) + 1": "\\bigl(O(2^2\\Delta^2+2\\Delta\\log^*W)\\bigr)+1",
    "O((2 · (O(((Δ_L)+1)²((Δ_L)+1)² + ((Δ_L)+1)((Δ_L)+1) log* W))) + 1)": "O\\!\\left(\\bigl(2\\cdot\\bigl(O(\\left(\\Delta_L+1\\right)^2\\left(\\Delta_L+1\\right)^2+\\left(\\Delta_L+1\\right)\\left(\\Delta_L+1\\right)\\log^*W)\\bigr)\\bigr)+1\\right)",
    "((Δ_L)+1)": "\\left(\\Delta_L+1\\right)",
    "(f(g, a, ε)) + 4": "\\bigl(f\\bigl(g,a,\\varepsilon\\bigr)\\bigr)+4",
    "(f(d, g, r)) + 4": "\\bigl(f\\bigl(d,g,r\\bigr)\\bigr)+4",
    "(1 + 2∇₁) · (34.01(d + 1))": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(34.01(d + 1)\\bigr)",
    "3 · (O(√g + 1))": "3\\cdot\\bigl(O(\\sqrt{g}+1)\\bigr)",
    "(O(t)) + 4": "\\bigl(O(t)\\bigr)+4",
    "(1 + 2∇₁) · (50)": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(50\\bigr)",
    "(1 + 2∇₁) · (2t − 1)": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(2t - 1\\bigr)",
    "9": "9",
    "7 · (302)": "7\\cdot\\bigl(302\\bigr)",
    "(1 + 2∇₁) · (35(d + 1))": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(35(d + 1)\\bigr)",
    "(T + δ + 2) + 4, where T = F(2u+2) + max{u+1, b}": "\\bigl(T+\\delta+2\\bigr)+4,\\qquad T=F(2u+2)+\\max\\{u+1,b\\}",
    "14": "14",
    "(1 + 2∇₁) · (f(g))": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(f\\bigl(g\\bigr)\\bigr)",
    "Oε,1,𝗀(log* n)": "O_{\\varepsilon,1,g}(\\log^*n)",
    "(Oε,꜀(log* n)) + 4": "\\bigl(O_{\\varepsilon,c}(\\log^*n)\\bigr)+4",
    "7 · (205)": "7\\cdot\\bigl(205\\bigr)",
    "(1 + 2∇₁) · (616)": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(616\\bigr)",
    "(O((g+1)(F_g(10)+6))) + 4": "\\bigl(O\\!\\left((g+1)(F_g(10)+6)\\right)\\bigr)+4",
    "(f(d, g, a, r)) + 4": "\\bigl(f\\bigl(d,g,a,r\\bigr)\\bigr)+4",
    "(f(H)) + 4": "\\bigl(f\\bigl(H\\bigr)\\bigr)+4",
    "(t − 1) + 4": "\\bigl(t-1\\bigr)+4",
    "(1 + 2∇₁) · (1)": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(1\\bigr)",
    "3 · (3)": "3\\cdot\\bigl(3\\bigr)",
    "O((0) + 1)": "O\\!\\left(\\bigl(0\\bigr)+1\\right)",
    "(Δ_L) + 1": "\\Delta_L+1",
    "4": "4",
    "(1 + 2∇₁) · (Δ + 1)": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(\\Delta+1\\bigr)",
    "(1 + 2∇₁) · (t)": "\\bigl(1+2\\nabla_1\\bigr)\\cdot\\bigl(t\\bigr)",
    "F": "F",
    "K": "K",
    "u": "u",
    "F_g": "F_g",
    "K₂,ₜ": "K_{2,t}",
    "K2,t": "K_{2,t}",
    "K2t": "K_{2,t}",
    "K_{2,t}": "K_{2,t}",
    "K₁,ₜ": "K_{1,t}",
    "K1,t": "K_{1,t}",
    "K_{1,t}": "K_{1,t}",
    "K3,t": "K_{3,t}",
    "K_{3,t}": "K_{3,t}",
    "K₄,₄": "K_{4,4}",
    "K4,4": "K_{4,4}",
    "K_{4,4}": "K_{4,4}",
    "Kₕ": "K_h",
    "Kₜ": "K_t",
    "K8": "K_8",
    "K_(k+2)": "K_{k+2}",
    "K_{3+a,2g+3+a}": "K_{3+a,2g+3+a}",
    "Pₜ": "P_t",
    "P_t": "P_t",
    "P_{t}": "P_t",
    "pw(H) ≤ 2": "\\operatorname{pw}(H)\\le 2",
    "pw(H)≤2": "\\operatorname{pw}(H)\\le 2",
    "pw(H) <= 2": "\\operatorname{pw}(H)\\le 2",
    "pw(K₂,t)=2": "\\operatorname{pw}(K_{2,t})=2",
    "γ₁(G) ≤ Cγₖ(G)": "\\gamma_1(G)\\le C\\gamma_k(G)",
    "|E(H)| ≤ a|V(H)|": "|E(H)|\\le a|V(H)|",
    "|E(H)| ≤ ρ|V(H)|": "|E(H)|\\le\\rho|V(H)|",
    "g ≤ 2h": "g\\le 2h",
    "f(r)=o(log r)": "f(r)=o(\\log r)",
    "f(r) = o(log r)": "f(r)=o(\\log r)",
    "g(r) = o(log r)": "g(r)=o(\\log r)",
    "o(log r)": "o(\\log r)",
    "D^(r+1)": "D^{r+1}",
    "d=2": "d=2",
    "a=0": "a=0",
    "4r + 2": "4r+2",
    "4r+2": "4r+2",
    "4r + 3": "4r+3",
    "4r+3": "4r+3",
    "4k + 3": "4k+3",
    "4k+3": "4k+3",
    "2k − 1": "2k-1",
    "2k−1": "2k-1",
    "t−1": "t-1",
    "3, 5, …, 2k − 1": "3,5,\\ldots,2k-1",
    "3,5,…,2k−1": "3,5,\\ldots,2k-1",
    "{u,v,w_i}": "\\{u,v,w_i\\}",
    "w_i": "w_i",
    "B ≥ nW": "B\\ge nW",
    "W ≤ n^O(1)": "W\\le n^{O(1)}",
    "|b(u)−b(v)| ≤ L dist(u,v)": "|b(u)-b(v)|\\le L\\operatorname{dist}(u,v)",
    "≤ ⌈log Δ⌉": "\\le\\lceil\\log\\Delta\\rceil",
    "log(n)/n < ε < 1": "\\log(n)/n<\\varepsilon<1",
    "0 < ε ≤ 1": "0<\\varepsilon\\le 1",
    "0 < ε < 1": "0<\\varepsilon<1",
    "0 < ε < 1/2": "0<\\varepsilon<1/2",
    "0 < ε < 1/4": "0<\\varepsilon<1/4",
    "Aᵢⱼ ≥ 1": "A_{ij}\\ge 1",
    "ε < 1/B": "\\varepsilon<1/B",
    "≤ g": "\\le g",
    "≤ e": "\\le e",
    "≤ d": "\\le d",
    "≤ Δ": "\\le \\Delta",
    "≤ α": "\\le \\alpha",
    "≤ a": "\\le a",
    "≤ b": "\\le b",
    "≤ k": "\\le k",
    "≤ f": "\\le f",
    "Δ ≤ 3": "\\Delta\\le 3",
    "Δ≤3": "\\Delta\\le 3",
    "β ≥ 1": "\\beta\\ge 1",
    "β≥1": "\\beta\\ge 1",
    "β > 1": "\\beta> 1",
    "β>1": "\\beta> 1",
    "α ≥ 1": "\\alpha\\ge 1",
    "α≥1": "\\alpha\\ge 1",
    "α > 1": "\\alpha> 1",
    "α>1": "\\alpha> 1",
    "α ≥ 2": "\\alpha\\ge 2",
    "α≥2": "\\alpha\\ge 2",
    "α > 2": "\\alpha> 2",
    "α>2": "\\alpha> 2",
    "a ≥ 1": "a\\ge 1",
    "a≥1": "a\\ge 1",
    "a > 1": "a> 1",
    "a>1": "a> 1",
    "a ≥ 2": "a\\ge 2",
    "a≥2": "a\\ge 2",
    "a > 2": "a> 2",
    "a>2": "a> 2",
    "d ≥ 1": "d\\ge 1",
    "d≥1": "d\\ge 1",
    "d > 1": "d> 1",
    "d>1": "d> 1",
    "d ≥ 2": "d\\ge 2",
    "d≥2": "d\\ge 2",
    "d > 2": "d> 2",
    "d>2": "d> 2",
    "k ≥ 1": "k\\ge 1",
    "k≥1": "k\\ge 1",
    "k > 1": "k> 1",
    "k>1": "k> 1",
    "k ≥ 2": "k\\ge 2",
    "k≥2": "k\\ge 2",
    "k > 2": "k> 2",
    "k>2": "k> 2",
    "k ≥ 3": "k\\ge 3",
    "k≥3": "k\\ge 3",
    "k > 3": "k> 3",
    "k>3": "k> 3",
    "r ≥ 1": "r\\ge 1",
    "r≥1": "r\\ge 1",
    "r > 1": "r> 1",
    "r>1": "r> 1",
    "t ≥ 1": "t\\ge 1",
    "t≥1": "t\\ge 1",
    "t > 1": "t> 1",
    "t>1": "t> 1",
    "t ≥ 2": "t\\ge 2",
    "t≥2": "t\\ge 2",
    "t > 2": "t> 2",
    "t>2": "t> 2",
    "t≥3": "t\\ge 3",
    "t > 3": "t> 3",
    "t>3": "t> 3",
    "t ≥ 49": "t\\ge 49",
    "t≥49": "t\\ge 49",
    "t > 49": "t> 49",
    "t>49": "t> 49",
    "ρ ≥ 1": "\\rho\\ge 1",
    "ρ≥1": "\\rho\\ge 1",
    "ρ > 1": "\\rho> 1",
    "ρ>1": "\\rho> 1",
    "b ≥ 1": "b\\ge 1",
    "b≥1": "b\\ge 1",
    "b > 1": "b> 1",
    "b>1": "b> 1",
    "ε ≥ 0": "\\varepsilon\\ge 0",
    "ε≥0": "\\varepsilon\\ge 0",
    "ε > 0": "\\varepsilon> 0",
    "ε>0": "\\varepsilon> 0",
    "∇₁ ≥ 0": "\\nabla_1\\ge 0",
    "∇₁≥0": "\\nabla_1\\ge 0",
    "∇₁ > 0": "\\nabla_1> 0",
    "∇₁>0": "\\nabla_1> 0",
    "f(k) ≥ 1": "f(k)\\ge 1",
    "f(k)≥1": "f(k)\\ge 1",
    "f(k) > 1": "f(k)> 1",
    "f(k)>1": "f(k)> 1",
    "≥ 4r + 2": "\\ge 4r+2",
    "≥ 4r + 3": "\\ge 4r+3",
    "≥ 4k + 3": "\\ge 4k+3",
    "≥4k+3": "\\ge 4k+3",
    "≥ 4r+2": "\\ge 4r+2",
    "≥ 1": "\\ge 1",
    "≥ 4k": "\\ge 4k",
    "≤ 3": "\\le 3",
    "≤ W": "\\le W",
    "≤ f(k)": "\\le f(k)",
    "e": "e",
    "H=K₂,t": "H=K_{2,t}",
    "H=K2,t": "H=K_{2,t}",
    "H=K1,t": "H=K_{1,t}",
    "H=Pₜ": "H=P_t",
    "a=3": "a=3",
    "ρ=3": "\\rho=3",
    "f ≤ k": "f\\le k",
    "f(k)=1": "f(k)=1",
    "ρ, b, ε": "\\rho,b,\\varepsilon",
    "C₅": "C_5",
    "K₂,s": "K_{2,s}",
    "≤ t−1": "\\le t-1",
    "t≥4": "t\\ge4",
    "t ≥ 4": "t\\ge4",
    "t=2": "t=2",
    "t=3": "t=3",
    "s": "s"
  },
  "graphNetwork": {
    "version": 1,
    "checked": "2026-11-16",
    "description": "Certified inclusions between graph families with fixed auxiliary parameters. Upper bounds restrict to subclasses. Only edges with lower=true are used for lower bounds; unspecified excluded-minor choices are not transferred backwards. Other theorem assumptions and instance domains remain in force.",
    "nodes": [
      {
        "id": "general",
        "label": "General",
        "aliases": [
          "general",
          "arbitrary graphs",
          "General graphs"
        ],
        "description": "All finite graphs; other theorem assumptions still apply.",
        "search": true
      },
      {
        "id": "density",
        "label": "Bounded arboricity",
        "aliases": [
          "bounded degeneracy",
          "degenerate graphs",
          "bounded maximum average degree",
          "arboricity",
          "degeneracy",
          "d-degenerate",
          "degeneracy at most d"
        ],
        "description": "Equivalent boundedness families: bounded arboricity, degeneracy and maximum average degree, with parameter changes. A numerical bound is retained in the source.",
        "search": true
      },
      {
        "id": "depth-one",
        "label": "Bounded depth-one density",
        "aliases": [
          "depth-one density"
        ],
        "description": "Bounded maximum average degree and depth-one shallow-minor density.",
        "search": true
      },
      {
        "id": "expansion",
        "label": "Bounded expansion",
        "aliases": [
          "bounded-expansion"
        ],
        "description": "A fixed expansion function bounds shallow-minor density at each depth.",
        "search": true
      },
      {
        "id": "sublog",
        "label": "Sub-logarithmic expansion",
        "aliases": [
          "sublogarithmic expansion",
          "sub-log expansion"
        ],
        "description": "Expansion f(r)=o(log r); this includes every fixed-minor-free family.",
        "search": true
      },
      {
        "id": "minor",
        "label": "Minor-free",
        "aliases": [
          "fixed minor-free",
          "h-minor-free",
          "excluded minor",
          "minor-free graphs"
        ],
        "description": "Algorithms here quantify over every fixed excluded minor H. An inclusion may require choosing H; lower bounds are not universal in arbitrary H.",
        "search": true
      },
      {
        "id": "minor-pw2",
        "label": "H-minor-free; pw(H) ≤ 2",
        "aliases": [
          "H-minor-free with excluded minor of pathwidth at most 2",
          "excluded minor pathwidth at most 2",
          "pw(H) <= 2 minor-free",
          "H-minor-free; pw(H) <= 2"
        ],
        "description": "Graphs excluding a fixed graph H whose pathwidth is at most 2. The pathwidth condition is on the excluded minor H, not on the input graph; the input graph can have arbitrarily large pathwidth.",
        "search": true
      },
      {
        "id": "path-minor",
        "label": "Pₜ-minor-free",
        "aliases": [
          "Pt-minor-free",
          "P_t-minor-free",
          "P_{t}-minor-free",
          "excluded path minor",
          "path-minor-free"
        ],
        "description": "Graphs excluding the path on t vertices as a minor, for fixed t. Every connected component has bounded diameter; disconnected inputs are handled componentwise.",
        "search": true
      },
      {
        "id": "topological",
        "label": "Excluded topological minor",
        "aliases": [
          "topological-minor-free"
        ],
        "description": "A fixed excluded clique subdivision; the bound may depend on its size.",
        "search": true
      },
      {
        "id": "euler",
        "label": "Euler genus ≤ g",
        "aliases": [
          "bounded genus",
          "euler genus",
          "Bounded Euler genus"
        ],
        "description": "A fixed Euler-genus bound g, including nonorientable surfaces.",
        "search": true
      },
      {
        "id": "orientable",
        "label": "Bounded orientable genus",
        "aliases": [
          "orientable genus"
        ],
        "description": "A fixed orientable-genus bound; kept distinct from Euler genus.",
        "search": true
      },
      {
        "id": "local-embedding",
        "label": "Locally embeddable",
        "aliases": [
          "locally embeddable"
        ],
        "description": "Bounded depth-one density and exclusion of a depth-one K3,t minor, as defined in the source.",
        "search": true
      },
      {
        "id": "local-genus",
        "label": "Asymptotic dimension d; radius-r balls of Euler genus ≤ g",
        "aliases": [
          "locally nice",
          "locally bounded genus",
          "Locally nice genus",
          "Asymptotic dimension d; r-locally Euler genus ≤ g",
          "Asymptotic dimension d; sufficiently large-radius neighborhoods of Euler genus ≤ g"
        ],
        "description": "Graph classes of asymptotic dimension d with a fixed control function, where every induced radius-r ball has Euler genus at most g for a sufficiently large fixed radius r.",
        "search": true
      },
      {
        "id": "local-apex",
        "label": "Asymptotic dimension d; radius-r balls of Euler genus ≤ g with at most a apices",
        "aliases": [
          "locally bounded genus with apices",
          "locally apex genus",
          "local apex-genus",
          "Asymptotic dimension d; r-locally Euler genus ≤ g with at most a apices"
        ],
        "description": "Graph classes of asymptotic dimension at most d with a fixed dimensional control function, where deleting at most a vertices from each induced radius-r ball leaves Euler genus at most g, for a sufficiently large fixed radius r. This is a local condition and does not assert global minor exclusion.",
        "search": true
      },
      {
        "id": "apex",
        "label": "Bounded genus with apices",
        "aliases": [
          "apex graphs"
        ],
        "description": "Bounded Euler genus after deleting a bounded number of apex vertices.",
        "search": true
      },
      {
        "id": "planar-clique",
        "label": "Planar with an attached clique",
        "aliases": [
          "planar plus clique"
        ],
        "description": "A planar graph with a clique glued at one vertex; includes the trivial one-vertex clique.",
        "search": true
      },
      {
        "id": "planar",
        "label": "Planar",
        "aliases": [
          "planar graphs"
        ],
        "description": "Graphs admitting a crossing-free drawing in the plane.",
        "search": true
      },
      {
        "id": "outerplanar",
        "label": "Outerplanar",
        "aliases": [
          "outerplanar graphs"
        ],
        "description": "Planar graphs admitting an embedding with every vertex on the outer face.",
        "search": true
      },
      {
        "id": "triangle-planar",
        "label": "Triangle-free planar",
        "aliases": [
          "triangle free planar"
        ],
        "description": "Planar graphs with no triangles.",
        "search": true
      },
      {
        "id": "fourcycle-planar",
        "label": "Planar without 4-cycles",
        "aliases": [
          "4-cycle-free planar"
        ],
        "description": "Planar graphs without cycles of length four.",
        "search": true
      },
      {
        "id": "forest",
        "label": "Trees / forests",
        "aliases": [
          "trees",
          "forests",
          "tree",
          "forest"
        ],
        "description": "Acyclic graphs. Connectivity is retained where required by a theorem.",
        "search": true
      },
      {
        "id": "path",
        "label": "Paths",
        "aliases": [
          "paths",
          "path"
        ],
        "description": "Simple paths, without a supplied orientation.",
        "search": true
      },
      {
        "id": "oriented-path",
        "label": "Oriented paths",
        "aliases": [
          "oriented paths"
        ],
        "description": "Paths with a supplied orientation; retain that additional information in lower-bound statements.",
        "search": true
      },
      {
        "id": "cycle",
        "label": "Cycles",
        "aliases": [
          "cycles",
          "cycle"
        ],
        "description": "Simple cycles.",
        "search": true
      },
      {
        "id": "long-cycle",
        "label": "Long cycles",
        "aliases": [
          "long cycles"
        ],
        "description": "Cycles satisfying the theorem’s length threshold.",
        "search": true
      },
      {
        "id": "degree",
        "label": "Bounded degree",
        "aliases": [
          "bounded maximum degree"
        ],
        "description": "Maximum degree is bounded by a fixed auxiliary parameter.",
        "search": true
      },
      {
        "id": "degree-forest",
        "label": "Bounded-degree trees",
        "aliases": [
          "bounded degree trees"
        ],
        "description": "Trees with a bounded maximum degree.",
        "search": true
      },
      {
        "id": "bipartite",
        "label": "Bipartite",
        "aliases": [
          "bipartite graphs"
        ],
        "description": "Graphs admitting a proper two-coloring; the coloring is not automatically supplied as input.",
        "search": true
      },
      {
        "id": "degree-bipartite",
        "label": "Degree-3 bipartite",
        "aliases": [
          "degree-three bipartite"
        ],
        "description": "Bipartite graphs of maximum degree at most three.",
        "search": true
      },
      {
        "id": "weak-colored",
        "label": "Weakly 2-colored",
        "aliases": [
          "weakly 2-coloured",
          "weakly 2-colored"
        ],
        "description": "Graphs with a supplied weak two-coloring and the source’s isolate restriction.",
        "search": true
      },
      {
        "id": "unit-disk",
        "label": "Unit-disk",
        "aliases": [
          "unit disk graphs",
          "unit-disk graphs"
        ],
        "description": "Intersection graphs of equal-radius disks in the plane; density can be unbounded.",
        "search": true
      },
      {
        "id": "independence-growth",
        "label": "Polynomial neighborhood-independence growth",
        "aliases": [
          "polynomially bounded growth",
          "bounded growth / independence",
          "neighborhood independence",
          "Polynomial independence growth"
        ],
        "description": "Polynomial growth of independent sets in neighborhoods, rather than vertex-volume growth.",
        "search": true
      },
      {
        "id": "k2t",
        "label": "K₂,t-minor-free",
        "aliases": [
          "k2t-minor-free",
          "K2t",
          "K2,t",
          "K_{2,t}",
          "K_{2,t}-minor-free"
        ],
        "description": "Graphs excluding K₂,t as a minor for a fixed integer t≥2. Since pw(K₂,t)=2, these are included in the H-minor-free family with pw(H)≤2 by taking H=K₂,t.",
        "search": true
      },
      {
        "id": "minor-domination",
        "label": "Minor-free with domination constraint",
        "aliases": [],
        "description": "Excluded clique minor plus the theorem’s γ₁(G) ≤ Cγₖ(G) condition.",
        "search": false
      },
      {
        "id": "linkless",
        "label": "Linklessly embeddable",
        "aliases": [
          "linklessly embeddable"
        ],
        "description": "Graphs with a linkless embedding in three dimensions.",
        "search": true
      },
      {
        "id": "no-k44",
        "label": "No K₄,₄ subdivision",
        "aliases": [
          "no k4,4 subdivision"
        ],
        "description": "Graphs containing no subdivision of K4,4.",
        "search": true
      },
      {
        "id": "triangle-genus",
        "label": "Triangle-free; Euler genus ≤ g",
        "aliases": [
          "triangle-free bounded genus",
          "Triangle-free Euler genus"
        ],
        "description": "Triangle-free graphs of Euler genus at most g.",
        "search": true
      },
      {
        "id": "girth-expansion",
        "label": "High-girth bounded expansion",
        "aliases": [
          "high-girth bounded expansion"
        ],
        "description": "Bounded expansion together with the source’s girth ≥ 4r+2 or 4r+3 threshold.",
        "search": true
      },
      {
        "id": "girth-hop",
        "label": "High-girth k-hop expansion",
        "aliases": [
          "high-girth k-hop expansion"
        ],
        "description": "The source’s k-hop expansion bound and girth ≥4k+3, including connectivity where stated.",
        "search": true
      },
      {
        "id": "odd-girth",
        "label": "No short odd cycles",
        "aliases": [
          "no short odd cycles"
        ],
        "description": "No odd cycles of lengths 3,5,…,2k−1 for the stated k.",
        "search": true
      },
      {
        "id": "path-powers",
        "label": "Powers of paths",
        "aliases": [
          "powers of paths",
          "path powers"
        ],
        "description": "r-th powers of paths for fixed r. The whole parameterized family is not planar.",
        "search": true
      },
      {
        "id": "path-powers-leaves",
        "label": "Path powers with endpoint leaves",
        "aliases": [
          "path powers with endpoint leaves"
        ],
        "description": "Path powers with additional leaves at one endpoint, as in the thesis construction.",
        "search": true
      },
      {
        "id": "arboricity-two",
        "label": "Arboricity at most 2",
        "aliases": [
          "arboricity 2"
        ],
        "description": "The fixed arboricity-two family; it contains nonplanar graphs.",
        "search": true
      },
      {
        "id": "incidence",
        "label": "Incidence graphs",
        "aliases": [
          "incidence graphs"
        ],
        "description": "Variable–constraint or set–element incidence graphs; an instance-domain restriction.",
        "search": true
      },
      {
        "id": "planar-incidence",
        "label": "Planar incidence graphs",
        "aliases": [
          "planar incidence graph"
        ],
        "description": "Planar incidence graphs; the graph is also bipartite.",
        "search": true
      },
      {
        "id": "bounded-incidence",
        "label": "Bounded set size and frequency",
        "aliases": [],
        "description": "Incidence instances with bounded set size and element frequency.",
        "search": false
      },
      {
        "id": "treewidth",
        "label": "Bounded treewidth",
        "aliases": [
          "treewidth"
        ],
        "description": "Graphs of bounded treewidth; the parameter remains fixed.",
        "search": true
      },
      {
        "id": "pathwidth",
        "label": "Bounded pathwidth",
        "aliases": [
          "pathwidth"
        ],
        "description": "Graphs of bounded pathwidth; the parameter remains fixed.",
        "search": true
      },
      {
        "id": "star-minor",
        "label": "K₁,ₜ-minor-free",
        "aliases": [
          "K1,t-minor-free",
          "star-minor-free"
        ],
        "description": "Graphs excluding the fixed star K1,t as a minor. Their maximum degree is at most t−1; bounded degree alone does not exclude a large star minor.",
        "search": true
      },
      {
        "id": "regular",
        "label": "Regular",
        "aliases": [
          "regular graphs"
        ],
        "description": "Every vertex has the same degree. A result may additionally require a positive degree; the degree need not be bounded independently of n.",
        "search": true
      },
      {
        "id": "pseudoforest",
        "label": "Pseudoforests",
        "aliases": [
          "pseudoforest"
        ],
        "description": "Every connected component has at most one cycle. Forests are a proper subclass; each pseudoforest is outerplanar.",
        "search": true
      }
    ],
    "edges": [
      {
        "subset": "path",
        "superset": "forest",
        "reason": "Every path is a tree.",
        "lower": true
      },
      {
        "subset": "oriented-path",
        "superset": "path",
        "reason": "Forgetting a supplied orientation gives a path. Algorithms do not gain the orientation automatically.",
        "lower": true
      },
      {
        "subset": "forest",
        "superset": "outerplanar",
        "reason": "Every forest has an outerplanar embedding.",
        "lower": true
      },
      {
        "subset": "forest",
        "superset": "bipartite",
        "reason": "Forests admit a proper two-coloring; the coloring is not necessarily supplied.",
        "lower": true
      },
      {
        "subset": "outerplanar",
        "superset": "planar",
        "reason": "Every outerplanar embedding is planar.",
        "lower": true
      },
      {
        "subset": "outerplanar",
        "superset": "treewidth",
        "reason": "Outerplanar graphs have treewidth at most 2.",
        "lower": false,
        "reference": "width"
      },
      {
        "subset": "cycle",
        "superset": "planar",
        "reason": "Every cycle is planar.",
        "lower": true
      },
      {
        "subset": "cycle",
        "superset": "degree",
        "reason": "Cycles have maximum degree 2.",
        "lower": false,
        "reference": "width"
      },
      {
        "subset": "long-cycle",
        "superset": "cycle",
        "reason": "A length restriction selects a subclass of cycles.",
        "lower": true
      },
      {
        "subset": "triangle-planar",
        "superset": "planar",
        "reason": "Drop the triangle-free restriction.",
        "lower": true
      },
      {
        "subset": "fourcycle-planar",
        "superset": "planar",
        "reason": "Drop the restriction excluding 4-cycles.",
        "lower": true
      },
      {
        "subset": "triangle-planar",
        "superset": "triangle-genus",
        "reason": "Set Euler genus to zero.",
        "lower": true
      },
      {
        "subset": "triangle-genus",
        "superset": "euler",
        "reason": "Drop the triangle-free restriction.",
        "lower": true
      },
      {
        "subset": "planar",
        "superset": "euler",
        "reason": "Set Euler genus to zero. Planar graphs lie in every nonnegative Euler-genus bound.",
        "lower": true
      },
      {
        "subset": "planar",
        "superset": "orientable",
        "reason": "Set orientable genus to zero.",
        "lower": true
      },
      {
        "subset": "orientable",
        "superset": "euler",
        "reason": "Orientable genus h implies Euler genus g ≤ 2h; parameter bounds must be compatible.",
        "lower": false
      },
      {
        "subset": "euler",
        "superset": "minor",
        "reason": "Choose an excluded clique large enough for the fixed genus bound. This does not hold for every prescribed excluded H.",
        "lower": false,
        "reference": "expansion"
      },
      {
        "subset": "euler",
        "superset": "local-embedding",
        "reason": "Fixed-genus families meet the local embeddability parameters.",
        "lower": false,
        "reference": "local-embedding"
      },
      {
        "subset": "euler",
        "superset": "local-genus",
        "reason": "Bounded Euler genus has asymptotic dimension at most 2 and the required local genus bound.",
        "lower": false,
        "reference": "local-genus"
      },
      {
        "subset": "euler",
        "superset": "apex",
        "reason": "Allow zero apex vertices.",
        "lower": false
      },
      {
        "subset": "planar",
        "superset": "planar-clique",
        "reason": "Use an attached clique consisting of one vertex.",
        "lower": false
      },
      {
        "subset": "planar",
        "superset": "linkless",
        "reason": "A planar drawing gives a linkless spatial embedding.",
        "lower": true
      },
      {
        "subset": "planar",
        "superset": "no-k44",
        "reason": "A subdivision of nonplanar K4,4 cannot occur as a subgraph of a planar graph.",
        "lower": true
      },
      {
        "subset": "no-k44",
        "superset": "topological",
        "reason": "A subdivision of K8 contains a subdivision of K4,4; exclude K8.",
        "lower": false
      },
      {
        "subset": "minor",
        "superset": "sublog",
        "reason": "Fixed-minor-free families have constant shallow-minor density, hence o(log r) expansion.",
        "lower": false,
        "reference": "expansion"
      },
      {
        "subset": "minor",
        "superset": "topological",
        "reason": "A fixed H-minor-free family excludes a sufficiently large clique subdivision.",
        "lower": false,
        "reference": "expansion"
      },
      {
        "subset": "topological",
        "superset": "expansion",
        "reason": "Excluding a fixed topological minor yields bounded expansion.",
        "lower": false,
        "reference": "expansion"
      },
      {
        "subset": "sublog",
        "superset": "expansion",
        "reason": "Sub-logarithmic expansion is a bounded expansion function.",
        "lower": true,
        "reference": "expansion"
      },
      {
        "subset": "expansion",
        "superset": "depth-one",
        "reason": "Take the depth-one value of the expansion function.",
        "lower": true,
        "reference": "expansion"
      },
      {
        "subset": "depth-one",
        "superset": "density",
        "reason": "Depth-one density bounds depth-zero density, hence maximum average degree and arboricity.",
        "lower": true,
        "reference": "expansion"
      },
      {
        "subset": "local-embedding",
        "superset": "depth-one",
        "reason": "Bounded depth-one density is part of the local embeddability definition.",
        "lower": true,
        "reference": "local-embedding"
      },
      {
        "subset": "degree",
        "superset": "expansion",
        "reason": "A fixed maximum degree D bounds depth-r density by D^(r+1).",
        "lower": false,
        "reference": "expansion-survey"
      },
      {
        "subset": "degree-forest",
        "superset": "forest",
        "reason": "Drop the maximum-degree restriction.",
        "lower": true
      },
      {
        "subset": "degree-forest",
        "superset": "degree",
        "reason": "Drop the acyclicity restriction.",
        "lower": true
      },
      {
        "subset": "degree-bipartite",
        "superset": "bipartite",
        "reason": "Drop the degree-three restriction.",
        "lower": true
      },
      {
        "subset": "degree-bipartite",
        "superset": "degree",
        "reason": "Maximum degree is at most three.",
        "lower": false
      },
      {
        "subset": "bipartite",
        "superset": "odd-girth",
        "reason": "Bipartite graphs have no odd cycles, for every fixed forbidden-length threshold.",
        "lower": true
      },
      {
        "subset": "unit-disk",
        "superset": "independence-growth",
        "reason": "Packing bounds give polynomial neighborhood-independence growth for unit-disk graphs.",
        "lower": true,
        "reference": "growth"
      },
      {
        "subset": "k2t",
        "superset": "minor",
        "reason": "Choose H=K2,t as the fixed excluded minor.",
        "lower": false
      },
      {
        "subset": "minor-domination",
        "superset": "minor",
        "reason": "Drop the domination-number relation; it is an extra source assumption.",
        "lower": false
      },
      {
        "subset": "girth-expansion",
        "superset": "expansion",
        "reason": "Drop the girth threshold.",
        "lower": true
      },
      {
        "subset": "forest",
        "superset": "girth-expansion",
        "reason": "Forests have no cycles and constant expansion; every fixed girth threshold is satisfied.",
        "lower": false,
        "reference": "expansion"
      },
      {
        "subset": "arboricity-two",
        "superset": "density",
        "reason": "Arboricity at most two is bounded arboricity.",
        "lower": true
      },
      {
        "subset": "incidence",
        "superset": "bipartite",
        "reason": "Incidence communication graphs are bipartite; the instance formulation is retained.",
        "lower": true
      },
      {
        "subset": "planar-incidence",
        "superset": "incidence",
        "reason": "Drop planarity, keeping the incidence formulation.",
        "lower": true
      },
      {
        "subset": "planar-incidence",
        "superset": "planar",
        "reason": "Drop the incidence-domain restriction.",
        "lower": true
      },
      {
        "subset": "bounded-incidence",
        "superset": "incidence",
        "reason": "Drop the set-size and frequency bounds.",
        "lower": true
      },
      {
        "subset": "pathwidth",
        "superset": "treewidth",
        "reason": "Treewidth is at most pathwidth.",
        "lower": false,
        "reference": "width"
      },
      {
        "subset": "treewidth",
        "superset": "minor",
        "reason": "Treewidth at most k excludes K_(k+2) as a minor.",
        "lower": false,
        "reference": "width"
      },
      {
        "subset": "path-powers",
        "superset": "pathwidth",
        "reason": "The r-th power of a path has pathwidth at most r.",
        "lower": false,
        "reference": "width"
      },
      {
        "subset": "path-powers-leaves",
        "superset": "treewidth",
        "reason": "Endpoint leaves preserve a bound depending on the fixed path-power exponent.",
        "lower": false
      },
      {
        "subset": "density",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "depth-one",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "expansion",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "sublog",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "minor",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "topological",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "euler",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "orientable",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "local-embedding",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "local-genus",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "apex",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "planar-clique",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "planar",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "outerplanar",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "triangle-planar",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "fourcycle-planar",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "forest",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "path",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "oriented-path",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "cycle",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "long-cycle",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "degree",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "degree-forest",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "bipartite",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "degree-bipartite",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "weak-colored",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "unit-disk",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "independence-growth",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "k2t",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "minor-domination",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "linkless",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "no-k44",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "triangle-genus",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "girth-expansion",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "girth-hop",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "odd-girth",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "path-powers",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "path-powers-leaves",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "arboricity-two",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "incidence",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "planar-incidence",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "bounded-incidence",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "treewidth",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "pathwidth",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "star-minor",
        "superset": "degree",
        "reason": "A vertex with t neighbors contains K1,t as a subgraph, hence as a minor. Exclusion implies maximum degree at most t−1.",
        "lower": false,
        "reference": "folklore-bgpw25"
      },
      {
        "subset": "star-minor",
        "superset": "minor",
        "reason": "Choose the fixed excluded minor H=K1,t. This does not give every prescribed excluded-minor condition.",
        "lower": false,
        "reference": "folklore-bgpw25"
      },
      {
        "subset": "star-minor",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      },
      {
        "subset": "regular",
        "superset": "general",
        "reason": "Every regular graph is a finite graph.",
        "lower": true
      },
      {
        "subset": "forest",
        "superset": "pseudoforest",
        "reason": "Every forest has no cycles in any component. Cycles show that the containment is strict.",
        "lower": true
      },
      {
        "subset": "pseudoforest",
        "superset": "outerplanar",
        "reason": "A component is a tree or a single cycle with trees attached, and therefore has an outerplanar embedding.",
        "lower": true
      },
      {
        "subset": "pseudoforest",
        "superset": "general",
        "reason": "Every pseudoforest is a finite graph.",
        "lower": true
      },
      {
        "subset": "k2t",
        "superset": "minor-pw2",
        "reason": "Instantiate the fixed excluded graph as H=K₂,t, for t≥2. Bags {u,v,w_i}, one for each vertex w_i in the t-side, give pathwidth at most two; the 4-cycle minor gives equality. This is a specialization of excluded-minor settings, not a bound on the input graph’s pathwidth.",
        "lower": false,
        "reference": "thesis-minor-pw2",
        "parameterBindings": {
          "excluded-minor": "K₂,t"
        }
      },
      {
        "subset": "path-minor",
        "superset": "minor-pw2",
        "reason": "Choose the fixed excluded minor H=Pₜ. A path has pathwidth at most 1, hence at most 2.",
        "lower": false,
        "reference": "thesis-path-minor"
      },
      {
        "subset": "minor-pw2",
        "superset": "minor",
        "reason": "Drop the restriction pw(H) ≤ 2 on the fixed excluded graph H. This inclusion does not instantiate an arbitrary prescribed excluded minor for a lower bound.",
        "lower": false,
        "reference": "thesis-minor-pw2"
      },
      {
        "subset": "local-genus",
        "superset": "local-apex",
        "reason": "Use a=0 in every induced radius-r ball, with the same asymptotic-dimension bound and fixed control function.",
        "lower": false,
        "reference": "cuttable-local-apex"
      },
      {
        "subset": "apex",
        "superset": "local-apex",
        "reason": "For fixed g and a, every radius-r ball inherits the Euler-genus-g plus a-apex condition. This global class excludes K_{3+a,2g+3+a}, so it has asymptotic dimension at most d=2 with a class-fixed control function. Retain the same fixed g, a and a sufficiently large r.",
        "lower": false,
        "reference": "cuttable-local-apex"
      },
      {
        "subset": "local-apex",
        "superset": "general",
        "reason": "Every graph in this family is a finite graph.",
        "lower": true
      }
    ],
    "references": {
      "expansion": {
        "title": "Nešetřil and Ossona de Mendez: Classes of bounded expansion",
        "url": "https://arxiv.org/pdf/math/0508323"
      },
      "expansion-survey": {
        "title": "Nešetřil, Ossona de Mendez and Wood, §2",
        "url": "https://iti.mff.cuni.cz/series/2009/435.pdf"
      },
      "width": {
        "title": "Bodlaender: A partial k-arboretum of graphs with bounded treewidth",
        "url": "https://cgi.di.uoa.gr/~sgk/teaching/GT/Bodlaender98-bt.pdf"
      },
      "local-embedding": {
        "title": "Amiri, Schmid and Siebertz: Distributed Dominating Set Approximations beyond Planar Graphs",
        "url": "https://schmiste.github.io/talg19ds.pdf"
      },
      "local-genus": {
        "title": "Bonamy, Gavoille, Picavet and Wesolek: Locally nice graphs",
        "url": "https://arxiv.org/html/2507.04960v1#S3"
      },
      "growth": {
        "title": "Kuhn, Moscibroda, Nieberg and Wattenhofer: Local approximation schemes",
        "url": "https://www.microsoft.com/en-us/research/wp-content/uploads/2017/01/DIALM2005a.pdf"
      },
      "folklore-bgpw25": {
        "title": "Bonamy, Gavoille, Picavet and Wesolek (PODC 2025), introduction and Table 1",
        "url": "https://dept-info.labri.fr/~gavoille/article/BGPW25.pdf"
      },
      "thesis-minor-pw2": {
        "title": "Picavet, PhD thesis, Theorem VIII.1.1 (PDF p. 204)",
        "url": "https://timothepicavet.fr/others/thesis.pdf#page=204"
      },
      "thesis-path-minor": {
        "title": "Picavet, PhD thesis, Chapter IV introduction (PDF p. 120)",
        "url": "https://timothepicavet.fr/others/thesis.pdf#page=120"
      },
      "cuttable-local-apex": {
        "title": "Bonamy, Das, Gavoille, Picavet, Suomela and Wesolek, Corollary 4.4 and following apex extension (PDF p. 10)",
        "url": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf#page=10"
      }
    },
    "scopes": {
      "General": {
        "node": "general"
      },
      "General graphs": {
        "node": "general"
      },
      "Arboricity ≤ α": {
        "node": "density",
        "note": "Use compatible fixed arboricity bounds; planar inputs permit an arboricity bound of 3."
      },
      "Arboricity β > 1": {
        "node": "density",
        "note": "Use compatible fixed arboricity bounds; planar inputs permit an arboricity bound of 3."
      },
      "Arboricity β ≥ 1": {
        "node": "density",
        "note": "Use compatible fixed arboricity bounds; planar inputs permit an arboricity bound of 3."
      },
      "Bounded arboricity": {
        "node": "density",
        "note": "Use compatible fixed arboricity bounds; planar inputs permit an arboricity bound of 3."
      },
      "Arboricity 2": {
        "node": "arboricity-two"
      },
      "Bounded expansion": {
        "node": "expansion"
      },
      "Sub-logarithmic expansion f(r) = o(log r)": {
        "node": "sublog"
      },
      "Sub-logarithmic expansion g(r) = o(log r)": {
        "node": "sublog"
      },
      "Excluded fixed minor": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "Excluded Kₕ minor": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "Proper minor-closed classes": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "H-minor-free graphs": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "Every minor H satisfies |E(H)| ≤ a|V(H)|": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "Every minor H satisfies |E(H)| ≤ ρ|V(H)|": {
        "node": "minor",
        "note": "The excluded minor or minor-density bound is a fixed parameter; instantiate it compatibly with the target class."
      },
      "Isolate-free; every minor H has |E(H)| ≤ a|V(H)|": {
        "node": "minor",
        "note": "Requires an isolate-free instance, as appropriate for total domination."
      },
      "Excluded topological Kₕ": {
        "node": "topological"
      },
      "Bounded Euler genus": {
        "node": "euler",
        "note": "Retain any connectivity condition stated by the source."
      },
      "Connected graphs of Euler genus ≤ g": {
        "node": "euler",
        "note": "Retain any connectivity condition stated by the source."
      },
      "Euler genus ≤ e": {
        "node": "euler",
        "note": "Retain any connectivity condition stated by the source."
      },
      "Euler genus ≤ g": {
        "node": "euler",
        "note": "Retain any connectivity condition stated by the source."
      },
      "Bounded genus": {
        "node": "orientable",
        "note": "The historical record does not establish applicability to every bounded Euler-genus family."
      },
      "Bounded orientable genus g": {
        "node": "orientable",
        "note": "The historical record does not establish applicability to every bounded Euler-genus family."
      },
      "Orientable genus ≤ g": {
        "node": "orientable",
        "note": "The historical record does not establish applicability to every bounded Euler-genus family."
      },
      "Locally embeddable": {
        "node": "local-embedding"
      },
      "Asymptotic dimension d; r-locally Euler genus ≤ g": {
        "node": "local-genus",
        "note": "Asymptotic dimension, its control function and sufficiently large local radius remain fixed prerequisites."
      },
      "Asymptotic dimension d; sufficiently large-radius neighborhoods of Euler genus ≤ g": {
        "node": "local-genus",
        "note": "Asymptotic dimension, its control function and sufficiently large local radius remain fixed prerequisites."
      },
      "Euler genus ≤ g plus at most a apices": {
        "node": "apex"
      },
      "Planar graph with a clique attached at one vertex": {
        "node": "planar-clique"
      },
      "Planar": {
        "node": "planar"
      },
      "Planar graphs": {
        "node": "planar"
      },
      "Outerplanar": {
        "node": "outerplanar"
      },
      "Triangle-free planar": {
        "node": "triangle-planar"
      },
      "Triangle-free planar graphs": {
        "node": "triangle-planar"
      },
      "Planar without 4-cycles": {
        "node": "fourcycle-planar"
      },
      "Triangle-free bounded Euler genus": {
        "node": "triangle-genus"
      },
      "Trees": {
        "node": "forest"
      },
      "Trees, including unrooted trees": {
        "node": "forest"
      },
      "Trees of maximum degree Δ": {
        "node": "degree-forest"
      },
      "Oriented paths": {
        "node": "oriented-path",
        "note": "Orientation is supplied to the lower-bound algorithm."
      },
      "Cycles": {
        "node": "cycle"
      },
      "Cycles of length at least 4r + 3": {
        "node": "long-cycle"
      },
      "Graphs of maximum degree Δ": {
        "node": "degree"
      },
      "Bipartite graphs": {
        "node": "bipartite"
      },
      "Bipartite graphs, Δ ≤ 3": {
        "node": "degree-bipartite"
      },
      "Weakly 2-coloured graphs": {
        "node": "weak-colored",
        "note": "Requires a supplied weak two-coloring and no isolated vertices."
      },
      "Unit-disk": {
        "node": "unit-disk"
      },
      "Polynomially bounded growth": {
        "node": "independence-growth",
        "note": "Growth refers to independent sets in neighborhoods, not vertex counts."
      },
      "K₂,ₜ-minor-free": {
        "node": "k2t"
      },
      "Kₜ-minor-free; γ₁(G) ≤ Cγₖ(G)": {
        "node": "minor-domination",
        "note": "Requires the stated relation between domination numbers."
      },
      "Linklessly embeddable": {
        "node": "linkless"
      },
      "No subdivision of K₄,₄": {
        "node": "no-k44"
      },
      "Bounded expansion; girth ≥ 4r + 2": {
        "node": "girth-expansion",
        "note": "The girth threshold remains required for the stated distance parameter."
      },
      "Expansion f; girth ≥ 4r + 3": {
        "node": "girth-expansion",
        "note": "The girth threshold remains required for the stated distance parameter."
      },
      "Connected; k-hop expansion ≤ f(k); girth ≥ 4k + 3": {
        "node": "girth-hop",
        "note": "Retains connectivity, the precise k-hop expansion definition, and girth threshold."
      },
      "No odd cycles of lengths 3, 5, …, 2k − 1": {
        "node": "odd-girth"
      },
      "r-th powers of paths": {
        "node": "path-powers"
      },
      "t-th powers of paths with endpoint leaves": {
        "node": "path-powers-leaves"
      },
      "General incidence graphs": {
        "node": "incidence",
        "note": "The communication graph is the variable–constraint incidence graph."
      },
      "Planar incidence graph": {
        "node": "planar-incidence",
        "note": "Planarity is required of the incidence graph."
      },
      "Incidence graphs; set size ≤ k, frequency ≤ f": {
        "node": "bounded-incidence",
        "note": "The set-size and frequency bounds remain required."
      },
      "Bounded maximum average degree and depth-one density": {
        "node": "depth-one"
      },
      "Trees / forests": {
        "node": "forest"
      },
      "K₁,ₜ-minor-free": {
        "node": "star-minor"
      },
      "Regular; degree ≥ 1": {
        "node": "regular",
        "note": "The vertex-cover baseline assumes a positive regular degree. It does not select all vertices of a nonempty edgeless graph."
      },
      "Pseudoforests": {
        "node": "pseudoforest",
        "note": "The one-round non-leaf construction extends to this class by the elementary star-assignment proof in the result details."
      },
      "H-minor-free; pw(H) ≤ 2": {
        "node": "minor-pw2",
        "note": "H is a fixed excluded minor with pw(H) ≤ 2; the input graph need not have pathwidth at most 2."
      },
      "Pₜ-minor-free": {
        "node": "path-minor",
        "note": "t is the fixed number of vertices of the excluded path. Bounds apply separately to each connected component."
      },
      "Asymptotic dimension d; radius-r balls of Euler genus ≤ g with at most a apices": {
        "node": "local-apex",
        "note": "Retain fixed d, g, a, a sufficiently large radius r, and the class-dimensional control function; the deletion set of at most a apices may differ between balls."
      },
      "Degeneracy ≤ d": {
        "node": "density",
        "note": "Retain the stated numerical degeneracy bound d. Boundedness is equivalent to bounded arboricity, but their numerical parameters are not identified."
      }
    },
    "prerequisites": {
      "gen-aprsu10-matching": "Supplied proper 2-coloring",
      "gen-aprsu10-dom": "Supplied weak 2-coloring; no isolates",
      "pic-sublog-bmatching": "Known Lipschitz capacity bound",
      "pic-ass-sublog-refine": "Supplied c-approximate dominating set; seed cost additional",
      "unitdisk-fractional-domination": "Geometric distances supplied",
      "pic-sublog-fmatching": "Expansion bounds supplied",
      "gen-emr14-cardinality": "Known n and Δ",
      "gen-emr14-weighted": "Known n and Δ",
      "gen-af26-dom": "Known Δ",
      "gen-fk25-tree": "Known n, Δ and graph parameters",
      "gen-fk25-arboricity-fast": "Known n, Δ and graph parameters",
      "gen-fk25-arboricity-better": "Known n, Δ and graph parameters",
      "gen-asw26-cover-det": "Known common polynomial ID bound",
      "pic-distance-k2t-constant": "Connected; diameter ≥ 4k",
      "pic-distance-k2t-ptas": "Connected; diameter ≥ 4k",
      "pic-distance-minor-ptas": "Known C, k, t; domination constraint",
      "folklore-regular-vc": "Positive regular degree",
      "gen-beks18-exact2": "Known Δ and a common polynomial bound B ≥ nW",
      "gen-beks18-eps": "Known Δ or a polynomial upper bound",
      "gen-beks18-full-eps": "Known Δ or a polynomial upper bound",
      "gen-beks19-exact2": "Common polynomial bound B ≥ nW"
    },
    "displayAliases": {
      "Planar graphs": "Planar",
      "Triangle-free planar graphs": "Triangle-free planar",
      "General graphs": "General",
      "Bipartite graphs": "Bipartite",
      "Bipartite graphs, Δ ≤ 3": "Bipartite; Δ ≤ 3",
      "General incidence graphs": "Incidence graphs",
      "Planar incidence graph": "Planar incidence graphs",
      "Trees, including unrooted trees": "Trees",
      "Graphs of maximum degree Δ": "Maximum degree ≤ Δ",
      "Trees of maximum degree Δ": "Trees; maximum degree ≤ Δ",
      "Bounded orientable genus g": "Orientable genus ≤ g",
      "Connected graphs of Euler genus ≤ g": "Connected; Euler genus ≤ g",
      "Euler genus ≤ g plus at most a apices": "Euler genus ≤ g; at most a apices",
      "Polynomially bounded growth": "Polynomial neighborhood-independence growth",
      "Weakly 2-coloured graphs": "Weakly 2-colored",
      "No subdivision of K₄,₄": "No K₄,₄ subdivision",
      "Planar graph with a clique attached at one vertex": "Planar with a clique attached at one vertex",
      "Bounded Euler genus": "Euler genus ≤ g",
      "Euler genus ≤ e": "Euler genus ≤ g",
      "Triangle-free bounded Euler genus": "Triangle-free; Euler genus ≤ g",
      "Asymptotic dimension d; r-locally Euler genus ≤ g": "Asymptotic dimension d; radius-r balls of Euler genus ≤ g",
      "Asymptotic dimension d; sufficiently large-radius neighborhoods of Euler genus ≤ g": "Asymptotic dimension d; radius-r balls of Euler genus ≤ g",
      "K₂,ₜ-minor-free": "K₂,t-minor-free"
    }
  },
  "problemNetwork": {
    "version": 1,
    "checked": "2026-11-16",
    "description": "Problem relations distinguish exact formulations from fractional relaxations. An arrow runs from a special problem to a more general formulation. Only certified same-graph, objective-preserving edges enable automatic upper- or lower-bound transfer; all other arrows support structural browsing only. A fractional benchmark does not make an integral output fractional. Model, input, cost, radius, capacity, and graph-class assumptions remain attached to every result.",
    "nodes": [
      {
        "id": "dominating-set",
        "label": "Dominating set",
        "aliases": [
          "MDS",
          "Minimum dominating set",
          "Ordinary domination",
          "Domination"
        ],
        "description": "Choose a minimum-cost vertex set meeting every closed neighborhood. Output is an integral set, including in results measured against fractional OPT.",
        "outputKind": "integral-vertex-set",
        "benchmarkKind": "result-specific"
      },
      {
        "id": "total-dominating-set",
        "label": "Total dominating set",
        "aliases": [
          "MTDS",
          "Minimum total dominating set",
          "Total domination",
          "TDS"
        ],
        "description": "Every vertex, including a selected vertex, needs a selected neighbor. Isolated vertices make the unrestricted demand instance infeasible.",
        "outputKind": "integral-vertex-set",
        "benchmarkKind": "result-specific"
      },
      {
        "id": "client-dominating-set",
        "label": "Client dominating set",
        "aliases": [
          "Minimum client dominating set",
          "Client domination",
          "Prescribed-demand domination"
        ],
        "description": "Only a prescribed client set must be dominated. The SUPPORTED result additionally permits preprocessing of the support topology.",
        "outputKind": "integral-vertex-set",
        "benchmarkKind": "integral-optimum"
      },
      {
        "id": "distance-dominating-set",
        "label": "Distance-k dominating set",
        "aliases": [
          "Distance-r dominating set",
          "Distance dominating set",
          "Distance domination",
          "Distance-r domination",
          "r-dominating set"
        ],
        "description": "Every vertex is within graph distance k of a selected vertex. The radius is an input or fixed parameter of the particular theorem; entries retain r when that is the symbol in their bounds.",
        "outputKind": "integral-vertex-set",
        "benchmarkKind": "integral-optimum",
        "parameter": {
          "symbol": "k",
          "name": "distance radius",
          "template": "Distance-{parameter} dominating set",
          "values": [
            "k",
            "r"
          ]
        }
      },
      {
        "id": "connected-dominating-set",
        "label": "Connected dominating set",
        "aliases": [
          "MCDS",
          "Minimum connected dominating set",
          "Connected domination",
          "CDS"
        ],
        "description": "An ordinary dominating set whose selected vertices induce a connected subgraph. Connectivity changes both feasibility and OPT.",
        "outputKind": "integral-vertex-set",
        "benchmarkKind": "integral-optimum"
      },
      {
        "id": "connected-distance-dominating-set",
        "label": "Connected distance-r dominating set",
        "aliases": [
          "Connected distance dominating set",
          "Distance-r connected domination",
          "Connected distance-r domination"
        ],
        "description": "A distance-r dominating set inducing a connected subgraph of the original graph, rather than merely of its power graph.",
        "outputKind": "integral-vertex-set",
        "benchmarkKind": "integral-optimum",
        "parameter": {
          "symbol": "r",
          "name": "distance radius",
          "template": "Connected distance-{parameter} dominating set",
          "values": [
            "r"
          ]
        }
      },
      {
        "id": "outside-k-domination",
        "label": "k-domination (outside the solution)",
        "aliases": [
          "k-tuple dominating set",
          "k-domination",
          "kMDS",
          "Outside-k domination",
          "k neighbors outside the solution",
          "2-domination"
        ],
        "description": "Every vertex outside D needs at least k neighbors in D; selected vertices are exempt. This is the definition in the indexed k-tuple papers, and differs from demanding k selected vertices in every closed neighborhood.",
        "outputKind": "integral-vertex-set",
        "benchmarkKind": "integral-optimum",
        "parameter": {
          "symbol": "k",
          "name": "required neighbors outside the solution",
          "template": "{parameter}-domination (outside the solution)",
          "values": [
            "k",
            "2"
          ]
        }
      },
      {
        "id": "vertex-cover",
        "label": "Vertex cover",
        "aliases": [
          "MVC",
          "Minimum vertex cover",
          "Minimum weight vertex cover",
          "VC"
        ],
        "description": "Choose vertices meeting every edge. Distance-r and connected variants have separate problem nodes.",
        "outputKind": "integral-vertex-set",
        "benchmarkKind": "result-specific"
      },
      {
        "id": "distance-vertex-cover",
        "label": "Distance-r vertex cover",
        "aliases": [
          "Distance vertex cover",
          "Distance-r VC"
        ],
        "description": "In the indexed source, each edge uv has a selected vertex within distance r of both u and v. This is not vertex cover on the power graph. Retain the source's high-girth assumption.",
        "outputKind": "integral-vertex-set",
        "benchmarkKind": "integral-optimum",
        "parameter": {
          "symbol": "r",
          "name": "distance radius",
          "template": "Distance-{parameter} vertex cover",
          "values": [
            "r"
          ]
        }
      },
      {
        "id": "connected-distance-vertex-cover",
        "label": "Distance-r connected vertex cover",
        "aliases": [
          "Connected distance-r vertex cover",
          "Connected distance vertex cover",
          "Connected distance-r VC"
        ],
        "description": "The source's distance-r vertex cover with the additional requirement that the selected vertices induce a connected subgraph of the original graph.",
        "outputKind": "integral-vertex-set",
        "benchmarkKind": "integral-optimum",
        "parameter": {
          "symbol": "r",
          "name": "distance radius",
          "template": "Distance-{parameter} connected vertex cover",
          "values": [
            "r"
          ]
        }
      },
      {
        "id": "set-cover",
        "label": "Set cover",
        "aliases": [
          "Minimum set cover",
          "Weighted set cover",
          "Hitting set",
          "Red-blue domination"
        ],
        "description": "Choose sets covering a universe. Distributed results use the set-element incidence graph; hitting set exchanges its two sides. Incidence planarity is a requirement on that communication graph.",
        "outputKind": "integral-set-selection",
        "benchmarkKind": "result-specific"
      },
      {
        "id": "local-covering",
        "label": "Integral local covering",
        "aliases": [
          "Local covering",
          "Local cover",
          "Integral local cover"
        ],
        "description": "On the physical graph G, prescribed requests r must each have a selected candidate in a locally known nonempty C(r) contained in N[r]. Costs and their bounds follow the result.",
        "outputKind": "integral-vertex-set",
        "benchmarkKind": "integral-optimum"
      },
      {
        "id": "integral-covering",
        "label": "Covering integer program",
        "aliases": [
          "Covering ILP",
          "Integral covering",
          "Integer covering program",
          "Covering integer LP"
        ],
        "description": "A nonnegative covering formulation with integral variables. General covering integer programs and their reductions are not interchangeable with fractional covering LPs.",
        "outputKind": "integral-vector",
        "benchmarkKind": "integral-optimum"
      },
      {
        "id": "fractional-local-covering",
        "label": "Fractional local covering",
        "aliases": [
          "Local covering LP",
          "Fractional local cover",
          "Local fractional covering"
        ],
        "description": "Minimize the cost of a nonnegative vector with sum over C(r) at least one, where each C(r) is contained in the request's physical closed neighborhood. Output is fractional.",
        "outputKind": "fractional-vector",
        "benchmarkKind": "fractional-optimum"
      },
      {
        "id": "covering-lp",
        "label": "Fractional covering LP",
        "aliases": [
          "Covering LP",
          "Fractional covering",
          "Positive covering LP",
          "FCP"
        ],
        "description": "A positive linear program min c^T x subject to Ax >= b and x >= 0. In the generic indexed algorithm, communication takes place on the variable-constraint incidence graph.",
        "outputKind": "fractional-vector",
        "benchmarkKind": "fractional-optimum"
      },
      {
        "id": "fractional-dominating-set",
        "label": "Fractional dominating set",
        "aliases": [
          "Fractional MDS",
          "Fractional domination",
          "Dominating set LP",
          "Domination LP"
        ],
        "description": "Nonnegative vertex weights whose sum in each closed neighborhood is at least one. A fractional vector alone does not select a dominating vertex set.",
        "outputKind": "fractional-vector",
        "benchmarkKind": "fractional-optimum"
      },
      {
        "id": "fractional-vertex-cover",
        "label": "Fractional vertex cover",
        "aliases": [
          "Fractional MVC",
          "Fractional VC",
          "Vertex cover LP"
        ],
        "description": "Minimize the cost of nonnegative vertex values satisfying x_u + x_v >= 1 for every edge uv.",
        "outputKind": "fractional-vector",
        "benchmarkKind": "fractional-optimum"
      },
      {
        "id": "fractional-set-cover",
        "label": "Fractional set cover",
        "aliases": [
          "Set cover LP",
          "Set cover relaxation"
        ],
        "description": "Assign nonnegative values to sets so that each universe element has total incident value at least one.",
        "outputKind": "fractional-vector",
        "benchmarkKind": "fractional-optimum"
      },
      {
        "id": "maximum-matching",
        "label": "Maximum matching",
        "aliases": [
          "Matching",
          "Maximum cardinality matching",
          "Maximum weight matching",
          "MWM",
          "MCM"
        ],
        "description": "Choose edges sharing no endpoints, maximizing cardinality or the supplied edge weights. Fractional and capacitated variants have separate nodes.",
        "outputKind": "integral-edge-set",
        "benchmarkKind": "integral-optimum"
      },
      {
        "id": "fractional-matching",
        "label": "Fractional matching",
        "aliases": [
          "Fractional maximum matching",
          "Fractional weighted matching",
          "Matching LP",
          "Fractional edge packing"
        ],
        "description": "Nonnegative edge values with incident sum at most one at each vertex. The degree-constraint relaxation can have larger OPT than integral matching on nonbipartite graphs.",
        "outputKind": "fractional-vector",
        "benchmarkKind": "fractional-optimum"
      },
      {
        "id": "f-matching",
        "label": "Maximum f-matching",
        "aliases": [
          "f-matching",
          "Simple b-matching",
          "Capacitated matching without multiplicities"
        ],
        "description": "Choose each edge at most once, with at most f(v) chosen incident edges per vertex. The indexed result maximizes cardinality.",
        "outputKind": "integral-edge-set",
        "benchmarkKind": "integral-optimum",
        "parameter": {
          "symbol": "f",
          "name": "vertex-capacity function",
          "template": "Maximum {parameter}-matching",
          "values": [
            "f"
          ]
        }
      },
      {
        "id": "b-matching",
        "label": "Maximum b-matching",
        "aliases": [
          "b-matching",
          "Matching with edge multiplicities"
        ],
        "description": "Assign nonnegative integer multiplicities to edges with incident sum bounded by b(v). The indexed result requires a supplied Lipschitz bound on b.",
        "outputKind": "integer-edge-multiplicities",
        "benchmarkKind": "integral-optimum",
        "parameter": {
          "symbol": "b",
          "name": "vertex-capacity function",
          "template": "Maximum {parameter}-matching",
          "values": [
            "b"
          ]
        }
      },
      {
        "id": "integral-packing",
        "label": "Packing integer program",
        "aliases": [
          "Packing ILP",
          "Integral packing",
          "Integer packing program",
          "Packing integer LP"
        ],
        "description": "Maximize a nonnegative objective under nonnegative packing constraints with integer or binary variables. Variable bounds and the incidence representation are part of the instance.",
        "outputKind": "integral-vector",
        "benchmarkKind": "integral-optimum"
      },
      {
        "id": "packing-lp",
        "label": "Fractional packing LP",
        "aliases": [
          "Packing LP",
          "Fractional packing",
          "Positive packing LP",
          "FPP"
        ],
        "description": "A positive linear program maximizing a nonnegative linear objective under nonnegative packing constraints. A solution is fractional unless an additional integrality or rounding theorem applies.",
        "outputKind": "fractional-vector",
        "benchmarkKind": "fractional-optimum"
      },
      {
        "id": "independent-set",
        "label": "Independent set",
        "aliases": [
          "Maximum independent set",
          "Maximum weight independent set",
          "MIS",
          "MWIS"
        ],
        "description": "Choose pairwise nonadjacent vertices maximizing size or supplied weights. Here MIS denotes the maximum optimization problem, not the maximality task.",
        "outputKind": "integral-vertex-set",
        "benchmarkKind": "integral-optimum"
      },
      {
        "id": "other-packing",
        "label": "Vertex-disjoint H-packing",
        "aliases": [
          "Subgraph packing",
          "Other packing",
          "Vertex-disjoint H-packing",
          "H-packing"
        ],
        "description": "The current category contains vertex-disjoint copies of a fixed pattern H. An occurrence-incidence packing formulation changes the communication representation.",
        "outputKind": "integral-subgraph-family",
        "benchmarkKind": "integral-optimum",
        "parameter": {
          "symbol": "H",
          "name": "fixed pattern graph",
          "template": "Vertex-disjoint {parameter}-packing",
          "values": [
            "H"
          ]
        }
      },
      {
        "id": "edge-dominating-set",
        "label": "Edge dominating set",
        "aliases": [
          "Minimum edge dominating set",
          "Edge domination",
          "EDS"
        ],
        "description": "Choose edges so that every edge is selected or shares an endpoint with a selected edge. This is domination on the line graph, whose structural parameters may differ from the original graph.",
        "outputKind": "integral-edge-set",
        "benchmarkKind": "integral-optimum"
      },
      {
        "id": "local-density",
        "label": "Local density",
        "aliases": [
          "Local-density estimation",
          "Per-vertex local density"
        ],
        "description": "Estimate a per-vertex density parameter. This estimation task is kept separate from covering and packing optimization problems.",
        "outputKind": "estimate",
        "benchmarkKind": "result-specific"
      }
    ],
    "edges": [
      {
        "special": "dominating-set",
        "general": "local-covering",
        "kind": "special-case",
        "upper": true,
        "lower": true,
        "reason": "Use all vertices as requests and C(v)=N[v] on the same graph. Setting every cost to one preserves unweighted OPT; weighted transfer retains the source cost restrictions.",
        "reference": "asw26"
      },
      {
        "special": "total-dominating-set",
        "general": "local-covering",
        "kind": "special-case",
        "upper": true,
        "lower": true,
        "reason": "Use all vertices as requests and C(v)=N(v) on the same graph. Nonempty candidate sets require an isolate-free instance; costs and input assumptions remain required.",
        "reference": "asw26"
      },
      {
        "special": "client-dominating-set",
        "general": "local-covering",
        "kind": "special-case",
        "upper": true,
        "lower": false,
        "reason": "Use prescribed clients as requests and their closed neighborhoods as candidates on the same graph. Broadcasting client membership initializes the local covering incidences in one extra round unless these flags are supplied initially. The source model and preprocessing conventions remain required. Exact lower bounds need an explicit one-round shift and are not transferred automatically.",
        "reference": "asw26"
      },
      {
        "special": "fractional-dominating-set",
        "general": "fractional-local-covering",
        "kind": "special-case",
        "upper": true,
        "lower": true,
        "reason": "Use all vertices as requests and C(v)=N[v]; the fractional variables, objective, graph, and feasible solutions are unchanged. Costs must satisfy the chosen algorithm's assumptions.",
        "reference": "asw26"
      },
      {
        "special": "dominating-set",
        "general": "set-cover",
        "kind": "special-case",
        "upper": false,
        "lower": false,
        "reason": "The universe is V and the set for candidate v is N[v]. Simulation needs separate request/candidate copies. The incidence graph need not preserve planarity or minor bounds: planar K4 produces K4,4. Structural browsing only.",
        "reference": "kw05"
      },
      {
        "special": "total-dominating-set",
        "general": "set-cover",
        "kind": "special-case",
        "upper": false,
        "lower": false,
        "reason": "Use open-neighborhood sets N(v) on the vertex universe. This preserves the set-cover objective but changes to an incidence representation, and feasible instances exclude isolates. No generic graph-class transfer is asserted.",
        "reference": "asw26"
      },
      {
        "special": "vertex-cover",
        "general": "set-cover",
        "kind": "special-case",
        "upper": false,
        "lower": false,
        "reason": "Use universe E and one set of incident edges per vertex: frequency is two and maximum set size is maximum degree. Its incidence graph subdivides edges; simulating the processors and preserving a message model require a separate certified reduction.",
        "reference": "as10"
      },
      {
        "special": "local-covering",
        "general": "set-cover",
        "kind": "special-case",
        "upper": false,
        "lower": false,
        "reason": "Use requests as universe elements and the requests covered by each candidate as its set. The abstract objective agrees, but a distributed set-cover theorem may assume a different incidence communication graph. Structural browsing only.",
        "reference": "as10"
      },
      {
        "special": "set-cover",
        "general": "integral-covering",
        "kind": "special-case",
        "upper": false,
        "lower": false,
        "reason": "The binary incidence formulation has one covering inequality per element and a binary selection variable per set. General integer-program reductions have representation and parameter costs, so this relation alone does not establish a round complexity.",
        "reference": "beks19"
      },
      {
        "special": "outside-k-domination",
        "general": "integral-covering",
        "kind": "special-case",
        "upper": false,
        "lower": false,
        "reason": "An exact binary formulation is k*x_v + sum over neighbors u of x_u >= k. The coefficient on x_v exempts selected vertices. This is not ordinary unit-demand set cover; a distributed ILP algorithm needs its own parameter and representation checks.",
        "reference": "chsw14"
      },
      {
        "special": "dominating-set",
        "general": "outside-k-domination",
        "kind": "special-case",
        "upper": false,
        "lower": false,
        "reason": "Ordinary domination is exactly the case k=1. Indexed algorithms for fixed k>=2 cannot be specialized without checking that their theorems permit k=1; parameter matching is deliberately not automatic.",
        "reference": "chsw14"
      },
      {
        "special": "dominating-set",
        "general": "client-dominating-set",
        "kind": "special-case",
        "upper": false,
        "lower": false,
        "reason": "Making every vertex a client recovers ordinary domination, but this structural relation does not discard the preprocessing and online-round conventions of the indexed SUPPORTED theorem.",
        "reference": "aapr22"
      },
      {
        "special": "dominating-set",
        "general": "distance-dominating-set",
        "kind": "special-case",
        "upper": false,
        "lower": false,
        "reason": "Radius r=1 gives ordinary domination. Results for a specified radius, or a girth threshold depending on that radius, require explicit parameter matching before a bound can be specialized.",
        "reference": "amors18"
      },
      {
        "special": "connected-dominating-set",
        "general": "connected-distance-dominating-set",
        "kind": "special-case",
        "upper": false,
        "lower": false,
        "reason": "Radius r=1 gives ordinary connected domination, with connectivity measured in the original graph. A theorem's allowed radii and graph assumptions must be checked explicitly.",
        "reference": "amors18"
      },
      {
        "special": "dominating-set",
        "general": "fractional-dominating-set",
        "kind": "relaxation",
        "upper": false,
        "lower": false,
        "reason": "Relaxing binary selection to nonnegative vertex values changes feasibility and OPT. A fractional solution requires an additional rounding theorem to become an integral dominating set; integral lower bounds need not apply to the LP.",
        "reference": "kw05"
      },
      {
        "special": "vertex-cover",
        "general": "fractional-vertex-cover",
        "kind": "relaxation",
        "upper": false,
        "lower": false,
        "reason": "Replace binary vertex selections by nonnegative values. The fractional optimum can differ, and no integrality or rounding factor is supplied by this edge.",
        "reference": "low24"
      },
      {
        "special": "set-cover",
        "general": "fractional-set-cover",
        "kind": "relaxation",
        "upper": false,
        "lower": false,
        "reason": "Allow fractional set values in place of binary selections. This does not provide an integral set cover or transfer an integral-output lower bound.",
        "reference": "as10"
      },
      {
        "special": "local-covering",
        "general": "fractional-local-covering",
        "kind": "relaxation",
        "upper": false,
        "lower": false,
        "reason": "The covering sets stay local, but dropping integrality changes the feasible solutions and benchmark. Integral algorithms measured against fractional OPT still belong to the integral-output problem.",
        "reference": "asw26"
      },
      {
        "special": "integral-covering",
        "general": "covering-lp",
        "kind": "relaxation",
        "upper": false,
        "lower": false,
        "reason": "Dropping the integer restrictions gives a positive fractional covering LP. The LP algorithm supplies fractional values, not a solution of the covering integer program.",
        "reference": "beks19"
      },
      {
        "special": "fractional-local-covering",
        "general": "covering-lp",
        "kind": "special-case",
        "upper": false,
        "lower": false,
        "reason": "Its candidate matrix is a positive covering LP. A generic algorithm communicates on a variable-constraint incidence graph, whereas the local algorithm communicates on the original graph. This representation change needs an explicit simulation.",
        "reference": "low24"
      },
      {
        "special": "fractional-dominating-set",
        "general": "fractional-set-cover",
        "kind": "special-case",
        "upper": false,
        "lower": false,
        "reason": "Use the vertex universe and closed-neighborhood sets. Fractional OPT agrees, but the set-cover incidence graph is a different graph and may not preserve the target graph class.",
        "reference": "kw05"
      },
      {
        "special": "fractional-vertex-cover",
        "general": "fractional-set-cover",
        "kind": "special-case",
        "upper": false,
        "lower": false,
        "reason": "The edge universe and incident-edge sets give frequency two. The variable-constraint network subdivides the original edges, so model and simulation details remain separate from this structural relation.",
        "reference": "as10"
      },
      {
        "special": "fractional-set-cover",
        "general": "covering-lp",
        "kind": "special-case",
        "upper": false,
        "lower": false,
        "reason": "The binary incidence matrix is a positive covering LP. Coefficient encoding, normalization, variable-constraint ownership, and parameter bounds must match the selected theorem before applying it.",
        "reference": "low24"
      },
      {
        "special": "maximum-matching",
        "general": "fractional-matching",
        "kind": "relaxation",
        "upper": false,
        "lower": false,
        "reason": "Relax edge indicators to nonnegative values satisfying the degree constraints. Odd cycles can separate fractional and integral OPT; this edge contains no rounding algorithm.",
        "reference": "low24"
      },
      {
        "special": "fractional-matching",
        "general": "packing-lp",
        "kind": "special-case",
        "upper": false,
        "lower": false,
        "reason": "Use edge variables and one incident-sum constraint per vertex. A generic packing algorithm operates on the incidence network and must be simulated on the original graph with its coefficient and message-size assumptions.",
        "reference": "low24"
      },
      {
        "special": "maximum-matching",
        "general": "f-matching",
        "kind": "special-case",
        "upper": false,
        "lower": false,
        "reason": "Unit vertex capacities f(v)=1 recover cardinality matching on the same graph. The indexed f-matching theorem has its own capacity and supplied-expansion assumptions; a unit-capacity specialization is not inferred automatically.",
        "reference": "chw21"
      },
      {
        "special": "maximum-matching",
        "general": "b-matching",
        "kind": "special-case",
        "upper": false,
        "lower": false,
        "reason": "Unit capacities b(v)=1 force edge multiplicities to be zero or one, recovering cardinality matching. Capacity and supplied Lipschitz-bound assumptions must be instantiated explicitly.",
        "reference": "chw21"
      },
      {
        "special": "independent-set",
        "general": "integral-packing",
        "kind": "special-case",
        "upper": false,
        "lower": false,
        "reason": "Use binary vertex variables with x_u+x_v<=1 on every edge and x_v<=1 for every vertex, including isolates. This exact integer formulation does not certify communication on its constraint incidence graph.",
        "reference": "low24"
      },
      {
        "special": "other-packing",
        "general": "integral-packing",
        "kind": "special-case",
        "upper": false,
        "lower": false,
        "reason": "Exact occurrence formulation: one binary variable per candidate copy of H and a sum-at-most-one constraint per physical vertex. This follows from vertex-disjointness; occurrence enumeration and incidence-network simulation need separate analysis.",
        "reference": "chw08"
      },
      {
        "special": "maximum-matching",
        "general": "integral-packing",
        "kind": "special-case",
        "upper": false,
        "lower": false,
        "reason": "Use binary edge variables and sum of incident variables at most one at each vertex. This objective-preserving formulation alone does not certify a distributed integer-program simulation.",
        "reference": "chw21"
      },
      {
        "special": "f-matching",
        "general": "integral-packing",
        "kind": "special-case",
        "upper": false,
        "lower": false,
        "reason": "Use binary edge variables with each incident sum bounded by f(v). Integer capacities and the original graph representation remain essential; this structural formulation supplies no simulation theorem.",
        "reference": "chw21"
      },
      {
        "special": "b-matching",
        "general": "integral-packing",
        "kind": "special-case",
        "upper": false,
        "lower": false,
        "reason": "Use nonnegative integer edge variables with incident sum bounded by b(v). Multiplicities are allowed. This formulation does not remove the indexed algorithm's supplied Lipschitz-bound assumption.",
        "reference": "chw21"
      },
      {
        "special": "integral-packing",
        "general": "packing-lp",
        "kind": "relaxation",
        "upper": false,
        "lower": false,
        "reason": "Dropping integer or binary requirements leaves the positive packing LP, including any explicit variable upper bounds. Fractional feasibility and fractional OPT do not provide an integral output without additional rounding.",
        "reference": "low24"
      },
      {
        "special": "edge-dominating-set",
        "general": "dominating-set",
        "kind": "special-case",
        "upper": false,
        "lower": false,
        "reason": "Edges of G become vertices of the line graph L(G), with adjacency when the original edges meet. Dominating sets correspond exactly, but graph classes, degrees, process ownership, and message-model simulations can change. Structural browsing only.",
        "reference": "suomela10eds"
      },
      {
        "special": "distance-vertex-cover",
        "general": "set-cover",
        "kind": "special-case",
        "upper": false,
        "lower": false,
        "reason": "Use universe E and, for each candidate w, the set of edges uv for which both d(w,u)<=r and d(w,v)<=r. This is an exact reformulation of the source definition; its incidence network and communication distances change, so no bound transfers automatically.",
        "reference": "aw22"
      },
      {
        "special": "dominating-set",
        "general": "connected-dominating-set",
        "kind": "approximation-reduction",
        "upper": false,
        "lower": false,
        "reason": "A connected dominating set remains feasible for ordinary domination. On connected unweighted inputs, comparing integral optima gives factor 3 with the same round complexity.",
        "reference": "cwy00",
        "reductions": [
          "mds-via-connected-domination"
        ]
      },
      {
        "special": "connected-dominating-set",
        "general": "dominating-set",
        "kind": "approximation-reduction",
        "upper": false,
        "lower": false,
        "reason": "Connect a dominating set in four extra LOCAL rounds on connected unweighted inputs with distinct identifiers. The checked multiplier is 1+2∇₁ (7 on planar graphs, 3 on pseudoforests); see the recipe for the source size-bound clarification.",
        "reference": "amors18",
        "reductions": [
          "connected-domination-via-mds"
        ]
      }
    ],
    "references": {
      "asw26": {
        "title": "Amiri, Siebertz and Wawrzyniak (2026), Paying for Fractional Error, Section 6.6 and Appendix D",
        "url": "https://arxiv.org/pdf/2611.02057"
      },
      "kw05": {
        "title": "Kuhn and Wattenhofer (2005), Constant-time distributed dominating set approximation, Section 3",
        "url": "https://disco.ethz.ch/publications/distcomp05.pdf"
      },
      "as10": {
        "title": "Åstrand and Suomela (2010), Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks, Sections 1 and 5",
        "url": "https://jukkasuomela.fi/doc/vc-sc.pdf"
      },
      "beks19": {
        "title": "Ben-Basat, Even, Kawarabayashi and Schwartzman (2019), Optimal Distributed Covering Algorithms",
        "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.5"
      },
      "chsw14": {
        "title": "Czygrinow et al. (2014), Distributed Local Approximation of the Minimum k-Tuple Dominating Set in Planar Graphs",
        "url": "https://link.springer.com/chapter/10.1007/978-3-319-14472-6_4"
      },
      "aapr22": {
        "title": "Agrawal et al. (2022), Recurrent Problems in the LOCAL model",
        "url": "https://arxiv.org/abs/2212.14542"
      },
      "amors18": {
        "title": "Amiri et al. (2018), Distributed Domination on Graph Classes of Bounded Expansion",
        "url": "https://arxiv.org/abs/1702.02848"
      },
      "low24": {
        "title": "Li, Ouyang and Wang (2024), A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems, Section 1 and Theorem 2.1",
        "url": "https://arxiv.org/html/2409.16168v1"
      },
      "chw21": {
        "title": "Czygrinow, Hanćkowiak and Witkowski (2021), Distributed Approximations of f-Matchings and b-Matchings, Section 1",
        "url": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol212-isaac2021/LIPIcs.ISAAC.2021.59/LIPIcs.ISAAC.2021.59.pdf"
      },
      "aw22": {
        "title": "Amiri and Wiederhake (2022), Distributed distance-r covering problems on sparse high-girth graphs, Section 2",
        "url": "https://publikationen.sulb.uni-saarland.de/bitstream/20.500.11880/34562/1/1-s2.0-S0304397522000081-main.pdf"
      },
      "chw08": {
        "title": "Czygrinow, Hanckowiak and Wawrzyniak (2008), Distributed packing in planar graphs; occurrence formulation inferred from vertex-disjoint packing",
        "url": "https://asu.elsevierpure.com/en/publications/distributed-packing-in-planar-graphs/"
      },
      "suomela10eds": {
        "title": "Suomela (2010), Distributed Algorithms for Edge Dominating Sets, Section 1.1",
        "url": "https://jukkasuomela.fi/doc/eds.pdf"
      },
      "w26transfer": {
        "title": "Wawrzyniak (2026), Almost Lossless Transfer for Cuttable Distributed Problems, Section 8 (outside-solution definition of 2-domination)",
        "url": "https://arxiv.org/html/2610.15596v1#S8"
      },
      "cwy00": {
        "title": "Caro, West and Yuster, Connected Domination and Spanning Trees with Many Leaves, Lemma 2.1",
        "url": "https://math.haifa.ac.il/raphy/papers/conndom.pdf#page=4"
      }
    },
    "scopes": {
      "Dominating set": "dominating-set",
      "Total dominating set": "total-dominating-set",
      "Distance dominating set": "distance-dominating-set",
      "Connected dominating set": "connected-dominating-set",
      "k-tuple dominating set": "outside-k-domination",
      "Vertex cover": "vertex-cover",
      "Set cover": "set-cover",
      "Local covering": "local-covering",
      "Covering LP": "covering-lp",
      "Maximum matching": "maximum-matching",
      "Packing LP": "packing-lp",
      "Independent set": "independent-set",
      "Other packing": "other-packing",
      "Edge dominating set": "edge-dominating-set",
      "Local density": "local-density",
      "Distance-r vertex cover": "distance-vertex-cover",
      "Distance-r connected vertex cover": "connected-distance-vertex-cover",
      "Connected distance-r vertex cover": "connected-distance-vertex-cover"
    },
    "overrides": {
      "alipour-trianglefree-total-16": "total-dominating-set",
      "supported-client-planar": "client-dominating-set",
      "unitdisk-fractional-domination": "fractional-dominating-set",
      "gen-asw26-fractional": "fractional-local-covering",
      "gen-ako18-fractional": "fractional-matching",
      "amiri-connected-distance": "connected-distance-dominating-set",
      "pic-girth-cover-connected-dom": "connected-distance-dominating-set",
      "pic-sublog-fmatching": "f-matching",
      "pic-sublog-bmatching": "b-matching",
      "gen-w26-2dom": "outside-k-domination"
    },
    "resultParameters": {
      "amiri-distance": "r",
      "pic-girth-dom-2019": "r",
      "pic-girth-cycle-lower": "r",
      "pic-girth-cover-dom": "r",
      "planar-two-dom-six": "2",
      "planar-two-dom-seven": "2",
      "planar-two-dom-lower": "2",
      "gen-w26-2dom": "2",
      "pic-kdom-topological44": "2",
      "pic-thesis-planar-distance-dom": "k",
      "pic-thesis-genus-distance-dom": "k"
    }
  },
  "reductions": {
    "version": 1,
    "checked": "2026-11-16",
    "description": "A→B means that an algorithm for B can solve A under the stated construction and assumptions. T is the source runtime on the displayed virtual instance; α is its approximation guarantee in the stated minimization or maximization convention. Exact schedules are shown only when the construction certifies them. Conditional simulations require matching the source graph class, coefficients, costs and initial information. LP relaxation alone gives no integral solution.",
    "notation": {
      "T": "T",
      "T + 1": "T+1",
      "2T": "2T",
      "O(T + 1)": "O(T+1)",
      "α → α": "\\alpha\\longmapsto\\alpha",
      "α → 2α": "\\alpha\\longmapsto2\\alpha",
      "G": "G",
      "n": "n",
      "Δ": "\\Delta",
      "2n": "2n",
      "Δ + 1": "\\Delta+1",
      "n + m": "n+m",
      "max{Δ,2}": "\\max\\{\\Delta,2\\}",
      "m ≤ nΔ/2": "m\\le n\\Delta/2",
      "2Δ − 2": "2\\Delta-2",
      "Inc(N[G])": "\\operatorname{Inc}(N[G])",
      "Inc(E,V)": "\\operatorname{Inc}(E,V)",
      "L(G)": "L(G)",
      "Rounding required": "\\text{Rounding required}",
      "No integral guarantee": "\\text{No integral guarantee}",
      "m": "m",
      "Δ_L": "\\Delta_L",
      "n + 2m": "n+2m",
      "n+2m": "n+2m",
      "2m": "2m",
      "m_L": "m_L",
      "m_L = Σ_v binom(deg(v),2)": "m_L=\\sum_{v\\in V(G)}\\binom{\\deg(v)}{2}",
      "T + 4": "T+4",
      "α → 3α": "\\alpha\\mapsto3\\alpha",
      "α → (1 + 2∇₁)α": "\\alpha\\mapsto(1+2\\nabla_1)\\alpha",
      "1 + 2∇₁": "1+2\\nabla_1"
    },
    "entries": [
      {
        "id": "mds-to-local-covering",
        "title": "Closed-neighborhood requests",
        "from": "dominating-set",
        "to": "local-covering",
        "kind": "specialization",
        "status": "automatic",
        "runtime": "T",
        "guarantee": "α → α",
        "instance": {
          "graph": "G",
          "vertices": "n",
          "degree": "Δ",
          "description": "The original communication graph and its structural parameters are unchanged."
        },
        "models": [
          "LOCAL",
          "CONGEST",
          "Anonymous",
          "SUPPORTED"
        ],
        "conditions": [
          "Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags.",
          "Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved.",
          "The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required.",
          "T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated."
        ],
        "summary": "A local-covering algorithm directly solves ordinary domination on the same graph.",
        "source": {
          "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
          "url": "https://arxiv.org/pdf/2611.02057#page=43",
          "location": "Section 6.6; Appendix D"
        },
        "automatic": {
          "upper": true,
          "lower": true,
          "sourceProblem": "local-covering",
          "targetProblem": "dominating-set"
        },
        "relation": {
          "special": "dominating-set",
          "general": "local-covering"
        },
        "examples": [
          {
            "resultId": "gen-asw26-cover-det",
            "notes": "Unit costs give a deterministic dominating-set scheme; the source ID-bound assumption remains."
          },
          {
            "resultId": "gen-asw26-cover-random",
            "notes": "Unit costs preserve feasibility and the source expected-cost guarantee."
          }
        ],
        "engine": {
          "mode": "identity",
          "sourceScopes": [
            "local-covering"
          ],
          "graphMap": "same",
          "substitutions": {},
          "cost": "T",
          "factor": "identity",
          "targetVariant": "preserve",
          "upper": true,
          "lower": true,
          "assumptions": [
            "Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination."
          ]
        },
        "parameterDefinitions": [
          {
            "symbol": "T",
            "description": "Round complexity of the algorithm on the transformed instance",
            "tex": "T"
          },
          {
            "symbol": "α",
            "description": "Approximation ratio of the algorithm used by the reduction",
            "tex": "\\alpha"
          },
          {
            "symbol": "n",
            "description": "Number of vertices in the original communication graph",
            "tex": "n"
          },
          {
            "symbol": "m",
            "description": "Number of edges in the original communication graph",
            "tex": "m"
          },
          {
            "symbol": "Δ",
            "description": "Maximum degree of the original communication graph",
            "tex": "\\Delta"
          },
          {
            "symbol": "n′",
            "description": "Number of vertices in the transformed instance",
            "tex": "n'"
          },
          {
            "symbol": "Δ′",
            "description": "Maximum degree of the transformed instance",
            "tex": "\\Delta'"
          },
          {
            "symbol": "G",
            "description": "Original communication graph",
            "tex": "G"
          }
        ]
      },
      {
        "id": "total-domination-to-local-covering",
        "title": "Open-neighborhood requests",
        "from": "total-dominating-set",
        "to": "local-covering",
        "kind": "specialization",
        "status": "automatic",
        "runtime": "T",
        "guarantee": "α → α",
        "instance": {
          "graph": "G",
          "vertices": "n",
          "degree": "Δ",
          "description": "The original communication graph and its structural parameters are unchanged."
        },
        "models": [
          "LOCAL",
          "CONGEST",
          "Anonymous",
          "SUPPORTED"
        ],
        "conditions": [
          "Make every vertex a request and put C(v)=N(v), excluding self-coverage. These incidence flags are locally known from the input edges.",
          "The input must have no isolated vertices. Use unit costs for the unweighted problem; retain cost restrictions in weighted instances.",
          "The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required.",
          "T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated."
        ],
        "summary": "Replacing closed by open neighborhoods gives total domination without altering the graph.",
        "source": {
          "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
          "url": "https://arxiv.org/pdf/2611.02057#page=43",
          "location": "Section 6.6; Appendix D"
        },
        "automatic": {
          "upper": true,
          "lower": true,
          "sourceProblem": "local-covering",
          "targetProblem": "total-dominating-set"
        },
        "relation": {
          "special": "total-dominating-set",
          "general": "local-covering"
        },
        "examples": [
          {
            "resultId": "gen-asw26-cover-det",
            "notes": "Instantiate open neighborhoods on an isolate-free graph."
          },
          {
            "resultId": "gen-asw26-cover-random",
            "notes": "The always-feasible expected-cost scheme retains its original probability convention."
          }
        ],
        "engine": {
          "mode": "identity",
          "sourceScopes": [
            "local-covering"
          ],
          "graphMap": "same",
          "substitutions": {},
          "cost": "T",
          "factor": "identity",
          "targetVariant": "preserve",
          "upper": true,
          "lower": true,
          "assumptions": [
            "Instantiate requests V and candidate sets C(v)=N(v); the input has no isolated vertices."
          ]
        },
        "parameterDefinitions": [
          {
            "symbol": "T",
            "description": "Round complexity of the algorithm on the transformed instance",
            "tex": "T"
          },
          {
            "symbol": "α",
            "description": "Approximation ratio of the algorithm used by the reduction",
            "tex": "\\alpha"
          },
          {
            "symbol": "n",
            "description": "Number of vertices in the original communication graph",
            "tex": "n"
          },
          {
            "symbol": "m",
            "description": "Number of edges in the original communication graph",
            "tex": "m"
          },
          {
            "symbol": "Δ",
            "description": "Maximum degree of the original communication graph",
            "tex": "\\Delta"
          },
          {
            "symbol": "n′",
            "description": "Number of vertices in the transformed instance",
            "tex": "n'"
          },
          {
            "symbol": "Δ′",
            "description": "Maximum degree of the transformed instance",
            "tex": "\\Delta'"
          },
          {
            "symbol": "G",
            "description": "Original communication graph",
            "tex": "G"
          }
        ]
      },
      {
        "id": "client-domination-to-local-covering",
        "title": "Prescribed client requests",
        "from": "client-dominating-set",
        "to": "local-covering",
        "kind": "specialization",
        "status": "automatic",
        "runtime": "T + 1",
        "guarantee": "α → α",
        "instance": {
          "graph": "G",
          "vertices": "n",
          "degree": "Δ",
          "description": "The original communication graph and its structural parameters are unchanged."
        },
        "models": [
          "LOCAL",
          "CONGEST",
          "Anonymous",
          "SUPPORTED"
        ],
        "conditions": [
          "Use the client set R as the requests and put C(r)=N[r]. Each client initially knows its own membership in R.",
          "One setup round broadcasts client membership so both endpoints know request–candidate incidences. If these incidence flags are already supplied, the setup round can be omitted.",
          "Preserve any preprocessing allowed by SUPPORTED and every other source input convention.",
          "Upper-bound examples include this one-round setup. A client lower bound would shift by one round under this convention; unchanged exact lower-bound import is therefore disabled.",
          "The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required.",
          "T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated."
        ],
        "summary": "Designated-client domination is local covering, with an explicit setup cost for its labels.",
        "source": {
          "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
          "url": "https://arxiv.org/pdf/2611.02057#page=43",
          "location": "Section 6.6; Appendix D"
        },
        "automatic": {
          "upper": true,
          "lower": false,
          "sourceProblem": "local-covering",
          "targetProblem": "client-dominating-set"
        },
        "relation": {
          "special": "client-dominating-set",
          "general": "local-covering"
        },
        "examples": [
          {
            "resultId": "gen-asw26-cover-det",
            "notes": "Add one client-label broadcast unless incidence flags are already known."
          }
        ],
        "engine": {
          "mode": "identity",
          "sourceScopes": [
            "local-covering"
          ],
          "graphMap": "same",
          "substitutions": {},
          "cost": "T+1",
          "factor": "identity",
          "targetVariant": "preserve",
          "upper": true,
          "lower": false,
          "assumptions": [
            "Instantiate the client requests R and C(r)=N[r]. One setup round advertises membership in R, unless those incidence flags are initially supplied."
          ]
        },
        "parameterDefinitions": [
          {
            "symbol": "T",
            "description": "Round complexity of the algorithm on the transformed instance",
            "tex": "T"
          },
          {
            "symbol": "α",
            "description": "Approximation ratio of the algorithm used by the reduction",
            "tex": "\\alpha"
          },
          {
            "symbol": "n",
            "description": "Number of vertices in the original communication graph",
            "tex": "n"
          },
          {
            "symbol": "m",
            "description": "Number of edges in the original communication graph",
            "tex": "m"
          },
          {
            "symbol": "Δ",
            "description": "Maximum degree of the original communication graph",
            "tex": "\\Delta"
          },
          {
            "symbol": "n′",
            "description": "Number of vertices in the transformed instance",
            "tex": "n'"
          },
          {
            "symbol": "Δ′",
            "description": "Maximum degree of the transformed instance",
            "tex": "\\Delta'"
          },
          {
            "symbol": "G",
            "description": "Original communication graph",
            "tex": "G"
          }
        ]
      },
      {
        "id": "fractional-domination-to-local-covering",
        "title": "Fractional closed neighborhoods",
        "from": "fractional-dominating-set",
        "to": "fractional-local-covering",
        "kind": "specialization",
        "status": "automatic",
        "runtime": "T",
        "guarantee": "α → α",
        "instance": {
          "graph": "G",
          "vertices": "n",
          "degree": "Δ",
          "description": "The original communication graph and its structural parameters are unchanged."
        },
        "models": [
          "LOCAL",
          "CONGEST",
          "Anonymous",
          "SUPPORTED"
        ],
        "conditions": [
          "Use requests V, candidates C(v)=N[v], and the same nonnegative vertex variables. These flags are locally constructible.",
          "The fractional feasible region and objective are identical. Use unit costs for the unweighted relaxation; a weighted algorithm must accept the supplied costs.",
          "This produces fractional vertex values, not an integral dominating set.",
          "The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required.",
          "T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated."
        ],
        "summary": "Fractional domination is an exact same-graph instance of fractional local covering.",
        "source": {
          "title": "Amiri, Siebertz and Wawrzyniak, Paying for Fractional Error",
          "url": "https://arxiv.org/pdf/2611.02057#page=43",
          "location": "Section 6.6; Appendix D"
        },
        "automatic": {
          "upper": true,
          "lower": true,
          "sourceProblem": "fractional-local-covering",
          "targetProblem": "fractional-dominating-set"
        },
        "relation": {
          "special": "fractional-dominating-set",
          "general": "fractional-local-covering"
        },
        "examples": [
          {
            "resultId": "gen-asw26-fractional",
            "notes": "Unit costs and closed neighborhoods give a fractional dominating-set scheme."
          }
        ],
        "engine": {
          "mode": "identity",
          "sourceScopes": [
            "fractional-local-covering"
          ],
          "graphMap": "same",
          "substitutions": {},
          "cost": "T",
          "factor": "identity",
          "targetVariant": "preserve",
          "upper": true,
          "lower": true,
          "assumptions": [
            "Instantiate requests V and candidate sets C(v)=N[v]; retain fractional output."
          ]
        },
        "parameterDefinitions": [
          {
            "symbol": "T",
            "description": "Round complexity of the algorithm on the transformed instance",
            "tex": "T"
          },
          {
            "symbol": "α",
            "description": "Approximation ratio of the algorithm used by the reduction",
            "tex": "\\alpha"
          },
          {
            "symbol": "n",
            "description": "Number of vertices in the original communication graph",
            "tex": "n"
          },
          {
            "symbol": "m",
            "description": "Number of edges in the original communication graph",
            "tex": "m"
          },
          {
            "symbol": "Δ",
            "description": "Maximum degree of the original communication graph",
            "tex": "\\Delta"
          },
          {
            "symbol": "n′",
            "description": "Number of vertices in the transformed instance",
            "tex": "n'"
          },
          {
            "symbol": "Δ′",
            "description": "Maximum degree of the transformed instance",
            "tex": "\\Delta'"
          },
          {
            "symbol": "G",
            "description": "Original communication graph",
            "tex": "G"
          }
        ]
      },
      {
        "id": "mds-to-set-cover",
        "title": "Neighborhood set cover",
        "from": "dominating-set",
        "to": "set-cover",
        "kind": "simulation",
        "status": "conditional",
        "runtime": "2T",
        "guarantee": "α → α",
        "instance": {
          "graph": "Inc(N[G])",
          "vertices": "2n",
          "degree": "Δ + 1",
          "description": "One variable/set copy and one request/element copy per vertex, with a virtual edge for membership in a closed neighborhood. Self-membership is a local virtual edge."
        },
        "models": [
          "LOCAL",
          "CONGEST",
          "Anonymous"
        ],
        "conditions": [
          "Use universe V and the set N[v] for each candidate vertex v, with the candidate’s cost. A chosen set corresponds to choosing its vertex, so integral OPT is unchanged.",
          "Each real vertex hosts its two virtual copies. Precompute both outgoing message sets at a virtual round’s start, then deliver the set-copy and element-copy messages in two physical phases. This gives the displayed 2T schedule, including T=0.",
          "The maximum set size and element frequency are both at most Δ+1. Any source theorem’s initial labels and global parameter knowledge must be supplied or their setup cost added.",
          "Apply graph-class assumptions to the transformed incidence graph. Planarity is not preserved: planar K4 has closed-neighborhood incidence graph K4,4.",
          "The displayed CONGEST simulation is per-edge. Additional broadcast or stronger anonymity conventions must be checked for the particular algorithm.",
          "The transformed closed-neighborhood incidence graph has exactly n+2m edges: n self-incidences and two incidences for every original edge."
        ],
        "summary": "A dominating-set instance becomes integral set cover; the communication representation changes.",
        "source": {
          "title": "Kuhn and Wattenhofer, Constant-time distributed dominating set approximation",
          "url": "https://disco.ethz.ch/publications/distcomp05.pdf#page=2",
          "location": "Section 4; the incidence simulation is specified here"
        },
        "relation": {
          "special": "dominating-set",
          "general": "set-cover"
        },
        "examples": [
          {
            "resultId": "gen-as10-setcover",
            "notes": "For vertex weights at most W, substituting set size and frequency Δ+1 yields a weighted (Δ+1)-approximation in O((Δ+1)^4+(Δ+1)^2 log* W) rounds; anonymity conditions remain."
          }
        ],
        "engine": {
          "mode": "simulation",
          "sourceScopes": [
            "set-cover"
          ],
          "graphMap": {
            "incidence": "general",
            "bounded-incidence": "general",
            "general": "general"
          },
          "substitutions": {
            "n": "2n",
            "Δ": "Δ+1",
            "f": "Δ+1",
            "k": "Δ+1",
            "m": "n+2m"
          },
          "cost": "2T",
          "factor": "identity",
          "targetVariant": "preserve",
          "upper": true,
          "lower": false,
          "assumptions": [
            "Closed-neighborhood incidence network; each processor hosts a set-copy and an element-copy. Two role phases simulate one source round.",
            "Both set size and element frequency are at most Δ+1. Global algorithm inputs and stronger broadcast conventions require the source assumptions.",
            "Planar-incidence source algorithms are excluded: planar K4 transforms to K4,4."
          ]
        },
        "parameterDefinitions": [
          {
            "symbol": "T",
            "description": "Round complexity of the algorithm on the transformed instance",
            "tex": "T"
          },
          {
            "symbol": "α",
            "description": "Approximation ratio of the algorithm used by the reduction",
            "tex": "\\alpha"
          },
          {
            "symbol": "n",
            "description": "Number of vertices in the original communication graph",
            "tex": "n"
          },
          {
            "symbol": "m",
            "description": "Number of edges in the original communication graph",
            "tex": "m"
          },
          {
            "symbol": "Δ",
            "description": "Maximum degree of the original communication graph",
            "tex": "\\Delta"
          },
          {
            "symbol": "n′",
            "description": "Number of vertices in the transformed instance",
            "tex": "n'"
          },
          {
            "symbol": "Δ′",
            "description": "Maximum degree of the transformed instance",
            "tex": "\\Delta'"
          },
          {
            "symbol": "G",
            "description": "Original communication graph",
            "tex": "G"
          }
        ]
      },
      {
        "id": "vertex-cover-to-set-cover",
        "title": "Edges as universe elements",
        "from": "vertex-cover",
        "to": "set-cover",
        "kind": "simulation",
        "status": "conditional",
        "runtime": "T + 1",
        "guarantee": "α → α",
        "instance": {
          "graph": "Inc(E,V)",
          "vertices": "n + m",
          "degree": "max{Δ,2}",
          "description": "The vertex–edge incidence graph, obtained by subdividing each original edge once. Original-vertex processors have degree at most Δ; edge processors have degree two."
        },
        "models": [
          "LOCAL",
          "CONGEST"
        ],
        "conditions": [
          "Use universe E and one set of incident edges for each vertex, with the same vertex cost. Every element has frequency two, and each set has size at most Δ.",
          "A one-round identifier exchange lets endpoints agree on ownership and unique identifiers for virtual edge processors. One incidence round can then be simulated in one physical round, with local messages at the owner delivered locally. If the necessary endpoint identifiers are initially known, the setup can be omitted.",
          "The source theorem’s global instance-size or degree information must also be supplied; obtaining it is not hidden in T+1.",
          "Subdividing edges preserves planarity, but arbitrary incidence-network and minor promises still need checking. A generic per-edge simulation does not preserve a broadcast-only restriction.",
          "Anonymous broadcast algorithms can sometimes avoid identifier-based ownership; such a specialized simulation is not certified by this generic recipe.",
          "The displayed maximum degree max{Δ,2} applies when G has at least one edge. An edgeless instance is handled locally with the empty output; it is not passed to the incidence algorithm.",
          "The edge-subdivision incidence graph has exactly 2m edges, with two incidences for each original edge."
        ],
        "summary": "Vertex cover is set cover of the edges; its incidence graph is an edge subdivision.",
        "source": {
          "title": "Åstrand and Suomela, Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks",
          "url": "https://jukkasuomela.fi/doc/vc-sc.pdf",
          "location": "Sections 1 and 5; edge-processor simulation specified here"
        },
        "relation": {
          "special": "vertex-cover",
          "general": "set-cover"
        },
        "examples": [
          {
            "resultId": "gen-asw26-setcover",
            "notes": "On planar G, edge subdivision supplies a planar incidence graph; retain bounded costs and use the ordinary CONGEST simulation, without inferring a broadcast implementation."
          }
        ],
        "engine": {
          "mode": "simulation",
          "sourceScopes": [
            "set-cover"
          ],
          "graphMap": {
            "incidence": "general",
            "bounded-incidence": "general",
            "planar-incidence": "planar",
            "general": "general"
          },
          "substitutions": {
            "n": "n+m",
            "Δ": "max{Δ,2}",
            "f": "2",
            "k": "Δ",
            "m": "2m"
          },
          "cost": "T+1",
          "factor": "identity",
          "targetVariant": "preserve",
          "upper": true,
          "lower": false,
          "assumptions": [
            "Universe E with one incident-edge set per original vertex; the incidence graph subdivides every edge.",
            "One identifier-exchange setup round assigns virtual edge processors. Source global algorithm inputs must already be supplied or separately obtained.",
            "For the simulated algorithm, G has at least one edge. Edgeless instances have an empty optimal output handled locally."
          ]
        },
        "parameterDefinitions": [
          {
            "symbol": "T",
            "description": "Round complexity of the algorithm on the transformed instance",
            "tex": "T"
          },
          {
            "symbol": "α",
            "description": "Approximation ratio of the algorithm used by the reduction",
            "tex": "\\alpha"
          },
          {
            "symbol": "n",
            "description": "Number of vertices in the original communication graph",
            "tex": "n"
          },
          {
            "symbol": "m",
            "description": "Number of edges in the original communication graph",
            "tex": "m"
          },
          {
            "symbol": "Δ",
            "description": "Maximum degree of the original communication graph",
            "tex": "\\Delta"
          },
          {
            "symbol": "n′",
            "description": "Number of vertices in the transformed instance",
            "tex": "n'"
          },
          {
            "symbol": "Δ′",
            "description": "Maximum degree of the transformed instance",
            "tex": "\\Delta'"
          },
          {
            "symbol": "G",
            "description": "Original communication graph",
            "tex": "G"
          }
        ]
      },
      {
        "id": "fractional-domination-to-covering-lp",
        "title": "Closed-neighborhood covering matrix",
        "from": "fractional-dominating-set",
        "to": "covering-lp",
        "kind": "simulation",
        "status": "conditional",
        "runtime": "2T",
        "guarantee": "α → α",
        "instance": {
          "graph": "Inc(N[G])",
          "vertices": "2n",
          "degree": "Δ + 1",
          "description": "One variable/set copy and one request/element copy per vertex, with a virtual edge for membership in a closed neighborhood. Self-membership is a local virtual edge."
        },
        "models": [
          "LOCAL",
          "CONGEST"
        ],
        "conditions": [
          "Use A_uv=1 when u belongs to N[v], and zero otherwise, with one covering constraint per original vertex. Variables remain fractional.",
          "Host variable and constraint copies at each real vertex and simulate a virtual round in two role phases. The objective is preserved after any required cost normalization.",
          "The source algorithm’s coefficient, precision, normalization and initial-information assumptions must hold; these are not consequences of graph inclusion.",
          "In the unweighted 0–1 instance, maximum row and column sums are both Δ+1. Planarity of G does not imply planarity of this incidence graph.",
          "The transformed closed-neighborhood incidence graph has exactly n+2m edges: n self-incidences and two incidences for every original edge."
        ],
        "summary": "The fractional domination relaxation is a positive covering LP on a doubled incidence network.",
        "source": {
          "title": "Li, Ouyang and Wang, A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems",
          "url": "https://arxiv.org/html/2409.16168v1#S1",
          "location": "Section 1 (positive LPs and incidence communication); Theorem 2.1"
        },
        "examples": [
          {
            "resultId": "gen-low24-cover",
            "notes": "For unit costs, Γd=Γp=Δ+1 gives O((Δ+1) log(Δ+1)/ε²) simulated rounds, with logarithms interpreted as in the source."
          }
        ],
        "engine": {
          "mode": "simulation",
          "sourceScopes": [
            "covering-lp"
          ],
          "graphMap": {
            "incidence": "general",
            "general": "general"
          },
          "substitutions": {
            "n": "2n",
            "Δ": "Δ+1",
            "Γd": "Δ+1",
            "Γₚ": "Δ+1",
            "Γp": "Δ+1",
            "Amax": "1",
            "m": "n+2m"
          },
          "cost": "2T",
          "factor": "identity",
          "targetVariant": "Unweighted",
          "upper": true,
          "lower": false,
          "assumptions": [
            "Use the unweighted 0–1 closed-neighborhood covering matrix, with Γd=Γp=Δ+1; retain fractional output.",
            "Source normalized-coefficient, precision, bit-encoding and supplied-parameter assumptions remain."
          ]
        },
        "parameterDefinitions": [
          {
            "symbol": "T",
            "description": "Round complexity of the algorithm on the transformed instance",
            "tex": "T"
          },
          {
            "symbol": "α",
            "description": "Approximation ratio of the algorithm used by the reduction",
            "tex": "\\alpha"
          },
          {
            "symbol": "n",
            "description": "Number of vertices in the original communication graph",
            "tex": "n"
          },
          {
            "symbol": "m",
            "description": "Number of edges in the original communication graph",
            "tex": "m"
          },
          {
            "symbol": "Δ",
            "description": "Maximum degree of the original communication graph",
            "tex": "\\Delta"
          },
          {
            "symbol": "n′",
            "description": "Number of vertices in the transformed instance",
            "tex": "n'"
          },
          {
            "symbol": "Δ′",
            "description": "Maximum degree of the transformed instance",
            "tex": "\\Delta'"
          },
          {
            "symbol": "G",
            "description": "Original communication graph",
            "tex": "G"
          }
        ]
      },
      {
        "id": "fractional-vertex-cover-to-covering-lp",
        "title": "Edge constraints",
        "from": "fractional-vertex-cover",
        "to": "covering-lp",
        "kind": "simulation",
        "status": "conditional",
        "runtime": "T + 1",
        "guarantee": "α → α",
        "instance": {
          "graph": "Inc(E,V)",
          "vertices": "n + m",
          "degree": "max{Δ,2}",
          "description": "The vertex–edge incidence graph, obtained by subdividing each original edge once. Original-vertex processors have degree at most Δ; edge processors have degree two."
        },
        "models": [
          "LOCAL",
          "CONGEST"
        ],
        "conditions": [
          "Use one variable x_v per vertex and the inequality x_u+x_v≥1 for every edge uv. The positive objective uses the original vertex costs.",
          "Use identifier-based edge-processor ownership with at most one setup round, as in the vertex-cover incidence simulation. Any extra global algorithm input must be supplied separately.",
          "For unit costs, each row has sum two and each column has sum at most Δ. Weighted normalization must meet the chosen LP algorithm’s coefficient and encoding requirements.",
          "The output is fractional. Integral vertex cover requires a separate rounding step, such as the threshold recipe.",
          "The displayed maximum degree max{Δ,2} applies when G has at least one edge. An edgeless instance is handled locally with the empty output; it is not passed to the incidence algorithm.",
          "The edge-subdivision incidence graph has exactly 2m edges, with two incidences for each original edge."
        ],
        "summary": "Fractional vertex cover is a row-sparse positive covering LP on the vertex–edge incidence graph.",
        "source": {
          "title": "Li, Ouyang and Wang, A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems",
          "url": "https://arxiv.org/html/2409.16168v1#S1",
          "location": "Section 1 (positive LPs and incidence communication); Theorem 2.1"
        },
        "examples": [
          {
            "resultId": "gen-low24-cover",
            "notes": "For the unweighted matrix, Γd=2 and Γp≤Δ; the source bound becomes O(log Δ/ε²) plus setup, with truncated logarithms."
          }
        ],
        "engine": {
          "mode": "simulation",
          "sourceScopes": [
            "covering-lp"
          ],
          "graphMap": {
            "incidence": "general",
            "planar-incidence": "planar",
            "general": "general"
          },
          "substitutions": {
            "n": "n+m",
            "Δ": "max{Δ,2}",
            "Γd": "2",
            "Γₚ": "Δ",
            "Γp": "Δ",
            "Amax": "1",
            "m": "2m"
          },
          "cost": "T+1",
          "factor": "identity",
          "targetVariant": "Unweighted",
          "upper": true,
          "lower": false,
          "assumptions": [
            "Use the unweighted 0–1 matrix A with one row per edge and one column per vertex; Γd=2 and Γp≤Δ.",
            "One identifier-exchange setup round assigns edge-constraint processors; preserve the source normalization, precision, encoding and global-input assumptions.",
            "For the simulated algorithm, G has at least one edge. Edgeless instances have an empty optimal output handled locally."
          ]
        },
        "parameterDefinitions": [
          {
            "symbol": "T",
            "description": "Round complexity of the algorithm on the transformed instance",
            "tex": "T"
          },
          {
            "symbol": "α",
            "description": "Approximation ratio of the algorithm used by the reduction",
            "tex": "\\alpha"
          },
          {
            "symbol": "n",
            "description": "Number of vertices in the original communication graph",
            "tex": "n"
          },
          {
            "symbol": "m",
            "description": "Number of edges in the original communication graph",
            "tex": "m"
          },
          {
            "symbol": "Δ",
            "description": "Maximum degree of the original communication graph",
            "tex": "\\Delta"
          },
          {
            "symbol": "n′",
            "description": "Number of vertices in the transformed instance",
            "tex": "n'"
          },
          {
            "symbol": "Δ′",
            "description": "Maximum degree of the transformed instance",
            "tex": "\\Delta'"
          },
          {
            "symbol": "G",
            "description": "Original communication graph",
            "tex": "G"
          }
        ]
      },
      {
        "id": "fractional-matching-to-packing-lp",
        "title": "Vertex-capacity packing constraints",
        "from": "fractional-matching",
        "to": "packing-lp",
        "kind": "simulation",
        "status": "conditional",
        "runtime": "O(T + 1)",
        "guarantee": "α → α",
        "instance": {
          "graph": "Inc(E,V)",
          "vertices": "n + m",
          "degree": "max{Δ,2}",
          "description": "The vertex–edge incidence graph, obtained by subdividing each original edge once. Original-vertex processors have degree at most Δ; edge processors have degree two."
        },
        "models": [
          "LOCAL",
          "CONGEST"
        ],
        "conditions": [
          "Use one nonnegative variable per edge, with incident-variable sum at most one at each vertex. The objective is matching cardinality or the supplied edge weights.",
          "Host an edge-variable processor at an endpoint agreed by an identifier exchange; one incidence round then takes one physical round. A final output notification lets both endpoints learn their edge value. Setup and notification give O(T+1); any extra source parameter knowledge must be supplied separately.",
          "For unit edge weights, write the algorithm’s dual as max 1ᵀy subject to Aᵀy≤1, with A the edge-by-vertex 0–1 incidence matrix. Then Γd=2 and Γp≤Δ. The selected packing theorem’s normalization and bit encoding must hold.",
          "Fractional degree constraints do not enforce integral matching on nonbipartite graphs. No rounding or odd-set constraints are included.",
          "The displayed maximum degree max{Δ,2} applies when G has at least one edge. An edgeless instance is handled locally with the empty output; it is not passed to the incidence algorithm.",
          "The edge-subdivision incidence graph has exactly 2m edges, with two incidences for each original edge."
        ],
        "summary": "Fractional matching is a packing LP; this does not turn fractional solutions into edge sets.",
        "source": {
          "title": "Li, Ouyang and Wang, A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems",
          "url": "https://arxiv.org/html/2409.16168v1#S1",
          "location": "Section 1 (positive LPs and incidence communication); Theorem 2.1"
        },
        "relation": {
          "special": "fractional-matching",
          "general": "packing-lp"
        },
        "examples": [
          {
            "resultId": "gen-low24-pack",
            "notes": "In the source convention A has one row per edge and one column per vertex: Γd=2 and Γp≤Δ. The feasible fractional value is at least OPT/(1+ε), in O(log Δ/ε²+1) simulated rounds, with truncated logarithms."
          }
        ],
        "engine": {
          "mode": "simulation",
          "sourceScopes": [
            "packing-lp"
          ],
          "graphMap": {
            "incidence": "general",
            "planar-incidence": "planar",
            "general": "general"
          },
          "substitutions": {
            "n": "n+m",
            "Δ": "max{Δ,2}",
            "Γd": "2",
            "Γₚ": "Δ",
            "Γp": "Δ",
            "Amax": "1",
            "m": "2m"
          },
          "cost": "O(T+1)",
          "factor": "identity",
          "targetVariant": "Unweighted",
          "upper": true,
          "lower": false,
          "assumptions": [
            "Use the unweighted 0–1 matrix A=edge×vertex in the source dual form max 1ᵀy subject to Aᵀy≤1, so Γd=2 and Γp≤Δ.",
            "Setup assigns an edge-variable host; output notification makes the edge value known at both endpoints. Retain all source precision, encoding and global-input assumptions.",
            "For the simulated algorithm, G has at least one edge. Edgeless instances have an empty optimal output handled locally."
          ]
        },
        "parameterDefinitions": [
          {
            "symbol": "T",
            "description": "Round complexity of the algorithm on the transformed instance",
            "tex": "T"
          },
          {
            "symbol": "α",
            "description": "Approximation ratio of the algorithm used by the reduction",
            "tex": "\\alpha"
          },
          {
            "symbol": "n",
            "description": "Number of vertices in the original communication graph",
            "tex": "n"
          },
          {
            "symbol": "m",
            "description": "Number of edges in the original communication graph",
            "tex": "m"
          },
          {
            "symbol": "Δ",
            "description": "Maximum degree of the original communication graph",
            "tex": "\\Delta"
          },
          {
            "symbol": "n′",
            "description": "Number of vertices in the transformed instance",
            "tex": "n'"
          },
          {
            "symbol": "Δ′",
            "description": "Maximum degree of the transformed instance",
            "tex": "\\Delta'"
          },
          {
            "symbol": "G",
            "description": "Original communication graph",
            "tex": "G"
          }
        ]
      },
      {
        "id": "edge-domination-to-domination",
        "title": "Domination on the line graph",
        "from": "edge-dominating-set",
        "to": "dominating-set",
        "kind": "simulation",
        "status": "conditional",
        "runtime": "O(T + 1)",
        "guarantee": "α → α",
        "instance": {
          "graph": "L(G)",
          "vertices": "m",
          "degree": "Δ_L",
          "description": "There is one virtual vertex per original edge. Two virtual vertices are adjacent exactly when their original edges share an endpoint. Here m=|E(G)| and Δ_L=max over uv∈E(G) of (deg(u)+deg(v)−2); Δ_L≤2Δ−2 when the graph has an edge. Edgeless inputs return the empty set locally."
        },
        "models": [
          "LOCAL"
        ],
        "conditions": [
          "A selected vertex of L(G) corresponds to the original edge. Feasibility and cardinality OPT agree; weighted transfer additionally requires an algorithm accepting the corresponding vertex weights.",
          "Assign each virtual edge-node to an endpoint. With unrestricted LOCAL messages, a virtual round routes through shared endpoints in at most two physical rounds; constant setup and output notification give O(T+1).",
          "The source algorithm must accept the line graph’s n′, Δ′, IDs and any supplied parameters. Obtaining global information is not free.",
          "A line graph can be much denser and need not preserve planarity: the line graph of a star is a clique.",
          "This recipe claims LOCAL only. Arbitrary different messages along virtual adjacencies can create congestion at physical edges, so an O(T) CONGEST simulation is not inferred.",
          "Exact algorithm substitutions use n′=m and Δ′=Δ_L, where Δ_L=max_{uv∈E(G)}(deg(u)+deg(v)−2). The displayed 2Δ−2 is an upper bound, not an exact substitution in a nonmonotone theorem.",
          "For simple G, m_L=sum_v binom(deg(v),2) is the exact number of edges of L(G). It is retained symbolically rather than replaced by a monotone upper bound."
        ],
        "summary": "Edge domination is ordinary domination after replacing edges by line-graph vertices.",
        "source": {
          "title": "Suomela, Distributed Algorithms for Edge Dominating Sets",
          "url": "https://jukkasuomela.fi/doc/eds.pdf#page=1",
          "location": "Section 1.1 (line-graph correspondence); LOCAL simulation specified here"
        },
        "relation": {
          "special": "edge-dominating-set",
          "general": "dominating-set"
        },
        "engine": {
          "mode": "simulation",
          "sourceScopes": [
            "dominating-set"
          ],
          "graphMap": {
            "general": "general"
          },
          "substitutions": {
            "n": "m",
            "Δ": "Δ_L",
            "m": "m_L"
          },
          "cost": "O(T+1)",
          "factor": "identity",
          "targetVariant": "preserve",
          "upper": true,
          "lower": false,
          "assumptions": [
            "Apply the dominating-set algorithm to L(G); generic transfer is certified only from unrestricted general-graph LOCAL algorithms.",
            "Virtual line-graph rounds route through shared endpoints in at most two physical rounds. Retain global-input assumptions; setup and output notification are included.",
            "Here m=|E(G)| and Δ_L=max over uv∈E(G) of (deg(u)+deg(v)−2), the exact maximum degree of L(G); Δ_L≤2Δ−2. If m=0, return the empty edge set locally.",
            "For simple G, m_L=sum_v binom(deg(v),2) is the exact number of edges of L(G). It is retained symbolically rather than replaced by a monotone upper bound."
          ]
        },
        "parameterDefinitions": [
          {
            "symbol": "T",
            "description": "Round complexity of the algorithm on the transformed instance",
            "tex": "T"
          },
          {
            "symbol": "α",
            "description": "Approximation ratio of the algorithm used by the reduction",
            "tex": "\\alpha"
          },
          {
            "symbol": "n",
            "description": "Number of vertices in the original communication graph",
            "tex": "n"
          },
          {
            "symbol": "m",
            "description": "Number of edges in the original communication graph",
            "tex": "m"
          },
          {
            "symbol": "Δ",
            "description": "Maximum degree of the original communication graph",
            "tex": "\\Delta"
          },
          {
            "symbol": "n′",
            "description": "Number of vertices in the transformed instance",
            "tex": "n'"
          },
          {
            "symbol": "Δ′",
            "description": "Maximum degree of the transformed instance",
            "tex": "\\Delta'"
          },
          {
            "symbol": "G",
            "description": "Original communication graph",
            "tex": "G"
          },
          {
            "symbol": "Δ_L",
            "description": "Maximum degree of the line graph L(G)",
            "tex": "\\Delta_L"
          },
          {
            "symbol": "m_L",
            "description": "Number of edges of the line graph L(G)",
            "tex": "m_L"
          }
        ]
      },
      {
        "id": "matching-to-f-matching",
        "title": "Unit simple capacities",
        "from": "maximum-matching",
        "to": "f-matching",
        "kind": "specialization",
        "status": "conditional",
        "runtime": "T",
        "guarantee": "α → α",
        "instance": {
          "graph": "G",
          "vertices": "n",
          "degree": "Δ",
          "description": "The original communication graph and its structural parameters are unchanged."
        },
        "models": [
          "LOCAL",
          "CONGEST",
          "Anonymous",
          "SUPPORTED"
        ],
        "conditions": [
          "Set every vertex capacity f(v)=1. Then every feasible f-matching is an ordinary matching, with the same cardinality OPT.",
          "The indexed f-matching theorem is unweighted; no weighted guarantee is inferred unless the source algorithm explicitly supports weights.",
          "Source expansion bounds, identifiers and any supplied structural parameters remain required. Choosing unit capacities does not remove them."
        ],
        "summary": "Ordinary cardinality matching is the unit-capacity case of simple f-matching.",
        "source": {
          "title": "Czygrinow, Hańćkowiak and Witkowski, Distributed Approximations of f-Matchings and b-Matchings",
          "url": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol212-isaac2021/LIPIcs.ISAAC.2021.59/LIPIcs.ISAAC.2021.59.pdf#page=1",
          "location": "Section 1 (unit-capacity specializations)"
        },
        "relation": {
          "special": "maximum-matching",
          "general": "f-matching"
        },
        "examples": [
          {
            "resultId": "pic-sublog-fmatching",
            "notes": "Set f(v)=1 while retaining the source sub-logarithmic-expansion and input assumptions."
          }
        ],
        "engine": {
          "mode": "parameters",
          "sourceScopes": [
            "f-matching"
          ],
          "graphMap": "same",
          "substitutions": {
            "f": "1"
          },
          "cost": "T",
          "factor": "identity",
          "targetVariant": "preserve",
          "upper": true,
          "lower": false,
          "assumptions": [
            "Set the capacity function f(v)=1 everywhere. The source objective, weight support and structural-input assumptions remain."
          ]
        },
        "parameterDefinitions": [
          {
            "symbol": "T",
            "description": "Round complexity of the algorithm on the transformed instance",
            "tex": "T"
          },
          {
            "symbol": "α",
            "description": "Approximation ratio of the algorithm used by the reduction",
            "tex": "\\alpha"
          },
          {
            "symbol": "n",
            "description": "Number of vertices in the original communication graph",
            "tex": "n"
          },
          {
            "symbol": "m",
            "description": "Number of edges in the original communication graph",
            "tex": "m"
          },
          {
            "symbol": "Δ",
            "description": "Maximum degree of the original communication graph",
            "tex": "\\Delta"
          },
          {
            "symbol": "n′",
            "description": "Number of vertices in the transformed instance",
            "tex": "n'"
          },
          {
            "symbol": "Δ′",
            "description": "Maximum degree of the transformed instance",
            "tex": "\\Delta'"
          },
          {
            "symbol": "G",
            "description": "Original communication graph",
            "tex": "G"
          }
        ]
      },
      {
        "id": "matching-to-b-matching",
        "title": "Unit multiplicity capacities",
        "from": "maximum-matching",
        "to": "b-matching",
        "kind": "specialization",
        "status": "conditional",
        "runtime": "T",
        "guarantee": "α → α",
        "instance": {
          "graph": "G",
          "vertices": "n",
          "degree": "Δ",
          "description": "The original communication graph and its structural parameters are unchanged."
        },
        "models": [
          "LOCAL",
          "CONGEST",
          "Anonymous",
          "SUPPORTED"
        ],
        "conditions": [
          "Set b(v)=1 at every vertex. This forces every edge multiplicity to be zero or one, and the feasible solutions and cardinality optimum equal ordinary matching.",
          "Unit capacities satisfy the source Lipschitz condition with L=1; supply that value if the algorithm requires it.",
          "The indexed result is unweighted and its expansion, identifiers and structural-parameter assumptions remain. No arbitrary weighted version is inferred."
        ],
        "summary": "The integer-multiplicity formulation reduces to ordinary matching at unit capacities.",
        "source": {
          "title": "Czygrinow, Hańćkowiak and Witkowski, Distributed Approximations of f-Matchings and b-Matchings",
          "url": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol212-isaac2021/LIPIcs.ISAAC.2021.59/LIPIcs.ISAAC.2021.59.pdf#page=1",
          "location": "Section 1 (unit-capacity specializations)"
        },
        "relation": {
          "special": "maximum-matching",
          "general": "b-matching"
        },
        "examples": [
          {
            "resultId": "pic-sublog-bmatching",
            "notes": "Instantiate b≡1 and the known Lipschitz value L=1; keep the remaining source assumptions."
          }
        ],
        "engine": {
          "mode": "parameters",
          "sourceScopes": [
            "b-matching"
          ],
          "graphMap": "same",
          "substitutions": {
            "b": "1",
            "L": "1"
          },
          "cost": "T",
          "factor": "identity",
          "targetVariant": "preserve",
          "upper": true,
          "lower": false,
          "assumptions": [
            "Set b(v)=1 everywhere and supply L=1 where the source asks for a Lipschitz bound. The source objective, weight support and structural-input assumptions remain."
          ]
        },
        "parameterDefinitions": [
          {
            "symbol": "T",
            "description": "Round complexity of the algorithm on the transformed instance",
            "tex": "T"
          },
          {
            "symbol": "α",
            "description": "Approximation ratio of the algorithm used by the reduction",
            "tex": "\\alpha"
          },
          {
            "symbol": "n",
            "description": "Number of vertices in the original communication graph",
            "tex": "n"
          },
          {
            "symbol": "m",
            "description": "Number of edges in the original communication graph",
            "tex": "m"
          },
          {
            "symbol": "Δ",
            "description": "Maximum degree of the original communication graph",
            "tex": "\\Delta"
          },
          {
            "symbol": "n′",
            "description": "Number of vertices in the transformed instance",
            "tex": "n'"
          },
          {
            "symbol": "Δ′",
            "description": "Maximum degree of the transformed instance",
            "tex": "\\Delta'"
          },
          {
            "symbol": "G",
            "description": "Original communication graph",
            "tex": "G"
          }
        ]
      },
      {
        "id": "mds-to-fractional-domination",
        "title": "Drop integrality",
        "from": "dominating-set",
        "to": "fractional-dominating-set",
        "kind": "relaxation",
        "status": "relaxation",
        "runtime": "Rounding required",
        "guarantee": "No integral guarantee",
        "instance": {
          "graph": "G",
          "vertices": "n",
          "degree": "Δ",
          "description": "The original communication graph and its structural parameters are unchanged."
        },
        "models": [
          "LOCAL",
          "CONGEST"
        ],
        "conditions": [
          "Binary vertex choices are replaced by nonnegative values satisfying all closed-neighborhood constraints. The fractional optimum can be strictly smaller.",
          "An α-approximate fractional vector is not itself an integral dominating set. A rounding theorem must supply both its approximation loss and additional rounds.",
          "The displayed link records the relaxation only; it imports neither an integral upper bound nor an integral-output lower bound."
        ],
        "summary": "Covering-LP solutions relate to domination through a relaxation, not an automatic integral algorithm.",
        "source": {
          "title": "Kuhn and Wattenhofer, Constant-time distributed dominating set approximation",
          "url": "https://disco.ethz.ch/publications/distcomp05.pdf#page=2",
          "location": "Section 4; the incidence simulation is specified here"
        },
        "relation": {
          "special": "dominating-set",
          "general": "fractional-dominating-set"
        },
        "parameterDefinitions": [
          {
            "symbol": "T",
            "description": "Round complexity of the algorithm on the transformed instance",
            "tex": "T"
          },
          {
            "symbol": "α",
            "description": "Approximation ratio of the algorithm used by the reduction",
            "tex": "\\alpha"
          },
          {
            "symbol": "n",
            "description": "Number of vertices in the original communication graph",
            "tex": "n"
          },
          {
            "symbol": "m",
            "description": "Number of edges in the original communication graph",
            "tex": "m"
          },
          {
            "symbol": "Δ",
            "description": "Maximum degree of the original communication graph",
            "tex": "\\Delta"
          },
          {
            "symbol": "n′",
            "description": "Number of vertices in the transformed instance",
            "tex": "n'"
          },
          {
            "symbol": "Δ′",
            "description": "Maximum degree of the transformed instance",
            "tex": "\\Delta'"
          },
          {
            "symbol": "G",
            "description": "Original communication graph",
            "tex": "G"
          }
        ]
      },
      {
        "id": "vertex-cover-to-fractional-cover-rounding",
        "title": "Threshold at one half",
        "from": "vertex-cover",
        "to": "fractional-vertex-cover",
        "kind": "rounding",
        "status": "conditional",
        "runtime": "T",
        "guarantee": "α → 2α",
        "instance": {
          "graph": "G",
          "vertices": "n",
          "degree": "Δ",
          "description": "The original communication graph and its structural parameters are unchanged."
        },
        "models": [
          "LOCAL",
          "CONGEST",
          "Anonymous",
          "SUPPORTED"
        ],
        "conditions": [
          "The algorithm returns a feasible fractional vertex cover x on the original graph, and each vertex knows its own coordinate. Let D contain exactly the vertices with x_v≥1/2.",
          "Every edge has an endpoint in D because x_u+x_v≥1. For nonnegative vertex costs, cost(D) is at most twice the fractional solution cost, hence at most 2α times integral OPT.",
          "Thresholding is local and needs no extra communication. If the fractional algorithm runs on a separate incidence network, its simulation cost must be added before using this recipe.",
          "This recipe changes the factor from α to 2α and is therefore separate from the unrounded relaxation link; it is not an approximation-preserving automatic import."
        ],
        "summary": "A feasible fractional vertex cover has a deterministic local rounding with a factor-two loss.",
        "source": {
          "title": "Kuhn, Moscibroda and Wattenhofer, Local Computation: Lower and Upper Bounds",
          "url": "https://disco.ethz.ch/courses/fs11/podc/readingAssignment/localComputationJACM.pdf#page=31",
          "location": "Section 5.1 (threshold rounding of fractional vertex cover)"
        },
        "relation": {
          "special": "vertex-cover",
          "general": "fractional-vertex-cover"
        },
        "engine": {
          "mode": "rounding",
          "sourceScopes": [
            "fractional-vertex-cover"
          ],
          "graphMap": "same",
          "substitutions": {},
          "cost": "T",
          "factor": "double",
          "targetVariant": "preserve",
          "upper": true,
          "lower": false,
          "assumptions": [
            "The source provides a feasible fractional vertex cover on the physical input graph, with x_v locally known. Select v exactly when x_v≥1/2.",
            "This local operation multiplies a minimization approximation factor by two and preserves the source weight assumptions."
          ]
        },
        "parameterDefinitions": [
          {
            "symbol": "T",
            "description": "Round complexity of the algorithm on the transformed instance",
            "tex": "T"
          },
          {
            "symbol": "α",
            "description": "Approximation ratio of the algorithm used by the reduction",
            "tex": "\\alpha"
          },
          {
            "symbol": "n",
            "description": "Number of vertices in the original communication graph",
            "tex": "n"
          },
          {
            "symbol": "m",
            "description": "Number of edges in the original communication graph",
            "tex": "m"
          },
          {
            "symbol": "Δ",
            "description": "Maximum degree of the original communication graph",
            "tex": "\\Delta"
          },
          {
            "symbol": "n′",
            "description": "Number of vertices in the transformed instance",
            "tex": "n'"
          },
          {
            "symbol": "Δ′",
            "description": "Maximum degree of the transformed instance",
            "tex": "\\Delta'"
          },
          {
            "symbol": "G",
            "description": "Original communication graph",
            "tex": "G"
          }
        ]
      },
      {
        "id": "mds-via-connected-domination",
        "title": "Reuse a connected dominating set",
        "from": "dominating-set",
        "to": "connected-dominating-set",
        "kind": "approximation",
        "status": "conditional",
        "runtime": "T",
        "guarantee": "α → 3α",
        "instance": {
          "graph": "G",
          "vertices": "n",
          "degree": "Δ",
          "description": "The same connected input graph, restricted to unit vertex costs. All source algorithm inputs remain required."
        },
        "models": [
          "LOCAL",
          "CONGEST",
          "Anonymous",
          "SUPPORTED"
        ],
        "conditions": [
          "On a nonempty connected graph with unit vertex costs, run the source connected-dominating-set algorithm and return exactly its selected vertices as an ordinary dominating set.",
          "OPT_MDS ≤ OPT_CDS ≤ 3 OPT_MDS − 2. Thus an α-approximation against integral OPT_CDS gives a 3α-approximation against integral OPT_MDS, with no additional communication.",
          "The optimum comparison is unweighted. On a three-vertex path with costs (1,M,1), ordinary domination costs at most 2 while every connected dominating set costs at least M.",
          "The target remains restricted to connected inputs. Do not extend a connected-input algorithm to disconnected networks without checking component-wise operation, termination and global inputs.",
          "No fractional-MDS benchmark or lower-bound transfer is inferred by this factor-changing rule."
        ],
        "summary": "Reuse a connected dominating set without extra rounds; comparing the unweighted optima costs a factor of at most three.",
        "source": {
          "title": "Caro, West and Yuster, Connected Domination and Spanning Trees with Many Leaves",
          "url": "https://math.haifa.ac.il/raphy/papers/conndom.pdf#page=4",
          "location": "Lemma 2.1, Duchet–Meyniel inequality; zero-round output reuse is a direct consequence."
        },
        "relation": {
          "special": "dominating-set",
          "general": "connected-dominating-set"
        },
        "engine": {
          "mode": "rounding",
          "sourceScopes": [
            "connected-dominating-set"
          ],
          "graphMap": "same",
          "substitutions": {},
          "cost": "T",
          "factor": "multiply",
          "multiplier": {
            "default": {
              "label": "3",
              "tex": "3"
            },
            "graphBounds": []
          },
          "targetVariant": "Unweighted",
          "sourceGuards": {
            "objective": "min",
            "weightCondition": "weights-unweighted",
            "outputKind": "integral-vertex-set",
            "benchmarks": [
              "integral"
            ]
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected"
          ],
          "upper": true,
          "lower": false,
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ]
        },
        "parameterDefinitions": [
          {
            "symbol": "T",
            "description": "Round complexity of the algorithm on the transformed instance",
            "tex": "T"
          },
          {
            "symbol": "α",
            "description": "Approximation ratio of the algorithm used by the reduction",
            "tex": "\\alpha"
          },
          {
            "symbol": "n",
            "description": "Number of vertices in the original communication graph",
            "tex": "n"
          },
          {
            "symbol": "m",
            "description": "Number of edges in the original communication graph",
            "tex": "m"
          },
          {
            "symbol": "Δ",
            "description": "Maximum degree of the original communication graph",
            "tex": "\\Delta"
          },
          {
            "symbol": "n′",
            "description": "Number of vertices in the transformed instance",
            "tex": "n'"
          },
          {
            "symbol": "Δ′",
            "description": "Maximum degree of the transformed instance",
            "tex": "\\Delta'"
          },
          {
            "symbol": "G",
            "description": "Original communication graph",
            "tex": "G"
          }
        ]
      },
      {
        "id": "connected-domination-via-mds",
        "title": "Connect a dominating set locally",
        "from": "connected-dominating-set",
        "to": "dominating-set",
        "kind": "approximation",
        "status": "conditional",
        "runtime": "T + 4",
        "guarantee": "α → (1 + 2∇₁)α",
        "instance": {
          "graph": "G",
          "vertices": "n",
          "degree": "Δ",
          "description": "The same connected input graph, restricted to unit vertex costs. All source algorithm inputs remain required."
        },
        "models": [
          "LOCAL"
        ],
        "parameterDefinitions": [
          {
            "symbol": "T",
            "description": "Round complexity of the algorithm on the transformed instance",
            "tex": "T"
          },
          {
            "symbol": "α",
            "description": "Approximation ratio of the algorithm used by the reduction",
            "tex": "\\alpha"
          },
          {
            "symbol": "n",
            "description": "Number of vertices in the original communication graph",
            "tex": "n"
          },
          {
            "symbol": "m",
            "description": "Number of edges in the original communication graph",
            "tex": "m"
          },
          {
            "symbol": "Δ",
            "description": "Maximum degree of the original communication graph",
            "tex": "\\Delta"
          },
          {
            "symbol": "n′",
            "description": "Number of vertices in the transformed instance",
            "tex": "n'"
          },
          {
            "symbol": "Δ′",
            "description": "Maximum degree of the transformed instance",
            "tex": "\\Delta'"
          },
          {
            "symbol": "G",
            "description": "Original communication graph",
            "tex": "G"
          },
          {
            "symbol": "∇₁",
            "tex": "\\nabla_1",
            "description": "Maximum |E(H)|/|V(H)| over depth-one shallow minors H of the input graph; needed only for the size analysis"
          }
        ],
        "conditions": [
          "The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first.",
          "Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices.",
          "For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices.",
          "The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance.",
          "Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network.",
          "This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred.",
          "Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio."
        ],
        "summary": "Connect a dominating set in four extra LOCAL rounds with checked multiplier 1+2∇₁: 7 on planar graphs, 3 on pseudoforests.",
        "source": {
          "title": "Amiri, Ossona de Mendez, Rabinovich and Siebertz, Distributed Domination on Graph Classes of Bounded Expansion",
          "url": "https://arxiv.org/html/1702.02848v2#S5",
          "location": "Section 5, Lemmas 14–16 and Theorem 17. Construction and 3r+1 schedule at r=1; conservative size count independently checked."
        },
        "relation": {
          "special": "connected-dominating-set",
          "general": "dominating-set"
        },
        "engine": {
          "mode": "rounding",
          "sourceScopes": [
            "dominating-set"
          ],
          "graphMap": "same",
          "substitutions": {},
          "cost": "T+4",
          "factor": "multiply",
          "multiplier": {
            "default": {
              "label": "1 + 2∇₁",
              "tex": "1+2\\nabla_1"
            },
            "graphBounds": [
              {
                "graph": "forest",
                "label": "3",
                "tex": "3",
                "certificate": "Forests are minor-closed and their edge density is at most one."
              },
              {
                "graph": "pseudoforest",
                "label": "3",
                "tex": "3",
                "certificate": "Pseudoforests are minor-closed and their edge density is at most one."
              },
              {
                "graph": "planar",
                "label": "7",
                "tex": "7",
                "certificate": "Planarity is minor-closed and planar minors have edge density at most three."
              }
            ]
          },
          "targetVariant": "Unweighted",
          "sourceGuards": {
            "objective": "min",
            "weightCondition": "weights-unweighted",
            "outputKind": "integral-vertex-set",
            "benchmarks": [
              "integral",
              "fractional"
            ]
          },
          "targetBenchmark": "integral",
          "targetInputConditions": [
            "input-connected",
            "input-distinct-ids"
          ],
          "upper": true,
          "lower": false,
          "assumptions": [
            "Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
          ]
        }
      }
    ]
  },
  "sotaFrontier": {
    "checked": "2026-11-16",
    "description": "Certified dominance comparisons for literature-based SOTA frontiers. A better result must be no worse in every recorded dimension and strictly better in at least one, on the explicit parameter domain. Comparisons are global and do not depend on active filters. Missing comparisons mean unknown or incomparable, not SOTA. Universal constant bounds are compared only at their advertised asymptotic level; parameter-dependent bounds retain their full functions. Parameter substitutions require an explicit certificate. No certificate discards an exact round count or an unresolved parameter-dependent tradeoff.",
    "dimensions": [
      "problem",
      "graphClass",
      "approximation",
      "rounds",
      "model",
      "randomness",
      "benchmark",
      "assumptions"
    ],
    "dominance": [
      {
        "better": "gen-asw26-planar",
        "worse": "heydt-planar-twenty",
        "strict": [
          "approximation"
        ],
        "conditions": {
          "problem": "Both solve unweighted minimum dominating set and output an integral vertex set.",
          "graphClass": "Both guarantees hold on all planar graphs; no graph-class strengthening is inferred.",
          "approximation": "The exact coefficient 7 is strictly smaller than 20.",
          "rounds": "Both cataloged statements give a universal constant round complexity. This comparison concerns the stated asymptotic round complexity, not unknown absolute round counts.",
          "model": "The newer algorithm uses broadcast CONGEST and therefore also works in LOCAL; message restrictions are stronger, not an extra graph or input requirement.",
          "randomness": "Both algorithms are deterministic.",
          "benchmark": "The newer integral output is bounded against fractional OPT, which is at most integral OPT; it therefore also satisfies the older integral-OPT convention.",
          "assumptions": "Use the standard unique O(log n)-bit identifier convention. Neither statement requires an embedding, a maximum-degree bound, or an externally supplied solution. This certificate does not apply to variants with a different initial-information convention."
        },
        "evidenceUrl": "https://arxiv.org/pdf/2611.02057",
        "reason": "Exact factor 7 replaces the 20 planar guarantee within the advertised unspecified constant-round regime. The source introduction traces the constant-factor improvements; Theorem C(i) gives the new guarantee."
      },
      {
        "better": "gen-asw26-planar",
        "worse": "sparse-planar-eleven",
        "strict": [
          "approximation"
        ],
        "conditions": {
          "problem": "Both solve unweighted minimum dominating set and output an integral vertex set.",
          "graphClass": "Both guarantees hold on all planar graphs; no graph-class strengthening is inferred.",
          "approximation": "The exact coefficient 7 is strictly smaller than 11 + ε for every ε > 0.",
          "rounds": "The newer round complexity is a universal constant, independent of ε. The older bound is f(ε), with its accuracy dependence retained. At the advertised asymptotic level the universal O(1) bound has no accuracy-dependent overhead. This does not compare unknown numerical round counts or identify f(ε) with a universal constant.",
          "model": "The newer algorithm uses broadcast CONGEST and therefore also works in LOCAL; message restrictions are stronger, not an extra graph or input requirement.",
          "randomness": "Both algorithms are deterministic.",
          "benchmark": "The newer integral output is bounded against fractional OPT, which is at most integral OPT; it therefore also satisfies the older integral-OPT convention.",
          "assumptions": "Use the standard unique O(log n)-bit identifier convention. Neither statement requires an embedding, a maximum-degree bound, or an externally supplied solution. This certificate does not apply to variants with a different initial-information convention."
        },
        "evidenceUrl": "https://arxiv.org/pdf/2611.02057",
        "reason": "Exact factor 7 replaces the 11 + ε planar guarantee using a universal constant round complexity, while the earlier round complexity depends on ε. The source introduction traces the constant-factor improvements; Theorem C(i) gives the new guarantee."
      },
      {
        "better": "gen-asw26-planar",
        "worse": "gen-w26-planar-dom",
        "strict": [
          "approximation"
        ],
        "conditions": {
          "problem": "Both solve unweighted minimum dominating set and output an integral vertex set.",
          "graphClass": "Both guarantees hold on all planar graphs; no graph-class strengthening is inferred.",
          "approximation": "The exact coefficient 7 is strictly smaller than 8 + ε for every ε > 0.",
          "rounds": "The newer round complexity is a universal constant, independent of ε. The older bound is f(ε), with its accuracy dependence retained. At the advertised asymptotic level the universal O(1) bound has no accuracy-dependent overhead. This does not compare unknown numerical round counts or identify f(ε) with a universal constant.",
          "model": "The newer algorithm uses broadcast CONGEST and therefore also works in LOCAL; message restrictions are stronger, not an extra graph or input requirement.",
          "randomness": "Both algorithms are deterministic.",
          "benchmark": "The newer integral output is bounded against fractional OPT, which is at most integral OPT; it therefore also satisfies the older integral-OPT convention.",
          "assumptions": "Use the standard unique O(log n)-bit identifier convention. Neither statement requires an embedding, a maximum-degree bound, or an externally supplied solution. This certificate does not apply to variants with a different initial-information convention."
        },
        "evidenceUrl": "https://arxiv.org/pdf/2611.02057",
        "reason": "Exact factor 7 replaces the 8 + ε planar guarantee using a universal constant round complexity, while the earlier round complexity depends on ε. The source introduction traces the constant-factor improvements; Theorem C(i) gives the new guarantee."
      },
      {
        "better": "gen-asw26-planar",
        "worse": "gen-as26-planar",
        "strict": [
          "approximation"
        ],
        "conditions": {
          "problem": "Both solve unweighted minimum dominating set and output an integral vertex set.",
          "graphClass": "Both guarantees hold on all planar graphs; no graph-class strengthening is inferred.",
          "approximation": "The exact coefficient 7 is strictly smaller than 7 + ε for every ε > 0.",
          "rounds": "The newer round complexity is a universal constant, independent of ε. The older bound is f(ε), with its accuracy dependence retained. At the advertised asymptotic level the universal O(1) bound has no accuracy-dependent overhead. This does not compare unknown numerical round counts or identify f(ε) with a universal constant.",
          "model": "The newer algorithm uses broadcast CONGEST and therefore also works in LOCAL; message restrictions are stronger, not an extra graph or input requirement.",
          "randomness": "Both algorithms are deterministic.",
          "benchmark": "Both guarantees apply against fractional OPT.",
          "assumptions": "Use the standard unique O(log n)-bit identifier convention. Neither statement requires an embedding, a maximum-degree bound, or an externally supplied solution. This certificate does not apply to variants with a different initial-information convention."
        },
        "evidenceUrl": "https://arxiv.org/pdf/2611.02057",
        "reason": "Exact factor 7 replaces the 7 + ε planar guarantee using a universal constant round complexity, while the earlier round complexity depends on ε. The source introduction traces the constant-factor improvements; Theorem C(i) gives the new guarantee."
      },
      {
        "better": "folklore-degree-mds",
        "worse": "folklore-star-minor-mds",
        "strict": [
          "graphClass"
        ],
        "parameterDomain": "For every integer t ≥ 2, instantiate the general degree guarantee on the class of graphs with maximum degree Δ ≤ t−1.",
        "comparisonGraphClass": {
          "node": "degree",
          "label": "Maximum degree ≤ t−1"
        },
        "conditions": {
          "problem": "Both solve unweighted minimum dominating set by selecting every vertex.",
          "graphClass": "Every K1,t-minor-free graph has maximum degree at most t−1. The larger comparison class is maximum degree ≤ t−1, not all general graphs with a uniform factor t. For t ≥ 4 the containment is strict: a subcubic tree with t leaves contains K1,t as a minor while its degree is at most t−1. For t=2 or t=3 the two classes coincide.",
          "approximation": "On maximum-degree-(t−1) graphs, the general Δ+1 bound is at most t, matching the excluded-star guarantee.",
          "rounds": "Both use exactly zero communication rounds, with no parameter-dependent overhead.",
          "model": "Both are valid in CONGEST and use no messages or identifiers.",
          "randomness": "Both algorithms are deterministic.",
          "benchmark": "Both output integral dominating sets measured against integral OPT.",
          "assumptions": "Both are unweighted and need no degree or parameter knowledge. The parameter substitution is a property of the graph class, not extra information supplied to processors."
        },
        "evidenceUrl": "https://dept-info.labri.fr/~gavoille/article/BGPW25.pdf#page=3",
        "reason": "The excluded-star zero-round baseline is a specialization of the zero-round maximum-degree baseline. It has no separate frontier advantage for t ≥ 4 once the larger maximum-degree class is instantiated at Δ ≤ t−1. At t=2 or t=3 the classes coincide, so this is equivalence rather than strict dominance.",
        "domainGuard": "t ≥ 4"
      },
      {
        "better": "gen-asw26-minordensity",
        "worse": "gen-asw26-planar",
        "strict": [
          "graphClass"
        ],
        "parameterSubstitution": "a=3",
        "comparisonGraphClass": {
          "node": "minor",
          "label": "Every minor H has |E(H)| ≤ 3|V(H)|"
        },
        "conditions": {
          "problem": "Both return an integral unweighted dominating set.",
          "graphClass": "Every planar graph satisfies minor density at most 3. This class strictly contains the planar graphs: K5 also satisfies the bound for all its minors.",
          "approximation": "At a=3, the general coefficient 2a+1 equals the planar coefficient 7.",
          "rounds": "Sections 5.4 and 7.2 use the same protocol at a=3: degree-six defects, the same initial set F and candidate costs, algorithm parameters ρ=3, maximum candidate cost 7 and accuracy ε=1/294, followed by the same W, R and H broadcasts. The general instance adds no rounds or parameter overhead to the planar construction.",
          "model": "Both use broadcast CONGEST with O(log n)-bit messages.",
          "randomness": "Both algorithms are deterministic.",
          "benchmark": "Both integral outputs are bounded against the same fractional dominating-set optimum.",
          "assumptions": "Both use distinct O(log n)-bit identifiers and need no embedding, orientation, initial cover, degree bound or knowledge of n. The fixed substitution a=3 is hard-coded and valid for every planar input."
        },
        "evidenceUrl": "https://arxiv.org/pdf/2611.02057#page=50",
        "reason": "The planar factor-seven algorithm is the a=3 instance of the integer-density construction, with identical algorithm accuracy and broadcasts. The same guarantee and round complexity therefore hold on a strictly larger graph class."
      },
      {
        "better": "gen-beks18-full-eps",
        "worse": "gen-beks18-eps",
        "strict": [
          "assumptions"
        ],
        "parameterSubstitution": "ε=(log Δ)^−c for fixed c≥1",
        "conditions": {
          "problem": "Both solve minimum-weight vertex cover and return an integral vertex set.",
          "graphClass": "Both work on general graphs.",
          "approximation": "Substituting ε=(log Δ)^−c gives exactly the corollary’s ratio 2+(log Δ)^−c.",
          "rounds": "This is the same Algorithm 1, not a comparison of unrelated hidden constants. In Theorem 2 the substitution makes log(1/ε)=c log log Δ and yields O(log Δ/log log Δ) for fixed c; the bounded-degree cases use the same protocol.",
          "model": "Both use the same deterministic CONGEST implementation.",
          "randomness": "Both are deterministic.",
          "benchmark": "Both compare the integral cover cost with weighted integral OPT.",
          "assumptions": "Both require positive polynomially bounded integer weights and known Δ or a polynomial upper bound. The full theorem permits every ε∈(0,1); the narrower inverse-polylogarithmic accuracy restriction is unnecessary."
        },
        "evidenceUrl": "https://arxiv.org/pdf/1804.01308v3#page=6",
        "reason": "The special accuracy point is already contained in the full Theorem 2 family, with identical algorithm, guarantee and round complexity after substitution and a strictly larger accuracy domain."
      },
      {
        "better": "gen-beks19-full-eps",
        "worse": "gen-beks18-full-eps",
        "strict": [
          "rounds",
          "assumptions"
        ],
        "conditions": {
          "problem": "Both return an integral minimum-weight vertex-cover approximation on the original graph.",
          "graphClass": "Both apply to all general graphs.",
          "approximation": "The approximation ratio is identical for every allowed accuracy value; the exact-2 comparison has no additive loss.",
          "rounds": "Write x=log Δ and L=log(2/ε). The newer bound is O(x/log x+L+min{x,L x^0.001}); the older is O(x/log x+L x/(log x)^2). For sufficiently large x, x^0.001≤x/(log x)^2, so the new bound is no worse uniformly. For Δ=n and ε=1/n it is O(log n) instead of O(log² n/log² log n), giving a strict joint-parameter improvement. Bounded-degree cases are O(L) in both.",
          "model": "Both are deterministic CONGEST algorithms. The rank-two edge processors of the newer protocol are simulated with constant overhead.",
          "randomness": "Both are deterministic.",
          "benchmark": "The newer guarantee is at least as strong as the older integral-OPT benchmark. In the approximate case its proof also bounds cost against fractional OPT.",
          "assumptions": "Both use positive polynomially bounded integer weights. The older algorithm requires global Δ or a polynomial upper bound; the newer one can use local edge-degree bounds. No additional global input is introduced."
        },
        "evidenceUrl": "https://arxiv.org/pdf/1902.09377v2#page=9",
        "reason": "The 2019 full-accuracy family improves the 2018 joint round function, and removes the global-degree-knowledge requirement."
      },
      {
        "better": "gen-beks19-exact2",
        "worse": "gen-beks18-exact2",
        "strict": [
          "rounds",
          "assumptions"
        ],
        "conditions": {
          "problem": "Both return an integral minimum-weight vertex-cover approximation on the original graph.",
          "graphClass": "Both apply to all general graphs.",
          "approximation": "The approximation ratio is identical for every allowed accuracy value; the exact-2 comparison has no additive loss.",
          "rounds": "O(log n) is no worse than O(log n·log Δ/log² log Δ), with truncated logarithms. The improvement is strict when Δ grows, for example Δ=n. Both statements specify asymptotic round complexities. The comparison concerns their dependence on n and Δ.",
          "model": "Both are deterministic CONGEST algorithms. The rank-two edge processors of the newer protocol are simulated with constant overhead.",
          "randomness": "Both are deterministic.",
          "benchmark": "The newer guarantee is at least as strong as the older integral-OPT benchmark. In the approximate case its proof also bounds cost against fractional OPT.",
          "assumptions": "Both use positive polynomially bounded integer weights and a common polynomial bound B≥nW for the small-accuracy integrality step. The older implementation also needs global Δ; the newer one does not."
        },
        "evidenceUrl": "https://arxiv.org/pdf/1902.09377v2#page=9",
        "reason": "The 2019 rank-two corollary gives exact factor 2 in logarithmic rounds, superseding the older extra degree-dependent factor without stronger input assumptions."
      },
      {
        "better": "wawrzyniak-planar-52",
        "worse": "lenzen-planar-130",
        "strict": [
          "approximation"
        ],
        "conditions": {
          "problem": "Both return an integral approximation for unweighted minimum dominating set.",
          "graphClass": "Both algorithms apply to all planar graphs.",
          "approximation": "Factor 52 is strictly smaller than 130.",
          "rounds": "The 2014 result reanalyzes the same protocol. Lemma 6.1 of Lenzen–Pignolet–Wattenhofer explicitly itemizes rounds 1–6; the reanalysis changes no communication.",
          "model": "Both use LOCAL with unrestricted message size and local computation.",
          "randomness": "Both algorithms are deterministic.",
          "benchmark": "Both approximation guarantees are measured against the integral optimum.",
          "assumptions": "Both use distinct identifiers and require no embedding, degree bound or externally supplied dominating set. Unbounded local computation is allowed in LOCAL."
        },
        "evidenceUrl": "https://www.sciencedirect.com/science/article/abs/pii/S0020019013002767",
        "reason": "The improved analysis proves factor 52 for the unchanged six-round protocol that originally had factor 130."
      },
      {
        "better": "wawrzyniak-planar-52",
        "worse": "pic-thesis-planar-205",
        "strict": [
          "approximation"
        ],
        "conditions": {
          "problem": "Both return an integral approximation for unweighted minimum dominating set.",
          "graphClass": "Both algorithms apply to all planar graphs.",
          "approximation": "Factor 52 is strictly smaller than 205.",
          "rounds": "Both provide six-round LOCAL implementations. The 52 result uses the Lenzen–Pignolet–Wattenhofer schedule in Lemma 6.1; Proposition 3.1 of the cuttable-problems paper explicitly gives six rounds for factor 205. No comparison of unrelated unspecified constants is used.",
          "model": "Both use LOCAL with unrestricted message size and local computation.",
          "randomness": "Both algorithms are deterministic.",
          "benchmark": "Both approximation guarantees are measured against the integral optimum.",
          "assumptions": "Both use distinct identifiers and require no embedding, degree bound or externally supplied dominating set. Unbounded local computation is allowed in LOCAL."
        },
        "evidenceUrl": "https://jukkasuomela.fi/doc/cuttable-distributed-problems.pdf#page=5",
        "reason": "The six-round factor-52 algorithm has a strictly stronger guarantee than the six-round factor-205 algorithm under the same graph, model and identifier assumptions."
      },
      {
        "better": "pic-thesis-pw2-dom",
        "worse": "pic-large-50-dom",
        "kind": "family-extension",
        "algorithmSpecialization": "algorithm5-k2t-specialization",
        "strict": [
          "graphClass"
        ],
        "parameterSubstitution": "H=K₂,t",
        "conditions": {
          "problem": "The same unweighted minimum dominating-set output and minimization objective.",
          "graphClass": "The broader parameterized theorem permits every fixed excluded H with pw(H)≤2; H=K₂,t recovers the original setting for every t≥2. Strictness concerns the family of allowed excluded-minor settings, not an arbitrary pair of fixed H and t. For example, H=C₅ has pathwidth two and its minor-free class contains K₂,s for arbitrarily large s; it is not contained in any fixed K₂,t-minor-free class.",
          "approximation": "The same factor 50, independent of the excluded graph parameter.",
          "rounds": "On H=K₂,t use the certified identical Algorithm 5 configuration and original O(t) communication schedule. The generic H-dependent proof bound is not compared with that schedule.",
          "model": "The same LOCAL communication model.",
          "randomness": "The same deterministic procedure.",
          "benchmark": "The same integral optimum.",
          "assumptions": "The same distinct identifiers and fixed excluded-minor setting; the original control function and radii are used on the mapped branch."
        },
        "evidenceUrl": "https://timothepicavet.fr/others/thesis.pdf#page=204",
        "reason": "Covered by the broader theorem: the K₂,t setting is the H=K₂,t branch of the same Algorithm 5 family, with the same O(t) implementation. The improvement is the larger family of excluded-minor settings, not faster rounds."
      }
    ],
    "scopeTransfers": [
      {
        "resultId": "gen-asw26-minordensity",
        "graph": "planar",
        "scopeLabel": "Planar · a=3",
        "setting": "Planar unweighted MDS; a=3 gives exact factor 7 against fractional OPT, with the same constant-round broadcast CONGEST protocol as the planar corollary.",
        "reason": "The planar specialization is certified by the identical algorithm and parameters in Sections 5.4 and 7.2. The broader all-minor-density-three class contains the planar graphs.",
        "evidenceUrl": "https://arxiv.org/pdf/2611.02057#page=50",
        "approximation": {
          "substitutions": {
            "a": "3"
          },
          "factor": "7",
          "constantApproximation": true
        },
        "conditionIds": [],
        "claimConditionIds": [],
        "settingConditionIds": [
          "binding-a-three"
        ]
      },
      {
        "resultId": "folklore-tree-mds",
        "graph": "forest",
        "scopeLabel": "Forests · one round",
        "setting": "Unweighted MDS on trees or forests; exact factor 3 in one round, with initial local degree knowledge and no identifiers.",
        "reason": "Forests are contained in pseudoforests. The same non-leaf construction is documented in Observation A.1, and the constant-round factor-three barrier already holds on paths.",
        "evidenceUrl": "https://arxiv.org/pdf/2206.05174#page=17",
        "conditionIds": [],
        "claimConditionIds": [],
        "settingConditionIds": []
      },
      {
        "resultId": "gen-asw26-cover-det",
        "graph": "planar",
        "problem": "dominating-set",
        "scopeLabel": "Planar MDS · log-star",
        "setting": "Planar unweighted MDS; instantiate local covering with requests V, C(v)=N[v], unit costs and minor-density bound ρ=3. Deterministic broadcast CONGEST gives ratio 1+ε in the stated parameter-dependent log-star bound, with the known common polynomial ID bound.",
        "reason": "Theorem D(ii) supplies this specialization. Proposition C.1 makes the dependence on n optimal already on cycles. Full accuracy dependence and the supplied ID-bound convention remain part of the tradeoff.",
        "evidenceUrl": "https://arxiv.org/pdf/2611.02057#page=51",
        "conditionIds": [
          "parameter-epsilon-quarter"
        ],
        "claimConditionIds": [
          "parameter-epsilon-quarter"
        ],
        "settingConditionIds": [
          "binding-rho-three",
          "binding-unit-costs",
          "binding-closed-neighborhood-requests"
        ]
      },
      {
        "resultId": "pic-thesis-pw2-dom",
        "graph": "k2t",
        "algorithmSpecialization": "algorithm5-k2t-specialization",
        "scopeLabel": "K₂,t-minor-free; t ≥ 49",
        "setting": "Unweighted K₂,t-minor-free MDS; H=K₂,t with fixed t≥2; deterministic LOCAL; factor 50 against integral OPT. Use the original Algorithm 5 configuration and its O(t) runtime. The SOTA review is for t≥49.",
        "reason": "Theorem VIII.1.1 extends the original Algorithm 5 to all fixed excluded minors of pathwidth at most two. The certified H=K₂,t branch uses the original linear-in-t implementation. Its uniform factor-50 SOTA scope retains t≥49, while the algorithm itself applies for every t≥2. The original paper remains linked as the source of this specialized algorithm.",
        "evidenceUrl": "https://timothepicavet.fr/others/thesis.pdf#page=204",
        "conditionIds": [
          "claim-t-ge49"
        ],
        "claimConditionIds": [
          "claim-t-ge49"
        ],
        "settingConditionIds": [
          "binding-excluded-minor-k2t",
          "parameter-fixed-t-ge2"
        ]
      }
    ],
    "algorithmSpecializations": [
      {
        "id": "algorithm5-k2t-specialization",
        "resultId": "pic-thesis-pw2-dom",
        "sourceResultId": "pic-large-50-dom",
        "graph": "k2t",
        "parameterBindings": {
          "excluded-minor": "K₂,t"
        },
        "reason": "For H=K₂,t, use the original Algorithm 5 with its K₂,t class control function, local-cut radii and residual exploration. The thesis reuses the same procedure, so the original O(t) implementation and runtime apply to this branch of the broader family. Generic H-dependent thresholds are retained elsewhere; no speedup or comparison of the generic diameter bound is asserted.",
        "evidence": [
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=204",
            "title": "Timothé Picavet’s doctoral thesis",
            "location": "Theorem VIII.1.1 and the following same-Algorithm-5 statement"
          },
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=218",
            "title": "Timothé Picavet’s doctoral thesis",
            "location": "Final paragraph of Chapter VIII, reusing Algorithm 5 and Lemmas IV.2.1–IV.2.2"
          },
          {
            "url": "https://timothepicavet.fr/others/thesis.pdf#page=125",
            "title": "Timothé Picavet’s doctoral thesis",
            "location": "Original Algorithm 5 control function and O(t) implementation"
          }
        ]
      }
    ]
  },
  "tightBounds": {
    "checked": "2026-11-16",
    "description": "Reviewed matching upper and lower bounds. Each certificate identifies the tight quantity, its parameter domain, primary sources and explicit graph/problem/model applications. Tightness is independent of SOTA ranking. It is not inferred from the current catalog, from a shared round regime, from approximation-scheme limits, or automatically through reductions and graph inclusions. Exact coefficients, asymptotic orders and minimum-round thresholds remain distinct.",
    "certificates": [
      {
        "id": "outerplanar-factor-five",
        "axis": "ratio",
        "precision": "exact",
        "scopeLabel": "Ratio 5 · deterministic local",
        "parameterDomain": "Deterministic n-independent locality; integral optimum.",
        "statement": "The approximation ratio is exactly tight; the absolute round count is not certified.",
        "upper": {
          "resultIds": [
            "outerplanar-five"
          ],
          "url": "https://arxiv.org/abs/2108.02697v2",
          "title": "Bonamy–Cook–Groenland–Wesolek",
          "location": "Main theorem",
          "statement": "Ratio 5 is achieved in universally constant anonymous rounds."
        },
        "lower": {
          "resultIds": [
            "outerplanar-five-lower"
          ],
          "url": "https://arxiv.org/abs/2108.02697v2",
          "title": "Bonamy–Cook–Groenland–Wesolek",
          "location": "Matching lower bound",
          "statement": "Every ratio below 5 is impossible in deterministic LOCAL with n-independent locality."
        },
        "applications": [
          {
            "resultId": "outerplanar-five",
            "graphs": [
              "outerplanar"
            ],
            "problems": [
              "dominating-set"
            ],
            "models": [
              "Anonymous",
              "CONGEST",
              "LOCAL"
            ],
            "conditionIds": []
          },
          {
            "resultId": "outerplanar-five-lower",
            "graphs": [
              "outerplanar"
            ],
            "problems": [
              "dominating-set"
            ],
            "models": [
              "LOCAL",
              "CONGEST"
            ],
            "conditionIds": []
          }
        ]
      },
      {
        "id": "planar-factor-seven",
        "axis": "ratio",
        "precision": "exact",
        "scopeLabel": "Ratio 7 · n-independent locality",
        "parameterDomain": "Integral benchmark; fixed genus when relevant.",
        "statement": "Ratio 7 is tight, including the stated fixed-surface upper bound.",
        "upper": {
          "resultIds": [
            "gen-asw26-planar",
            "gen-asw26-genus"
          ],
          "url": "https://arxiv.org/pdf/2611.02057",
          "title": "ASW26",
          "location": "Theorem C(i); Theorem E",
          "statement": "Ratio 7: universal rounds on planar graphs; genus-dependent rounds on fixed surfaces."
        },
        "lower": {
          "resultIds": [
            "planar-seven-lower"
          ],
          "url": "https://arxiv.org/abs/1402.2549",
          "title": "Hilke–Lenzen–Suomela",
          "location": "Main theorem",
          "statement": "Deterministic local planar approximation below 7 is impossible."
        },
        "applications": [
          {
            "resultId": "gen-asw26-planar",
            "graphs": [
              "planar"
            ],
            "problems": [
              "dominating-set"
            ],
            "models": [
              "CONGEST",
              "LOCAL"
            ],
            "conditionIds": []
          },
          {
            "resultId": "gen-asw26-genus",
            "graphs": [
              "euler",
              "orientable",
              "planar"
            ],
            "problems": [
              "dominating-set"
            ],
            "models": [
              "CONGEST",
              "LOCAL"
            ],
            "conditionIds": []
          },
          {
            "resultId": "planar-seven-lower",
            "graphs": [
              "planar",
              "euler",
              "orientable"
            ],
            "problems": [
              "dominating-set"
            ],
            "models": [
              "LOCAL",
              "CONGEST"
            ],
            "conditionIds": []
          }
        ]
      },
      {
        "id": "tree-independent-rounds",
        "axis": "rounds",
        "precision": "asymptotic",
        "scopeLabel": "Rounds · joint n and ε dependence",
        "parameterDomain": "log(n)/n < ε < 1; deterministic algorithms.",
        "statement": "The round complexity is Θ(log* n / ε).",
        "upper": {
          "resultIds": [
            "gen-fk25-tree"
          ],
          "url": "https://arxiv.org/html/2506.10845v1",
          "title": "Faour–Kuhn",
          "location": "Theorem 1.1",
          "statement": "The upper bound holds for maximum-weight independent set on unrooted trees in CONGEST."
        },
        "lower": {
          "resultIds": [
            "gen-fk25-path-lower"
          ],
          "url": "https://arxiv.org/html/2506.10845v1",
          "title": "Faour–Kuhn",
          "location": "Theorem 1.1; Section 2.2",
          "statement": "The matching lower bound holds for unweighted oriented paths even in LOCAL."
        },
        "applications": [
          {
            "resultId": "gen-fk25-tree",
            "graphs": [
              "forest",
              "path",
              "oriented-path"
            ],
            "problems": [
              "independent-set"
            ],
            "models": [
              "CONGEST",
              "LOCAL"
            ],
            "conditionIds": []
          },
          {
            "resultId": "gen-fk25-path-lower",
            "graphs": [
              "oriented-path",
              "path",
              "forest"
            ],
            "problems": [
              "independent-set"
            ],
            "models": [
              "LOCAL",
              "CONGEST"
            ],
            "conditionIds": []
          }
        ]
      },
      {
        "id": "high-girth-approximation-order",
        "axis": "approximation-order",
        "precision": "asymptotic",
        "scopeLabel": "Approximation order · deterministic",
        "parameterDomain": "k ≥ 1; fixed k-hop expansion bound and girth ≥ 4k+3; connected input.",
        "statement": "The dependence k + f(k)^(k/(k+1)) is tight up to multiplicative constants.",
        "upper": {
          "resultIds": [
            "pic-girth-sublinear"
          ],
          "url": "https://arxiv.org/html/2408.12998v1",
          "title": "Lenzen–Wenning",
          "location": "Theorem 1.5",
          "statement": "This approximation order is achieved in 3k rounds with small anonymous messages."
        },
        "lower": {
          "resultIds": [
            "pic-girth-sublinear-lower"
          ],
          "url": "https://arxiv.org/html/2408.12998v1",
          "title": "Lenzen–Wenning",
          "location": "Theorem 1.6; Corollary 6; cycle observation",
          "statement": "No deterministic n-independent algorithm improves the approximation order, even with identifiers."
        },
        "applications": [
          {
            "resultId": "pic-girth-sublinear",
            "graphs": [
              "girth-hop"
            ],
            "problems": [
              "distance-dominating-set"
            ],
            "models": [
              "Anonymous",
              "CONGEST",
              "LOCAL"
            ],
            "conditionIds": []
          },
          {
            "resultId": "pic-girth-sublinear-lower",
            "graphs": [
              "girth-hop"
            ],
            "problems": [
              "distance-dominating-set"
            ],
            "models": [
              "LOCAL",
              "CONGEST"
            ],
            "conditionIds": []
          }
        ]
      },
      {
        "id": "distance-k-round-threshold",
        "axis": "rounds",
        "precision": "threshold",
        "scopeLabel": "Minimum k rounds · factor independent of Δ",
        "parameterDomain": "k ≥ 2; fixed expansion bound at least 1; classes include trees of arbitrarily large degree.",
        "statement": "Exactly k rounds are sufficient and necessary for a factor independent of Δ; the upper coefficient is not certified optimal.",
        "upper": {
          "resultIds": [
            "pic-girth-pruning"
          ],
          "url": "https://arxiv.org/html/2408.12998v1",
          "title": "Lenzen–Wenning",
          "location": "Theorem 1.1",
          "statement": "A factor 2k f(k)+1 is achieved in exactly k rounds."
        },
        "lower": {
          "resultIds": [
            "pic-girth-time-lower"
          ],
          "url": "https://arxiv.org/html/2408.12998v1",
          "title": "Lenzen–Wenning",
          "location": "Theorem 1.2; Corollary 1",
          "statement": "At k−1 rounds a factor smaller than Δ is impossible already on trees."
        },
        "applications": [
          {
            "resultId": "pic-girth-pruning",
            "graphs": [
              "girth-hop",
              "forest",
              "degree-forest"
            ],
            "problems": [
              "distance-dominating-set"
            ],
            "models": [
              "Anonymous",
              "CONGEST",
              "LOCAL"
            ],
            "conditionIds": [
              "parameter-k-ge2",
              "parameter-expansion-ge1",
              "scope-factor-independent-degree"
            ]
          },
          {
            "resultId": "pic-girth-time-lower",
            "graphs": [
              "degree-forest",
              "forest",
              "girth-hop"
            ],
            "problems": [
              "distance-dominating-set"
            ],
            "models": [
              "LOCAL",
              "CONGEST"
            ],
            "conditionIds": [
              "parameter-k-ge2",
              "parameter-expansion-ge1",
              "scope-factor-independent-degree"
            ]
          }
        ]
      },
      {
        "id": "arboricity-domination-rounds",
        "axis": "rounds",
        "precision": "asymptotic",
        "scopeLabel": "Rounds · fixed arboricity α ≥ 2",
        "parameterDomain": "Fixed α ≥ 2; known Δ for the upper; polylogarithmic approximation factors in Δ.",
        "statement": "The degree-dependent round order is Θ(log Δ / log log Δ), not the approximation coefficient.",
        "upper": {
          "resultIds": [
            "gen-af26-dom"
          ],
          "url": "https://arxiv.org/abs/2606.15411",
          "title": "Alipour–Farokhnejad",
          "location": "Abstract; main theorem",
          "statement": "A deterministic CONGEST upper bound attains this round order with O(α log Δ / log log Δ) approximation and one-bit messages."
        },
        "lower": {
          "resultIds": [
            "dory-arboricity-lower"
          ],
          "url": "https://arxiv.org/pdf/2206.05174#page=3",
          "title": "Dory–Ghaffari–Ilchi",
          "location": "Theorem 1.4",
          "statement": "The matching lower bound for constant or polylogarithmic approximation already holds at arboricity 2, even in LOCAL."
        },
        "applications": [
          {
            "resultId": "gen-af26-dom",
            "graphs": [
              "density",
              "arboricity-two"
            ],
            "problems": [
              "dominating-set"
            ],
            "models": [
              "CONGEST",
              "LOCAL"
            ],
            "conditionIds": [
              "parameter-fixed-alpha-ge2"
            ]
          },
          {
            "resultId": "dory-arboricity-lower",
            "graphs": [
              "arboricity-two",
              "density"
            ],
            "problems": [
              "dominating-set"
            ],
            "models": [
              "LOCAL",
              "CONGEST"
            ],
            "conditionIds": [
              "parameter-fixed-alpha-ge2"
            ]
          }
        ]
      },
      {
        "id": "dominating-logstar-rounds",
        "axis": "rounds",
        "precision": "asymptotic",
        "scopeLabel": "Rounds in n · fixed ρ, b, ε",
        "parameterDomain": "ρ ≥ 1; fixed positive integer b; fixed 0 < ε < 1/4; unit costs for MDS.",
        "statement": "The n-dependence is Θ(log* n); parameter dependence is not certified.",
        "upper": {
          "resultIds": [
            "gen-asw26-cover-det",
            "derived-gen-asw26-cover-det--mds-to-local-covering"
          ],
          "url": "https://arxiv.org/pdf/2611.02057",
          "title": "ASW26",
          "location": "Theorem D(ii)",
          "statement": "Integral local covering admits the upper bound; unit-cost MDS is a special case."
        },
        "lower": {
          "resultIds": [
            "gen-asw26-cycle-lower"
          ],
          "url": "https://arxiv.org/pdf/2611.02057",
          "title": "ASW26",
          "location": "Proposition C.1",
          "statement": "The lower bound already holds for deterministic MDS on cycles."
        },
        "applications": [
          {
            "resultId": "gen-asw26-cover-det",
            "graphs": [
              "minor"
            ],
            "problems": [
              "local-covering"
            ],
            "models": [
              "CONGEST",
              "LOCAL"
            ],
            "conditionIds": [
              "scope-rounds-n-rho-b-epsilon",
              "parameter-epsilon-quarter"
            ]
          },
          {
            "resultId": "derived-gen-asw26-cover-det--mds-to-local-covering",
            "graphs": [
              "minor",
              "planar",
              "outerplanar",
              "euler",
              "orientable",
              "cycle"
            ],
            "problems": [
              "dominating-set"
            ],
            "models": [
              "CONGEST",
              "LOCAL"
            ],
            "conditionIds": [
              "scope-rounds-n-rho-b-epsilon",
              "parameter-epsilon-quarter"
            ]
          },
          {
            "resultId": "gen-asw26-cycle-lower",
            "graphs": [
              "cycle",
              "planar",
              "outerplanar",
              "euler",
              "orientable"
            ],
            "problems": [
              "dominating-set"
            ],
            "models": [
              "LOCAL",
              "CONGEST"
            ],
            "conditionIds": [
              "scope-rounds-n-epsilon",
              "parameter-epsilon-quarter"
            ]
          }
        ]
      },
      {
        "id": "minor-density-factor",
        "axis": "ratio",
        "precision": "exact",
        "scopeLabel": "Ratio 2a+1 · integer a ≥ 1",
        "parameterDomain": "Integer a ≥ 1; every minor has density at most a; lower path-power radius r=a.",
        "statement": "The coefficient is tight on these density classes; round dependence on a is not certified.",
        "upper": {
          "resultIds": [
            "gen-asw26-minordensity"
          ],
          "url": "https://arxiv.org/pdf/2611.02057",
          "title": "ASW26",
          "location": "Theorem C(i); Corollary 1.1",
          "statement": "The upper coefficient is 2a+1 against fractional OPT."
        },
        "lower": {
          "resultIds": [
            "gen-as26-power-lower"
          ],
          "url": "https://arxiv.org/html/2610.09618v2#S8.SS4",
          "title": "Amiri–Siebertz",
          "location": "Theorem 8.7",
          "statement": "Path powers of radius r have minor density at most r and exclude every coefficient below 2r+1."
        },
        "applications": [
          {
            "resultId": "gen-asw26-minordensity",
            "graphs": [
              "minor"
            ],
            "problems": [
              "dominating-set"
            ],
            "models": [
              "CONGEST",
              "LOCAL"
            ],
            "conditionIds": [
              "parameter-a-integer-ge1"
            ]
          },
          {
            "resultId": "gen-as26-power-lower",
            "graphs": [
              "path-powers",
              "treewidth",
              "pathwidth"
            ],
            "problems": [
              "dominating-set"
            ],
            "models": [
              "LOCAL",
              "CONGEST"
            ],
            "conditionIds": [
              "parameter-r-integer-ge1"
            ]
          }
        ]
      },
      {
        "id": "pathpower-leaves-factor",
        "axis": "ratio",
        "precision": "exact",
        "scopeLabel": "Ratio 2t+1 · endpoint-leaf path powers",
        "parameterDomain": "Integer t ≥ 1; identifiers in {1,…,n}; use a=t in the minor-density upper bound.",
        "statement": "The endpoint-leaf lower bound is matched by the density-class upper bound.",
        "upper": {
          "resultIds": [
            "gen-asw26-minordensity"
          ],
          "url": "https://arxiv.org/pdf/2611.02057",
          "title": "ASW26",
          "location": "Theorem C(i)",
          "statement": "At a=t the upper coefficient is 2t+1."
        },
        "lower": {
          "resultIds": [
            "pic-thesis-pathpower-lower"
          ],
          "url": "https://timothepicavet.fr/others/thesis.pdf#page=148",
          "title": "Picavet thesis",
          "location": "Lemma V.2.1",
          "statement": "For identifiers in {1,…,n} and every function f, an f(t)-round deterministic algorithm cannot beat 2t+1 on the stated path-power family."
        },
        "applications": [
          {
            "resultId": "pic-thesis-pathpower-lower",
            "graphs": [
              "path-powers-leaves"
            ],
            "problems": [
              "dominating-set"
            ],
            "models": [
              "LOCAL",
              "CONGEST"
            ],
            "conditionIds": [
              "parameter-t-integer-ge1",
              "input-ids-one-to-n"
            ]
          }
        ]
      },
      {
        "id": "trianglefree-planar-factor-five",
        "axis": "ratio",
        "precision": "exact",
        "scopeLabel": "Ratio 5 · triangle-free planar",
        "parameterDomain": "Deterministic n-independent locality; integral benchmark.",
        "statement": "The coefficient 5 is tight; runtime constants are not certified.",
        "upper": {
          "resultIds": [
            "gen-asw26-trianglefree"
          ],
          "url": "https://arxiv.org/pdf/2611.02057",
          "title": "ASW26",
          "location": "Theorem C(iii)",
          "statement": "Ratio 5 is achieved against fractional OPT."
        },
        "lower": {
          "resultIds": [],
          "url": "https://arxiv.org/pdf/2611.02057",
          "title": "ASW26",
          "location": "Proposition B.2; Corollary 1.1",
          "statement": "Square-grid witnesses exclude every ratio below 5, even against integral OPT."
        },
        "applications": [
          {
            "resultId": "gen-asw26-trianglefree",
            "graphs": [
              "triangle-planar"
            ],
            "problems": [
              "dominating-set"
            ],
            "models": [
              "CONGEST",
              "LOCAL"
            ],
            "conditionIds": []
          }
        ]
      },
      {
        "id": "edge-domination-factor",
        "axis": "ratio",
        "precision": "exact",
        "scopeLabel": "Ratio 4−1/⌊Δ/2⌋ · local algorithms",
        "parameterDomain": "Δ ≥ 2; deterministic locality may depend on Δ but is independent of n.",
        "statement": "The degree-dependent approximation coefficient is exactly tight; runtime dependence on Δ is not certified.",
        "upper": {
          "resultIds": [],
          "url": "https://jukkasuomela.fi/doc/linear-order.pdf",
          "title": "Göös–Hirvonen–Suomela",
          "location": "Theorem 1.6",
          "statement": "The theorem explicitly states a matching deterministic local upper bound."
        },
        "lower": {
          "resultIds": [
            "gen-ghs12-eds"
          ],
          "url": "https://jukkasuomela.fi/doc/linear-order.pdf",
          "title": "Göös–Hirvonen–Suomela",
          "location": "Theorem 1.6",
          "statement": "The same coefficient is necessary on connected maximum-degree-Δ graphs, including algorithms with identifiers."
        },
        "applications": [
          {
            "resultId": "gen-ghs12-eds",
            "graphs": [
              "degree"
            ],
            "problems": [
              "edge-dominating-set"
            ],
            "models": [
              "LOCAL"
            ],
            "conditionIds": []
          }
        ]
      },
      {
        "id": "total-domination-factor",
        "axis": "ratio",
        "precision": "exact",
        "scopeLabel": "Ratio 2a · integer a ≥ 1 · fractional OPT",
        "parameterDomain": "Integer a ≥ 1; isolate-free inputs; fractional total-domination benchmark.",
        "statement": "Coefficient 2a is tight against fractional OPT; neither integral-benchmark tightness for a>1 nor optimal runtime is claimed.",
        "upper": {
          "resultIds": [
            "gen-asw26-total"
          ],
          "url": "https://arxiv.org/pdf/2611.02057",
          "title": "ASW26",
          "location": "Theorem F.1(i)",
          "statement": "The upper coefficient is 2a."
        },
        "lower": {
          "resultIds": [],
          "url": "https://arxiv.org/pdf/2611.02057",
          "title": "ASW26",
          "location": "Proposition F.13",
          "statement": "Treewidth-a witnesses force coefficient 2a against fractional OPT."
        },
        "applications": [
          {
            "resultId": "gen-asw26-total",
            "graphs": [
              "minor"
            ],
            "problems": [
              "total-dominating-set"
            ],
            "models": [
              "CONGEST",
              "LOCAL"
            ],
            "conditionIds": [
              "parameter-a-integer-ge1"
            ]
          }
        ]
      },
      {
        "id": "minor-free-independent-n-rounds",
        "axis": "rounds",
        "precision": "asymptotic",
        "scopeLabel": "Rounds in n · fixed nonplanar H, ε",
        "parameterDomain": "Fixed nonplanar excluded minor H and fixed 0 < ε < 1/2.",
        "statement": "The n-dependence is Θ(log* n); the additive inverse-accuracy term is not certified tight.",
        "upper": {
          "resultIds": [
            "chang-independent-logstar"
          ],
          "url": "https://arxiv.org/pdf/2304.04699v2",
          "title": "Chang",
          "location": "Corollary 6.5",
          "statement": "A deterministic CONGEST upper bound gives this n-dependence."
        },
        "lower": {
          "resultIds": [],
          "url": "https://arxiv.org/pdf/2304.04699v2",
          "title": "Chang",
          "location": "Theorem 6.1 and following lower-bound discussion",
          "statement": "Paths and cycles require Ω(log* n) for fixed ε, already in LOCAL."
        },
        "applications": [
          {
            "resultId": "chang-independent-logstar",
            "graphs": [
              "minor",
              "planar",
              "outerplanar",
              "forest",
              "path",
              "oriented-path",
              "cycle"
            ],
            "problems": [
              "independent-set"
            ],
            "models": [
              "CONGEST",
              "LOCAL"
            ],
            "conditionIds": [
              "scope-rounds-n-H-epsilon",
              "parameter-nonplanar-H",
              "parameter-epsilon-half"
            ]
          }
        ]
      },
      {
        "id": "arboricity-matching-n-rounds",
        "axis": "rounds",
        "precision": "asymptotic",
        "scopeLabel": "Rounds in n · fixed α and ε",
        "parameterDomain": "Fixed α ≥ 1 and fixed 0 < ε < 1/2.",
        "statement": "The n-dependence is Θ(log* n); joint α and ε dependence is not certified.",
        "upper": {
          "resultIds": [
            "arboricity-matching-logstar"
          ],
          "url": "https://link.springer.com/chapter/10.1007/978-3-642-10631-6_68",
          "title": "Czygrinow–Hańćkowiak–Wawrzyniak",
          "location": "Main approximation theorem",
          "statement": "For fixed arboricity and accuracy, the deterministic LOCAL scheme uses O(log* n) rounds."
        },
        "lower": {
          "resultIds": [],
          "url": "https://arxiv.org/pdf/2304.04699v2",
          "title": "Chang",
          "location": "Theorem 6.1 and following reduction",
          "statement": "The matching problem inherits the Ω(log* n) lower bound on paths and cycles."
        },
        "applications": [
          {
            "resultId": "arboricity-matching-logstar",
            "graphs": [
              "density",
              "arboricity-two",
              "forest",
              "path",
              "oriented-path",
              "cycle"
            ],
            "problems": [
              "maximum-matching"
            ],
            "models": [
              "LOCAL"
            ],
            "conditionIds": [
              "scope-rounds-n-alpha-epsilon",
              "parameter-epsilon-half"
            ]
          }
        ]
      },
      {
        "id": "fmatching-n-rounds",
        "axis": "rounds",
        "precision": "asymptotic",
        "scopeLabel": "Rounds in n · fixed ε and expansion",
        "parameterDomain": "Fixed 0 < ε < 1/2 and sub-logarithmic expansion bounds; unit capacities are allowed.",
        "statement": "The worst-case n-dependence is Θ(log* n); accuracy, expansion and capacity dependence are not certified.",
        "upper": {
          "resultIds": [
            "pic-sublog-fmatching"
          ],
          "url": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol212-isaac2021/LIPIcs.ISAAC.2021.59/LIPIcs.ISAAC.2021.59.pdf",
          "title": "Czygrinow–Hańćkowiak–Witkowski",
          "location": "Theorem 7",
          "statement": "The f-matching scheme uses O(log* n) rounds for fixed parameters."
        },
        "lower": {
          "resultIds": [],
          "url": "https://arxiv.org/pdf/2304.04699v2",
          "title": "Chang",
          "location": "Theorem 6.1 and matching reduction",
          "statement": "Unit capacities recover ordinary matching, whose path and cycle lower bound is Ω(log* n)."
        },
        "applications": [
          {
            "resultId": "pic-sublog-fmatching",
            "graphs": [
              "sublog",
              "forest",
              "path",
              "oriented-path",
              "cycle"
            ],
            "problems": [
              "f-matching"
            ],
            "models": [
              "LOCAL"
            ],
            "conditionIds": [
              "scope-rounds-n-expansion-epsilon",
              "parameter-epsilon-half"
            ]
          }
        ]
      },
      {
        "id": "bmatching-n-rounds",
        "axis": "rounds",
        "precision": "asymptotic",
        "scopeLabel": "Rounds in n · fixed ε, L and expansion",
        "parameterDomain": "Fixed 0 < ε < 1/2, Lipschitz bound L and sub-logarithmic expansion bounds; unit capacities are allowed.",
        "statement": "The worst-case n-dependence is Θ(log* n); the other parameter dependencies are not certified.",
        "upper": {
          "resultIds": [
            "pic-sublog-bmatching"
          ],
          "url": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol212-isaac2021/LIPIcs.ISAAC.2021.59/LIPIcs.ISAAC.2021.59.pdf",
          "title": "Czygrinow–Hańćkowiak–Witkowski",
          "location": "Theorem 17",
          "statement": "The b-matching scheme uses O(log* n) rounds for fixed parameters."
        },
        "lower": {
          "resultIds": [],
          "url": "https://arxiv.org/pdf/2304.04699v2",
          "title": "Chang",
          "location": "Theorem 6.1 and matching reduction",
          "statement": "The unit-capacity case is ordinary matching and satisfies the Lipschitz promise; its path and cycle lower bound applies."
        },
        "applications": [
          {
            "resultId": "pic-sublog-bmatching",
            "graphs": [
              "sublog",
              "forest",
              "path",
              "oriented-path",
              "cycle"
            ],
            "problems": [
              "b-matching"
            ],
            "models": [
              "LOCAL"
            ],
            "conditionIds": [
              "scope-rounds-n-L-expansion-epsilon",
              "parameter-epsilon-half"
            ]
          }
        ]
      },
      {
        "id": "pseudoforest-factor-three",
        "axis": "ratio",
        "precision": "exact",
        "scopeLabel": "Ratio 3 · pseudoforests and forests",
        "parameterDomain": "Unweighted inputs; initial own-degree knowledge for the one-round construction.",
        "statement": "Ratio 3 is tight; this does not certify that all optimal-ratio algorithms need one round.",
        "upper": {
          "resultIds": [
            "folklore-tree-mds"
          ],
          "url": "https://arxiv.org/pdf/2206.05174#page=17",
          "title": "Dory–Ghaffari–Ilchi",
          "location": "Appendix A, Observation A.1; elementary extension in the atlas",
          "statement": "The documented forest rule has ratio 3. The explicit atlas proof extends it to pseudoforests."
        },
        "lower": {
          "resultIds": [],
          "url": "https://arxiv.org/pdf/2611.02057",
          "title": "ASW26",
          "location": "Corollary 1.1; Proposition B.2 with r=1",
          "statement": "Paths rule out every coefficient below 3."
        },
        "applications": [
          {
            "resultId": "folklore-tree-mds",
            "graphs": [
              "pseudoforest",
              "forest",
              "degree-forest",
              "path",
              "oriented-path"
            ],
            "problems": [
              "dominating-set"
            ],
            "models": [
              "CONGEST",
              "LOCAL"
            ],
            "conditionIds": []
          }
        ]
      },
      {
        "id": "anonymous-vertex-cover-factor-two",
        "axis": "ratio",
        "precision": "exact",
        "scopeLabel": "Ratio 2 · anonymous port numbering",
        "parameterDomain": "Deterministic anonymous port numbering; positive integer weights; fixed degree and weight range for locality.",
        "statement": "The approximation ratio is exactly tight in this reviewed anonymous setting; runtime dependence on Δ and W is not certified.",
        "upper": {
          "resultIds": [
            "gen-as10-vc"
          ],
          "url": "https://jukkasuomela.fi/doc/vc-sc.pdf",
          "title": "Åstrand–Suomela",
          "location": "Theorem 1 and vertex-cover reduction",
          "statement": "The algorithm gives a weighted vertex cover of factor 2."
        },
        "lower": {
          "resultIds": [],
          "url": "https://jukkasuomela.fi/doc/linear-order.pdf",
          "title": "Göös–Hirvonen–Suomela",
          "location": "Section 1.4, vertex-cover approximability",
          "statement": "No deterministic local algorithm improves factor 2, even with identifiers; this includes the anonymous model."
        },
        "applications": [
          {
            "resultId": "gen-as10-vc",
            "graphs": [
              "general"
            ],
            "problems": [
              "vertex-cover"
            ],
            "models": [
              "Anonymous"
            ],
            "conditionIds": []
          }
        ]
      },
      {
        "id": "regular-vertex-cover-factor-two",
        "axis": "ratio",
        "precision": "exact",
        "scopeLabel": "Ratio 2 · positive-degree regular graphs",
        "parameterDomain": "Unweighted regular graphs of positive degree; zero-round algorithm.",
        "statement": "Ratio 2 is tight over this family, using the cycle subclass as a lower-bound witness.",
        "upper": {
          "resultIds": [
            "folklore-regular-vc"
          ],
          "url": "https://dept-info.labri.fr/~gavoille/article/BGPW25.pdf#page=2",
          "title": "Bonamy–Gavoille–Picavet–Wesolek",
          "location": "Introduction, footnote 1; elementary edge-count proof",
          "statement": "Selecting every vertex gives factor 2 without communication."
        },
        "lower": {
          "resultIds": [],
          "url": "https://jukkasuomela.fi/doc/linear-order.pdf",
          "title": "Göös–Hirvonen–Suomela",
          "location": "Section 1.4, vertex-cover approximability and cycle lower bound",
          "statement": "A factor below 2 on cycles would yield a nontrivial independent set in constant time; cycles are regular."
        },
        "applications": [
          {
            "resultId": "folklore-regular-vc",
            "graphs": [
              "regular",
              "cycle"
            ],
            "problems": [
              "vertex-cover"
            ],
            "models": [
              "CONGEST",
              "LOCAL"
            ],
            "conditionIds": []
          }
        ]
      },
      {
        "id": "outside-k-planar-factor",
        "axis": "ratio",
        "precision": "exact",
        "scopeLabel": "Ratio k/(k−2) · k ∈ {3,4,5,6}",
        "parameterDomain": "k ∈ {3,4,5,6}; outside-solution k-domination on planar graphs; deterministic n-independent locality.",
        "statement": "For these four values of k, the zero-round approximation coefficient is exactly tight.",
        "upper": {
          "resultIds": [
            "planar-k-dom-trivial"
          ],
          "url": "https://link.springer.com/chapter/10.1007/978-3-319-14472-6_4",
          "title": "Czygrinow–Hańćkowiak–Szymańska–Wawrzyniak–Witkowski",
          "location": "Abstract; trivial algorithm",
          "statement": "Selecting all vertices without communication gives ratio k/(k−2)."
        },
        "lower": {
          "resultIds": [
            "planar-k-dom-lower"
          ],
          "url": "https://link.springer.com/chapter/10.1007/978-3-319-14472-6_4",
          "title": "Czygrinow–Hańćkowiak–Szymańska–Wawrzyniak–Witkowski",
          "location": "Abstract; matching lower bound",
          "statement": "The matching lower bound allows identifiers and certifies k=3,4,5,6 only."
        },
        "applications": [
          {
            "resultId": "planar-k-dom-trivial",
            "graphs": [
              "planar"
            ],
            "problems": [
              "outside-k-domination"
            ],
            "models": [
              "Anonymous",
              "CONGEST",
              "LOCAL"
            ],
            "conditionIds": [
              "parameter-k-three-through-six"
            ]
          },
          {
            "resultId": "planar-k-dom-lower",
            "graphs": [
              "planar"
            ],
            "problems": [
              "outside-k-domination"
            ],
            "models": [
              "LOCAL",
              "CONGEST"
            ],
            "conditionIds": [
              "parameter-k-three-through-six"
            ]
          }
        ]
      },
      {
        "id": "long-cycle-distance-factor",
        "axis": "ratio",
        "precision": "exact",
        "scopeLabel": "Cycles, f(k)=1 · k=r>1, r=o(log* n)",
        "parameterDomain": "k=r>1, r=o(log* n), fixed accuracy gap ε>0; cycles of length at least 4r+3; O(r) rounds.",
        "statement": "On this cycle specialization the coefficient 2r+1 is tight within O(r) rounds.",
        "upper": {
          "resultIds": [
            "pic-girth-pruning"
          ],
          "url": "https://arxiv.org/html/2408.12998v1#S1",
          "title": "Lenzen–Wenning",
          "location": "Theorem 1.1 specialized to cycles",
          "statement": "Every cycle has k-hop expansion bound 1; the k-round ratio 2k f(k)+1 specializes to 2r+1."
        },
        "lower": {
          "resultIds": [
            "pic-girth-cycle-lower"
          ],
          "url": "https://arxiv.org/pdf/1910.02794#page=5",
          "title": "Amiri–Wiederhake",
          "location": "Theorem 2",
          "statement": "In O(r) deterministic LOCAL rounds, ratio 2r+1−ε is impossible for the stated r and cycle lengths."
        },
        "applications": [
          {
            "resultId": "pic-girth-pruning",
            "graphs": [
              "long-cycle"
            ],
            "problems": [
              "distance-dominating-set"
            ],
            "models": [
              "Anonymous",
              "CONGEST",
              "LOCAL"
            ],
            "conditionIds": [
              "scope-cycle-expansion-one",
              "scope-radius-k-equals-r",
              "scope-radius-r-sublogstar"
            ]
          },
          {
            "resultId": "pic-girth-cycle-lower",
            "graphs": [
              "long-cycle"
            ],
            "problems": [
              "distance-dominating-set"
            ],
            "models": [
              "LOCAL",
              "CONGEST"
            ],
            "conditionIds": [
              "scope-radius-r-sublogstar"
            ]
          }
        ]
      }
    ]
  },
  "conditions": {
    "weights-unweighted": {
      "kind": "weights",
      "label": "Unweighted"
    },
    "weights-weighted": {
      "kind": "weights",
      "label": "Weighted"
    },
    "weights-unspecified": {
      "kind": "weights",
      "label": "Weights unspecified in source record"
    },
    "weights-integer-positive": {
      "kind": "weights",
      "label": "Positive integer weights",
      "implies": [
        "weights-weighted"
      ]
    },
    "weights-integer-W": {
      "kind": "weights",
      "label": "Positive integer weights ≤ W",
      "implies": [
        "weights-integer-positive"
      ],
      "parts": [
        "Positive integer weights ",
        {
          "math": "≤ W"
        }
      ]
    },
    "weights-integer-polynomial": {
      "kind": "weights",
      "label": "Positive integer weights W ≤ n^O(1)",
      "implies": [
        "weights-integer-positive"
      ],
      "parts": [
        "Positive integer weights ",
        {
          "math": "W ≤ n^O(1)"
        }
      ]
    },
    "weights-normalized-positive": {
      "kind": "weights",
      "label": "Weights in [w_min, 1], w_min > 0",
      "implies": [
        "weights-weighted"
      ]
    },
    "costs-integer-b": {
      "kind": "weights",
      "label": "Positive integer costs ≤ b",
      "implies": [
        "weights-integer-positive"
      ],
      "parts": [
        "Positive integer costs ",
        {
          "math": "≤ b"
        }
      ]
    },
    "coefficients-normalized-positive": {
      "kind": "weights",
      "label": "Normalized positive LP coefficients"
    },
    "coefficient-encoding": {
      "kind": "input",
      "label": "Source CONGEST coefficient encoding"
    },
    "coefficients-at-least-one": {
      "kind": "input",
      "label": "Nonzero normalized coefficients Aᵢⱼ ≥ 1",
      "parts": [
        "Nonzero normalized coefficients ",
        {
          "math": "Aᵢⱼ ≥ 1"
        }
      ]
    },
    "input-positive-degree": {
      "kind": "input",
      "label": "Positive degree"
    },
    "graph-regular": {
      "kind": "graph",
      "label": "Regular graphs"
    },
    "graph-regular-positive": {
      "kind": "graph",
      "label": "Regular graphs, degree ≥ 1",
      "implies": [
        "graph-regular",
        "input-positive-degree"
      ],
      "parts": [
        "Regular graphs, degree ",
        {
          "math": "≥ 1"
        }
      ]
    },
    "input-own-degree": {
      "kind": "input",
      "label": "Initial own-degree knowledge"
    },
    "input-incident-ports": {
      "kind": "input",
      "label": "Initial incident ports"
    },
    "input-proper-two-coloring": {
      "kind": "input",
      "label": "Supplied proper 2-coloring",
      "parts": [
        "Supplied proper ",
        {
          "math": "2"
        },
        "-coloring"
      ]
    },
    "input-weak-two-coloring": {
      "kind": "input",
      "label": "Supplied weak 2-coloring",
      "parts": [
        "Supplied weak ",
        {
          "math": "2"
        },
        "-coloring"
      ]
    },
    "input-isolate-free": {
      "kind": "input",
      "label": "No isolated vertices"
    },
    "input-weak-coloring-no-isolates": {
      "kind": "input",
      "label": "Supplied weak 2-coloring; no isolates",
      "implies": [
        "input-weak-two-coloring",
        "input-isolate-free"
      ],
      "parts": [
        "Supplied weak ",
        {
          "math": "2"
        },
        "-coloring; no isolates"
      ]
    },
    "input-known-n": {
      "kind": "input",
      "label": "Known n",
      "parts": [
        "Known ",
        {
          "math": "n"
        }
      ]
    },
    "input-known-degree": {
      "kind": "input",
      "label": "Known Δ",
      "parts": [
        "Known ",
        {
          "math": "Δ"
        }
      ]
    },
    "input-known-n-degree": {
      "kind": "input",
      "label": "Known n and Δ",
      "implies": [
        "input-known-n",
        "input-known-degree"
      ],
      "parts": [
        "Known ",
        {
          "math": "n"
        },
        " and ",
        {
          "math": "Δ"
        }
      ]
    },
    "input-known-n-degree-graph": {
      "kind": "input",
      "label": "Known n, Δ and graph parameters",
      "implies": [
        "input-known-n-degree"
      ],
      "parts": [
        "Known ",
        {
          "math": "n"
        },
        ", ",
        {
          "math": "Δ"
        },
        " and graph parameters"
      ]
    },
    "input-known-degree-bound": {
      "kind": "input",
      "label": "Known Δ or a polynomial upper bound",
      "parts": [
        "Known ",
        {
          "math": "Δ"
        },
        " or a polynomial upper bound"
      ]
    },
    "input-common-polynomial-id-bound": {
      "kind": "input",
      "label": "Known common polynomial ID bound"
    },
    "input-common-nW-bound": {
      "kind": "input",
      "label": "Common polynomial bound B ≥ nW",
      "parts": [
        "Common polynomial bound ",
        {
          "math": "B ≥ nW"
        }
      ]
    },
    "input-degree-and-nW-bound": {
      "kind": "input",
      "label": "Known Δ or a polynomial upper bound; common polynomial bound B ≥ nW",
      "implies": [
        "input-known-degree-bound",
        "input-common-nW-bound"
      ],
      "parts": [
        "Known ",
        {
          "math": "Δ"
        },
        " or a polynomial upper bound; common polynomial bound ",
        {
          "math": "B ≥ nW"
        }
      ]
    },
    "input-geometric-distances": {
      "kind": "input",
      "label": "Geometric distances supplied"
    },
    "input-expansion-bounds": {
      "kind": "input",
      "label": "Expansion bounds supplied"
    },
    "input-lipschitz-capacity-bound": {
      "kind": "input",
      "label": "Known Lipschitz capacity bound"
    },
    "input-c-approx-seed": {
      "kind": "input",
      "label": "Supplied c-approximate dominating set; seed cost additional",
      "parts": [
        "Supplied ",
        {
          "math": "c"
        },
        "-approximate dominating set; seed cost additional"
      ]
    },
    "input-connected": {
      "kind": "input",
      "label": "Connected input"
    },
    "input-diameter-four-k": {
      "kind": "input",
      "label": "Diameter ≥ 4k",
      "parts": [
        "Diameter ",
        {
          "math": "≥ 4k"
        }
      ]
    },
    "input-connected-diameter-four-k": {
      "kind": "input",
      "label": "Connected; diameter ≥ 4k",
      "implies": [
        "input-connected",
        "input-diameter-four-k"
      ],
      "parts": [
        "Connected; diameter ",
        {
          "math": "≥ 4k"
        }
      ]
    },
    "input-C-k-t-domination": {
      "kind": "input",
      "label": "Known C, k, t; domination constraint",
      "parts": [
        "Known ",
        {
          "math": "C"
        },
        ", ",
        {
          "math": "k"
        },
        ", ",
        {
          "math": "t"
        },
        "; domination constraint"
      ]
    },
    "input-distinct-ids": {
      "kind": "input",
      "label": "Distinct identifiers"
    },
    "input-logarithmic-ids": {
      "kind": "input",
      "label": "Distinct O(log n)-bit identifiers",
      "implies": [
        "input-distinct-ids"
      ]
    },
    "input-ids-one-to-n": {
      "kind": "input",
      "label": "Identifiers in {1,…,n}",
      "implies": [
        "input-logarithmic-ids"
      ]
    },
    "model-port-numbering": {
      "kind": "model",
      "label": "Port numbering"
    },
    "model-anonymous-broadcast": {
      "kind": "model",
      "label": "Anonymous broadcast",
      "implies": [
        "model-port-numbering"
      ]
    },
    "model-broadcast-congest": {
      "kind": "model",
      "label": "Broadcast CONGEST"
    },
    "model-supported-preprocessing": {
      "kind": "model",
      "label": "Support-topology preprocessing allowed"
    },
    "model-sleeping-congest": {
      "kind": "model",
      "label": "Sleeping CONGEST"
    },
    "strength-no-ids": {
      "kind": "strength",
      "label": "Identifiers unnecessary"
    },
    "strength-no-degree-knowledge": {
      "kind": "strength",
      "label": "Degree knowledge unnecessary"
    },
    "strength-no-communication": {
      "kind": "strength",
      "label": "No communication needed"
    },
    "strength-no-alpha-knowledge": {
      "kind": "strength",
      "label": "Arboricity need not be known"
    },
    "strength-no-embedding": {
      "kind": "strength",
      "label": "Embedding unnecessary"
    },
    "strength-empty-messages": {
      "kind": "strength",
      "label": "Empty messages suffice"
    },
    "strength-one-bit": {
      "kind": "strength",
      "label": "One-bit messages suffice"
    },
    "strength-two-bits": {
      "kind": "strength",
      "label": "At most two bits per message"
    },
    "strength-log-degree-bits": {
      "kind": "strength",
      "label": "Messages ≤ ⌈log Δ⌉ bits",
      "parts": [
        "Messages ",
        {
          "math": "≤ ⌈log Δ⌉"
        },
        " bits"
      ]
    },
    "strength-log-n-bits": {
      "kind": "strength",
      "label": "O(log n)-bit messages"
    },
    "strength-no-f-knowledge": {
      "kind": "strength",
      "label": "Algorithm need not know f(k)",
      "parts": [
        "Algorithm need not know ",
        {
          "math": "f(k)"
        }
      ]
    },
    "detail-weights-one-message": {
      "kind": "detail",
      "label": "Node weights fit one CONGEST message"
    },
    "detail-red-blue-hitting-set": {
      "kind": "detail",
      "label": "Also red-blue domination / hitting set"
    },
    "detail-fractional-output": {
      "kind": "output",
      "label": "Fractional output"
    },
    "detail-integral-output": {
      "kind": "output",
      "label": "Integral output"
    },
    "detail-fractional-benchmark": {
      "kind": "guarantee",
      "label": "Fractional optimum benchmark"
    },
    "detail-integral-benchmark": {
      "kind": "guarantee",
      "label": "Integral optimum benchmark"
    },
    "detail-total-weight-benchmark": {
      "kind": "guarantee",
      "label": "w(V) is total input weight, hence at least OPT"
    },
    "detail-exact-components": {
      "kind": "detail",
      "label": "Exact component optimum"
    },
    "detail-four-uniform": {
      "kind": "guarantee",
      "label": "4-uniform guarantee"
    },
    "detail-lower-approximation-range": {
      "kind": "guarantee",
      "label": "Constant or polylogarithmic approximation factors"
    },
    "detail-per-vertex-density": {
      "kind": "output",
      "label": "Density estimate at each vertex"
    },
    "output-client-domination": {
      "kind": "output",
      "label": "Only designated clients must be dominated"
    },
    "output-outside-k": {
      "kind": "output",
      "label": "k neighbors required only outside the solution"
    },
    "output-outside-two": {
      "kind": "output",
      "label": "2 neighbors required only outside the solution",
      "implies": [
        "output-outside-k"
      ]
    },
    "output-fmatching-simple": {
      "kind": "output",
      "label": "Integer vertex capacities; each edge used at most once"
    },
    "output-bmatching-multiplicity": {
      "kind": "output",
      "label": "Integer capacities; integer edge multiplicities"
    },
    "input-lipschitz-capacities": {
      "kind": "input",
      "label": "|b(u)−b(v)| ≤ L dist(u,v)",
      "parts": [
        {
          "math": "|b(u)−b(v)| ≤ L dist(u,v)"
        }
      ]
    },
    "input-local-covering-candidates": {
      "kind": "input",
      "label": "Feasible locally known candidates C(r) ⊆ N[r]",
      "parts": [
        "Feasible locally known candidates ",
        {
          "math": "C"
        },
        "(r) ⊆ N[r]"
      ]
    },
    "input-feasible-set-cover": {
      "kind": "input",
      "label": "Feasible set-cover instance"
    },
    "strength-unbounded-set-incidence": {
      "kind": "strength",
      "label": "Set size and element frequency may be unbounded"
    },
    "detail-rank-two-simulation": {
      "kind": "detail",
      "label": "Rank-two incidence protocol simulated with constant overhead"
    },
    "strength-no-global-degree": {
      "kind": "strength",
      "label": "Global Δ unnecessary",
      "parts": [
        "Global ",
        {
          "math": "Δ"
        },
        " unnecessary"
      ]
    },
    "detail-exact-integrality": {
      "kind": "detail",
      "label": "Choose internal ε < 1/B for the exact-factor integrality step; knowing n and W suffices",
      "parts": [
        "Choose internal ",
        {
          "math": "ε < 1/B"
        },
        " for the exact-factor integrality step; knowing n and W suffices"
      ]
    },
    "detail-no-nW-for-scheme": {
      "kind": "detail",
      "label": "A common bound on nW is needed only for exact-factor rounding"
    },
    "detail-unknown-degree-variants": {
      "kind": "detail",
      "label": "Section 4 gives separate unknown-Δ variants and parameter choices",
      "parts": [
        "Section 4 gives separate unknown-",
        {
          "math": "Δ"
        },
        " variants and parameter choices"
      ]
    },
    "parameter-epsilon-positive": {
      "kind": "parameter",
      "label": "ε > 0",
      "parts": [
        {
          "math": "ε > 0"
        }
      ]
    },
    "parameter-epsilon-unit": {
      "kind": "parameter",
      "label": "0 < ε < 1",
      "implies": [
        "parameter-epsilon-positive"
      ],
      "parts": [
        {
          "math": "0 < ε < 1"
        }
      ]
    },
    "parameter-epsilon-half": {
      "kind": "parameter",
      "label": "0 < ε < 1/2",
      "implies": [
        "parameter-epsilon-unit"
      ],
      "parts": [
        {
          "math": "0 < ε < 1/2"
        }
      ]
    },
    "parameter-epsilon-quarter": {
      "kind": "parameter",
      "label": "0 < ε < 1/4",
      "implies": [
        "parameter-epsilon-half"
      ],
      "parts": [
        {
          "math": "0 < ε < 1/4"
        }
      ]
    },
    "parameter-epsilon-tree-domain": {
      "kind": "parameter",
      "label": "log(n)/n < ε < 1",
      "implies": [
        "parameter-epsilon-unit"
      ],
      "parts": [
        {
          "math": "log(n)/n < ε < 1"
        }
      ]
    },
    "parameter-fixed-epsilon": {
      "kind": "parameter",
      "label": "Fixed ε",
      "parts": [
        "Fixed ",
        {
          "math": "ε"
        }
      ]
    },
    "parameter-fixed-H": {
      "kind": "parameter",
      "label": "Fixed excluded minor H",
      "parts": [
        "Fixed excluded minor ",
        {
          "math": "H"
        }
      ]
    },
    "parameter-nonplanar-H": {
      "kind": "parameter",
      "label": "Nonplanar excluded minor H",
      "parts": [
        "Nonplanar excluded minor ",
        {
          "math": "H"
        }
      ]
    },
    "parameter-fixed-alpha": {
      "kind": "parameter",
      "label": "Fixed arboricity α",
      "parts": [
        "Fixed arboricity ",
        {
          "math": "α"
        }
      ]
    },
    "parameter-alpha-ge1": {
      "kind": "parameter",
      "label": "α ≥ 1",
      "parts": [
        {
          "math": "α ≥ 1"
        }
      ]
    },
    "parameter-fixed-alpha-ge2": {
      "kind": "parameter",
      "label": "Fixed α ≥ 2",
      "implies": [
        "parameter-fixed-alpha",
        "parameter-alpha-ge1"
      ],
      "parts": [
        "Fixed ",
        {
          "math": "α ≥ 2"
        }
      ]
    },
    "parameter-a-rational-ge1": {
      "kind": "parameter",
      "label": "Rational a ≥ 1",
      "parts": [
        "Rational ",
        {
          "math": "a ≥ 1"
        }
      ]
    },
    "parameter-a-integer-ge1": {
      "kind": "parameter",
      "label": "Integer a ≥ 1",
      "implies": [
        "parameter-a-rational-ge1"
      ],
      "parts": [
        "Integer ",
        {
          "math": "a ≥ 1"
        }
      ]
    },
    "parameter-a-integer-ge2": {
      "kind": "parameter",
      "label": "Integer a ≥ 2",
      "implies": [
        "parameter-a-integer-ge1"
      ],
      "parts": [
        "Integer ",
        {
          "math": "a ≥ 2"
        }
      ]
    },
    "parameter-d-even-ge2": {
      "kind": "parameter",
      "label": "Even integer d ≥ 2",
      "parts": [
        "Even integer ",
        {
          "math": "d ≥ 2"
        }
      ]
    },
    "parameter-k-ge1": {
      "kind": "parameter",
      "label": "k ≥ 1",
      "parts": [
        {
          "math": "k ≥ 1"
        }
      ]
    },
    "parameter-k-ge2": {
      "kind": "parameter",
      "label": "k ≥ 2",
      "implies": [
        "parameter-k-ge1"
      ],
      "parts": [
        {
          "math": "k ≥ 2"
        }
      ]
    },
    "parameter-k-ge3": {
      "kind": "parameter",
      "label": "k ≥ 3",
      "implies": [
        "parameter-k-ge2"
      ],
      "parts": [
        {
          "math": "k ≥ 3"
        }
      ]
    },
    "parameter-k-three-through-six": {
      "kind": "parameter",
      "label": "k ∈ {3,4,5,6}",
      "implies": [
        "parameter-k-ge3"
      ]
    },
    "parameter-fixed-k": {
      "kind": "parameter",
      "label": "Fixed radius k"
    },
    "parameter-expansion-ge1": {
      "kind": "parameter",
      "label": "f(k) ≥ 1",
      "parts": [
        {
          "math": "f(k) ≥ 1"
        }
      ]
    },
    "parameter-r-integer-ge1": {
      "kind": "parameter",
      "label": "Integer r ≥ 1",
      "parts": [
        "Integer ",
        {
          "math": "r ≥ 1"
        }
      ]
    },
    "parameter-t-integer-ge1": {
      "kind": "parameter",
      "label": "Integer t ≥ 1",
      "parts": [
        "Integer ",
        {
          "math": "t ≥ 1"
        }
      ]
    },
    "parameter-fixed-t-ge2": {
      "kind": "parameter",
      "label": "Fixed integer t ≥ 2",
      "implies": [
        "parameter-t-integer-ge1"
      ],
      "parts": [
        "Fixed integer ",
        {
          "math": "t ≥ 2"
        }
      ]
    },
    "claim-t-ge49": {
      "kind": "claim",
      "label": "t ≥ 49",
      "parts": [
        {
          "math": "t ≥ 49"
        }
      ]
    },
    "parameter-f-at-most-k": {
      "kind": "parameter",
      "label": "f ≤ k",
      "parts": [
        {
          "math": "f ≤ k"
        }
      ]
    },
    "parameter-fixed-delta": {
      "kind": "parameter",
      "label": "Fixed δ > 0"
    },
    "parameter-beta-ge1": {
      "kind": "parameter",
      "label": "β ≥ 1",
      "parts": [
        {
          "math": "β ≥ 1"
        }
      ]
    },
    "parameter-beta-gt1": {
      "kind": "parameter",
      "label": "β > 1",
      "implies": [
        "parameter-beta-ge1"
      ],
      "parts": [
        {
          "math": "β > 1"
        }
      ]
    },
    "parameter-fixed-expansion": {
      "kind": "parameter",
      "label": "Fixed expansion bounds"
    },
    "parameter-fixed-L": {
      "kind": "parameter",
      "label": "Fixed Lipschitz bound L"
    },
    "parameter-fixed-rho-b-epsilon": {
      "kind": "parameter",
      "label": "Fixed rational ρ ≥ 1, integer b ≥ 1 and ε > 0",
      "implies": [
        "parameter-epsilon-positive",
        "parameter-fixed-epsilon"
      ],
      "parts": [
        "Fixed rational ",
        {
          "math": "ρ ≥ 1"
        },
        ", integer ",
        {
          "math": "b ≥ 1"
        },
        " and ",
        {
          "math": "ε > 0"
        }
      ]
    },
    "parameter-fixed-b-epsilon": {
      "kind": "parameter",
      "label": "Fixed integer b ≥ 1 and ε > 0",
      "implies": [
        "parameter-epsilon-positive",
        "parameter-fixed-epsilon"
      ],
      "parts": [
        "Fixed integer ",
        {
          "math": "b ≥ 1"
        },
        " and ",
        {
          "math": "ε > 0"
        }
      ]
    },
    "parameter-fixed-a": {
      "kind": "parameter",
      "label": "Fixed rational a ≥ 1",
      "implies": [
        "parameter-a-rational-ge1"
      ],
      "parts": [
        "Fixed rational ",
        {
          "math": "a ≥ 1"
        }
      ]
    },
    "parameter-fixed-genus": {
      "kind": "parameter",
      "label": "Fixed Euler genus g"
    },
    "parameter-known-d-epsilon": {
      "kind": "input",
      "label": "Supplied integer degeneracy bound d ≥ 1 and ε > 0",
      "parts": [
        "Supplied integer degeneracy bound ",
        {
          "math": "d ≥ 1"
        },
        " and ",
        {
          "math": "ε > 0"
        }
      ]
    },
    "parameter-degeneracy-runtime": {
      "kind": "detail",
      "label": "For 0 < ε ≤ 1, the round complexity is O((d/ε)²) and independent of n and maximum degree",
      "parts": [
        "For ",
        {
          "math": "0 < ε ≤ 1"
        },
        ", the round complexity is O((d/",
        {
          "math": "ε"
        },
        ")²) and independent of n and maximum degree"
      ]
    },
    "scope-rounds-n-H-epsilon": {
      "kind": "scope",
      "label": "In n; fixed H, ε",
      "implies": [
        "parameter-fixed-H",
        "parameter-fixed-epsilon"
      ],
      "parts": [
        "In ",
        {
          "math": "n"
        },
        "; fixed ",
        {
          "math": "H"
        },
        ", ",
        {
          "math": "ε"
        }
      ]
    },
    "scope-rounds-n-alpha-epsilon": {
      "kind": "scope",
      "label": "In n; fixed α, ε",
      "implies": [
        "parameter-fixed-alpha",
        "parameter-fixed-epsilon"
      ],
      "parts": [
        "In ",
        {
          "math": "n"
        },
        "; fixed ",
        {
          "math": "α"
        },
        ", ",
        {
          "math": "ε"
        }
      ]
    },
    "scope-rounds-n-expansion-epsilon": {
      "kind": "scope",
      "label": "In n; fixed ε and expansion",
      "implies": [
        "parameter-fixed-epsilon",
        "parameter-fixed-expansion"
      ],
      "parts": [
        "In ",
        {
          "math": "n"
        },
        "; fixed ",
        {
          "math": "ε"
        },
        " and expansion"
      ]
    },
    "scope-rounds-n-L-expansion-epsilon": {
      "kind": "scope",
      "label": "In n; fixed ε, L and expansion",
      "implies": [
        "parameter-fixed-epsilon",
        "parameter-fixed-L",
        "parameter-fixed-expansion"
      ],
      "parts": [
        "In ",
        {
          "math": "n"
        },
        "; fixed ",
        {
          "math": "ε"
        },
        ", L and expansion"
      ]
    },
    "scope-rounds-n-rho-b-epsilon": {
      "kind": "scope",
      "label": "In n; fixed ρ, b, ε",
      "implies": [
        "parameter-fixed-rho-b-epsilon"
      ],
      "parts": [
        "In ",
        {
          "math": "n"
        },
        "; fixed ",
        {
          "math": "ρ, b, ε"
        }
      ]
    },
    "scope-rounds-n-epsilon": {
      "kind": "scope",
      "label": "In n; fixed ε",
      "implies": [
        "parameter-fixed-epsilon"
      ],
      "parts": [
        "In ",
        {
          "math": "n"
        },
        "; fixed ",
        {
          "math": "ε"
        }
      ]
    },
    "scope-factor-independent-degree": {
      "kind": "scope",
      "label": "Approximation independent of Δ",
      "parts": [
        "Approximation independent of ",
        {
          "math": "Δ"
        }
      ]
    },
    "scope-cycle-expansion-one": {
      "kind": "parameter",
      "label": "f(k)=1",
      "implies": [
        "parameter-expansion-ge1"
      ],
      "parts": [
        {
          "math": "f(k)=1"
        }
      ]
    },
    "scope-radius-k-equals-r": {
      "kind": "parameter",
      "label": "k=r"
    },
    "scope-radius-r-sublogstar": {
      "kind": "parameter",
      "label": "r > 1 and r=o(log* n)",
      "parts": [
        {
          "math": "r > 1"
        },
        " and r=o(log* n)"
      ]
    },
    "binding-a-three": {
      "kind": "parameter",
      "label": "a=3",
      "implies": [
        "parameter-a-integer-ge2"
      ],
      "parts": [
        {
          "math": "a=3"
        }
      ]
    },
    "binding-rho-three": {
      "kind": "parameter",
      "label": "ρ=3",
      "parts": [
        {
          "math": "ρ=3"
        }
      ]
    },
    "binding-unit-costs": {
      "kind": "weights",
      "label": "Unit costs",
      "implies": [
        "weights-unweighted"
      ]
    },
    "binding-closed-neighborhood-requests": {
      "kind": "input",
      "label": "Requests V with C(v)=N[v]",
      "parts": [
        "Requests V with ",
        {
          "math": "C"
        },
        "(v)=N[v]"
      ]
    },
    "parameter-epsilon-unit-inclusive": {
      "kind": "parameter",
      "label": "0 < ε ≤ 1",
      "implies": [
        "parameter-epsilon-positive"
      ],
      "parts": [
        {
          "math": "0 < ε ≤ 1"
        }
      ]
    },
    "claim-source-weight-encoding": {
      "kind": "claim",
      "label": "Source CONGEST weight encoding"
    },
    "graph-variable-constraint-incidence": {
      "kind": "graph",
      "label": "Variable–constraint incidence graph"
    },
    "output-always-feasible": {
      "kind": "output",
      "label": "Output always feasible"
    },
    "parameter-depth-one-excluded-k3t": {
      "kind": "parameter",
      "label": "K₃,ₜ excluded as a depth-1 minor (t ≥ 3)",
      "parts": [
        {
          "math": "K₃,ₜ"
        },
        " excluded as a depth-1 minor (",
        {
          "math": "t ≥ 3"
        },
        ")"
      ]
    },
    "input-integer-depth-one-density": {
      "kind": "input",
      "label": "Known integer c ≥ ∇₁(G)",
      "parts": [
        "Known integer ",
        {
          "math": "c ≥ ∇₁(G)"
        }
      ]
    },
    "parameter-depth-one-density-definition": {
      "kind": "parameter",
      "label": "∇₁(G) is the maximum edge density |E(H)|/|V(H)| over nonempty depth-1 minors H of G",
      "parts": [
        {
          "math": "∇₁(G)"
        },
        " is the maximum edge density ",
        {
          "math": "|E(H)|/|V(H)|"
        },
        " over nonempty depth-1 minors ",
        {
          "math": "H"
        },
        " of ",
        {
          "math": "G"
        }
      ]
    },
    "detail-depth-one-integer-ceiling": {
      "kind": "detail",
      "label": "One may take c=⌈∇₁(G)⌉ if this value is supplied. A larger known integer upper bound is also allowed; the guarantee uses the supplied c.",
      "parts": [
        "One may take ",
        {
          "math": "c=⌈∇₁(G)⌉"
        },
        " if this value is supplied. A larger known integer upper bound is also allowed; the guarantee uses the supplied c."
      ]
    },
    "binding-excluded-minor-k2t": {
      "kind": "parameter",
      "label": "H = K₂,t",
      "parts": [
        {
          "math": "H = K₂,t"
        }
      ]
    },
    "graph-connected-euler": {
      "kind": "graph",
      "label": "Connected; Euler genus ≤ g",
      "implies": [
        "input-connected"
      ],
      "parts": [
        "Connected; Euler genus ",
        {
          "math": "≤ g"
        }
      ]
    },
    "auto-graph-18d80e24949ad78541c0": {
      "kind": "graph",
      "label": "Bounded expansion"
    },
    "auto-parameter-18eb64ecbc1e49e9ea9e": {
      "kind": "parameter",
      "label": "Fixed integer upper bound ∇₁ > 0 on the edge density of depth-1 minors. Both the approximation ratio and round complexity depend on ∇₁.",
      "parts": [
        "Fixed integer upper bound ",
        {
          "math": "∇₁ > 0"
        },
        " on the edge density of depth-1 minors. Both the approximation ratio and round complexity depend on ",
        {
          "math": "∇₁"
        },
        "."
      ]
    },
    "auto-assumption-a3374a86e4b667605804": {
      "kind": "assumption",
      "label": "Unique identifiers; an upper bound on ∇₁ is supplied; no embedding is supplied.",
      "parts": [
        "Unique identifiers; an upper bound on ",
        {
          "math": "∇₁"
        },
        " is supplied; no embedding is supplied."
      ]
    },
    "auto-output-b321139eea50286d2951": {
      "kind": "output",
      "label": "Dominating set"
    },
    "auto-model-0109be7e98692221e7ec": {
      "kind": "model",
      "label": "LOCAL"
    },
    "auto-model-557b5d489bacf2f8f758": {
      "kind": "model",
      "label": "Deterministic"
    },
    "auto-graph-315a624a2fe052ad3bab": {
      "kind": "graph",
      "label": "Planar"
    },
    "auto-parameter-34f494bd0c1a858c0a42": {
      "kind": "parameter",
      "label": "Fixed ε > 0; the round complexity depends on ε.",
      "parts": [
        "Fixed ",
        {
          "math": "ε > 0"
        },
        "; the round complexity depends on ",
        {
          "math": "ε"
        },
        "."
      ]
    },
    "auto-assumption-44c6dc5d9b316688718b": {
      "kind": "assumption",
      "label": "Unique identifiers; no embedding is supplied."
    },
    "auto-graph-e40ef97c3969c67aad8c": {
      "kind": "graph",
      "label": "Excluded fixed minor"
    },
    "auto-parameter-ce8a0b4b55d3e5cea9b6": {
      "kind": "parameter",
      "label": "Fixed excluded minor and 0 < ε < 1.",
      "parts": [
        "Fixed excluded minor and ",
        {
          "math": "0 < ε < 1"
        },
        "."
      ]
    },
    "auto-output-4ad7b7801c4e84e8fdd9": {
      "kind": "output",
      "label": "Independent set"
    },
    "auto-model-a7eb1105eb53acec3508": {
      "kind": "model",
      "label": "CONGEST"
    },
    "auto-parameter-47955123d1ab13811753": {
      "kind": "parameter",
      "label": "Fixed ε > 0; only online rounds are counted.",
      "parts": [
        "Fixed ",
        {
          "math": "ε > 0"
        },
        "; only online rounds are counted."
      ]
    },
    "auto-assumption-40b36c6041358c068e48": {
      "kind": "assumption",
      "label": "Preprocessing of the support topology is allowed. Only the designated clients must be dominated."
    },
    "auto-output-750423ed7257675c4903": {
      "kind": "output",
      "label": "Client dominating set"
    },
    "auto-model-b67c8cccac8764b919fe": {
      "kind": "model",
      "label": "SUPPORTED"
    },
    "auto-graph-97a0a2af0e526b2ffcd5": {
      "kind": "graph",
      "label": "Arboricity ≤ α",
      "parts": [
        "Arboricity ",
        {
          "math": "≤ α"
        }
      ]
    },
    "auto-parameter-c1636b1b5a093071fc57": {
      "kind": "parameter",
      "label": "0 < ε < 1; α is known. Δ is the maximum degree.",
      "parts": [
        {
          "math": "0 < ε < 1"
        },
        "; ",
        {
          "math": "α"
        },
        " is known. ",
        {
          "math": "Δ"
        },
        " is the maximum degree."
      ]
    },
    "auto-assumption-895ecf81e2a512b52c01": {
      "kind": "assumption",
      "label": "Positive integer vertex weights bounded by nᶜ for a constant c."
    },
    "auto-graph-a6106837b5e5e7d68a12": {
      "kind": "graph",
      "label": "Arboricity 2",
      "parts": [
        "Arboricity ",
        {
          "math": "2"
        }
      ]
    },
    "auto-parameter-0bb93829ec58e258a2dd": {
      "kind": "parameter",
      "label": "Δ is the maximum degree.",
      "parts": [
        {
          "math": "Δ"
        },
        " is the maximum degree."
      ]
    },
    "auto-assumption-c882a0c21e6fc58b26e1": {
      "kind": "assumption",
      "label": "Unweighted graphs; the lower bound applies to deterministic and randomized LOCAL algorithms."
    },
    "auto-model-8c23ea8df7a704e9d465": {
      "kind": "model",
      "label": "Randomized"
    },
    "auto-output-d95ef193bcfe270b3957": {
      "kind": "output",
      "label": "Maximum matching"
    },
    "auto-parameter-368afe424cc1014e2254": {
      "kind": "parameter",
      "label": "No fixed degree bound is required."
    },
    "auto-parameter-d6747b2e215206975909": {
      "kind": "parameter",
      "label": "α is the arboricity bound.",
      "parts": [
        {
          "math": "α"
        },
        " is the arboricity bound."
      ]
    },
    "auto-assumption-8e4374cee15dc4d80d36": {
      "kind": "assumption",
      "label": "Unweighted; the stated round complexity is achieved with high probability."
    },
    "auto-graph-2379fa66cc1a5f1d4e5c": {
      "kind": "graph",
      "label": "Outerplanar"
    },
    "auto-model-92362405df7c8f0d5040": {
      "kind": "model",
      "label": "Anonymous"
    },
    "auto-parameter-8359c573af80d8ec5226": {
      "kind": "parameter",
      "label": "Any fixed ε > 0.",
      "parts": [
        "Any fixed ",
        {
          "math": "ε > 0"
        },
        "."
      ]
    },
    "auto-assumption-89aac91807f1f88e4b7c": {
      "kind": "assumption",
      "label": "Deterministic LOCAL algorithms, including algorithms with unique IDs."
    },
    "auto-parameter-399ec73f7f5ad61ad9de": {
      "kind": "parameter",
      "label": "Known upper bound ∇₁ on the edge density of depth-1 minors; t is the least integer such that Kₜ,ₜ is absent as a subgraph, with t ≤ 2∇₁ + 1. The approximation ratio depends on these parameters; the number of LOCAL communication rounds is universally bounded.",
      "parts": [
        "Known upper bound ",
        {
          "math": "∇₁"
        },
        " on the edge density of depth-1 minors; t is the least integer such that ",
        {
          "math": "Kₜ"
        },
        ",ₜ is absent as a subgraph, with t ≤ 2",
        {
          "math": "∇₁"
        },
        " + 1. The approximation ratio depends on these parameters; the number of LOCAL communication rounds is universally bounded."
      ]
    },
    "auto-graph-3e2ec5f6ef8ff6c28460": {
      "kind": "graph",
      "label": "Locally embeddable"
    },
    "auto-graph-328b3babf04eeaf07339": {
      "kind": "graph",
      "label": "Bounded genus"
    },
    "auto-parameter-09168808af1df2c8e6de": {
      "kind": "parameter",
      "label": "Fixed genus g and ε > 0.",
      "parts": [
        "Fixed genus g and ",
        {
          "math": "ε > 0"
        },
        "."
      ]
    },
    "auto-graph-f06d27c0e3b1ee4832f6": {
      "kind": "graph",
      "label": "Excluded topological Kₕ",
      "parts": [
        "Excluded topological ",
        {
          "math": "Kₕ"
        }
      ]
    },
    "auto-parameter-37cf69063665c567a1b7": {
      "kind": "parameter",
      "label": "Fixed h; both constants depend on h."
    },
    "auto-graph-0c9054ce7c0f254cff8a": {
      "kind": "graph",
      "label": "Excluded Kₕ minor",
      "parts": [
        "Excluded ",
        {
          "math": "Kₕ"
        },
        " minor"
      ]
    },
    "auto-parameter-54a27f04a63e72da0dd9": {
      "kind": "parameter",
      "label": "Fixed h and ε > 0.",
      "parts": [
        "Fixed h and ",
        {
          "math": "ε > 0"
        },
        "."
      ]
    },
    "auto-parameter-4896d040e95ba8df7a1b": {
      "kind": "parameter",
      "label": "Fixed expansion class and distance r."
    },
    "auto-assumption-a1335d5c279ce2f65aa3": {
      "kind": "assumption",
      "label": "Broadcast CONGEST; connected output requires a connected input."
    },
    "auto-output-4bc26b2a562297a647e1": {
      "kind": "output",
      "label": "Distance-r dominating set"
    },
    "auto-output-f0d9c1f064503cf5f16e": {
      "kind": "output",
      "label": "Connected distance-r dominating set"
    },
    "auto-parameter-a5c3105c54ebf1d906ab": {
      "kind": "parameter",
      "label": "No degree bound."
    },
    "auto-assumption-ce6b1c5257cc01ecf01a": {
      "kind": "assumption",
      "label": "Connected unweighted input; uses a constant-factor dominating set as a subroutine."
    },
    "auto-output-c3aa2eb288e53d5419d5": {
      "kind": "output",
      "label": "Connected dominating set"
    },
    "auto-parameter-cd4920bb34139c49b8f8": {
      "kind": "parameter",
      "label": "k = 2."
    },
    "auto-output-ef1b974b591df8f63ec3": {
      "kind": "output",
      "label": "2-domination (outside the solution)"
    },
    "auto-graph-924a81ff2b56320e8d33": {
      "kind": "graph",
      "label": "Orientable genus ≤ g",
      "parts": [
        "Orientable genus ",
        {
          "math": "≤ g"
        }
      ]
    },
    "auto-parameter-52b654b9ca9cab42e4ed": {
      "kind": "parameter",
      "label": "Orientable genus at most g; both the approximation ratio and the number of communication rounds depend linearly on g.",
      "parts": [
        "Orientable genus at most ",
        {
          "math": "g"
        },
        "; both the approximation ratio and the number of communication rounds depend linearly on g."
      ]
    },
    "auto-parameter-b8fdbb33beabe4183121": {
      "kind": "parameter",
      "label": "Fixed k ≥ 3.",
      "parts": [
        "Fixed ",
        {
          "math": "k ≥ 3"
        },
        "."
      ]
    },
    "auto-output-b54ac6401a901b9d3590": {
      "kind": "output",
      "label": "k-domination (outside the solution)"
    },
    "auto-parameter-7c840dd07497ac66d521": {
      "kind": "parameter",
      "label": "k = 2; fixed ε > 0.",
      "parts": [
        "k = 2; fixed ",
        {
          "math": "ε > 0"
        },
        "."
      ]
    },
    "auto-assumption-645e17e1d66815d2bcca": {
      "kind": "assumption",
      "label": "Unique identifiers allowed."
    },
    "auto-parameter-2ba338b64d6712d3e5cc": {
      "kind": "parameter",
      "label": "k ∈ {3, 4, 5, 6}; any fixed ε > 0.",
      "parts": [
        "k ∈ {3, 4, 5, 6}; any fixed ",
        {
          "math": "ε > 0"
        },
        "."
      ]
    },
    "auto-assumption-a2e9c2b616808887ae25": {
      "kind": "assumption",
      "label": "Unique identifiers allowed; smaller fixed ratios are excluded."
    },
    "auto-graph-422a8fcd40a47bc44c15": {
      "kind": "graph",
      "label": "Unit-disk"
    },
    "auto-parameter-e140b685efc84e3de936": {
      "kind": "parameter",
      "label": "f(n) is the approximation factor; T(n) the round complexity."
    },
    "auto-assumption-b836cd95ee47f8554bf1": {
      "kind": "assumption",
      "label": "Unweighted; running time holds with high probability."
    },
    "auto-parameter-086b33ba1d8d93f63191": {
      "kind": "parameter",
      "label": "Δ is maximum degree.",
      "parts": [
        {
          "math": "Δ"
        },
        " is maximum degree."
      ]
    },
    "auto-assumption-d5ea1a184c45a94072eb": {
      "kind": "assumption",
      "label": "Unweighted; uniform algorithm."
    },
    "auto-parameter-cd01ec1b8d72b36ac585": {
      "kind": "parameter",
      "label": "Fixed α and 0 < ε < 1.",
      "parts": [
        "Fixed ",
        {
          "math": "α"
        },
        " and ",
        {
          "math": "0 < ε < 1"
        },
        "."
      ]
    },
    "auto-parameter-556e1395ea8d9fad84a5": {
      "kind": "parameter",
      "label": "Fixed 0 < ε < 1.",
      "parts": [
        "Fixed ",
        {
          "math": "0 < ε < 1"
        },
        "."
      ]
    },
    "auto-parameter-7d2fe83d945081e897d5": {
      "kind": "parameter",
      "label": "Fixed pattern H (the paper permits some larger patterns).",
      "parts": [
        "Fixed pattern ",
        {
          "math": "H"
        },
        " (the paper permits some larger patterns)."
      ]
    },
    "auto-assumption-439d0499bc59af58e1e1": {
      "kind": "assumption",
      "label": "Unweighted packing; deterministic message passing."
    },
    "auto-output-b552c597406156389871": {
      "kind": "output",
      "label": "Vertex-disjoint H-packing",
      "parts": [
        "Vertex-disjoint ",
        {
          "math": "H"
        },
        "-packing"
      ]
    },
    "auto-parameter-fcadea24a9eeedcc0605": {
      "kind": "parameter",
      "label": "Fixed proper minor-closed family; o(1) tends to zero as n grows."
    },
    "auto-assumption-41383be6b6c11ef0ca69": {
      "kind": "assumption",
      "label": "Unweighted; connected domination assumes connected input."
    },
    "auto-parameter-1a9fdb690f3300f60ed4": {
      "kind": "parameter",
      "label": "o(1) tends to zero as n grows."
    },
    "auto-graph-7140d561f38288daeca5": {
      "kind": "graph",
      "label": "Polynomial neighborhood-independence growth"
    },
    "auto-parameter-3501d10fc18c46a523f3": {
      "kind": "parameter",
      "label": "Fixed growth polynomial and ε > 0; T_MIS is an MIS subroutine’s time.",
      "parts": [
        "Fixed growth polynomial and ",
        {
          "math": "ε > 0"
        },
        "; T_MIS is an MIS subroutine’s time."
      ]
    },
    "auto-assumption-5b844a3fdbd850e05d7e": {
      "kind": "assumption",
      "label": "Includes unit-disk graphs; no coordinates are required."
    },
    "auto-graph-1b4eb5482088967f6989": {
      "kind": "graph",
      "label": "No odd cycles of lengths 3, 5, …, 2k − 1",
      "parts": [
        "No odd cycles of lengths ",
        {
          "math": "3, 5, …, 2k − 1"
        }
      ]
    },
    "auto-parameter-6a77d51b1e51feea6d0f": {
      "kind": "parameter",
      "label": "Fixed integer k; exponent D depends on k.",
      "parts": [
        "Fixed integer k; exponent ",
        {
          "math": "D"
        },
        " depends on k."
      ]
    },
    "auto-graph-17b28995226fcbf3e00f": {
      "kind": "graph",
      "label": "Triangle-free planar"
    },
    "auto-parameter-c8cd75de38af15472e55": {
      "kind": "parameter",
      "label": "Algorithm 1 with m = 0."
    },
    "auto-assumption-766087a5ffd80038c841": {
      "kind": "assumption",
      "label": "No isolated vertices; the presented algorithm uses random tie-breaking."
    },
    "auto-assumption-635ce45f315f03cad1a6": {
      "kind": "assumption",
      "label": "No isolated vertices. Every vertex, including selected vertices, needs a selected neighbor."
    },
    "auto-output-f7056f83774cd9f78096": {
      "kind": "output",
      "label": "Total dominating set"
    },
    "auto-graph-3795dad9c1a1c4cfdd87": {
      "kind": "graph",
      "label": "Planar without 4-cycles",
      "parts": [
        "Planar without ",
        {
          "math": "4"
        },
        "-cycles"
      ]
    },
    "auto-parameter-67492501d8599441d259": {
      "kind": "parameter",
      "label": "Fixed graph-class restriction."
    },
    "auto-assumption-afd7f31621593a143084": {
      "kind": "assumption",
      "label": "Randomized LOCAL algorithm; the no-isolated-vertex setting is used here."
    },
    "auto-parameter-6ad33651604abc6ac7a2": {
      "kind": "parameter",
      "label": "Fixed positive integer k; polynomial exponent depends on k."
    },
    "auto-assumption-f2a82078dc0579e63cb9": {
      "kind": "assumption",
      "label": "No coordinates required; connected domination assumes connected input."
    },
    "auto-graph-655689d0297b69cf89ca": {
      "kind": "graph",
      "label": "Trees"
    },
    "auto-parameter-ef7f1cc3b30039b10a77": {
      "kind": "parameter",
      "label": "Error tends to zero as n increases."
    },
    "auto-assumption-a9fb24f2e10734b0d6e5": {
      "kind": "assumption",
      "label": "Positive vertex weights."
    },
    "auto-parameter-168a796c6c56db460d58": {
      "kind": "parameter",
      "label": "The finer polylogarithmic expression is in Theorem 3.6."
    },
    "auto-assumption-e45d768e2b5e83c79c78": {
      "kind": "assumption",
      "label": "Positive vertex weights; unique identifiers."
    },
    "auto-parameter-8075cb2442a2168b4de2": {
      "kind": "parameter",
      "label": "Fixed positive integer d and proper minor-closed family."
    },
    "auto-parameter-7b82cb05a7875699c083": {
      "kind": "parameter",
      "label": "Fixed unit-disk geometry."
    },
    "auto-output-19e536b10b8d7f071a79": {
      "kind": "output",
      "label": "Fractional dominating set"
    },
    "auto-graph-a3136e606c6eb1327041": {
      "kind": "graph",
      "label": "General"
    },
    "auto-parameter-dfdfaabc71602b4f4891": {
      "kind": "parameter",
      "label": "Constant in n when Δ is fixed.",
      "parts": [
        "Constant in n when ",
        {
          "math": "Δ"
        },
        " is fixed."
      ]
    },
    "auto-output-7f07455ff69b3b347e9b": {
      "kind": "output",
      "label": "Vertex cover"
    },
    "auto-parameter-4f0b91346f5e2f0cce0a": {
      "kind": "parameter",
      "label": "W is the largest positive integer weight; fixed Δ and W give constant rounds.",
      "parts": [
        "W is the largest positive integer weight; fixed ",
        {
          "math": "Δ"
        },
        " and W give constant rounds."
      ]
    },
    "auto-parameter-3f51ea419bee252999ef": {
      "kind": "parameter",
      "label": "0 < ε = O(1); constant in n for fixed Δ, ε. Logs are truncated at constants.",
      "parts": [
        "0 < ",
        {
          "math": "ε"
        },
        " = O(1); constant in n for fixed ",
        {
          "math": "Δ"
        },
        ", ",
        {
          "math": "ε"
        },
        ". Logs are truncated at constants."
      ]
    },
    "auto-assumption-4b3fdcd87cdd0a2f66b9": {
      "kind": "assumption",
      "label": "Weights and their maximum/minimum ratio have O(log n)-bit encodings."
    },
    "auto-parameter-7fd648ba359d62bdb633": {
      "kind": "parameter",
      "label": "Logs are truncated at constants."
    },
    "auto-parameter-353144e79cb249f819e3": {
      "kind": "parameter",
      "label": "Fixed c ≥ 1; logs truncated at constants.",
      "parts": [
        "Fixed c ",
        {
          "math": "≥ 1"
        },
        "; logs truncated at constants."
      ]
    },
    "auto-parameter-d1888d49018736b6c746": {
      "kind": "parameter",
      "label": "Fixed Δ and ε give O(log* n).",
      "parts": [
        "Fixed ",
        {
          "math": "Δ"
        },
        " and ",
        {
          "math": "ε"
        },
        " give O(log* n)."
      ]
    },
    "auto-parameter-d8bbb2a784bfaf07e208": {
      "kind": "parameter",
      "label": "Fixed Δ, ε and positive w_min give O(log* n).",
      "parts": [
        "Fixed ",
        {
          "math": "Δ"
        },
        ", ",
        {
          "math": "ε"
        },
        " and positive w_min give O(log* n)."
      ]
    },
    "auto-parameter-15159932d98a441680fe": {
      "kind": "parameter",
      "label": "Fixed Δ gives O(log* n).",
      "parts": [
        "Fixed ",
        {
          "math": "Δ"
        },
        " gives O(log* n)."
      ]
    },
    "auto-parameter-5936198c8edb2e100c9d": {
      "kind": "parameter",
      "label": "Fixed ε > 0; logs truncated at constants.",
      "parts": [
        "Fixed ",
        {
          "math": "ε > 0"
        },
        "; logs truncated at constants."
      ]
    },
    "auto-assumption-cf6ebb6783a98dbd5cbb": {
      "kind": "assumption",
      "label": "Randomized guarantee; see Section 3 for probability details."
    },
    "auto-assumption-70a7a2d2cd73511df407": {
      "kind": "assumption",
      "label": "Randomized guarantee; probability depends on instance size and parameters."
    },
    "auto-parameter-c8d5c1c10fbc9e230819": {
      "kind": "parameter",
      "label": "W is largest/smallest edge weight; fixed Δ, W, ε give constant rounds.",
      "parts": [
        "W is largest/smallest edge weight; fixed ",
        {
          "math": "Δ"
        },
        ", W, ",
        {
          "math": "ε"
        },
        " give constant rounds."
      ]
    },
    "auto-output-9ba84324ac5813181686": {
      "kind": "output",
      "label": "Fractional matching"
    },
    "auto-graph-7a5af0aff91f9fa9d17f": {
      "kind": "graph",
      "label": "Bipartite"
    },
    "auto-parameter-95d1811bfaf4d14ff9a2": {
      "kind": "parameter",
      "label": "Fixed Δ, W and ε give O(log* n).",
      "parts": [
        "Fixed ",
        {
          "math": "Δ"
        },
        ", W and ",
        {
          "math": "ε"
        },
        " give O(log* n)."
      ]
    },
    "auto-parameter-afe3872ce26bd4e61843": {
      "kind": "parameter",
      "label": "g is odd girth; W is the edge-weight ratio; fixed Δ, W, ε give O(log* n).",
      "parts": [
        "g is odd girth; W is the edge-weight ratio; fixed ",
        {
          "math": "Δ"
        },
        ", W, ",
        {
          "math": "ε"
        },
        " give O(log* n)."
      ]
    },
    "auto-parameter-d3b582587818d15dae40": {
      "kind": "parameter",
      "label": "ε > 0.",
      "parts": [
        {
          "math": "ε > 0"
        },
        "."
      ]
    },
    "auto-parameter-7cb2254842bd27f88e5d": {
      "kind": "parameter",
      "label": "Fixed Δ, W, ε, δ give O(log* n).",
      "parts": [
        "Fixed ",
        {
          "math": "Δ"
        },
        ", W, ",
        {
          "math": "ε"
        },
        ", δ give O(log* n)."
      ]
    },
    "auto-assumption-3b7575788fd0f5679a75": {
      "kind": "assumption",
      "label": "Success probability ≥ 1−δ; W is largest/smallest weight.",
      "parts": [
        "Success probability ",
        {
          "math": "≥ 1"
        },
        "−δ; W is largest/smallest weight."
      ]
    },
    "auto-graph-7c1008dca893d58855a9": {
      "kind": "graph",
      "label": "Bipartite; Δ ≤ 3",
      "parts": [
        "Bipartite; ",
        {
          "math": "Δ ≤ 3"
        }
      ]
    },
    "auto-parameter-1ccb3cbcbeee4e7c5cc6": {
      "kind": "parameter",
      "label": "0 < ε < ε₀ for a positive constant ε₀.",
      "parts": [
        "0 < ",
        {
          "math": "ε"
        },
        " < ",
        {
          "math": "ε"
        },
        "₀ for a positive constant ",
        {
          "math": "ε"
        },
        "₀."
      ]
    },
    "auto-assumption-55d0383c4b86c8bcc344": {
      "kind": "assumption",
      "label": "Applies to randomized algorithms, hence also deterministic ones."
    },
    "auto-parameter-69a29a48be724a8c4831": {
      "kind": "parameter",
      "label": "Fixed Δ and ε.",
      "parts": [
        "Fixed ",
        {
          "math": "Δ"
        },
        " and ",
        {
          "math": "ε"
        },
        "."
      ]
    },
    "auto-graph-009b17c9926b5eac5d12": {
      "kind": "graph",
      "label": "Weakly 2-colored",
      "parts": [
        "Weakly ",
        {
          "math": "2"
        },
        "-colored"
      ]
    },
    "auto-parameter-04655930e34a98fa6fb5": {
      "kind": "parameter",
      "label": "The maximum degree Δ affects the approximation ratio. The supplied weak 2-colouring permits a universal constant number of communication rounds, independently of Δ.",
      "parts": [
        "The maximum degree ",
        {
          "math": "Δ"
        },
        " affects the approximation ratio. The supplied weak 2-colouring permits a universal constant number of communication rounds, independently of ",
        {
          "math": "Δ"
        },
        "."
      ]
    },
    "auto-graph-deab2387db4ebc51b8c0": {
      "kind": "graph",
      "label": "Maximum degree ≤ Δ",
      "parts": [
        "Maximum degree ",
        {
          "math": "≤ Δ"
        }
      ]
    },
    "auto-parameter-f3f7c0d2ab5ad9ffd286": {
      "kind": "parameter",
      "label": "Fixed Δ ≥ 2.",
      "parts": [
        "Fixed ",
        {
          "math": "Δ"
        },
        " ≥ 2."
      ]
    },
    "auto-assumption-eeb9411327e683e6b996": {
      "kind": "assumption",
      "label": "Deterministic LOCAL algorithms, even with unique identifiers."
    },
    "auto-output-c9185b7551a9732c9cf5": {
      "kind": "output",
      "label": "Edge dominating set"
    },
    "auto-graph-4688deea0bc7a8a63f32": {
      "kind": "graph",
      "label": "Euler genus ≤ g",
      "parts": [
        "Euler genus ",
        {
          "math": "≤ g"
        }
      ]
    },
    "auto-parameter-42f1cba507ba2c8efe56": {
      "kind": "parameter",
      "label": "Fixed Euler genus g and ε.",
      "parts": [
        "Fixed Euler genus g and ",
        {
          "math": "ε"
        },
        "."
      ]
    },
    "auto-assumption-47f8c499fa139c946a3b": {
      "kind": "assumption",
      "label": "Uses the planar 11+ε source approximation.",
      "parts": [
        "Uses the planar 11+",
        {
          "math": "ε"
        },
        " source approximation."
      ]
    },
    "auto-graph-a31601ba12c5c7bcb524": {
      "kind": "graph",
      "label": "Bounded arboricity"
    },
    "auto-parameter-6c812971e246ce525770": {
      "kind": "parameter",
      "label": "α is arboricity; logs truncated at constants.",
      "parts": [
        {
          "math": "α"
        },
        " is arboricity; logs truncated at constants."
      ]
    },
    "auto-parameter-a0a8e2790290a7471d70": {
      "kind": "parameter",
      "label": "Fixed ε > 0.",
      "parts": [
        "Fixed ",
        {
          "math": "ε > 0"
        },
        "."
      ]
    },
    "auto-assumption-94e308d1e07eba7fa96c": {
      "kind": "assumption",
      "label": "Neither embedding nor n is required."
    },
    "auto-assumption-6dc0e590599c2c5a678a": {
      "kind": "assumption",
      "label": "Guarantee also holds against fractional OPT."
    },
    "auto-graph-3ffeda864faf117fac90": {
      "kind": "graph",
      "label": "Proper minor-closed classes"
    },
    "auto-parameter-7f6191bd7030ad15d9fa": {
      "kind": "parameter",
      "label": "Fixed class 𝒞 and ε; a(𝒞) = sup |E|/|V|.",
      "parts": [
        "Fixed class 𝒞 and ",
        {
          "math": "ε"
        },
        "; a(𝒞) = sup |E|/|V|."
      ]
    },
    "auto-assumption-933e122436b6c52ef189": {
      "kind": "assumption",
      "label": "Measured against fractional OPT."
    },
    "auto-parameter-9fc82b38708ec49e4023": {
      "kind": "parameter",
      "label": "Fixed class 𝒞 and ε.",
      "parts": [
        "Fixed class 𝒞 and ",
        {
          "math": "ε"
        },
        "."
      ]
    },
    "auto-assumption-d6b18710736c4110b2b5": {
      "kind": "assumption",
      "label": "Always feasible; expected size ≤ (1+ε)OPT.",
      "parts": [
        "Always feasible; expected size ≤ (1+",
        {
          "math": "ε"
        },
        ")OPT."
      ]
    },
    "auto-graph-5576afcd0ec58ee432cc": {
      "kind": "graph",
      "label": "r-th powers of paths",
      "parts": [
        {
          "math": "r"
        },
        "-th powers of paths"
      ]
    },
    "auto-parameter-ea0947e1a900f9702605": {
      "kind": "parameter",
      "label": "Fixed integer r ≥ 1; ε > 0 is a gap below 2r + 1. The excluded round complexity may depend on r and ε, but not on n.",
      "parts": [
        "Fixed integer ",
        {
          "math": "r ≥ 1"
        },
        "; ",
        {
          "math": "ε > 0"
        },
        " is a gap below 2r + 1. The excluded round complexity may depend on r and ",
        {
          "math": "ε"
        },
        ", but not on n."
      ]
    },
    "auto-assumption-edb8aa2a8c4052a49812": {
      "kind": "assumption",
      "label": "Deterministic; n may be known."
    },
    "auto-parameter-0e4fbe5bde0b980e2436": {
      "kind": "parameter",
      "label": "Fixed Euler genus g and ε > 0.",
      "parts": [
        "Fixed Euler genus g and ",
        {
          "math": "ε > 0"
        },
        "."
      ]
    },
    "auto-graph-88416e0fa2d902c6bf6e": {
      "kind": "graph",
      "label": "Planar with a clique attached at one vertex"
    },
    "auto-parameter-fd0c7f39daee55d44146": {
      "kind": "parameter",
      "label": "Fixed ε > 0; clique size unbounded.",
      "parts": [
        "Fixed ",
        {
          "math": "ε > 0"
        },
        "; clique size unbounded."
      ]
    },
    "auto-assumption-898f68dddc2253ec17f8": {
      "kind": "assumption",
      "label": "Distinct IDs; n need not be known."
    },
    "auto-graph-c176f5851daf0691e2c9": {
      "kind": "graph",
      "label": "Bounded maximum average degree and depth-one density"
    },
    "auto-parameter-e60de88c7059235a0d25": {
      "kind": "parameter",
      "label": "Fixed mad bound d, shallow-minor density ∇₁, ε.",
      "parts": [
        "Fixed mad bound d, shallow-minor density ",
        {
          "math": "∇₁"
        },
        ", ",
        {
          "math": "ε"
        },
        "."
      ]
    },
    "auto-graph-4cb0180200cc86776426": {
      "kind": "graph",
      "label": "Triangle-free; Euler genus ≤ g",
      "parts": [
        "Triangle-free; Euler genus ",
        {
          "math": "≤ g"
        }
      ]
    },
    "auto-graph-a0de36fa1bbd12a5b487": {
      "kind": "graph",
      "label": "Every minor H satisfies |E(H)| ≤ a|V(H)|",
      "parts": [
        "Every minor ",
        {
          "math": "H"
        },
        " satisfies ",
        {
          "math": "|E(H)| ≤ a|V(H)|"
        }
      ]
    },
    "auto-graph-3cb5a957ccd8c0f583ad": {
      "kind": "graph",
      "label": "Isolate-free; every minor H has |E(H)| ≤ a|V(H)|",
      "parts": [
        "Isolate-free; every minor ",
        {
          "math": "H"
        },
        " has ",
        {
          "math": "|E(H)| ≤ a|V(H)|"
        }
      ]
    },
    "auto-graph-b08d89aa3044ab497598": {
      "kind": "graph",
      "label": "Planar incidence graphs"
    },
    "auto-output-5e3e21d1210a645eea70": {
      "kind": "output",
      "label": "Set cover"
    },
    "auto-graph-ba929dd9ea7a6101c7cf": {
      "kind": "graph",
      "label": "Every minor H satisfies |E(H)| ≤ ρ|V(H)|",
      "parts": [
        "Every minor ",
        {
          "math": "H"
        },
        " satisfies ",
        {
          "math": "|E(H)| ≤ ρ|V(H)|"
        }
      ]
    },
    "auto-output-d4a9a4dfb4c06850597b": {
      "kind": "output",
      "label": "Fractional local covering"
    },
    "auto-output-d13f16e4e51c9b55f160": {
      "kind": "output",
      "label": "Integral local covering"
    },
    "auto-graph-581d3bad24d9045aad04": {
      "kind": "graph",
      "label": "Cycles"
    },
    "auto-parameter-3322b3cbbe2c94dcb771": {
      "kind": "parameter",
      "label": "Fixed 0 < ε < 1/4.",
      "parts": [
        "Fixed ",
        {
          "math": "0 < ε < 1/4"
        },
        "."
      ]
    },
    "auto-assumption-30d97f811f8d9d819bc6": {
      "kind": "assumption",
      "label": "Deterministic; even with known n and IDs {1,…,n}."
    },
    "auto-parameter-7c6f24677bc7fbc2830c": {
      "kind": "parameter",
      "label": "log(n)/n < ε < 1; fixed ε gives log-star rounds.",
      "parts": [
        {
          "math": "log(n)/n < ε < 1"
        },
        "; fixed ",
        {
          "math": "ε"
        },
        " gives log-star rounds."
      ]
    },
    "auto-graph-597aa492393966caa704": {
      "kind": "graph",
      "label": "Oriented paths"
    },
    "auto-assumption-dd30a8ba85510a5ac83a": {
      "kind": "assumption",
      "label": "Deterministic algorithms."
    },
    "auto-graph-407b59be506be46dbb08": {
      "kind": "graph",
      "label": "Arboricity β ≥ 1",
      "parts": [
        "Arboricity ",
        {
          "math": "β ≥ 1"
        }
      ]
    },
    "auto-parameter-e8b3261a0e0b3f8858bd": {
      "kind": "parameter",
      "label": "0 < ε < 1; fixed β, ε gives log-star rounds.",
      "parts": [
        {
          "math": "0 < ε < 1"
        },
        "; fixed ",
        {
          "math": "β"
        },
        ", ",
        {
          "math": "ε"
        },
        " gives log-star rounds."
      ]
    },
    "auto-graph-f0a5babb59d5c701134a": {
      "kind": "graph",
      "label": "Arboricity β > 1",
      "parts": [
        "Arboricity ",
        {
          "math": "β > 1"
        }
      ]
    },
    "auto-parameter-fca824c9f4aac6656e76": {
      "kind": "parameter",
      "label": "0 < ε < 1; fixed β, ε gives logarithmic rounds.",
      "parts": [
        {
          "math": "0 < ε < 1"
        },
        "; fixed ",
        {
          "math": "β"
        },
        ", ",
        {
          "math": "ε"
        },
        " gives logarithmic rounds."
      ]
    },
    "auto-parameter-c293f2aadfa39d01b72f": {
      "kind": "parameter",
      "label": "Γₚ = max column sum, Γd = max row sum of normalized A; ε > 0.",
      "parts": [
        "Γₚ = max column sum, Γd = max row sum of normalized A; ",
        {
          "math": "ε > 0"
        },
        "."
      ]
    },
    "auto-output-53746915587a9d48e761": {
      "kind": "output",
      "label": "Fractional covering LP"
    },
    "auto-output-5bdcfa2d039df6333abe": {
      "kind": "output",
      "label": "Fractional packing LP"
    },
    "auto-parameter-fc75e240ad481ee0e55f": {
      "kind": "parameter",
      "label": "0 < ε < 1 may depend on n; constant δ > 0.",
      "parts": [
        {
          "math": "0 < ε < 1"
        },
        " may depend on n; constant δ > 0."
      ]
    },
    "auto-assumption-99d1e131b93d403aad65": {
      "kind": "assumption",
      "label": "Success probability ≥ 1 − ε⁻¹ exp(−Ω(log¹⁻δ n)).",
      "parts": [
        "Success probability ",
        {
          "math": "≥ 1"
        },
        " − ",
        {
          "math": "ε"
        },
        "⁻¹ exp(−Ω(log¹⁻δ n))."
      ]
    },
    "auto-parameter-3476296f566e07833c97": {
      "kind": "parameter",
      "label": "0 < ε < 1 may depend on n.",
      "parts": [
        {
          "math": "0 < ε < 1"
        },
        " may depend on n."
      ]
    },
    "auto-assumption-80568cb855e5b8754fce": {
      "kind": "assumption",
      "label": "With high probability in n."
    },
    "auto-parameter-516147a00c3aa0a82783": {
      "kind": "parameter",
      "label": "0 < ε < 1; MM(N) is the round complexity of maximal matching on N vertices.",
      "parts": [
        {
          "math": "0 < ε < 1"
        },
        "; MM(N) is the round complexity of maximal matching on N vertices."
      ]
    },
    "auto-assumption-4dffc0da8b409a724621": {
      "kind": "assumption",
      "label": "Deterministic when using a deterministic maximal-matching subroutine. The bound retains this subroutine cost."
    },
    "auto-parameter-8d2a24f83dd35a601656": {
      "kind": "parameter",
      "label": "ε⁻¹ = O(poly(n)).",
      "parts": [
        {
          "math": "ε"
        },
        "⁻¹ = O(poly(n))."
      ]
    },
    "auto-assumption-e178aeb72ef1814dfe69": {
      "kind": "assumption",
      "label": "Outputs an estimate of ρ*(v) at each vertex; not directly a selected densest subgraph.",
      "parts": [
        "Outputs an estimate of ",
        {
          "math": "ρ"
        },
        "*(v) at each vertex; not directly a selected densest subgraph."
      ]
    },
    "auto-output-0ded4f9dae88d217ac16": {
      "kind": "output",
      "label": "Local density"
    },
    "auto-assumption-cd9841afbab6ff0511ce": {
      "kind": "assumption",
      "label": "Sleeping CONGEST: a sleeping node cannot compute, send, or receive. Awake bound is per node."
    },
    "auto-graph-29f2223ddd7a0e79d30b": {
      "kind": "graph",
      "label": "Incidence graphs; set size ≤ k, frequency ≤ f",
      "parts": [
        "Incidence graphs; set size ",
        {
          "math": "≤ k"
        },
        ", frequency ",
        {
          "math": "≤ f"
        }
      ]
    },
    "auto-parameter-6791260aa74876dd1065": {
      "kind": "parameter",
      "label": "Positive integer weights ≤ W; bounded f,k,W gives constant rounds.",
      "parts": [
        "Positive integer weights ",
        {
          "math": "≤ W"
        },
        "; bounded f,k,W gives constant rounds."
      ]
    },
    "auto-graph-cdc1893875a9dac727a7": {
      "kind": "graph",
      "label": "Euler genus ≤ g; at most a apices",
      "parts": [
        "Euler genus ",
        {
          "math": "≤ g"
        },
        "; at most ",
        {
          "math": "a"
        },
        " apices"
      ]
    },
    "auto-parameter-a584b0bba6a6122fb630": {
      "kind": "parameter",
      "label": "Fixed g and a; fixed ε > 0.",
      "parts": [
        "Fixed g and a; fixed ",
        {
          "math": "ε > 0"
        },
        "."
      ]
    },
    "auto-graph-cc88dac74423991e2fb4": {
      "kind": "graph",
      "label": "Asymptotic dimension d; radius-r balls of Euler genus ≤ g",
      "parts": [
        "Asymptotic dimension ",
        {
          "math": "d"
        },
        "; radius-",
        {
          "math": "r"
        },
        " balls of Euler genus ",
        {
          "math": "≤ g"
        }
      ]
    },
    "auto-parameter-537a07678fea6f22098a": {
      "kind": "parameter",
      "label": "Fixed d,g and sufficiently large fixed radius r.",
      "parts": [
        "Fixed d,g and sufficiently large fixed radius ",
        {
          "math": "r"
        },
        "."
      ]
    },
    "auto-assumption-d82fde380382d55bfbd5": {
      "kind": "assumption",
      "label": "The local-class condition is as defined in the paper; the apex extension also holds."
    },
    "auto-parameter-b62bd2c4786d0cd69208": {
      "kind": "parameter",
      "label": "Fixed g and k ≥ 2.",
      "parts": [
        "Fixed g and ",
        {
          "math": "k ≥ 2"
        },
        "."
      ]
    },
    "auto-assumption-eeaced0e93ae80d9fd33": {
      "kind": "assumption",
      "label": "Each vertex outside the solution needs k neighbors inside it; no such condition on selected vertices."
    },
    "auto-parameter-2f1626f8ddeafbffccc4": {
      "kind": "parameter",
      "label": "Fixed g."
    },
    "auto-parameter-e2603d7d21b2cf13e04b": {
      "kind": "parameter",
      "label": "0 < ε < 1. Logs are truncated at constants; the source treats Δ ≤ 16 separately.",
      "parts": [
        {
          "math": "0 < ε < 1"
        },
        ". Logs are truncated at constants; the source treats ",
        {
          "math": "Δ"
        },
        " ≤ 16 separately."
      ]
    },
    "auto-parameter-d2ade5a65ae03b5599fb": {
      "kind": "parameter",
      "label": "0 < ε < 1; the analysis fixes γ=0.001. All logarithms are truncated at constants.",
      "parts": [
        {
          "math": "0 < ε < 1"
        },
        "; the analysis fixes γ=0.001. All logarithms are truncated at constants."
      ]
    },
    "auto-parameter-df5e493698da1468cb3b": {
      "kind": "parameter",
      "label": "n is the number of vertices; Δ is the maximum degree. The exponents in polylogarithmic factors are fixed.",
      "parts": [
        "n is the number of vertices; ",
        {
          "math": "Δ"
        },
        " is the maximum degree. The exponents in polylogarithmic factors are fixed."
      ]
    },
    "auto-assumption-8ab2eb4fd98dcdd8e53c": {
      "kind": "assumption",
      "label": "Also applies to deterministic algorithms. Randomized lower bound concerns expected approximation with a fixed worst-case round budget. There are hard graph families; n and Δ are coupled by the construction, so this is not a guarantee for every independently prescribed pair (n, Δ).",
      "parts": [
        "Also applies to deterministic algorithms. Randomized lower bound concerns expected approximation with a fixed worst-case round budget. There are hard graph families; n and ",
        {
          "math": "Δ"
        },
        " are coupled by the construction, so this is not a guarantee for every independently prescribed pair (n, ",
        {
          "math": "Δ"
        },
        ")."
      ]
    },
    "auto-graph-bb37704c123e99aa335b": {
      "kind": "graph",
      "label": "K₂,t-minor-free",
      "parts": [
        {
          "math": "K₂,t"
        },
        "-minor-free"
      ]
    },
    "auto-assumption-546f9427a7eb5183892d": {
      "kind": "assumption",
      "label": "Distinct identifiers."
    },
    "auto-parameter-84a9fcdebc259dfe7099": {
      "kind": "parameter",
      "label": "Fixed integer t ≥ 2.",
      "parts": [
        "Fixed integer ",
        {
          "math": "t ≥ 2"
        },
        "."
      ]
    },
    "auto-parameter-a76c57eac2fe51c6e0c3": {
      "kind": "parameter",
      "label": "Integer t ≥ 2; rounds independent of t.",
      "parts": [
        "Integer ",
        {
          "math": "t ≥ 2"
        },
        "; rounds independent of t."
      ]
    },
    "auto-parameter-9e294b6fa3a897ed9cf2": {
      "kind": "parameter",
      "label": "Fixed d,g,r and dimensional control function; r sufficiently large."
    },
    "auto-assumption-366645571a60ecd2fcf3": {
      "kind": "assumption",
      "label": "Every radius-r induced ball lies in the Euler-genus-g class.",
      "parts": [
        "Every radius-",
        {
          "math": "r"
        },
        " induced ball lies in the Euler-genus-",
        {
          "math": "g"
        },
        " class."
      ]
    },
    "auto-parameter-b6e4f4217a140a655edf": {
      "kind": "parameter",
      "label": "Fixed k ≥ 2 and g.",
      "parts": [
        "Fixed ",
        {
          "math": "k ≥ 2"
        },
        " and g."
      ]
    },
    "auto-graph-1c8015ba8785f64fced9": {
      "kind": "graph",
      "label": "Linklessly embeddable"
    },
    "auto-graph-f0d82e6adc6c5f65d541": {
      "kind": "graph",
      "label": "No K₄,₄ subdivision",
      "parts": [
        "No ",
        {
          "math": "K₄,₄"
        },
        " subdivision"
      ]
    },
    "auto-parameter-741134fe129c5a0fa776": {
      "kind": "parameter",
      "label": "Fixed k ≥ 2, g and ε > 0.",
      "parts": [
        "Fixed ",
        {
          "math": "k ≥ 2"
        },
        ", g and ",
        {
          "math": "ε > 0"
        },
        "."
      ]
    },
    "auto-parameter-a5230659d3c4bcfedc87": {
      "kind": "parameter",
      "label": "Fixed k ≥ 2 and ε > 0.",
      "parts": [
        "Fixed ",
        {
          "math": "k ≥ 2"
        },
        " and ",
        {
          "math": "ε > 0"
        },
        "."
      ]
    },
    "auto-assumption-6b02bb84a23eb80caedf": {
      "kind": "assumption",
      "label": "CONGEST_BC: each vertex broadcasts the same O(log n)-bit message to neighbors."
    },
    "auto-graph-2c2b44d50352f53722f0": {
      "kind": "graph",
      "label": "Expansion f; girth ≥ 4r + 3",
      "parts": [
        "Expansion ",
        {
          "math": "f"
        },
        "; girth ",
        {
          "math": "≥ 4r + 3"
        }
      ]
    },
    "auto-parameter-0bb6a4815f4c4715a933": {
      "kind": "parameter",
      "label": "Fixed radius r and expansion function f.",
      "parts": [
        "Fixed radius ",
        {
          "math": "r"
        },
        " and expansion function f."
      ]
    },
    "auto-graph-5bf5bfc6dd710f349d27": {
      "kind": "graph",
      "label": "Cycles of length at least 4r + 3",
      "parts": [
        "Cycles of length at least ",
        {
          "math": "4r + 3"
        }
      ]
    },
    "auto-parameter-8f111cac3e93af500567": {
      "kind": "parameter",
      "label": "Fixed ε > 0; r > 1 and r = o(log* n).",
      "parts": [
        "Fixed ",
        {
          "math": "ε > 0"
        },
        "; ",
        {
          "math": "r > 1"
        },
        " and r = o(log* n)."
      ]
    },
    "auto-assumption-021b0a56919f5f4e6bfb": {
      "kind": "assumption",
      "label": "For fixed r this excludes constant-round algorithms.",
      "parts": [
        "For fixed ",
        {
          "math": "r"
        },
        " this excludes constant-round algorithms."
      ]
    },
    "auto-graph-915afc773f0aa3fac5c2": {
      "kind": "graph",
      "label": "Bounded expansion; girth ≥ 4r + 2",
      "parts": [
        "Bounded expansion; girth ",
        {
          "math": "≥ 4r + 2"
        }
      ]
    },
    "auto-parameter-af57e23573dcc3ca99da": {
      "kind": "parameter",
      "label": "Fixed r and graph class."
    },
    "auto-assumption-1438241cdaf269b6f219": {
      "kind": "assumption",
      "label": "Abstract-level record; see paper for problem definitions."
    },
    "auto-model-37b353da5fa68eebd709": {
      "kind": "model",
      "label": "Unspecified"
    },
    "auto-output-be4082e563d6ac3c12d9": {
      "kind": "output",
      "label": "Distance-r vertex cover"
    },
    "auto-output-d3386db78d70530c7ff1": {
      "kind": "output",
      "label": "Distance-r connected vertex cover"
    },
    "auto-parameter-dc252bf1c14e8e232a95": {
      "kind": "parameter",
      "label": "Fixed radius k and integer t."
    },
    "auto-output-22413995976b0346df27": {
      "kind": "output",
      "label": "Distance-k dominating set"
    },
    "auto-parameter-d4d4c3f4968560101dad": {
      "kind": "parameter",
      "label": "Fixed k,t and 0 < ε < 1.",
      "parts": [
        "Fixed k,t and ",
        {
          "math": "0 < ε < 1"
        },
        "."
      ]
    },
    "auto-graph-bcec1760a63c4cbb99b7": {
      "kind": "graph",
      "label": "Kₜ-minor-free; γ₁(G) ≤ Cγₖ(G)",
      "parts": [
        {
          "math": "Kₜ"
        },
        "-minor-free; ",
        {
          "math": "γ₁(G) ≤ Cγₖ(G)"
        }
      ]
    },
    "auto-parameter-e4817656513cd78376c7": {
      "kind": "parameter",
      "label": "Fixed C,k,t,ε; 0 < ε < 1.",
      "parts": [
        "Fixed ",
        {
          "math": "C"
        },
        ",k,t,",
        {
          "math": "ε"
        },
        "; ",
        {
          "math": "0 < ε < 1"
        },
        "."
      ]
    },
    "auto-assumption-96d7175a2aee97a5e9b2": {
      "kind": "assumption",
      "label": "C,k,t known; includes bounded-degree minor-free classes.",
      "parts": [
        {
          "math": "C"
        },
        ",k,t known; includes bounded-degree minor-free classes."
      ]
    },
    "auto-graph-9171fdfac7e54f0c66d4": {
      "kind": "graph",
      "label": "Connected; k-hop expansion ≤ f(k); girth ≥ 4k + 3",
      "parts": [
        "Connected; ",
        {
          "math": "k"
        },
        "-hop expansion ",
        {
          "math": "≤ f(k)"
        },
        "; girth ",
        {
          "math": "≥ 4k + 3"
        }
      ]
    },
    "auto-parameter-f0979e1ca73e2b9842db": {
      "kind": "parameter",
      "label": "Fixed radius k."
    },
    "auto-parameter-849af929a5eaf7f9ea3b": {
      "kind": "parameter",
      "label": "Fixed k and expansion bound; asymptotic dependence on both parameters."
    },
    "auto-graph-6b18cb9d7cafda1f1507": {
      "kind": "graph",
      "label": "Trees; maximum degree ≤ Δ",
      "parts": [
        "Trees; maximum degree ",
        {
          "math": "≤ Δ"
        }
      ]
    },
    "auto-parameter-5163900e51cf7e19adb3": {
      "kind": "parameter",
      "label": "Radius k; arbitrary Δ.",
      "parts": [
        "Radius k; arbitrary ",
        {
          "math": "Δ"
        },
        "."
      ]
    },
    "auto-graph-9fd58cfedeb677601608": {
      "kind": "graph",
      "label": "Sub-logarithmic expansion g(r) = o(log r)",
      "parts": [
        "Sub-logarithmic expansion ",
        {
          "math": "g(r) = o(log r)"
        }
      ]
    },
    "auto-parameter-51662271224435b06188": {
      "kind": "parameter",
      "label": "Fixed ε > 0 and expansion function g.",
      "parts": [
        "Fixed ",
        {
          "math": "ε > 0"
        },
        " and expansion function g."
      ]
    },
    "auto-output-406e7225cb456f7c7595": {
      "kind": "output",
      "label": "Maximum f-matching"
    },
    "auto-parameter-70c7558f1bd42ca5b75a": {
      "kind": "parameter",
      "label": "Fixed ε > 0, L, and expansion function g.",
      "parts": [
        "Fixed ",
        {
          "math": "ε > 0"
        },
        ", L, and expansion function g."
      ]
    },
    "auto-output-eb30c7aa45dd0f7be45c": {
      "kind": "output",
      "label": "Maximum b-matching"
    },
    "auto-graph-8522d0de3c4afaf02c91": {
      "kind": "graph",
      "label": "Sub-logarithmic expansion f(r) = o(log r)",
      "parts": [
        "Sub-logarithmic expansion ",
        {
          "math": "f(r) = o(log r)"
        }
      ]
    },
    "auto-parameter-848e8210bb141aa4c5cf": {
      "kind": "parameter",
      "label": "Fixed expansion class, ε > 0, c.",
      "parts": [
        "Fixed expansion class, ",
        {
          "math": "ε > 0"
        },
        ", c."
      ]
    },
    "auto-parameter-a71ee1ff530d799c86f8": {
      "kind": "parameter",
      "label": "Fixed expansion class and ε > 0.",
      "parts": [
        "Fixed expansion class and ",
        {
          "math": "ε > 0"
        },
        "."
      ]
    },
    "auto-graph-147b06bde51054bdc0f1": {
      "kind": "graph",
      "label": "H-minor-free graphs",
      "parts": [
        {
          "math": "H"
        },
        "-minor-free graphs"
      ]
    },
    "auto-parameter-156dd6ff20d8a86a9aff": {
      "kind": "parameter",
      "label": "Fixed excluded minor H and ε > 0; pw(H) is its pathwidth.",
      "parts": [
        "Fixed excluded minor ",
        {
          "math": "H"
        },
        " and ",
        {
          "math": "ε > 0"
        },
        "; ",
        {
          "math": "pw(H)"
        },
        " is its pathwidth."
      ]
    },
    "auto-assumption-94ab493b6b5f81e0d93a": {
      "kind": "assumption",
      "label": "The number of rounds may depend arbitrarily on H, independently of n.",
      "parts": [
        "The number of rounds may depend arbitrarily on ",
        {
          "math": "H"
        },
        ", independently of n."
      ]
    },
    "auto-graph-580cce8ae5a0654250af": {
      "kind": "graph",
      "label": "t-th powers of paths with endpoint leaves",
      "parts": [
        {
          "math": "t"
        },
        "-th powers of paths with endpoint leaves"
      ]
    },
    "auto-parameter-d8937560fe62ed79d064": {
      "kind": "parameter",
      "label": "Fixed integer t ≥ 1; arbitrary round complexity f(t).",
      "parts": [
        "Fixed integer ",
        {
          "math": "t ≥ 1"
        },
        "; arbitrary round complexity f(t)."
      ]
    },
    "auto-assumption-82725811fe448ccca35c": {
      "kind": "assumption",
      "label": "Witnesses allow extra degree-one vertices attached at one endpoint. Distinct identifiers in {1,…,|V(G)|}.",
      "parts": [
        "Witnesses allow extra degree-one vertices attached at one endpoint. Distinct identifiers in {1,…,|V(",
        {
          "math": "G"
        },
        ")|}."
      ]
    },
    "auto-assumption-dfd0a20f62b413880876": {
      "kind": "assumption",
      "label": "Distinct identifiers; the algorithm uses local computation without a time bound."
    },
    "auto-parameter-c0e181a48eccedc1a097": {
      "kind": "parameter",
      "label": "Fixed Euler genus bound g; the approximation ratio is independent of g.",
      "parts": [
        "Fixed Euler genus bound ",
        {
          "math": "g"
        },
        "; the approximation ratio is independent of g."
      ]
    },
    "auto-assumption-dc067c5203f5429194e2": {
      "kind": "assumption",
      "label": "Distinct identifiers; the class-dependent control function and genus bound determine the number of rounds."
    },
    "auto-graph-923a099c9b7572b1569c": {
      "kind": "graph",
      "label": "Asymptotic dimension d; radius-r balls of Euler genus ≤ g with at most a apices",
      "parts": [
        "Asymptotic dimension ",
        {
          "math": "d"
        },
        "; radius-",
        {
          "math": "r"
        },
        " balls of Euler genus ",
        {
          "math": "≤ g"
        },
        " with at most ",
        {
          "math": "a"
        },
        " apices"
      ]
    },
    "auto-parameter-fafe049cf255bb2992b3": {
      "kind": "parameter",
      "label": "Fixed d, g, a and sufficiently large fixed radius r, together with a fixed dimensional control function.",
      "parts": [
        "Fixed d, ",
        {
          "math": "g"
        },
        ", ",
        {
          "math": "a"
        },
        " and sufficiently large fixed radius ",
        {
          "math": "r"
        },
        ", together with a fixed dimensional control function."
      ]
    },
    "auto-assumption-e9f4409ff458ab752c46": {
      "kind": "assumption",
      "label": "For every vertex, its induced radius-r ball becomes a graph of Euler genus at most g after deleting at most a vertices. The bound is for a class of asymptotic dimension at most d; its control function is fixed.",
      "parts": [
        "For every vertex, its induced radius-",
        {
          "math": "r"
        },
        " ball becomes a graph of Euler genus at most ",
        {
          "math": "g"
        },
        " after deleting at most ",
        {
          "math": "a"
        },
        " vertices. The bound is for a class of asymptotic dimension at most ",
        {
          "math": "d"
        },
        "; its control function is fixed."
      ]
    },
    "auto-graph-23bbca89e52d93fabbc0": {
      "kind": "graph",
      "label": "H-minor-free; pw(H) ≤ 2",
      "parts": [
        {
          "math": "H"
        },
        "-minor-free; ",
        {
          "math": "pw(H) ≤ 2"
        }
      ]
    },
    "auto-parameter-47b7ba76ac595cfa11be": {
      "kind": "parameter",
      "label": "Fixed excluded graph H with pw(H) ≤ 2. The approximation ratio is independent of H.",
      "parts": [
        "Fixed excluded graph ",
        {
          "math": "H"
        },
        " with ",
        {
          "math": "pw(H) ≤ 2"
        },
        ". The approximation ratio is independent of ",
        {
          "math": "H"
        },
        "."
      ]
    },
    "auto-assumption-d180b40ee9f79668f8bb": {
      "kind": "assumption",
      "label": "Distinct identifiers. The excluded graph H is fixed, and the proof chooses H-dependent structural diameter thresholds.",
      "parts": [
        "Distinct identifiers. The excluded graph ",
        {
          "math": "H"
        },
        " is fixed, and the proof chooses ",
        {
          "math": "H"
        },
        "-dependent structural diameter thresholds."
      ]
    },
    "auto-graph-7d0e376814cb5e208e0f": {
      "kind": "graph",
      "label": "Degeneracy ≤ d",
      "parts": [
        "Degeneracy ",
        {
          "math": "≤ d"
        }
      ]
    },
    "auto-parameter-beaf612e4f0193d5db76": {
      "kind": "parameter",
      "label": "Fixed integer distance k ≥ 1.",
      "parts": [
        "Fixed integer distance ",
        {
          "math": "k ≥ 1"
        },
        "."
      ]
    },
    "auto-assumption-4d3da7dbdc858af64700": {
      "kind": "assumption",
      "label": "Distinct identifiers; Algorithm 8 uses only their order. Unrestricted LOCAL messages and local computation. No girth restriction."
    },
    "auto-parameter-b0a4f6cca13712e0d8ac": {
      "kind": "parameter",
      "label": "Fixed integer distance k ≥ 1 and Euler genus bound g. The approximation ratio is independent of g.",
      "parts": [
        "Fixed integer distance ",
        {
          "math": "k ≥ 1"
        },
        " and Euler genus bound ",
        {
          "math": "g"
        },
        ". The approximation ratio is independent of g."
      ]
    },
    "auto-assumption-c29b65f0df3a5db56172": {
      "kind": "assumption",
      "label": "Distinct identifiers; no knowledge of n is required. Apply Meta-Theorem I with asymptotic dimension two and the fixed Euler-genus control function. No girth restriction."
    },
    "auto-graph-c40b643df6f08b5ef5f6": {
      "kind": "graph",
      "label": "Pₜ-minor-free",
      "parts": [
        {
          "math": "Pₜ"
        },
        "-minor-free"
      ]
    },
    "auto-parameter-19cffd064800d231c334": {
      "kind": "parameter",
      "label": "Pₜ is the t-vertex path; fixed integer t ≥ 2.",
      "parts": [
        {
          "math": "Pₜ"
        },
        " is the t-vertex path; fixed integer ",
        {
          "math": "t ≥ 2"
        },
        "."
      ]
    },
    "auto-assumption-c037429316643f33df51": {
      "kind": "assumption",
      "label": "Distinct identifiers and unrestricted LOCAL messages. Disconnected graphs are handled component by component."
    },
    "auto-graph-a92a23ddd7d97c52a4a2": {
      "kind": "graph",
      "label": "Pseudoforests"
    },
    "auto-parameter-db0be7437e2fe9433220": {
      "kind": "parameter",
      "label": "At most one cycle per component; no degree bound."
    },
    "auto-parameter-22a8f3875f4ed671e161": {
      "kind": "parameter",
      "label": "Δ is the maximum degree; the algorithm need not know it.",
      "parts": [
        {
          "math": "Δ"
        },
        " is the maximum degree; the algorithm need not know it."
      ]
    },
    "auto-assumption-7218db1f3f785e20d190": {
      "kind": "assumption",
      "label": "Unweighted graphs. No identifiers, degree knowledge, or communication are needed."
    },
    "auto-graph-f5f624e676f5e722507d": {
      "kind": "graph",
      "label": "K₁,ₜ-minor-free",
      "parts": [
        {
          "math": "K₁,ₜ"
        },
        "-minor-free"
      ]
    },
    "auto-parameter-67f354a1ddafcbd4a3f4": {
      "kind": "parameter",
      "label": "Integer t ≥ 2; the algorithm need not know t.",
      "parts": [
        "Integer ",
        {
          "math": "t ≥ 2"
        },
        "; the algorithm need not know t."
      ]
    },
    "auto-assumption-5a941652786b9818dce6": {
      "kind": "assumption",
      "label": "Unweighted. No identifiers, degree knowledge, or communication are needed."
    },
    "auto-parameter-0b7cb0040f1e25baeba5": {
      "kind": "parameter",
      "label": "Unit-disk graphs in the plane."
    },
    "auto-assumption-8465d976c4ce42e13ba6": {
      "kind": "assumption",
      "label": "Unweighted. No geometric representation or identifiers are needed. One empty-message round detects isolates; zero rounds suffice if local degree is initially known."
    },
    "auto-parameter-4b8d3e3588a5713a9505": {
      "kind": "parameter",
      "label": "Source result (sparse-expansion-constant), evaluated on its transformed instance: Fixed integer upper bound ∇₁ > 0 on the edge density of depth-1 minors. Both the approximation ratio and round complexity depend on ∇₁.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-d1beb330b75a6fc6b73f": {
      "kind": "assumption",
      "label": "Source result (sparse-expansion-constant), evaluated on its transformed instance: Unique identifiers; an upper bound on ∇₁ is supplied; no embedding is supplied.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-detail-f3b5d7665a7f0847c453": {
      "kind": "detail",
      "label": "Source variant: Unweighted"
    },
    "auto-parameter-a746b2e1e9cbb39defe4": {
      "kind": "parameter",
      "label": "Source result (sparse-planar-eleven), evaluated on its transformed instance: Fixed ε > 0; the round complexity depends on ε.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (sparse-planar-eleven), evaluated on its transformed instance: Fixed ",
        {
          "math": "ε > 0"
        },
        "; the round complexity depends on ",
        {
          "math": "ε"
        },
        ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-8ab529c47831716b6bad": {
      "kind": "assumption",
      "label": "Source result (sparse-planar-eleven), evaluated on its transformed instance: Unique identifiers; no embedding is supplied.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-bdd72288e007121f64ba": {
      "kind": "parameter",
      "label": "Source result (dory-arboricity-lower), evaluated on its transformed instance: Δ is the maximum degree.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (dory-arboricity-lower), evaluated on its transformed instance: ",
        {
          "math": "Δ"
        },
        " is the maximum degree.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-5b4f90dfd88d9c1219fb": {
      "kind": "assumption",
      "label": "Source result (dory-arboricity-lower), evaluated on its transformed instance: Unweighted graphs; the lower bound applies to deterministic and randomized LOCAL algorithms.\n\nClosed-neighborhood requests: Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags. Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination."
    },
    "auto-parameter-04d7672090e528040a29": {
      "kind": "parameter",
      "label": "Source result (heydt-planar-twenty), evaluated on its transformed instance: No fixed degree bound is required.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-67acb8640b93dad1f4e1": {
      "kind": "assumption",
      "label": "Source result (heydt-planar-twenty), evaluated on its transformed instance: Unique identifiers; no embedding is supplied.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-b868ca1b58048808ce4c": {
      "kind": "parameter",
      "label": "Source result (morgan-arboricity), evaluated on its transformed instance: α is the arboricity bound.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (morgan-arboricity), evaluated on its transformed instance: ",
        {
          "math": "α"
        },
        " is the arboricity bound.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-125ef2eb5cc82c9a0b8e": {
      "kind": "assumption",
      "label": "Source result (morgan-arboricity), evaluated on its transformed instance: Unweighted; the stated round complexity is achieved with high probability.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.\n\nThe source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only."
    },
    "auto-parameter-31f43ac1ede1d376b459": {
      "kind": "parameter",
      "label": "Source result (outerplanar-five), evaluated on its transformed instance: No fixed degree bound is required.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-4a96ab7b728ad0de925f": {
      "kind": "assumption",
      "label": "Source result (outerplanar-five), evaluated on its transformed instance: Only degrees and neighbors’ degree categories are needed; unique IDs are unnecessary.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.\n\nThe source Anonymous algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only."
    },
    "auto-parameter-7ba8fd91ab2741952600": {
      "kind": "parameter",
      "label": "Source result (outerplanar-five-lower), evaluated on its transformed instance: Any fixed ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (outerplanar-five-lower), evaluated on its transformed instance: Any fixed ",
        {
          "math": "ε > 0"
        },
        ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-8f4170ff9b582f6956d9": {
      "kind": "assumption",
      "label": "Source result (outerplanar-five-lower), evaluated on its transformed instance: Deterministic LOCAL algorithms, including algorithms with unique IDs.\n\nClosed-neighborhood requests: Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags. Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination."
    },
    "auto-parameter-208c1f9cd2482ecf1568": {
      "kind": "parameter",
      "label": "Source result (kublenz-expansion), evaluated on its transformed instance: Known upper bound ∇₁ on the edge density of depth-1 minors; t is the least integer such that Kₜ,ₜ is absent as a subgraph, with t ≤ 2∇₁ + 1. The approximation ratio depends on these parameters; the number of LOCAL communication rounds is universally bounded.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-5c3131301b7d8b8ed732": {
      "kind": "assumption",
      "label": "Source result (kublenz-expansion), evaluated on its transformed instance: Unique identifiers; an upper bound on ∇₁ is supplied; no embedding is supplied.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-9840ca328d0bb8f0782a": {
      "kind": "parameter",
      "label": "Source result (amiri-locally-embeddable), evaluated on its transformed instance: ∇₁(G) is the maximum edge density |E(H)|/|V(H)| over nonempty depth-1 minors H of G. The supplied integer c satisfies c ≥ ∇₁(G); one may take c=⌈∇₁(G)⌉ if supplied. For a fixed integer t ≥ 3, K₃,ₜ is excluded as a depth-1 minor. The approximation ratio depends on c and t; the number of LOCAL communication rounds is universally bounded.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-eb20cfb1e526e02dd11f": {
      "kind": "assumption",
      "label": "Source result (amiri-locally-embeddable), evaluated on its transformed instance: Unique identifiers; a supplied integer c bounds the edge density of every depth-1 minor; no embedding is supplied.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-09e6a1e1be5f62731887": {
      "kind": "parameter",
      "label": "Source result (amiri-genus-ptas), evaluated on its transformed instance: Fixed genus g and ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (amiri-genus-ptas), evaluated on its transformed instance: Fixed genus g and ",
        {
          "math": "ε > 0"
        },
        ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-8ca0d1f06e284f15af19": {
      "kind": "assumption",
      "label": "Source result (amiri-genus-ptas), evaluated on its transformed instance: Unique identifiers; no embedding is supplied.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-6a2b0d26e0ee9796c468": {
      "kind": "parameter",
      "label": "Source result (czygrinow-topological-dom), evaluated on its transformed instance: Fixed h; both constants depend on h.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-5343fe54e1eb1c50a5dd": {
      "kind": "assumption",
      "label": "Source result (czygrinow-topological-dom), evaluated on its transformed instance: Unique identifiers; no embedding is supplied.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-6147bcd81bc255ba9c01": {
      "kind": "parameter",
      "label": "Source result (czygrinow-minor-ptas), evaluated on its transformed instance: Fixed h and ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (czygrinow-minor-ptas), evaluated on its transformed instance: Fixed h and ",
        {
          "math": "ε > 0"
        },
        ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-302732ef407345e0d47b": {
      "kind": "assumption",
      "label": "Source result (czygrinow-minor-ptas), evaluated on its transformed instance: Unique identifiers; no embedding is supplied.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-40ab6b5a993a38a0d206": {
      "kind": "parameter",
      "label": "Source result (amiri-planar-connected), evaluated on its transformed instance: No degree bound.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-b042ca64db30e652176f": {
      "kind": "assumption",
      "label": "Source result (amiri-planar-connected), evaluated on its transformed instance: Connected unweighted input; uses a constant-factor dominating set as a subroutine.\n\nReuse a connected dominating set: On a nonempty connected graph with unit vertex costs, run the source connected-dominating-set algorithm and return exactly its selected vertices as an ordinary dominating set. OPT_MDS ≤ OPT_CDS ≤ 3 OPT_MDS − 2. Thus an α-approximation against integral OPT_CDS gives a 3α-approximation against integral OPT_MDS, with no additional communication. The optimum comparison is unweighted. On a three-vertex path with costs (1,M,1), ordinary domination costs at most 2 while every connected dominating set costs at least M. The target remains restricted to connected inputs. Do not extend a connected-input algorithm to disconnected networks without checking component-wise operation, termination and global inputs. No fractional-MDS benchmark or lower-bound transfer is inferred by this factor-changing rule. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-3c2838dd23471cfed40f": {
      "kind": "parameter",
      "label": "Source result (amiri-genus-constant), evaluated on its transformed instance: Orientable genus at most g; both the approximation ratio and the number of communication rounds depend linearly on g.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-d7e60dec92b0c3e1d989": {
      "kind": "assumption",
      "label": "Source result (amiri-genus-constant), evaluated on its transformed instance: Unique identifiers; no embedding is supplied.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-77985a5c248f93ab82fe": {
      "kind": "parameter",
      "label": "Source result (wawrzyniak-anonymous-694), evaluated on its transformed instance: No fixed degree bound is required.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-e7f57578b692af0e4e8d": {
      "kind": "assumption",
      "label": "Source result (wawrzyniak-anonymous-694), evaluated on its transformed instance: Port numbering; O(log n)-bit messages; no identifiers.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.\n\nThe source Anonymous algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only."
    },
    "auto-parameter-e30a959e5799900ac29d": {
      "kind": "parameter",
      "label": "Source result (wawrzyniak-planar-52), evaluated on its transformed instance: No fixed degree bound is required.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-39a23b387fb069491cef": {
      "kind": "assumption",
      "label": "Source result (wawrzyniak-planar-52), evaluated on its transformed instance: Unique identifiers; no embedding is supplied.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-739767b3fac167cd69e8": {
      "kind": "parameter",
      "label": "Source result (planar-seven-lower), evaluated on its transformed instance: Any fixed ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (planar-seven-lower), evaluated on its transformed instance: Any fixed ",
        {
          "math": "ε > 0"
        },
        ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-f24197d4ed38789c7117": {
      "kind": "assumption",
      "label": "Source result (planar-seven-lower), evaluated on its transformed instance: Unique identifiers; no embedding is supplied.\n\nClosed-neighborhood requests: Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags. Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination."
    },
    "auto-parameter-08b712a57c6cb9c05853": {
      "kind": "parameter",
      "label": "Source result (lenzen-planar-130), evaluated on its transformed instance: No fixed degree bound is required.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-af3d77efa56066424f48": {
      "kind": "assumption",
      "label": "Source result (lenzen-planar-130), evaluated on its transformed instance: Unique identifiers; no embedding is supplied.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-d3e1c3e71b7ad8cd335b": {
      "kind": "parameter",
      "label": "Source result (lenzen-unit-disk-lower), evaluated on its transformed instance: f(n) is the approximation factor; T(n) the round complexity.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-9d25823721685c8719b5": {
      "kind": "assumption",
      "label": "Source result (lenzen-unit-disk-lower), evaluated on its transformed instance: Unique identifiers; no embedding is supplied.\n\nClosed-neighborhood requests: Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags. Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination."
    },
    "auto-parameter-1f371cffbc3710ea2280": {
      "kind": "parameter",
      "label": "Source result (lenzen-arboricity-random), evaluated on its transformed instance: α is the arboricity bound.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (lenzen-arboricity-random), evaluated on its transformed instance: ",
        {
          "math": "α"
        },
        " is the arboricity bound.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-ffac157bd645c23a2f4b": {
      "kind": "assumption",
      "label": "Source result (lenzen-arboricity-random), evaluated on its transformed instance: Unweighted; running time holds with high probability.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-9a74096f525c0e2a9623": {
      "kind": "parameter",
      "label": "Source result (lenzen-arboricity-deterministic), evaluated on its transformed instance: Δ is maximum degree.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (lenzen-arboricity-deterministic), evaluated on its transformed instance: ",
        {
          "math": "Δ"
        },
        " is maximum degree.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-b27d9a00fa05fce7bb8f": {
      "kind": "assumption",
      "label": "Source result (lenzen-arboricity-deterministic), evaluated on its transformed instance: Unweighted; uniform algorithm.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-beb44901026e2e133562": {
      "kind": "parameter",
      "label": "Source result (planar-fast-dominating), evaluated on its transformed instance: Fixed 0 < ε < 1.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (planar-fast-dominating), evaluated on its transformed instance: Fixed ",
        {
          "math": "0 < ε < 1"
        },
        ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-13f65215a03fc6b0b0fa": {
      "kind": "assumption",
      "label": "Source result (planar-fast-dominating), evaluated on its transformed instance: Unique identifiers; no embedding is supplied.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-c4fbdbd86a2c0571aac7": {
      "kind": "parameter",
      "label": "Source result (minor-almost-dominating), evaluated on its transformed instance: Fixed proper minor-closed family; o(1) tends to zero as n grows.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-f1c56a4916b5d87196e8": {
      "kind": "assumption",
      "label": "Source result (minor-almost-dominating), evaluated on its transformed instance: Unweighted; connected domination assumes connected input.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-4ba0e86e5f1b19c7d722": {
      "kind": "parameter",
      "label": "Source result (minor-almost-connected), evaluated on its transformed instance: Fixed proper minor-closed family; o(1) tends to zero as n grows.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-b289870bc848656a87eb": {
      "kind": "assumption",
      "label": "Source result (minor-almost-connected), evaluated on its transformed instance: Unweighted; connected domination assumes connected input.\n\nReuse a connected dominating set: On a nonempty connected graph with unit vertex costs, run the source connected-dominating-set algorithm and return exactly its selected vertices as an ordinary dominating set. OPT_MDS ≤ OPT_CDS ≤ 3 OPT_MDS − 2. Thus an α-approximation against integral OPT_CDS gives a 3α-approximation against integral OPT_MDS, with no additional communication. The optimum comparison is unweighted. On a three-vertex path with costs (1,M,1), ordinary domination costs at most 2 while every connected dominating set costs at least M. The target remains restricted to connected inputs. Do not extend a connected-input algorithm to disconnected networks without checking component-wise operation, termination and global inputs. No fractional-MDS benchmark or lower-bound transfer is inferred by this factor-changing rule. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-dda3c3d8d334bffca0f6": {
      "kind": "parameter",
      "label": "Source result (growth-local-dominating), evaluated on its transformed instance: Fixed growth polynomial and ε > 0; T_MIS is an MIS subroutine’s time.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-281e7424f0ee236503e2": {
      "kind": "assumption",
      "label": "Source result (growth-local-dominating), evaluated on its transformed instance: Includes unit-disk graphs; no coordinates are required.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-79664239916cf65ad5fa": {
      "kind": "parameter",
      "label": "Source result (alipour-trianglefree-32), evaluated on its transformed instance: Algorithm 1 with m = 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-94566eade8d232e04542": {
      "kind": "assumption",
      "label": "Source result (alipour-trianglefree-32), evaluated on its transformed instance: No isolated vertices; the presented algorithm uses random tie-breaking.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-b0605bfeaa9de830f1b2": {
      "kind": "parameter",
      "label": "Source result (alipour-fourcycle-18), evaluated on its transformed instance: Fixed graph-class restriction.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-9fb56d6e55e069b7a8e1": {
      "kind": "assumption",
      "label": "Source result (alipour-fourcycle-18), evaluated on its transformed instance: Randomized LOCAL algorithm; the no-isolated-vertex setting is used here.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-8f78c29c881a4d777152": {
      "kind": "parameter",
      "label": "Source result (unitdisk-connected-2006), evaluated on its transformed instance: Fixed positive integer k; polynomial exponent depends on k.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-837dc6d0776f101e23fe": {
      "kind": "assumption",
      "label": "Source result (unitdisk-connected-2006), evaluated on its transformed instance: No coordinates required; connected domination assumes connected input.\n\nReuse a connected dominating set: On a nonempty connected graph with unit vertex costs, run the source connected-dominating-set algorithm and return exactly its selected vertices as an ordinary dominating set. OPT_MDS ≤ OPT_CDS ≤ 3 OPT_MDS − 2. Thus an α-approximation against integral OPT_CDS gives a 3α-approximation against integral OPT_MDS, with no additional communication. The optimum comparison is unweighted. On a three-vertex path with costs (1,M,1), ordinary domination costs at most 2 while every connected dominating set costs at least M. The target remains restricted to connected inputs. Do not extend a connected-input algorithm to disconnected networks without checking component-wise operation, termination and global inputs. No fractional-MDS benchmark or lower-bound transfer is inferred by this factor-changing rule. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-aaedfbca93b74b696129": {
      "kind": "parameter",
      "label": "Source result (gen-aprsu10-dom), evaluated on its transformed instance: The maximum degree Δ affects the approximation ratio. The supplied weak 2-colouring permits a universal constant number of communication rounds, independently of Δ.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-1d56aa27f90d88dc37e1": {
      "kind": "assumption",
      "label": "Source result (gen-aprsu10-dom), evaluated on its transformed instance: A weak 2-colouring is supplied; no isolated vertices.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-f11719f7c60eb8983173": {
      "kind": "parameter",
      "label": "Source result (gen-w25-dom), evaluated on its transformed instance: \n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-0587f0dcf73a8b1728de": {
      "kind": "assumption",
      "label": "Source result (gen-w25-dom), evaluated on its transformed instance: \n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-dcdc30d57dc32ad13f6c": {
      "kind": "parameter",
      "label": "Source result (gen-bdgpsw26-dom), evaluated on its transformed instance: Fixed Euler genus g and ε.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (gen-bdgpsw26-dom), evaluated on its transformed instance: Fixed Euler genus g and ",
        {
          "math": "ε"
        },
        ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-fff39ba43ef891a8d0d4": {
      "kind": "assumption",
      "label": "Source result (gen-bdgpsw26-dom), evaluated on its transformed instance: Uses the planar 11+ε source approximation.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-853e9d46aefaa69dd895": {
      "kind": "parameter",
      "label": "Source result (gen-af26-dom), evaluated on its transformed instance: α is arboricity; logs truncated at constants.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (gen-af26-dom), evaluated on its transformed instance: ",
        {
          "math": "α"
        },
        " is arboricity; logs truncated at constants.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-cc6fcc0cb330d5280ad4": {
      "kind": "assumption",
      "label": "Source result (gen-af26-dom), evaluated on its transformed instance: Δ known; α need not be known; one-bit messages suffice.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.\n\nThe source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only."
    },
    "auto-parameter-25954594c905b764692f": {
      "kind": "parameter",
      "label": "Source result (gen-w26-planar-dom), evaluated on its transformed instance: Fixed ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (gen-w26-planar-dom), evaluated on its transformed instance: Fixed ",
        {
          "math": "ε > 0"
        },
        ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-2d4d238491d777d5feae": {
      "kind": "assumption",
      "label": "Source result (gen-w26-planar-dom), evaluated on its transformed instance: Neither embedding nor n is required.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-60e88e5bcaa0c1b35889": {
      "kind": "parameter",
      "label": "Source result (gen-as26-planar), evaluated on its transformed instance: Fixed ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (gen-as26-planar), evaluated on its transformed instance: Fixed ",
        {
          "math": "ε > 0"
        },
        ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-1c75a5d26563a57273bc": {
      "kind": "assumption",
      "label": "Source result (gen-as26-planar), evaluated on its transformed instance: Guarantee also holds against fractional OPT.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-a068089182c38c178d48": {
      "kind": "parameter",
      "label": "Source result (gen-as26-minor), evaluated on its transformed instance: Fixed class 𝒞 and ε; a(𝒞) = sup |E|/|V|.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (gen-as26-minor), evaluated on its transformed instance: Fixed class 𝒞 and ",
        {
          "math": "ε"
        },
        "; a(𝒞) = sup |E|/|V|.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-70bdbc914fc2a76049b7": {
      "kind": "assumption",
      "label": "Source result (gen-as26-minor), evaluated on its transformed instance: Measured against fractional OPT.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-2a0f75743ae4b2e86b36": {
      "kind": "parameter",
      "label": "Source result (gen-as26-random), evaluated on its transformed instance: Fixed class 𝒞 and ε.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (gen-as26-random), evaluated on its transformed instance: Fixed class 𝒞 and ",
        {
          "math": "ε"
        },
        ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-603a887dcfe3861601f4": {
      "kind": "assumption",
      "label": "Source result (gen-as26-random), evaluated on its transformed instance: Always feasible; expected size ≤ (1+ε)OPT.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-741c702feb1cd68e99f0": {
      "kind": "parameter",
      "label": "Source result (gen-as26-power-lower), evaluated on its transformed instance: Fixed integer r ≥ 1; ε > 0 is a gap below 2r + 1. The excluded round complexity may depend on r and ε, but not on n.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-2964335fb67c92c6fa43": {
      "kind": "assumption",
      "label": "Source result (gen-as26-power-lower), evaluated on its transformed instance: Deterministic; n may be known.\n\nClosed-neighborhood requests: Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags. Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination."
    },
    "auto-parameter-c09ae0a60fc23b13685a": {
      "kind": "parameter",
      "label": "Source result (gen-w26-clique-dom), evaluated on its transformed instance: Fixed ε > 0; clique size unbounded.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (gen-w26-clique-dom), evaluated on its transformed instance: Fixed ",
        {
          "math": "ε > 0"
        },
        "; clique size unbounded.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-856f6022043b0de9b5df": {
      "kind": "assumption",
      "label": "Source result (gen-w26-clique-dom), evaluated on its transformed instance: Distinct IDs; n need not be known.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-2ce51cdc659fec78a3e5": {
      "kind": "parameter",
      "label": "Source result (gen-p26-density), evaluated on its transformed instance: Fixed mad bound d, shallow-minor density ∇₁, ε.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (gen-p26-density), evaluated on its transformed instance: Fixed mad bound d, shallow-minor density ",
        {
          "math": "∇₁"
        },
        ", ",
        {
          "math": "ε"
        },
        ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-3faaa0672726ae6c2e58": {
      "kind": "assumption",
      "label": "Source result (gen-p26-density), evaluated on its transformed instance: \n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-9c4344caef616bad0511": {
      "kind": "parameter",
      "label": "Source result (gen-p26-genus), evaluated on its transformed instance: Fixed Euler genus g and ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (gen-p26-genus), evaluated on its transformed instance: Fixed Euler genus g and ",
        {
          "math": "ε > 0"
        },
        ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-ae89b3d9b9367b2b2c9e": {
      "kind": "assumption",
      "label": "Source result (gen-p26-genus), evaluated on its transformed instance: \n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-dc5b5489116b1c8c0736": {
      "kind": "parameter",
      "label": "Source result (gen-p26-trianglefree), evaluated on its transformed instance: Fixed Euler genus g and ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (gen-p26-trianglefree), evaluated on its transformed instance: Fixed Euler genus g and ",
        {
          "math": "ε > 0"
        },
        ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-b8ecc2c1afd8ae143dab": {
      "kind": "assumption",
      "label": "Source result (gen-p26-trianglefree), evaluated on its transformed instance: \n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-68f97a5e384ab2cf609a": {
      "kind": "parameter",
      "label": "Source result (gen-asw26-planar), evaluated on its transformed instance: \n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-0bf8cd25176054dabaa5": {
      "kind": "assumption",
      "label": "Source result (gen-asw26-planar), evaluated on its transformed instance: Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.\n\nThe source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only."
    },
    "auto-detail-bcdea068c1168a6e72e9": {
      "kind": "detail",
      "label": "Source variant: Unweighted; fractional benchmark"
    },
    "auto-parameter-aeda0a5fc156d8327143": {
      "kind": "parameter",
      "label": "Source result (gen-asw26-trianglefree), evaluated on its transformed instance: \n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-d88980040733e2436cd7": {
      "kind": "assumption",
      "label": "Source result (gen-asw26-trianglefree), evaluated on its transformed instance: Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.\n\nThe source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only."
    },
    "auto-parameter-ac6deabc8033886af39f": {
      "kind": "parameter",
      "label": "Source result (gen-asw26-minordensity), evaluated on its transformed instance: Fixed rational a ≥ 1.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (gen-asw26-minordensity), evaluated on its transformed instance: Fixed rational ",
        {
          "math": "a ≥ 1"
        },
        ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-afa657848aef5475df06": {
      "kind": "assumption",
      "label": "Source result (gen-asw26-minordensity), evaluated on its transformed instance: Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.\n\nThe source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only."
    },
    "auto-parameter-85c37cacdfffb4767e8c": {
      "kind": "parameter",
      "label": "Source result (gen-asw26-genus), evaluated on its transformed instance: Fixed g.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-a90e03b7de4f713759b3": {
      "kind": "assumption",
      "label": "Source result (gen-asw26-genus), evaluated on its transformed instance: Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs. No embedding required. Benchmark is integral OPT.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.\n\nThe source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only."
    },
    "auto-detail-a3a5696b4f285190f192": {
      "kind": "detail",
      "label": "Source variant: Unweighted; integral benchmark"
    },
    "auto-parameter-39a561a6f3ee94c8a10b": {
      "kind": "parameter",
      "label": "Source result (gen-asw26-setcover), evaluated on its transformed instance: Fixed ε > 0 and integer b ≥ 1. Each set has a positive integer cost at most b.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.\n\nEdges as universe elements: exact instance substitutions n=n+m, Δ=max{Δ,2}, f=2, k=Δ, m=2m."
    },
    "auto-assumption-5a9f92a24cd09ad360df": {
      "kind": "assumption",
      "label": "Source result (gen-asw26-setcover), evaluated on its transformed instance: Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs. Feasible instance; costs in {1,…,b}; unbounded set size and frequency.\n\nEdges as universe elements: Use universe E and one set of incident edges for each vertex, with the same vertex cost. Every element has frequency two, and each set has size at most Δ. A one-round identifier exchange lets endpoints agree on ownership and unique identifiers for virtual edge processors. One incidence round can then be simulated in one physical round, with local messages at the owner delivered locally. If the necessary endpoint identifiers are initially known, the setup can be omitted. The source theorem’s global instance-size or degree information must also be supplied; obtaining it is not hidden in T+1. Subdividing edges preserves planarity, but arbitrary incidence-network and minor promises still need checking. A generic per-edge simulation does not preserve a broadcast-only restriction. Anonymous broadcast algorithms can sometimes avoid identifier-based ownership; such a specialized simulation is not certified by this generic recipe. The displayed maximum degree max{Δ,2} applies when G has at least one edge. An edgeless instance is handled locally with the empty output; it is not passed to the incidence algorithm. The edge-subdivision incidence graph has exactly 2m edges, with two incidences for each original edge. Universe E with one incident-edge set per original vertex; the incidence graph subdivides every edge. One identifier-exchange setup round assigns virtual edge processors. Source global algorithm inputs must already be supplied or separately obtained. For the simulated algorithm, G has at least one edge. Edgeless instances have an empty optimal output handled locally."
    },
    "auto-detail-82557c9d0ebfe7589d0a": {
      "kind": "detail",
      "label": "Source variant: Bounded costs; also red-blue domination / hitting set"
    },
    "auto-parameter-b07c3dacce1d03994dd5": {
      "kind": "parameter",
      "label": "Source result (gen-asw26-fractional), evaluated on its transformed instance: Fixed rational ρ ≥ 1, integer b ≥ 1 and ε > 0. Each candidate vertex has a positive integer cost at most b.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-79da78df99866eb51e41": {
      "kind": "assumption",
      "label": "Source result (gen-asw26-fractional), evaluated on its transformed instance: Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs. Feasible locally known candidates C(r) ⊆ N[r]; costs in {1,…,b}.\n\nFractional closed neighborhoods: Use requests V, candidates C(v)=N[v], and the same nonnegative vertex variables. These flags are locally constructible. The fractional feasible region and objective are identical. Use unit costs for the unweighted relaxation; a weighted algorithm must accept the supplied costs. This produces fractional vertex values, not an integral dominating set. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate requests V and candidate sets C(v)=N[v]; retain fractional output."
    },
    "auto-detail-298d3915bfb97c889e62": {
      "kind": "detail",
      "label": "Source variant: Local covering constraints; bounded costs"
    },
    "auto-parameter-7433dcdc316a8ed884e4": {
      "kind": "parameter",
      "label": "Source result (gen-asw26-cover-random), evaluated on its transformed instance: Fixed rational ρ ≥ 1, integer b ≥ 1 and ε > 0. Each candidate vertex has a positive integer cost at most b.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-dda5ba94931ca13b8243": {
      "kind": "assumption",
      "label": "Source result (gen-asw26-cover-random), evaluated on its transformed instance: Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs. Feasible locally known candidates C(r) ⊆ N[r]; costs in {1,…,b}. Output always feasible.\n\nClosed-neighborhood requests: Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags. Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination."
    },
    "auto-detail-75079e65b7958e1a3ca5": {
      "kind": "detail",
      "label": "Source variant: Integral local cover; bounded costs"
    },
    "auto-assumption-663311027e6d97ad5d18": {
      "kind": "assumption",
      "label": "Source result (gen-asw26-cover-random), evaluated on its transformed instance: Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs. Feasible locally known candidates C(r) ⊆ N[r]; costs in {1,…,b}. Output always feasible.\n\nOpen-neighborhood requests: Make every vertex a request and put C(v)=N(v), excluding self-coverage. These incidence flags are locally known from the input edges. The input must have no isolated vertices. Use unit costs for the unweighted problem; retain cost restrictions in weighted instances. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate requests V and candidate sets C(v)=N(v); the input has no isolated vertices."
    },
    "auto-assumption-21a73d25dd3d19517ff3": {
      "kind": "assumption",
      "label": "Source result (gen-asw26-cover-random), evaluated on its transformed instance: Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs. Feasible locally known candidates C(r) ⊆ N[r]; costs in {1,…,b}. Output always feasible.\n\nPrescribed client requests: Use the client set R as the requests and put C(r)=N[r]. Each client initially knows its own membership in R. One setup round broadcasts client membership so both endpoints know request–candidate incidences. If these incidence flags are already supplied, the setup round can be omitted. Preserve any preprocessing allowed by SUPPORTED and every other source input convention. Upper-bound examples include this one-round setup. A client lower bound would shift by one round under this convention; unchanged exact lower-bound import is therefore disabled. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate the client requests R and C(r)=N[r]. One setup round advertises membership in R, unless those incidence flags are initially supplied."
    },
    "auto-parameter-85cc282370b1fcb04d28": {
      "kind": "parameter",
      "label": "Source result (gen-asw26-cover-det), evaluated on its transformed instance: Fixed rational ρ ≥ 1, integer b ≥ 1 and ε > 0. Each candidate vertex has a positive integer cost at most b.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-467e3336a379ac78880d": {
      "kind": "assumption",
      "label": "Source result (gen-asw26-cover-det), evaluated on its transformed instance: Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs. Feasible locally known candidates C(r) ⊆ N[r]; costs in {1,…,b}. Common polynomial upper bound on IDs known.\n\nClosed-neighborhood requests: Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags. Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination."
    },
    "auto-assumption-11c60a7cecfb4bc3688a": {
      "kind": "assumption",
      "label": "Source result (gen-asw26-cover-det), evaluated on its transformed instance: Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs. Feasible locally known candidates C(r) ⊆ N[r]; costs in {1,…,b}. Common polynomial upper bound on IDs known.\n\nOpen-neighborhood requests: Make every vertex a request and put C(v)=N(v), excluding self-coverage. These incidence flags are locally known from the input edges. The input must have no isolated vertices. Use unit costs for the unweighted problem; retain cost restrictions in weighted instances. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate requests V and candidate sets C(v)=N(v); the input has no isolated vertices."
    },
    "auto-assumption-a60624ad6fd3cedf37f3": {
      "kind": "assumption",
      "label": "Source result (gen-asw26-cover-det), evaluated on its transformed instance: Broadcast CONGEST: identical O(log n)-bit message to all neighbors; distinct O(log n)-bit IDs. Feasible locally known candidates C(r) ⊆ N[r]; costs in {1,…,b}. Common polynomial upper bound on IDs known.\n\nPrescribed client requests: Use the client set R as the requests and put C(r)=N[r]. Each client initially knows its own membership in R. One setup round broadcasts client membership so both endpoints know request–candidate incidences. If these incidence flags are already supplied, the setup round can be omitted. Preserve any preprocessing allowed by SUPPORTED and every other source input convention. Upper-bound examples include this one-round setup. A client lower bound would shift by one round under this convention; unchanged exact lower-bound import is therefore disabled. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate the client requests R and C(r)=N[r]. One setup round advertises membership in R, unless those incidence flags are initially supplied."
    },
    "auto-parameter-55c8948d452b244605bd": {
      "kind": "parameter",
      "label": "Source result (gen-asw26-cycle-lower), evaluated on its transformed instance: Fixed 0 < ε < 1/4.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (gen-asw26-cycle-lower), evaluated on its transformed instance: Fixed ",
        {
          "math": "0 < ε < 1/4"
        },
        ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-f568bf7844ef58527c79": {
      "kind": "assumption",
      "label": "Source result (gen-asw26-cycle-lower), evaluated on its transformed instance: Deterministic; even with known n and IDs {1,…,n}.\n\nClosed-neighborhood requests: Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags. Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination."
    },
    "auto-parameter-5dccb1a902150379e010": {
      "kind": "parameter",
      "label": "Source result (gen-low24-cover), evaluated on its transformed instance: Γₚ = max column sum, Γd = max row sum of normalized A; ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.\n\nClosed-neighborhood covering matrix: exact instance substitutions n=2n, Δ=Δ+1, Γd=Δ+1, Γₚ=Δ+1, Γp=Δ+1, Amax=1, m=n+2m."
    },
    "auto-assumption-308ad576c101fb4cb941": {
      "kind": "assumption",
      "label": "Source result (gen-low24-cover), evaluated on its transformed instance: Communication graph is variable–constraint incidence graph. Normalized nonzero Aᵢⱼ ≥ 1; coefficient sizes follow the paper’s CONGEST encoding.\n\nClosed-neighborhood covering matrix: Use A_uv=1 when u belongs to N[v], and zero otherwise, with one covering constraint per original vertex. Variables remain fractional. Host variable and constraint copies at each real vertex and simulate a virtual round in two role phases. The objective is preserved after any required cost normalization. The source algorithm’s coefficient, precision, normalization and initial-information assumptions must hold; these are not consequences of graph inclusion. In the unweighted 0–1 instance, maximum row and column sums are both Δ+1. Planarity of G does not imply planarity of this incidence graph. The transformed closed-neighborhood incidence graph has exactly n+2m edges: n self-incidences and two incidences for every original edge. Use the unweighted 0–1 closed-neighborhood covering matrix, with Γd=Γp=Δ+1; retain fractional output. Source normalized-coefficient, precision, bit-encoding and supplied-parameter assumptions remain."
    },
    "auto-detail-936b7cf395abca76c67d": {
      "kind": "detail",
      "label": "Source variant: Fractional positive LP"
    },
    "auto-parameter-35f5fdb6626e97dacfef": {
      "kind": "parameter",
      "label": "Source result (gen-low24-cover), evaluated on its transformed instance: Γₚ = max column sum, Γd = max row sum of normalized A; ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.\n\nEdge constraints: exact instance substitutions n=n+m, Δ=max{Δ,2}, Γd=2, Γₚ=Δ, Γp=Δ, Amax=1, m=2m."
    },
    "auto-assumption-9f5a3496ba688047c763": {
      "kind": "assumption",
      "label": "Source result (gen-low24-cover), evaluated on its transformed instance: Communication graph is variable–constraint incidence graph. Normalized nonzero Aᵢⱼ ≥ 1; coefficient sizes follow the paper’s CONGEST encoding.\n\nEdge constraints: Use one variable x_v per vertex and the inequality x_u+x_v≥1 for every edge uv. The positive objective uses the original vertex costs. Use identifier-based edge-processor ownership with at most one setup round, as in the vertex-cover incidence simulation. Any extra global algorithm input must be supplied separately. For unit costs, each row has sum two and each column has sum at most Δ. Weighted normalization must meet the chosen LP algorithm’s coefficient and encoding requirements. The output is fractional. Integral vertex cover requires a separate rounding step, such as the threshold recipe. The displayed maximum degree max{Δ,2} applies when G has at least one edge. An edgeless instance is handled locally with the empty output; it is not passed to the incidence algorithm. The edge-subdivision incidence graph has exactly 2m edges, with two incidences for each original edge. Use the unweighted 0–1 matrix A with one row per edge and one column per vertex; Γd=2 and Γp≤Δ. One identifier-exchange setup round assigns edge-constraint processors; preserve the source normalization, precision, encoding and global-input assumptions. For the simulated algorithm, G has at least one edge. Edgeless instances have an empty optimal output handled locally."
    },
    "auto-output-498ca814bcbfb2d5db15": {
      "kind": "output",
      "label": "Fractional vertex cover"
    },
    "auto-assumption-5aa54fe311f2058f99f3": {
      "kind": "assumption",
      "label": "Source result (gen-low24-cover), evaluated on its transformed instance: Communication graph is variable–constraint incidence graph. Normalized nonzero Aᵢⱼ ≥ 1; coefficient sizes follow the paper’s CONGEST encoding.\n\nThreshold at one half: The algorithm returns a feasible fractional vertex cover x on the original graph, and each vertex knows its own coordinate. Let D contain exactly the vertices with x_v≥1/2. Every edge has an endpoint in D because x_u+x_v≥1. For nonnegative vertex costs, cost(D) is at most twice the fractional solution cost, hence at most 2α times integral OPT. Thresholding is local and needs no extra communication. If the fractional algorithm runs on a separate incidence network, its simulation cost must be added before using this recipe. This recipe changes the factor from α to 2α and is therefore separate from the unrounded relaxation link; it is not an approximation-preserving automatic import. The source provides a feasible fractional vertex cover on the physical input graph, with x_v locally known. Select v exactly when x_v≥1/2. This local operation multiplies a minimization approximation factor by two and preserves the source weight assumptions.\n\nEdge constraints: Use one variable x_v per vertex and the inequality x_u+x_v≥1 for every edge uv. The positive objective uses the original vertex costs. Use identifier-based edge-processor ownership with at most one setup round, as in the vertex-cover incidence simulation. Any extra global algorithm input must be supplied separately. For unit costs, each row has sum two and each column has sum at most Δ. Weighted normalization must meet the chosen LP algorithm’s coefficient and encoding requirements. The output is fractional. Integral vertex cover requires a separate rounding step, such as the threshold recipe. The displayed maximum degree max{Δ,2} applies when G has at least one edge. An edgeless instance is handled locally with the empty output; it is not passed to the incidence algorithm. The edge-subdivision incidence graph has exactly 2m edges, with two incidences for each original edge. Use the unweighted 0–1 matrix A with one row per edge and one column per vertex; Γd=2 and Γp≤Δ. One identifier-exchange setup round assigns edge-constraint processors; preserve the source normalization, precision, encoding and global-input assumptions. For the simulated algorithm, G has at least one edge. Edgeless instances have an empty optimal output handled locally."
    },
    "auto-parameter-59066c24e5e11e21d868": {
      "kind": "parameter",
      "label": "Source result (gen-low24-pack), evaluated on its transformed instance: Γₚ = max column sum, Γd = max row sum of normalized A; ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.\n\nVertex-capacity packing constraints: exact instance substitutions n=n+m, Δ=max{Δ,2}, Γd=2, Γₚ=Δ, Γp=Δ, Amax=1, m=2m."
    },
    "auto-assumption-61fef3548fc66ff5d982": {
      "kind": "assumption",
      "label": "Source result (gen-low24-pack), evaluated on its transformed instance: Communication graph is variable–constraint incidence graph. Normalized nonzero Aᵢⱼ ≥ 1; coefficient sizes follow the paper’s CONGEST encoding.\n\nVertex-capacity packing constraints: Use one nonnegative variable per edge, with incident-variable sum at most one at each vertex. The objective is matching cardinality or the supplied edge weights. Host an edge-variable processor at an endpoint agreed by an identifier exchange; one incidence round then takes one physical round. A final output notification lets both endpoints learn their edge value. Setup and notification give O(T+1); any extra source parameter knowledge must be supplied separately. For unit edge weights, write the algorithm’s dual as max 1ᵀy subject to Aᵀy≤1, with A the edge-by-vertex 0–1 incidence matrix. Then Γd=2 and Γp≤Δ. The selected packing theorem’s normalization and bit encoding must hold. Fractional degree constraints do not enforce integral matching on nonbipartite graphs. No rounding or odd-set constraints are included. The displayed maximum degree max{Δ,2} applies when G has at least one edge. An edgeless instance is handled locally with the empty output; it is not passed to the incidence algorithm. The edge-subdivision incidence graph has exactly 2m edges, with two incidences for each original edge. Use the unweighted 0–1 matrix A=edge×vertex in the source dual form max 1ᵀy subject to Aᵀy≤1, so Γd=2 and Γp≤Δ. Setup assigns an edge-variable host; output notification makes the edge value known at both endpoints. Retain all source precision, encoding and global-input assumptions. For the simulated algorithm, G has at least one edge. Edgeless instances have an empty optimal output handled locally."
    },
    "auto-detail-bd6d3996f60e48f6aaf2": {
      "kind": "detail",
      "label": "Source variant: Dual fractional positive LP"
    },
    "auto-parameter-3f69af196662b3f1d741": {
      "kind": "parameter",
      "label": "Source result (gen-as10-setcover), evaluated on its transformed instance: Positive integer weights ≤ W; bounded f,k,W gives constant rounds.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.\n\nNeighborhood set cover: exact instance substitutions n=2n, Δ=Δ+1, f=Δ+1, k=Δ+1, m=n+2m."
    },
    "auto-assumption-45e92e95e7967d02f44a": {
      "kind": "assumption",
      "label": "Source result (gen-as10-setcover), evaluated on its transformed instance: Anonymous broadcast network; no unique identifiers.\n\nNeighborhood set cover: Use universe V and the set N[v] for each candidate vertex v, with the candidate’s cost. A chosen set corresponds to choosing its vertex, so integral OPT is unchanged. Each real vertex hosts its two virtual copies. Precompute both outgoing message sets at a virtual round’s start, then deliver the set-copy and element-copy messages in two physical phases. This gives the displayed 2T schedule, including T=0. The maximum set size and element frequency are both at most Δ+1. Any source theorem’s initial labels and global parameter knowledge must be supplied or their setup cost added. Apply graph-class assumptions to the transformed incidence graph. Planarity is not preserved: planar K4 has closed-neighborhood incidence graph K4,4. The displayed CONGEST simulation is per-edge. Additional broadcast or stronger anonymity conventions must be checked for the particular algorithm. The transformed closed-neighborhood incidence graph has exactly n+2m edges: n self-incidences and two incidences for every original edge. Closed-neighborhood incidence network; each processor hosts a set-copy and an element-copy. Two role phases simulate one source round. Both set size and element frequency are at most Δ+1. Global algorithm inputs and stronger broadcast conventions require the source assumptions. Planar-incidence source algorithms are excluded: planar K4 transforms to K4,4."
    },
    "auto-detail-a49b44d4581b55175582": {
      "kind": "detail",
      "label": "Source variant: Weighted"
    },
    "auto-parameter-1dd77a279ac759790df4": {
      "kind": "parameter",
      "label": "Source result (gen-as10-setcover), evaluated on its transformed instance: Positive integer weights ≤ W; bounded f,k,W gives constant rounds.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.\n\nEdges as universe elements: exact instance substitutions n=n+m, Δ=max{Δ,2}, f=2, k=Δ, m=2m."
    },
    "auto-assumption-a1ac84c2a18e7732247d": {
      "kind": "assumption",
      "label": "Source result (gen-as10-setcover), evaluated on its transformed instance: Anonymous broadcast network; no unique identifiers.\n\nEdges as universe elements: Use universe E and one set of incident edges for each vertex, with the same vertex cost. Every element has frequency two, and each set has size at most Δ. A one-round identifier exchange lets endpoints agree on ownership and unique identifiers for virtual edge processors. One incidence round can then be simulated in one physical round, with local messages at the owner delivered locally. If the necessary endpoint identifiers are initially known, the setup can be omitted. The source theorem’s global instance-size or degree information must also be supplied; obtaining it is not hidden in T+1. Subdividing edges preserves planarity, but arbitrary incidence-network and minor promises still need checking. A generic per-edge simulation does not preserve a broadcast-only restriction. Anonymous broadcast algorithms can sometimes avoid identifier-based ownership; such a specialized simulation is not certified by this generic recipe. The displayed maximum degree max{Δ,2} applies when G has at least one edge. An edgeless instance is handled locally with the empty output; it is not passed to the incidence algorithm. The edge-subdivision incidence graph has exactly 2m edges, with two incidences for each original edge. Universe E with one incident-edge set per original vertex; the incidence graph subdivides every edge. One identifier-exchange setup round assigns virtual edge processors. Source global algorithm inputs must already be supplied or separately obtained. For the simulated algorithm, G has at least one edge. Edgeless instances have an empty optimal output handled locally.\n\nThe source Anonymous algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only."
    },
    "auto-parameter-399f8208acfb654f4092": {
      "kind": "parameter",
      "label": "Source result (gen-as10-setcover), evaluated on its transformed instance: Positive integer weights ≤ W; bounded f,k,W gives constant rounds.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.\n\nDomination on the line graph: exact instance substitutions n=m, Δ=Δ_L, m=m_L.\n\nNeighborhood set cover: exact instance substitutions n=2n, Δ=Δ+1, f=Δ+1, k=Δ+1, m=n+2m."
    },
    "auto-assumption-958650232c250834d58d": {
      "kind": "assumption",
      "label": "Source result (gen-as10-setcover), evaluated on its transformed instance: Anonymous broadcast network; no unique identifiers.\n\nDomination on the line graph: A selected vertex of L(G) corresponds to the original edge. Feasibility and cardinality OPT agree; weighted transfer additionally requires an algorithm accepting the corresponding vertex weights. Assign each virtual edge-node to an endpoint. With unrestricted LOCAL messages, a virtual round routes through shared endpoints in at most two physical rounds; constant setup and output notification give O(T+1). The source algorithm must accept the line graph’s n′, Δ′, IDs and any supplied parameters. Obtaining global information is not free. A line graph can be much denser and need not preserve planarity: the line graph of a star is a clique. This recipe claims LOCAL only. Arbitrary different messages along virtual adjacencies can create congestion at physical edges, so an O(T) CONGEST simulation is not inferred. Exact algorithm substitutions use n′=m and Δ′=Δ_L, where Δ_L=max_{uv∈E(G)}(deg(u)+deg(v)−2). The displayed 2Δ−2 is an upper bound, not an exact substitution in a nonmonotone theorem. For simple G, m_L=sum_v binom(deg(v),2) is the exact number of edges of L(G). It is retained symbolically rather than replaced by a monotone upper bound. Apply the dominating-set algorithm to L(G); generic transfer is certified only from unrestricted general-graph LOCAL algorithms. Virtual line-graph rounds route through shared endpoints in at most two physical rounds. Retain global-input assumptions; setup and output notification are included. Here m=|E(G)| and Δ_L=max over uv∈E(G) of (deg(u)+deg(v)−2), the exact maximum degree of L(G); Δ_L≤2Δ−2. If m=0, return the empty edge set locally. For simple G, m_L=sum_v binom(deg(v),2) is the exact number of edges of L(G). It is retained symbolically rather than replaced by a monotone upper bound.\n\nThe source Anonymous algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only.\n\nNeighborhood set cover: Use universe V and the set N[v] for each candidate vertex v, with the candidate’s cost. A chosen set corresponds to choosing its vertex, so integral OPT is unchanged. Each real vertex hosts its two virtual copies. Precompute both outgoing message sets at a virtual round’s start, then deliver the set-copy and element-copy messages in two physical phases. This gives the displayed 2T schedule, including T=0. The maximum set size and element frequency are both at most Δ+1. Any source theorem’s initial labels and global parameter knowledge must be supplied or their setup cost added. Apply graph-class assumptions to the transformed incidence graph. Planarity is not preserved: planar K4 has closed-neighborhood incidence graph K4,4. The displayed CONGEST simulation is per-edge. Additional broadcast or stronger anonymity conventions must be checked for the particular algorithm. The transformed closed-neighborhood incidence graph has exactly n+2m edges: n self-incidences and two incidences for every original edge. Closed-neighborhood incidence network; each processor hosts a set-copy and an element-copy. Two role phases simulate one source round. Both set size and element frequency are at most Δ+1. Global algorithm inputs and stronger broadcast conventions require the source assumptions. Planar-incidence source algorithms are excluded: planar K4 transforms to K4,4."
    },
    "auto-parameter-2dd1547065070f9ff592": {
      "kind": "parameter",
      "label": "Source result (gen-bdgpsw26-apex), evaluated on its transformed instance: Fixed g and a; fixed ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (gen-bdgpsw26-apex), evaluated on its transformed instance: Fixed g and a; fixed ",
        {
          "math": "ε > 0"
        },
        ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-a8f703cc27760cd8f5b2": {
      "kind": "assumption",
      "label": "Source result (gen-bdgpsw26-apex), evaluated on its transformed instance: \n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-38b877417a6040168599": {
      "kind": "parameter",
      "label": "Source result (gen-bdgpsw26-localgenus), evaluated on its transformed instance: Fixed d,g and sufficiently large fixed radius r.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (gen-bdgpsw26-localgenus), evaluated on its transformed instance: Fixed d,g and sufficiently large fixed radius ",
        {
          "math": "r"
        },
        ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-ad7a9161800b32288659": {
      "kind": "assumption",
      "label": "Source result (gen-bdgpsw26-localgenus), evaluated on its transformed instance: The local-class condition is as defined in the paper; the apex extension also holds.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-9db041050fd545202dcf": {
      "kind": "parameter",
      "label": "Source result (gen-bdgpsw26-connected), evaluated on its transformed instance: Fixed g.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-35b25ca4662d26f8109b": {
      "kind": "assumption",
      "label": "Source result (gen-bdgpsw26-connected), evaluated on its transformed instance: \n\nReuse a connected dominating set: On a nonempty connected graph with unit vertex costs, run the source connected-dominating-set algorithm and return exactly its selected vertices as an ordinary dominating set. OPT_MDS ≤ OPT_CDS ≤ 3 OPT_MDS − 2. Thus an α-approximation against integral OPT_CDS gives a 3α-approximation against integral OPT_MDS, with no additional communication. The optimum comparison is unweighted. On a three-vertex path with costs (1,M,1), ordinary domination costs at most 2 while every connected dominating set costs at least M. The target remains restricted to connected inputs. Do not extend a connected-input algorithm to disconnected networks without checking component-wise operation, termination and global inputs. No fractional-MDS benchmark or lower-bound transfer is inferred by this factor-changing rule. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-6d8656e375cec5630dc1": {
      "kind": "parameter",
      "label": "Source result (gen-kmw16-mds-lower), evaluated on its transformed instance: n is the number of vertices; Δ is the maximum degree. The exponents in polylogarithmic factors are fixed.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-71f1c18f07ae2c1a4590": {
      "kind": "assumption",
      "label": "Source result (gen-kmw16-mds-lower), evaluated on its transformed instance: Also applies to deterministic algorithms. Randomized lower bound concerns expected approximation with a fixed worst-case round budget. There are hard graph families; n and Δ are coupled by the construction, so this is not a guarantee for every independently prescribed pair (n, Δ).\n\nClosed-neighborhood requests: Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags. Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination."
    },
    "auto-detail-5b982b65b05eef70c96a": {
      "kind": "detail",
      "label": "Source variant: Unweighted; constant or polylogarithmic approximation"
    },
    "auto-parameter-9dbb947b6d84ae7a6543": {
      "kind": "parameter",
      "label": "Source result (pic-large-50-dom), evaluated on its transformed instance: Fixed integer t ≥ 2.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (pic-large-50-dom), evaluated on its transformed instance: Fixed integer ",
        {
          "math": "t ≥ 2"
        },
        ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-758bbb474368354c283b": {
      "kind": "assumption",
      "label": "Source result (pic-large-50-dom), evaluated on its transformed instance: Distinct identifiers.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-05c0bf8040d6edb94768": {
      "kind": "parameter",
      "label": "Source result (pic-large-linear-dom), evaluated on its transformed instance: Integer t ≥ 2; rounds independent of t.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (pic-large-linear-dom), evaluated on its transformed instance: Integer ",
        {
          "math": "t ≥ 2"
        },
        "; rounds independent of t.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-927f172acd661a22819b": {
      "kind": "assumption",
      "label": "Source result (pic-large-linear-dom), evaluated on its transformed instance: \n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-b2271c458a560813ef31": {
      "kind": "parameter",
      "label": "Source result (pic-nice-planar-uniform), evaluated on its transformed instance: \n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-e854ad7bc55846e48592": {
      "kind": "assumption",
      "label": "Source result (pic-nice-planar-uniform), evaluated on its transformed instance: \n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-detail-83ffa327ecdc25adfa68": {
      "kind": "detail",
      "label": "Source variant: Unweighted; 4-uniform guarantee"
    },
    "auto-parameter-4ce932d2e764804d25ca": {
      "kind": "parameter",
      "label": "Source result (pic-nice-localgenus), evaluated on its transformed instance: Fixed d,g,r and dimensional control function; r sufficiently large.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-72ec5161908ff799d58a": {
      "kind": "assumption",
      "label": "Source result (pic-nice-localgenus), evaluated on its transformed instance: Every radius-r induced ball lies in the Euler-genus-g class.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-f9aaf82a8aa5350d440a": {
      "kind": "parameter",
      "label": "Source result (pic-genus-broadcast-historical), evaluated on its transformed instance: Fixed g.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-284bc13b07bfe0df7180": {
      "kind": "assumption",
      "label": "Source result (pic-genus-broadcast-historical), evaluated on its transformed instance: CONGEST_BC: each vertex broadcasts the same O(log n)-bit message to neighbors.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.\n\nThe source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only."
    },
    "auto-parameter-7036a2ebe04667730f7e": {
      "kind": "parameter",
      "label": "Source result (pic-sublog-fmatching), evaluated on its transformed instance: Fixed ε > 0 and expansion function g.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.\n\nUnit simple capacities: exact instance substitutions f=1."
    },
    "auto-assumption-4fc104291a1b11a9344c": {
      "kind": "assumption",
      "label": "Source result (pic-sublog-fmatching), evaluated on its transformed instance: Integer vertex capacities f(v); expansion information supplied.\n\nUnit simple capacities: Set every vertex capacity f(v)=1. Then every feasible f-matching is an ordinary matching, with the same cardinality OPT. The indexed f-matching theorem is unweighted; no weighted guarantee is inferred unless the source algorithm explicitly supports weights. Source expansion bounds, identifiers and any supplied structural parameters remain required. Choosing unit capacities does not remove them. Set the capacity function f(v)=1 everywhere. The source objective, weight support and structural-input assumptions remain."
    },
    "auto-detail-6de5dbe727f3722164d2": {
      "kind": "detail",
      "label": "Source variant: Maximum f-matching; edges used at most once"
    },
    "auto-parameter-b51ad9c382afc1897d3d": {
      "kind": "parameter",
      "label": "Source result (pic-sublog-bmatching), evaluated on its transformed instance: Fixed ε > 0, L, and expansion function g.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.\n\nUnit multiplicity capacities: exact instance substitutions b=1, L=1."
    },
    "auto-assumption-ba292d44cd90c45cb53f": {
      "kind": "assumption",
      "label": "Source result (pic-sublog-bmatching), evaluated on its transformed instance: Positive integer capacities b; |b(u)−b(v)| ≤ L dist(u,v); L known.\n\nUnit multiplicity capacities: Set b(v)=1 at every vertex. This forces every edge multiplicity to be zero or one, and the feasible solutions and cardinality optimum equal ordinary matching. Unit capacities satisfy the source Lipschitz condition with L=1; supply that value if the algorithm requires it. The indexed result is unweighted and its expansion, identifiers and structural-parameter assumptions remain. No arbitrary weighted version is inferred. Set b(v)=1 everywhere and supply L=1 where the source asks for a Lipschitz bound. The source objective, weight support and structural-input assumptions remain."
    },
    "auto-detail-be2ee3bcd4a552afd1a8": {
      "kind": "detail",
      "label": "Source variant: Maximum b-matching; integer edge multiplicities"
    },
    "auto-parameter-4243edb366be8548a75b": {
      "kind": "parameter",
      "label": "Source result (pic-ass-sublog-refine), evaluated on its transformed instance: Fixed expansion class, ε > 0, c.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (pic-ass-sublog-refine), evaluated on its transformed instance: Fixed expansion class, ",
        {
          "math": "ε > 0"
        },
        ", c.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-a0adcc81a6a94e67a1c8": {
      "kind": "assumption",
      "label": "Source result (pic-ass-sublog-refine), evaluated on its transformed instance: A c-approximate dominating set is provided as input.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-b286c4976032037dd207": {
      "kind": "parameter",
      "label": "Source result (pic-ass-sublog-full), evaluated on its transformed instance: Fixed expansion class and ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (pic-ass-sublog-full), evaluated on its transformed instance: Fixed expansion class and ",
        {
          "math": "ε > 0"
        },
        ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-2423bbc3ae186b6c0251": {
      "kind": "assumption",
      "label": "Source result (pic-ass-sublog-full), evaluated on its transformed instance: \n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-c81ac640bcf6dd797870": {
      "kind": "parameter",
      "label": "Source result (pic-thesis-pathwidth-lower), evaluated on its transformed instance: Fixed excluded minor H and ε > 0; pw(H) is its pathwidth.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-8db585b7967f15e1d6c8": {
      "kind": "assumption",
      "label": "Source result (pic-thesis-pathwidth-lower), evaluated on its transformed instance: The number of rounds may depend arbitrarily on H, independently of n.\n\nClosed-neighborhood requests: Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags. Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination."
    },
    "auto-parameter-e1e8d0a35a054dedef76": {
      "kind": "parameter",
      "label": "Source result (pic-thesis-pathpower-lower), evaluated on its transformed instance: Fixed integer t ≥ 1; arbitrary round complexity f(t).\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-b24827fc82c679b4d0eb": {
      "kind": "assumption",
      "label": "Source result (pic-thesis-pathpower-lower), evaluated on its transformed instance: Witnesses allow extra degree-one vertices attached at one endpoint. Distinct identifiers in {1,…,|V(G)|}.\n\nClosed-neighborhood requests: Make every vertex a request and put C(v)=N[v]. Both endpoints know every physical incidence, and a vertex knows its self-incidence; no communication is needed to construct these flags. Set all costs to one for unweighted MDS; weighted MDS retains the chosen algorithm’s cost bounds. The optimum and output vertex set are preserved. The algorithm’s graph promise, randomness, weight encoding, identifiers and any global parameter knowledge remain required. T denotes the source algorithm’s round complexity on the displayed instance, with all of its parameters instantiated. Instantiate requests V and candidate sets C(v)=N[v]; unit costs give unweighted domination."
    },
    "auto-parameter-e9790360007ba7ff449a": {
      "kind": "parameter",
      "label": "Source result (pic-thesis-planar-205), evaluated on its transformed instance: \n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-9eb294b251a46ab9ce6c": {
      "kind": "assumption",
      "label": "Source result (pic-thesis-planar-205), evaluated on its transformed instance: Distinct identifiers; the algorithm uses local computation without a time bound.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-8ca3d5925c503f9a8f34": {
      "kind": "parameter",
      "label": "Source result (pic-thesis-genus-616), evaluated on its transformed instance: Fixed Euler genus bound g; the approximation ratio is independent of g.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-4adbaf03e6a810acabdd": {
      "kind": "assumption",
      "label": "Source result (pic-thesis-genus-616), evaluated on its transformed instance: Distinct identifiers; the class-dependent control function and genus bound determine the number of rounds.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-47819a7e8d9c09e581bf": {
      "kind": "parameter",
      "label": "Source result (pic-thesis-local-apex), evaluated on its transformed instance: Fixed d, g, a and sufficiently large fixed radius r, together with a fixed dimensional control function.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-503d86d8b8cea576d4ec": {
      "kind": "assumption",
      "label": "Source result (pic-thesis-local-apex), evaluated on its transformed instance: For every vertex, its induced radius-r ball becomes a graph of Euler genus at most g after deleting at most a vertices. The bound is for a class of asymptotic dimension at most d; its control function is fixed.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-6d3b55fa9bd0982d7651": {
      "kind": "parameter",
      "label": "Source result (pic-thesis-pw2-dom), evaluated on its transformed instance: Fixed excluded graph H with pw(H) ≤ 2. The approximation ratio is independent of H.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-9dd32f29169f9c39c172": {
      "kind": "assumption",
      "label": "Source result (pic-thesis-pw2-dom), evaluated on its transformed instance: Distinct identifiers. The excluded graph H is fixed, and the proof chooses H-dependent structural diameter thresholds.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-parameter-88557e30a3a34fe83792": {
      "kind": "parameter",
      "label": "Source result (pic-thesis-path-excluded-exact), evaluated on its transformed instance: Pₜ is the t-vertex path; fixed integer t ≥ 2.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (pic-thesis-path-excluded-exact), evaluated on its transformed instance: ",
        {
          "math": "Pₜ"
        },
        " is the t-vertex path; fixed integer ",
        {
          "math": "t ≥ 2"
        },
        ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-4874045a5887943fc598": {
      "kind": "assumption",
      "label": "Source result (pic-thesis-path-excluded-exact), evaluated on its transformed instance: Distinct identifiers and unrestricted LOCAL messages. Disconnected graphs are handled component by component.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT."
    },
    "auto-detail-fe19580c0e36745bb924": {
      "kind": "detail",
      "label": "Source variant: Unweighted; exact component optimum"
    },
    "auto-parameter-e6baeb8325eebdc9f0ba": {
      "kind": "parameter",
      "label": "Source result (folklore-tree-mds), evaluated on its transformed instance: At most one cycle per component; no degree bound.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    },
    "auto-assumption-effb829d587ccfd6a3f6": {
      "kind": "assumption",
      "label": "Source result (folklore-tree-mds), evaluated on its transformed instance: Unweighted pseudoforest; each vertex initially knows its own degree. One-bit broadcasts suffice; identifiers are unnecessary. Isolated vertices are selected, and both endpoints of a two-vertex component are selected.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.\n\nThe source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only."
    },
    "auto-detail-36479494074ad41ee009": {
      "kind": "detail",
      "label": "Source variant: Unweighted; non-leaf rule"
    },
    "auto-parameter-af4c082dcc79eba8a80c": {
      "kind": "parameter",
      "label": "Source result (folklore-degree-mds), evaluated on its transformed instance: Δ is the maximum degree; the algorithm need not know it.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.\n\nDomination on the line graph: exact instance substitutions n=m, Δ=Δ_L, m=m_L."
    },
    "auto-assumption-52f256415b7263f3baa1": {
      "kind": "assumption",
      "label": "Source result (folklore-degree-mds), evaluated on its transformed instance: Unweighted graphs. No identifiers, degree knowledge, or communication are needed.\n\nDomination on the line graph: A selected vertex of L(G) corresponds to the original edge. Feasibility and cardinality OPT agree; weighted transfer additionally requires an algorithm accepting the corresponding vertex weights. Assign each virtual edge-node to an endpoint. With unrestricted LOCAL messages, a virtual round routes through shared endpoints in at most two physical rounds; constant setup and output notification give O(T+1). The source algorithm must accept the line graph’s n′, Δ′, IDs and any supplied parameters. Obtaining global information is not free. A line graph can be much denser and need not preserve planarity: the line graph of a star is a clique. This recipe claims LOCAL only. Arbitrary different messages along virtual adjacencies can create congestion at physical edges, so an O(T) CONGEST simulation is not inferred. Exact algorithm substitutions use n′=m and Δ′=Δ_L, where Δ_L=max_{uv∈E(G)}(deg(u)+deg(v)−2). The displayed 2Δ−2 is an upper bound, not an exact substitution in a nonmonotone theorem. For simple G, m_L=sum_v binom(deg(v),2) is the exact number of edges of L(G). It is retained symbolically rather than replaced by a monotone upper bound. Apply the dominating-set algorithm to L(G); generic transfer is certified only from unrestricted general-graph LOCAL algorithms. Virtual line-graph rounds route through shared endpoints in at most two physical rounds. Retain global-input assumptions; setup and output notification are included. Here m=|E(G)| and Δ_L=max over uv∈E(G) of (deg(u)+deg(v)−2), the exact maximum degree of L(G); Δ_L≤2Δ−2. If m=0, return the empty edge set locally. For simple G, m_L=sum_v binom(deg(v),2) is the exact number of edges of L(G). It is retained symbolically rather than replaced by a monotone upper bound.\n\nThe source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only."
    },
    "auto-detail-609f5fa207e771a76a73": {
      "kind": "detail",
      "label": "Source variant: Unweighted; select all vertices"
    },
    "auto-parameter-a98fee40ff9def4f93d2": {
      "kind": "parameter",
      "label": "Source result (folklore-degree-mds), evaluated on its transformed instance: Δ is the maximum degree; the algorithm need not know it.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (folklore-degree-mds), evaluated on its transformed instance: ",
        {
          "math": "Δ"
        },
        " is the maximum degree; the algorithm need not know it.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-8de2c9a44dbb614c812e": {
      "kind": "assumption",
      "label": "Source result (folklore-degree-mds), evaluated on its transformed instance: Unweighted graphs. No identifiers, degree knowledge, or communication are needed.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.\n\nThe source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only."
    },
    "auto-parameter-5f6daa5e2fae4fedc9cf": {
      "kind": "parameter",
      "label": "Source result (folklore-star-minor-mds), evaluated on its transformed instance: Integer t ≥ 2; the algorithm need not know t.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.",
      "parts": [
        "Source result (folklore-star-minor-mds), evaluated on its transformed instance: Integer ",
        {
          "math": "t ≥ 2"
        },
        "; the algorithm need not know t.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
      ]
    },
    "auto-assumption-d7bc4e586d62a195bfd4": {
      "kind": "assumption",
      "label": "Source result (folklore-star-minor-mds), evaluated on its transformed instance: Unweighted. No identifiers, degree knowledge, or communication are needed.\n\nConnect a dominating set locally: The input is nonempty, connected and unweighted, and nodes have distinct identifiers. Run the source MDS algorithm on this same graph first. Three LOCAL rounds reveal radius-three neighborhoods including dominating-set flags. Nearest-dominator clusters, with identifier tie-breaking, have radius one; contracting them produces a connected depth-one minor H with |D| vertices. For each adjacent cluster pair choose one canonical dominator-to-dominator path of length at most three. In one more round its endpoints notify its at most two internal vertices. Return D and all selected internal vertices. The checked size count is |D′|≤|D|+2|E(H)|≤(1+2∇₁)|D|. As OPT_f(MDS)≤OPT_MDS≤OPT_CDS, integral or fractional MDS benchmarks can seed an integral-OPT_CDS guarantee; the original benchmark stays in source provenance. Planar shallow minors have density at most 3, giving multiplier 7. Forest and pseudoforest shallow minors have density at most 1, giving multiplier 3. These bounds also apply through the graph-class inclusion network. This connector uses unrestricted LOCAL messages. A CONGEST or Anonymous source algorithm can seed it in LOCAL with the necessary identifiers; the derived algorithm is labelled LOCAL. No four-round CONGEST/anonymous connector or lower-bound transfer is inferred. Clarification pending: preprint Lemma 16 states the stronger size bound 2d|D|. On P9, D={2,5,8} and valid depth-one density bound d=1 give 6, but every connected dominating set has size at least 7. The atlas therefore uses the independently checked 1+2∇₁ count. This example concerns the size lemma and does not itself refute Theorem 17’s approximation ratio. Connected unweighted input. Preserve source randomness, identifiers, parameter knowledge and initial-input conventions. The displayed target benchmark is integral OPT.\n\nThe source CONGEST algorithm is simulated in LOCAL; this reduction claims the resulting LOCAL bound only."
    }
  },
  "graphNotation": {
    "0 < ε < 1": [
      {
        "math": "0 < ε < 1"
      }
    ],
    "0 < ε < 1 may depend on n.": [
      {
        "math": "0 < ε < 1"
      },
      " may depend on n."
    ],
    "0 < ε < 1 may depend on n; constant δ > 0.": [
      {
        "math": "0 < ε < 1"
      },
      " may depend on n; constant δ > 0."
    ],
    "0 < ε < 1. Logs are truncated at constants; the source treats Δ ≤ 16 separately.": [
      {
        "math": "0 < ε < 1"
      },
      ". Logs are truncated at constants; the source treats ",
      {
        "math": "Δ"
      },
      " ≤ 16 separately."
    ],
    "0 < ε < 1/2": [
      {
        "math": "0 < ε < 1/2"
      }
    ],
    "0 < ε < 1/4": [
      {
        "math": "0 < ε < 1/4"
      }
    ],
    "0 < ε < 1; MM(N) is the round complexity of maximal matching on N vertices.": [
      {
        "math": "0 < ε < 1"
      },
      "; MM(N) is the round complexity of maximal matching on N vertices."
    ],
    "0 < ε < 1; fixed β, ε gives log-star rounds.": [
      {
        "math": "0 < ε < 1"
      },
      "; fixed ",
      {
        "math": "β"
      },
      ", ",
      {
        "math": "ε"
      },
      " gives log-star rounds."
    ],
    "0 < ε < 1; fixed β, ε gives logarithmic rounds.": [
      {
        "math": "0 < ε < 1"
      },
      "; fixed ",
      {
        "math": "β"
      },
      ", ",
      {
        "math": "ε"
      },
      " gives logarithmic rounds."
    ],
    "0 < ε < 1; the analysis fixes γ=0.001. All logarithms are truncated at constants.": [
      {
        "math": "0 < ε < 1"
      },
      "; the analysis fixes γ=0.001. All logarithms are truncated at constants."
    ],
    "0 < ε < 1; α is known. Δ is the maximum degree.": [
      {
        "math": "0 < ε < 1"
      },
      "; ",
      {
        "math": "α"
      },
      " is known. ",
      {
        "math": "Δ"
      },
      " is the maximum degree."
    ],
    "0 < ε < ε₀ for a positive constant ε₀.": [
      "0 < ",
      {
        "math": "ε"
      },
      " < ",
      {
        "math": "ε"
      },
      "₀ for a positive constant ",
      {
        "math": "ε"
      },
      "₀."
    ],
    "0 < ε = O(1); constant in n for fixed Δ, ε. Logs are truncated at constants.": [
      "0 < ",
      {
        "math": "ε"
      },
      " = O(1); constant in n for fixed ",
      {
        "math": "Δ"
      },
      ", ",
      {
        "math": "ε"
      },
      ". Logs are truncated at constants."
    ],
    "0 < ε ≤ 1": [
      {
        "math": "0 < ε ≤ 1"
      }
    ],
    "A fixed Euler-genus bound g, including nonorientable surfaces.": [
      "A fixed Euler-genus bound ",
      {
        "math": "g"
      },
      ", including nonorientable surfaces."
    ],
    "A fixed H-minor-free family excludes a sufficiently large clique subdivision.": [
      "A fixed ",
      {
        "math": "H"
      },
      "-minor-free family excludes a sufficiently large clique subdivision."
    ],
    "A fixed maximum degree D bounds depth-r density by D^(r+1).": [
      "A fixed maximum degree ",
      {
        "math": "D"
      },
      " bounds depth-",
      {
        "math": "r"
      },
      " density by ",
      {
        "math": "D^(r+1)"
      },
      "."
    ],
    "A subdivision of K8 contains a subdivision of K4,4; exclude K8.": [
      "A subdivision of ",
      {
        "math": "K8"
      },
      " contains a subdivision of ",
      {
        "math": "K4,4"
      },
      "; exclude ",
      {
        "math": "K8"
      },
      "."
    ],
    "A subdivision of nonplanar K4,4 cannot occur as a subgraph of a planar graph.": [
      "A subdivision of nonplanar ",
      {
        "math": "K4,4"
      },
      " cannot occur as a subgraph of a planar graph."
    ],
    "A vertex with t neighbors contains K1,t as a subgraph, hence as a minor. Exclusion implies maximum degree at most t−1.": [
      "A vertex with ",
      {
        "math": "t"
      },
      " neighbors contains ",
      {
        "math": "K1,t"
      },
      " as a subgraph, hence as a minor. Exclusion implies maximum degree at most ",
      {
        "math": "t−1"
      },
      "."
    ],
    "Algorithm need not know f(k)": [
      "Algorithm need not know ",
      {
        "math": "f(k)"
      }
    ],
    "Algorithms here quantify over every fixed excluded minor H. An inclusion may require choosing H; lower bounds are not universal in arbitrary H.": [
      "Algorithms here quantify over every fixed excluded minor ",
      {
        "math": "H"
      },
      ". An inclusion may require choosing ",
      {
        "math": "H"
      },
      "; lower bounds are not universal in arbitrary ",
      {
        "math": "H"
      },
      "."
    ],
    "Also applies to deterministic algorithms. Randomized lower bound concerns expected approximation with a fixed worst-case round budget. There are hard graph families; n and Δ are coupled by the construction, so this is not a guarantee for every independently prescribed pair (n, Δ).": [
      "Also applies to deterministic algorithms. Randomized lower bound concerns expected approximation with a fixed worst-case round budget. There are hard graph families; n and ",
      {
        "math": "Δ"
      },
      " are coupled by the construction, so this is not a guarantee for every independently prescribed pair (n, ",
      {
        "math": "Δ"
      },
      ")."
    ],
    "Always feasible; expected size ≤ (1+ε)OPT.": [
      "Always feasible; expected size ≤ (1+",
      {
        "math": "ε"
      },
      ")OPT."
    ],
    "Any fixed ε > 0.": [
      "Any fixed ",
      {
        "math": "ε > 0"
      },
      "."
    ],
    "Approximation independent of Δ": [
      "Approximation independent of ",
      {
        "math": "Δ"
      }
    ],
    "Arboricity 2": [
      "Arboricity ",
      {
        "math": "2"
      }
    ],
    "Arboricity at most 2": [
      "Arboricity at most ",
      {
        "math": "2"
      }
    ],
    "Arboricity β > 1": [
      "Arboricity ",
      {
        "math": "β > 1"
      }
    ],
    "Arboricity β ≥ 1": [
      "Arboricity ",
      {
        "math": "β ≥ 1"
      }
    ],
    "Arboricity ≤ α": [
      "Arboricity ",
      {
        "math": "≤ α"
      }
    ],
    "Asymptotic dimension d; r-locally Euler genus ≤ g": [
      "Asymptotic dimension ",
      {
        "math": "d"
      },
      "; ",
      {
        "math": "r"
      },
      "-locally Euler genus ",
      {
        "math": "≤ g"
      }
    ],
    "Asymptotic dimension d; r-locally Euler genus ≤ g with at most a apices": [
      "Asymptotic dimension ",
      {
        "math": "d"
      },
      "; ",
      {
        "math": "r"
      },
      "-locally Euler genus ",
      {
        "math": "≤ g"
      },
      " with at most ",
      {
        "math": "a"
      },
      " apices"
    ],
    "Asymptotic dimension d; radius-r balls of Euler genus ≤ g": [
      "Asymptotic dimension ",
      {
        "math": "d"
      },
      "; radius-",
      {
        "math": "r"
      },
      " balls of Euler genus ",
      {
        "math": "≤ g"
      }
    ],
    "Asymptotic dimension d; radius-r balls of Euler genus ≤ g with at most a apices": [
      "Asymptotic dimension ",
      {
        "math": "d"
      },
      "; radius-",
      {
        "math": "r"
      },
      " balls of Euler genus ",
      {
        "math": "≤ g"
      },
      " with at most ",
      {
        "math": "a"
      },
      " apices"
    ],
    "Asymptotic dimension d; sufficiently large-radius neighborhoods of Euler genus ≤ g": [
      "Asymptotic dimension ",
      {
        "math": "d"
      },
      "; sufficiently large-radius neighborhoods of Euler genus ",
      {
        "math": "≤ g"
      }
    ],
    "Bipartite graphs, Δ ≤ 3": [
      "Bipartite graphs, ",
      {
        "math": "Δ ≤ 3"
      }
    ],
    "Bipartite; Δ ≤ 3": [
      "Bipartite; ",
      {
        "math": "Δ ≤ 3"
      }
    ],
    "Bounded depth-one density and exclusion of a depth-one K3,t minor, as defined in the source.": [
      "Bounded depth-one density and exclusion of a depth-one ",
      {
        "math": "K3,t"
      },
      " minor, as defined in the source."
    ],
    "Bounded expansion together with the source’s girth ≥ 4r+2 or 4r+3 threshold.": [
      "Bounded expansion together with the source’s girth ",
      {
        "math": "≥ 4r+2"
      },
      " or ",
      {
        "math": "4r+3"
      },
      " threshold."
    ],
    "Bounded expansion; girth ≥ 4r + 2": [
      "Bounded expansion; girth ",
      {
        "math": "≥ 4r + 2"
      }
    ],
    "C,k,t known; includes bounded-degree minor-free classes.": [
      {
        "math": "C"
      },
      ",k,t known; includes bounded-degree minor-free classes."
    ],
    "Choose H=K2,t as the fixed excluded minor.": [
      "Choose ",
      {
        "math": "H=K2,t"
      },
      " as the fixed excluded minor."
    ],
    "Choose an excluded clique large enough for the fixed genus bound. This does not hold for every prescribed excluded H.": [
      "Choose an excluded clique large enough for the fixed genus bound. This does not hold for every prescribed excluded ",
      {
        "math": "H"
      },
      "."
    ],
    "Choose internal ε < 1/B for the exact-factor integrality step; knowing n and W suffices": [
      "Choose internal ",
      {
        "math": "ε < 1/B"
      },
      " for the exact-factor integrality step; knowing n and W suffices"
    ],
    "Choose the fixed excluded minor H=K1,t. This does not give every prescribed excluded-minor condition.": [
      "Choose the fixed excluded minor ",
      {
        "math": "H=K1,t"
      },
      ". This does not give every prescribed excluded-minor condition."
    ],
    "Choose the fixed excluded minor H=Pₜ. A path has pathwidth at most 1, hence at most 2.": [
      "Choose the fixed excluded minor ",
      {
        "math": "H=Pₜ"
      },
      ". A path has pathwidth at most 1, hence at most 2."
    ],
    "Common polynomial bound B ≥ nW": [
      "Common polynomial bound ",
      {
        "math": "B ≥ nW"
      }
    ],
    "Connected graphs of Euler genus ≤ g": [
      "Connected graphs of Euler genus ",
      {
        "math": "≤ g"
      }
    ],
    "Connected; Euler genus ≤ g": [
      "Connected; Euler genus ",
      {
        "math": "≤ g"
      }
    ],
    "Connected; diameter ≥ 4k": [
      "Connected; diameter ",
      {
        "math": "≥ 4k"
      }
    ],
    "Connected; k-hop expansion ≤ f(k); girth ≥ 4k + 3": [
      "Connected; ",
      {
        "math": "k"
      },
      "-hop expansion ",
      {
        "math": "≤ f(k)"
      },
      "; girth ",
      {
        "math": "≥ 4k + 3"
      }
    ],
    "Constant in n when Δ is fixed.": [
      "Constant in n when ",
      {
        "math": "Δ"
      },
      " is fixed."
    ],
    "Cycles of length at least 4r + 3": [
      "Cycles of length at least ",
      {
        "math": "4r + 3"
      }
    ],
    "Degeneracy ≤ d": [
      "Degeneracy ",
      {
        "math": "≤ d"
      }
    ],
    "Degree-3 bipartite": [
      "Degree-",
      {
        "math": "3"
      },
      " bipartite"
    ],
    "Diameter ≥ 4k": [
      "Diameter ",
      {
        "math": "≥ 4k"
      }
    ],
    "Distinct identifiers. The excluded graph H is fixed, and the proof chooses H-dependent structural diameter thresholds.": [
      "Distinct identifiers. The excluded graph ",
      {
        "math": "H"
      },
      " is fixed, and the proof chooses ",
      {
        "math": "H"
      },
      "-dependent structural diameter thresholds."
    ],
    "Drop the restriction excluding 4-cycles.": [
      "Drop the restriction excluding ",
      {
        "math": "4"
      },
      "-cycles."
    ],
    "Drop the restriction pw(H) ≤ 2 on the fixed excluded graph H. This inclusion does not instantiate an arbitrary prescribed excluded minor for a lower bound.": [
      "Drop the restriction ",
      {
        "math": "pw(H) ≤ 2"
      },
      " on the fixed excluded graph ",
      {
        "math": "H"
      },
      ". This inclusion does not instantiate an arbitrary prescribed excluded minor for a lower bound."
    ],
    "Euler genus ≤ e": [
      "Euler genus ",
      {
        "math": "≤ e"
      }
    ],
    "Euler genus ≤ g": [
      "Euler genus ",
      {
        "math": "≤ g"
      }
    ],
    "Euler genus ≤ g plus at most a apices": [
      "Euler genus ",
      {
        "math": "≤ g"
      },
      " plus at most ",
      {
        "math": "a"
      },
      " apices"
    ],
    "Euler genus ≤ g; at most a apices": [
      "Euler genus ",
      {
        "math": "≤ g"
      },
      "; at most ",
      {
        "math": "a"
      },
      " apices"
    ],
    "Even integer d ≥ 2": [
      "Even integer ",
      {
        "math": "d ≥ 2"
      }
    ],
    "Every minor H satisfies |E(H)| ≤ a|V(H)|": [
      "Every minor ",
      {
        "math": "H"
      },
      " satisfies ",
      {
        "math": "|E(H)| ≤ a|V(H)|"
      }
    ],
    "Every minor H satisfies |E(H)| ≤ ρ|V(H)|": [
      "Every minor ",
      {
        "math": "H"
      },
      " satisfies ",
      {
        "math": "|E(H)| ≤ ρ|V(H)|"
      }
    ],
    "Every radius-r induced ball lies in the Euler-genus-g class.": [
      "Every radius-",
      {
        "math": "r"
      },
      " induced ball lies in the Euler-genus-",
      {
        "math": "g"
      },
      " class."
    ],
    "Excluded Kₕ minor": [
      "Excluded ",
      {
        "math": "Kₕ"
      },
      " minor"
    ],
    "Excluded clique minor plus the theorem’s γ₁(G) ≤ Cγₖ(G) condition.": [
      "Excluded clique minor plus the theorem’s ",
      {
        "math": "γ₁(G) ≤ Cγₖ(G)"
      },
      " condition."
    ],
    "Excluded topological Kₕ": [
      "Excluded topological ",
      {
        "math": "Kₕ"
      }
    ],
    "Expansion f(r)=o(log r); this includes every fixed-minor-free family.": [
      "Expansion ",
      {
        "math": "f(r)=o(log r)"
      },
      "; this includes every fixed-minor-free family."
    ],
    "Expansion f; girth ≥ 4r + 3": [
      "Expansion ",
      {
        "math": "f"
      },
      "; girth ",
      {
        "math": "≥ 4r + 3"
      }
    ],
    "Feasible locally known candidates C(r) ⊆ N[r]": [
      "Feasible locally known candidates ",
      {
        "math": "C"
      },
      "(r) ⊆ N[r]"
    ],
    "Fixed 0 < ε < 1.": [
      "Fixed ",
      {
        "math": "0 < ε < 1"
      },
      "."
    ],
    "Fixed 0 < ε < 1/4.": [
      "Fixed ",
      {
        "math": "0 < ε < 1/4"
      },
      "."
    ],
    "Fixed C,k,t,ε; 0 < ε < 1.": [
      "Fixed ",
      {
        "math": "C"
      },
      ",k,t,",
      {
        "math": "ε"
      },
      "; ",
      {
        "math": "0 < ε < 1"
      },
      "."
    ],
    "Fixed Euler genus bound g; the approximation ratio is independent of g.": [
      "Fixed Euler genus bound ",
      {
        "math": "g"
      },
      "; the approximation ratio is independent of g."
    ],
    "Fixed Euler genus g and ε > 0.": [
      "Fixed Euler genus g and ",
      {
        "math": "ε > 0"
      },
      "."
    ],
    "Fixed Euler genus g and ε.": [
      "Fixed Euler genus g and ",
      {
        "math": "ε"
      },
      "."
    ],
    "Fixed arboricity α": [
      "Fixed arboricity ",
      {
        "math": "α"
      }
    ],
    "Fixed c ≥ 1; logs truncated at constants.": [
      "Fixed c ",
      {
        "math": "≥ 1"
      },
      "; logs truncated at constants."
    ],
    "Fixed class 𝒞 and ε.": [
      "Fixed class 𝒞 and ",
      {
        "math": "ε"
      },
      "."
    ],
    "Fixed class 𝒞 and ε; a(𝒞) = sup |E|/|V|.": [
      "Fixed class 𝒞 and ",
      {
        "math": "ε"
      },
      "; a(𝒞) = sup |E|/|V|."
    ],
    "Fixed d, g, a and sufficiently large fixed radius r, together with a fixed dimensional control function.": [
      "Fixed d, ",
      {
        "math": "g"
      },
      ", ",
      {
        "math": "a"
      },
      " and sufficiently large fixed radius ",
      {
        "math": "r"
      },
      ", together with a fixed dimensional control function."
    ],
    "Fixed d,g and sufficiently large fixed radius r.": [
      "Fixed d,g and sufficiently large fixed radius ",
      {
        "math": "r"
      },
      "."
    ],
    "Fixed excluded graph H with pw(H) ≤ 2. The approximation ratio is independent of H.": [
      "Fixed excluded graph ",
      {
        "math": "H"
      },
      " with ",
      {
        "math": "pw(H) ≤ 2"
      },
      ". The approximation ratio is independent of ",
      {
        "math": "H"
      },
      "."
    ],
    "Fixed excluded minor H": [
      "Fixed excluded minor ",
      {
        "math": "H"
      }
    ],
    "Fixed excluded minor H and ε > 0; pw(H) is its pathwidth.": [
      "Fixed excluded minor ",
      {
        "math": "H"
      },
      " and ",
      {
        "math": "ε > 0"
      },
      "; ",
      {
        "math": "pw(H)"
      },
      " is its pathwidth."
    ],
    "Fixed excluded minor and 0 < ε < 1.": [
      "Fixed excluded minor and ",
      {
        "math": "0 < ε < 1"
      },
      "."
    ],
    "Fixed expansion class and ε > 0.": [
      "Fixed expansion class and ",
      {
        "math": "ε > 0"
      },
      "."
    ],
    "Fixed expansion class, ε > 0, c.": [
      "Fixed expansion class, ",
      {
        "math": "ε > 0"
      },
      ", c."
    ],
    "Fixed g and a; fixed ε > 0.": [
      "Fixed g and a; fixed ",
      {
        "math": "ε > 0"
      },
      "."
    ],
    "Fixed g and k ≥ 2.": [
      "Fixed g and ",
      {
        "math": "k ≥ 2"
      },
      "."
    ],
    "Fixed genus g and ε > 0.": [
      "Fixed genus g and ",
      {
        "math": "ε > 0"
      },
      "."
    ],
    "Fixed growth polynomial and ε > 0; T_MIS is an MIS subroutine’s time.": [
      "Fixed growth polynomial and ",
      {
        "math": "ε > 0"
      },
      "; T_MIS is an MIS subroutine’s time."
    ],
    "Fixed h and ε > 0.": [
      "Fixed h and ",
      {
        "math": "ε > 0"
      },
      "."
    ],
    "Fixed integer b ≥ 1 and ε > 0": [
      "Fixed integer ",
      {
        "math": "b ≥ 1"
      },
      " and ",
      {
        "math": "ε > 0"
      }
    ],
    "Fixed integer distance k ≥ 1 and Euler genus bound g. The approximation ratio is independent of g.": [
      "Fixed integer distance ",
      {
        "math": "k ≥ 1"
      },
      " and Euler genus bound ",
      {
        "math": "g"
      },
      ". The approximation ratio is independent of g."
    ],
    "Fixed integer distance k ≥ 1.": [
      "Fixed integer distance ",
      {
        "math": "k ≥ 1"
      },
      "."
    ],
    "Fixed integer k; exponent D depends on k.": [
      "Fixed integer k; exponent ",
      {
        "math": "D"
      },
      " depends on k."
    ],
    "Fixed integer r ≥ 1; ε > 0 is a gap below 2r + 1. The excluded round complexity may depend on r and ε, but not on n.": [
      "Fixed integer ",
      {
        "math": "r ≥ 1"
      },
      "; ",
      {
        "math": "ε > 0"
      },
      " is a gap below 2r + 1. The excluded round complexity may depend on r and ",
      {
        "math": "ε"
      },
      ", but not on n."
    ],
    "Fixed integer t ≥ 1; arbitrary round complexity f(t).": [
      "Fixed integer ",
      {
        "math": "t ≥ 1"
      },
      "; arbitrary round complexity f(t)."
    ],
    "Fixed integer t ≥ 2": [
      "Fixed integer ",
      {
        "math": "t ≥ 2"
      }
    ],
    "Fixed integer t ≥ 2.": [
      "Fixed integer ",
      {
        "math": "t ≥ 2"
      },
      "."
    ],
    "Fixed integer upper bound ∇₁ > 0 on the edge density of depth-1 minors. Both the approximation ratio and round complexity depend on ∇₁.": [
      "Fixed integer upper bound ",
      {
        "math": "∇₁ > 0"
      },
      " on the edge density of depth-1 minors. Both the approximation ratio and round complexity depend on ",
      {
        "math": "∇₁"
      },
      "."
    ],
    "Fixed k ≥ 2 and g.": [
      "Fixed ",
      {
        "math": "k ≥ 2"
      },
      " and g."
    ],
    "Fixed k ≥ 2 and ε > 0.": [
      "Fixed ",
      {
        "math": "k ≥ 2"
      },
      " and ",
      {
        "math": "ε > 0"
      },
      "."
    ],
    "Fixed k ≥ 2, g and ε > 0.": [
      "Fixed ",
      {
        "math": "k ≥ 2"
      },
      ", g and ",
      {
        "math": "ε > 0"
      },
      "."
    ],
    "Fixed k ≥ 3.": [
      "Fixed ",
      {
        "math": "k ≥ 3"
      },
      "."
    ],
    "Fixed k,t and 0 < ε < 1.": [
      "Fixed k,t and ",
      {
        "math": "0 < ε < 1"
      },
      "."
    ],
    "Fixed mad bound d, shallow-minor density ∇₁, ε.": [
      "Fixed mad bound d, shallow-minor density ",
      {
        "math": "∇₁"
      },
      ", ",
      {
        "math": "ε"
      },
      "."
    ],
    "Fixed pattern H (the paper permits some larger patterns).": [
      "Fixed pattern ",
      {
        "math": "H"
      },
      " (the paper permits some larger patterns)."
    ],
    "Fixed radius r and expansion function f.": [
      "Fixed radius ",
      {
        "math": "r"
      },
      " and expansion function f."
    ],
    "Fixed rational a ≥ 1": [
      "Fixed rational ",
      {
        "math": "a ≥ 1"
      }
    ],
    "Fixed rational ρ ≥ 1, integer b ≥ 1 and ε > 0": [
      "Fixed rational ",
      {
        "math": "ρ ≥ 1"
      },
      ", integer ",
      {
        "math": "b ≥ 1"
      },
      " and ",
      {
        "math": "ε > 0"
      }
    ],
    "Fixed Δ and ε give O(log* n).": [
      "Fixed ",
      {
        "math": "Δ"
      },
      " and ",
      {
        "math": "ε"
      },
      " give O(log* n)."
    ],
    "Fixed Δ and ε.": [
      "Fixed ",
      {
        "math": "Δ"
      },
      " and ",
      {
        "math": "ε"
      },
      "."
    ],
    "Fixed Δ gives O(log* n).": [
      "Fixed ",
      {
        "math": "Δ"
      },
      " gives O(log* n)."
    ],
    "Fixed Δ ≥ 2.": [
      "Fixed ",
      {
        "math": "Δ"
      },
      " ≥ 2."
    ],
    "Fixed Δ, W and ε give O(log* n).": [
      "Fixed ",
      {
        "math": "Δ"
      },
      ", W and ",
      {
        "math": "ε"
      },
      " give O(log* n)."
    ],
    "Fixed Δ, W, ε, δ give O(log* n).": [
      "Fixed ",
      {
        "math": "Δ"
      },
      ", W, ",
      {
        "math": "ε"
      },
      ", δ give O(log* n)."
    ],
    "Fixed Δ, ε and positive w_min give O(log* n).": [
      "Fixed ",
      {
        "math": "Δ"
      },
      ", ",
      {
        "math": "ε"
      },
      " and positive w_min give O(log* n)."
    ],
    "Fixed α and 0 < ε < 1.": [
      "Fixed ",
      {
        "math": "α"
      },
      " and ",
      {
        "math": "0 < ε < 1"
      },
      "."
    ],
    "Fixed α ≥ 2": [
      "Fixed ",
      {
        "math": "α ≥ 2"
      }
    ],
    "Fixed ε": [
      "Fixed ",
      {
        "math": "ε"
      }
    ],
    "Fixed ε > 0 and expansion function g.": [
      "Fixed ",
      {
        "math": "ε > 0"
      },
      " and expansion function g."
    ],
    "Fixed ε > 0, L, and expansion function g.": [
      "Fixed ",
      {
        "math": "ε > 0"
      },
      ", L, and expansion function g."
    ],
    "Fixed ε > 0.": [
      "Fixed ",
      {
        "math": "ε > 0"
      },
      "."
    ],
    "Fixed ε > 0; clique size unbounded.": [
      "Fixed ",
      {
        "math": "ε > 0"
      },
      "; clique size unbounded."
    ],
    "Fixed ε > 0; logs truncated at constants.": [
      "Fixed ",
      {
        "math": "ε > 0"
      },
      "; logs truncated at constants."
    ],
    "Fixed ε > 0; only online rounds are counted.": [
      "Fixed ",
      {
        "math": "ε > 0"
      },
      "; only online rounds are counted."
    ],
    "Fixed ε > 0; r > 1 and r = o(log* n).": [
      "Fixed ",
      {
        "math": "ε > 0"
      },
      "; ",
      {
        "math": "r > 1"
      },
      " and r = o(log* n)."
    ],
    "Fixed ε > 0; the round complexity depends on ε.": [
      "Fixed ",
      {
        "math": "ε > 0"
      },
      "; the round complexity depends on ",
      {
        "math": "ε"
      },
      "."
    ],
    "Fixed-minor-free families have constant shallow-minor density, hence o(log r) expansion.": [
      "Fixed-minor-free families have constant shallow-minor density, hence ",
      {
        "math": "o(log r)"
      },
      " expansion."
    ],
    "For 0 < ε ≤ 1, the round complexity is O((d/ε)²) and independent of n and maximum degree": [
      "For ",
      {
        "math": "0 < ε ≤ 1"
      },
      ", the round complexity is O((d/",
      {
        "math": "ε"
      },
      ")²) and independent of n and maximum degree"
    ],
    "For every vertex, its induced radius-r ball becomes a graph of Euler genus at most g after deleting at most a vertices. The bound is for a class of asymptotic dimension at most d; its control function is fixed.": [
      "For every vertex, its induced radius-",
      {
        "math": "r"
      },
      " ball becomes a graph of Euler genus at most ",
      {
        "math": "g"
      },
      " after deleting at most ",
      {
        "math": "a"
      },
      " vertices. The bound is for a class of asymptotic dimension at most ",
      {
        "math": "d"
      },
      "; its control function is fixed."
    ],
    "For fixed g and a, every radius-r ball inherits the Euler-genus-g plus a-apex condition. This global class excludes K_{3+a,2g+3+a}, so it has asymptotic dimension at most d=2 with a class-fixed control function. Retain the same fixed g, a and a sufficiently large r.": [
      "For fixed ",
      {
        "math": "g"
      },
      " and ",
      {
        "math": "a"
      },
      ", every radius-",
      {
        "math": "r"
      },
      " ball inherits the Euler-genus-",
      {
        "math": "g"
      },
      " plus ",
      {
        "math": "a"
      },
      "-apex condition. This global class excludes ",
      {
        "math": "K_{3+a,2g+3+a}"
      },
      ", so it has asymptotic dimension at most ",
      {
        "math": "d"
      },
      "=2 with a class-fixed control function. Retain the same fixed ",
      {
        "math": "g"
      },
      ", ",
      {
        "math": "a"
      },
      " and a sufficiently large ",
      {
        "math": "r"
      },
      "."
    ],
    "For fixed r this excludes constant-round algorithms.": [
      "For fixed ",
      {
        "math": "r"
      },
      " this excludes constant-round algorithms."
    ],
    "Global Δ unnecessary": [
      "Global ",
      {
        "math": "Δ"
      },
      " unnecessary"
    ],
    "Graph classes of asymptotic dimension at most d with a fixed dimensional control function, where deleting at most a vertices from each induced radius-r ball leaves Euler genus at most g, for a sufficiently large fixed radius r. This is a local condition and does not assert global minor exclusion.": [
      "Graph classes of asymptotic dimension at most ",
      {
        "math": "d"
      },
      " with a fixed dimensional control function, where deleting at most ",
      {
        "math": "a"
      },
      " vertices from each induced radius-",
      {
        "math": "r"
      },
      " ball leaves Euler genus at most ",
      {
        "math": "g"
      },
      ", for a sufficiently large fixed radius ",
      {
        "math": "r"
      },
      ". This is a local condition and does not assert global minor exclusion."
    ],
    "Graph classes of asymptotic dimension d with a fixed control function, where every induced radius-r ball has Euler genus at most g for a sufficiently large fixed radius r.": [
      "Graph classes of asymptotic dimension ",
      {
        "math": "d"
      },
      " with a fixed control function, where every induced radius-",
      {
        "math": "r"
      },
      " ball has Euler genus at most ",
      {
        "math": "g"
      },
      " for a sufficiently large fixed radius ",
      {
        "math": "r"
      },
      "."
    ],
    "Graphs containing no subdivision of K4,4.": [
      "Graphs containing no subdivision of ",
      {
        "math": "K4,4"
      },
      "."
    ],
    "Graphs excluding K₂,t as a minor for a fixed integer t≥2. Since pw(K₂,t)=2, these are included in the H-minor-free family with pw(H)≤2 by taking H=K₂,t.": [
      "Graphs excluding ",
      {
        "math": "K₂,t"
      },
      " as a minor for a fixed integer ",
      {
        "math": "t≥2"
      },
      ". Since ",
      {
        "math": "pw(K₂,t)=2"
      },
      ", these are included in the ",
      {
        "math": "H"
      },
      "-minor-free family with ",
      {
        "math": "pw(H)≤2"
      },
      " by taking ",
      {
        "math": "H=K₂,t"
      },
      "."
    ],
    "Graphs excluding a fixed graph H whose pathwidth is at most 2. The pathwidth condition is on the excluded minor H, not on the input graph; the input graph can have arbitrarily large pathwidth.": [
      "Graphs excluding a fixed graph ",
      {
        "math": "H"
      },
      " whose pathwidth is at most 2. The pathwidth condition is on the excluded minor ",
      {
        "math": "H"
      },
      ", not on the input graph; the input graph can have arbitrarily large pathwidth."
    ],
    "Graphs excluding the fixed star K1,t as a minor. Their maximum degree is at most t−1; bounded degree alone does not exclude a large star minor.": [
      "Graphs excluding the fixed star ",
      {
        "math": "K1,t"
      },
      " as a minor. Their maximum degree is at most ",
      {
        "math": "t−1"
      },
      "; bounded degree alone does not exclude a large star minor."
    ],
    "Graphs excluding the path on t vertices as a minor, for fixed t. Every connected component has bounded diameter; disconnected inputs are handled componentwise.": [
      "Graphs excluding the path on ",
      {
        "math": "t"
      },
      " vertices as a minor, for fixed ",
      {
        "math": "t"
      },
      ". Every connected component has bounded diameter; disconnected inputs are handled componentwise."
    ],
    "Graphs of maximum degree Δ": [
      "Graphs of maximum degree ",
      {
        "math": "Δ"
      }
    ],
    "H = K₂,t": [
      {
        "math": "H = K₂,t"
      }
    ],
    "H is a fixed excluded minor with pw(H) ≤ 2; the input graph need not have pathwidth at most 2.": [
      {
        "math": "H"
      },
      " is a fixed excluded minor with ",
      {
        "math": "pw(H) ≤ 2"
      },
      "; the input graph need not have pathwidth at most 2."
    ],
    "H-minor-free graphs": [
      {
        "math": "H"
      },
      "-minor-free graphs"
    ],
    "H-minor-free with excluded minor of pathwidth at most 2": [
      {
        "math": "H"
      },
      "-minor-free with excluded minor of pathwidth at most 2"
    ],
    "H-minor-free; pw(H) <= 2": [
      {
        "math": "H"
      },
      "-minor-free; ",
      {
        "math": "pw(H) <= 2"
      }
    ],
    "H-minor-free; pw(H) ≤ 2": [
      {
        "math": "H"
      },
      "-minor-free; ",
      {
        "math": "pw(H) ≤ 2"
      }
    ],
    "High-girth k-hop expansion": [
      "High-girth ",
      {
        "math": "k"
      },
      "-hop expansion"
    ],
    "In n; fixed H, ε": [
      "In ",
      {
        "math": "n"
      },
      "; fixed ",
      {
        "math": "H"
      },
      ", ",
      {
        "math": "ε"
      }
    ],
    "In n; fixed α, ε": [
      "In ",
      {
        "math": "n"
      },
      "; fixed ",
      {
        "math": "α"
      },
      ", ",
      {
        "math": "ε"
      }
    ],
    "In n; fixed ε": [
      "In ",
      {
        "math": "n"
      },
      "; fixed ",
      {
        "math": "ε"
      }
    ],
    "In n; fixed ε and expansion": [
      "In ",
      {
        "math": "n"
      },
      "; fixed ",
      {
        "math": "ε"
      },
      " and expansion"
    ],
    "In n; fixed ε, L and expansion": [
      "In ",
      {
        "math": "n"
      },
      "; fixed ",
      {
        "math": "ε"
      },
      ", L and expansion"
    ],
    "In n; fixed ρ, b, ε": [
      "In ",
      {
        "math": "n"
      },
      "; fixed ",
      {
        "math": "ρ, b, ε"
      }
    ],
    "Incidence graphs; set size ≤ k, frequency ≤ f": [
      "Incidence graphs; set size ",
      {
        "math": "≤ k"
      },
      ", frequency ",
      {
        "math": "≤ f"
      }
    ],
    "Instantiate the fixed excluded graph as H=K₂,t, for t≥2. Bags {u,v,w_i}, one for each vertex w_i in the t-side, give pathwidth at most two; the 4-cycle minor gives equality. This is a specialization of excluded-minor settings, not a bound on the input graph’s pathwidth.": [
      "Instantiate the fixed excluded graph as ",
      {
        "math": "H=K₂,t"
      },
      ", for ",
      {
        "math": "t≥2"
      },
      ". Bags ",
      {
        "math": "{u,v,w_i}"
      },
      ", one for each vertex ",
      {
        "math": "w_i"
      },
      " in the ",
      {
        "math": "t"
      },
      "-side, give pathwidth at most two; the 4-cycle minor gives equality. This is a specialization of excluded-minor settings, not a bound on the input graph’s pathwidth."
    ],
    "Integer a ≥ 1": [
      "Integer ",
      {
        "math": "a ≥ 1"
      }
    ],
    "Integer a ≥ 2": [
      "Integer ",
      {
        "math": "a ≥ 2"
      }
    ],
    "Integer r ≥ 1": [
      "Integer ",
      {
        "math": "r ≥ 1"
      }
    ],
    "Integer t ≥ 1": [
      "Integer ",
      {
        "math": "t ≥ 1"
      }
    ],
    "Integer t ≥ 2; rounds independent of t.": [
      "Integer ",
      {
        "math": "t ≥ 2"
      },
      "; rounds independent of t."
    ],
    "Integer t ≥ 2; the algorithm need not know t.": [
      "Integer ",
      {
        "math": "t ≥ 2"
      },
      "; the algorithm need not know t."
    ],
    "Isolate-free; every minor H has |E(H)| ≤ a|V(H)|": [
      "Isolate-free; every minor ",
      {
        "math": "H"
      },
      " has ",
      {
        "math": "|E(H)| ≤ a|V(H)|"
      }
    ],
    "K1,t-minor-free": [
      {
        "math": "K1,t"
      },
      "-minor-free"
    ],
    "K2,t": [
      {
        "math": "K2,t"
      }
    ],
    "K2t": [
      {
        "math": "K2t"
      }
    ],
    "K_{2,t}": [
      {
        "math": "K_{2,t}"
      }
    ],
    "K_{2,t}-minor-free": [
      {
        "math": "K_{2,t}"
      },
      "-minor-free"
    ],
    "Known C, k, t; domination constraint": [
      "Known ",
      {
        "math": "C"
      },
      ", ",
      {
        "math": "k"
      },
      ", ",
      {
        "math": "t"
      },
      "; domination constraint"
    ],
    "Known integer c ≥ ∇₁(G)": [
      "Known integer ",
      {
        "math": "c ≥ ∇₁(G)"
      }
    ],
    "Known n": [
      "Known ",
      {
        "math": "n"
      }
    ],
    "Known n and Δ": [
      "Known ",
      {
        "math": "n"
      },
      " and ",
      {
        "math": "Δ"
      }
    ],
    "Known n, Δ and graph parameters": [
      "Known ",
      {
        "math": "n"
      },
      ", ",
      {
        "math": "Δ"
      },
      " and graph parameters"
    ],
    "Known upper bound ∇₁ on the edge density of depth-1 minors; t is the least integer such that Kₜ,ₜ is absent as a subgraph, with t ≤ 2∇₁ + 1. The approximation ratio depends on these parameters; the number of LOCAL communication rounds is universally bounded.": [
      "Known upper bound ",
      {
        "math": "∇₁"
      },
      " on the edge density of depth-1 minors; t is the least integer such that ",
      {
        "math": "Kₜ"
      },
      ",ₜ is absent as a subgraph, with t ≤ 2",
      {
        "math": "∇₁"
      },
      " + 1. The approximation ratio depends on these parameters; the number of LOCAL communication rounds is universally bounded."
    ],
    "Known Δ": [
      "Known ",
      {
        "math": "Δ"
      }
    ],
    "Known Δ and a common polynomial bound B ≥ nW": [
      "Known ",
      {
        "math": "Δ"
      },
      " and a common polynomial bound ",
      {
        "math": "B ≥ nW"
      }
    ],
    "Known Δ or a polynomial upper bound": [
      "Known ",
      {
        "math": "Δ"
      },
      " or a polynomial upper bound"
    ],
    "Known Δ or a polynomial upper bound; common polynomial bound B ≥ nW": [
      "Known ",
      {
        "math": "Δ"
      },
      " or a polynomial upper bound; common polynomial bound ",
      {
        "math": "B ≥ nW"
      }
    ],
    "K₁,ₜ-minor-free": [
      {
        "math": "K₁,ₜ"
      },
      "-minor-free"
    ],
    "K₂,t-minor-free": [
      {
        "math": "K₂,t"
      },
      "-minor-free"
    ],
    "K₂,ₜ-minor-free": [
      {
        "math": "K₂,ₜ"
      },
      "-minor-free"
    ],
    "K₃,ₜ excluded as a depth-1 minor (t ≥ 3)": [
      {
        "math": "K₃,ₜ"
      },
      " excluded as a depth-1 minor (",
      {
        "math": "t ≥ 3"
      },
      ")"
    ],
    "Kₜ-minor-free; γ₁(G) ≤ Cγₖ(G)": [
      {
        "math": "Kₜ"
      },
      "-minor-free; ",
      {
        "math": "γ₁(G) ≤ Cγₖ(G)"
      }
    ],
    "Maximum degree ≤ Δ": [
      "Maximum degree ",
      {
        "math": "≤ Δ"
      }
    ],
    "Messages ≤ ⌈log Δ⌉ bits": [
      "Messages ",
      {
        "math": "≤ ⌈log Δ⌉"
      },
      " bits"
    ],
    "No K₄,₄ subdivision": [
      "No ",
      {
        "math": "K₄,₄"
      },
      " subdivision"
    ],
    "No odd cycles of lengths 3, 5, …, 2k − 1": [
      "No odd cycles of lengths ",
      {
        "math": "3, 5, …, 2k − 1"
      }
    ],
    "No odd cycles of lengths 3,5,…,2k−1 for the stated k.": [
      "No odd cycles of lengths ",
      {
        "math": "3,5,…,2k−1"
      },
      " for the stated ",
      {
        "math": "k"
      },
      "."
    ],
    "No subdivision of K₄,₄": [
      "No subdivision of ",
      {
        "math": "K₄,₄"
      }
    ],
    "Nonplanar excluded minor H": [
      "Nonplanar excluded minor ",
      {
        "math": "H"
      }
    ],
    "Nonzero normalized coefficients Aᵢⱼ ≥ 1": [
      "Nonzero normalized coefficients ",
      {
        "math": "Aᵢⱼ ≥ 1"
      }
    ],
    "One may take c=⌈∇₁(G)⌉ if this value is supplied. A larger known integer upper bound is also allowed; the guarantee uses the supplied c.": [
      "One may take ",
      {
        "math": "c=⌈∇₁(G)⌉"
      },
      " if this value is supplied. A larger known integer upper bound is also allowed; the guarantee uses the supplied c."
    ],
    "Orientable genus at most g; both the approximation ratio and the number of communication rounds depend linearly on g.": [
      "Orientable genus at most ",
      {
        "math": "g"
      },
      "; both the approximation ratio and the number of communication rounds depend linearly on g."
    ],
    "Orientable genus h implies Euler genus g ≤ 2h; parameter bounds must be compatible.": [
      "Orientable genus ",
      {
        "math": "h"
      },
      " implies Euler genus ",
      {
        "math": "g ≤ 2h"
      },
      "; parameter bounds must be compatible."
    ],
    "Orientable genus ≤ g": [
      "Orientable genus ",
      {
        "math": "≤ g"
      }
    ],
    "Outputs an estimate of ρ*(v) at each vertex; not directly a selected densest subgraph.": [
      "Outputs an estimate of ",
      {
        "math": "ρ"
      },
      "*(v) at each vertex; not directly a selected densest subgraph."
    ],
    "P_t-minor-free": [
      {
        "math": "P_t"
      },
      "-minor-free"
    ],
    "P_{t}-minor-free": [
      {
        "math": "P_{t}"
      },
      "-minor-free"
    ],
    "Planar without 4-cycles": [
      "Planar without ",
      {
        "math": "4"
      },
      "-cycles"
    ],
    "Positive integer costs ≤ b": [
      "Positive integer costs ",
      {
        "math": "≤ b"
      }
    ],
    "Positive integer weights W ≤ n^O(1)": [
      "Positive integer weights ",
      {
        "math": "W ≤ n^O(1)"
      }
    ],
    "Positive integer weights ≤ W": [
      "Positive integer weights ",
      {
        "math": "≤ W"
      }
    ],
    "Positive integer weights ≤ W; bounded f,k,W gives constant rounds.": [
      "Positive integer weights ",
      {
        "math": "≤ W"
      },
      "; bounded f,k,W gives constant rounds."
    ],
    "Pₜ is the t-vertex path; fixed integer t ≥ 2.": [
      {
        "math": "Pₜ"
      },
      " is the t-vertex path; fixed integer ",
      {
        "math": "t ≥ 2"
      },
      "."
    ],
    "Pₜ-minor-free": [
      {
        "math": "Pₜ"
      },
      "-minor-free"
    ],
    "Radius k; arbitrary Δ.": [
      "Radius k; arbitrary ",
      {
        "math": "Δ"
      },
      "."
    ],
    "Rational a ≥ 1": [
      "Rational ",
      {
        "math": "a ≥ 1"
      }
    ],
    "Regular graphs, degree ≥ 1": [
      "Regular graphs, degree ",
      {
        "math": "≥ 1"
      }
    ],
    "Regular; degree ≥ 1": [
      "Regular; degree ",
      {
        "math": "≥ 1"
      }
    ],
    "Requests V with C(v)=N[v]": [
      "Requests V with ",
      {
        "math": "C"
      },
      "(v)=N[v]"
    ],
    "Retain fixed d, g, a, a sufficiently large radius r, and the class-dimensional control function; the deletion set of at most a apices may differ between balls.": [
      "Retain fixed d, g, a, a sufficiently large radius ",
      {
        "math": "r"
      },
      ", and the class-dimensional control function; the deletion set of at most ",
      {
        "math": "a"
      },
      " apices may differ between balls."
    ],
    "Retains connectivity, the precise k-hop expansion definition, and girth threshold.": [
      "Retains connectivity, the precise ",
      {
        "math": "k"
      },
      "-hop expansion definition, and girth threshold."
    ],
    "Section 4 gives separate unknown-Δ variants and parameter choices": [
      "Section 4 gives separate unknown-",
      {
        "math": "Δ"
      },
      " variants and parameter choices"
    ],
    "Source result (amiri-genus-ptas), evaluated on its transformed instance: Fixed genus g and ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (amiri-genus-ptas), evaluated on its transformed instance: Fixed genus g and ",
      {
        "math": "ε > 0"
      },
      ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Source result (czygrinow-minor-ptas), evaluated on its transformed instance: Fixed h and ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (czygrinow-minor-ptas), evaluated on its transformed instance: Fixed h and ",
      {
        "math": "ε > 0"
      },
      ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Source result (dory-arboricity-lower), evaluated on its transformed instance: Δ is the maximum degree.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (dory-arboricity-lower), evaluated on its transformed instance: ",
      {
        "math": "Δ"
      },
      " is the maximum degree.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Source result (folklore-degree-mds), evaluated on its transformed instance: Δ is the maximum degree; the algorithm need not know it.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (folklore-degree-mds), evaluated on its transformed instance: ",
      {
        "math": "Δ"
      },
      " is the maximum degree; the algorithm need not know it.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Source result (folklore-star-minor-mds), evaluated on its transformed instance: Integer t ≥ 2; the algorithm need not know t.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (folklore-star-minor-mds), evaluated on its transformed instance: Integer ",
      {
        "math": "t ≥ 2"
      },
      "; the algorithm need not know t.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Source result (gen-af26-dom), evaluated on its transformed instance: α is arboricity; logs truncated at constants.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (gen-af26-dom), evaluated on its transformed instance: ",
      {
        "math": "α"
      },
      " is arboricity; logs truncated at constants.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Source result (gen-as26-minor), evaluated on its transformed instance: Fixed class 𝒞 and ε; a(𝒞) = sup |E|/|V|.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (gen-as26-minor), evaluated on its transformed instance: Fixed class 𝒞 and ",
      {
        "math": "ε"
      },
      "; a(𝒞) = sup |E|/|V|.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Source result (gen-as26-planar), evaluated on its transformed instance: Fixed ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (gen-as26-planar), evaluated on its transformed instance: Fixed ",
      {
        "math": "ε > 0"
      },
      ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Source result (gen-as26-random), evaluated on its transformed instance: Fixed class 𝒞 and ε.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (gen-as26-random), evaluated on its transformed instance: Fixed class 𝒞 and ",
      {
        "math": "ε"
      },
      ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Source result (gen-asw26-cycle-lower), evaluated on its transformed instance: Fixed 0 < ε < 1/4.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (gen-asw26-cycle-lower), evaluated on its transformed instance: Fixed ",
      {
        "math": "0 < ε < 1/4"
      },
      ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Source result (gen-asw26-minordensity), evaluated on its transformed instance: Fixed rational a ≥ 1.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (gen-asw26-minordensity), evaluated on its transformed instance: Fixed rational ",
      {
        "math": "a ≥ 1"
      },
      ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Source result (gen-bdgpsw26-apex), evaluated on its transformed instance: Fixed g and a; fixed ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (gen-bdgpsw26-apex), evaluated on its transformed instance: Fixed g and a; fixed ",
      {
        "math": "ε > 0"
      },
      ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Source result (gen-bdgpsw26-dom), evaluated on its transformed instance: Fixed Euler genus g and ε.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (gen-bdgpsw26-dom), evaluated on its transformed instance: Fixed Euler genus g and ",
      {
        "math": "ε"
      },
      ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Source result (gen-bdgpsw26-localgenus), evaluated on its transformed instance: Fixed d,g and sufficiently large fixed radius r.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (gen-bdgpsw26-localgenus), evaluated on its transformed instance: Fixed d,g and sufficiently large fixed radius ",
      {
        "math": "r"
      },
      ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Source result (gen-p26-density), evaluated on its transformed instance: Fixed mad bound d, shallow-minor density ∇₁, ε.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (gen-p26-density), evaluated on its transformed instance: Fixed mad bound d, shallow-minor density ",
      {
        "math": "∇₁"
      },
      ", ",
      {
        "math": "ε"
      },
      ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Source result (gen-p26-genus), evaluated on its transformed instance: Fixed Euler genus g and ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (gen-p26-genus), evaluated on its transformed instance: Fixed Euler genus g and ",
      {
        "math": "ε > 0"
      },
      ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Source result (gen-p26-trianglefree), evaluated on its transformed instance: Fixed Euler genus g and ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (gen-p26-trianglefree), evaluated on its transformed instance: Fixed Euler genus g and ",
      {
        "math": "ε > 0"
      },
      ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Source result (gen-w26-clique-dom), evaluated on its transformed instance: Fixed ε > 0; clique size unbounded.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (gen-w26-clique-dom), evaluated on its transformed instance: Fixed ",
      {
        "math": "ε > 0"
      },
      "; clique size unbounded.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Source result (gen-w26-planar-dom), evaluated on its transformed instance: Fixed ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (gen-w26-planar-dom), evaluated on its transformed instance: Fixed ",
      {
        "math": "ε > 0"
      },
      ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Source result (lenzen-arboricity-deterministic), evaluated on its transformed instance: Δ is maximum degree.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (lenzen-arboricity-deterministic), evaluated on its transformed instance: ",
      {
        "math": "Δ"
      },
      " is maximum degree.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Source result (lenzen-arboricity-random), evaluated on its transformed instance: α is the arboricity bound.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (lenzen-arboricity-random), evaluated on its transformed instance: ",
      {
        "math": "α"
      },
      " is the arboricity bound.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Source result (morgan-arboricity), evaluated on its transformed instance: α is the arboricity bound.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (morgan-arboricity), evaluated on its transformed instance: ",
      {
        "math": "α"
      },
      " is the arboricity bound.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Source result (outerplanar-five-lower), evaluated on its transformed instance: Any fixed ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (outerplanar-five-lower), evaluated on its transformed instance: Any fixed ",
      {
        "math": "ε > 0"
      },
      ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Source result (pic-ass-sublog-full), evaluated on its transformed instance: Fixed expansion class and ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (pic-ass-sublog-full), evaluated on its transformed instance: Fixed expansion class and ",
      {
        "math": "ε > 0"
      },
      ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Source result (pic-ass-sublog-refine), evaluated on its transformed instance: Fixed expansion class, ε > 0, c.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (pic-ass-sublog-refine), evaluated on its transformed instance: Fixed expansion class, ",
      {
        "math": "ε > 0"
      },
      ", c.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Source result (pic-large-50-dom), evaluated on its transformed instance: Fixed integer t ≥ 2.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (pic-large-50-dom), evaluated on its transformed instance: Fixed integer ",
      {
        "math": "t ≥ 2"
      },
      ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Source result (pic-large-linear-dom), evaluated on its transformed instance: Integer t ≥ 2; rounds independent of t.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (pic-large-linear-dom), evaluated on its transformed instance: Integer ",
      {
        "math": "t ≥ 2"
      },
      "; rounds independent of t.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Source result (pic-thesis-path-excluded-exact), evaluated on its transformed instance: Pₜ is the t-vertex path; fixed integer t ≥ 2.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (pic-thesis-path-excluded-exact), evaluated on its transformed instance: ",
      {
        "math": "Pₜ"
      },
      " is the t-vertex path; fixed integer ",
      {
        "math": "t ≥ 2"
      },
      ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Source result (planar-fast-dominating), evaluated on its transformed instance: Fixed 0 < ε < 1.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (planar-fast-dominating), evaluated on its transformed instance: Fixed ",
      {
        "math": "0 < ε < 1"
      },
      ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Source result (planar-seven-lower), evaluated on its transformed instance: Any fixed ε > 0.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (planar-seven-lower), evaluated on its transformed instance: Any fixed ",
      {
        "math": "ε > 0"
      },
      ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Source result (sparse-planar-eleven), evaluated on its transformed instance: Fixed ε > 0; the round complexity depends on ε.\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph.": [
      "Source result (sparse-planar-eleven), evaluated on its transformed instance: Fixed ",
      {
        "math": "ε > 0"
      },
      "; the round complexity depends on ",
      {
        "math": "ε"
      },
      ".\n\nSymbols not instantiated by a reduction retain their source meaning on the transformed input instance; they are not silently identified with parameters of the resulting physical graph."
    ],
    "Sub-logarithmic expansion f(r) = o(log r)": [
      "Sub-logarithmic expansion ",
      {
        "math": "f(r) = o(log r)"
      }
    ],
    "Sub-logarithmic expansion g(r) = o(log r)": [
      "Sub-logarithmic expansion ",
      {
        "math": "g(r) = o(log r)"
      }
    ],
    "Success probability ≥ 1 − ε⁻¹ exp(−Ω(log¹⁻δ n)).": [
      "Success probability ",
      {
        "math": "≥ 1"
      },
      " − ",
      {
        "math": "ε"
      },
      "⁻¹ exp(−Ω(log¹⁻δ n))."
    ],
    "Success probability ≥ 1−δ; W is largest/smallest weight.": [
      "Success probability ",
      {
        "math": "≥ 1"
      },
      "−δ; W is largest/smallest weight."
    ],
    "Supplied c-approximate dominating set; seed cost additional": [
      "Supplied ",
      {
        "math": "c"
      },
      "-approximate dominating set; seed cost additional"
    ],
    "Supplied integer degeneracy bound d ≥ 1 and ε > 0": [
      "Supplied integer degeneracy bound ",
      {
        "math": "d ≥ 1"
      },
      " and ",
      {
        "math": "ε > 0"
      }
    ],
    "Supplied proper 2-coloring": [
      "Supplied proper ",
      {
        "math": "2"
      },
      "-coloring"
    ],
    "Supplied weak 2-coloring": [
      "Supplied weak ",
      {
        "math": "2"
      },
      "-coloring"
    ],
    "Supplied weak 2-coloring; no isolates": [
      "Supplied weak ",
      {
        "math": "2"
      },
      "-coloring; no isolates"
    ],
    "The maximum degree Δ affects the approximation ratio. The supplied weak 2-colouring permits a universal constant number of communication rounds, independently of Δ.": [
      "The maximum degree ",
      {
        "math": "Δ"
      },
      " affects the approximation ratio. The supplied weak 2-colouring permits a universal constant number of communication rounds, independently of ",
      {
        "math": "Δ"
      },
      "."
    ],
    "The number of rounds may depend arbitrarily on H, independently of n.": [
      "The number of rounds may depend arbitrarily on ",
      {
        "math": "H"
      },
      ", independently of n."
    ],
    "The r-th power of a path has pathwidth at most r.": [
      "The ",
      {
        "math": "r"
      },
      "-th power of a path has pathwidth at most ",
      {
        "math": "r"
      },
      "."
    ],
    "The source’s k-hop expansion bound and girth ≥4k+3, including connectivity where stated.": [
      "The source’s ",
      {
        "math": "k"
      },
      "-hop expansion bound and girth ",
      {
        "math": "≥4k+3"
      },
      ", including connectivity where stated."
    ],
    "Trees of maximum degree Δ": [
      "Trees of maximum degree ",
      {
        "math": "Δ"
      }
    ],
    "Trees; maximum degree ≤ Δ": [
      "Trees; maximum degree ",
      {
        "math": "≤ Δ"
      }
    ],
    "Treewidth at most k excludes K_(k+2) as a minor.": [
      "Treewidth at most ",
      {
        "math": "k"
      },
      " excludes ",
      {
        "math": "K_(k+2)"
      },
      " as a minor."
    ],
    "Triangle-free graphs of Euler genus at most g.": [
      "Triangle-free graphs of Euler genus at most ",
      {
        "math": "g"
      },
      "."
    ],
    "Triangle-free; Euler genus ≤ g": [
      "Triangle-free; Euler genus ",
      {
        "math": "≤ g"
      }
    ],
    "Unique identifiers; an upper bound on ∇₁ is supplied; no embedding is supplied.": [
      "Unique identifiers; an upper bound on ",
      {
        "math": "∇₁"
      },
      " is supplied; no embedding is supplied."
    ],
    "Use a=0 in every induced radius-r ball, with the same asymptotic-dimension bound and fixed control function.": [
      "Use ",
      {
        "math": "a=0"
      },
      " in every induced radius-",
      {
        "math": "r"
      },
      " ball, with the same asymptotic-dimension bound and fixed control function."
    ],
    "Uses the planar 11+ε source approximation.": [
      "Uses the planar 11+",
      {
        "math": "ε"
      },
      " source approximation."
    ],
    "Vertex-disjoint H-packing": [
      "Vertex-disjoint ",
      {
        "math": "H"
      },
      "-packing"
    ],
    "W is largest/smallest edge weight; fixed Δ, W, ε give constant rounds.": [
      "W is largest/smallest edge weight; fixed ",
      {
        "math": "Δ"
      },
      ", W, ",
      {
        "math": "ε"
      },
      " give constant rounds."
    ],
    "W is the largest positive integer weight; fixed Δ and W give constant rounds.": [
      "W is the largest positive integer weight; fixed ",
      {
        "math": "Δ"
      },
      " and W give constant rounds."
    ],
    "Weakly 2-colored": [
      "Weakly ",
      {
        "math": "2"
      },
      "-colored"
    ],
    "Witnesses allow extra degree-one vertices attached at one endpoint. Distinct identifiers in {1,…,|V(G)|}.": [
      "Witnesses allow extra degree-one vertices attached at one endpoint. Distinct identifiers in {1,…,|V(",
      {
        "math": "G"
      },
      ")|}."
    ],
    "a=3": [
      {
        "math": "a=3"
      }
    ],
    "f ≤ k": [
      {
        "math": "f ≤ k"
      }
    ],
    "f(k) ≥ 1": [
      {
        "math": "f(k) ≥ 1"
      }
    ],
    "f(k)=1": [
      {
        "math": "f(k)=1"
      }
    ],
    "g is odd girth; W is the edge-weight ratio; fixed Δ, W, ε give O(log* n).": [
      "g is odd girth; W is the edge-weight ratio; fixed ",
      {
        "math": "Δ"
      },
      ", W, ",
      {
        "math": "ε"
      },
      " give O(log* n)."
    ],
    "high-girth k-hop expansion": [
      "high-girth ",
      {
        "math": "k"
      },
      "-hop expansion"
    ],
    "k = 2; fixed ε > 0.": [
      "k = 2; fixed ",
      {
        "math": "ε > 0"
      },
      "."
    ],
    "k ∈ {3, 4, 5, 6}; any fixed ε > 0.": [
      "k ∈ {3, 4, 5, 6}; any fixed ",
      {
        "math": "ε > 0"
      },
      "."
    ],
    "k ≥ 1": [
      {
        "math": "k ≥ 1"
      }
    ],
    "k ≥ 2": [
      {
        "math": "k ≥ 2"
      }
    ],
    "k ≥ 3": [
      {
        "math": "k ≥ 3"
      }
    ],
    "log(n)/n < ε < 1": [
      {
        "math": "log(n)/n < ε < 1"
      }
    ],
    "log(n)/n < ε < 1; fixed ε gives log-star rounds.": [
      {
        "math": "log(n)/n < ε < 1"
      },
      "; fixed ",
      {
        "math": "ε"
      },
      " gives log-star rounds."
    ],
    "n is the number of vertices; Δ is the maximum degree. The exponents in polylogarithmic factors are fixed.": [
      "n is the number of vertices; ",
      {
        "math": "Δ"
      },
      " is the maximum degree. The exponents in polylogarithmic factors are fixed."
    ],
    "pw(H) <= 2 minor-free": [
      {
        "math": "pw(H) <= 2"
      },
      " minor-free"
    ],
    "r > 1 and r=o(log* n)": [
      {
        "math": "r > 1"
      },
      " and r=o(log* n)"
    ],
    "r-th powers of paths": [
      {
        "math": "r"
      },
      "-th powers of paths"
    ],
    "r-th powers of paths for fixed r. The whole parameterized family is not planar.": [
      {
        "math": "r"
      },
      "-th powers of paths for fixed ",
      {
        "math": "r"
      },
      ". The whole parameterized family is not planar."
    ],
    "t ≥ 49": [
      {
        "math": "t ≥ 49"
      }
    ],
    "t-th powers of paths with endpoint leaves": [
      {
        "math": "t"
      },
      "-th powers of paths with endpoint leaves"
    ],
    "weakly 2-colored": [
      "weakly ",
      {
        "math": "2"
      },
      "-colored"
    ],
    "|b(u)−b(v)| ≤ L dist(u,v)": [
      {
        "math": "|b(u)−b(v)| ≤ L dist(u,v)"
      }
    ],
    "Γₚ = max column sum, Γd = max row sum of normalized A; ε > 0.": [
      "Γₚ = max column sum, Γd = max row sum of normalized A; ",
      {
        "math": "ε > 0"
      },
      "."
    ],
    "Δ is maximum degree.": [
      {
        "math": "Δ"
      },
      " is maximum degree."
    ],
    "Δ is the maximum degree.": [
      {
        "math": "Δ"
      },
      " is the maximum degree."
    ],
    "Δ is the maximum degree; the algorithm need not know it.": [
      {
        "math": "Δ"
      },
      " is the maximum degree; the algorithm need not know it."
    ],
    "α is arboricity; logs truncated at constants.": [
      {
        "math": "α"
      },
      " is arboricity; logs truncated at constants."
    ],
    "α is the arboricity bound.": [
      {
        "math": "α"
      },
      " is the arboricity bound."
    ],
    "α ≥ 1": [
      {
        "math": "α ≥ 1"
      }
    ],
    "β > 1": [
      {
        "math": "β > 1"
      }
    ],
    "β ≥ 1": [
      {
        "math": "β ≥ 1"
      }
    ],
    "ε > 0": [
      {
        "math": "ε > 0"
      }
    ],
    "ε > 0.": [
      {
        "math": "ε > 0"
      },
      "."
    ],
    "ε⁻¹ = O(poly(n)).": [
      {
        "math": "ε"
      },
      "⁻¹ = O(poly(n))."
    ],
    "ρ=3": [
      {
        "math": "ρ=3"
      }
    ],
    "∇₁(G) is the maximum edge density |E(H)|/|V(H)| over nonempty depth-1 minors H of G": [
      {
        "math": "∇₁(G)"
      },
      " is the maximum edge density ",
      {
        "math": "|E(H)|/|V(H)|"
      },
      " over nonempty depth-1 minors ",
      {
        "math": "H"
      },
      " of ",
      {
        "math": "G"
      }
    ]
  },
  "graphMathFragments": {
    "H": [
      {
        "math": "H"
      }
    ],
    "G": [
      {
        "math": "G"
      }
    ],
    "C": [
      {
        "math": "C"
      }
    ],
    "D": [
      {
        "math": "D"
      }
    ],
    "Δ": [
      {
        "math": "Δ"
      }
    ],
    "ε": [
      {
        "math": "ε"
      }
    ],
    "α": [
      {
        "math": "α"
      }
    ],
    "β": [
      {
        "math": "β"
      }
    ],
    "ρ": [
      {
        "math": "ρ"
      }
    ],
    "∇₁": [
      {
        "math": "∇₁"
      }
    ],
    "K₂,t": [
      {
        "math": "K₂,t"
      }
    ],
    "K₂,ₜ": [
      {
        "math": "K₂,ₜ"
      }
    ],
    "K2,t": [
      {
        "math": "K2,t"
      }
    ],
    "K2t": [
      {
        "math": "K2t"
      }
    ],
    "K_{2,t}": [
      {
        "math": "K_{2,t}"
      }
    ],
    "K₁,ₜ": [
      {
        "math": "K₁,ₜ"
      }
    ],
    "K1,t": [
      {
        "math": "K1,t"
      }
    ],
    "K_{1,t}": [
      {
        "math": "K_{1,t}"
      }
    ],
    "K₃,ₜ": [
      {
        "math": "K₃,ₜ"
      }
    ],
    "K3,t": [
      {
        "math": "K3,t"
      }
    ],
    "K_{3,t}": [
      {
        "math": "K_{3,t}"
      }
    ],
    "K₄,₄": [
      {
        "math": "K₄,₄"
      }
    ],
    "K4,4": [
      {
        "math": "K4,4"
      }
    ],
    "K_{4,4}": [
      {
        "math": "K_{4,4}"
      }
    ],
    "Kₕ": [
      {
        "math": "Kₕ"
      }
    ],
    "Kₜ": [
      {
        "math": "Kₜ"
      }
    ],
    "K8": [
      {
        "math": "K8"
      }
    ],
    "K_(k+2)": [
      {
        "math": "K_(k+2)"
      }
    ],
    "K_{3+a,2g+3+a}": [
      {
        "math": "K_{3+a,2g+3+a}"
      }
    ],
    "Pₜ": [
      {
        "math": "Pₜ"
      }
    ],
    "P_t": [
      {
        "math": "P_t"
      }
    ],
    "P_{t}": [
      {
        "math": "P_{t}"
      }
    ],
    "pw(H)": [
      {
        "math": "pw(H)"
      }
    ],
    "pw(H) ≤ 2": [
      {
        "math": "pw(H) ≤ 2"
      }
    ],
    "pw(H)≤2": [
      {
        "math": "pw(H)≤2"
      }
    ],
    "pw(H) <= 2": [
      {
        "math": "pw(H) <= 2"
      }
    ],
    "pw(K₂,t)=2": [
      {
        "math": "pw(K₂,t)=2"
      }
    ],
    "γ₁(G) ≤ Cγₖ(G)": [
      {
        "math": "γ₁(G) ≤ Cγₖ(G)"
      }
    ],
    "|E(H)| ≤ a|V(H)|": [
      {
        "math": "|E(H)| ≤ a|V(H)|"
      }
    ],
    "|E(H)| ≤ ρ|V(H)|": [
      {
        "math": "|E(H)| ≤ ρ|V(H)|"
      }
    ],
    "|E(H)|/|V(H)|": [
      {
        "math": "|E(H)|/|V(H)|"
      }
    ],
    "g ≤ 2h": [
      {
        "math": "g ≤ 2h"
      }
    ],
    "f(r)=o(log r)": [
      {
        "math": "f(r)=o(log r)"
      }
    ],
    "f(r) = o(log r)": [
      {
        "math": "f(r) = o(log r)"
      }
    ],
    "g(r) = o(log r)": [
      {
        "math": "g(r) = o(log r)"
      }
    ],
    "o(log r)": [
      {
        "math": "o(log r)"
      }
    ],
    "D^(r+1)": [
      {
        "math": "D^(r+1)"
      }
    ],
    "f(k)": [
      {
        "math": "f(k)"
      }
    ],
    "d=2": [
      {
        "math": "d=2"
      }
    ],
    "a=0": [
      {
        "math": "a=0"
      }
    ],
    "4r + 2": [
      {
        "math": "4r + 2"
      }
    ],
    "4r+2": [
      {
        "math": "4r+2"
      }
    ],
    "4r + 3": [
      {
        "math": "4r + 3"
      }
    ],
    "4r+3": [
      {
        "math": "4r+3"
      }
    ],
    "4k + 3": [
      {
        "math": "4k + 3"
      }
    ],
    "4k+3": [
      {
        "math": "4k+3"
      }
    ],
    "2k − 1": [
      {
        "math": "2k − 1"
      }
    ],
    "2k−1": [
      {
        "math": "2k−1"
      }
    ],
    "t−1": [
      {
        "math": "t−1"
      }
    ],
    "3, 5, …, 2k − 1": [
      {
        "math": "3, 5, …, 2k − 1"
      }
    ],
    "3,5,…,2k−1": [
      {
        "math": "3,5,…,2k−1"
      }
    ],
    "{u,v,w_i}": [
      {
        "math": "{u,v,w_i}"
      }
    ],
    "w_i": [
      {
        "math": "w_i"
      }
    ],
    "B ≥ nW": [
      {
        "math": "B ≥ nW"
      }
    ],
    "W ≤ n^O(1)": [
      {
        "math": "W ≤ n^O(1)"
      }
    ],
    "|b(u)−b(v)| ≤ L dist(u,v)": [
      {
        "math": "|b(u)−b(v)| ≤ L dist(u,v)"
      }
    ],
    "≤ ⌈log Δ⌉": [
      {
        "math": "≤ ⌈log Δ⌉"
      }
    ],
    "c ≥ ∇₁(G)": [
      {
        "math": "c ≥ ∇₁(G)"
      }
    ],
    "c=⌈∇₁(G)⌉": [
      {
        "math": "c=⌈∇₁(G)⌉"
      }
    ],
    "∇₁(G)": [
      {
        "math": "∇₁(G)"
      }
    ],
    "log(n)/n < ε < 1": [
      {
        "math": "log(n)/n < ε < 1"
      }
    ],
    "0 < ε ≤ 1": [
      {
        "math": "0 < ε ≤ 1"
      }
    ],
    "0 < ε < 1": [
      {
        "math": "0 < ε < 1"
      }
    ],
    "0 < ε < 1/2": [
      {
        "math": "0 < ε < 1/2"
      }
    ],
    "0 < ε < 1/4": [
      {
        "math": "0 < ε < 1/4"
      }
    ],
    "Aᵢⱼ ≥ 1": [
      {
        "math": "Aᵢⱼ ≥ 1"
      }
    ],
    "ε < 1/B": [
      {
        "math": "ε < 1/B"
      }
    ],
    "≤ g": [
      {
        "math": "≤ g"
      }
    ],
    "≤ e": [
      {
        "math": "≤ e"
      }
    ],
    "≤ d": [
      {
        "math": "≤ d"
      }
    ],
    "≤ Δ": [
      {
        "math": "≤ Δ"
      }
    ],
    "≤ α": [
      {
        "math": "≤ α"
      }
    ],
    "≤ a": [
      {
        "math": "≤ a"
      }
    ],
    "≤ b": [
      {
        "math": "≤ b"
      }
    ],
    "≤ k": [
      {
        "math": "≤ k"
      }
    ],
    "≤ f": [
      {
        "math": "≤ f"
      }
    ],
    "Δ ≤ 3": [
      {
        "math": "Δ ≤ 3"
      }
    ],
    "Δ≤3": [
      {
        "math": "Δ≤3"
      }
    ],
    "β ≥ 1": [
      {
        "math": "β ≥ 1"
      }
    ],
    "β≥1": [
      {
        "math": "β≥1"
      }
    ],
    "β > 1": [
      {
        "math": "β > 1"
      }
    ],
    "β>1": [
      {
        "math": "β>1"
      }
    ],
    "α ≥ 1": [
      {
        "math": "α ≥ 1"
      }
    ],
    "α≥1": [
      {
        "math": "α≥1"
      }
    ],
    "α > 1": [
      {
        "math": "α > 1"
      }
    ],
    "α>1": [
      {
        "math": "α>1"
      }
    ],
    "α ≥ 2": [
      {
        "math": "α ≥ 2"
      }
    ],
    "α≥2": [
      {
        "math": "α≥2"
      }
    ],
    "α > 2": [
      {
        "math": "α > 2"
      }
    ],
    "α>2": [
      {
        "math": "α>2"
      }
    ],
    "a ≥ 1": [
      {
        "math": "a ≥ 1"
      }
    ],
    "a≥1": [
      {
        "math": "a≥1"
      }
    ],
    "a > 1": [
      {
        "math": "a > 1"
      }
    ],
    "a>1": [
      {
        "math": "a>1"
      }
    ],
    "a ≥ 2": [
      {
        "math": "a ≥ 2"
      }
    ],
    "a≥2": [
      {
        "math": "a≥2"
      }
    ],
    "a > 2": [
      {
        "math": "a > 2"
      }
    ],
    "a>2": [
      {
        "math": "a>2"
      }
    ],
    "d ≥ 1": [
      {
        "math": "d ≥ 1"
      }
    ],
    "d≥1": [
      {
        "math": "d≥1"
      }
    ],
    "d > 1": [
      {
        "math": "d > 1"
      }
    ],
    "d>1": [
      {
        "math": "d>1"
      }
    ],
    "d ≥ 2": [
      {
        "math": "d ≥ 2"
      }
    ],
    "d≥2": [
      {
        "math": "d≥2"
      }
    ],
    "d > 2": [
      {
        "math": "d > 2"
      }
    ],
    "d>2": [
      {
        "math": "d>2"
      }
    ],
    "k ≥ 1": [
      {
        "math": "k ≥ 1"
      }
    ],
    "k≥1": [
      {
        "math": "k≥1"
      }
    ],
    "k > 1": [
      {
        "math": "k > 1"
      }
    ],
    "k>1": [
      {
        "math": "k>1"
      }
    ],
    "k ≥ 2": [
      {
        "math": "k ≥ 2"
      }
    ],
    "k≥2": [
      {
        "math": "k≥2"
      }
    ],
    "k > 2": [
      {
        "math": "k > 2"
      }
    ],
    "k>2": [
      {
        "math": "k>2"
      }
    ],
    "k ≥ 3": [
      {
        "math": "k ≥ 3"
      }
    ],
    "k≥3": [
      {
        "math": "k≥3"
      }
    ],
    "k > 3": [
      {
        "math": "k > 3"
      }
    ],
    "k>3": [
      {
        "math": "k>3"
      }
    ],
    "r ≥ 1": [
      {
        "math": "r ≥ 1"
      }
    ],
    "r≥1": [
      {
        "math": "r≥1"
      }
    ],
    "r > 1": [
      {
        "math": "r > 1"
      }
    ],
    "r>1": [
      {
        "math": "r>1"
      }
    ],
    "t ≥ 1": [
      {
        "math": "t ≥ 1"
      }
    ],
    "t≥1": [
      {
        "math": "t≥1"
      }
    ],
    "t > 1": [
      {
        "math": "t > 1"
      }
    ],
    "t>1": [
      {
        "math": "t>1"
      }
    ],
    "t ≥ 2": [
      {
        "math": "t ≥ 2"
      }
    ],
    "t≥2": [
      {
        "math": "t≥2"
      }
    ],
    "t > 2": [
      {
        "math": "t > 2"
      }
    ],
    "t>2": [
      {
        "math": "t>2"
      }
    ],
    "t ≥ 3": [
      {
        "math": "t ≥ 3"
      }
    ],
    "t≥3": [
      {
        "math": "t≥3"
      }
    ],
    "t > 3": [
      {
        "math": "t > 3"
      }
    ],
    "t>3": [
      {
        "math": "t>3"
      }
    ],
    "t ≥ 49": [
      {
        "math": "t ≥ 49"
      }
    ],
    "t≥49": [
      {
        "math": "t≥49"
      }
    ],
    "t > 49": [
      {
        "math": "t > 49"
      }
    ],
    "t>49": [
      {
        "math": "t>49"
      }
    ],
    "ρ ≥ 1": [
      {
        "math": "ρ ≥ 1"
      }
    ],
    "ρ≥1": [
      {
        "math": "ρ≥1"
      }
    ],
    "ρ > 1": [
      {
        "math": "ρ > 1"
      }
    ],
    "ρ>1": [
      {
        "math": "ρ>1"
      }
    ],
    "b ≥ 1": [
      {
        "math": "b ≥ 1"
      }
    ],
    "b≥1": [
      {
        "math": "b≥1"
      }
    ],
    "b > 1": [
      {
        "math": "b > 1"
      }
    ],
    "b>1": [
      {
        "math": "b>1"
      }
    ],
    "ε ≥ 0": [
      {
        "math": "ε ≥ 0"
      }
    ],
    "ε≥0": [
      {
        "math": "ε≥0"
      }
    ],
    "ε > 0": [
      {
        "math": "ε > 0"
      }
    ],
    "ε>0": [
      {
        "math": "ε>0"
      }
    ],
    "∇₁ ≥ 0": [
      {
        "math": "∇₁ ≥ 0"
      }
    ],
    "∇₁≥0": [
      {
        "math": "∇₁≥0"
      }
    ],
    "∇₁ > 0": [
      {
        "math": "∇₁ > 0"
      }
    ],
    "∇₁>0": [
      {
        "math": "∇₁>0"
      }
    ],
    "f(k) ≥ 1": [
      {
        "math": "f(k) ≥ 1"
      }
    ],
    "f(k)≥1": [
      {
        "math": "f(k)≥1"
      }
    ],
    "f(k) > 1": [
      {
        "math": "f(k) > 1"
      }
    ],
    "f(k)>1": [
      {
        "math": "f(k)>1"
      }
    ],
    "≥ 4r + 2": [
      {
        "math": "≥ 4r + 2"
      }
    ],
    "≥ 4r + 3": [
      {
        "math": "≥ 4r + 3"
      }
    ],
    "≥ 4k + 3": [
      {
        "math": "≥ 4k + 3"
      }
    ],
    "≥4k+3": [
      {
        "math": "≥4k+3"
      }
    ],
    "≥ 4r+2": [
      {
        "math": "≥ 4r+2"
      }
    ],
    "≥ 1": [
      {
        "math": "≥ 1"
      }
    ],
    "≥ 4k": [
      {
        "math": "≥ 4k"
      }
    ],
    "≤ 3": [
      {
        "math": "≤ 3"
      }
    ],
    "≤ W": [
      {
        "math": "≤ W"
      }
    ],
    "≤ f(k)": [
      {
        "math": "≤ f(k)"
      }
    ],
    "dimension d": [
      "dimension ",
      {
        "math": "d"
      }
    ],
    "dimension at most d": [
      "dimension at most ",
      {
        "math": "d"
      }
    ],
    "radius-r": [
      "radius-",
      {
        "math": "r"
      }
    ],
    "r-locally": [
      {
        "math": "r"
      },
      "-locally"
    ],
    "radius r": [
      "radius ",
      {
        "math": "r"
      }
    ],
    "depth-r": [
      "depth-",
      {
        "math": "r"
      }
    ],
    "r-th": [
      {
        "math": "r"
      },
      "-th"
    ],
    "t-th": [
      {
        "math": "t"
      },
      "-th"
    ],
    "k-hop": [
      {
        "math": "k"
      },
      "-hop"
    ],
    "t-side": [
      {
        "math": "t"
      },
      "-side"
    ],
    "at most a": [
      "at most ",
      {
        "math": "a"
      }
    ],
    "a-apex": [
      {
        "math": "a"
      },
      "-apex"
    ],
    "genus-g": [
      "genus-",
      {
        "math": "g"
      }
    ],
    "genus h": [
      "genus ",
      {
        "math": "h"
      }
    ],
    "genus at most g": [
      "genus at most ",
      {
        "math": "g"
      }
    ],
    "bound g": [
      "bound ",
      {
        "math": "g"
      }
    ],
    "fixed g and a": [
      "fixed ",
      {
        "math": "g"
      },
      " and ",
      {
        "math": "a"
      }
    ],
    "fixed g, a": [
      "fixed ",
      {
        "math": "g"
      },
      ", ",
      {
        "math": "a"
      }
    ],
    "g, a and": [
      {
        "math": "g"
      },
      ", ",
      {
        "math": "a"
      },
      " and"
    ],
    "fixed g": [
      "fixed ",
      {
        "math": "g"
      }
    ],
    "fixed t": [
      "fixed ",
      {
        "math": "t"
      }
    ],
    "fixed r": [
      "fixed ",
      {
        "math": "r"
      }
    ],
    "large r": [
      "large ",
      {
        "math": "r"
      }
    ],
    "stated k": [
      "stated ",
      {
        "math": "k"
      }
    ],
    "on t vertices": [
      "on ",
      {
        "math": "t"
      },
      " vertices"
    ],
    "with t neighbors": [
      "with ",
      {
        "math": "t"
      },
      " neighbors"
    ],
    "at most r": [
      "at most ",
      {
        "math": "r"
      }
    ],
    "at most k": [
      "at most ",
      {
        "math": "k"
      }
    ],
    "Expansion f;": [
      "Expansion ",
      {
        "math": "f"
      },
      ";"
    ],
    "expansion f;": [
      "expansion ",
      {
        "math": "f"
      },
      ";"
    ],
    "Known n": [
      "Known ",
      {
        "math": "n"
      }
    ],
    "Known C, k, t": [
      "Known ",
      {
        "math": "C"
      },
      ", ",
      {
        "math": "k"
      },
      ", ",
      {
        "math": "t"
      }
    ],
    "Supplied c-approximate": [
      "Supplied ",
      {
        "math": "c"
      },
      "-approximate"
    ],
    "Arboricity 2": [
      "Arboricity ",
      {
        "math": "2"
      }
    ],
    "Arboricity at most 2": [
      "Arboricity at most ",
      {
        "math": "2"
      }
    ],
    "Degree-3": [
      "Degree-",
      {
        "math": "3"
      }
    ],
    "4-cycles": [
      {
        "math": "4"
      },
      "-cycles"
    ],
    "2-colored": [
      {
        "math": "2"
      },
      "-colored"
    ],
    "2-coloring": [
      {
        "math": "2"
      },
      "-coloring"
    ],
    "H=K₂,t": [
      {
        "math": "H=K₂,t"
      }
    ],
    "H=K2,t": [
      {
        "math": "H=K2,t"
      }
    ],
    "H = K₂,t": [
      {
        "math": "H = K₂,t"
      }
    ],
    "H=K1,t": [
      {
        "math": "H=K1,t"
      }
    ],
    "H=Pₜ": [
      {
        "math": "H=Pₜ"
      }
    ],
    "a=3": [
      {
        "math": "a=3"
      }
    ],
    "ρ=3": [
      {
        "math": "ρ=3"
      }
    ],
    "f ≤ k": [
      {
        "math": "f ≤ k"
      }
    ],
    "f(k)=1": [
      {
        "math": "f(k)=1"
      }
    ],
    "ρ, b, ε": [
      {
        "math": "ρ, b, ε"
      }
    ],
    "In n;": [
      "In ",
      {
        "math": "n"
      },
      ";"
    ],
    "C₅": [
      {
        "math": "C₅"
      }
    ],
    "K₂,s": [
      {
        "math": "K₂,s"
      }
    ],
    "≤ t−1": [
      {
        "math": "≤ t−1"
      }
    ],
    "t≥4": [
      {
        "math": "t≥4"
      }
    ],
    "t ≥ 4": [
      {
        "math": "t ≥ 4"
      }
    ],
    "t=2": [
      {
        "math": "t=2"
      }
    ],
    "t=3": [
      {
        "math": "t=3"
      }
    ],
    "H and t": [
      {
        "math": "H"
      },
      " and ",
      {
        "math": "t"
      }
    ],
    "with t leaves": [
      "with ",
      {
        "math": "t"
      },
      " leaves"
    ],
    "large s": [
      "large ",
      {
        "math": "s"
      }
    ]
  }
}
