{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7XXWUDI3CICW57FC5EIMZ722VK","short_pith_number":"pith:7XXWUDI3","canonical_record":{"source":{"id":"1310.2648","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-10-09T22:46:37Z","cross_cats_sorted":[],"title_canon_sha256":"969711c9f637e1e849a0f2399e8d201a09b61f2ff0b52e8a2897500d243981ad","abstract_canon_sha256":"bd5a7b17c7f8e65d4bc37f883a37fe32287d4b04fd33c73e4987da5eff521e6f"},"schema_version":"1.0"},"canonical_sha256":"fdef6a0d1b12056efca2e910ccff5aaa9fe258787961dc47c43b86d102e9071e","source":{"kind":"arxiv","id":"1310.2648","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2648","created_at":"2026-05-18T03:00:25Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2648v3","created_at":"2026-05-18T03:00:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2648","created_at":"2026-05-18T03:00:25Z"},{"alias_kind":"pith_short_12","alias_value":"7XXWUDI3CICW","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"7XXWUDI3CICW57FC","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"7XXWUDI3","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7XXWUDI3CICW57FC5EIMZ722VK","target":"record","payload":{"canonical_record":{"source":{"id":"1310.2648","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-10-09T22:46:37Z","cross_cats_sorted":[],"title_canon_sha256":"969711c9f637e1e849a0f2399e8d201a09b61f2ff0b52e8a2897500d243981ad","abstract_canon_sha256":"bd5a7b17c7f8e65d4bc37f883a37fe32287d4b04fd33c73e4987da5eff521e6f"},"schema_version":"1.0"},"canonical_sha256":"fdef6a0d1b12056efca2e910ccff5aaa9fe258787961dc47c43b86d102e9071e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:25.739810Z","signature_b64":"BtKdIHTMpbDMnNXq7xXc5ZSm3z1RQDpxWstua2FhXTBm+QAtGtsOpApnJUthc6nJqR+o57Gh9Tat/gQyQ8cEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdef6a0d1b12056efca2e910ccff5aaa9fe258787961dc47c43b86d102e9071e","last_reissued_at":"2026-05-18T03:00:25.738709Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:25.738709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.2648","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-18T03:00:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GXNV6VxeSlsmFOxhRNki9ZGTFXCu7mKDEl2vJAOUkElDEeg4UaEyLEptaXo01vrN8lS/YAMjRm1CkvwkortzDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:38:34.896449Z"},"content_sha256":"bcc7d2000971cc75e6e24cf7e17e56d467ad3a929400ba613987af0a7542410b","schema_version":"1.0","event_id":"sha256:bcc7d2000971cc75e6e24cf7e17e56d467ad3a929400ba613987af0a7542410b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7XXWUDI3CICW57FC5EIMZ722VK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Lyapunov Optimization Approach to Repeated Stochastic Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Michael J. Neely","submitted_at":"2013-10-09T22:46:37Z","abstract_excerpt":"This paper considers a time-varying game with $N$ players. Every time slot, players observe their own random events and then take a control action. The events and control actions affect the individual utilities earned by each player. The goal is to maximize a concave function of time average utilities subject to equilibrium constraints. Specifically, participating players are provided access to a common source of randomness from which they can optimally correlate their decisions. The equilibrium constraints incentivize participation by ensuring that players cannot earn more utility if they cho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2648","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-18T03:00:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UYbA5ZUzaTbBXiXn/H5vDH/bsM98LFa6qhcFJroCq6kWcj1ZAby5BWP1MGwTHUsmSEBrX4PVGhy2CqZBlOuFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:38:34.896994Z"},"content_sha256":"9a0ff309c321162e042c93f3d21817e91a0894fb215cf8e846ee229b86730f2a","schema_version":"1.0","event_id":"sha256:9a0ff309c321162e042c93f3d21817e91a0894fb215cf8e846ee229b86730f2a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7XXWUDI3CICW57FC5EIMZ722VK/bundle.json","state_url":"https://pith.science/pith/7XXWUDI3CICW57FC5EIMZ722VK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7XXWUDI3CICW57FC5EIMZ722VK/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-31T02:38:34Z","links":{"resolver":"https://pith.science/pith/7XXWUDI3CICW57FC5EIMZ722VK","bundle":"https://pith.science/pith/7XXWUDI3CICW57FC5EIMZ722VK/bundle.json","state":"https://pith.science/pith/7XXWUDI3CICW57FC5EIMZ722VK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7XXWUDI3CICW57FC5EIMZ722VK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7XXWUDI3CICW57FC5EIMZ722VK","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":"bd5a7b17c7f8e65d4bc37f883a37fe32287d4b04fd33c73e4987da5eff521e6f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-10-09T22:46:37Z","title_canon_sha256":"969711c9f637e1e849a0f2399e8d201a09b61f2ff0b52e8a2897500d243981ad"},"schema_version":"1.0","source":{"id":"1310.2648","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2648","created_at":"2026-05-18T03:00:25Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2648v3","created_at":"2026-05-18T03:00:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2648","created_at":"2026-05-18T03:00:25Z"},{"alias_kind":"pith_short_12","alias_value":"7XXWUDI3CICW","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"7XXWUDI3CICW57FC","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"7XXWUDI3","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:9a0ff309c321162e042c93f3d21817e91a0894fb215cf8e846ee229b86730f2a","target":"graph","created_at":"2026-05-18T03:00:25Z","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":"This paper considers a time-varying game with $N$ players. Every time slot, players observe their own random events and then take a control action. The events and control actions affect the individual utilities earned by each player. The goal is to maximize a concave function of time average utilities subject to equilibrium constraints. Specifically, participating players are provided access to a common source of randomness from which they can optimally correlate their decisions. The equilibrium constraints incentivize participation by ensuring that players cannot earn more utility if they cho","authors_text":"Michael J. Neely","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-10-09T22:46:37Z","title":"A Lyapunov Optimization Approach to Repeated Stochastic Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2648","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:bcc7d2000971cc75e6e24cf7e17e56d467ad3a929400ba613987af0a7542410b","target":"record","created_at":"2026-05-18T03:00:25Z","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":"bd5a7b17c7f8e65d4bc37f883a37fe32287d4b04fd33c73e4987da5eff521e6f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-10-09T22:46:37Z","title_canon_sha256":"969711c9f637e1e849a0f2399e8d201a09b61f2ff0b52e8a2897500d243981ad"},"schema_version":"1.0","source":{"id":"1310.2648","kind":"arxiv","version":3}},"canonical_sha256":"fdef6a0d1b12056efca2e910ccff5aaa9fe258787961dc47c43b86d102e9071e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fdef6a0d1b12056efca2e910ccff5aaa9fe258787961dc47c43b86d102e9071e","first_computed_at":"2026-05-18T03:00:25.738709Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:25.738709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BtKdIHTMpbDMnNXq7xXc5ZSm3z1RQDpxWstua2FhXTBm+QAtGtsOpApnJUthc6nJqR+o57Gh9Tat/gQyQ8cEAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:25.739810Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.2648","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bcc7d2000971cc75e6e24cf7e17e56d467ad3a929400ba613987af0a7542410b","sha256:9a0ff309c321162e042c93f3d21817e91a0894fb215cf8e846ee229b86730f2a"],"state_sha256":"79501d72af88fbbec6e908eb4ee07bc33dbcf2bdcfa74dc4361d4a87b8bd29a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZVCHizZIfU2NRGl3q7d+hzgPEN0ujaBdAOcy5Jl3YrLZA+UTXakBXwIQi3CivMijyoxT74sUWf5zQTdpLaZmAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:38:34.899524Z","bundle_sha256":"e45ecc4621f6939be58ace1939d010e5f85956e0a68231c411a2bf87dcfe7395"}}