{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UMPARBBSLWAPWX23VO6KVUFOVW","short_pith_number":"pith:UMPARBBS","schema_version":"1.0","canonical_sha256":"a31e0884325d80fb5f5babbcaad0aead910bae21beb0873cf93e6937c49c4b46","source":{"kind":"arxiv","id":"2503.14690","version":8},"attestation_state":"computed","paper":{"title":"Verifying Equilibria in Finite-Horizon Probabilistic Concurrent Game Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.GT","authors_text":"Moshe Y. Vardi, Senthil Rajasekaran","submitted_at":"2025-03-18T19:47:24Z","abstract_excerpt":"Finite-horizon probabilistic multiagent concurrent game systems, also known as finite multiplayer stochastic games, are a well-studied model in computer science due to their ability to represent a wide range of real-world scenarios involving strategic interactions among agents over a finite amount of iterations (given by the finite-horizon). The analysis of these games typically focuses on evaluating (verifying) and computing (synthesizing/realizing) which strategy profiles (functions that represent the behavior of each agent) qualify as equilibria. The two most prominent equilibrium concepts "},"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":"2503.14690","kind":"arxiv","version":8},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-03-18T19:47:24Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"29dbf688d06c624991334f61ae6ab4972181dcfdc257260f3461d61b243bdd61","abstract_canon_sha256":"e25d08674858cca71b294cd4e3dcf2fe3b7320152d160464a434688ce71a9a8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T02:05:32.962363Z","signature_b64":"Wm4CE7P2ZefX/5GAzVqGQEYb/YM4/xIVUfQ7nyEYL6kgqsJW6yWh3/k/yZ/in/eKltB30YGlvCPmN7T/2icVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a31e0884325d80fb5f5babbcaad0aead910bae21beb0873cf93e6937c49c4b46","last_reissued_at":"2026-05-20T02:05:32.961553Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T02:05:32.961553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Verifying Equilibria in Finite-Horizon Probabilistic Concurrent Game Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.GT","authors_text":"Moshe Y. Vardi, Senthil Rajasekaran","submitted_at":"2025-03-18T19:47:24Z","abstract_excerpt":"Finite-horizon probabilistic multiagent concurrent game systems, also known as finite multiplayer stochastic games, are a well-studied model in computer science due to their ability to represent a wide range of real-world scenarios involving strategic interactions among agents over a finite amount of iterations (given by the finite-horizon). The analysis of these games typically focuses on evaluating (verifying) and computing (synthesizing/realizing) which strategy profiles (functions that represent the behavior of each agent) qualify as equilibria. The two most prominent equilibrium concepts "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.14690","kind":"arxiv","version":8},"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/2503.14690/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":"2503.14690","created_at":"2026-05-20T02:05:32.961672+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.14690v8","created_at":"2026-05-20T02:05:32.961672+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.14690","created_at":"2026-05-20T02:05:32.961672+00:00"},{"alias_kind":"pith_short_12","alias_value":"UMPARBBSLWAP","created_at":"2026-05-20T02:05:32.961672+00:00"},{"alias_kind":"pith_short_16","alias_value":"UMPARBBSLWAPWX23","created_at":"2026-05-20T02:05:32.961672+00:00"},{"alias_kind":"pith_short_8","alias_value":"UMPARBBS","created_at":"2026-05-20T02:05:32.961672+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2602.08452","citing_title":"Modeling Concurrent Multi-Agent Systems","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UMPARBBSLWAPWX23VO6KVUFOVW","json":"https://pith.science/pith/UMPARBBSLWAPWX23VO6KVUFOVW.json","graph_json":"https://pith.science/api/pith-number/UMPARBBSLWAPWX23VO6KVUFOVW/graph.json","events_json":"https://pith.science/api/pith-number/UMPARBBSLWAPWX23VO6KVUFOVW/events.json","paper":"https://pith.science/paper/UMPARBBS"},"agent_actions":{"view_html":"https://pith.science/pith/UMPARBBSLWAPWX23VO6KVUFOVW","download_json":"https://pith.science/pith/UMPARBBSLWAPWX23VO6KVUFOVW.json","view_paper":"https://pith.science/paper/UMPARBBS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.14690&json=true","fetch_graph":"https://pith.science/api/pith-number/UMPARBBSLWAPWX23VO6KVUFOVW/graph.json","fetch_events":"https://pith.science/api/pith-number/UMPARBBSLWAPWX23VO6KVUFOVW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UMPARBBSLWAPWX23VO6KVUFOVW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UMPARBBSLWAPWX23VO6KVUFOVW/action/storage_attestation","attest_author":"https://pith.science/pith/UMPARBBSLWAPWX23VO6KVUFOVW/action/author_attestation","sign_citation":"https://pith.science/pith/UMPARBBSLWAPWX23VO6KVUFOVW/action/citation_signature","submit_replication":"https://pith.science/pith/UMPARBBSLWAPWX23VO6KVUFOVW/action/replication_record"}},"created_at":"2026-05-20T02:05:32.961672+00:00","updated_at":"2026-05-20T02:05:32.961672+00:00"}