Description
Check explicit finding recurrence links and category identity.
Quality records separate measured results, reference values, acceptance rules, and supporting evidence. Arithmetic consistency and record coverage can be checked against supplied criteria without establishing traceability, approving a method, or deciding product conformity.
Check explicit finding recurrence links and category identity.
When to use this tool
Use it for audit finding repeat source pair when the required inputs and conventions are already available.
How to use the tool and how it works
- Enter findingId, priorId, citedPriorId, currentCategory, priorCategory. Use the stated units and boundary conventions.
- Run the calculation. Correct any input error before interpreting a result.
- Read linked, sameCategory, repeated. Inspect any known, defined, inclusion, or boundary flags before interpreting numeric values.
Set linked only when priorId is nonempty, citedPriorId equals it, and findingId differs from it. Compare currentCategory with priorCategory and set repeated only when linked and sameCategory are both true.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| findingId | Finding Id | Required. Text; maximum UTF-16 length 8192. |
| priorId | Prior Id | Required. Text; maximum UTF-16 length 8192. |
| citedPriorId | Cited Prior Id | Required. Text; maximum UTF-16 length 8192. |
| currentCategory | Current Category | Required. Text; maximum UTF-16 length 8192. |
| priorCategory | Prior Category | Required. Text; maximum UTF-16 length 8192. |
| Output field | Interpretation | Returned shape |
|---|---|---|
| linked | Linked | Required. Boolean. |
| sameCategory | Same Category | Required. Boolean. |
| repeated | Repeated | Required. Boolean. |
{
"input": {
"findingId": "F2",
"priorId": "F1",
"citedPriorId": "F1",
"currentCategory": "A",
"priorCategory": "A"
},
"output": {
"linked": true,
"sameCategory": true,
"repeated": true
}
}Limitations and assumptions
- The check uses supplied exact identifiers and category labels. It does not inspect finding text, determine recurrence causality, or establish that a linked prior finding exists.
- The field tables describe structural bounds; the mechanics also state cross-field requirements. Malformed input shapes, disallowed keys, and invalid domains cause input errors. Results must remain finite and within the declared output contract. A successful false flag or zero placeholder is distinct from an error.
- Numeric arithmetic uses binary floating point. Exact comparisons have no hidden tolerance or decimal rounding; negative zero is exported as zero. Decimal-text integer operations retain the exactness specifically stated above.
Alternative or Complementary methods
For audit finding repeat source pair, check the source records and the supplied rule before comparing the result with another method. Use a separate evidence or method review when arithmetic consistency alone cannot establish the required conclusion.
References
Similar or alternative tools
- Audit Sample Selection Weight One Record
One Horvitz-Thompson contribution from a supplied inclusion probability.
- Audit Sample Weight Base Flag
Calculate audit sample weight base flag from explicit caller-supplied inputs.