From ambiguous utterances to governed reuse classes: canonicalization, quotient invariance, and conditional decidability

• URL: http://arxiv.org/abs/2607.10069v1
• Date: Sat, 11 Jul 2026 01:49:04 GMT
• Title: From ambiguous utterances to governed reuse classes: canonicalization, quotient invariance, and conditional decidability
• Abstract summary: Reuse should operate on a mathematically characterized quotient of resolved conversational demands.<n> Reuse identity licenses the governed query key and its certified answer space.<n>The supporting layer is stated at exactly the strength proved.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Semantic caching defines answer reuse on embedding similarity: two utterances share a stored answer when a similarity score clears a threshold, with no notion of authorization, versioning, or of what makes two demands the same. This note changes the object on which reuse is defined: in a governed domain, reuse should operate on a mathematically characterized quotient of resolved conversational demands, not on a similarity heuristic. Three independently defined relations on resolved utterances -- reading identity, resolution identity, and reuse identity -- form a refinement chain, strict under realized nondegeneracy conditions checkable on deployment logs; the pipeline's outputs are invariant along the chain, and reuse identity is exactly the kernel of the resolution map into the governed answer partition, so the reuse quotient is the utterance-side object that partition induces, not a relabeling of it. Reuse identity licenses the governed query key and its certified answer space; reuse of a particular answer requires resolution identity or an applicability certificate. The supporting layer is stated at exactly the strength proved: exact-denotation normal forms; join aggregation as a design operator, with closure-stable cells characterizing no-escape; total computability of the full pipeline relative to an untrusted proposal layer; policy admissibility for arbitrary proposers -- and provably not factual grounding or intent fidelity; and elicitation terminating after finitely many informative replies, sound under target consistency.

Related papers

• How Correct Is Your Answer? A Semantic Correctness Framework for Open QA Evaluation [38.482877747109946]
  We introduce a semantic correctness taxonomy that assigns open-ended answers to eight ordered classes, separating verbose-but-correct answers from those contaminated by hallucinated content.<n>Second, we release CAP-Correctness, an 8.8k-example benchmark spanning widely used QA datasets, and CAP-Statements, an 11k-example dataset for converting question-answer pairs into declarative statements.<n>Third, we introduce CAP (Context-Aware Precision), a reference-based metric that scores question-conditioned statements using bidirectional NLI.
  arXiv  Detail & Related papers  (2026-09-01T15:06:39Z)
• Renaming or Tightness: Enforcing Disjunctive Information Flow Policies [7.541234468065092]
  A disjunctive policy allows a value to depend on at most one of two secrets and never on both.<n>Hunt and Sands introduced the quantale of information to give them a semantics, leaving the enforcement layer open.<n>We build the flow-sensitive type system family that the quantale calls for, and show that the object which makes such families useful splits in two.
  arXiv  Detail & Related papers  (2026-08-10T04:53:10Z)
• SEER: A Self-Grounded Evidence Interface for Controlled Spatial Relation Classification [71.9783246097687]
  SEER hides candidate relations during pair localization, constructs a query-specific view with explicit subject/object roles, and retains the full image and sparse box geometry as complementary evidence.<n>For relation-choice protocols with exact inverse support, an optional refinement swaps the entity roles and changes the forward decision only when exactly one visual state obeys the corresponding inverse relation.<n>The unchanged protocol yields +4.35 to +11.79 on all 2,434 filtered EmbSpatial pair-relation questions across three models.
  arXiv  Detail & Related papers  (2026-08-04T13:16:15Z)
• C$^{2}$R: Cross-sample Consistency Regularization Mitigates Feature Splitting and Absorption in Sparse Autoencoders [56.67585330425431]
  Sparse Autoencoders (SAEs) are widely used to interpret large language models by decomposing activations into sparse, human-understandable features.<n>These issues stem from inconsistent latent assignment across samples.<n>We introduce C$2$R, which penalizes the co-activation of directionally similar latents.
  arXiv  Detail & Related papers  (2026-06-29T17:45:31Z)
• Finite Certificates for In-Context Determinacy and a Threshold Theory of Emergence in Language Models [0.2864713389096699]
  This paper develops a model-theoretic framework for verifying context-conditioned language-model behavior.<n>It provides finite context certificates, pair-separator hitting sets, query teaching dimension, prompt-preservation criteria, and scale-limit witnesses.
  arXiv  Detail & Related papers  (2026-05-30T14:07:58Z)
• Semantic Sections: An Atlas-Native Feature Ontology for Obstructed Representation Spaces [0.0]
  We introduce an atlas-native replacement object, the semantic section.<n>We show that cycle consistency is the key criterion for genuine globalization.<n>We find nontrivial populations of semantic sections across layer-16 atlases for Llama 3.2 3B Instruct, Qwen 2.5 3B Instruct, and Gemma 2 2B IT.
  arXiv  Detail & Related papers  (2026-03-21T15:59:29Z)
• Controllable Evidence Selection in Retrieval-Augmented Question Answering via Deterministic Utility Gating [0.0]
  This paper presents a deterministic evidence selection framework for retrieval-augmented question answering.<n>The approach introduces Meaning-Utility Estimation (MUE) and Diversity-Utility Estimation (DUE)<n>In the prototype, a unit is accepted only if it explicitly states the fact, rule, or condition required by the task.
  arXiv  Detail & Related papers  (2026-02-23T18:20:15Z)
• Non-Resolution Reasoning (NRR): A Computational Framework for Contextual Identity and Ambiguity Preservation [0.0]
  Current artificial intelligence systems exhibit a fundamental architectural limitation: they resolve ambiguity prematurely.<n>This premature semantic collapse stems from classical identity assumptions embedded in standard neural architectures.<n>We propose Non-Resolution Reasoning (NRR), a computational framework that treats ambiguity retention as a valid reasoning mode.
  arXiv  Detail & Related papers  (2025-12-15T16:14:32Z)
• Beyond Inference Intervention: Identity-Decoupled Diffusion for Face Anonymization [55.29071072675132]
  Face anonymization aims to conceal identity information while preserving non-identity attributes.<n>We propose textbfIDsuperscript2Face, a training-centric anonymization framework.<n>We show that IDtextsuperscript2Face outperforms existing methods in visual quality, identity suppression, and utility preservation.
  arXiv  Detail & Related papers  (2025-10-28T09:28:12Z)
• Is the Top Still Spinning? Evaluating Subjectivity in Narrative Understanding [40.78154629252038]
  Forcing binary labels upon ambiguous claims lowers the reliability of evaluation.<n>We introduce LLM-generated edits of summaries as a method of providing a nuanced evaluation of claims.<n>We show that ARM produces a absolute 21% improvement in annotator agreement on claim faithfulness.
  arXiv  Detail & Related papers  (2025-04-01T19:08:24Z)
• A Framework for Combining Entity Resolution and Query Answering in Knowledge Bases [13.700646439200423]
  We propose a new framework for entity resolution and query answering in knowledge bases. We define the semantics of the KB in terms of special instances that involve equivalence classes of entities and sets of values. We then design a chase procedure that is tailored to this new framework and has the feature that it never fails.
  arXiv  Detail & Related papers  (2023-03-13T21:10:57Z)
• Nested Counterfactual Identification from Arbitrary Surrogate Experiments [95.48089725859298]
  We study the identification of nested counterfactuals from an arbitrary combination of observations and experiments. Specifically, we prove the counterfactual unnesting theorem (CUT), which allows one to map arbitrary nested counterfactuals to unnested ones.
  arXiv  Detail & Related papers  (2021-07-07T12:51:04Z)
• Dive into Ambiguity: Latent Distribution Mining and Pairwise Uncertainty Estimation for Facial Expression Recognition [59.52434325897716]
  We propose a solution, named DMUE, to address the problem of annotation ambiguity from two perspectives. For the former, an auxiliary multi-branch learning framework is introduced to better mine and describe the latent distribution in the label space. For the latter, the pairwise relationship of semantic feature between instances are fully exploited to estimate the ambiguity extent in the instance space.
  arXiv  Detail & Related papers  (2021-04-01T03:21:57Z)
• Style Normalization and Restitution for Generalizable Person Re-identification [89.482638433932]
  We design a generalizable person ReID framework which trains a model on source domains yet is able to generalize/perform well on target domains. We propose a simple yet effective Style Normalization and Restitution (SNR) module. Our models empowered by the SNR modules significantly outperform the state-of-the-art domain generalization approaches on multiple widely-used person ReID benchmarks.
  arXiv  Detail & Related papers  (2020-05-22T07:15:10Z)

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.