{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KPPVW3DEOQXK5JSSARSKI4C57Y","short_pith_number":"pith:KPPVW3DE","canonical_record":{"source":{"id":"1710.00996","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-10-03T05:39:36Z","cross_cats_sorted":[],"title_canon_sha256":"ff1088e86992a71b1d88c89cc3a9dcb6dee9228b35cc31c47a640892782d2587","abstract_canon_sha256":"5dfb7405b8c67ac88ab629418e05260e9442a053a8fc5bbd6d3670330a5b9aa8"},"schema_version":"1.0"},"canonical_sha256":"53df5b6c64742eaea6520464a4705dfe341d7bff06105c9768d2106298ee4092","source":{"kind":"arxiv","id":"1710.00996","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00996","created_at":"2026-05-18T00:29:10Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00996v2","created_at":"2026-05-18T00:29:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00996","created_at":"2026-05-18T00:29:10Z"},{"alias_kind":"pith_short_12","alias_value":"KPPVW3DEOQXK","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KPPVW3DEOQXK5JSS","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KPPVW3DE","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KPPVW3DEOQXK5JSSARSKI4C57Y","target":"record","payload":{"canonical_record":{"source":{"id":"1710.00996","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-10-03T05:39:36Z","cross_cats_sorted":[],"title_canon_sha256":"ff1088e86992a71b1d88c89cc3a9dcb6dee9228b35cc31c47a640892782d2587","abstract_canon_sha256":"5dfb7405b8c67ac88ab629418e05260e9442a053a8fc5bbd6d3670330a5b9aa8"},"schema_version":"1.0"},"canonical_sha256":"53df5b6c64742eaea6520464a4705dfe341d7bff06105c9768d2106298ee4092","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:10.287125Z","signature_b64":"00/58ldJKgwT5zbcx8k8cY3GBmlBxIl0a6NuwkK8Ji65QDfd9yfkwvmGPBVTidvbecZuWPmf6hSB52UBs/FPDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53df5b6c64742eaea6520464a4705dfe341d7bff06105c9768d2106298ee4092","last_reissued_at":"2026-05-18T00:29:10.286625Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:10.286625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.00996","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-05-18T00:29:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nUsA41NNbqVUC+kOyJr+VHnSd/zhRRu3+hrR5LOX9LAfMq9q1FaMSMPyn19Txk0dIjqHsmDDW/w9RSqrPkTSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:35:40.328162Z"},"content_sha256":"00e698976fb8451930a5ea498a0a27b3870fed0c02ac1e6f2d3b8582b3194dea","schema_version":"1.0","event_id":"sha256:00e698976fb8451930a5ea498a0a27b3870fed0c02ac1e6f2d3b8582b3194dea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KPPVW3DEOQXK5JSSARSKI4C57Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Equilibrium Computation and Robust Optimization in Zero Sum Games with Submodular Structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Bryan Wilder","submitted_at":"2017-10-03T05:39:36Z","abstract_excerpt":"We define a class of zero-sum games with combinatorial structure, where the best response problem of one player is to maximize a submodular function. For example, this class includes security games played on networks, as well as the problem of robustly optimizing a submodular function over the worst case from a set of scenarios. The challenge in computing equilibria is that both players' strategy spaces can be exponentially large. Accordingly, previous algorithms have worst-case exponential runtime and indeed fail to scale up on practical instances. We provide a pseudopolynomial-time algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00996","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":""},"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:29:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+l/3u37tDd/BMI7BAGoeUB1u2wHXsabfU+3jpfpMAOSNZmzqTDjBOMHH0sGYEfMUFf/8M2fSNYQSU1SZcnbqDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:35:40.328931Z"},"content_sha256":"862131074c9a92ba9351333f5723fc51390986710442554c4f015b5092f9dfea","schema_version":"1.0","event_id":"sha256:862131074c9a92ba9351333f5723fc51390986710442554c4f015b5092f9dfea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KPPVW3DEOQXK5JSSARSKI4C57Y/bundle.json","state_url":"https://pith.science/pith/KPPVW3DEOQXK5JSSARSKI4C57Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KPPVW3DEOQXK5JSSARSKI4C57Y/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-30T16:35:40Z","links":{"resolver":"https://pith.science/pith/KPPVW3DEOQXK5JSSARSKI4C57Y","bundle":"https://pith.science/pith/KPPVW3DEOQXK5JSSARSKI4C57Y/bundle.json","state":"https://pith.science/pith/KPPVW3DEOQXK5JSSARSKI4C57Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KPPVW3DEOQXK5JSSARSKI4C57Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KPPVW3DEOQXK5JSSARSKI4C57Y","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":"5dfb7405b8c67ac88ab629418e05260e9442a053a8fc5bbd6d3670330a5b9aa8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-10-03T05:39:36Z","title_canon_sha256":"ff1088e86992a71b1d88c89cc3a9dcb6dee9228b35cc31c47a640892782d2587"},"schema_version":"1.0","source":{"id":"1710.00996","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00996","created_at":"2026-05-18T00:29:10Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00996v2","created_at":"2026-05-18T00:29:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00996","created_at":"2026-05-18T00:29:10Z"},{"alias_kind":"pith_short_12","alias_value":"KPPVW3DEOQXK","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KPPVW3DEOQXK5JSS","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KPPVW3DE","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:862131074c9a92ba9351333f5723fc51390986710442554c4f015b5092f9dfea","target":"graph","created_at":"2026-05-18T00:29:10Z","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":"We define a class of zero-sum games with combinatorial structure, where the best response problem of one player is to maximize a submodular function. For example, this class includes security games played on networks, as well as the problem of robustly optimizing a submodular function over the worst case from a set of scenarios. The challenge in computing equilibria is that both players' strategy spaces can be exponentially large. Accordingly, previous algorithms have worst-case exponential runtime and indeed fail to scale up on practical instances. We provide a pseudopolynomial-time algorithm","authors_text":"Bryan Wilder","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-10-03T05:39:36Z","title":"Equilibrium Computation and Robust Optimization in Zero Sum Games with Submodular Structure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00996","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:00e698976fb8451930a5ea498a0a27b3870fed0c02ac1e6f2d3b8582b3194dea","target":"record","created_at":"2026-05-18T00:29:10Z","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":"5dfb7405b8c67ac88ab629418e05260e9442a053a8fc5bbd6d3670330a5b9aa8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-10-03T05:39:36Z","title_canon_sha256":"ff1088e86992a71b1d88c89cc3a9dcb6dee9228b35cc31c47a640892782d2587"},"schema_version":"1.0","source":{"id":"1710.00996","kind":"arxiv","version":2}},"canonical_sha256":"53df5b6c64742eaea6520464a4705dfe341d7bff06105c9768d2106298ee4092","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53df5b6c64742eaea6520464a4705dfe341d7bff06105c9768d2106298ee4092","first_computed_at":"2026-05-18T00:29:10.286625Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:10.286625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"00/58ldJKgwT5zbcx8k8cY3GBmlBxIl0a6NuwkK8Ji65QDfd9yfkwvmGPBVTidvbecZuWPmf6hSB52UBs/FPDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:10.287125Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.00996","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:00e698976fb8451930a5ea498a0a27b3870fed0c02ac1e6f2d3b8582b3194dea","sha256:862131074c9a92ba9351333f5723fc51390986710442554c4f015b5092f9dfea"],"state_sha256":"dd72e054089da41ba113303fb60984ddfe5cac860907c8cd2fa3794bb59e235a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R8ropK0QRkJ5jcodkcfSYAeZ7kyxs4k4od0kZCirF0nBO68XmsFppovdFq11U6UFp+YtynTltx1ONaix+zgsCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:35:40.332878Z","bundle_sha256":"6627dc1c8333059a9e90ad40a7d86b759346fc4fd97945020db99d271431bdb9"}}