{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:IOT5WRLHG34YKOXLIAV72IVFB5","short_pith_number":"pith:IOT5WRLH","canonical_record":{"source":{"id":"1301.3347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2013-01-15T14:00:55Z","cross_cats_sorted":["cs.LG","math.OC","stat.ML"],"title_canon_sha256":"efb41bb6a8c42b7df7b7bee6b961b49b59b025cfdd08d9ad529ad160b8a81d10","abstract_canon_sha256":"b9d383efc7971caed15f6a7ba5a6a679b495b4bc8c5cb602e69ec073c925aa17"},"schema_version":"1.0"},"canonical_sha256":"43a7db456736f9853aeb402bfd22a50f6e7cfa922e7785e8c29850119eef05ee","source":{"kind":"arxiv","id":"1301.3347","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3347","created_at":"2026-05-18T03:36:25Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3347v1","created_at":"2026-05-18T03:36:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3347","created_at":"2026-05-18T03:36:25Z"},{"alias_kind":"pith_short_12","alias_value":"IOT5WRLHG34Y","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IOT5WRLHG34YKOXL","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IOT5WRLH","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:IOT5WRLHG34YKOXLIAV72IVFB5","target":"record","payload":{"canonical_record":{"source":{"id":"1301.3347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2013-01-15T14:00:55Z","cross_cats_sorted":["cs.LG","math.OC","stat.ML"],"title_canon_sha256":"efb41bb6a8c42b7df7b7bee6b961b49b59b025cfdd08d9ad529ad160b8a81d10","abstract_canon_sha256":"b9d383efc7971caed15f6a7ba5a6a679b495b4bc8c5cb602e69ec073c925aa17"},"schema_version":"1.0"},"canonical_sha256":"43a7db456736f9853aeb402bfd22a50f6e7cfa922e7785e8c29850119eef05ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:25.768865Z","signature_b64":"ig8RXLq6v7qfgMq9an3o76pzmUBZyN1xVLeLjfYxii2BJQLYIdJvJdl519FmVh9huRWeuc/8GErtcDprQj/eCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43a7db456736f9853aeb402bfd22a50f6e7cfa922e7785e8c29850119eef05ee","last_reissued_at":"2026-05-18T03:36:25.768341Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:25.768341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.3347","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:36:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wwRB7VC3j7Po4JeXo4CBEdN305yx2mB1+TZSu02pXgO78YwQK4U5s0INdO/P6V9XwXO0DZc+iTCtWqXdUQtECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:51:24.737402Z"},"content_sha256":"381112bad4ea1405e0c8f9de45102a32a2b866443ec5295fafb87e7de800fda3","schema_version":"1.0","event_id":"sha256:381112bad4ea1405e0c8f9de45102a32a2b866443ec5295fafb87e7de800fda3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:IOT5WRLHG34YKOXLIAV72IVFB5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-agent learning using Fictitious Play and Extended Kalman Filter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","stat.ML"],"primary_cat":"cs.MA","authors_text":"Michalis Smyrnakis","submitted_at":"2013-01-15T14:00:55Z","abstract_excerpt":"Decentralised optimisation tasks are important components of multi-agent systems. These tasks can be interpreted as n-player potential games: therefore game-theoretic learning algorithms can be used to solve decentralised optimisation tasks. Fictitious play is the canonical example of these algorithms. Nevertheless fictitious play implicitly assumes that players have stationary strategies. We present a novel variant of fictitious play where players predict their opponents' strategies using Extended Kalman filters and use their predictions to update their strategies.\n  We show that in 2 by 2 ga"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3347","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:36:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DK+66I5ypKaLM+XHwdkoBJehcpFFKhQJV1Hmca161LRZrJ0eGxLz8SNsmHXV9RAZQI9UjyYngt+phAOVMiSxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:51:24.737747Z"},"content_sha256":"aa25d7413d80c84a2af5c4778d9ba7dc00970ef746d418c903c8e1ca1ccfc325","schema_version":"1.0","event_id":"sha256:aa25d7413d80c84a2af5c4778d9ba7dc00970ef746d418c903c8e1ca1ccfc325"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IOT5WRLHG34YKOXLIAV72IVFB5/bundle.json","state_url":"https://pith.science/pith/IOT5WRLHG34YKOXLIAV72IVFB5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IOT5WRLHG34YKOXLIAV72IVFB5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T07:51:24Z","links":{"resolver":"https://pith.science/pith/IOT5WRLHG34YKOXLIAV72IVFB5","bundle":"https://pith.science/pith/IOT5WRLHG34YKOXLIAV72IVFB5/bundle.json","state":"https://pith.science/pith/IOT5WRLHG34YKOXLIAV72IVFB5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IOT5WRLHG34YKOXLIAV72IVFB5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IOT5WRLHG34YKOXLIAV72IVFB5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b9d383efc7971caed15f6a7ba5a6a679b495b4bc8c5cb602e69ec073c925aa17","cross_cats_sorted":["cs.LG","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2013-01-15T14:00:55Z","title_canon_sha256":"efb41bb6a8c42b7df7b7bee6b961b49b59b025cfdd08d9ad529ad160b8a81d10"},"schema_version":"1.0","source":{"id":"1301.3347","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3347","created_at":"2026-05-18T03:36:25Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3347v1","created_at":"2026-05-18T03:36:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3347","created_at":"2026-05-18T03:36:25Z"},{"alias_kind":"pith_short_12","alias_value":"IOT5WRLHG34Y","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IOT5WRLHG34YKOXL","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IOT5WRLH","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:aa25d7413d80c84a2af5c4778d9ba7dc00970ef746d418c903c8e1ca1ccfc325","target":"graph","created_at":"2026-05-18T03:36:25Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Decentralised optimisation tasks are important components of multi-agent systems. These tasks can be interpreted as n-player potential games: therefore game-theoretic learning algorithms can be used to solve decentralised optimisation tasks. Fictitious play is the canonical example of these algorithms. Nevertheless fictitious play implicitly assumes that players have stationary strategies. We present a novel variant of fictitious play where players predict their opponents' strategies using Extended Kalman filters and use their predictions to update their strategies.\n  We show that in 2 by 2 ga","authors_text":"Michalis Smyrnakis","cross_cats":["cs.LG","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2013-01-15T14:00:55Z","title":"Multi-agent learning using Fictitious Play and Extended Kalman Filter"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3347","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:381112bad4ea1405e0c8f9de45102a32a2b866443ec5295fafb87e7de800fda3","target":"record","created_at":"2026-05-18T03:36:25Z","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":"b9d383efc7971caed15f6a7ba5a6a679b495b4bc8c5cb602e69ec073c925aa17","cross_cats_sorted":["cs.LG","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2013-01-15T14:00:55Z","title_canon_sha256":"efb41bb6a8c42b7df7b7bee6b961b49b59b025cfdd08d9ad529ad160b8a81d10"},"schema_version":"1.0","source":{"id":"1301.3347","kind":"arxiv","version":1}},"canonical_sha256":"43a7db456736f9853aeb402bfd22a50f6e7cfa922e7785e8c29850119eef05ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43a7db456736f9853aeb402bfd22a50f6e7cfa922e7785e8c29850119eef05ee","first_computed_at":"2026-05-18T03:36:25.768341Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:25.768341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ig8RXLq6v7qfgMq9an3o76pzmUBZyN1xVLeLjfYxii2BJQLYIdJvJdl519FmVh9huRWeuc/8GErtcDprQj/eCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:25.768865Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.3347","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:381112bad4ea1405e0c8f9de45102a32a2b866443ec5295fafb87e7de800fda3","sha256:aa25d7413d80c84a2af5c4778d9ba7dc00970ef746d418c903c8e1ca1ccfc325"],"state_sha256":"7d5b3488547c485ce130d23ee7e133cc09e3249b45bf3f3de21f721f4bdf82c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bWa+1M6KlIwAfaaXuSHxGAIe83Sqp5kg4XzZ9+6M5CzmBjuF5EIG7NuwiyeWSt7DdG9mP2Wg6lxXEAe/MlXxDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T07:51:24.739600Z","bundle_sha256":"3963c3a96adbe331a8b6c455f5fe91aee8a83929a24a464f0ef5b7e66b5478db"}}