{"id":"bf1bcd498de5f51ea5a53d1d2fa64072a9f2cf7407bfcabe0f1d2a5d3a5c2282","title":"Franco and Gershenson: Why Agent Safety Cannot Be Verified","argument":"Mario Franco and Carlos Gershenson argue that coupling a fixed language model with a general computing device makes agent safety undecidable. They say no algorithm can predict whether an agent will run a program semantically equivalent to a given dangerous program. On that basis, they describe guardrails, blacklists, whitelists and certifications as imperfect safety solutions, not guarantees. The authors add that safety is decidable under finite constraints—bounded context, values and running time—but remains intractable: the problem is PSPACE-complete even when the agent’s description is known. They also argue that safety is not compositional: agents that can be proven safe on their own can still produce unsafe behavior when grouped together. This means that, in their account, establishing safety for each agent separately does not establish safety for the group. The abstract says the paper discusses relaxed notions of safety that could be used in practice, but does not identify them or give their conditions.","topicIds":["intelligence-and-discovery"],"domain":"science","claimType":"attributed reading","limits":"The supplied evidence is the arXiv abstract, not the full paper; it does not detail the arguments, assumptions, or proofs behind the claims. The abstract does not identify the relaxed notions of safety discussed or explain the conditions for using them in practice.","speaker":{"name":"Franco, Mario, Gershenson, Carlos","roleAtSource":"Article author"},"source":{"title":"Pandora's Toolbox Or Why Agent Safety Cannot Be Verified","publisher":"arXiv cs.AI","format":"Article","url":"https://arxiv.org/abs/2611.25325","publishedAt":"2026-11-19","dateBasis":"Date basis not provided."},"evidence":[{"text":"Franco and Gershenson argue that coupling a fixed language model with a general computing device makes agent safety undecidable.","excerpt":"We show that this coupling makes safety undecidable.","url":"https://arxiv.org/abs/2611.25325","relationship":"Source-stated"},{"text":"The authors say no algorithm can predict whether an agent will run a program semantically equivalent to a given dangerous program.","excerpt":"no algorithm can predict whether an agent will run such a program that is semantically equivalent.","url":"https://arxiv.org/abs/2611.25325","relationship":"Source-stated"},{"text":"The authors characterize guardrails, blacklists, whitelists and certifications as imperfect safety solutions.","excerpt":"guardrails, blacklists, whitelists and certifications can only lead to imperfect safety solutions.","url":"https://arxiv.org/abs/2611.25325","relationship":"Source-stated"},{"text":"They say safety is decidable but intractable under finite constraints, and the problem is PSPACE-complete even when the agent description is known.","excerpt":"Under finite constraints (bounded context, values and running time) safety is decidable but still intractable. Specifically, the problem is $\\mathsf{PSPACE}$-complete even when the description of the agent is known.","url":"https://arxiv.org/abs/2611.25325","relationship":"Source-stated"},{"text":"The authors argue that individually safe agents can produce unsafe behavior when grouped together.","excerpt":"agents that can be proven safe on their own can still produce unsafe behavior when grouped together.","url":"https://arxiv.org/abs/2611.25325","relationship":"Source-stated"},{"text":"The abstract says the paper discusses relaxed notions of safety for practical use, without specifying them in the supplied text.","excerpt":"We also discuss relaxed notions of safety that could be used in practice.","url":"https://arxiv.org/abs/2611.25325","relationship":"Source-stated"}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.25325","checkedAt":"2026-11-21T01:06:09.775Z","items":[],"note":"No suitable media was found by the supported page extraction."},"assumptions":[],"openQuestion":{"attribution":"Open question","text":"Which relaxed notions of safety do the authors discuss, and under what conditions do they propose they could be used in practice?"},"whatWouldChangeView":{"attribution":"Change condition not recorded","text":""},"editorialComparisons":[],"live":{"title":"Franco and Gershenson: Why Agent Safety Cannot Be Verified","summary":"Mario Franco and Carlos Gershenson argue that coupling a fixed language model with a general computing device makes agent safety undecidable. They say no algorithm can predict whether an agent will run a program semantically equivalent to a given dangerous program. On that basis, they describe guardrails, blacklists, whitelists and certifications as imperfect safety solutions, not guarantees. The authors add that safety is decidable under finite constraints—bounded context, values and running time—but remains intractable: the problem is PSPACE-complete even when the agent’s description is known. They also argue that safety is not compositional: agents that can be proven safe on their own can still produce unsafe behavior when grouped together. This means that, in their account, establishing safety for each agent separately does not establish safety for the group. The abstract says the paper discusses relaxed notions of safety that could be used in practice, but does not identify them or give their conditions.","question":"Which relaxed notions of safety do the authors discuss, and under what conditions do they propose they could be used in practice?","claims":[{"text":"Franco and Gershenson argue that coupling a fixed language model with a general computing device makes agent safety undecidable.","excerpt":"We show that this coupling makes safety undecidable.","support":"source-stated"},{"text":"The authors say no algorithm can predict whether an agent will run a program semantically equivalent to a given dangerous program.","excerpt":"no algorithm can predict whether an agent will run such a program that is semantically equivalent.","support":"source-stated"},{"text":"The authors characterize guardrails, blacklists, whitelists and certifications as imperfect safety solutions.","excerpt":"guardrails, blacklists, whitelists and certifications can only lead to imperfect safety solutions.","support":"source-stated"},{"text":"They say safety is decidable but intractable under finite constraints, and the problem is PSPACE-complete even when the agent description is known.","excerpt":"Under finite constraints (bounded context, values and running time) safety is decidable but still intractable. Specifically, the problem is $\\mathsf{PSPACE}$-complete even when the description of the agent is known.","support":"source-stated"},{"text":"The authors argue that individually safe agents can produce unsafe behavior when grouped together.","excerpt":"agents that can be proven safe on their own can still produce unsafe behavior when grouped together.","support":"source-stated"},{"text":"The abstract says the paper discusses relaxed notions of safety for practical use, without specifying them in the supplied text.","excerpt":"We also discuss relaxed notions of safety that could be used in practice.","support":"source-stated"}],"limitations":["The supplied evidence is the arXiv abstract, not the full paper; it does not detail the arguments, assumptions, or proofs behind the claims.","The abstract does not identify the relaxed notions of safety discussed or explain the conditions for using them in practice."],"mediaId":"f4525f014eaba53061818e7708a16214afd1e2fc955e1ecf063ea8f046d57f64","correctionReason":null,"id":"bf1bcd498de5f51ea5a53d1d2fa64072a9f2cf7407bfcabe0f1d2a5d3a5c2282","publicationId":"d28e2f22-9c13-4ab6-8db6-adf6f25c4b60","version":1,"sourceUrl":"https://arxiv.org/abs/2611.25325","sourceTitle":"Pandora's Toolbox Or Why Agent Safety Cannot Be Verified","publisher":"arXiv cs.AI","publishedAt":null,"originalPublished":{"value":"2026-11-19","precision":"day","basis":"publisher_citation_date"},"firstObservedAt":"2026-11-20T05:10:19.467Z","createdAt":"2026-11-20T08:03:26.695Z","historical":false,"entityIds":["arxiv"],"topicIds":["intelligence-and-discovery"],"media":[{"id":"f4525f014eaba53061818e7708a16214afd1e2fc955e1ecf063ea8f046d57f64","kind":"article","url":"https://arxiv.org/abs/2611.25325","sourceUrl":"https://arxiv.org/abs/2611.25325","label":"Read original","provenance":"source_link","verification":{"status":"verified","checkedAt":"2026-11-20T08:02:33.451Z","method":"acquired_source","contentType":"text/html"},"recommendationReason":"Recommended by Jev for understanding this source; checked by Luna."}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.25325","checkedAt":"2026-11-21T01:06:09.775Z","items":[],"note":"No suitable media was found by the supported page extraction."},"editorialDecision":{"outcome":"accept","reasonCodes":["useful_perspective"],"rubricVersion":"stream-admission-v9","mediaId":"f4525f014eaba53061818e7708a16214afd1e2fc955e1ecf063ea8f046d57f64","confidence":0.63,"provider":"typesafe","model":"jev-1.13.0","inputHash":"d943041ae5c7fce16e7ef31cc3a1af1ea0a38636c1d8372ef55bbac5c6e1b13c","decidedAt":"2026-11-20T08:02:35.186Z"},"provenance":{"textHash":"edf0c4185590e8f89174ab671e373d3ae30c2f5f9f298b2047f372cdeb04f6ea","observationId":"efd67994a89d8c08f8e682f00512a26683497153ce359705fd4ba160fbe37adf","retrievedAt":"2026-11-20T08:02:32.926Z","kind":"publisher-page","preparer":{"model":"gpt-6-luna","runId":"3dd37562-ca83-4d88-8d7a-0ce6292757da"},"reviewer":{"model":"gpt-6-luna","runId":"37cf68f1-c404-4ee9-8c27-aca07e00a23c"}},"audit":{"status":"passed","reviewedAt":"2026-11-20T08:03:26.695Z","model":"anthropic/claude-opus-5.5"},"sourceAttribution":{"authors":[{"name":"Franco, Mario","url":null,"kind":"unknown"},{"name":"Gershenson, Carlos","url":null,"kind":"unknown"}],"authorRole":"article-author","hosts":[],"status":"stated","authorRoster":{"truncated":false,"omitted":0,"assertionGroupsOmitted":0},"participation":[{"actor":{"name":"Franco, Mario","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Franco, Mario","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.25325","locator":"head/meta[name=author|citation_author]"},"assertionId":"801b8915826f427d37c02cf05f4439a7e30e1bfe9c494fc9ab1b019b6910a74a:participation:0","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-21T01:06:09.775Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"801b8915826f427d37c02cf05f4439a7e30e1bfe9c494fc9ab1b019b6910a74a","sourceUrl":"https://arxiv.org/abs/2611.25325","contentSha256":"354651e521347ff2c1f66f2472902c390bff9a2ace49321cf52142949add74a5","textHash":"edf0c4185590e8f89174ab671e373d3ae30c2f5f9f298b2047f372cdeb04f6ea","observedAt":"2026-11-21T01:06:09.775Z"}},{"actor":{"name":"Gershenson, Carlos","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Gershenson, Carlos","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.25325","locator":"head/meta[name=author|citation_author]"},"assertionId":"801b8915826f427d37c02cf05f4439a7e30e1bfe9c494fc9ab1b019b6910a74a:participation:1","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-21T01:06:09.775Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"801b8915826f427d37c02cf05f4439a7e30e1bfe9c494fc9ab1b019b6910a74a","sourceUrl":"https://arxiv.org/abs/2611.25325","contentSha256":"354651e521347ff2c1f66f2472902c390bff9a2ace49321cf52142949add74a5","textHash":"edf0c4185590e8f89174ab671e373d3ae30c2f5f9f298b2047f372cdeb04f6ea","observedAt":"2026-11-21T01:06:09.775Z"}}],"participationCoverage":{"total":2,"returned":2,"complete":true,"fullAssertions":"source-metadata-endpoint"},"distribution":null,"publisher":null,"sourceUrl":"https://arxiv.org/abs/2611.25325","snapshotId":"801b8915826f427d37c02cf05f4439a7e30e1bfe9c494fc9ab1b019b6910a74a","contentSha256":"354651e521347ff2c1f66f2472902c390bff9a2ace49321cf52142949add74a5","textHash":"edf0c4185590e8f89174ab671e373d3ae30c2f5f9f298b2047f372cdeb04f6ea","observedAt":"2026-11-21T01:06:09.775Z","basis":"publisher-page-metadata","sourceLinks":40,"linksTruncated":false,"metadataUrl":"/api/pipeline/stream/bf1bcd498de5f51ea5a53d1d2fa64072a9f2cf7407bfcabe0f1d2a5d3a5c2282/source"}},"canonicalUrl":"https://escapemeridian.com/readings/franco-and-gershenson-why-agent-safety-cannot-be-verified-bf1bcd49","formats":{"html":"/readings/franco-and-gershenson-why-agent-safety-cannot-be-verified-bf1bcd49","markdown":"/readings/franco-and-gershenson-why-agent-safety-cannot-be-verified-bf1bcd49.md","json":"/readings/franco-and-gershenson-why-agent-safety-cannot-be-verified-bf1bcd49.json"},"attribution":"Headline and summary by Escape Meridian, prepared by Luna from the attributed source. A source check is not independent confirmation of the source’s claims.","maintainedGuideLinks":[],"conditions":[],"readerContext":{"version":"reader-context-v1","attribution":"Reference context selected by Escape Meridian; separate from source evidence. Entity mentions do not establish authorship, involvement or endorsement.","terms":[],"entities":[{"id":"arxiv","name":"arXiv","kind":"organization","context":"arXiv is a research manuscript repository where authors share papers that may not yet have been peer reviewed.","referenceUrls":["https://arxiv.org/","https://info.arxiv.org/help/api/index.html"],"path":"/entities/arxiv","json":"/entities/arxiv.json","markdown":"/entities/arxiv.md"},{"id":"time","name":"TIME","kind":"organization","context":"TIME is a news magazine publishing reporting on world affairs, business, technology and the workers behind digital services.","referenceUrls":["https://time.com/"],"path":"/entities/time","json":"/entities/time.json","markdown":"/entities/time.md"}]},"researchQuestions":[],"withdrawn":false,"references":{"schemaVersion":1,"target":{"type":"reading","id":"bf1bcd498de5f51ea5a53d1d2fa64072a9f2cf7407bfcabe0f1d2a5d3a5c2282","revision":"d28e2f22-9c13-4ab6-8db6-adf6f25c4b60","revisionKind":"publication-id","title":"Franco and Gershenson: Why Agent Safety Cannot Be Verified","url":"https://escapemeridian.com/readings/franco-and-gershenson-why-agent-safety-cannot-be-verified-bf1bcd49"},"source":{"type":"source","id":"https://arxiv.org/abs/2611.25325","revision":"edf0c4185590e8f89174ab671e373d3ae30c2f5f9f298b2047f372cdeb04f6ea","revisionKind":"sha256-source-text","title":"Pandora's Toolbox Or Why Agent Safety Cannot Be Verified","url":"https://arxiv.org/abs/2611.25325"},"status":"available","items":[],"next":null,"scope":"Explicit citations in public readings to this reading. Shared topics are not citations. Other record types need an explicit reference adapter."},"revisions":[{"id":"bf1bcd498de5f51ea5a53d1d2fa64072a9f2cf7407bfcabe0f1d2a5d3a5c2282","title":"Franco and Gershenson: Why Agent Safety Cannot Be Verified","argument":"Mario Franco and Carlos Gershenson argue that coupling a fixed language model with a general computing device makes agent safety undecidable. They say no algorithm can predict whether an agent will run a program semantically equivalent to a given dangerous program. On that basis, they describe guardrails, blacklists, whitelists and certifications as imperfect safety solutions, not guarantees. The authors add that safety is decidable under finite constraints—bounded context, values and running time—but remains intractable: the problem is PSPACE-complete even when the agent’s description is known. They also argue that safety is not compositional: agents that can be proven safe on their own can still produce unsafe behavior when grouped together. This means that, in their account, establishing safety for each agent separately does not establish safety for the group. The abstract says the paper discusses relaxed notions of safety that could be used in practice, but does not identify them or give their conditions.","topicIds":["intelligence-and-discovery"],"domain":"science","claimType":"attributed reading","limits":"The supplied evidence is the arXiv abstract, not the full paper; it does not detail the arguments, assumptions, or proofs behind the claims. The abstract does not identify the relaxed notions of safety discussed or explain the conditions for using them in practice.","speaker":{"name":"Franco, Mario, Gershenson, Carlos","roleAtSource":"Article author"},"source":{"title":"Pandora's Toolbox Or Why Agent Safety Cannot Be Verified","publisher":"arXiv cs.AI","format":"Article","url":"https://arxiv.org/abs/2611.25325","publishedAt":"2026-11-19","dateBasis":"Date basis not provided."},"evidence":[{"text":"Franco and Gershenson argue that coupling a fixed language model with a general computing device makes agent safety undecidable.","excerpt":"We show that this coupling makes safety undecidable.","url":"https://arxiv.org/abs/2611.25325","relationship":"Source-stated"},{"text":"The authors say no algorithm can predict whether an agent will run a program semantically equivalent to a given dangerous program.","excerpt":"no algorithm can predict whether an agent will run such a program that is semantically equivalent.","url":"https://arxiv.org/abs/2611.25325","relationship":"Source-stated"},{"text":"The authors characterize guardrails, blacklists, whitelists and certifications as imperfect safety solutions.","excerpt":"guardrails, blacklists, whitelists and certifications can only lead to imperfect safety solutions.","url":"https://arxiv.org/abs/2611.25325","relationship":"Source-stated"},{"text":"They say safety is decidable but intractable under finite constraints, and the problem is PSPACE-complete even when the agent description is known.","excerpt":"Under finite constraints (bounded context, values and running time) safety is decidable but still intractable. Specifically, the problem is $\\mathsf{PSPACE}$-complete even when the description of the agent is known.","url":"https://arxiv.org/abs/2611.25325","relationship":"Source-stated"},{"text":"The authors argue that individually safe agents can produce unsafe behavior when grouped together.","excerpt":"agents that can be proven safe on their own can still produce unsafe behavior when grouped together.","url":"https://arxiv.org/abs/2611.25325","relationship":"Source-stated"},{"text":"The abstract says the paper discusses relaxed notions of safety for practical use, without specifying them in the supplied text.","excerpt":"We also discuss relaxed notions of safety that could be used in practice.","url":"https://arxiv.org/abs/2611.25325","relationship":"Source-stated"}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.25325","checkedAt":"2026-11-21T01:06:09.775Z","items":[],"note":"No suitable media was found by the supported page extraction."},"assumptions":[],"openQuestion":{"attribution":"Open question","text":"Which relaxed notions of safety do the authors discuss, and under what conditions do they propose they could be used in practice?"},"whatWouldChangeView":{"attribution":"Change condition not recorded","text":""},"editorialComparisons":[],"live":{"title":"Franco and Gershenson: Why Agent Safety Cannot Be Verified","summary":"Mario Franco and Carlos Gershenson argue that coupling a fixed language model with a general computing device makes agent safety undecidable. They say no algorithm can predict whether an agent will run a program semantically equivalent to a given dangerous program. On that basis, they describe guardrails, blacklists, whitelists and certifications as imperfect safety solutions, not guarantees. The authors add that safety is decidable under finite constraints—bounded context, values and running time—but remains intractable: the problem is PSPACE-complete even when the agent’s description is known. They also argue that safety is not compositional: agents that can be proven safe on their own can still produce unsafe behavior when grouped together. This means that, in their account, establishing safety for each agent separately does not establish safety for the group. The abstract says the paper discusses relaxed notions of safety that could be used in practice, but does not identify them or give their conditions.","question":"Which relaxed notions of safety do the authors discuss, and under what conditions do they propose they could be used in practice?","claims":[{"text":"Franco and Gershenson argue that coupling a fixed language model with a general computing device makes agent safety undecidable.","excerpt":"We show that this coupling makes safety undecidable.","support":"source-stated"},{"text":"The authors say no algorithm can predict whether an agent will run a program semantically equivalent to a given dangerous program.","excerpt":"no algorithm can predict whether an agent will run such a program that is semantically equivalent.","support":"source-stated"},{"text":"The authors characterize guardrails, blacklists, whitelists and certifications as imperfect safety solutions.","excerpt":"guardrails, blacklists, whitelists and certifications can only lead to imperfect safety solutions.","support":"source-stated"},{"text":"They say safety is decidable but intractable under finite constraints, and the problem is PSPACE-complete even when the agent description is known.","excerpt":"Under finite constraints (bounded context, values and running time) safety is decidable but still intractable. Specifically, the problem is $\\mathsf{PSPACE}$-complete even when the description of the agent is known.","support":"source-stated"},{"text":"The authors argue that individually safe agents can produce unsafe behavior when grouped together.","excerpt":"agents that can be proven safe on their own can still produce unsafe behavior when grouped together.","support":"source-stated"},{"text":"The abstract says the paper discusses relaxed notions of safety for practical use, without specifying them in the supplied text.","excerpt":"We also discuss relaxed notions of safety that could be used in practice.","support":"source-stated"}],"limitations":["The supplied evidence is the arXiv abstract, not the full paper; it does not detail the arguments, assumptions, or proofs behind the claims.","The abstract does not identify the relaxed notions of safety discussed or explain the conditions for using them in practice."],"mediaId":"f4525f014eaba53061818e7708a16214afd1e2fc955e1ecf063ea8f046d57f64","correctionReason":null,"id":"bf1bcd498de5f51ea5a53d1d2fa64072a9f2cf7407bfcabe0f1d2a5d3a5c2282","publicationId":"d28e2f22-9c13-4ab6-8db6-adf6f25c4b60","version":1,"sourceUrl":"https://arxiv.org/abs/2611.25325","sourceTitle":"Pandora's Toolbox Or Why Agent Safety Cannot Be Verified","publisher":"arXiv cs.AI","publishedAt":null,"originalPublished":{"value":"2026-11-19","precision":"day","basis":"publisher_citation_date"},"firstObservedAt":"2026-11-20T05:10:19.467Z","createdAt":"2026-11-20T08:03:26.695Z","historical":false,"entityIds":["arxiv"],"topicIds":["intelligence-and-discovery"],"media":[{"id":"f4525f014eaba53061818e7708a16214afd1e2fc955e1ecf063ea8f046d57f64","kind":"article","url":"https://arxiv.org/abs/2611.25325","sourceUrl":"https://arxiv.org/abs/2611.25325","label":"Read original","provenance":"source_link","verification":{"status":"verified","checkedAt":"2026-11-20T08:02:33.451Z","method":"acquired_source","contentType":"text/html"},"recommendationReason":"Recommended by Jev for understanding this source; checked by Luna."}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.25325","checkedAt":"2026-11-21T01:06:09.775Z","items":[],"note":"No suitable media was found by the supported page extraction."},"editorialDecision":{"outcome":"accept","reasonCodes":["useful_perspective"],"rubricVersion":"stream-admission-v9","mediaId":"f4525f014eaba53061818e7708a16214afd1e2fc955e1ecf063ea8f046d57f64","confidence":0.63,"provider":"typesafe","model":"jev-1.13.0","inputHash":"d943041ae5c7fce16e7ef31cc3a1af1ea0a38636c1d8372ef55bbac5c6e1b13c","decidedAt":"2026-11-20T08:02:35.186Z"},"provenance":{"textHash":"edf0c4185590e8f89174ab671e373d3ae30c2f5f9f298b2047f372cdeb04f6ea","observationId":"efd67994a89d8c08f8e682f00512a26683497153ce359705fd4ba160fbe37adf","retrievedAt":"2026-11-20T08:02:32.926Z","kind":"publisher-page","preparer":{"model":"gpt-6-luna","runId":"3dd37562-ca83-4d88-8d7a-0ce6292757da"},"reviewer":{"model":"gpt-6-luna","runId":"37cf68f1-c404-4ee9-8c27-aca07e00a23c"}},"audit":{"status":"passed","reviewedAt":"2026-11-20T08:03:26.695Z","model":"anthropic/claude-opus-5.5"},"sourceAttribution":{"authors":[{"name":"Franco, Mario","url":null,"kind":"unknown"},{"name":"Gershenson, Carlos","url":null,"kind":"unknown"}],"authorRole":"article-author","hosts":[],"status":"stated","authorRoster":{"truncated":false,"omitted":0,"assertionGroupsOmitted":0},"participation":[{"actor":{"name":"Franco, Mario","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Franco, Mario","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.25325","locator":"head/meta[name=author|citation_author]"},"assertionId":"801b8915826f427d37c02cf05f4439a7e30e1bfe9c494fc9ab1b019b6910a74a:participation:0","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-21T01:06:09.775Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"801b8915826f427d37c02cf05f4439a7e30e1bfe9c494fc9ab1b019b6910a74a","sourceUrl":"https://arxiv.org/abs/2611.25325","contentSha256":"354651e521347ff2c1f66f2472902c390bff9a2ace49321cf52142949add74a5","textHash":"edf0c4185590e8f89174ab671e373d3ae30c2f5f9f298b2047f372cdeb04f6ea","observedAt":"2026-11-21T01:06:09.775Z"}},{"actor":{"name":"Gershenson, Carlos","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Gershenson, Carlos","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.25325","locator":"head/meta[name=author|citation_author]"},"assertionId":"801b8915826f427d37c02cf05f4439a7e30e1bfe9c494fc9ab1b019b6910a74a:participation:1","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-21T01:06:09.775Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"801b8915826f427d37c02cf05f4439a7e30e1bfe9c494fc9ab1b019b6910a74a","sourceUrl":"https://arxiv.org/abs/2611.25325","contentSha256":"354651e521347ff2c1f66f2472902c390bff9a2ace49321cf52142949add74a5","textHash":"edf0c4185590e8f89174ab671e373d3ae30c2f5f9f298b2047f372cdeb04f6ea","observedAt":"2026-11-21T01:06:09.775Z"}}],"participationCoverage":{"total":2,"returned":2,"complete":true,"fullAssertions":"source-metadata-endpoint"},"distribution":null,"publisher":null,"sourceUrl":"https://arxiv.org/abs/2611.25325","snapshotId":"801b8915826f427d37c02cf05f4439a7e30e1bfe9c494fc9ab1b019b6910a74a","contentSha256":"354651e521347ff2c1f66f2472902c390bff9a2ace49321cf52142949add74a5","textHash":"edf0c4185590e8f89174ab671e373d3ae30c2f5f9f298b2047f372cdeb04f6ea","observedAt":"2026-11-21T01:06:09.775Z","basis":"publisher-page-metadata","sourceLinks":40,"linksTruncated":false,"metadataUrl":"/api/pipeline/stream/bf1bcd498de5f51ea5a53d1d2fa64072a9f2cf7407bfcabe0f1d2a5d3a5c2282/source"}}}],"audits":[{"publicationId":"d28e2f22-9c13-4ab6-8db6-adf6f25c4b60","verdict":"passed","findings":[{"dimension":"attribution","status":"pass","explanation":"The reading names Mario Franco and Carlos Gershenson as authors and consistently frames each finding as their argument ('argue', 'say', 'in their account'). Nothing is presented as established fact or as Escape Meridian's view.","excerpt":"Authors:Mario Franco, Carlos Gershenson"},{"dimension":"summary","status":"pass","explanation":"The reading faithfully covers every abstract claim and keeps the authors' force: undecidability, the limits of guardrails, decidable-but-intractable under bounds, non-compositionality, and relaxed safety. 'Undecidable' is effectively explained by the next sentence, which says no algorithm can predict the behavior. Compositionality is explained in plain language. 'PSPACE-complete' and 'semantically equivalent' should get term-library tooltips if missing, but they do not block understanding. The question targets a real gap.","excerpt":"Finally, safety is not a compositional property, i.e., agents that can be proven safe on their own can still produce unsafe behavior when grouped together."},{"dimension":"date","status":"pass","explanation":"The originalPublished date of 2026-11-19 matches the arXiv v1 submission date. It is not the later feed date of 2026-11-20.","excerpt":"[Submitted on 19 Nov 2026]"},{"dimension":"support","status":"pass","explanation":"Every claim is backed by a verbatim abstract excerpt. Calling these measures 'not guarantees' restates 'can only lead to imperfect safety solutions' without adding anything. The statement that separate per-agent safety does not establish group safety is labeled as the authors' account and follows from the abstract. No benefits, costs or forecasts are invented. The limitations correctly note that only the abstract was available.","excerpt":"In general, guardrails, blacklists, whitelists and certifications can only lead to imperfect safety solutions."},{"dimension":"media","status":"pass","explanation":"The selected media is the verified direct arXiv abstract page for this paper, and it is the source URL itself. It is the most direct way for readers to reach the original.","excerpt":null}],"createdAt":"2026-11-20T08:03:26.695Z","model":"anthropic/claude-opus-5.5"}],"correctionUrl":"https://escapemeridian.com/corrections/"}