{"slug":"china-s-coming-agent-id-system-splits-identity-from-disclosure","citations":[{"url":"https://arxiv.org/abs/2607.23207","committed_hash":"sha256:742e2ea979daa143cb0682e5a77151a3a5fdfe83a6e3336231053e303bef3388","committed_hash_short":"sha256:742e2ea9…3bef3388","mime_type":"text/html","committed_at":"2026-09-10T01:00:25.852239+00:00","content_snapshot":"\n\n\n [2607.23207] Accountable yet Anonymous AI Agents - Split-Knowledge Binding in National Agent-Identity Layer in China\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n \n \n \n \n \n\n\n
\n Skip to main content\n \n \n \n
\n \n\n \n \"archive\"\n \n\n \n\n \n
\n\n\n
\n
\n
\n\n
\n
\n

Computer Science > Computers and Society

\n
\n\n
\n arXiv:2607.23207 (cs)\n
\n\n
\n
\n
\n [Submitted on 25 Jul 2026]
\n

Title:Accountable yet Anonymous AI Agents - Split-Knowledge Binding in National Agent-Identity Layer in China

\n
Authors:Yifan He, Zhiguang Shan, Le Luo, Wei Wang
\n View PDF\n\n\n\n
\n Abstract:The emerging infrastructure for AI-agent identity has converged, in industry practice and research proposals alike, on a single resolution of the tension between accountability and privacy: make every agent identifiable. We document a national system in China -- built as national infrastructure and scheduled for public launch in Q3 2026 -- that occupies a different and underexplored point in the same design space: an agent is associated with a verified legal principal without that principal being disclosed to any business-layer participant. Re-identification is possible only to a legal authority acting through due process, by separately compelling two distinct government agencies, neither of which can re-identify alone. We name the mechanism split-knowledge binding and are candid that it is conditional: the separation is structural and procedural, not cryptographic, and a state empowered to compel both agencies can re-identify. The paper makes five contributions: (1) split-knowledge binding, an institutional rather than cryptographic separation for escrowed accountability; (2) the ex-post attribution thesis, the argued claim that only attribution-based accountability carries legal force for AI agent actions with legal consequences; (3) the accountability surface, a design concept identifying which agent actions leave identity-bearing traces; (4) a proportionality framework for identity escrow, a decision structure selecting among three trust architectures; and (5) the reflexive jurisdiction method, an evaluative standard administered to the paper's own deployment. The system is evidence of feasibility at national scale; the framework is the instrument by which any deployment -- including this one -- should be judged.\n
\n\n \n
\n \n \n \n \n\n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n
Comments:Preprint v1 (pre-launch). The system described launches in Q3 2026; a revised version will add post-launch deployment measurements under the pre-registered protocol in Section 5
Subjects:\n Computers and Society (cs.CY); Cryptography and Security (cs.CR)
ACM classes:K.4.1; K.6.5; I.2.11
Cite as:arXiv:2607.23207 [cs.CY]
 (or \n arXiv:2607.23207v1 [cs.CY] for this version)\n
  https://doi.org/10.48550/arXiv.2607.23207
\n \n \n
\n arXiv-issued DOI via DataCite
\n
\n
\n
\n
\n
\n
\n

Submission history

From: Yifan He [view email]
[v1]\n Sat, 25 Jul 2026 13:58:16 UTC (538 KB)
\n
\n
\n \n
\n \n Full-text links:\n

Access Paper:

\n
    \n
  • View PDF
\n
view license
\n
\n
\n

Current browse context:

\n
cs.CY
\n\n
\n\n < prev\n \n   |   \n next >\n
\n
\n new\n | \n recent\n | 2026-07\n
\n Change to browse by:\n
\n cs
\n cs.CR
\n
\n
\n\n
\n
\n

References & Citations

\n \n
\n
\n\n
\n \n \n
\n\n
\n

Bookmark

\n \"BibSonomy\"/\n \n \n \"Reddit\"/\n \n
\n \n\n
\n
\n \n
\n

Bibliographic and Citation Tools

\n
\n
\n
\n \n
\n
\n Bibliographic Explorer (What is the Explorer?)\n
\n
\n
\n
\n \n
\n
\n Connected Papers (What is Connected Papers?)\n
\n
\n
\n \n
\n
\n Litmaps (What is Litmaps?)\n
\n
\n
\n
\n \n
\n
\n scite Smart Citations (What are Smart Citations?)\n
\n
\n
\n
\n
\n
\n
\n
\n\n\n \n \n
\n

Code, Data and Media Associated with this Article

\n
\n
\n
\n \n
\n
\n alphaXiv (What is alphaXiv?)\n
\n
\n\n
\n
\n \n
\n
\n CatalyzeX Code Finder for Papers (What is CatalyzeX?)\n
\n
\n\n
\n
\n \n
\n
\n DagsHub (What is DagsHub?)\n
\n
\n \n
\n
\n \n
\n
\n Gotit.pub (What is GotitPub?)\n
\n
\n\n
\n
\n \n
\n
\n Hugging Face (What is Huggingface?)\n
\n
\n\n
\n
\n \n
\n
\n ScienceCast (What is ScienceCast?)\n
\n
\n
\n\n
\n
\n
\n
\n
\n
\n
\n\n\n \n \n
\n

Demos

\n
\n
\n
\n \n
\n
\n Replicate (What is Replicate?)\n
\n
\n
\n
\n \n
\n
\n Hugging Face Spaces (What is Spaces?)\n
\n
\n
\n
\n \n
\n
\n TXYZ.AI (What is TXYZ.AI?)\n
\n
\n
\n
\n
\n
\n
\n \n \n
\n

Recommenders and Search Tools

\n
\n
\n
\n \n
\n
\n Influence Flower (What are Influence Flowers?)\n
\n
\n
\n
\n \n
\n
\n CORE Recommender (What is CORE?)\n
\n
\n
\n
\n \n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n\n \n \n
\n
\n
\n

arXivLabs: experimental projects with community collaborators

\n

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

\n

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

\n

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

\n
\n
\n

\n
\n
\n
\n\n
\n
\n\n
\n Which authors of this paper are endorsers? |\n Disable MathJax (What is MathJax?)\n \n
\n \n
\n
\n
\n\n
\n\n \n\n\n\n","snapshot_chars":43357,"live_check":"matches"}]}