@odla-ai/kg 0.3.0 → 0.4.0

package/dist/lenses-C7Q7Gvnx.d.cts

@@ -0,0 +1,123 @@
+import { Value } from '@odla-ai/db';
+
+/**
+ * The output of a connector: one acquired item. Exactly one of `text` or
+ * `fragment` is set — `text` goes through LLM extraction, `fragment` is already
+ * ontology-typed and goes straight to the graph writer (structured feeds).
+ */
+interface RawItem {
+    url: string;
+    title: string;
+    date?: string;
+    sourceName: string;
+    sourceKind: string;
+    watch?: string | null;
+    text?: string;
+    fragment?: GraphFragment;
+}
+/** A graph node = an odla-db entity in a namespace, keyed by a natural key. */
+interface GraphNode {
+    type: string;
+    key: string;
+    attrs: Record<string, Value>;
+}
+/** A graph edge = an odla-db `link` from one node to another by forward label. */
+interface GraphEdge {
+    from: {
+        type: string;
+        key: string;
+    };
+    to: {
+        type: string;
+        key: string;
+    };
+    label: string;
+}
+/** The single shape the graph writer consumes, whatever produced it. */
+interface GraphFragment {
+    nodes: GraphNode[];
+    edges: GraphEdge[];
+}
+/** What an extractor turns a text RawItem into: a fragment plus a prose summary. */
+interface ExtractResult {
+    fragment: GraphFragment;
+    summary: string;
+}
+/** Provider-agnostic LLM usage accounting. */
+interface Usage {
+    calls: number;
+    inputTokens: number;
+    outputTokens: number;
+}
+/** Create zeroed provider-agnostic usage totals for one pipeline run. */
+declare function emptyUsage(): Usage;
+/** Mutate an accumulator by adding call, input-token, and output-token totals. */
+declare function addUsage(into: Usage, more: Usage): void;
+
+/** A 2-D point in a normalized layout/map space (for the geo proximity lens). */
+interface XY {
+    x: number;
+    y: number;
+}
+/** One undirected weighted pair, with (capped) bridging node ids as evidence. */
+interface WeightedPair {
+    a: string;
+    b: string;
+    w: number;
+    via: string[];
+}
+/**
+ * Bridge → target sets through a REIFIED relationship node (affiliation,
+ * funding_round, record): every reified node with a `bridgeLabel` edge to the
+ * bridge and a `targetLabel` edge to a target contributes that target to the
+ * bridge's set. Ids are `type:key`.
+ */
+declare function reifiedBridgeTargets(fragment: GraphFragment, opts: {
+    reified: string;
+    bridgeLabel: string;
+    targetLabel: string;
+}): Map<string, Set<string>>;
+/** Direct-edge targets: `from` node id → set of `to` node ids for one label. */
+declare function directTargets(fragment: GraphFragment, label: string): Map<string, Set<string>>;
+/** Compose A→B with B→C into A→C (e.g. person→companies ∘ company→counties). */
+declare function composeTargets(ab: Map<string, Set<string>>, bc: Map<string, Set<string>>): Map<string, Set<string>>;
+/**
+ * The bipartite projection: targets sharing a bridge become pairs, weight =
+ * number of distinct shared bridges. `maxPerBridge` skips promiscuous hubs
+ * (a bridge touching 40 targets says little about any pair). Deterministic
+ * pair order (a < b, then sorted).
+ */
+declare function projectBridges(bridges: Map<string, Set<string>>, opts?: {
+    maxPerBridge?: number;
+    viaCap?: number;
+}): WeightedPair[];
+/**
+ * Temporal cohort pairs: each node links to its k nearest neighbors in
+ * arrival time, weight decaying with the gap (0.5 per halfLife). Nodes
+ * without a date contribute nothing.
+ */
+declare function timePairs(arrivals: Map<string, number>, opts?: {
+    k?: number;
+    halfLifeDays?: number;
+}): WeightedPair[];
+/**
+ * Spatial proximity pairs: k nearest neighbors in normalized map space,
+ * weight decaying with distance (0.5 per halfDist). Nodes without a
+ * position contribute nothing. O(n²) — fine for the ≤1k-node universes
+ * lenses operate on.
+ */
+declare function geoPairs(positions: Map<string, XY>, opts?: {
+    k?: number;
+    halfDist?: number;
+}): WeightedPair[];
+/**
+ * Blend lens edge sets: each set is normalized to a max weight of 1 (a lens
+ * with big raw counts must not drown the others), scaled by its slider
+ * weight, and summed per pair. Zero-weight lenses drop out entirely.
+ */
+declare function blendPairs(sets: Array<{
+    pairs: WeightedPair[];
+    weight: number;
+}>): WeightedPair[];
+
+export { type ExtractResult as E, type GraphFragment as G, type RawItem as R, type Usage as U, type WeightedPair as W, type XY as X, type GraphEdge as a, type GraphNode as b, addUsage as c, blendPairs as d, emptyUsage as e, composeTargets as f, directTargets as g, geoPairs as h, projectBridges as p, reifiedBridgeTargets as r, timePairs as t };

package/dist/lenses-C7Q7Gvnx.d.ts

@@ -0,0 +1,123 @@
+import { Value } from '@odla-ai/db';
+
+/**
+ * The output of a connector: one acquired item. Exactly one of `text` or
+ * `fragment` is set — `text` goes through LLM extraction, `fragment` is already
+ * ontology-typed and goes straight to the graph writer (structured feeds).
+ */
+interface RawItem {
+    url: string;
+    title: string;
+    date?: string;
+    sourceName: string;
+    sourceKind: string;
+    watch?: string | null;
+    text?: string;
+    fragment?: GraphFragment;
+}
+/** A graph node = an odla-db entity in a namespace, keyed by a natural key. */
+interface GraphNode {
+    type: string;
+    key: string;
+    attrs: Record<string, Value>;
+}
+/** A graph edge = an odla-db `link` from one node to another by forward label. */
+interface GraphEdge {
+    from: {
+        type: string;
+        key: string;
+    };
+    to: {
+        type: string;
+        key: string;
+    };
+    label: string;
+}
+/** The single shape the graph writer consumes, whatever produced it. */
+interface GraphFragment {
+    nodes: GraphNode[];
+    edges: GraphEdge[];
+}
+/** What an extractor turns a text RawItem into: a fragment plus a prose summary. */
+interface ExtractResult {
+    fragment: GraphFragment;
+    summary: string;
+}
+/** Provider-agnostic LLM usage accounting. */
+interface Usage {
+    calls: number;
+    inputTokens: number;
+    outputTokens: number;
+}
+/** Create zeroed provider-agnostic usage totals for one pipeline run. */
+declare function emptyUsage(): Usage;
+/** Mutate an accumulator by adding call, input-token, and output-token totals. */
+declare function addUsage(into: Usage, more: Usage): void;
+
+/** A 2-D point in a normalized layout/map space (for the geo proximity lens). */
+interface XY {
+    x: number;
+    y: number;
+}
+/** One undirected weighted pair, with (capped) bridging node ids as evidence. */
+interface WeightedPair {
+    a: string;
+    b: string;
+    w: number;
+    via: string[];
+}
+/**
+ * Bridge → target sets through a REIFIED relationship node (affiliation,
+ * funding_round, record): every reified node with a `bridgeLabel` edge to the
+ * bridge and a `targetLabel` edge to a target contributes that target to the
+ * bridge's set. Ids are `type:key`.
+ */
+declare function reifiedBridgeTargets(fragment: GraphFragment, opts: {
+    reified: string;
+    bridgeLabel: string;
+    targetLabel: string;
+}): Map<string, Set<string>>;
+/** Direct-edge targets: `from` node id → set of `to` node ids for one label. */
+declare function directTargets(fragment: GraphFragment, label: string): Map<string, Set<string>>;
+/** Compose A→B with B→C into A→C (e.g. person→companies ∘ company→counties). */
+declare function composeTargets(ab: Map<string, Set<string>>, bc: Map<string, Set<string>>): Map<string, Set<string>>;
+/**
+ * The bipartite projection: targets sharing a bridge become pairs, weight =
+ * number of distinct shared bridges. `maxPerBridge` skips promiscuous hubs
+ * (a bridge touching 40 targets says little about any pair). Deterministic
+ * pair order (a < b, then sorted).
+ */
+declare function projectBridges(bridges: Map<string, Set<string>>, opts?: {
+    maxPerBridge?: number;
+    viaCap?: number;
+}): WeightedPair[];
+/**
+ * Temporal cohort pairs: each node links to its k nearest neighbors in
+ * arrival time, weight decaying with the gap (0.5 per halfLife). Nodes
+ * without a date contribute nothing.
+ */
+declare function timePairs(arrivals: Map<string, number>, opts?: {
+    k?: number;
+    halfLifeDays?: number;
+}): WeightedPair[];
+/**
+ * Spatial proximity pairs: k nearest neighbors in normalized map space,
+ * weight decaying with distance (0.5 per halfDist). Nodes without a
+ * position contribute nothing. O(n²) — fine for the ≤1k-node universes
+ * lenses operate on.
+ */
+declare function geoPairs(positions: Map<string, XY>, opts?: {
+    k?: number;
+    halfDist?: number;
+}): WeightedPair[];
+/**
+ * Blend lens edge sets: each set is normalized to a max weight of 1 (a lens
+ * with big raw counts must not drown the others), scaled by its slider
+ * weight, and summed per pair. Zero-weight lenses drop out entirely.
+ */
+declare function blendPairs(sets: Array<{
+    pairs: WeightedPair[];
+    weight: number;
+}>): WeightedPair[];
+
+export { type ExtractResult as E, type GraphFragment as G, type RawItem as R, type Usage as U, type WeightedPair as W, type XY as X, type GraphEdge as a, type GraphNode as b, addUsage as c, blendPairs as d, emptyUsage as e, composeTargets as f, directTargets as g, geoPairs as h, projectBridges as p, reifiedBridgeTargets as r, timePairs as t };