{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QNURD4GRU6WTHJEB66WO55SRHM","short_pith_number":"pith:QNURD4GR","schema_version":"1.0","canonical_sha256":"836911f0d1a7ad33a481f7aceef6513b091d9013385521fe121fefd7ae4ca76e","source":{"kind":"arxiv","id":"1711.02303","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.02303","created_at":"2026-05-18T00:31:08.284883+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.02303v1","created_at":"2026-05-18T00:31:08.284883+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02303","created_at":"2026-05-18T00:31:08.284883+00:00"},{"alias_kind":"pith_short_12","alias_value":"QNURD4GRU6WT","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QNURD4GRU6WTHJEB","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QNURD4GR","created_at":"2026-05-18T12:31:39.905425+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QNURD4GRU6WTHJEB66WO55SRHM","json":"https://pith.science/pith/QNURD4GRU6WTHJEB66WO55SRHM.json","graph_json":"https://pith.science/api/pith-number/QNURD4GRU6WTHJEB66WO55SRHM/graph.json","events_json":"https://pith.science/api/pith-number/QNURD4GRU6WTHJEB66WO55SRHM/events.json","paper":"https://pith.science/paper/QNURD4GR"},"agent_actions":{"view_html":"https://pith.science/pith/QNURD4GRU6WTHJEB66WO55SRHM","download_json":"https://pith.science/pith/QNURD4GRU6WTHJEB66WO55SRHM.json","view_paper":"https://pith.science/paper/QNURD4GR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.02303&json=true","fetch_graph":"https://pith.science/api/pith-number/QNURD4GRU6WTHJEB66WO55SRHM/graph.json","fetch_events":"https://pith.science/api/pith-number/QNURD4GRU6WTHJEB66WO55SRHM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QNURD4GRU6WTHJEB66WO55SRHM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QNURD4GRU6WTHJEB66WO55SRHM/action/storage_attestation","attest_author":"https://pith.science/pith/QNURD4GRU6WTHJEB66WO55SRHM/action/author_attestation","sign_citation":"https://pith.science/pith/QNURD4GRU6WTHJEB66WO55SRHM/action/citation_signature","submit_replication":"https://pith.science/pith/QNURD4GRU6WTHJEB66WO55SRHM/action/replication_record"}},"created_at":"2026-05-18T00:31:08.284883+00:00","updated_at":"2026-05-18T00:31:08.284883+00:00"}