{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:FNBD54Y3WJCXSIGYZRZ2JKJYCI","short_pith_number":"pith:FNBD54Y3","canonical_record":{"source":{"id":"2502.00558","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2025-02-01T21:04:32Z","cross_cats_sorted":[],"title_canon_sha256":"faa2c0c3e083cd55bdf78b00d1dd6eb5a317e7bba5634deeab4db2d72be34cd6","abstract_canon_sha256":"8343a5c8672c28957a2402f03a52233517f8fcab1d3b03efa70a0895ff0cd84c"},"schema_version":"1.0"},"canonical_sha256":"2b423ef31bb2457920d8cc73a4a93812363ad1022414aa4aa03fe8b16fa5ec2c","source":{"kind":"arxiv","id":"2502.00558","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.00558","created_at":"2026-05-20T02:05:32Z"},{"alias_kind":"arxiv_version","alias_value":"2502.00558v2","created_at":"2026-05-20T02:05:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.00558","created_at":"2026-05-20T02:05:32Z"},{"alias_kind":"pith_short_12","alias_value":"FNBD54Y3WJCX","created_at":"2026-05-20T02:05:32Z"},{"alias_kind":"pith_short_16","alias_value":"FNBD54Y3WJCXSIGY","created_at":"2026-05-20T02:05:32Z"},{"alias_kind":"pith_short_8","alias_value":"FNBD54Y3","created_at":"2026-05-20T02:05:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:FNBD54Y3WJCXSIGYZRZ2JKJYCI","target":"record","payload":{"canonical_record":{"source":{"id":"2502.00558","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2025-02-01T21:04:32Z","cross_cats_sorted":[],"title_canon_sha256":"faa2c0c3e083cd55bdf78b00d1dd6eb5a317e7bba5634deeab4db2d72be34cd6","abstract_canon_sha256":"8343a5c8672c28957a2402f03a52233517f8fcab1d3b03efa70a0895ff0cd84c"},"schema_version":"1.0"},"canonical_sha256":"2b423ef31bb2457920d8cc73a4a93812363ad1022414aa4aa03fe8b16fa5ec2c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T02:05:32.761382Z","signature_b64":"vS3dLUmOjypoQg/3yChcQIzpUqqOk34mm55SXclvvDyygybgkX/F2kJHRUTEhi8cFoH3ntr/GkvyMo9FVFYHAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b423ef31bb2457920d8cc73a4a93812363ad1022414aa4aa03fe8b16fa5ec2c","last_reissued_at":"2026-05-20T02:05:32.760771Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T02:05:32.760771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.00558","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-20T02:05:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pH07A/0dEVTwYWiur+H/lsarxbXObvXzoqn1QwcGvvzzSD+GJy8iQ24GL5QhVxl3WuY8VLUy9xGE3JzcCl9gBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T12:43:33.001850Z"},"content_sha256":"13df32cc810edd09f920d77cf44928cc1fa70d6c22356e572ae3c6e2536d4885","schema_version":"1.0","event_id":"sha256:13df32cc810edd09f920d77cf44928cc1fa70d6c22356e572ae3c6e2536d4885"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:FNBD54Y3WJCXSIGYZRZ2JKJYCI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asynchronous Cooperative Multi-Agent Reinforcement Learning with Limited Communication","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Hamsa Balakrishnan, Jasmine Jerry Aloor, Siddharth Nayak, Sydney Dolan","submitted_at":"2025-02-01T21:04:32Z","abstract_excerpt":"We consider the problem setting in which multiple autonomous agents must cooperatively navigate and perform tasks in an unknown, communication-constrained environment. Traditional multi-agent reinforcement learning (MARL) approaches assume synchronous communications and perform poorly in such environments. We propose AsynCoMARL, an asynchronous MARL approach that uses graph transformers to learn communication protocols from dynamic graphs. AsynCoMARL can accommodate infrequent and asynchronous communications between agents, with edges of the graph only forming when agents communicate with each"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.00558","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.00558/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-20T02:05:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aUjdycItc+cH/ujsspt2DkTBVIr+qlv0UWxakRPOJYzJpzEnsw8gNkVmmRyw9pg4dblCi0zOms8wsKfA17h6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T12:43:33.002379Z"},"content_sha256":"260bbe6d10b37a257859ff57f23d97792dcdfa1b519eb96b4acbbfcb66a5e516","schema_version":"1.0","event_id":"sha256:260bbe6d10b37a257859ff57f23d97792dcdfa1b519eb96b4acbbfcb66a5e516"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FNBD54Y3WJCXSIGYZRZ2JKJYCI/bundle.json","state_url":"https://pith.science/pith/FNBD54Y3WJCXSIGYZRZ2JKJYCI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FNBD54Y3WJCXSIGYZRZ2JKJYCI/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-23T12:43:33Z","links":{"resolver":"https://pith.science/pith/FNBD54Y3WJCXSIGYZRZ2JKJYCI","bundle":"https://pith.science/pith/FNBD54Y3WJCXSIGYZRZ2JKJYCI/bundle.json","state":"https://pith.science/pith/FNBD54Y3WJCXSIGYZRZ2JKJYCI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FNBD54Y3WJCXSIGYZRZ2JKJYCI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FNBD54Y3WJCXSIGYZRZ2JKJYCI","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":"8343a5c8672c28957a2402f03a52233517f8fcab1d3b03efa70a0895ff0cd84c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2025-02-01T21:04:32Z","title_canon_sha256":"faa2c0c3e083cd55bdf78b00d1dd6eb5a317e7bba5634deeab4db2d72be34cd6"},"schema_version":"1.0","source":{"id":"2502.00558","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.00558","created_at":"2026-05-20T02:05:32Z"},{"alias_kind":"arxiv_version","alias_value":"2502.00558v2","created_at":"2026-05-20T02:05:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.00558","created_at":"2026-05-20T02:05:32Z"},{"alias_kind":"pith_short_12","alias_value":"FNBD54Y3WJCX","created_at":"2026-05-20T02:05:32Z"},{"alias_kind":"pith_short_16","alias_value":"FNBD54Y3WJCXSIGY","created_at":"2026-05-20T02:05:32Z"},{"alias_kind":"pith_short_8","alias_value":"FNBD54Y3","created_at":"2026-05-20T02:05:32Z"}],"graph_snapshots":[{"event_id":"sha256:260bbe6d10b37a257859ff57f23d97792dcdfa1b519eb96b4acbbfcb66a5e516","target":"graph","created_at":"2026-05-20T02:05:32Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.00558/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem setting in which multiple autonomous agents must cooperatively navigate and perform tasks in an unknown, communication-constrained environment. Traditional multi-agent reinforcement learning (MARL) approaches assume synchronous communications and perform poorly in such environments. We propose AsynCoMARL, an asynchronous MARL approach that uses graph transformers to learn communication protocols from dynamic graphs. AsynCoMARL can accommodate infrequent and asynchronous communications between agents, with edges of the graph only forming when agents communicate with each","authors_text":"Hamsa Balakrishnan, Jasmine Jerry Aloor, Siddharth Nayak, Sydney Dolan","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2025-02-01T21:04:32Z","title":"Asynchronous Cooperative Multi-Agent Reinforcement Learning with Limited Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.00558","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:13df32cc810edd09f920d77cf44928cc1fa70d6c22356e572ae3c6e2536d4885","target":"record","created_at":"2026-05-20T02:05:32Z","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":"8343a5c8672c28957a2402f03a52233517f8fcab1d3b03efa70a0895ff0cd84c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2025-02-01T21:04:32Z","title_canon_sha256":"faa2c0c3e083cd55bdf78b00d1dd6eb5a317e7bba5634deeab4db2d72be34cd6"},"schema_version":"1.0","source":{"id":"2502.00558","kind":"arxiv","version":2}},"canonical_sha256":"2b423ef31bb2457920d8cc73a4a93812363ad1022414aa4aa03fe8b16fa5ec2c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b423ef31bb2457920d8cc73a4a93812363ad1022414aa4aa03fe8b16fa5ec2c","first_computed_at":"2026-05-20T02:05:32.760771Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T02:05:32.760771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vS3dLUmOjypoQg/3yChcQIzpUqqOk34mm55SXclvvDyygybgkX/F2kJHRUTEhi8cFoH3ntr/GkvyMo9FVFYHAg==","signature_status":"signed_v1","signed_at":"2026-05-20T02:05:32.761382Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.00558","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13df32cc810edd09f920d77cf44928cc1fa70d6c22356e572ae3c6e2536d4885","sha256:260bbe6d10b37a257859ff57f23d97792dcdfa1b519eb96b4acbbfcb66a5e516"],"state_sha256":"4d6b13f2b6a24fa9fbea3ffdd97fc93f8dd0f4d7d3e25a77f0b175a14e5ecc59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4UzVuyaZbqx/r3IDQnJZQECkl+3l23tH62CasFRliMbMV9yH2DatiB7IIezSksZE9L68B5FIY6sTJLDCMcXzCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T12:43:33.005853Z","bundle_sha256":"7d1770d499d12d49adac8caff56e72fe34282545540336b60d37489f0176e4c8"}}