List eligible click candidates
Synthetic conversion E27 at 10:10 has eligible clicks A10:06,B10:08,C10:08 for the same visitor. Local model chooses the unique latest click strictly before the event time; no tie-break priority is supplied. A can be excluded as older, but B/C remain tied. No actual channel performance is inferred.
| Click | Time | Disposition |
|---|---|---|
| A | 10:06 | Older |
| B | 10:08 | Latest tied |
| C | 10:08 | Latest tied |
Find the latest candidate time
- Read eligible candidate set
- Take maximum prior time 10:08
- Retain B/C tied set
- Hold exclusive credit for a source rule
Do not invent a click-ID alphabetic priority.
How many latest candidates and exclusive credits are established?
Show the worked answer
Two latest candidates, zero exclusive credits. Row order cannot establish whether B or C should receive the supplied last-touch credit.
Resolve tied evidence separately
| Case | Decision or result | Reason |
|---|---|---|
| Pick first B row | Reject hidden rule | Tie unresolved |
| Keep B/C unresolved | Accurate state | No unique latest click |
Attach the tied candidate references to the attribution review. A later explicit tie rule must be recorded before allocating the credit.