{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GSQI6BRJZLDP5UZ2BQCE33DZMY","short_pith_number":"pith:GSQI6BRJ","canonical_record":{"source":{"id":"1907.06995","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-07-15T09:30:27Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"942ff1fdddd4d7e617d42de434af7b84e83a3e93540f8e806144acf11b8c803a","abstract_canon_sha256":"9e9161524699581b8726c696e3815838fa413cb3d582903db6e63d363c9b4903"},"schema_version":"1.0"},"canonical_sha256":"34a08f0629cac6fed33a0c044dec79663b521d39a3d2ca6e151133fabbb8e8e2","source":{"kind":"arxiv","id":"1907.06995","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.06995","created_at":"2026-05-17T23:40:28Z"},{"alias_kind":"arxiv_version","alias_value":"1907.06995v1","created_at":"2026-05-17T23:40:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06995","created_at":"2026-05-17T23:40:28Z"},{"alias_kind":"pith_short_12","alias_value":"GSQI6BRJZLDP","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GSQI6BRJZLDP5UZ2","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GSQI6BRJ","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GSQI6BRJZLDP5UZ2BQCE33DZMY","target":"record","payload":{"canonical_record":{"source":{"id":"1907.06995","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-07-15T09:30:27Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"942ff1fdddd4d7e617d42de434af7b84e83a3e93540f8e806144acf11b8c803a","abstract_canon_sha256":"9e9161524699581b8726c696e3815838fa413cb3d582903db6e63d363c9b4903"},"schema_version":"1.0"},"canonical_sha256":"34a08f0629cac6fed33a0c044dec79663b521d39a3d2ca6e151133fabbb8e8e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:28.402019Z","signature_b64":"3ujXTC7xLczPfXUE0IGBqjyDvLkwPEN+rV+ft+xjWpxcS3wCChoHs1o+LgjlqJwMS0xFOBqbX9awzbyquRr1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34a08f0629cac6fed33a0c044dec79663b521d39a3d2ca6e151133fabbb8e8e2","last_reissued_at":"2026-05-17T23:40:28.401444Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:28.401444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.06995","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-17T23:40:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jq5uDFMiu9Gr9Smn2OZSfjwUI52bLSElBtZX29WVfT3wW1IFzq0/Y0GJlXzAZaYwDExyd2koklnaPz0m6xzeAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:48:43.391230Z"},"content_sha256":"ae841dcbfbc459ff3c0920a85de45d40c56b7406663b043d1f7252c3c98cb210","schema_version":"1.0","event_id":"sha256:ae841dcbfbc459ff3c0920a85de45d40c56b7406663b043d1f7252c3c98cb210"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GSQI6BRJZLDP5UZ2BQCE33DZMY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Convergence and Optimality of Best-Response Learning with Policy Types in Multiagent Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.AI","authors_text":"Stefano V. Albrecht, Subramanian Ramamoorthy","submitted_at":"2019-07-15T09:30:27Z","abstract_excerpt":"While many multiagent algorithms are designed for homogeneous systems (i.e. all agents are identical), there are important applications which require an agent to coordinate its actions without knowing a priori how the other agents behave. One method to make this problem feasible is to assume that the other agents draw their latent policy (or type) from a specific set, and that a domain expert could provide a specification of this set, albeit only a partially correct one. Algorithms have been proposed by several researchers to compute posterior beliefs over such policy libraries, which can then"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06995","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-17T23:40:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7+1qkHP/GT8jqMH0bszUD5M9mBz+WzuXKIhRGIzBJXHLxDffKkib524cAnYsrzIZoYK9hzyNNcVtRC1dyX+GCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:48:43.391813Z"},"content_sha256":"cbe2dfef77ea22a972e5a770001571607ff4a0548dae4b9b06b7859dc122673b","schema_version":"1.0","event_id":"sha256:cbe2dfef77ea22a972e5a770001571607ff4a0548dae4b9b06b7859dc122673b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GSQI6BRJZLDP5UZ2BQCE33DZMY/bundle.json","state_url":"https://pith.science/pith/GSQI6BRJZLDP5UZ2BQCE33DZMY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GSQI6BRJZLDP5UZ2BQCE33DZMY/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-05-25T21:48:43Z","links":{"resolver":"https://pith.science/pith/GSQI6BRJZLDP5UZ2BQCE33DZMY","bundle":"https://pith.science/pith/GSQI6BRJZLDP5UZ2BQCE33DZMY/bundle.json","state":"https://pith.science/pith/GSQI6BRJZLDP5UZ2BQCE33DZMY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GSQI6BRJZLDP5UZ2BQCE33DZMY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GSQI6BRJZLDP5UZ2BQCE33DZMY","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":"9e9161524699581b8726c696e3815838fa413cb3d582903db6e63d363c9b4903","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-07-15T09:30:27Z","title_canon_sha256":"942ff1fdddd4d7e617d42de434af7b84e83a3e93540f8e806144acf11b8c803a"},"schema_version":"1.0","source":{"id":"1907.06995","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.06995","created_at":"2026-05-17T23:40:28Z"},{"alias_kind":"arxiv_version","alias_value":"1907.06995v1","created_at":"2026-05-17T23:40:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06995","created_at":"2026-05-17T23:40:28Z"},{"alias_kind":"pith_short_12","alias_value":"GSQI6BRJZLDP","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GSQI6BRJZLDP5UZ2","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GSQI6BRJ","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:cbe2dfef77ea22a972e5a770001571607ff4a0548dae4b9b06b7859dc122673b","target":"graph","created_at":"2026-05-17T23:40:28Z","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":"While many multiagent algorithms are designed for homogeneous systems (i.e. all agents are identical), there are important applications which require an agent to coordinate its actions without knowing a priori how the other agents behave. One method to make this problem feasible is to assume that the other agents draw their latent policy (or type) from a specific set, and that a domain expert could provide a specification of this set, albeit only a partially correct one. Algorithms have been proposed by several researchers to compute posterior beliefs over such policy libraries, which can then","authors_text":"Stefano V. Albrecht, Subramanian Ramamoorthy","cross_cats":["cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-07-15T09:30:27Z","title":"On Convergence and Optimality of Best-Response Learning with Policy Types in Multiagent Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06995","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:ae841dcbfbc459ff3c0920a85de45d40c56b7406663b043d1f7252c3c98cb210","target":"record","created_at":"2026-05-17T23:40:28Z","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":"9e9161524699581b8726c696e3815838fa413cb3d582903db6e63d363c9b4903","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-07-15T09:30:27Z","title_canon_sha256":"942ff1fdddd4d7e617d42de434af7b84e83a3e93540f8e806144acf11b8c803a"},"schema_version":"1.0","source":{"id":"1907.06995","kind":"arxiv","version":1}},"canonical_sha256":"34a08f0629cac6fed33a0c044dec79663b521d39a3d2ca6e151133fabbb8e8e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34a08f0629cac6fed33a0c044dec79663b521d39a3d2ca6e151133fabbb8e8e2","first_computed_at":"2026-05-17T23:40:28.401444Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:28.401444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3ujXTC7xLczPfXUE0IGBqjyDvLkwPEN+rV+ft+xjWpxcS3wCChoHs1o+LgjlqJwMS0xFOBqbX9awzbyquRr1Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:28.402019Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.06995","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae841dcbfbc459ff3c0920a85de45d40c56b7406663b043d1f7252c3c98cb210","sha256:cbe2dfef77ea22a972e5a770001571607ff4a0548dae4b9b06b7859dc122673b"],"state_sha256":"3df6adeadcc85e352374b10b6a9371d164897ced86a572f82602d5629db669ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JYErV5kImYHoZabee+Bx2famTOdvURtj7KYC8n8acHtxE2UroGRqYRcoJsUOUZ/MWxMG9yxoKolpmva+I5TjCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:48:43.395427Z","bundle_sha256":"eef4e203839ce8daad05f32f6f62efe063f792ff591f8e7e058d5f4ecf92209a"}}