{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:RBLHGNEWKKA7XNINHQTDPJYAPL","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b3f85edc29037bc1a4e1753a4c059cbb3a682cdef3f552d08342f57d3695f230","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-05-17T19:08:32Z","title_canon_sha256":"be04aacfdbe4a056e4944e4baf1af01341c7a01bffcd0204ed9f9c676731a081"},"schema_version":"1.0","source":{"id":"2605.17607","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17607","created_at":"2026-05-20T00:04:48Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17607v1","created_at":"2026-05-20T00:04:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17607","created_at":"2026-05-20T00:04:48Z"},{"alias_kind":"pith_short_12","alias_value":"RBLHGNEWKKA7","created_at":"2026-05-20T00:04:48Z"},{"alias_kind":"pith_short_16","alias_value":"RBLHGNEWKKA7XNIN","created_at":"2026-05-20T00:04:48Z"},{"alias_kind":"pith_short_8","alias_value":"RBLHGNEW","created_at":"2026-05-20T00:04:48Z"}],"graph_snapshots":[{"event_id":"sha256:980cd26e6f74b42b3d18aa1bbc687fd17f05f835c6c98b142cdfd0826ea78cef","target":"graph","created_at":"2026-05-20T00:04:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"we prove that Euclidean RRM algorithms converge almost surely to the unique, efficient Bayes-Nash equilibrium within a finite-dimensional approximation of the strategy space."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The strategy space admits a finite-dimensional approximation by symmetric piecewise-linear pricing functions for which a global Lyapunov function can be explicitly constructed (abstract, paragraph on duopoly analysis)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Euclidean RRM algorithms converge almost surely to the unique efficient Bayes-Nash equilibrium in a finite-dimensional approximation of Bayesian Bertrand competition with private costs."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Euclidean RRM algorithms converge almost surely to the unique efficient Bayes-Nash equilibrium in finite-dimensional approximations of Bayesian Bertrand competition."}],"snapshot_sha256":"61097d1bae2af27059781e48b21e083cb7b368c92d424ec0ae235e63ddd2793a"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"63e27e45ef05ff990de64d502d7df735d8fc9b453535837bb804f45cf38cb2ac"},"integrity":{"available":true,"clean":false,"detectors_run":[{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T22:53:10.409710Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T22:31:19.538182Z","status":"completed","version":"1.0.0"},{"findings_count":1,"name":"doi_compliance","ran_at":"2026-05-19T22:21:37.325564Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.571225Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T21:21:57.499591Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.17607/integrity.json","findings":[{"audited_at":"2026-05-19T22:21:37.325564Z","detected_arxiv_id":null,"detected_doi":"10.1016/0893-9659(90)90018-h","detector":"doi_compliance","finding_type":"unresolvable_identifier","note":"Identifier '10.1016/0893-9659(90)90018-h' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","ref_index":15,"severity":"critical","verdict_class":"cross_source"}],"snapshot_sha256":"811e349ca539347c4af9597c5a769450b70d81f00c8c55e79a7e54d9ffa8e9e0","summary":{"advisory":0,"by_detector":{"doi_compliance":{"advisory":0,"critical":1,"informational":0,"total":1}},"critical":1,"informational":0}},"paper":{"abstract_excerpt":"Autonomous pricing agents are widely deployed in online marketplaces, making algorithmic pricing a prominent application of multi-agent learning. Experimental studies often report collusive outcomes, but these findings typically rely on Q-learning in complete-information environments and lack rigorous convergence guarantees. In this paper, we study the stochastic learning dynamics of Regularized Robbins-Monro (RRM) algorithms in a Bayesian Bertrand competition with private costs. We show that this setting violates standard stability conditions, including monotonicity and the Minty variational ","authors_text":"Jan-Sebastian Hoehener, Martin Bichler","cross_cats":[],"headline":"Euclidean RRM algorithms converge almost surely to the unique efficient Bayes-Nash equilibrium in finite-dimensional approximations of Bayesian Bertrand competition.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-05-17T19:08:32Z","title":"Convergence of Stochastic First-Order Algorithms in Bertrand Competition Under Incomplete Information"},"references":{"count":21,"internal_anchors":0,"resolved_work":21,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"The art of retail pricing: Developing a taxonomy for describing pricing algorithms.European Conference on Information Systems, 2024","work_id":"bb9b858b-5cea-458a-8561-a2f193747f66","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Online Learning and Online Convex Optimization.Foundations and Trends® in Machine Learning, 4(2):107–194, 2011","work_id":"ddf029f4-4357-48e8-b319-80cdbadb27d0","year":2011},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Book review of theorie mathematique de la richesse social and of recherches sur les principes mathematiques de la theorie des richesses.Journal des Savants, 1883","work_id":"77037220-a844-439d-b95c-02d4a7cab397","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Algorithmic Pricing What Implications for Competition Policy?Review of Industrial Organization, 55(1):155–171, aug 2019","work_id":"ee32d79d-e34e-4222-a622-d1b853e7b831","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Autonomous algorithmic collusion: Q-learning under sequential pricing.The RAND Journal of Economics, 52(3):538–558, 2021","work_id":"f36ed796-4b19-4ddb-bd17-b198528c4a67","year":2021}],"snapshot_sha256":"2f2bb3a538102bb6b8807ad1e9bc2290f12aba80048256060f9c6dfefb067f5b"},"source":{"id":"2605.17607","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T22:14:16.199865Z","id":"9913a176-bf21-4766-9c97-0fc128345d85","model_set":{"reader":"grok-4.3"},"one_line_summary":"Euclidean RRM algorithms converge almost surely to the unique efficient Bayes-Nash equilibrium in a finite-dimensional approximation of Bayesian Bertrand competition with private costs.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Euclidean RRM algorithms converge almost surely to the unique efficient Bayes-Nash equilibrium in finite-dimensional approximations of Bayesian Bertrand competition.","strongest_claim":"we prove that Euclidean RRM algorithms converge almost surely to the unique, efficient Bayes-Nash equilibrium within a finite-dimensional approximation of the strategy space.","weakest_assumption":"The strategy space admits a finite-dimensional approximation by symmetric piecewise-linear pricing functions for which a global Lyapunov function can be explicitly constructed (abstract, paragraph on duopoly analysis)."}},"verdict_id":"9913a176-bf21-4766-9c97-0fc128345d85"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f21f0e5a128aec0b904349ef513c9668e85e44c1d48ce39c5644c24f208914fe","target":"record","created_at":"2026-05-20T00:04:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b3f85edc29037bc1a4e1753a4c059cbb3a682cdef3f552d08342f57d3695f230","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-05-17T19:08:32Z","title_canon_sha256":"be04aacfdbe4a056e4944e4baf1af01341c7a01bffcd0204ed9f9c676731a081"},"schema_version":"1.0","source":{"id":"2605.17607","kind":"arxiv","version":1}},"canonical_sha256":"88567334965281fbb50d3c2637a7007ad8efc3327185d9e53783c9233ccf87cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88567334965281fbb50d3c2637a7007ad8efc3327185d9e53783c9233ccf87cd","first_computed_at":"2026-05-20T00:04:48.221385Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:04:48.221385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TMWQmAFw54ZBOCNO4IQtmKM3A6NAwNSCZEh0y22MhPj4VDParymjXoSd5U+5ZZJCt8ZxsifV2LFE7xrL0xF4Cw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:04:48.222290Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.17607","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:328d2196f5c6e722b7501976426e7dbb6f0ae9956bd539c1860c99f8b8599f50","sha256:f21f0e5a128aec0b904349ef513c9668e85e44c1d48ce39c5644c24f208914fe","sha256:980cd26e6f74b42b3d18aa1bbc687fd17f05f835c6c98b142cdfd0826ea78cef"],"state_sha256":"199ff6a291a6c2cf4c848e013f43628155f723f32b5f7de49e4cda436076aeb8"}