Sovereign Context Protocol: An Open Attribution Layer for Human-Generated Content in the Age of Large Language Models

• URL: http://arxiv.org/abs/2603.27094v1
• Date: Sat, 28 Mar 2026 02:28:41 GMT
• Title: Sovereign Context Protocol: An Open Attribution Layer for Human-Generated Content in the Age of Large Language Models
• Abstract summary: Sovereign Context Protocol functions as an attribution-aware data access layer between Large Language Models and human-generated content.<n> SCP defines six core methods (creator profiles, semantic search, content retrieval, trust/value scoring, authenticity verification, and access auditing) exposed over both REST and MCP-compatible interfaces.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Large Language Models (LLMs) consume vast quantities of human-generated content for both training and real-time inference, yet the creators of that content remain largely invisible in the value chain. Existing approaches to data attribution operate either at the model-internals level, tracing influence through gradient signals, or at the legal-policy level through transparency mandates and copyright litigation. Neither provides a runtime mechanism for content creators to know when, by whom, and how their work is being consumed. We introduce the Sovereign Context Protocol (SCP), an open-source protocol specification and reference architecture that functions as an attribution-aware data access layer between LLMs and human-generated content. Inspired by Anthropic's Model Context Protocol (MCP), which standardizes how LLMs connect to tools, SCP standardizes how LLMs connect to creator-owned data, with every access event logged, licensed, and attributable. SCP defines six core methods (creator profiles, semantic search, content retrieval, trust/value scoring, authenticity verification, and access auditing) exposed over both REST and MCP-compatible interfaces. We formalize the protocol's message envelope, present a threat model with five adversary classes, propose a log-proportional revenue attribution model, and report preliminary latency benchmarks from a reference implementation built on FastAPI, ChromaDB, and NetworkX. We situate SCP within the emerging regulatory landscape, including the EU AI Act's Article 53 training data transparency requirements and ongoing U.S. copyright litigation, and argue that the attribution gap requires a protocol-level intervention that makes attribution a default property of data access.

Related papers

• MNC: Scope-Bound Semantic Declassification for Private LLM-Agent Communication [6.029029648872896]
  Multi-agent large language model (LLM) systems can expose protected state through internal messages, tool arguments, logs, and persistent memory.<n>We introduce Minimum-Necessary Communication (MNC), a typed semantic-declassification protocol that binds a task-sufficient disclosure to explicit recipient, purpose, forwarding, lifetime, logging, and memory scopes.<n>Controlled semantic-join, memory, probing, and longitudinal experiments show that conventional defenses can preserve protocol-level utility while exposing substantial additional inference signal.
  arXiv  Detail & Related papers  (2026-08-03T05:36:49Z)
• From Tool Connection to Execution Control: Benchmarking Security Invariants in MCP-Style Agent Runtimes [8.419155861590548]
  As agents move from connection to execution, security decisions often remain split across clients, servers, prompts, approval dialogs, deployments, and logs.<n>This paper asks whether a runtime can make execution-layer invariants explicit and testable while preserving MCP-like ecosystems.<n>We implement these invariants in HCP, a Handle-Capability Protocol reference runtime for MCP-style agent execution.
  arXiv  Detail & Related papers  (2026-06-27T20:17:43Z)
• A Technical Taxonomy of LLM Agent Communication Protocols [60.76747983053368]
  This study develops a technical taxonomy to classify and analyze large language models (LLMs) agent communication protocols.<n>The framework guides protocol selection and highlights open research gaps such as privacy and policy enforcement.
  arXiv  Detail & Related papers  (2026-06-17T14:45:20Z)
• IDP Accelerator: Agentic Document Intelligence from Extraction to Compliance Validation [3.539467892338473]
  We present IDP (Intelligent Document Processing) Accelerator, a framework enabling agentic AI for end-to-end document intelligence.<n>The interactive demonstration enables users to upload document packets, visualize classification results, and explore extracted data.
  arXiv  Detail & Related papers  (2026-02-26T20:20:38Z)
• DAVE: A Policy-Enforcing LLM Spokesperson for Secure Multi-Document Data Sharing [0.0]
  DAVE is a usage policy-enforcing spokesperson that answers questions over private documents on behalf of a data provider.<n>We formalize policy-violating information disclosure in this setting, drawing on usage control and information flow security.<n>Our contribution is primarily architectural: we do not yet implement or empirically evaluate the full enforcement pipeline.
  arXiv  Detail & Related papers  (2026-02-19T14:43:48Z)
• RefProtoFL: Communication-Efficient Federated Learning via External-Referenced Prototype Alignment [20.458428841832742]
  Federated learning (FL) enables collaborative model training without sharing raw data in edge environments.<n>We propose RefProtoFL, a communication-efficient FL framework that integrates External-Referenced Prototype Alignment.<n>We show that RefProtoFL attains higher classification accuracy than state-of-the-art prototype-based FL baselines.
  arXiv  Detail & Related papers  (2026-01-21T08:01:14Z)
• Towards Federated Clustering: A Client-wise Private Graph Aggregation Framework [57.04850867402913]
  Federated clustering addresses the challenge of extracting patterns from decentralized, unlabeled data.<n>We propose Structural Privacy-Preserving Federated Graph Clustering (SPP-FGC), a novel algorithm that innovatively leverages local structural graphs as the primary medium for privacy-preserving knowledge sharing.<n>Our framework achieves state-of-the-art performance, improving clustering accuracy by up to 10% (NMI) over federated baselines while maintaining provable privacy guarantees.
  arXiv  Detail & Related papers  (2025-11-14T03:05:22Z)
• Model-Document Protocol for AI Search [11.377241012645994]
  We introduce the Model-Document Protocol (MDP), a general framework that formalizes how raw text is bridged to large language models (LLMs)<n>Rather than treating retrieval as passage fetching, MDP defines multiple pathways that transform unstructured documents into task-specific, LLM-ready inputs.<n>As an instantiation, we present MDP-Agent, which realizes the protocol through an agentic process.
  arXiv  Detail & Related papers  (2025-10-29T04:29:17Z)
• Analyzing and Internalizing Complex Policy Documents for LLM Agents [53.14898416858099]
  Large Language Model (LLM)-based agentic systems rely on in-context policy documents encoding diverse business rules.<n>This motivates developing internalization methods that embed policy documents into model priors while preserving performance.<n>We introduce CC-Gen, an agentic benchmark generator with Controllable Complexity across four levels.
  arXiv  Detail & Related papers  (2025-10-13T16:30:07Z)
• Latent Factor Models Meets Instructions: Goal-conditioned Latent Factor Discovery without Task Supervision [50.45597801390757]
  Instruct-LF is a goal-oriented latent factor discovery system.<n>It integrates instruction-following ability with statistical models to handle noisy datasets.
  arXiv  Detail & Related papers  (2025-02-21T02:03:08Z)
• ReCaLL: Membership Inference via Relative Conditional Log-Likelihoods [56.073335779595475]
  We propose ReCaLL (Relative Conditional Log-Likelihood) to detect pretraining data by leveraging conditional language modeling capabilities.<n>Our empirical findings show that conditioning member data on non-member prefixes induces a larger decrease in log-likelihood compared to non-member data.<n>We conduct comprehensive experiments and show that ReCaLL achieves state-of-the-art performance on the WikiMIA dataset.
  arXiv  Detail & Related papers  (2024-06-23T00:23:13Z)
• FLIP: Fine-grained Alignment between ID-based Models and Pretrained Language Models for CTR Prediction [49.510163437116645]
  Click-through rate (CTR) prediction plays as a core function module in personalized online services. Traditional ID-based models for CTR prediction take as inputs the one-hot encoded ID features of tabular modality. Pretrained Language Models(PLMs) has given rise to another paradigm, which takes as inputs the sentences of textual modality. We propose to conduct Fine-grained feature-level ALignment between ID-based Models and Pretrained Language Models(FLIP) for CTR prediction.
  arXiv  Detail & Related papers  (2023-10-30T11:25:03Z)

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.