{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2RGEI7RCXSLGG3HTN6RU42RCOC","short_pith_number":"pith:2RGEI7RC","canonical_record":{"source":{"id":"1707.06334","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-07-20T01:37:14Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT","math.OC","nlin.AO"],"title_canon_sha256":"c341dece5c5f5f6cb547f28a03b4e161c441fe699a1baacc52926e961069af14","abstract_canon_sha256":"b0de4c6881439740946cb2d2131be32b1108f02feb39e1e4ca1b99197a5c6164"},"schema_version":"1.0"},"canonical_sha256":"d44c447e22bc96636cf36fa34e6a227091d97a0ec8f0491a7bcf10cdaaaf461c","source":{"kind":"arxiv","id":"1707.06334","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06334","created_at":"2026-05-18T00:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06334v2","created_at":"2026-05-18T00:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06334","created_at":"2026-05-18T00:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"2RGEI7RCXSLG","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2RGEI7RCXSLGG3HT","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2RGEI7RC","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2RGEI7RCXSLGG3HTN6RU42RCOC","target":"record","payload":{"canonical_record":{"source":{"id":"1707.06334","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-07-20T01:37:14Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT","math.OC","nlin.AO"],"title_canon_sha256":"c341dece5c5f5f6cb547f28a03b4e161c441fe699a1baacc52926e961069af14","abstract_canon_sha256":"b0de4c6881439740946cb2d2131be32b1108f02feb39e1e4ca1b99197a5c6164"},"schema_version":"1.0"},"canonical_sha256":"d44c447e22bc96636cf36fa34e6a227091d97a0ec8f0491a7bcf10cdaaaf461c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:11.824804Z","signature_b64":"+UOHFNvZ4LtVD7byn25fD9kXAvTyt0lcTlpsfJPdEyuHj30VdVd9KUFem1rTTRVzTJzvLu/zrnBxbXw0jYhBBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d44c447e22bc96636cf36fa34e6a227091d97a0ec8f0491a7bcf10cdaaaf461c","last_reissued_at":"2026-05-18T00:39:11.824148Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:11.824148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.06334","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-18T00:39:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u1PSXVoVzN1S3CQJzqHRuyjZJi9zD8tKa73vdaYqomcFdodHpobiQYpjw4nhHecl80YxFGwyBetWxHPdIOaaAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:30:33.172222Z"},"content_sha256":"f278f88d3b3c4450d46371a0cf3aa93a71d5b43033de57e18c13340b53f243db","schema_version":"1.0","event_id":"sha256:f278f88d3b3c4450d46371a0cf3aa93a71d5b43033de57e18c13340b53f243db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2RGEI7RCXSLGG3HTN6RU42RCOC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fully Decentralized Policies for Multi-Agent Systems: An Information Theoretic Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IT","math.IT","math.OC","nlin.AO"],"primary_cat":"cs.SY","authors_text":"Claire Tomlin, David Fridovich-Keil, Roel Dobbe","submitted_at":"2017-07-20T01:37:14Z","abstract_excerpt":"Learning cooperative policies for multi-agent systems is often challenged by partial observability and a lack of coordination. In some settings, the structure of a problem allows a distributed solution with limited communication. Here, we consider a scenario where no communication is available, and instead we learn local policies for all agents that collectively mimic the solution to a centralized multi-agent static optimization problem. Our main contribution is an information theoretic framework based on rate distortion theory which facilitates analysis of how well the resulting fully decentr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06334","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-18T00:39:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3kOnsFcDQK8HPTjlA42Jl+qg/lY7sBynzjJ9ECeYa+rBIyTrF7MpM5125nfImb3gGb241fg8lkKFTN19feqVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:30:33.172929Z"},"content_sha256":"51e491dfd64fecf05b2db3d60b00eee5ce5cfedbcc71a05e02d645f0968f1c8c","schema_version":"1.0","event_id":"sha256:51e491dfd64fecf05b2db3d60b00eee5ce5cfedbcc71a05e02d645f0968f1c8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2RGEI7RCXSLGG3HTN6RU42RCOC/bundle.json","state_url":"https://pith.science/pith/2RGEI7RCXSLGG3HTN6RU42RCOC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2RGEI7RCXSLGG3HTN6RU42RCOC/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-25T08:30:33Z","links":{"resolver":"https://pith.science/pith/2RGEI7RCXSLGG3HTN6RU42RCOC","bundle":"https://pith.science/pith/2RGEI7RCXSLGG3HTN6RU42RCOC/bundle.json","state":"https://pith.science/pith/2RGEI7RCXSLGG3HTN6RU42RCOC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2RGEI7RCXSLGG3HTN6RU42RCOC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2RGEI7RCXSLGG3HTN6RU42RCOC","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":"b0de4c6881439740946cb2d2131be32b1108f02feb39e1e4ca1b99197a5c6164","cross_cats_sorted":["cs.AI","cs.IT","math.IT","math.OC","nlin.AO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-07-20T01:37:14Z","title_canon_sha256":"c341dece5c5f5f6cb547f28a03b4e161c441fe699a1baacc52926e961069af14"},"schema_version":"1.0","source":{"id":"1707.06334","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06334","created_at":"2026-05-18T00:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06334v2","created_at":"2026-05-18T00:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06334","created_at":"2026-05-18T00:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"2RGEI7RCXSLG","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2RGEI7RCXSLGG3HT","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2RGEI7RC","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:51e491dfd64fecf05b2db3d60b00eee5ce5cfedbcc71a05e02d645f0968f1c8c","target":"graph","created_at":"2026-05-18T00:39:11Z","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 cooperative policies for multi-agent systems is often challenged by partial observability and a lack of coordination. In some settings, the structure of a problem allows a distributed solution with limited communication. Here, we consider a scenario where no communication is available, and instead we learn local policies for all agents that collectively mimic the solution to a centralized multi-agent static optimization problem. Our main contribution is an information theoretic framework based on rate distortion theory which facilitates analysis of how well the resulting fully decentr","authors_text":"Claire Tomlin, David Fridovich-Keil, Roel Dobbe","cross_cats":["cs.AI","cs.IT","math.IT","math.OC","nlin.AO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-07-20T01:37:14Z","title":"Fully Decentralized Policies for Multi-Agent Systems: An Information Theoretic Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06334","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:f278f88d3b3c4450d46371a0cf3aa93a71d5b43033de57e18c13340b53f243db","target":"record","created_at":"2026-05-18T00:39:11Z","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":"b0de4c6881439740946cb2d2131be32b1108f02feb39e1e4ca1b99197a5c6164","cross_cats_sorted":["cs.AI","cs.IT","math.IT","math.OC","nlin.AO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-07-20T01:37:14Z","title_canon_sha256":"c341dece5c5f5f6cb547f28a03b4e161c441fe699a1baacc52926e961069af14"},"schema_version":"1.0","source":{"id":"1707.06334","kind":"arxiv","version":2}},"canonical_sha256":"d44c447e22bc96636cf36fa34e6a227091d97a0ec8f0491a7bcf10cdaaaf461c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d44c447e22bc96636cf36fa34e6a227091d97a0ec8f0491a7bcf10cdaaaf461c","first_computed_at":"2026-05-18T00:39:11.824148Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:11.824148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+UOHFNvZ4LtVD7byn25fD9kXAvTyt0lcTlpsfJPdEyuHj30VdVd9KUFem1rTTRVzTJzvLu/zrnBxbXw0jYhBBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:11.824804Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.06334","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f278f88d3b3c4450d46371a0cf3aa93a71d5b43033de57e18c13340b53f243db","sha256:51e491dfd64fecf05b2db3d60b00eee5ce5cfedbcc71a05e02d645f0968f1c8c"],"state_sha256":"1058d0638818eb3ef4b78d5517af6b9e6c910f272965c3d9a5b9fc18cc6b3259"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r61+8KxfxOrnGjnpt21EMihISQf/juPlqkUeVy62x1XLD4QtegMTo7mwZAqo4ZCiMNApZnGpivTZmiP0B3PPAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T08:30:33.177404Z","bundle_sha256":"4763b1f69c5f952134c646ac850985aea32e3e35d1a9ee8a35ccd9a8c07e6a28"}}