{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FPHIWNAHDQTRC6E3NQOU24ACJM","short_pith_number":"pith:FPHIWNAH","canonical_record":{"source":{"id":"1811.12556","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-30T00:36:34Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"3594b7ae2d3832f1dff0db56a6c7814f742fd1aa8ab4bdb35428dde8295872c4","abstract_canon_sha256":"c03ecf91a3a4ff52238d565dce642f307a8a0b9cebc23e5f84f36057f1867782"},"schema_version":"1.0"},"canonical_sha256":"2bce8b34071c2711789b6c1d4d70024b13c703d47fd7f21f21f6c9ad9beec3cf","source":{"kind":"arxiv","id":"1811.12556","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.12556","created_at":"2026-05-17T23:52:15Z"},{"alias_kind":"arxiv_version","alias_value":"1811.12556v2","created_at":"2026-05-17T23:52:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12556","created_at":"2026-05-17T23:52:15Z"},{"alias_kind":"pith_short_12","alias_value":"FPHIWNAHDQTR","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FPHIWNAHDQTRC6E3","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FPHIWNAH","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FPHIWNAHDQTRC6E3NQOU24ACJM","target":"record","payload":{"canonical_record":{"source":{"id":"1811.12556","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-30T00:36:34Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"3594b7ae2d3832f1dff0db56a6c7814f742fd1aa8ab4bdb35428dde8295872c4","abstract_canon_sha256":"c03ecf91a3a4ff52238d565dce642f307a8a0b9cebc23e5f84f36057f1867782"},"schema_version":"1.0"},"canonical_sha256":"2bce8b34071c2711789b6c1d4d70024b13c703d47fd7f21f21f6c9ad9beec3cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:15.166621Z","signature_b64":"LzmV1zuqTZEWhfduBemGdWx7V1VuxMriOTb+nL9qtfjvZ9uOLdTpxrKRRUIjw5J8RSKnBQa3LDhvu0WKJngOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bce8b34071c2711789b6c1d4d70024b13c703d47fd7f21f21f6c9ad9beec3cf","last_reissued_at":"2026-05-17T23:52:15.165955Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:15.165955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.12556","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:52:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MNh/KFNiLekH+GkPmFd/qeZ9JBTZ6WW02nxhea44n7NvYF1ELrjfXrEVQCVMd7/uyd3Ih5lnNvAL1dfB1QRWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:40:37.277695Z"},"content_sha256":"4c57e0b3e6965c43d4eaf387c2f1d8cfdf718b6ad06556306f5ef8798a621b40","schema_version":"1.0","event_id":"sha256:4c57e0b3e6965c43d4eaf387c2f1d8cfdf718b6ad06556306f5ef8798a621b40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FPHIWNAHDQTRC6E3NQOU24ACJM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How to Organize your Deep Reinforcement Learning Agents: The Importance of Communication Topology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Abhimanyu Dubey, Alex `Sandy' Pentland, Dan Calacci, Dhaval Adjodah, Esteban Moro, Peter Krafft","submitted_at":"2018-11-30T00:36:34Z","abstract_excerpt":"In this empirical paper, we investigate how learning agents can be arranged in more efficient communication topologies for improved learning. This is an important problem because a common technique to improve speed and robustness of learning in deep reinforcement learning and many other machine learning algorithms is to run multiple learning agents in parallel. The standard communication architecture typically involves all agents intermittently communicating with each other (fully connected topology) or with a centralized server (star topology). Unfortunately, optimizing the topology of commun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12556","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:52:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZH5eWO51+8nR+QjvVjuHtS8XrkZJcBfQ0MXdkmteThcMBcCl04CM4PcK6U/NS64M04usc2UeI6Ndw4jny1yPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:40:37.278043Z"},"content_sha256":"5b433f296a79ed4f3c4f0306e5ece3d49a09992c5f5e7b9e3e227283b6a264d4","schema_version":"1.0","event_id":"sha256:5b433f296a79ed4f3c4f0306e5ece3d49a09992c5f5e7b9e3e227283b6a264d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FPHIWNAHDQTRC6E3NQOU24ACJM/bundle.json","state_url":"https://pith.science/pith/FPHIWNAHDQTRC6E3NQOU24ACJM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FPHIWNAHDQTRC6E3NQOU24ACJM/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-03T18:40:37Z","links":{"resolver":"https://pith.science/pith/FPHIWNAHDQTRC6E3NQOU24ACJM","bundle":"https://pith.science/pith/FPHIWNAHDQTRC6E3NQOU24ACJM/bundle.json","state":"https://pith.science/pith/FPHIWNAHDQTRC6E3NQOU24ACJM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FPHIWNAHDQTRC6E3NQOU24ACJM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FPHIWNAHDQTRC6E3NQOU24ACJM","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":"c03ecf91a3a4ff52238d565dce642f307a8a0b9cebc23e5f84f36057f1867782","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-30T00:36:34Z","title_canon_sha256":"3594b7ae2d3832f1dff0db56a6c7814f742fd1aa8ab4bdb35428dde8295872c4"},"schema_version":"1.0","source":{"id":"1811.12556","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.12556","created_at":"2026-05-17T23:52:15Z"},{"alias_kind":"arxiv_version","alias_value":"1811.12556v2","created_at":"2026-05-17T23:52:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12556","created_at":"2026-05-17T23:52:15Z"},{"alias_kind":"pith_short_12","alias_value":"FPHIWNAHDQTR","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FPHIWNAHDQTRC6E3","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FPHIWNAH","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:5b433f296a79ed4f3c4f0306e5ece3d49a09992c5f5e7b9e3e227283b6a264d4","target":"graph","created_at":"2026-05-17T23:52:15Z","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":"In this empirical paper, we investigate how learning agents can be arranged in more efficient communication topologies for improved learning. This is an important problem because a common technique to improve speed and robustness of learning in deep reinforcement learning and many other machine learning algorithms is to run multiple learning agents in parallel. The standard communication architecture typically involves all agents intermittently communicating with each other (fully connected topology) or with a centralized server (star topology). Unfortunately, optimizing the topology of commun","authors_text":"Abhimanyu Dubey, Alex `Sandy' Pentland, Dan Calacci, Dhaval Adjodah, Esteban Moro, Peter Krafft","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-30T00:36:34Z","title":"How to Organize your Deep Reinforcement Learning Agents: The Importance of Communication Topology"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12556","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:4c57e0b3e6965c43d4eaf387c2f1d8cfdf718b6ad06556306f5ef8798a621b40","target":"record","created_at":"2026-05-17T23:52:15Z","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":"c03ecf91a3a4ff52238d565dce642f307a8a0b9cebc23e5f84f36057f1867782","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-30T00:36:34Z","title_canon_sha256":"3594b7ae2d3832f1dff0db56a6c7814f742fd1aa8ab4bdb35428dde8295872c4"},"schema_version":"1.0","source":{"id":"1811.12556","kind":"arxiv","version":2}},"canonical_sha256":"2bce8b34071c2711789b6c1d4d70024b13c703d47fd7f21f21f6c9ad9beec3cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2bce8b34071c2711789b6c1d4d70024b13c703d47fd7f21f21f6c9ad9beec3cf","first_computed_at":"2026-05-17T23:52:15.165955Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:15.165955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LzmV1zuqTZEWhfduBemGdWx7V1VuxMriOTb+nL9qtfjvZ9uOLdTpxrKRRUIjw5J8RSKnBQa3LDhvu0WKJngOBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:15.166621Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.12556","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c57e0b3e6965c43d4eaf387c2f1d8cfdf718b6ad06556306f5ef8798a621b40","sha256:5b433f296a79ed4f3c4f0306e5ece3d49a09992c5f5e7b9e3e227283b6a264d4"],"state_sha256":"d2c93c7427bafa74a4aaad4564252fb31c9b4f132e9e1d5881c338154a8a61f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ln9ZzYUOzLkX/gc1NzJurSMnNb/W49uGNPvZbDvpXXt1xfVEqVBt1t/pPsjQr5dufEJGGbnnTnsi0xb6NBU6Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T18:40:37.280872Z","bundle_sha256":"9ccec77988d47174261316e252d723ffeb4601651ff46069d9ce8e21b59da300"}}