Metraipolis › archive › dc_b27ab43d65de
Epistemic Typing as a PostgreSQL Table Access Method: Adversarial Conflict Resolution Under Confidence Forgery and Sybil Coordination — arXiv:2609.36795
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.36795
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T17:27:07.510Z
- SHA-256 of the archived text
48270f0beda34fbd9412f58dd17ad3fd22de82cce2bf89b090149e4e0e171c92- Stable URL of this page
https://metraipolis.com/documento/dc_b27ab43d65de
How to cite
Epistemic Typing as a PostgreSQL Table Access Method: Adversarial Conflict Resolution Under Confidence Forgery and Sybil Coordination — arXiv:2609.36795 — arXiv (en), https://arxiv.org/abs/2609.36795 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b27ab43d65de (Metraipolis archive dc_b27ab43d65de, sha256 48270f0beda34fbd9412f58dd17ad3fd22de82cce2bf89b090149e4e0e171c92)
BibTeX
@misc{dcb27ab43d65de,
title = {Epistemic Typing as a PostgreSQL Table Access Method: Adversarial Conflict Resolution Under Confidence Forgery and Sybil Coordination — arXiv:2609.36795},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.36795},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b27ab43d65de; sha256 48270f0beda34fbd9412f58dd17ad3fd22de82cce2bf89b090149e4e0e171c92},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.36795. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We describe KNDB, a PostgreSQL 18 table access method (TAM) that types every row with an engine-assigned epistemic kind (MEASURED, INFERRED, or DERIVED) and resolves per-slot conflicts inside every write-time heapam callback. Rows land as ordinary heap tuples; seven of the 44 TAM callbacks are overridden (tuple_insert, multi_insert, tuple_update, tuple_delete, tuple_insert_speculative, tuple_complete_speculative, relation_toast_am), the other 37 delegate to heap; we provide a completeness argument over the interface as a paper artefact. This paper reports the engineering behind that decision and the adversarial evaluation that motivated it. On a confidence-forgery workload where an attacker asserts INFERRED writes with confidence in [0.95,1.0] against honest MEASURED writes with confidence in [0.5,0.9], KNDB beats a confidence-only baseline by 63 percentage points on the Book-Author fusion dataset and 92.7 points on the Zheng crowdsourcing dataset. Both wins are proven load-bearing on the kind axis by a source-rebuild disable-and-test in which the lattice is neutralised and the win vanishes. Against four truth-discovery baselines (TruthFinder, CRH, CATD, ACCU) reimplemented from the original equations and validated to within 0.3 percentage points of the published numbers, KNDB is competitive below a per-dataset density-saturation cell and dominant at or above it. We formalise the cell as k* ~ rho_alg * h_top, where h_top is per-slot top honest surface-form support, and validate the prediction within +/-20% on Book-Author and +/-30% on Zheng. Because the kind axis is assigned by the engine from independent metadata and cannot be forged at write time, KNDB's k* is unbounded. The paper is honest about where KNDB loses: CRH and ACCU outperform KNDB below saturation on Zheng, and KNDB scores zero on three temporal knowledge-editing benchmarks whose ground truth is last-writer-wins. Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-09-30 in cs.CR). Categorie arXiv: Databases (cs.DB) ; Cryptography and Security (cs.CR). Pagina del lavoro: https://arxiv.org/abs/2609.36795 — 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-07T16:58:17.381Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).