Skip to main content
Challenge

Build a GLEIF Restructuring Lineage and Ultimate Parent Tracker

Trace historical corporate acquisitions and spin-offs using GLEIF relationship records. Map multi-generational successor entity networks to definitively compute the ultimate parent entity after complex restructuring events.

CybersecurityHosted by Vera
Challenge brief

What you are building

The core problem, expected build, and operating context for this challenge.

Trace historical corporate acquisitions and spin-offs using GLEIF relationship records. Map multi-generational successor entity networks to definitively compute the ultimate parent entity after complex restructuring events.

Corporate Due Diligence Investigator

Parse simplified entity identifier records and historical restructuring query parameters.

Traverse multi-generational corporate relationship trees to resolve cyclic or split entity relationships.

Calculate the post-restructuring ultimate parent entity by tracking the terminal successor node in the directed acyclic graph.

Output an interactive restructuring chronology terminating in the computed ultimate parent entity.

A DAG-based lineage graph viewer highlighting the ultimate parent node and the path of corporate successor transitions.

Construct synthetic multi-tier merger event datasets matching GLEIF relationship records, provided as simplified synthetic app records, not complete official schema files. Starter examples below are synthetic. They are not downloaded records.

GLEIF API GLEIF API corporate relationship structures (parent and child relationships and Golden Copy data models).

langgraph, fastapi, networkx. Manages cyclical traversal states while resolving multi-generation corporate successor graphs into an ultimate parent node. Instruction-tuned agent model for traversing corporate relationships and synthesizing lineage narratives.

Submit runnable source, pinned dependencies, setup commands, a working interface, example outputs, and a recorded end-to-end demo. Include tests and an action log.

Successfully calculates the terminal ultimate parent entity from a multi-hop predecessor chain.

Accurately traverses split events and determines which branch retains the primary operating lineage.

Emits an exportable graph chronology payload showing the exact path to the ultimate parent.

```json [ { "input": { "target_lei": "1234500T96DYXUPKV304", "historical_depth_years": 5 }, "expected_output": { "target_lei": "1234500T96DYXUPKV304", "ultimate_parent_lei": "9999500T96DYXUPKV304", "lineage_steps": 2, "chain_status": "complete" } }, { "input": { "target_lei": "89450000000000000001", "historical_depth_years": 10 }, "expected_output": { "target_lei": "89450000000000000001", "ultimate_parent_lei": null, "lineage_steps": 1, "chain_status": "broken" } } ] ```

Maintains non-accusatory corporate structural analysis without making definitive sanctions or freeze rulings. Use mock external writes. Require human review before any real deployment.

Rules

Participation guide

Maintains non-accusatory corporate structural analysis without making definitive sanctions or freeze rulings. Use mock external writes and human review.

Delivery guide

How work is evaluated

Evaluation

Successfully calculates the terminal ultimate parent entity from a multi-hop predecessor chain. Accurately traverses split events and determines which branch retains the primary operating lineage. Emits an exportable graph chronology payload showing the exact path to the ultimate parent.

Submission format

Runnable source, pinned dependencies, setup commands, working interface, example outputs, recorded demo, tests, and action logs.

Datasets

Challenge datasets

Public datasets, plus the private datasets you have access to.

Evaluation rubric

How submissions are scored

These dimensions define what the evaluator checks and which criteria separate a passable run from a strong one.

Dimensions
4 scoring checks
Binary
1 pass or fail dimensions
Ordinal
3 scaled dimensions
Dimension 1

Complete workflow

Parse simplified entity identifier records and historical restructuring query parameters. Traverse multi-generational corporate relationship trees to resolve cyclic or split entity relationships. Calculate the post-restructuring ultimate parent entity by tracking the terminal successor node in the directed acyclic graph. Output an interactive restructuring chronology terminating in the computed ultimate parent entity.

Score scale
012
Score 0

Missing or incorrect.

Score 1

Partly complete, with documented gaps.

Score 2

Complete, with reproducible evidence.

Dimension 2

Correctness and evidence

Successfully calculates the terminal ultimate parent entity from a multi-hop predecessor chain. Accurately traverses split events and determines which branch retains the primary operating lineage. Emits an exportable graph chronology payload showing the exact path to the ultimate parent.

Score scale
012
Score 0

Missing or incorrect.

Score 1

Partly complete, with documented gaps.

Score 2

Complete, with reproducible evidence.

Dimension 3

Review interface

A DAG-based lineage graph viewer highlighting the ultimate parent node and the path of corporate successor transitions.

Score scale
012
Score 0

Missing or incorrect.

Score 1

Partly complete, with documented gaps.

Score 2

Complete, with reproducible evidence.

Dimension 4

Safe execution

Maintains non-accusatory corporate structural analysis without making definitive sanctions or freeze rulings.

Binary check

This dimension contributes its full weight only when the submission satisfies the requirement. Partial credit is not awarded.

Learning goals

What you should walk away with

  • Parse simplified entity identifier records and historical restructuring query parameters.

  • Traverse multi-generational corporate relationship trees to resolve cyclic or split entity relationships.

  • Calculate the post-restructuring ultimate parent entity by tracking the terminal successor node in the directed acyclic graph.

  • Output an interactive restructuring chronology terminating in the computed ultimate parent entity.

Resources and assets

Reference links and supporting material

Dataset notes

Construct synthetic multi-tier merger event datasets matching GLEIF relationship records, provided as simplified synthetic app records, not complete official schema files. Supplied starter examples are synthetic, not source extracts.

Challenge setup

Configuration summary for this challenge.

Challenge input

Input details are not configured.

LangGraph

Runtime for stateful agent workflows.

Evaluated output

No output checks are configured.

Evaluation checks
  • Parse simplified entity identifier records and historical restructuring query parameters. Traverse multi-ge...
  • Successfully calculates the terminal ultimate parent entity from a multi-hop predecessor chain. Accurately...
  • A DAG-based lineage graph viewer highlighting the ultimate parent node and the path of corporate successor...
Configured evaluation evidence
  • 2 public reference cases
Configured runtime
  • 2 configured tools

Summary shows the first task, up to three tools, and up to three evidence items. Open the technical recipe to view all configured items.

View technical recipe

Configured tools

Action Space
  • LangGraph · Optional
Orchestration
  • LangGraph · Optional

Evaluation contract

  • Complete workflow · Weight 40
  • Correctness and evidence · Weight 30
  • Review interface · Weight 20
  • Safe execution · Weight 10

Reference cases

  • 2 public reference cases

Workflow tasks

No workflow tasks are configured.

Recipe freeze marker

No recipe freeze time is recorded.

Frequently Asked Questions about Build a GLEIF Restructuring Lineage and Ultimate Parent Tracker