Metraipolis › archive › dc_c1df414fafc8
Deterministic Temporal Reconciliation for Effective-Dated Identity Lifecycle Events — arXiv:2609.14017
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.14017
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T23:17:46.698Z
- SHA-256 of the archived text
6936621b692f314c51e644d647d9fa045ed5851da2b2d1e9bed82e92ca164c62- Stable URL of this page
https://metraipolis.com/documento/dc_c1df414fafc8
How to cite
Deterministic Temporal Reconciliation for Effective-Dated Identity Lifecycle Events — arXiv:2609.14017 — arXiv (en), https://arxiv.org/abs/2609.14017 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c1df414fafc8 (Metraipolis archive dc_c1df414fafc8, sha256 6936621b692f314c51e644d647d9fa045ed5851da2b2d1e9bed82e92ca164c62)
BibTeX
@misc{dcc1df414fafc8,
title = {Deterministic Temporal Reconciliation for Effective-Dated Identity Lifecycle Events — arXiv:2609.14017},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.14017},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c1df414fafc8; sha256 6936621b692f314c51e644d647d9fa045ed5851da2b2d1e9bed82e92ca164c62},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.14017. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Identity lifecycle automation processes workforce changes that carry two distinct notions of time: when a business fact becomes effective and when an authoritative source last revised it. Corrections, cancellations, future-dated changes, duplicate delivery, and out-of-order arrival can therefore produce divergent account states when processors rely on transport order or effective time alone. This paper presents a deterministic temporal reconciliation method for effective-dated identity events. The method separates logical business facts from their physical revisions, deduplicates exact replays, selects the authoritative revision of each fact using transaction-time freshness, removes canceled facts, and then applies surviving facts in valid-time order. We establish permutation invariance, replay idempotence, revision dominance, and deterministic snapshot construction under explicit source assumptions. A reproducible synthetic fault-injection benchmark compares the method with arrival-order, effective-time, and transaction-time processing. Across 250,000 generated identity histories and 1,585,589 delivered records, the proposed method reconstructed the separately retained authoritative final state in all tested cases. At 75% delivery disorder, exact-state accuracy was 42.35% for arrival-order processing, 85.38% for effective-time sorting, 76.61% for transaction-time sorting, and 100% for the proposed method. A separate 40,000-permutation experiment produced the same final state for every tested permutation under the proposed reconciliation contract. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-15 in cs.DC). Categorie arXiv: Software Engineering (cs.SE) ; Distributed, Parallel, and Cluster Computing (cs.DC). Pagina del lavoro: https://arxiv.org/abs/2609.14017 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-15T22:54:13.012Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).