{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:5Y3SMBSACNLE5DST7HKP5CLC4A","short_pith_number":"pith:5Y3SMBSA","schema_version":"1.0","canonical_sha256":"ee3726064013564e8e53f9d4fe8962e0149a7efc62eb7a8fb76996501f95ce35","source":{"kind":"arxiv","id":"2109.04178","version":2},"attestation_state":"computed","paper":{"title":"Multiple Oracle Algorithm to Solve Continuous Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.GT","authors_text":"T. Kroupa, T. Votroubek","submitted_at":"2021-09-09T11:31:28Z","abstract_excerpt":"Continuous games are multiplayer games in which strategy sets are compact and utility functions are continuous. These games typically have a highly complicated structure of Nash equilibria, and numerical methods for the equilibrium computation are known only for particular classes of continuous games, such as two-player polynomial games or games in which pure equilibria are guaranteed to exist. This contribution focuses on the computation and approximation of a mixed strategy equilibrium for the whole class of multiplayer general-sum continuous games. We vastly extend the scope of applicabilit"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2109.04178","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2021-09-09T11:31:28Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"8b9e986383e3b71bc6c8ac7e4044973e4070ac39a3b70904a2ba9063a2679409","abstract_canon_sha256":"acc49ce6ad4248cd37b6af791ddcaaec10df8581313f6650ef44c5c4417e58c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:38:43.874288Z","signature_b64":"4t4mZ60lod0K9Z0zZW1mQkhLYK5XCU/ls2diq+O0h01KLOipbDepOYtrbDI4D+Q6fCrRuYIHxwGu9KvLJCTFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee3726064013564e8e53f9d4fe8962e0149a7efc62eb7a8fb76996501f95ce35","last_reissued_at":"2026-07-05T04:38:43.873889Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:38:43.873889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiple Oracle Algorithm to Solve Continuous Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.GT","authors_text":"T. Kroupa, T. Votroubek","submitted_at":"2021-09-09T11:31:28Z","abstract_excerpt":"Continuous games are multiplayer games in which strategy sets are compact and utility functions are continuous. These games typically have a highly complicated structure of Nash equilibria, and numerical methods for the equilibrium computation are known only for particular classes of continuous games, such as two-player polynomial games or games in which pure equilibria are guaranteed to exist. This contribution focuses on the computation and approximation of a mixed strategy equilibrium for the whole class of multiplayer general-sum continuous games. We vastly extend the scope of applicabilit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.04178","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2109.04178/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2109.04178","created_at":"2026-07-05T04:38:43.873951+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.04178v2","created_at":"2026-07-05T04:38:43.873951+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.04178","created_at":"2026-07-05T04:38:43.873951+00:00"},{"alias_kind":"pith_short_12","alias_value":"5Y3SMBSACNLE","created_at":"2026-07-05T04:38:43.873951+00:00"},{"alias_kind":"pith_short_16","alias_value":"5Y3SMBSACNLE5DST","created_at":"2026-07-05T04:38:43.873951+00:00"},{"alias_kind":"pith_short_8","alias_value":"5Y3SMBSA","created_at":"2026-07-05T04:38:43.873951+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5Y3SMBSACNLE5DST7HKP5CLC4A","json":"https://pith.science/pith/5Y3SMBSACNLE5DST7HKP5CLC4A.json","graph_json":"https://pith.science/api/pith-number/5Y3SMBSACNLE5DST7HKP5CLC4A/graph.json","events_json":"https://pith.science/api/pith-number/5Y3SMBSACNLE5DST7HKP5CLC4A/events.json","paper":"https://pith.science/paper/5Y3SMBSA"},"agent_actions":{"view_html":"https://pith.science/pith/5Y3SMBSACNLE5DST7HKP5CLC4A","download_json":"https://pith.science/pith/5Y3SMBSACNLE5DST7HKP5CLC4A.json","view_paper":"https://pith.science/paper/5Y3SMBSA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.04178&json=true","fetch_graph":"https://pith.science/api/pith-number/5Y3SMBSACNLE5DST7HKP5CLC4A/graph.json","fetch_events":"https://pith.science/api/pith-number/5Y3SMBSACNLE5DST7HKP5CLC4A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5Y3SMBSACNLE5DST7HKP5CLC4A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5Y3SMBSACNLE5DST7HKP5CLC4A/action/storage_attestation","attest_author":"https://pith.science/pith/5Y3SMBSACNLE5DST7HKP5CLC4A/action/author_attestation","sign_citation":"https://pith.science/pith/5Y3SMBSACNLE5DST7HKP5CLC4A/action/citation_signature","submit_replication":"https://pith.science/pith/5Y3SMBSACNLE5DST7HKP5CLC4A/action/replication_record"}},"created_at":"2026-07-05T04:38:43.873951+00:00","updated_at":"2026-07-05T04:38:43.873951+00:00"}