{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QNURD4GRU6WTHJEB66WO55SRHM","short_pith_number":"pith:QNURD4GR","canonical_record":{"source":{"id":"1711.02303","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-11-07T06:31:15Z","cross_cats_sorted":[],"title_canon_sha256":"924718f1031a2061c9f99f2e5d268a3e05879958e653bc27c575533d30b2045a","abstract_canon_sha256":"da7703cf51164e2113db2367836f80f9b9a98bdbb6cb539ca434ba82831ab233"},"schema_version":"1.0"},"canonical_sha256":"836911f0d1a7ad33a481f7aceef6513b091d9013385521fe121fefd7ae4ca76e","source":{"kind":"arxiv","id":"1711.02303","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02303","created_at":"2026-05-18T00:31:08Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02303v1","created_at":"2026-05-18T00:31:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02303","created_at":"2026-05-18T00:31:08Z"},{"alias_kind":"pith_short_12","alias_value":"QNURD4GRU6WT","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QNURD4GRU6WTHJEB","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QNURD4GR","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QNURD4GRU6WTHJEB66WO55SRHM","target":"record","payload":{"canonical_record":{"source":{"id":"1711.02303","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-11-07T06:31:15Z","cross_cats_sorted":[],"title_canon_sha256":"924718f1031a2061c9f99f2e5d268a3e05879958e653bc27c575533d30b2045a","abstract_canon_sha256":"da7703cf51164e2113db2367836f80f9b9a98bdbb6cb539ca434ba82831ab233"},"schema_version":"1.0"},"canonical_sha256":"836911f0d1a7ad33a481f7aceef6513b091d9013385521fe121fefd7ae4ca76e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:08.285361Z","signature_b64":"XiUMa/S89/rNpJazPWErhsinI+VPdTtAwyHfRtNdkxRdpPdRvwjem4IQWCUl9YcLNd6otCHl0HKLWCV+xCVjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"836911f0d1a7ad33a481f7aceef6513b091d9013385521fe121fefd7ae4ca76e","last_reissued_at":"2026-05-18T00:31:08.284785Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:08.284785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.02303","source_version":1,"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:31:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cg31mOcpAI5j1lvs1yEkpk4Ov4M78ImukUx341sJY7ujwUTqB6XkFA9YCnCPXTfsVj+nVGg9vmb22RueuLwAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:38:26.373196Z"},"content_sha256":"f41aef386cd1c976fe8d084cc615c93e28cd8625b04512876886572ea03a8e01","schema_version":"1.0","event_id":"sha256:f41aef386cd1c976fe8d084cc615c93e28cd8625b04512876886572ea03a8e01"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QNURD4GRU6WTHJEB66WO55SRHM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterative Computation of Security Strategies of Matrix Games with Growing Action Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Cedric Langbort, Lichun Li","submitted_at":"2017-11-07T06:31:15Z","abstract_excerpt":"This paper studies how to efficiently update the saddle-point strategy, or security strategy of one player in a matrix game when the other player develops new actions in the game. It is well known that the saddle-point strategy of one player can be computed by solving a linear program. Developing a new action will add a new constraint to the existing LP. Therefore, our problem becomes how to solve the new LP with a new constraint efficiently. Considering the potentially huge number of constraints, which corresponds to the large size of the other player's action set, we use shadow vertex simple"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02303","kind":"arxiv","version":1},"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:31:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NVqYzC6ofOqw7B/dZ/CiRWG3f0YphLbcQyfR+AQJPKfAj7NfH5KwCKbN1o7tkr8/+CiYAu9kcfwhBBwf64F1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:38:26.373559Z"},"content_sha256":"e24e58b1f4cf01811f955ae42cd259d720a301b58f25a2e93b448c161fc0758f","schema_version":"1.0","event_id":"sha256:e24e58b1f4cf01811f955ae42cd259d720a301b58f25a2e93b448c161fc0758f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QNURD4GRU6WTHJEB66WO55SRHM/bundle.json","state_url":"https://pith.science/pith/QNURD4GRU6WTHJEB66WO55SRHM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QNURD4GRU6WTHJEB66WO55SRHM/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-06-07T10:38:26Z","links":{"resolver":"https://pith.science/pith/QNURD4GRU6WTHJEB66WO55SRHM","bundle":"https://pith.science/pith/QNURD4GRU6WTHJEB66WO55SRHM/bundle.json","state":"https://pith.science/pith/QNURD4GRU6WTHJEB66WO55SRHM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QNURD4GRU6WTHJEB66WO55SRHM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QNURD4GRU6WTHJEB66WO55SRHM","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":"da7703cf51164e2113db2367836f80f9b9a98bdbb6cb539ca434ba82831ab233","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-11-07T06:31:15Z","title_canon_sha256":"924718f1031a2061c9f99f2e5d268a3e05879958e653bc27c575533d30b2045a"},"schema_version":"1.0","source":{"id":"1711.02303","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02303","created_at":"2026-05-18T00:31:08Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02303v1","created_at":"2026-05-18T00:31:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02303","created_at":"2026-05-18T00:31:08Z"},{"alias_kind":"pith_short_12","alias_value":"QNURD4GRU6WT","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QNURD4GRU6WTHJEB","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QNURD4GR","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:e24e58b1f4cf01811f955ae42cd259d720a301b58f25a2e93b448c161fc0758f","target":"graph","created_at":"2026-05-18T00:31:08Z","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 studies how to efficiently update the saddle-point strategy, or security strategy of one player in a matrix game when the other player develops new actions in the game. It is well known that the saddle-point strategy of one player can be computed by solving a linear program. Developing a new action will add a new constraint to the existing LP. Therefore, our problem becomes how to solve the new LP with a new constraint efficiently. Considering the potentially huge number of constraints, which corresponds to the large size of the other player's action set, we use shadow vertex simple","authors_text":"Cedric Langbort, Lichun Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-11-07T06:31:15Z","title":"Iterative Computation of Security Strategies of Matrix Games with Growing Action Set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02303","kind":"arxiv","version":1},"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:f41aef386cd1c976fe8d084cc615c93e28cd8625b04512876886572ea03a8e01","target":"record","created_at":"2026-05-18T00:31:08Z","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":"da7703cf51164e2113db2367836f80f9b9a98bdbb6cb539ca434ba82831ab233","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-11-07T06:31:15Z","title_canon_sha256":"924718f1031a2061c9f99f2e5d268a3e05879958e653bc27c575533d30b2045a"},"schema_version":"1.0","source":{"id":"1711.02303","kind":"arxiv","version":1}},"canonical_sha256":"836911f0d1a7ad33a481f7aceef6513b091d9013385521fe121fefd7ae4ca76e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"836911f0d1a7ad33a481f7aceef6513b091d9013385521fe121fefd7ae4ca76e","first_computed_at":"2026-05-18T00:31:08.284785Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:08.284785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XiUMa/S89/rNpJazPWErhsinI+VPdTtAwyHfRtNdkxRdpPdRvwjem4IQWCUl9YcLNd6otCHl0HKLWCV+xCVjBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:08.285361Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.02303","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f41aef386cd1c976fe8d084cc615c93e28cd8625b04512876886572ea03a8e01","sha256:e24e58b1f4cf01811f955ae42cd259d720a301b58f25a2e93b448c161fc0758f"],"state_sha256":"42c30ac40ca580121f8afde443a62aa4dd543dcc32047580e87e5cdeef15734e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KG7Wj2rezp0Sit5LNDVao2yQ68Tpo0raoEoI5rUPoP+QU2H4zzt1+6Y8Ds6WIwZo92yljCSIpPPyB0JhXRTXAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T10:38:26.377460Z","bundle_sha256":"16b2f7f21c3e7cce6771ac692874370934a16427f2846e8190b6765621e72521"}}