Context-based Proposition Maps (CPMs)

• CPMs are structured representations that map domain-specific contextual evidence into propositional forms to enable reasoning, retrieval, or optimization.
• In retrieval contexts like PropRAG, CPMs preserve text, temporal, and entity relations via graph-based proposition paths, leading to high recall and precision.
• CPMs also underpin protocol security testing and renal pathology segmentation by embedding context-driven labels and anatomical priors into model constraints.

Searching arXiv for the provided paper and related uses of "Context-based Proposition Maps". Context-based Proposition Maps (CPMs) are structured representations that map context into propositions so that downstream systems can reason over knowledge, protocol behavior, or anatomical relations while retaining constraints that flatter representations often discard. In current arXiv usage, the term appears in three technically distinct forms: PropRAG represents corpus knowledge as contextually rich propositions and traverses proposition paths in a graph for retrieval-augmented generation; "Learn, Check, Test — Security Testing Using Automata Learning and Model Checking" annotates learned Mealy machines with atomic propositions derived from protocol context for model checking; and PrPSeg encodes renal anatomical propositions in a universal proposition matrix that regularizes segmentation under partial labels (Wang, 25 Apr 2025, Marksteiner et al., 26 Sep 2025, Deng et al., 2024).

1. Core idea and scope

In all three formulations, a CPM links contextual evidence to a proposition space that can be consumed by a reasoning or optimization procedure. In PropRAG, the context is textual and relational: propositions preserve conditions, provenance, temporal qualifiers, and $N$-ary relations, and retrieval is reframed as search over proposition paths rather than independent passages. In the security-testing formulation, the context is protocol-specific behavior observed at a communication interface: message types, parameters, status codes, roles, and timing outcomes are mapped to atomic propositions attached to states or temporary internal states. In PrPSeg, the context is anatomical prior knowledge: containment and exclusivity relations among renal structures are encoded as machine-readable propositions that constrain segmentation masks.

Domain	CPM instantiation	Operational role
Retrieval-augmented generation	Contextually rich propositions plus proposition-induced graph structure	Multi-step retrieval via beam search and PPR
Automata learning and model checking	Conditions that map Mealy input/output context to atomic propositions	Security-property checking on annotated behavioral models
Renal pathology segmentation	Universal proposition matrix $M$	Anatomy loss and partial-label supervision

The literature suggests that “CPM” is not a single canonical data structure but a shared design principle: preserve context explicitly, represent it propositionally, and make the resulting propositions actionable in a downstream inference pipeline. That family resemblance is strong, but the concrete mathematical objects differ substantially across the three settings.

2. Proposition-path CPMs in retrieval-augmented generation

In PropRAG, CPMs are realized by representing corpus knowledge as contextually rich propositions and explicitly traversing multi-proposition paths in a graph whose edges preserve the natural co-occurrence and synonymy structure of entities within those propositions. A proposition $p_i$ has text $t_i$, an entity set $\mathcal{E}(p_i)\subseteq \mathcal{E}$, and an embedding $f(p_i)\in\mathbb{R}^d$; the query is a natural-language question $q$ with embedding $f(q)\in\mathbb{R}^d$. The graph $G=(V,E)$ has $V=V_{\text{entity}}\cup V_{\text{passage}}$. For each proposition $M$0, entity clique edges connect every pair of distinct co-occurring entities, passage containment edges connect entities to source passages, and synonymy edges connect entity nodes when $M$1, with $M$2 in experiments. This differs fundamentally from triple-based knowledge graphs: instead of fragmenting $M$3-ary statements into binary predicates, PropRAG treats each proposition as a hyper-edge implemented as an entity clique, leaving temporal, conditional, and provenance cues accessible through the proposition text (Wang, 25 Apr 2025).

Retrieval is formulated as search for a proposition path

$M$4

subject to an adjacency constraint through shared or synonymous entities, a length bound $M$5, and a coherence constraint

$M$6

with $M$7 used for pruning. Initial path scoring uses an averaged path embedding,

$M$8

and the top $M$9 expansions per step are re-ranked by a concatenated-text embedding,

$p_i$0

with $p_i$1. Beam search initializes from the top $p_i$2 propositions most similar to the query, keeps beam width $p_i$3 partial paths, and stops at $p_i$4 or when no valid expansions remain; defaults are $p_i$5 and typical $p_i$6. Two-stage retrieval couples this path search with Personalized PageRank: Stage 1 runs PPR on the full graph with damping $p_i$7 to select top $p_i$8 passages and induce a focused subgraph, while Stage 2 blends initial and path-derived entity seeds, forms a reset vector with $p_i$9, and runs a final exploitative PPR on the subgraph with damping $t_i$0. The passage ranking uses the standard PPR equation

$t_i$1

and the top $t_i$2 passages are selected for answer generation.

The online retrieval process is entirely LLM-free: initial proposition retrieval, both PPR runs, subgraph induction, beam search, and final passage selection do not invoke generative LLMs. LLMs are used offline for entity and proposition extraction with Llama-3.3-Instruct, and post-retrieval for answer generation; NV-Embed-v2 is used for entities, propositions, and passages. Empirically, PropRAG reports zero-shot Recall@5 of $t_i$3 on PopQA, $t_i$4 on 2Wiki, $t_i$5 on HotpotQA, $t_i$6 on MuSiQue, and $t_i$7 on NQ, alongside F1 scores including $t_i$8 on MuSiQue, $t_i$9 on 2Wiki, $\mathcal{E}(p_i)\subseteq \mathcal{E}$0 on HotpotQA, $\mathcal{E}(p_i)\subseteq \mathcal{E}$1 on PopQA, and $\mathcal{E}(p_i)\subseteq \mathcal{E}$2 on NQ. The reported gains are strongest on multi-hop datasets, and ablations show peak performance at $\mathcal{E}(p_i)\subseteq \mathcal{E}$3, robust behavior for $\mathcal{E}(p_i)\subseteq \mathcal{E}$4–$\mathcal{E}(p_i)\subseteq \mathcal{E}$5, and a slight degradation or no gain when the coherence filter is removed. A concrete MuSiQue path links “Mantua Cathedral is a Roman Catholic cathedral dedicated to Saint Peter,” “St. Peter’s Basilica is located in Vatican City,” and “No successor was appointed to the post of Governor of Vatican City after Marchese Camillo Serafini’s death in 1952,” illustrating how the bridge proposition at depth 2 enables final evidence retrieval and the answer 1952.

3. CPMs as semantic annotation for learned protocol models

In the automata-learning and model-checking setting, CPMs bridge a learned Mealy machine and a Kripke-style proposition labeling. The learned behavioral model of the System Under Learning is a Mealy machine

$\mathcal{E}(p_i)\subseteq \mathcal{E}$6

with input alphabet $\mathcal{E}(p_i)\subseteq \mathcal{E}$7, output alphabet $\mathcal{E}(p_i)\subseteq \mathcal{E}$8, transition function $\mathcal{E}(p_i)\subseteq \mathcal{E}$9, and output function $f(p_i)\in\mathbb{R}^d$0. The model-checking target is a Kripke structure

$f(p_i)\in\mathbb{R}^d$1

and CPMs provide the labeling function by mapping protocol-specific context to atomic propositions. The resulting annotated Mealy machine is formalized as

$f(p_i)\in\mathbb{R}^d$2

where states carry proposition labels while Mealy input/output labels are preserved. A CPM is specified by gain conditions $f(p_i)\in\mathbb{R}^d$3, loss conditions $f(p_i)\in\mathbb{R}^d$4, and temporary/internal conditions $f(p_i)\in\mathbb{R}^d$5. Each condition is a triplet

$f(p_i)\in\mathbb{R}^d$6

where $f(p_i)\in\mathbb{R}^d$7 is the affected proposition set, $f(p_i)\in\mathbb{R}^d$8 is the trigger-input set, and $f(p_i)\in\mathbb{R}^d$9 is the trigger-output set. Gains add propositions to target states, losses determine when propositions cease to hold, and temporary conditions expose transition outcomes as checkable propositions by splitting a transition and inserting a temporary internal state $q$0 (Marksteiner et al., 26 Sep 2025).

The labeling algorithm first initializes all state labels to $q$1, then applies gains on transitions, propagates propositions through loss-aware reachability until a fixpoint, and finally converts transition-defined outcomes into state labels via $q$2 states. For a transition $q$3, if a temporary condition matches, the transition is replaced by

$q$4

with

$q$5

Temporary propositions hold only in the inserted state. This makes LTL and CTL properties over transition outcomes expressible as state-label properties without discarding the original Mealy semantics. The annotated model is translated into Rebeca as a composition

$q$6

where the system actor stores the current learned state $q$7 and AP booleans, and the environment actor stores temporary propositions from $q$8, resets temporaries via a req method, and issues inputs non-deterministically. The paper further verifies code faithfulness by generating the full state space, collapsing the resulting LTS to a Mealy machine, and checking bisimilarity with the original learned model.

The generic security properties are protocol-agnostic and instantiated through CPM-provided APs such as AUTH, PROT, ACCESSOK, PRIV, CRIT, and INVKEYOK. Reported formulas include

$q$9

for authentication,

$f(q)\in\mathbb{R}^d$0

for confidentiality, and

$f(q)\in\mathbb{R}^d$1

for key validity. The case studies use NFC/eMRTD and UDS. For eMRTD, gains include AUTH on input BAC with output 9000, DF and PROT on DF* with 9000, EF on EF* with 9000, and CRIT on EF_DG2, EF_DG3 with 9000; temporaries include UREADOK and READOK on RD_BIN with 9000 and SREADOK and READOK on SRD_BIN with 9000. For UDS, gains include AUTH on SAWithKey with positive response 67, EXT on ExtendedDiagnosticSession with 5003, and PROG on ProgrammingSession with 5002; temporaries include INVKEYOK, WRONGKEYOK on SAWithWrongKey with 67, PROT and ACCESSOK, UACCESSOK on CheckASWBit with 71, CRIT on RequestDownload with 74, and UREADOK on Read* with 62. Reported checking results state that on two Austrian passports, authentication, confidentiality on protected EF, privilege levels, and key validity all held, whereas on the tested UDS ECU, authentication held, privilege levels held in practice, confidentiality was generally not applicable because UDS on CAN is unencrypted, and key validity was violated because SAWithWrongKey was accepted.

4. CPMs as anatomical priors in panoramic renal pathology segmentation

In PrPSeg, a CPM is a structured, machine-readable representation of class-level propositions that encode anatomical context, including part-of or containment, mutual exclusivity, and optionally adjacency, proximity, co-occurrence, and hierarchical relationships. The reported instantiation uses a universal proposition matrix

$f(q)\in\mathbb{R}^d$2

with $f(q)\in\mathbb{R}^d$3 in the main study, to encode strong affirmative and negatory relations inspired by Aristotelian categorical propositions. Matrix entries are interpreted as

$f(q)\in\mathbb{R}^d$4

$f(q)\in\mathbb{R}^d$5

The eight modeled classes span three scales: regions ([cortex](https://www.emergentmind.com/topics/cortex), medulla), functional units (glomerular capsule, glomerular tuft, distal tubule, proximal tubule), and cells (podocytes, mesangial cells). Encoded relations include Cortex ⊇ {Cap., Tuft, DT, PT}, Tuft ⊇ {Pod., Mes.}, Cap. ⊇ Tuft, and Medulla ∩ Cortex = ∅. Although the general proposition tensor can support multiple relation types,

$f(q)\in\mathbb{R}^d$6

with $f(q)\in\mathbb{R}^d$7 in the current instantiation, the reported implementation focuses on containment and exclusivity because these are presented as the most reliable relations for pathology masks across scales (Deng et al., 2024).

The training objective couples ordinary segmentation supervision with an anatomy loss derived from the proposition matrix. For a labeled class $f(q)\in\mathbb{R}^d$8 with ground-truth mask $f(q)\in\mathbb{R}^d$9 and predicted probability maps $G=(V,E)$0, the soft Dice loss is

$G=(V,E)$1

PrPSeg defines relational penalties

$G=(V,E)$2

for the constraint $G=(V,E)$3,

$G=(V,E)$4

for $G=(V,E)$5, and

$G=(V,E)$6

for exclusivity. The anatomy loss for class $G=(V,E)$7 is

$G=(V,E)$8

and the total objective is

$G=(V,E)$9

with $V=V_{\text{entity}}\cup V_{\text{passage}}$0 in the experiments. Training proceeds in two phases: 50 epochs with $V=V_{\text{entity}}\cup V_{\text{passage}}$1 only, then joint optimization with the anatomy loss.

The architecture is a token-based dynamic head single-network design built on a Residual U-Net encoder-decoder. Class-aware tokens $V=V_{\text{entity}}\cup V_{\text{passage}}$2 and scale-aware tokens $V=V_{\text{entity}}\cup V_{\text{passage}}$3, with $V=V_{\text{entity}}\cup V_{\text{passage}}$4 magnifications $V=V_{\text{entity}}\cup V_{\text{passage}}$5, condition the encoder and a lightweight dynamic head. The controller generates parameters for a 3-layer dynamic head with channels $V=V_{\text{entity}}\cup V_{\text{passage}}$6 and 162 parameters total. CPMs do not gate the feature path in the reported implementation; instead, they modulate optimization through $V=V_{\text{entity}}\cup V_{\text{passage}}$7, which supplies “virtual supervision” for unlabeled classes in partially labeled images. Reported datasets include PAS-stained region patches at $V=V_{\text{entity}}\cup V_{\text{passage}}$8 and $V=V_{\text{entity}}\cup V_{\text{passage}}$9, NEPTUNE functional-unit ROIs at $M$00 resized to $M$01, and PAS cell images at $M$02 and $M$03, with a $M$04 train/validation/test split at patient level. PrPSeg reports average Dice $M$05, with class-wise Dice of Medulla 72.38, Cortex 72.64, DT 72.45, PT 85.27, Cap. 94.23, Tuft 94.40, Pod. 70.98, and Mes. 66.96; the corresponding average for Omni-Seg is $M$06M$$.</p> <h2 class='paper-heading' id='formal-patterns-distinctions-and-common-misconceptions'>5. Formal patterns, distinctions, and common misconceptions</h2> <p>The most important distinction is that CPMs are not tied to a single representation family. In PropRAG, the central object is a proposition-induced graph whose proposition semantics are carried by text embeddings, entity cliques, synonymy edges, and path scoring; a proposition is not necessarily a graph node. In the security-testing formulation, the central object is a rule system over Mealy transitions that computes a labeling function$$M$07 and introduces $M$08 states to expose transition outcomes. In PrPSeg, the central object is a signed relation matrix $M$09 that converts anatomical priors into overlap-based regularization. Treating CPMs as synonymous with triple-based knowledge graphs, with state labeling alone, or with matrix priors alone would therefore be inaccurate (Wang, 25 Apr 2025, Marksteiner et al., 26 Sep 2025, Deng et al., 2024).

A related misconception is that CPMs are merely descriptive annotations. In all three papers, the propositions are operational. PropRAG uses them for beam search, coherence filtering, and PPR-based ranking; the security-testing approach uses them to instantiate generic LTL properties and generate counterexample-driven tests; PrPSeg uses them to impose anatomy loss and exploit partially labeled data. Another misconception is that context is ancillary. Each paper treats context preservation as the main technical reason to use propositions rather than flatter alternatives: PropRAG contrasts proposition text and entity cliques with triple fragmentation and context collapse; the security-testing work makes protocol semantics checkable by embedding status-code and message context into AP labels; and PrPSeg turns anatomical containment and exclusivity into computational constraints rather than leaving classes independent.

The literature also suggests a common structural template despite the domain differences. First, define a proposition vocabulary appropriate to the domain. Second, specify how contextual evidence activates, propagates, or scores propositions. Third, integrate the resulting propositional structure into a downstream objective: retrieval and ranking, model checking, or segmentation optimization. This suggests that CPMs are best understood as context-preserving proposition interfaces between raw domain evidence and formal downstream procedures.

6. Robustness, limitations, and future directions

Each CPM formulation has domain-specific failure modes. In PropRAG, reported failures include spurious paths, where high local similarity chains unrelated propositions, semantic drift on longer paths, and incomplete propositions when entity extraction misses key entities. The paper mitigates these issues with the coherence threshold $M$10, a best-performing cap of $M$11, balanced seeding through $M$12, and a two-stage exploration/exploitation schedule using PPR damping $M$13 and $M$14; it also presents non-parametric retrieval as a mechanism for avoiding catastrophic forgetting, since updates can be made by adding new propositions and edges offline without retraining the reader (Wang, 25 Apr 2025).

In the security-testing setting, the trade-offs are different. CPM design must reflect protocol semantics accurately; otherwise, gains, losses, or temporaries may mislabel the model. The insertion of temporary $M$15 states slightly increases state space, confidentiality properties may be inapplicable for unencrypted bus protocols such as UDS over CAN, and some roles such as higher-level security may be hypothetical if not supported by the System Under Learning. The reported outlook includes broader adapters for more protocols, additional generic properties, timing-aware learning and CPMs for timed properties, automated CPM and property generation from threat models, and dynamic input alphabet extension via mutation (Marksteiner et al., 26 Sep 2025).

In PrPSeg, the central risks arise from prior mis-specification rather than graph drift or labeling semantics. Incorrect containment or exclusivity relations can bias training; conflicting rules or cycles in the hierarchy reduce consistency; domain shift across stains or scanners can degrade performance; and adjacency or proximity constraints require reliable boundaries before they should be introduced as soft penalties. The reported mitigation strategies are expert review, transitivity checks, stain augmentation, scale tokens, and optional reweighting of CPM penalties. The adaptation guideline is direct: for other anatomies, create a new class list, encode strong containment and exclusivity first, add adjacency or proximity only when annotations support it, and update the proposition matrix and class tokens without changing the backbone (Deng et al., 2024).

Taken together, these works show CPMs as a general strategy for preserving domain context in propositional form, but not as a single standardized formalism. Their common contribution is methodological rather than representational uniformity: context is encoded explicitly, propositionally, and in a form that can drive search, verification, or learning.