Line vs Comb Perf Classifier from Pattern Notes
Compare recorded corner alignment and repeated-row comb evidence, not free-text certainty. Independently established positive evidence requirements; overlapping compatible classes and unknowns retained. Caller independently verifies observations, reference edition, units and applicability; not a grading-service certificate, authentication, conservation treatment, actual market price or legal/insurance entitlement.
Description
Line and comb perforation can leave different observed corner and row patterns.
Line and comb perforation can leave different observed corner and row patterns.1
This classifier compares explicit evidence with caller reference requirements and may return more than one compatible method.
When to use Line vs Comb Perf Classifier from Pattern Notes
Use this tool when you need to compare explicit positive evidence requirements while keeping compatible and fully witnessed classes separate. Prepare independently verified observations, reference edition/context, and matching units or currency basis.
How to use Line vs Comb Perf Classifier from Pattern Notes and understand its results
- Prepare independently verified observations, reference edition/context, and matching units or currency basis.
- Enter callerPerforationPatternClassIds, callerPerforationPatternRequirements, observedPerforationPatternEvidence, knownPerforationPatternFlags, following the field table and calculation rules below, then run the tool.
- Read compatibleCallerClasses, fullyWitnessedCallerClasses. For result objects, inspect the nested output fields below, including any missing evidence or selected indices.
- Correct any input issues and run again. Before using a successful result, review its units, signs, evidence coverage, and stated model or reference assumptions.
| Input field | Meaning | Value type | Requirement |
|---|---|---|---|
| callerPerforationPatternClassIds | Caller perforation pattern class ids | list of string | Required |
| callerPerforationPatternRequirements | Caller perforation pattern requirements | numeric matrix | Required |
| observedPerforationPatternEvidence | Observed perforation pattern evidence | list of number | Required |
| knownPerforationPatternFlags | Known perforation pattern flags; binary 1 means assessed and 0 means unknown. | list of number | Required |
Prepare unique nonblank caller class IDs and a nonempty rectangular binary requirement matrix, with rows aligned to classes and columns to observed evidence and known flags. Every class must require at least one positive feature. A one requires positive evidence; zero ignores the feature and does not require its absence. Both evidence and known flags must be binary. Known required evidence equal to zero excludes a class; unknown required evidence leaves it compatible but unwitnessed. Return every compatible class and the subset for which all required positive evidence is known and present. Requirements can overlap and do not imply a single winner.
compatible_c=∀j(requirement_cj=0 or known_j=0 or evidence_j=1); witnessed_c=∀j(requirement_cj=0 or (known_j=1 and evidence_j=1)) Read these symbols with the field meanings and branch or reference rules above.
| Output field | Meaning | Value type |
|---|---|---|
| compatibleCallerClasses | All supplied classes with no contradiction in known required positive evidence, preserving reference order. | list of string |
| fullyWitnessedCallerClasses | Compatible supplied classes whose required positive evidence is entirely known and present. | list of string |
{
"input": {
"callerPerforationPatternClassIds": [
"a",
"b"
],
"callerPerforationPatternRequirements": [
[
1,
0
],
[
0,
1
]
],
"observedPerforationPatternEvidence": [
1,
0
],
"knownPerforationPatternFlags": [
1,
0
]
},
"output": {
"compatibleCallerClasses": [
"a",
"b"
],
"fullyWitnessedCallerClasses": [
"a"
]
}
}Limitations and assumptions
Class definitions and evidence observations must be independently established for the relevant issue and reference context. Compatibility with incomplete evidence is not a positive identification, and fully witnessed classes satisfy only the supplied requirements.
Missing required fields, unknown fields, wrong types, and violated calculation rules return input issues. Numeric values must be finite; nonfinite numeric outputs are rejected. Arrays must be dense, with no missing cells. Numeric lists allow at most 10000 entries, subject to smaller tool-specific bounds above. Ordinary string lists allow at most 128 strings of at most 128 UTF-16 units each. Numeric matrices allow at most 128 rows and 128 entries per row, with exact shape requirements stated above.
Alternative or Complementary methods
For a related task, use Harrow Perf Notation Decoder: Compound perforation notation can express horizontal and vertical gauges as two positive numbers separated by x. This decoder parses that literal notation and preserves the numeric distinction without identifying a perforating machine. For a complementary step, use Roulette Separation Identifier (no holes): Rouletting separates stamps through small cuts rather than a row of punched perforation holes. This identifier compares supplied evidence with caller-defined class requirements and retains ambiguity where observations are missing.
References
Similar or alternative tools
- Harrow Perf Notation Decoder
Compound perforation notation can express horizontal and vertical gauges as two positive numbers separated by x. This decoder parses that literal notation and preserves the numeric distinction without identifying a perforating machine.
- Roulette Separation Identifier (no holes)
Rouletting separates stamps through small cuts rather than a row of punched perforation holes. This identifier compares supplied evidence with caller-defined class requirements and retains ambiguity where observations are missing.