{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FSQLGMYJJC3IN7RU4UFXS6XIB3","short_pith_number":"pith:FSQLGMYJ","schema_version":"1.0","canonical_sha256":"2ca0b3330948b686fe34e50b797ae80ec46a987919a57c2626205d01af0436b8","source":{"kind":"arxiv","id":"2405.14122","version":1},"attestation_state":"computed","paper":{"title":"Modeling Other Players with Bayesian Beliefs for Games with Incomplete Information","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Mahdi Imani, Tian Lan, Zuyuan Zhang","submitted_at":"2024-05-23T02:49:05Z","abstract_excerpt":"Bayesian games model interactive decision-making where players have incomplete information -- e.g., regarding payoffs and private data on players' strategies and preferences -- and must actively reason and update their belief models (with regard to such information) using observation and interaction history. Existing work on counterfactual regret minimization have shown great success for games with complete or imperfect information, but not for Bayesian games. To this end, we introduced a new CFR algorithm: Bayesian-CFR and analyze its regret bound with respect to Bayesian Nash Equilibria in B"},"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":"2405.14122","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-05-23T02:49:05Z","cross_cats_sorted":[],"title_canon_sha256":"e4942d7968aa1849fab0241031c5b29d8bc3ca539e322fc7c52aade0e82a94c0","abstract_canon_sha256":"24907618abd1990b59ecf90ebb717f6472748200c7e70e2b6c53dd6b77b274b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:22:10.533799Z","signature_b64":"DEEmu1fq1+NeTyBV8tFkmhc28j2LKkoNv9dYbEA1DuWMvx6/p/ctiaWNMCI1kZj9mHeEC9fVqm1zzvrRVL81CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ca0b3330948b686fe34e50b797ae80ec46a987919a57c2626205d01af0436b8","last_reissued_at":"2026-07-05T08:22:10.533374Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:22:10.533374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modeling Other Players with Bayesian Beliefs for Games with Incomplete Information","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Mahdi Imani, Tian Lan, Zuyuan Zhang","submitted_at":"2024-05-23T02:49:05Z","abstract_excerpt":"Bayesian games model interactive decision-making where players have incomplete information -- e.g., regarding payoffs and private data on players' strategies and preferences -- and must actively reason and update their belief models (with regard to such information) using observation and interaction history. Existing work on counterfactual regret minimization have shown great success for games with complete or imperfect information, but not for Bayesian games. To this end, we introduced a new CFR algorithm: Bayesian-CFR and analyze its regret bound with respect to Bayesian Nash Equilibria in B"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.14122","kind":"arxiv","version":1},"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/2405.14122/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":"2405.14122","created_at":"2026-07-05T08:22:10.533430+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.14122v1","created_at":"2026-07-05T08:22:10.533430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.14122","created_at":"2026-07-05T08:22:10.533430+00:00"},{"alias_kind":"pith_short_12","alias_value":"FSQLGMYJJC3I","created_at":"2026-07-05T08:22:10.533430+00:00"},{"alias_kind":"pith_short_16","alias_value":"FSQLGMYJJC3IN7RU","created_at":"2026-07-05T08:22:10.533430+00:00"},{"alias_kind":"pith_short_8","alias_value":"FSQLGMYJ","created_at":"2026-07-05T08:22:10.533430+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.18809","citing_title":"Metric-Gradient Projection for Stable Multi-Agent Policy Learning","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14304","citing_title":"Matrix-Space Reinforcement Learning for Reusing Local Transition Geometry","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06500","citing_title":"Operator-Guided Invariance Learning for Continuous Reinforcement Learning","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FSQLGMYJJC3IN7RU4UFXS6XIB3","json":"https://pith.science/pith/FSQLGMYJJC3IN7RU4UFXS6XIB3.json","graph_json":"https://pith.science/api/pith-number/FSQLGMYJJC3IN7RU4UFXS6XIB3/graph.json","events_json":"https://pith.science/api/pith-number/FSQLGMYJJC3IN7RU4UFXS6XIB3/events.json","paper":"https://pith.science/paper/FSQLGMYJ"},"agent_actions":{"view_html":"https://pith.science/pith/FSQLGMYJJC3IN7RU4UFXS6XIB3","download_json":"https://pith.science/pith/FSQLGMYJJC3IN7RU4UFXS6XIB3.json","view_paper":"https://pith.science/paper/FSQLGMYJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.14122&json=true","fetch_graph":"https://pith.science/api/pith-number/FSQLGMYJJC3IN7RU4UFXS6XIB3/graph.json","fetch_events":"https://pith.science/api/pith-number/FSQLGMYJJC3IN7RU4UFXS6XIB3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FSQLGMYJJC3IN7RU4UFXS6XIB3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FSQLGMYJJC3IN7RU4UFXS6XIB3/action/storage_attestation","attest_author":"https://pith.science/pith/FSQLGMYJJC3IN7RU4UFXS6XIB3/action/author_attestation","sign_citation":"https://pith.science/pith/FSQLGMYJJC3IN7RU4UFXS6XIB3/action/citation_signature","submit_replication":"https://pith.science/pith/FSQLGMYJJC3IN7RU4UFXS6XIB3/action/replication_record"}},"created_at":"2026-07-05T08:22:10.533430+00:00","updated_at":"2026-07-05T08:22:10.533430+00:00"}