{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KVXKNW3RFXY3I43T4HT3BNUK4D","short_pith_number":"pith:KVXKNW3R","canonical_record":{"source":{"id":"1808.02093","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-06T20:10:27Z","cross_cats_sorted":["cs.IT","cs.LG","cs.MA","math.IT","stat.ML"],"title_canon_sha256":"2991d7590d496aeb38b6456a395eebe73da52fba396710f41f04259898634aa5","abstract_canon_sha256":"bc606dfc524682c94e4911a4b310ed6ad83b93fe873713cc522556470a1fd52b"},"schema_version":"1.0"},"canonical_sha256":"556ea6db712df1b47373e1e7b0b68ae0d8464e0b8ac4f8f013771f1ea1466a29","source":{"kind":"arxiv","id":"1808.02093","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02093","created_at":"2026-05-17T23:57:07Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02093v2","created_at":"2026-05-17T23:57:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02093","created_at":"2026-05-17T23:57:07Z"},{"alias_kind":"pith_short_12","alias_value":"KVXKNW3RFXY3","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KVXKNW3RFXY3I43T","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KVXKNW3R","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KVXKNW3RFXY3I43T4HT3BNUK4D","target":"record","payload":{"canonical_record":{"source":{"id":"1808.02093","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-06T20:10:27Z","cross_cats_sorted":["cs.IT","cs.LG","cs.MA","math.IT","stat.ML"],"title_canon_sha256":"2991d7590d496aeb38b6456a395eebe73da52fba396710f41f04259898634aa5","abstract_canon_sha256":"bc606dfc524682c94e4911a4b310ed6ad83b93fe873713cc522556470a1fd52b"},"schema_version":"1.0"},"canonical_sha256":"556ea6db712df1b47373e1e7b0b68ae0d8464e0b8ac4f8f013771f1ea1466a29","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:07.429793Z","signature_b64":"pBCqt4yDazu6THWJjqN1tV5fnCvMWWNNUywV42hDJi+MuPgLAHsr7sHJueteeS8idmhOW/XNyz9aPYTA8RQ+Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"556ea6db712df1b47373e1e7b0b68ae0d8464e0b8ac4f8f013771f1ea1466a29","last_reissued_at":"2026-05-17T23:57:07.429396Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:07.429396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.02093","source_version":2,"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:57:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mJgAlRFsQBGlCV/Y4JgQc1fl67+jr9etPtLiWv/X+ncGWQ418IBgw26v/nsvqoziqFkP5rH8FskU7xKMSEEOBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:45:28.180252Z"},"content_sha256":"a052e23342356fc570adf38d73274c572b31b88d089d14b9347ccb480fc3d442","schema_version":"1.0","event_id":"sha256:a052e23342356fc570adf38d73274c572b31b88d089d14b9347ccb480fc3d442"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KVXKNW3RFXY3I43T4HT3BNUK4D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning to Share and Hide Intentions using Information Regularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","cs.MA","math.IT","stat.ML"],"primary_cat":"cs.AI","authors_text":"David Schwab, DJ Strouse, Josh Tenenbaum, Matt Botvinick, Max Kleiman-Weiner","submitted_at":"2018-08-06T20:10:27Z","abstract_excerpt":"Learning to cooperate with friends and compete with foes is a key component of multi-agent reinforcement learning. Typically to do so, one requires access to either a model of or interaction with the other agent(s). Here we show how to learn effective strategies for cooperation and competition in an asymmetric information game with no such model or interaction. Our approach is to encourage an agent to reveal or hide their intentions using an information-theoretic regularizer. We consider both the mutual information between goal and action given state, as well as the mutual information between "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02093","kind":"arxiv","version":2},"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:57:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zXovT1CIps7DJD5AfFnJwpZi/puAKwPugJVh9L+3jbM9gDPMTwNNxa4+hkS2WdKxGlGTGQUeI48bvdwKWguzAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:45:28.180612Z"},"content_sha256":"b774ecae4392653b42e08680c1802854e4b883142c7f340f568885d98d328e08","schema_version":"1.0","event_id":"sha256:b774ecae4392653b42e08680c1802854e4b883142c7f340f568885d98d328e08"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KVXKNW3RFXY3I43T4HT3BNUK4D/bundle.json","state_url":"https://pith.science/pith/KVXKNW3RFXY3I43T4HT3BNUK4D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KVXKNW3RFXY3I43T4HT3BNUK4D/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-30T13:45:28Z","links":{"resolver":"https://pith.science/pith/KVXKNW3RFXY3I43T4HT3BNUK4D","bundle":"https://pith.science/pith/KVXKNW3RFXY3I43T4HT3BNUK4D/bundle.json","state":"https://pith.science/pith/KVXKNW3RFXY3I43T4HT3BNUK4D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KVXKNW3RFXY3I43T4HT3BNUK4D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KVXKNW3RFXY3I43T4HT3BNUK4D","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":"bc606dfc524682c94e4911a4b310ed6ad83b93fe873713cc522556470a1fd52b","cross_cats_sorted":["cs.IT","cs.LG","cs.MA","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-06T20:10:27Z","title_canon_sha256":"2991d7590d496aeb38b6456a395eebe73da52fba396710f41f04259898634aa5"},"schema_version":"1.0","source":{"id":"1808.02093","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02093","created_at":"2026-05-17T23:57:07Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02093v2","created_at":"2026-05-17T23:57:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02093","created_at":"2026-05-17T23:57:07Z"},{"alias_kind":"pith_short_12","alias_value":"KVXKNW3RFXY3","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KVXKNW3RFXY3I43T","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KVXKNW3R","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:b774ecae4392653b42e08680c1802854e4b883142c7f340f568885d98d328e08","target":"graph","created_at":"2026-05-17T23:57:07Z","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":"Learning to cooperate with friends and compete with foes is a key component of multi-agent reinforcement learning. Typically to do so, one requires access to either a model of or interaction with the other agent(s). Here we show how to learn effective strategies for cooperation and competition in an asymmetric information game with no such model or interaction. Our approach is to encourage an agent to reveal or hide their intentions using an information-theoretic regularizer. We consider both the mutual information between goal and action given state, as well as the mutual information between ","authors_text":"David Schwab, DJ Strouse, Josh Tenenbaum, Matt Botvinick, Max Kleiman-Weiner","cross_cats":["cs.IT","cs.LG","cs.MA","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-06T20:10:27Z","title":"Learning to Share and Hide Intentions using Information Regularization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02093","kind":"arxiv","version":2},"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:a052e23342356fc570adf38d73274c572b31b88d089d14b9347ccb480fc3d442","target":"record","created_at":"2026-05-17T23:57:07Z","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":"bc606dfc524682c94e4911a4b310ed6ad83b93fe873713cc522556470a1fd52b","cross_cats_sorted":["cs.IT","cs.LG","cs.MA","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-06T20:10:27Z","title_canon_sha256":"2991d7590d496aeb38b6456a395eebe73da52fba396710f41f04259898634aa5"},"schema_version":"1.0","source":{"id":"1808.02093","kind":"arxiv","version":2}},"canonical_sha256":"556ea6db712df1b47373e1e7b0b68ae0d8464e0b8ac4f8f013771f1ea1466a29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"556ea6db712df1b47373e1e7b0b68ae0d8464e0b8ac4f8f013771f1ea1466a29","first_computed_at":"2026-05-17T23:57:07.429396Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:07.429396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pBCqt4yDazu6THWJjqN1tV5fnCvMWWNNUywV42hDJi+MuPgLAHsr7sHJueteeS8idmhOW/XNyz9aPYTA8RQ+Dg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:07.429793Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.02093","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a052e23342356fc570adf38d73274c572b31b88d089d14b9347ccb480fc3d442","sha256:b774ecae4392653b42e08680c1802854e4b883142c7f340f568885d98d328e08"],"state_sha256":"568501d3901ad3f7421632550f342394c7c3e875778b2a81d9559cb3634d2bf6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kodqdksueu+dl7PsnYAQoEtwwzzO2ZZVhwVEkCtPLd5WkJH+v2QBQQzMuvwie4axqGr89yAFQKg1/HjY1v5MDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:45:28.182593Z","bundle_sha256":"240a6f2026e86936a79b17d306be3bddbcd57dbe7548bbc1990c41071d657598"}}