{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5CUO6H7LFKL62P3AMHIYQGDYCM","short_pith_number":"pith:5CUO6H7L","schema_version":"1.0","canonical_sha256":"e8a8ef1feb2a97ed3f6061d1881878130b29c99cc591c2a842bce2602188daaf","source":{"kind":"arxiv","id":"1609.05559","version":1},"attestation_state":"computed","paper":{"title":"Opponent Modeling in Deep Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hal Daum\\'e III, He He, Jordan Boyd-Graber, Kevin Kwok","submitted_at":"2016-09-18T22:06:36Z","abstract_excerpt":"Opponent modeling is necessary in multi-agent settings where secondary agents with competing goals also adapt their strategies, yet it remains challenging because strategies interact with each other and change. Most previous work focuses on developing probabilistic models or parameterized strategies for specific applications. Inspired by the recent success of deep reinforcement learning, we present neural-based models that jointly learn a policy and the behavior of opponents. Instead of explicitly predicting the opponent's action, we encode observation of the opponents into a deep Q-Network (D"},"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":"1609.05559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-18T22:06:36Z","cross_cats_sorted":[],"title_canon_sha256":"7046f44b3c37f098a86b351adca3a36a5c3323e61e71333d01495fb92f4ae9ca","abstract_canon_sha256":"741e6c1b4eaf8f637a7f3fbee6bc10ddf828dd2be9bb6ff640ed50b72bfd91cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:26.055968Z","signature_b64":"rLra2u5S1GuSBThTO8FuywBHo6jP5LOGYEVe/52CKUYMGRyj0c4y21BaUQr6Old3+gWcPbb1eOQBLnr9kUcZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8a8ef1feb2a97ed3f6061d1881878130b29c99cc591c2a842bce2602188daaf","last_reissued_at":"2026-05-18T01:04:26.055157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:26.055157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Opponent Modeling in Deep Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hal Daum\\'e III, He He, Jordan Boyd-Graber, Kevin Kwok","submitted_at":"2016-09-18T22:06:36Z","abstract_excerpt":"Opponent modeling is necessary in multi-agent settings where secondary agents with competing goals also adapt their strategies, yet it remains challenging because strategies interact with each other and change. Most previous work focuses on developing probabilistic models or parameterized strategies for specific applications. Inspired by the recent success of deep reinforcement learning, we present neural-based models that jointly learn a policy and the behavior of opponents. Instead of explicitly predicting the opponent's action, we encode observation of the opponents into a deep Q-Network (D"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05559","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":"1609.05559","created_at":"2026-05-18T01:04:26.055302+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.05559v1","created_at":"2026-05-18T01:04:26.055302+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05559","created_at":"2026-05-18T01:04:26.055302+00:00"},{"alias_kind":"pith_short_12","alias_value":"5CUO6H7LFKL6","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5CUO6H7LFKL62P3A","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5CUO6H7L","created_at":"2026-05-18T12:30:01.593930+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/5CUO6H7LFKL62P3AMHIYQGDYCM","json":"https://pith.science/pith/5CUO6H7LFKL62P3AMHIYQGDYCM.json","graph_json":"https://pith.science/api/pith-number/5CUO6H7LFKL62P3AMHIYQGDYCM/graph.json","events_json":"https://pith.science/api/pith-number/5CUO6H7LFKL62P3AMHIYQGDYCM/events.json","paper":"https://pith.science/paper/5CUO6H7L"},"agent_actions":{"view_html":"https://pith.science/pith/5CUO6H7LFKL62P3AMHIYQGDYCM","download_json":"https://pith.science/pith/5CUO6H7LFKL62P3AMHIYQGDYCM.json","view_paper":"https://pith.science/paper/5CUO6H7L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.05559&json=true","fetch_graph":"https://pith.science/api/pith-number/5CUO6H7LFKL62P3AMHIYQGDYCM/graph.json","fetch_events":"https://pith.science/api/pith-number/5CUO6H7LFKL62P3AMHIYQGDYCM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5CUO6H7LFKL62P3AMHIYQGDYCM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5CUO6H7LFKL62P3AMHIYQGDYCM/action/storage_attestation","attest_author":"https://pith.science/pith/5CUO6H7LFKL62P3AMHIYQGDYCM/action/author_attestation","sign_citation":"https://pith.science/pith/5CUO6H7LFKL62P3AMHIYQGDYCM/action/citation_signature","submit_replication":"https://pith.science/pith/5CUO6H7LFKL62P3AMHIYQGDYCM/action/replication_record"}},"created_at":"2026-05-18T01:04:26.055302+00:00","updated_at":"2026-05-18T01:04:26.055302+00:00"}