{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:EA4452G37UDPIO3RNQLJFXKFJC","short_pith_number":"pith:EA4452G3","canonical_record":{"source":{"id":"2105.07405","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-05-16T10:42:09Z","cross_cats_sorted":["cs.AI","cs.GT","cs.MA","cs.SY","eess.SY"],"title_canon_sha256":"82a9daae0b6f5cdd1e64d04f03eea048aa7e98389f7cfcc7ca5387c95b4f0547","abstract_canon_sha256":"54a8b866f63fc343235752f89006a757eeb7a0c6e44b14f6c5baf2680e2e7ee8"},"schema_version":"1.0"},"canonical_sha256":"2039cee8dbfd06f43b716c1692dd4548acfcd1e1d064d521227e24ac13b7bc98","source":{"kind":"arxiv","id":"2105.07405","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.07405","created_at":"2026-07-05T04:19:02Z"},{"alias_kind":"arxiv_version","alias_value":"2105.07405v2","created_at":"2026-07-05T04:19:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.07405","created_at":"2026-07-05T04:19:02Z"},{"alias_kind":"pith_short_12","alias_value":"EA4452G37UDP","created_at":"2026-07-05T04:19:02Z"},{"alias_kind":"pith_short_16","alias_value":"EA4452G37UDPIO3R","created_at":"2026-07-05T04:19:02Z"},{"alias_kind":"pith_short_8","alias_value":"EA4452G3","created_at":"2026-07-05T04:19:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:EA4452G37UDPIO3RNQLJFXKFJC","target":"record","payload":{"canonical_record":{"source":{"id":"2105.07405","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-05-16T10:42:09Z","cross_cats_sorted":["cs.AI","cs.GT","cs.MA","cs.SY","eess.SY"],"title_canon_sha256":"82a9daae0b6f5cdd1e64d04f03eea048aa7e98389f7cfcc7ca5387c95b4f0547","abstract_canon_sha256":"54a8b866f63fc343235752f89006a757eeb7a0c6e44b14f6c5baf2680e2e7ee8"},"schema_version":"1.0"},"canonical_sha256":"2039cee8dbfd06f43b716c1692dd4548acfcd1e1d064d521227e24ac13b7bc98","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:19:02.080450Z","signature_b64":"SB+J6Se8GnGi8USy6E7SDronXiS9x8mesdYe7pfTVJcLoUplxG9pkFbG+uA7PBMF1bCvcKS1cotKTw0MReyNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2039cee8dbfd06f43b716c1692dd4548acfcd1e1d064d521227e24ac13b7bc98","last_reissued_at":"2026-07-05T04:19:02.079843Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:19:02.079843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2105.07405","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-05T04:19:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k7aMjFESDZhDuPUIKntgfYqoQfxZdcC1d7qsfqXlcffVEA8GFiRkhj+yiiIpBTnhuPPAzKdzQTTlcj29lF7cDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T11:46:45.233786Z"},"content_sha256":"e3690bedc3e593eeb5e1a569daf6b12fc11c6f1b6010dfdea3345619294d102a","schema_version":"1.0","event_id":"sha256:e3690bedc3e593eeb5e1a569daf6b12fc11c6f1b6010dfdea3345619294d102a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:EA4452G37UDPIO3RNQLJFXKFJC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust optimal policies for team Markov games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.GT","cs.MA","cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Feng Huang, Long Wang, Ming Cao","submitted_at":"2021-05-16T10:42:09Z","abstract_excerpt":"In stochastic dynamic environments, team Markov games have emerged as a versatile paradigm for studying sequential decision-making problems of fully cooperative multi-agent systems. However, the optimality of the derived policies is usually sensitive to model parameters, which are typically unknown and required to be estimated from noisy data in practice. To mitigate the sensitivity of optimal policies to these uncertain parameters, we propose a robust model of team Markov games in this paper, where agents utilize robust optimization approaches to update strategies. This model extends team Mar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.07405","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/2105.07405/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-05T04:19:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r2M7b/n5hRcATti7tVuo+3MqG9+xt6c/2b3p5aIj49qgArLLzu2svIaUW022kXYjs4Bwvta1W9iAYCuClgdrAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T11:46:45.234153Z"},"content_sha256":"1fcbe595934fbcf6039fadf58c0ef920923b0d26a32e97a07045c79b419534c0","schema_version":"1.0","event_id":"sha256:1fcbe595934fbcf6039fadf58c0ef920923b0d26a32e97a07045c79b419534c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EA4452G37UDPIO3RNQLJFXKFJC/bundle.json","state_url":"https://pith.science/pith/EA4452G37UDPIO3RNQLJFXKFJC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EA4452G37UDPIO3RNQLJFXKFJC/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-10T11:46:45Z","links":{"resolver":"https://pith.science/pith/EA4452G37UDPIO3RNQLJFXKFJC","bundle":"https://pith.science/pith/EA4452G37UDPIO3RNQLJFXKFJC/bundle.json","state":"https://pith.science/pith/EA4452G37UDPIO3RNQLJFXKFJC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EA4452G37UDPIO3RNQLJFXKFJC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:EA4452G37UDPIO3RNQLJFXKFJC","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":"54a8b866f63fc343235752f89006a757eeb7a0c6e44b14f6c5baf2680e2e7ee8","cross_cats_sorted":["cs.AI","cs.GT","cs.MA","cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-05-16T10:42:09Z","title_canon_sha256":"82a9daae0b6f5cdd1e64d04f03eea048aa7e98389f7cfcc7ca5387c95b4f0547"},"schema_version":"1.0","source":{"id":"2105.07405","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.07405","created_at":"2026-07-05T04:19:02Z"},{"alias_kind":"arxiv_version","alias_value":"2105.07405v2","created_at":"2026-07-05T04:19:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.07405","created_at":"2026-07-05T04:19:02Z"},{"alias_kind":"pith_short_12","alias_value":"EA4452G37UDP","created_at":"2026-07-05T04:19:02Z"},{"alias_kind":"pith_short_16","alias_value":"EA4452G37UDPIO3R","created_at":"2026-07-05T04:19:02Z"},{"alias_kind":"pith_short_8","alias_value":"EA4452G3","created_at":"2026-07-05T04:19:02Z"}],"graph_snapshots":[{"event_id":"sha256:1fcbe595934fbcf6039fadf58c0ef920923b0d26a32e97a07045c79b419534c0","target":"graph","created_at":"2026-07-05T04:19:02Z","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/2105.07405/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In stochastic dynamic environments, team Markov games have emerged as a versatile paradigm for studying sequential decision-making problems of fully cooperative multi-agent systems. However, the optimality of the derived policies is usually sensitive to model parameters, which are typically unknown and required to be estimated from noisy data in practice. To mitigate the sensitivity of optimal policies to these uncertain parameters, we propose a robust model of team Markov games in this paper, where agents utilize robust optimization approaches to update strategies. This model extends team Mar","authors_text":"Feng Huang, Long Wang, Ming Cao","cross_cats":["cs.AI","cs.GT","cs.MA","cs.SY","eess.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-05-16T10:42:09Z","title":"Robust optimal policies for team Markov games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.07405","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:e3690bedc3e593eeb5e1a569daf6b12fc11c6f1b6010dfdea3345619294d102a","target":"record","created_at":"2026-07-05T04:19:02Z","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":"54a8b866f63fc343235752f89006a757eeb7a0c6e44b14f6c5baf2680e2e7ee8","cross_cats_sorted":["cs.AI","cs.GT","cs.MA","cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-05-16T10:42:09Z","title_canon_sha256":"82a9daae0b6f5cdd1e64d04f03eea048aa7e98389f7cfcc7ca5387c95b4f0547"},"schema_version":"1.0","source":{"id":"2105.07405","kind":"arxiv","version":2}},"canonical_sha256":"2039cee8dbfd06f43b716c1692dd4548acfcd1e1d064d521227e24ac13b7bc98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2039cee8dbfd06f43b716c1692dd4548acfcd1e1d064d521227e24ac13b7bc98","first_computed_at":"2026-07-05T04:19:02.079843Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:19:02.079843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SB+J6Se8GnGi8USy6E7SDronXiS9x8mesdYe7pfTVJcLoUplxG9pkFbG+uA7PBMF1bCvcKS1cotKTw0MReyNBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:19:02.080450Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.07405","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3690bedc3e593eeb5e1a569daf6b12fc11c6f1b6010dfdea3345619294d102a","sha256:1fcbe595934fbcf6039fadf58c0ef920923b0d26a32e97a07045c79b419534c0"],"state_sha256":"5b7a31e7927a1e1121806ad2495b3343cb7fd42c4b4d591c8057eab54a663f2f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SrJdEhfB4cPwBpuMHZDHTDRjS3MyvXM3+l3G2BN1L6tuPsaMYrotKX/VizCHUDPQiuW3SbEDGW3VQxKGFdTcDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T11:46:45.236508Z","bundle_sha256":"6cc8dbce6eaea1db4cfe709b2631c1525c9358bfbd20b2883508a13d87ba801f"}}