Skip to content
DraconiticResearch
Search Sources API
203,952 studies31 sourcesUpdated 25 min ago
PreprintCC BY 4.0Zenodo

Selective Replay Under Incomplete Dependency Information: An exploratory benchmark of correctness and audit cost

  • Matthew Looney1
  1. 1Magnexis
Open at sourcePDFDOICite

Abstract

A reproducible exploratory computer-science preprint on selective workflow replay under incomplete dependency information. The accompanying source archive contains two executed dependency-free Python experiments: a 480-scenario in-memory DAG study and a 96-scenario controlled file-processing study using generated temporary files. The evidence rejects the assumption that sparse random auditing alone makes incomplete dependency tracking safe; it does not prove general workflow correctness or deployed-system performance. Version 1.0 is not peer reviewed.

Related

  1. The Distribution of Lexical Information Within Dependency Spans: Cross-Linguistic Evidence from 22 Languages
    Entropy (Basel, Switzerland)Peer-reviewedCC BYFull textEurope PMC
  2. Scheduling with Bounded Information: Correctness, Progress, and Near-Optimal Performance in DTA
    Xinyu Yang
    ZenodoPreprintCC BY 4.0Full textZenodo
  3. Learning and Steering in Incomplete-Information Games
    Asrın Efe Yorulmaz, Tamer Başar
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  4. Dependency, Compression, and Synergy: A Unified Information-Theoretic View of Multimodal Learning
    Liangjian Wen, Linjie Li, Jiang Duan +3
    arXivPreprintCC0Full textGeneral mathematicsarXiv
  5. Partial-field inferability of galaxy overdensity structure: An information-geometric account of incomplete sky coverage
    Marko Imbrišak, Krešimir Tisanić
    arXivPreprintCC BY 4.0Full textInstrumentation & methodsarXiv

Cite

BibTeXRIS
BibTeX
@misc{looney2026selective,
  title = {{Selective Replay Under Incomplete Dependency Information: An exploratory benchmark of correctness and audit cost}},
  author = {Matthew Looney},
  howpublished = {Zenodo},
  year = {2026},
  month = oct,
  doi = {10.5281/zenodo.23545812},
  url = {https://zenodo.org/records/23545812},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Selective Replay Under Incomplete Dependency Information: An exploratory benchmark of correctness and audit cost
AU  - Matthew Looney
PY  - 2026
DA  - 2026/10/21
PB  - Zenodo
DO  - 10.5281/zenodo.23545812
UR  - https://zenodo.org/records/23545812
AB  - A reproducible exploratory computer-science preprint on selective workflow replay under incomplete dependency information. The accompanying source archive contains two executed dependency-free Python experiments: a 480-scenario in-memory DAG study and a 96-scenario controlled file-processing study using generated temporary files. The evidence rejects the assumption that sparse random auditing alone makes incomplete dependency tracking safe; it does not prove general workflow correctness or deployed-system performance. Version 1.0 is not peer reviewed.
ER  -