FOI-O: An NZ-first ontology and verification methods package for Freedom of Information process modelling

• URL: http://arxiv.org/abs/2607.02947v1
• Date: Fri, 03 Jul 2026 04:46:06 GMT
• Title: FOI-O: An NZ-first ontology and verification methods package for Freedom of Information process modelling
• Abstract summary: FOI-O is a reusable process-modelling method and verification infrastructure for Freedom of Information administration.<n> FOI-O NZ, based on the New Zealand Official Information Act, is the only implemented and validated jurisdictional profile.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Public official-information request records contain process signals. They can support research, workflow review, and human-supervised agent help. Yet they also mix observed correspondence, platform states, inferred events, and legal outcomes. FOI-O is a reusable process-modelling method and verification infrastructure for Freedom of Information administration. FOI-O NZ, based on the New Zealand Official Information Act, is the only implemented and validated jurisdictional profile in the current repository. Broader reuse is a design intent and future validation path, not an empirical result of this package. FOI-O models the request record first. Request profiles, observed correspondence events, controlled vocabularies, and provenance make visible what was seen and how it was changed. It then adds review queues, release metadata, bounded agent contracts, semantic assets, process-model artefacts, and fixture-only process-mining interchange examples. Human certification of legally meaningful outcomes stays outside autonomous tooling. The repository provides JavaScript Object Notation (JSON) Schema contracts, Python data models, Simple Knowledge Organization System (SKOS) vocabularies, Web Ontology Language (OWL), Resource Description Framework (RDF), and Shapes Constraint Language (SHACL) assets. These are supported by deterministic examples, release metadata, quality gates, tests, Business Process Model and Notation (BPMN) and Petri Net Markup Language (PNML) process models, XES and OCEL-style fixture exports, and a planned New Zealand annotation task-set manifest. This article describes the motivation, architecture, ontology-development method, validation evidence, and implementation boundaries. The project is not legal advice, is not an official government publication, and does not certify release, refusal, redaction, charging, extension, transfer, complaint, or publication outcomes.

Related papers

• From Event Logs to Governed Action: A BlueSky Agenda for Agentic Process Mining [72.81644384922838]
  We propose event-to-action process mining: a process-mining agenda for transforming heterogeneous operational event data into governed action.<n>We argue that the community needs four mineable artifacts: event-object representations, action evidence packages, governance contracts, and benchmarks where act, defer, ask, and refuse are all valid outputs.
  arXiv  Detail & Related papers  (2026-09-07T21:02:23Z)
• Formal Verification of Agentic Systems over Operational Data [59.98246281888422]
  Agentic systems driven by large language models (LLMs) are increasingly deployed in real-world where they act on persistent operational data.<n>Existing approaches do not provide such system-level guarantees.<n>We study here the verification of agentic systems comprising a single LLM and a tool orchestration harness over relational operational data.
  arXiv  Detail & Related papers  (2026-08-04T13:01:30Z)
• PhyAgentOS: A Self-Evolving Operating System for Embodied Agents with Decoupled Cognitive Planning and Physical Execution [49.776611937968]
  We present PhyAgentOS, a foundation delivering scheduling, verification, memory, benchmarking, and safety as system-level services.<n>Its Session-Centered treats a session, not an action, as the minimum unit of scheduling, compatibility, supervised execution, evidence collection, and acceptance.<n>SessionVerifier distinguishes execution termination from semantic task completion via evidence-grounded verdicts of success, failure, or replan.<n> Benchmarking reuses the deployment session and verification path, so results trace to real execution.
  arXiv  Detail & Related papers  (2026-07-18T04:46:53Z)
• PatchOptic for Shared-State LLM Workflows with Projected Views and Verified Structured Updates [0.013714053458441644]
  We introduce PatchOptic, a contract between local updates and global validity.<n>Each workflow step declares a projected read view, an authorized write region, and a patch-source region.<n>We evaluate this design with PatchBench, a benchmark with 46 cases across reported leakage and token cost.
  arXiv  Detail & Related papers  (2026-07-06T16:13:56Z)
• From Agent Traces to Trust: Evidence Tracing and Execution Provenance in LLM Agents [20.651400118242346]
  Large language model (LLM)-based agents increasingly solve complex tasks by interacting with external tools, retrieval systems, memory modules, environments, and other agents.<n>Final-answer accuracy alone cannot explain how an output was produced, which evidence supported each claim, whether tool calls were justified, how memory influenced later decisions, or where execution failures originated.<n>Evidence tracing and execution provenance address this gap by modeling how retrieved evidence, tool outputs, memory items, environment observations, intermediate claims, actions, and final answers are connected throughout agent execution.
  arXiv  Detail & Related papers  (2026-06-03T15:12:47Z)
• To Redact, or not to Redact? A Local LLM Approach to Deliberative Process Privilege Classification [0.2979301924660567]
  We build on prior research to perform automatic sensitivity classification for the FOIA Exemption 5 deliberative process privilege.<n>We perform sensitivity classification with a small, local model, deployable on consumer-grade hardware.<n>We find that sentences that are predicted as deliberative contain more verbs that indicate the expression of opinions.
  arXiv  Detail & Related papers  (2026-05-11T08:55:09Z)
• Making AI-Assisted Grant Evaluation Auditable without Exposing the Model [0.0]
  We propose a TEE-based architecture that helps reconcile requirements through remote attestation.<n>The architecture allows an external verifier to check which model, rubric, prompt template, and input representation were used.<n>We position the design relative to confidential AI inference, attestable AI audits, zero-knowledge machine learning, algorithmic accountability, and AI-assisted peer review.
  arXiv  Detail & Related papers  (2026-04-28T04:10:04Z)
• Finding the Translation Switch: Discovering and Exploiting the Task-Initiation Features in LLMs [69.28193153685893]
  Large Language Models (LLMs) frequently exhibit strong translation abilities, even without task-specific fine-tuning.<n>To demystify this process, we leverage Sparse Autoencoders (SAEs) and introduce a novel framework for identifying task-specific features.<n>Our work not only decodes a core component of the translation mechanism in LLMs but also provides a blueprint for using internal model mechanism to create more robust and efficient models.
  arXiv  Detail & Related papers  (2026-01-16T06:29:07Z)
• Named entity recognition for Serbian legal documents: Design, methodology and dataset development [0.0]
  We present one solution for Named Entity Recognition (NER) in the case of legal documents written in Serbian language.<n>It leverages on the pre-trained bidirectional encoder representations from transformers (BERT), which had been carefully adapted to the specific task of identifying and classifying specific data points from textual content.
  arXiv  Detail & Related papers  (2025-02-14T22:23:39Z)
• Predicting the Performance of Black-box LLMs through Self-Queries [60.87193950962585]
  Large language models (LLMs) are increasingly relied on in AI systems, predicting when they make mistakes is crucial.<n>In this paper, we extract features of LLMs in a black-box manner by using follow-up prompts and taking the probabilities of different responses as representations.<n>We demonstrate that training a linear model on these low-dimensional representations produces reliable predictors of model performance at the instance level.
  arXiv  Detail & Related papers  (2025-01-02T22:26:54Z)
• Adapting Large Language Models for Content Moderation: Pitfalls in Data Engineering and Supervised Fine-tuning [79.53130089003986]
  Large Language Models (LLMs) have become a feasible solution for handling tasks in various domains. In this paper, we introduce how to fine-tune a LLM model that can be privately deployed for content moderation.
  arXiv  Detail & Related papers  (2023-10-05T09:09:44Z)
• FacTeR-Check: Semi-automated fact-checking through Semantic Similarity and Natural Language Inference [61.068947982746224]
  FacTeR-Check enables retrieving fact-checked information, unchecked claims verification and tracking dangerous information over social media. The architecture is validated using a new dataset called NLI19-SP that is publicly released with COVID-19 related hoaxes and tweets from Spanish social media. Our results show state-of-the-art performance on the individual benchmarks, as well as producing useful analysis of the evolution over time of 61 different hoaxes.
  arXiv  Detail & Related papers  (2021-10-27T15:44:54Z)
• Key Information Extraction From Documents: Evaluation And Generator [3.878105750489656]
  This research project compares state-of-the-art models for information extraction from documents. The results have shown that NLP based pre-processing is beneficial for model performance. The use of a bounding box regression decoder increases the model performance only for fields that do not follow a rectangular shape.
  arXiv  Detail & Related papers  (2021-06-09T16:12:21Z)
• Knowledge-Aware Procedural Text Understanding with Multi-Stage Training [110.93934567725826]
  We focus on the task of procedural text understanding, which aims to comprehend such documents and track entities' states and locations during a process. Two challenges, the difficulty of commonsense reasoning and data insufficiency, still remain unsolved. We propose a novel KnOwledge-Aware proceduraL text understAnding (KOALA) model, which effectively leverages multiple forms of external knowledge.
  arXiv  Detail & Related papers  (2020-09-28T10:28:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.