{
  "docId": "019dd923-5e88-73ef-bd59-6131f37efc2b",
  "docSlug": "71b5b657f034a972",
  "documentTitle": "ey net zero centre carbon offset publication 20220530",
  "authorId": "MorganStanley",
  "authorName": "Grantham Research Institute",
  "documentKindSlug": "consulting-deck",
  "documentKindLabel": "Consulting deck",
  "sourceTypeSlug": "equity_research",
  "sourceTypeLabel": "Equity research",
  "presentationDate": null,
  "orientation": "portrait",
  "aspectRatio": 0.707,
  "pageNumber": 45,
  "pageCount": 45,
  "prevPage": 44,
  "nextPage": null,
  "slideType": "appendix_methodology",
  "function": "present_framework",
  "density": "balanced",
  "nDataPoints": 0,
  "notes": "The slide details the methodology for calculating cable length requirements, including robustness checks by state and alternative connection points (power stations/cities).",
  "elementsJson": [
    "paragraph",
    "numbered_list"
  ],
  "metadataConfidence": 1,
  "imagePath": null,
  "slideHref": "/slides/019dd923-5e88-73ef-bd59-6131f37efc2b/45",
  "deckHref": "/decks/019dd923-5e88-73ef-bd59-6131f37efc2b",
  "deckJsonHref": "/decks/019dd923-5e88-73ef-bd59-6131f37efc2b.json",
  "deckAnchorHref": "/decks/019dd923-5e88-73ef-bd59-6131f37efc2b#slide-45",
  "components": [
    {
      "bbox": {
        "h": 0.22,
        "w": 0.78,
        "x": 0.11,
        "y": 0.32
      },
      "kind": "list",
      "text": "1. Connect the entire network of electrical substations to each other (by any method) and record the total edge length. 2. Append the wind farm sites for each project as unconnected nodes in the network, and then use a standard MST algorithm to add the set of edges of shortest length that creates a graph without any unconnected nodes. Record the total edge length of the augmented graph. 3. Subtract the total edge length in step 1 from the total edge length in step 2 to retrieve the minimum length of cable needed for every wind farm site to be connected, either directly or indirectly, to at least one electrical substation.",
      "attrs": null,
      "subkind": "numbered",
      "toolName": null,
      "toolSlug": null,
      "confidence": null,
      "componentId": "2da8083b-bd03-4f47-a754-fbd459cd543c",
      "frameworkName": null,
      "frameworkSlug": null
    },
    {
      "bbox": {
        "h": 0.07,
        "w": 0.78,
        "x": 0.11,
        "y": 0.09
      },
      "kind": "paragraph",
      "text": "recorded the coordinates of the village in which the turbines are located, rather than pinpointing individual turbines. This was partly out of practical necessity, but also means that our findings cannot be driven by arbitrarily small differences in location.",
      "attrs": null,
      "subkind": "paragraph",
      "toolName": null,
      "toolSlug": null,
      "confidence": null,
      "componentId": "37ee7236-40be-414e-8567-a602960aa2d4",
      "frameworkName": null,
      "frameworkSlug": null
    },
    {
      "bbox": {
        "h": 0.08,
        "w": 0.78,
        "x": 0.11,
        "y": 0.55
      },
      "kind": "paragraph",
      "text": "As part of our robustness checks, we further modify this algorithm to permit only connections to electrical substations located in the same state as the wind farm site. This is accomplished by running the above algorithm separately for the electrical substations and wind farm sites located in each state, and then summing the results across states.",
      "attrs": null,
      "subkind": "paragraph",
      "toolName": null,
      "toolSlug": null,
      "confidence": null,
      "componentId": "edd4372b-6780-48a8-903d-4f90c23f04cd",
      "frameworkName": null,
      "frameworkSlug": null
    },
    {
      "bbox": {
        "h": 0.08,
        "w": 0.78,
        "x": 0.11,
        "y": 0.17
      },
      "kind": "paragraph",
      "text": "We calculate the connection distance using a modified minimum spanning tree (MST) algorithm. A standard MST algorithm considers only one type of node, and will search for a set of edges that connects all of the nodes together, yet whose combined length is as small as possible.",
      "attrs": null,
      "subkind": "paragraph",
      "toolName": null,
      "toolSlug": null,
      "confidence": null,
      "componentId": "fc88a96c-21c6-4c72-919e-5ef52c309099",
      "frameworkName": null,
      "frameworkSlug": null
    }
  ],
  "metrics": [],
  "tools": [],
  "frameworks": [
    {
      "name": "Minimum Spanning Tree Algorithm",
      "slug": null,
      "matchId": "a75c739d-6428-44e4-a503-febc51af41cf",
      "evidence": "Explicitly mentioned as the core methodology for calculating connection distances.",
      "confidence": 1
    }
  ],
  "arcBeats": [],
  "loops": [],
  "imagePathAlt": null,
  "thumbSrc": null,
  "thumbSrcAlt": null,
  "locked": true
}