Triple

T24313788
Position Surface form Disambiguated ID Type / Status
Subject Gale’s theorem on flows with convex costs E612747 entity
Predicate instanceOf P0 FINISHED
Object result in network flow theory C48682 CONCEPT FINISHED

How this triple was built (1 step)

Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.

CD Concept disambiguation gpt-5-mini-2025-08-07
Target class: result in network flow theory
Context triple: [Gale’s theorem on flows with convex costs, instanceOf, result in network flow theory]
  • A. result in extremal graph theory
    A result in extremal graph theory is a theorem that determines or bounds the maximum or minimum size of a graph (typically in terms of edges) that avoids containing a specified subgraph or satisfies certain forbidden configurations.
  • B. resistance network
    A resistance network is a conceptual system of interconnected resistive elements (such as individuals, groups, or components) whose interactions collectively oppose, mitigate, or redirect an applied influence, force, or flow.
  • C. bridge network
    A bridge network is a system of interconnected bridges and links that provides multiple paths for traffic or data to travel between nodes, enhancing reliability and load distribution.
  • D. result in order theory
    A result in order theory is a formally proven statement or theorem about the properties, structures, or relationships of ordered sets and order-preserving mappings.
  • E. result in lattice theory
    A result in lattice theory is a proven theorem or proposition that describes structural, order-theoretic, or algebraic properties of lattices and their related constructs.
  • F. None of above. chosen

Provenance (1 batch)

The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.

Step Stage Batch ID Status When
creating Elicitation batch_69e2d7da491c8190b6e6218af50923db completed April 18, 2026, 1:01 a.m.
Created at: April 18, 2026, 1:45 a.m.