{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XRFZDJSXSBZU2USXRQDOQQQPXB","short_pith_number":"pith:XRFZDJSX","canonical_record":{"source":{"id":"1905.09951","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-23T22:07:10Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"bc15d51d6586eb55d7130e3772d9e8e8708c96744f07e5b959cc4966fb26f977","abstract_canon_sha256":"d26afa6c74220482ee5dacef949195e37fc5c61dacb81e61c4732a6e159bc188"},"schema_version":"1.0"},"canonical_sha256":"bc4b91a65790734d52578c06e8420fb87c359ba1698950d5169aa0bfe495299e","source":{"kind":"arxiv","id":"1905.09951","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09951","created_at":"2026-07-05T00:11:04Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09951v2","created_at":"2026-07-05T00:11:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09951","created_at":"2026-07-05T00:11:04Z"},{"alias_kind":"pith_short_12","alias_value":"XRFZDJSXSBZU","created_at":"2026-07-05T00:11:04Z"},{"alias_kind":"pith_short_16","alias_value":"XRFZDJSXSBZU2USX","created_at":"2026-07-05T00:11:04Z"},{"alias_kind":"pith_short_8","alias_value":"XRFZDJSX","created_at":"2026-07-05T00:11:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XRFZDJSXSBZU2USXRQDOQQQPXB","target":"record","payload":{"canonical_record":{"source":{"id":"1905.09951","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-23T22:07:10Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"bc15d51d6586eb55d7130e3772d9e8e8708c96744f07e5b959cc4966fb26f977","abstract_canon_sha256":"d26afa6c74220482ee5dacef949195e37fc5c61dacb81e61c4732a6e159bc188"},"schema_version":"1.0"},"canonical_sha256":"bc4b91a65790734d52578c06e8420fb87c359ba1698950d5169aa0bfe495299e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:11:04.333617Z","signature_b64":"XgcC3nFRyVIXt54QlDBXUANGtlfdrpAGFseCfVjCM5VzI6WPTHPaEcDHBOOZRbJ/WM3uVGGxrTJz+APbK7q3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc4b91a65790734d52578c06e8420fb87c359ba1698950d5169aa0bfe495299e","last_reissued_at":"2026-07-05T00:11:04.333226Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:11:04.333226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.09951","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-07-05T00:11:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tr4KtbRxHUo15nAC6S4ZgtmrEIeuIPIKH+uOGLWjlJkgjiZyfsXvm1kaIKqVPbgv0uQfT70XSvZQoRLNnb7MAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T13:56:41.761930Z"},"content_sha256":"b6e8aaacba233acdd06b01a45a58e3806da0673cf21f8e15d4fec1fce9435e98","schema_version":"1.0","event_id":"sha256:b6e8aaacba233acdd06b01a45a58e3806da0673cf21f8e15d4fec1fce9435e98"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XRFZDJSXSBZU2USXRQDOQQQPXB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PAC Guarantees for Cooperative Multi-Agent Reinforcement Learning with Restricted Communication","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Or Raveh, Ron Meir","submitted_at":"2019-05-23T22:07:10Z","abstract_excerpt":"We develop model free PAC performance guarantees for multiple concurrent MDPs, extending recent works where a single learner interacts with multiple non-interacting agents in a noise free environment. Our framework allows noisy and resource limited communication between agents, and develops novel PAC guarantees in this extended setting. By allowing communication between the agents themselves, we suggest improved PAC-exploration algorithms that can overcome the communication noise and lead to improved sample complexity bounds. We provide a theoretically motivated algorithm that optimally combin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09951","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/1905.09951/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-07-05T00:11:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+nMrsCxi//1SF2Md5FSLrmqOAFPBZMTAzoDl8KdPUdXCTIsqTllfwUQ4zKqRRcPI0uRFlh3tXLSY5oOQLSJUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T13:56:41.762310Z"},"content_sha256":"1bb258e15b6cfe893427ca97b3636b8f47c997387743ae096048eccc6d6b54d5","schema_version":"1.0","event_id":"sha256:1bb258e15b6cfe893427ca97b3636b8f47c997387743ae096048eccc6d6b54d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XRFZDJSXSBZU2USXRQDOQQQPXB/bundle.json","state_url":"https://pith.science/pith/XRFZDJSXSBZU2USXRQDOQQQPXB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XRFZDJSXSBZU2USXRQDOQQQPXB/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-07-08T13:56:41Z","links":{"resolver":"https://pith.science/pith/XRFZDJSXSBZU2USXRQDOQQQPXB","bundle":"https://pith.science/pith/XRFZDJSXSBZU2USXRQDOQQQPXB/bundle.json","state":"https://pith.science/pith/XRFZDJSXSBZU2USXRQDOQQQPXB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XRFZDJSXSBZU2USXRQDOQQQPXB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XRFZDJSXSBZU2USXRQDOQQQPXB","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":"d26afa6c74220482ee5dacef949195e37fc5c61dacb81e61c4732a6e159bc188","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-23T22:07:10Z","title_canon_sha256":"bc15d51d6586eb55d7130e3772d9e8e8708c96744f07e5b959cc4966fb26f977"},"schema_version":"1.0","source":{"id":"1905.09951","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09951","created_at":"2026-07-05T00:11:04Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09951v2","created_at":"2026-07-05T00:11:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09951","created_at":"2026-07-05T00:11:04Z"},{"alias_kind":"pith_short_12","alias_value":"XRFZDJSXSBZU","created_at":"2026-07-05T00:11:04Z"},{"alias_kind":"pith_short_16","alias_value":"XRFZDJSXSBZU2USX","created_at":"2026-07-05T00:11:04Z"},{"alias_kind":"pith_short_8","alias_value":"XRFZDJSX","created_at":"2026-07-05T00:11:04Z"}],"graph_snapshots":[{"event_id":"sha256:1bb258e15b6cfe893427ca97b3636b8f47c997387743ae096048eccc6d6b54d5","target":"graph","created_at":"2026-07-05T00:11:04Z","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/1905.09951/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We develop model free PAC performance guarantees for multiple concurrent MDPs, extending recent works where a single learner interacts with multiple non-interacting agents in a noise free environment. Our framework allows noisy and resource limited communication between agents, and develops novel PAC guarantees in this extended setting. By allowing communication between the agents themselves, we suggest improved PAC-exploration algorithms that can overcome the communication noise and lead to improved sample complexity bounds. We provide a theoretically motivated algorithm that optimally combin","authors_text":"Or Raveh, Ron Meir","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-23T22:07:10Z","title":"PAC Guarantees for Cooperative Multi-Agent Reinforcement Learning with Restricted Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09951","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:b6e8aaacba233acdd06b01a45a58e3806da0673cf21f8e15d4fec1fce9435e98","target":"record","created_at":"2026-07-05T00:11:04Z","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":"d26afa6c74220482ee5dacef949195e37fc5c61dacb81e61c4732a6e159bc188","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-23T22:07:10Z","title_canon_sha256":"bc15d51d6586eb55d7130e3772d9e8e8708c96744f07e5b959cc4966fb26f977"},"schema_version":"1.0","source":{"id":"1905.09951","kind":"arxiv","version":2}},"canonical_sha256":"bc4b91a65790734d52578c06e8420fb87c359ba1698950d5169aa0bfe495299e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc4b91a65790734d52578c06e8420fb87c359ba1698950d5169aa0bfe495299e","first_computed_at":"2026-07-05T00:11:04.333226Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:11:04.333226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XgcC3nFRyVIXt54QlDBXUANGtlfdrpAGFseCfVjCM5VzI6WPTHPaEcDHBOOZRbJ/WM3uVGGxrTJz+APbK7q3CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:11:04.333617Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.09951","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6e8aaacba233acdd06b01a45a58e3806da0673cf21f8e15d4fec1fce9435e98","sha256:1bb258e15b6cfe893427ca97b3636b8f47c997387743ae096048eccc6d6b54d5"],"state_sha256":"dcbebc5583091407f064911981e2b95f1f7ccddea4ebb31558fab66439b1a940"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NDNe9ByiVqD7DPqD/7aWtX9Ex2pCTIPRZwZ8PL6Wa+1di5s1YXipxi2XlZbeXbhgelzFTgVxVJKK4OOPU4/RBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T13:56:41.764477Z","bundle_sha256":"92d381122a09c084cdac5a17efb6d75955227361df97eacbfb9d4efb6795faaa"}}