{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GSQI6BRJZLDP5UZ2BQCE33DZMY","short_pith_number":"pith:GSQI6BRJ","schema_version":"1.0","canonical_sha256":"34a08f0629cac6fed33a0c044dec79663b521d39a3d2ca6e151133fabbb8e8e2","source":{"kind":"arxiv","id":"1907.06995","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.06995","created_at":"2026-05-17T23:40:28.401517+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.06995v1","created_at":"2026-05-17T23:40:28.401517+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06995","created_at":"2026-05-17T23:40:28.401517+00:00"},{"alias_kind":"pith_short_12","alias_value":"GSQI6BRJZLDP","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GSQI6BRJZLDP5UZ2","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GSQI6BRJ","created_at":"2026-05-18T12:33:18.533446+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/GSQI6BRJZLDP5UZ2BQCE33DZMY","json":"https://pith.science/pith/GSQI6BRJZLDP5UZ2BQCE33DZMY.json","graph_json":"https://pith.science/api/pith-number/GSQI6BRJZLDP5UZ2BQCE33DZMY/graph.json","events_json":"https://pith.science/api/pith-number/GSQI6BRJZLDP5UZ2BQCE33DZMY/events.json","paper":"https://pith.science/paper/GSQI6BRJ"},"agent_actions":{"view_html":"https://pith.science/pith/GSQI6BRJZLDP5UZ2BQCE33DZMY","download_json":"https://pith.science/pith/GSQI6BRJZLDP5UZ2BQCE33DZMY.json","view_paper":"https://pith.science/paper/GSQI6BRJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.06995&json=true","fetch_graph":"https://pith.science/api/pith-number/GSQI6BRJZLDP5UZ2BQCE33DZMY/graph.json","fetch_events":"https://pith.science/api/pith-number/GSQI6BRJZLDP5UZ2BQCE33DZMY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GSQI6BRJZLDP5UZ2BQCE33DZMY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GSQI6BRJZLDP5UZ2BQCE33DZMY/action/storage_attestation","attest_author":"https://pith.science/pith/GSQI6BRJZLDP5UZ2BQCE33DZMY/action/author_attestation","sign_citation":"https://pith.science/pith/GSQI6BRJZLDP5UZ2BQCE33DZMY/action/citation_signature","submit_replication":"https://pith.science/pith/GSQI6BRJZLDP5UZ2BQCE33DZMY/action/replication_record"}},"created_at":"2026-05-17T23:40:28.401517+00:00","updated_at":"2026-05-17T23:40:28.401517+00:00"}