Jump to text
On this page
Copy and source
Published source confirmed at last check

Source changed 2026-11-18 21:11:39 UTC · snapshot created 2026-11-18 21:12:35 UTC · last check 2026-11-18 22:25:20 UTC

A.10:4.4 - Build a descriptive evidence-provenance path

The minimum A.10 path records only what the bounded use needs:

FieldRequired content
Relied-on claimThe selected claim or proposition in one identified C.2.1 episteme; a separate target claim when the evidence use distinguishes it
Bounded useThe ordinary orientation, learning, action, or reliance use being judged, and its premise, reference, decision-use, operation-argument, or other direct use relation. Add a later U.Work occurrence only when it is independently current.
Sources and carriersSelected source epistemes and editions; publication occurrences, forms, carriers, and faces when material; transformations; and direct provenance/citation relations
Work and bindingsOnly independently current dated U.Work, its complete basis, and the performers, Methods, resources, direct relations, and A.6.1 bindings used by the claim. A claimed Work-to-value link also needs an A.6.1 application binding, one local A.15.PROD claim, or a direct subject predicate defined by its own pattern.
Result ruleThe defining or testing rule for each asserted local result, and its result episteme when that identity is used
Time/currentnessSource and result windows plus G.11 currentness when currentness affects use
ChallengeA live rival explanation when it needs discrimination; a locally grounded, plausible unsupported use when excluding it changes reliance; an available contest/redress path when a party is affected; and the stop or reopen condition applicable to this use

For every unsupported-use guard in this pattern, require an independent local ground for the rejected reading, a plausible intended-reader error, and a change in truth, understanding or use. State only the smallest correction needed under F.19. A live rival explanation remains a substantive alternative to test, not a mandatory invented opponent.

Graph nodes retain their admitted kinds. Each edge cites one independently established direct relation; no generic evidences, verifiedBy, validatedBy, measuredBy, producedByWork, or criterion-participant relation is minted as a fallback. A project may label display edges for navigation, but the label has no ontic force.