{"id":"b30e5626a741e969cd5dade462ee95d9b21fd5dd83b89a42e7ce6f4ba011feed","title":"Polynomial-Time Computation of Extensive-Form Proper Equilibria in Two-Player Zero-Sum Games","argument":"Sam Ganzfried presents a deterministic polynomial-time algorithm for computing an exact extensive-form proper equilibrium in finite two-player zero-sum games with perfect recall and rational data. In this setting, properness means penalizing a less desirable action relative to a better one while holding the player’s other local choices, including future actions, fixed. The method assigns each information set a geometric permutahedron of allowable action probabilities, embeds those restrictions in a polynomial-size sequence-form polytope, and uses a saddle point to satisfy local ε-properness inequalities. Ganzfried says the method goes beyond finding an answer only after an arbitrarily small numerical perturbation: sign stability of a parametric linear system lets the algorithm construct a persistent feasible basis and extract limits of behavioral ratios. The resulting probabilities are rational and have polynomial encoding length, even at information sets with zero realization probability. The result is a theoretical computation method for the stated class of games; the abstract does not report tests on concrete games or practical runtime measurements.","topicIds":["intelligence-and-discovery"],"domain":"science","claimType":"attributed reading","limits":"The result is stated for finite two-player zero-sum extensive-form games with perfect recall and rational data; the abstract does not establish applicability outside those conditions. The abstract describes an algorithm and its mathematical properties but gives no runtime measurements on concrete games.","speaker":{"name":"Ganzfried, Sam","roleAtSource":"Article author"},"source":{"title":"Polynomial-Time Computation of Extensive-Form Proper Equilibria in Two-Player Zero-Sum Games","publisher":"arXiv cs.AI","format":"Article","url":"https://arxiv.org/abs/2611.07089","publishedAt":"2026-11-04","dateBasis":"Date basis not provided."},"evidence":[{"text":"Sam Ganzfried says the paper gives a deterministic polynomial-time algorithm to compute an exact extensive-form proper equilibrium for finite two-player zero-sum games with perfect recall and rational data.","excerpt":"We give a deterministic polynomial-time algorithm for computing an exact extensive-form proper equilibrium in a finite two-player zero-sum extensive-form game with perfect recall and rational data.","url":"https://arxiv.org/abs/2611.07089","relationship":"Source-stated"},{"text":"The algorithm imposes local action-probability restrictions through geometric permutahedra and embeds them in a polynomial-size sequence-form polytope.","excerpt":"Our algorithm assigns each information set a geometric permutahedron of allowable action probabilities. A scaled doubly stochastic representation embeds these restrictions in a polynomial-size sequence-form polytope","url":"https://arxiv.org/abs/2611.07089","relationship":"Source-stated"},{"text":"The paper says its method obtains an exact equilibrium using sign stability and a persistent feasible basis, rather than relying on an arbitrarily small numerical perturbation.","excerpt":"To obtain an exact equilibrium rather than a solution at an arbitrarily small numerical perturbation, we establish sign stability of a parametric linear system, construct a persistent feasible basis","url":"https://arxiv.org/abs/2611.07089","relationship":"Source-stated"},{"text":"The resulting probabilities are rational and have polynomial encoding length, including at information sets whose realization probabilities vanish.","excerpt":"The resulting probabilities are rational and have polynomial encoding length, including at information sets whose realization probabilities vanish.","url":"https://arxiv.org/abs/2611.07089","relationship":"Source-stated"}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.07089","checkedAt":"2026-11-09T03:42:07.815Z","items":[],"note":"No suitable media was found by the supported page extraction."},"assumptions":[],"openQuestion":{"attribution":"Open question","text":"How does the algorithm’s runtime scale on concrete games in the stated class, including at information sets whose realization probabilities vanish?"},"whatWouldChangeView":{"attribution":"Change condition not recorded","text":""},"editorialComparisons":[],"live":{"title":"Polynomial-Time Computation of Extensive-Form Proper Equilibria in Two-Player Zero-Sum Games","summary":"Sam Ganzfried presents a deterministic polynomial-time algorithm for computing an exact extensive-form proper equilibrium in finite two-player zero-sum games with perfect recall and rational data. In this setting, properness means penalizing a less desirable action relative to a better one while holding the player’s other local choices, including future actions, fixed. The method assigns each information set a geometric permutahedron of allowable action probabilities, embeds those restrictions in a polynomial-size sequence-form polytope, and uses a saddle point to satisfy local ε-properness inequalities. Ganzfried says the method goes beyond finding an answer only after an arbitrarily small numerical perturbation: sign stability of a parametric linear system lets the algorithm construct a persistent feasible basis and extract limits of behavioral ratios. The resulting probabilities are rational and have polynomial encoding length, even at information sets with zero realization probability. The result is a theoretical computation method for the stated class of games; the abstract does not report tests on concrete games or practical runtime measurements.","question":"How does the algorithm’s runtime scale on concrete games in the stated class, including at information sets whose realization probabilities vanish?","claims":[{"text":"Sam Ganzfried says the paper gives a deterministic polynomial-time algorithm to compute an exact extensive-form proper equilibrium for finite two-player zero-sum games with perfect recall and rational data.","excerpt":"We give a deterministic polynomial-time algorithm for computing an exact extensive-form proper equilibrium in a finite two-player zero-sum extensive-form game with perfect recall and rational data.","support":"source-stated"},{"text":"The algorithm imposes local action-probability restrictions through geometric permutahedra and embeds them in a polynomial-size sequence-form polytope.","excerpt":"Our algorithm assigns each information set a geometric permutahedron of allowable action probabilities. A scaled doubly stochastic representation embeds these restrictions in a polynomial-size sequence-form polytope","support":"source-stated"},{"text":"The paper says its method obtains an exact equilibrium using sign stability and a persistent feasible basis, rather than relying on an arbitrarily small numerical perturbation.","excerpt":"To obtain an exact equilibrium rather than a solution at an arbitrarily small numerical perturbation, we establish sign stability of a parametric linear system, construct a persistent feasible basis","support":"source-stated"},{"text":"The resulting probabilities are rational and have polynomial encoding length, including at information sets whose realization probabilities vanish.","excerpt":"The resulting probabilities are rational and have polynomial encoding length, including at information sets whose realization probabilities vanish.","support":"source-stated"}],"limitations":["The result is stated for finite two-player zero-sum extensive-form games with perfect recall and rational data; the abstract does not establish applicability outside those conditions.","The abstract describes an algorithm and its mathematical properties but gives no runtime measurements on concrete games."],"mediaId":"a43d3484909ac2b4041e0669f7eac2d66865aaf02b7452662f2ef2ee192f448c","correctionReason":null,"id":"b30e5626a741e969cd5dade462ee95d9b21fd5dd83b89a42e7ce6f4ba011feed","publicationId":"77d11a82-05df-4c28-8b75-c9bdd6df32b1","version":1,"sourceUrl":"https://arxiv.org/abs/2611.07089","sourceTitle":"Polynomial-Time Computation of Extensive-Form Proper Equilibria in Two-Player Zero-Sum Games","publisher":"arXiv cs.AI","publishedAt":null,"originalPublished":{"value":"2026-11-04","precision":"day","basis":"publisher_citation_date"},"firstObservedAt":"2026-11-06T05:03:39.308Z","createdAt":"2026-11-09T03:10:34.237Z","historical":true,"entityIds":["arxiv"],"topicIds":["intelligence-and-discovery"],"media":[{"id":"a43d3484909ac2b4041e0669f7eac2d66865aaf02b7452662f2ef2ee192f448c","kind":"article","url":"https://arxiv.org/abs/2611.07089","sourceUrl":"https://arxiv.org/abs/2611.07089","label":"Read original","provenance":"source_link","verification":{"status":"verified","checkedAt":"2026-11-09T03:09:52.475Z","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.07089","checkedAt":"2026-11-09T03:42:07.815Z","items":[],"note":"No suitable media was found by the supported page extraction."},"editorialDecision":{"outcome":"accept","reasonCodes":["material_development"],"rubricVersion":"stream-admission-v5","mediaId":"a43d3484909ac2b4041e0669f7eac2d66865aaf02b7452662f2ef2ee192f448c","confidence":0.52,"provider":"typesafe","model":"jev-1.13.0","inputHash":"319baf51f59927439bf45333b00167ac6bb2deee4a7d3b8e746566d00026144f","decidedAt":"2026-11-09T03:09:53.475Z"},"provenance":{"textHash":"f0cd26de826f2f8351fbe359b0821f63fb7c9d9b771feee5dda7a62aa08abe3a","observationId":"509de568d634a54656508c033a549af67cea323eb1e08489d41235a793bf42d8","retrievedAt":"2026-11-09T03:09:52.316Z","kind":"publisher-page","preparer":{"model":"gpt-6-luna","runId":"4f26721a-b203-4816-86b3-9f427f3b6229"},"reviewer":{"model":"gpt-6-luna","runId":"2c49b227-9b43-4766-847d-bbcf83ca810e"}},"audit":{"status":"uncertain","reviewedAt":"2026-11-09T03:10:34.237Z","model":"anthropic/claude-opus-5.5"},"sourceAttribution":{"authors":[{"name":"Ganzfried, Sam","url":null,"kind":"unknown"}],"authorRole":"article-author","hosts":[],"status":"stated","authorRoster":{"truncated":false,"omitted":0,"assertionGroupsOmitted":0},"participation":[{"actor":{"name":"Ganzfried, Sam","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Ganzfried, Sam","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.07089","locator":"head/meta[name=author|citation_author]"},"assertionId":"3ac80641df66e73bc0d0e2c303348f3f5663b544f620363173636f31d53c3941:participation:0","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-09T03:42:07.815Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"3ac80641df66e73bc0d0e2c303348f3f5663b544f620363173636f31d53c3941","sourceUrl":"https://arxiv.org/abs/2611.07089","contentSha256":"435749931ef56600bfe7a8f38c75653f20e92ba1b99d01bd996f3895ace73c3e","textHash":"f0cd26de826f2f8351fbe359b0821f63fb7c9d9b771feee5dda7a62aa08abe3a","observedAt":"2026-11-09T03:42:07.815Z"}}],"participationCoverage":{"total":1,"returned":1,"complete":true,"fullAssertions":"source-metadata-endpoint"},"distribution":null,"publisher":null,"sourceUrl":"https://arxiv.org/abs/2611.07089","snapshotId":"3ac80641df66e73bc0d0e2c303348f3f5663b544f620363173636f31d53c3941","contentSha256":"435749931ef56600bfe7a8f38c75653f20e92ba1b99d01bd996f3895ace73c3e","textHash":"f0cd26de826f2f8351fbe359b0821f63fb7c9d9b771feee5dda7a62aa08abe3a","observedAt":"2026-11-09T03:42:07.815Z","basis":"publisher-page-metadata","sourceLinks":43,"linksTruncated":false,"metadataUrl":"/api/pipeline/stream/b30e5626a741e969cd5dade462ee95d9b21fd5dd83b89a42e7ce6f4ba011feed/source"}},"canonicalUrl":"https://escapemeridian.com/readings/polynomial-time-computation-of-extensive-form-proper-equilibria-b30e5626","formats":{"html":"/readings/polynomial-time-computation-of-extensive-form-proper-equilibria-b30e5626","markdown":"/readings/polynomial-time-computation-of-extensive-form-proper-equilibria-b30e5626.md","json":"/readings/polynomial-time-computation-of-extensive-form-proper-equilibria-b30e5626.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":[],"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":"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"},{"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"}]},"researchQuestions":[],"withdrawn":false,"references":{"schemaVersion":1,"target":{"type":"reading","id":"b30e5626a741e969cd5dade462ee95d9b21fd5dd83b89a42e7ce6f4ba011feed","revision":"77d11a82-05df-4c28-8b75-c9bdd6df32b1","revisionKind":"publication-id","title":"Polynomial-Time Computation of Extensive-Form Proper Equilibria in Two-Player Zero-Sum Games","url":"https://escapemeridian.com/readings/polynomial-time-computation-of-extensive-form-proper-equilibria-b30e5626"},"source":{"type":"source","id":"https://arxiv.org/abs/2611.07089","revision":"f0cd26de826f2f8351fbe359b0821f63fb7c9d9b771feee5dda7a62aa08abe3a","revisionKind":"sha256-source-text","title":"Polynomial-Time Computation of Extensive-Form Proper Equilibria in Two-Player Zero-Sum Games","url":"https://arxiv.org/abs/2611.07089"},"status":"available","items":[],"next":null,"scope":"Explicit citations in public readings and public file attachments to this reading. Shared topics are not citations. Other artifact types need an explicit reference adapter."},"revisions":[{"id":"b30e5626a741e969cd5dade462ee95d9b21fd5dd83b89a42e7ce6f4ba011feed","title":"Polynomial-Time Computation of Extensive-Form Proper Equilibria in Two-Player Zero-Sum Games","argument":"Sam Ganzfried presents a deterministic polynomial-time algorithm for computing an exact extensive-form proper equilibrium in finite two-player zero-sum games with perfect recall and rational data. In this setting, properness means penalizing a less desirable action relative to a better one while holding the player’s other local choices, including future actions, fixed. The method assigns each information set a geometric permutahedron of allowable action probabilities, embeds those restrictions in a polynomial-size sequence-form polytope, and uses a saddle point to satisfy local ε-properness inequalities. Ganzfried says the method goes beyond finding an answer only after an arbitrarily small numerical perturbation: sign stability of a parametric linear system lets the algorithm construct a persistent feasible basis and extract limits of behavioral ratios. The resulting probabilities are rational and have polynomial encoding length, even at information sets with zero realization probability. The result is a theoretical computation method for the stated class of games; the abstract does not report tests on concrete games or practical runtime measurements.","topicIds":["intelligence-and-discovery"],"domain":"science","claimType":"attributed reading","limits":"The result is stated for finite two-player zero-sum extensive-form games with perfect recall and rational data; the abstract does not establish applicability outside those conditions. The abstract describes an algorithm and its mathematical properties but gives no runtime measurements on concrete games.","speaker":{"name":"Ganzfried, Sam","roleAtSource":"Article author"},"source":{"title":"Polynomial-Time Computation of Extensive-Form Proper Equilibria in Two-Player Zero-Sum Games","publisher":"arXiv cs.AI","format":"Article","url":"https://arxiv.org/abs/2611.07089","publishedAt":"2026-11-04","dateBasis":"Date basis not provided."},"evidence":[{"text":"Sam Ganzfried says the paper gives a deterministic polynomial-time algorithm to compute an exact extensive-form proper equilibrium for finite two-player zero-sum games with perfect recall and rational data.","excerpt":"We give a deterministic polynomial-time algorithm for computing an exact extensive-form proper equilibrium in a finite two-player zero-sum extensive-form game with perfect recall and rational data.","url":"https://arxiv.org/abs/2611.07089","relationship":"Source-stated"},{"text":"The algorithm imposes local action-probability restrictions through geometric permutahedra and embeds them in a polynomial-size sequence-form polytope.","excerpt":"Our algorithm assigns each information set a geometric permutahedron of allowable action probabilities. A scaled doubly stochastic representation embeds these restrictions in a polynomial-size sequence-form polytope","url":"https://arxiv.org/abs/2611.07089","relationship":"Source-stated"},{"text":"The paper says its method obtains an exact equilibrium using sign stability and a persistent feasible basis, rather than relying on an arbitrarily small numerical perturbation.","excerpt":"To obtain an exact equilibrium rather than a solution at an arbitrarily small numerical perturbation, we establish sign stability of a parametric linear system, construct a persistent feasible basis","url":"https://arxiv.org/abs/2611.07089","relationship":"Source-stated"},{"text":"The resulting probabilities are rational and have polynomial encoding length, including at information sets whose realization probabilities vanish.","excerpt":"The resulting probabilities are rational and have polynomial encoding length, including at information sets whose realization probabilities vanish.","url":"https://arxiv.org/abs/2611.07089","relationship":"Source-stated"}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.07089","checkedAt":"2026-11-09T03:42:07.815Z","items":[],"note":"No suitable media was found by the supported page extraction."},"assumptions":[],"openQuestion":{"attribution":"Open question","text":"How does the algorithm’s runtime scale on concrete games in the stated class, including at information sets whose realization probabilities vanish?"},"whatWouldChangeView":{"attribution":"Change condition not recorded","text":""},"editorialComparisons":[],"live":{"title":"Polynomial-Time Computation of Extensive-Form Proper Equilibria in Two-Player Zero-Sum Games","summary":"Sam Ganzfried presents a deterministic polynomial-time algorithm for computing an exact extensive-form proper equilibrium in finite two-player zero-sum games with perfect recall and rational data. In this setting, properness means penalizing a less desirable action relative to a better one while holding the player’s other local choices, including future actions, fixed. The method assigns each information set a geometric permutahedron of allowable action probabilities, embeds those restrictions in a polynomial-size sequence-form polytope, and uses a saddle point to satisfy local ε-properness inequalities. Ganzfried says the method goes beyond finding an answer only after an arbitrarily small numerical perturbation: sign stability of a parametric linear system lets the algorithm construct a persistent feasible basis and extract limits of behavioral ratios. The resulting probabilities are rational and have polynomial encoding length, even at information sets with zero realization probability. The result is a theoretical computation method for the stated class of games; the abstract does not report tests on concrete games or practical runtime measurements.","question":"How does the algorithm’s runtime scale on concrete games in the stated class, including at information sets whose realization probabilities vanish?","claims":[{"text":"Sam Ganzfried says the paper gives a deterministic polynomial-time algorithm to compute an exact extensive-form proper equilibrium for finite two-player zero-sum games with perfect recall and rational data.","excerpt":"We give a deterministic polynomial-time algorithm for computing an exact extensive-form proper equilibrium in a finite two-player zero-sum extensive-form game with perfect recall and rational data.","support":"source-stated"},{"text":"The algorithm imposes local action-probability restrictions through geometric permutahedra and embeds them in a polynomial-size sequence-form polytope.","excerpt":"Our algorithm assigns each information set a geometric permutahedron of allowable action probabilities. A scaled doubly stochastic representation embeds these restrictions in a polynomial-size sequence-form polytope","support":"source-stated"},{"text":"The paper says its method obtains an exact equilibrium using sign stability and a persistent feasible basis, rather than relying on an arbitrarily small numerical perturbation.","excerpt":"To obtain an exact equilibrium rather than a solution at an arbitrarily small numerical perturbation, we establish sign stability of a parametric linear system, construct a persistent feasible basis","support":"source-stated"},{"text":"The resulting probabilities are rational and have polynomial encoding length, including at information sets whose realization probabilities vanish.","excerpt":"The resulting probabilities are rational and have polynomial encoding length, including at information sets whose realization probabilities vanish.","support":"source-stated"}],"limitations":["The result is stated for finite two-player zero-sum extensive-form games with perfect recall and rational data; the abstract does not establish applicability outside those conditions.","The abstract describes an algorithm and its mathematical properties but gives no runtime measurements on concrete games."],"mediaId":"a43d3484909ac2b4041e0669f7eac2d66865aaf02b7452662f2ef2ee192f448c","correctionReason":null,"id":"b30e5626a741e969cd5dade462ee95d9b21fd5dd83b89a42e7ce6f4ba011feed","publicationId":"77d11a82-05df-4c28-8b75-c9bdd6df32b1","version":1,"sourceUrl":"https://arxiv.org/abs/2611.07089","sourceTitle":"Polynomial-Time Computation of Extensive-Form Proper Equilibria in Two-Player Zero-Sum Games","publisher":"arXiv cs.AI","publishedAt":null,"originalPublished":{"value":"2026-11-04","precision":"day","basis":"publisher_citation_date"},"firstObservedAt":"2026-11-06T05:03:39.308Z","createdAt":"2026-11-09T03:10:34.237Z","historical":true,"entityIds":["arxiv"],"topicIds":["intelligence-and-discovery"],"media":[{"id":"a43d3484909ac2b4041e0669f7eac2d66865aaf02b7452662f2ef2ee192f448c","kind":"article","url":"https://arxiv.org/abs/2611.07089","sourceUrl":"https://arxiv.org/abs/2611.07089","label":"Read original","provenance":"source_link","verification":{"status":"verified","checkedAt":"2026-11-09T03:09:52.475Z","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.07089","checkedAt":"2026-11-09T03:42:07.815Z","items":[],"note":"No suitable media was found by the supported page extraction."},"editorialDecision":{"outcome":"accept","reasonCodes":["material_development"],"rubricVersion":"stream-admission-v5","mediaId":"a43d3484909ac2b4041e0669f7eac2d66865aaf02b7452662f2ef2ee192f448c","confidence":0.52,"provider":"typesafe","model":"jev-1.13.0","inputHash":"319baf51f59927439bf45333b00167ac6bb2deee4a7d3b8e746566d00026144f","decidedAt":"2026-11-09T03:09:53.475Z"},"provenance":{"textHash":"f0cd26de826f2f8351fbe359b0821f63fb7c9d9b771feee5dda7a62aa08abe3a","observationId":"509de568d634a54656508c033a549af67cea323eb1e08489d41235a793bf42d8","retrievedAt":"2026-11-09T03:09:52.316Z","kind":"publisher-page","preparer":{"model":"gpt-6-luna","runId":"4f26721a-b203-4816-86b3-9f427f3b6229"},"reviewer":{"model":"gpt-6-luna","runId":"2c49b227-9b43-4766-847d-bbcf83ca810e"}},"audit":{"status":"uncertain","reviewedAt":"2026-11-09T03:10:34.237Z","model":"anthropic/claude-opus-5.5"},"sourceAttribution":{"authors":[{"name":"Ganzfried, Sam","url":null,"kind":"unknown"}],"authorRole":"article-author","hosts":[],"status":"stated","authorRoster":{"truncated":false,"omitted":0,"assertionGroupsOmitted":0},"participation":[{"actor":{"name":"Ganzfried, Sam","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Ganzfried, Sam","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.07089","locator":"head/meta[name=author|citation_author]"},"assertionId":"3ac80641df66e73bc0d0e2c303348f3f5663b544f620363173636f31d53c3941:participation:0","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-09T03:42:07.815Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"3ac80641df66e73bc0d0e2c303348f3f5663b544f620363173636f31d53c3941","sourceUrl":"https://arxiv.org/abs/2611.07089","contentSha256":"435749931ef56600bfe7a8f38c75653f20e92ba1b99d01bd996f3895ace73c3e","textHash":"f0cd26de826f2f8351fbe359b0821f63fb7c9d9b771feee5dda7a62aa08abe3a","observedAt":"2026-11-09T03:42:07.815Z"}}],"participationCoverage":{"total":1,"returned":1,"complete":true,"fullAssertions":"source-metadata-endpoint"},"distribution":null,"publisher":null,"sourceUrl":"https://arxiv.org/abs/2611.07089","snapshotId":"3ac80641df66e73bc0d0e2c303348f3f5663b544f620363173636f31d53c3941","contentSha256":"435749931ef56600bfe7a8f38c75653f20e92ba1b99d01bd996f3895ace73c3e","textHash":"f0cd26de826f2f8351fbe359b0821f63fb7c9d9b771feee5dda7a62aa08abe3a","observedAt":"2026-11-09T03:42:07.815Z","basis":"publisher-page-metadata","sourceLinks":43,"linksTruncated":false,"metadataUrl":"/api/pipeline/stream/b30e5626a741e969cd5dade462ee95d9b21fd5dd83b89a42e7ce6f4ba011feed/source"}}}],"audits":[{"publicationId":"77d11a82-05df-4c28-8b75-c9bdd6df32b1","verdict":"uncertain","findings":[{"dimension":"attribution","status":"pass","explanation":"The reading correctly credits Sam Ganzfried as the sole listed author. It keeps the result framed as the paper's own claim rather than an independently verified fact.","excerpt":"Authors:Sam Ganzfried"},{"dimension":"summary","status":"uncertain","explanation":"The summary mostly restates the abstract almost verbatim, so it is faithful, but a general reader is likely lost. Several central terms are never explained in plain language: extensive-form proper equilibrium, perfect recall, information set, permutahedron, sequence-form polytope and saddle point. The reading also never says why an exact proper equilibrium matters, even conditionally. Smallest repair: add one plain sentence on what this kind of equilibrium is and why exactness is the point, and add term-library tooltips for the jargon. One minor narrowing: the source fixes all other local behavioral choices, not just the same player's choices.","excerpt":"an action at an information set is penalized relative to a better action while all other local behavioral choices, including the player's own future actions, remain fixed"},{"dimension":"date","status":"pass","explanation":"The originalPublished value, 2026-11-04, matches the v1 submission date. The later feed date was correctly not used.","excerpt":"[Submitted on 4 Nov 2026]"},{"dimension":"support","status":"pass","explanation":"Each claim matches the abstract's wording, and the limitations accurately note that the abstract reports no empirical runtime measurements. One small blur: the question ties runtime to vanishing-realization information sets, but the source's 'including' clause refers to encoding length, not runtime. It is still a legitimate open question, not an unsupported claim.","excerpt":"The resulting probabilities are rational and have polynomial encoding length, including at information sets whose realization probabilities vanish."},{"dimension":"media","status":"pass","explanation":"The selected media is the verified direct arXiv abstract page, matching the source URL. It is the most direct way for a reader to reach the original paper.","excerpt":null}],"createdAt":"2026-11-09T03:10:34.237Z","model":"anthropic/claude-opus-5.5"}],"correctionUrl":"https://escapemeridian.com/corrections/"}