{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TUPE53CLYKWJYFH5HGZ7R3ZDGG","short_pith_number":"pith:TUPE53CL","canonical_record":{"source":{"id":"1411.0728","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-03T22:59:11Z","cross_cats_sorted":["cs.GT","cs.SY","math.OC"],"title_canon_sha256":"79bf4ab9891830e0c920a43f35affc22d00c6cd893b9240a9dcabc40a75961d6","abstract_canon_sha256":"ef6af9efd1b9ed8a380684f91643bb4f9f2b859710f6e08d5f43be97ac7fc2ad"},"schema_version":"1.0"},"canonical_sha256":"9d1e4eec4bc2ac9c14fd39b3f8ef2331a1ed10c612d2ccc28601bcc94d57e347","source":{"kind":"arxiv","id":"1411.0728","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0728","created_at":"2026-05-18T01:12:13Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0728v3","created_at":"2026-05-18T01:12:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0728","created_at":"2026-05-18T01:12:13Z"},{"alias_kind":"pith_short_12","alias_value":"TUPE53CLYKWJ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TUPE53CLYKWJYFH5","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TUPE53CL","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TUPE53CLYKWJYFH5HGZ7R3ZDGG","target":"record","payload":{"canonical_record":{"source":{"id":"1411.0728","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-03T22:59:11Z","cross_cats_sorted":["cs.GT","cs.SY","math.OC"],"title_canon_sha256":"79bf4ab9891830e0c920a43f35affc22d00c6cd893b9240a9dcabc40a75961d6","abstract_canon_sha256":"ef6af9efd1b9ed8a380684f91643bb4f9f2b859710f6e08d5f43be97ac7fc2ad"},"schema_version":"1.0"},"canonical_sha256":"9d1e4eec4bc2ac9c14fd39b3f8ef2331a1ed10c612d2ccc28601bcc94d57e347","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:13.642123Z","signature_b64":"NWj5Jf0XehR8YzphWqQwk7burXqWxpV3Tu3rwy5xVYqPwwOHELL+s4AA0P4t4jbsHuaB6S7VwM8tCpBpf9NIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d1e4eec4bc2ac9c14fd39b3f8ef2331a1ed10c612d2ccc28601bcc94d57e347","last_reissued_at":"2026-05-18T01:12:13.641458Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:13.641458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.0728","source_version":3,"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-18T01:12:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qKNonedy5I1cIHKwNKVUMAh/lg6ljjTgtaWcVuxRuu7svuBCcP4YbS61D9uBILt4ZWgY7ECIsWOEXbfKeYXcCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:14:45.532685Z"},"content_sha256":"4fc499cf0e583ab01e3319ebe5d8107e7f0738aefe20096f2a6419394604e3ce","schema_version":"1.0","event_id":"sha256:4fc499cf0e583ab01e3319ebe5d8107e7f0738aefe20096f2a6419394604e3ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TUPE53CLYKWJYFH5HGZ7R3ZDGG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approachability in Stackelberg Stochastic Games with Vector Costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.SY","math.OC"],"primary_cat":"cs.LG","authors_text":"Dileep Kalathil, Rahul Jain, Vivek Borkar","submitted_at":"2014-11-03T22:59:11Z","abstract_excerpt":"The notion of approachability was introduced by Blackwell [1] in the context of vector-valued repeated games. The famous Blackwell's approachability theorem prescribes a strategy for approachability, i.e., for `steering' the average cost of a given agent towards a given target set, irrespective of the strategies of the other agents. In this paper, motivated by the multi-objective optimization/decision making problems in dynamically changing environments, we address the approachability problem in Stackelberg stochastic games with vector valued cost functions. We make two main contributions. Fir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0728","kind":"arxiv","version":3},"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-18T01:12:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0U3YOaTFTb9JXhVmw21nXvL0/vbVn3xIlxHPlM076CAzT58Pfo0DEl99u1fyPrfUXj/5OwclOVqho7eYhVEKAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:14:45.533141Z"},"content_sha256":"0741b7b79f218237bdf6b8543a6e9e029560d4839765ae9a9d331f97180446d3","schema_version":"1.0","event_id":"sha256:0741b7b79f218237bdf6b8543a6e9e029560d4839765ae9a9d331f97180446d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TUPE53CLYKWJYFH5HGZ7R3ZDGG/bundle.json","state_url":"https://pith.science/pith/TUPE53CLYKWJYFH5HGZ7R3ZDGG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TUPE53CLYKWJYFH5HGZ7R3ZDGG/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-26T05:14:45Z","links":{"resolver":"https://pith.science/pith/TUPE53CLYKWJYFH5HGZ7R3ZDGG","bundle":"https://pith.science/pith/TUPE53CLYKWJYFH5HGZ7R3ZDGG/bundle.json","state":"https://pith.science/pith/TUPE53CLYKWJYFH5HGZ7R3ZDGG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TUPE53CLYKWJYFH5HGZ7R3ZDGG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TUPE53CLYKWJYFH5HGZ7R3ZDGG","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":"ef6af9efd1b9ed8a380684f91643bb4f9f2b859710f6e08d5f43be97ac7fc2ad","cross_cats_sorted":["cs.GT","cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-03T22:59:11Z","title_canon_sha256":"79bf4ab9891830e0c920a43f35affc22d00c6cd893b9240a9dcabc40a75961d6"},"schema_version":"1.0","source":{"id":"1411.0728","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0728","created_at":"2026-05-18T01:12:13Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0728v3","created_at":"2026-05-18T01:12:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0728","created_at":"2026-05-18T01:12:13Z"},{"alias_kind":"pith_short_12","alias_value":"TUPE53CLYKWJ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TUPE53CLYKWJYFH5","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TUPE53CL","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:0741b7b79f218237bdf6b8543a6e9e029560d4839765ae9a9d331f97180446d3","target":"graph","created_at":"2026-05-18T01:12:13Z","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":"The notion of approachability was introduced by Blackwell [1] in the context of vector-valued repeated games. The famous Blackwell's approachability theorem prescribes a strategy for approachability, i.e., for `steering' the average cost of a given agent towards a given target set, irrespective of the strategies of the other agents. In this paper, motivated by the multi-objective optimization/decision making problems in dynamically changing environments, we address the approachability problem in Stackelberg stochastic games with vector valued cost functions. We make two main contributions. Fir","authors_text":"Dileep Kalathil, Rahul Jain, Vivek Borkar","cross_cats":["cs.GT","cs.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-03T22:59:11Z","title":"Approachability in Stackelberg Stochastic Games with Vector Costs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0728","kind":"arxiv","version":3},"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:4fc499cf0e583ab01e3319ebe5d8107e7f0738aefe20096f2a6419394604e3ce","target":"record","created_at":"2026-05-18T01:12:13Z","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":"ef6af9efd1b9ed8a380684f91643bb4f9f2b859710f6e08d5f43be97ac7fc2ad","cross_cats_sorted":["cs.GT","cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-03T22:59:11Z","title_canon_sha256":"79bf4ab9891830e0c920a43f35affc22d00c6cd893b9240a9dcabc40a75961d6"},"schema_version":"1.0","source":{"id":"1411.0728","kind":"arxiv","version":3}},"canonical_sha256":"9d1e4eec4bc2ac9c14fd39b3f8ef2331a1ed10c612d2ccc28601bcc94d57e347","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d1e4eec4bc2ac9c14fd39b3f8ef2331a1ed10c612d2ccc28601bcc94d57e347","first_computed_at":"2026-05-18T01:12:13.641458Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:13.641458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NWj5Jf0XehR8YzphWqQwk7burXqWxpV3Tu3rwy5xVYqPwwOHELL+s4AA0P4t4jbsHuaB6S7VwM8tCpBpf9NIAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:13.642123Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.0728","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fc499cf0e583ab01e3319ebe5d8107e7f0738aefe20096f2a6419394604e3ce","sha256:0741b7b79f218237bdf6b8543a6e9e029560d4839765ae9a9d331f97180446d3"],"state_sha256":"6d75adde50712c38d9acc42cc2400342a4d15ff23a10600cacd8201176ff20e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8+O4hLAKzREs5NLzFOA6kJhqGw51yNLZXdroGwxeUwk5o3DACcn3q13RFn1vfQQPy6Jo3nuKd37jBZaDAF5zBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T05:14:45.535822Z","bundle_sha256":"87e7c566c4596fce4faf9e7dca011feaeee319051ce6b9ef93d15adbbbbf4e21"}}