{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SILCFMWAWE72Z4XT422TVCKKLB","short_pith_number":"pith:SILCFMWA","schema_version":"1.0","canonical_sha256":"921622b2c0b13facf2f3e6b53a894a5869e22cb604f98653928b354f92411b68","source":{"kind":"arxiv","id":"2508.19371","version":1},"attestation_state":"computed","paper":{"title":"Aggregate Fictitious Play for Learning in Anonymous Polymatrix Games (Extended Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.MA","cs.SY","eess.SY"],"primary_cat":"cs.GT","authors_text":"Semih Kara, Tamer Ba\\c{s}ar","submitted_at":"2025-08-26T19:04:58Z","abstract_excerpt":"Fictitious play (FP) is a well-studied algorithm that enables agents to learn Nash equilibrium in games with certain reward structures. However, when agents have no prior knowledge of the reward functions, FP faces a major challenge: the joint action space grows exponentially with the number of agents, which slows down reward exploration. Anonymous games offer a structure that mitigates this issue. In these games, the rewards depend only on the actions taken; not on who is taking which action. Under such a structure, we introduce aggregate fictitious play (agg-FP), a variant of FP where each a"},"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":"2508.19371","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-08-26T19:04:58Z","cross_cats_sorted":["cs.LG","cs.MA","cs.SY","eess.SY"],"title_canon_sha256":"dafaed5441bf2e4bb5a6500221e06e1a4eee2489069daa70b2cef4ccff2b4a87","abstract_canon_sha256":"1d210e9ee1197e42144e484931eed99ca650a1919025b209c7cc5b1c821a2ec7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:59:44.264633Z","signature_b64":"E8i++QIGZSH65NGaFPVYLkPNpX85P6l8EJ1z/W9QRD0eJqjRb1yO6LhZkzb291Ev1+WiO8uCm+tQGcRjDXc+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"921622b2c0b13facf2f3e6b53a894a5869e22cb604f98653928b354f92411b68","last_reissued_at":"2026-07-05T11:59:44.264172Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:59:44.264172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Aggregate Fictitious Play for Learning in Anonymous Polymatrix Games (Extended Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.MA","cs.SY","eess.SY"],"primary_cat":"cs.GT","authors_text":"Semih Kara, Tamer Ba\\c{s}ar","submitted_at":"2025-08-26T19:04:58Z","abstract_excerpt":"Fictitious play (FP) is a well-studied algorithm that enables agents to learn Nash equilibrium in games with certain reward structures. However, when agents have no prior knowledge of the reward functions, FP faces a major challenge: the joint action space grows exponentially with the number of agents, which slows down reward exploration. Anonymous games offer a structure that mitigates this issue. In these games, the rewards depend only on the actions taken; not on who is taking which action. Under such a structure, we introduce aggregate fictitious play (agg-FP), a variant of FP where each a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.19371","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/2508.19371/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":"2508.19371","created_at":"2026-07-05T11:59:44.264243+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.19371v1","created_at":"2026-07-05T11:59:44.264243+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.19371","created_at":"2026-07-05T11:59:44.264243+00:00"},{"alias_kind":"pith_short_12","alias_value":"SILCFMWAWE72","created_at":"2026-07-05T11:59:44.264243+00:00"},{"alias_kind":"pith_short_16","alias_value":"SILCFMWAWE72Z4XT","created_at":"2026-07-05T11:59:44.264243+00:00"},{"alias_kind":"pith_short_8","alias_value":"SILCFMWA","created_at":"2026-07-05T11:59:44.264243+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/SILCFMWAWE72Z4XT422TVCKKLB","json":"https://pith.science/pith/SILCFMWAWE72Z4XT422TVCKKLB.json","graph_json":"https://pith.science/api/pith-number/SILCFMWAWE72Z4XT422TVCKKLB/graph.json","events_json":"https://pith.science/api/pith-number/SILCFMWAWE72Z4XT422TVCKKLB/events.json","paper":"https://pith.science/paper/SILCFMWA"},"agent_actions":{"view_html":"https://pith.science/pith/SILCFMWAWE72Z4XT422TVCKKLB","download_json":"https://pith.science/pith/SILCFMWAWE72Z4XT422TVCKKLB.json","view_paper":"https://pith.science/paper/SILCFMWA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.19371&json=true","fetch_graph":"https://pith.science/api/pith-number/SILCFMWAWE72Z4XT422TVCKKLB/graph.json","fetch_events":"https://pith.science/api/pith-number/SILCFMWAWE72Z4XT422TVCKKLB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SILCFMWAWE72Z4XT422TVCKKLB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SILCFMWAWE72Z4XT422TVCKKLB/action/storage_attestation","attest_author":"https://pith.science/pith/SILCFMWAWE72Z4XT422TVCKKLB/action/author_attestation","sign_citation":"https://pith.science/pith/SILCFMWAWE72Z4XT422TVCKKLB/action/citation_signature","submit_replication":"https://pith.science/pith/SILCFMWAWE72Z4XT422TVCKKLB/action/replication_record"}},"created_at":"2026-07-05T11:59:44.264243+00:00","updated_at":"2026-07-05T11:59:44.264243+00:00"}