{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:RQZALTNGMDXCYHKR5GETS7KDPS","short_pith_number":"pith:RQZALTNG","canonical_record":{"source":{"id":"1110.5886","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-09-29T18:51:28Z","cross_cats_sorted":[],"title_canon_sha256":"1ea567372c2802b7c430c434dc120966288bcc65dd7426e3ce661695a145ed5a","abstract_canon_sha256":"e756a019df88468363fa6ec9f9585d1d191fa8c04427cd02ed260e0c13a52621"},"schema_version":"1.0"},"canonical_sha256":"8c3205cda660ee2c1d51e989397d437c89506f0e7ee6dd67303413e74707f58d","source":{"kind":"arxiv","id":"1110.5886","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.5886","created_at":"2026-05-18T04:10:11Z"},{"alias_kind":"arxiv_version","alias_value":"1110.5886v1","created_at":"2026-05-18T04:10:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5886","created_at":"2026-05-18T04:10:11Z"},{"alias_kind":"pith_short_12","alias_value":"RQZALTNGMDXC","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RQZALTNGMDXCYHKR","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RQZALTNG","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:RQZALTNGMDXCYHKR5GETS7KDPS","target":"record","payload":{"canonical_record":{"source":{"id":"1110.5886","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-09-29T18:51:28Z","cross_cats_sorted":[],"title_canon_sha256":"1ea567372c2802b7c430c434dc120966288bcc65dd7426e3ce661695a145ed5a","abstract_canon_sha256":"e756a019df88468363fa6ec9f9585d1d191fa8c04427cd02ed260e0c13a52621"},"schema_version":"1.0"},"canonical_sha256":"8c3205cda660ee2c1d51e989397d437c89506f0e7ee6dd67303413e74707f58d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:11.004565Z","signature_b64":"JkZbOQZXuTU55y6hcHs+kcz1mi2obpt3f9cjuB63XwfJgrF63UXj3SigBBObNeQdCpvA2KKdTlBSOYI0EB0KDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c3205cda660ee2c1d51e989397d437c89506f0e7ee6dd67303413e74707f58d","last_reissued_at":"2026-05-18T04:10:11.003719Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:11.003719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.5886","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-18T04:10:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FWa7ns6DQ1wNXtqF6aQrLy3MRE15mvEK7BjL1DTywytUpKQc3sfUecn/5XkjPT+9pE7ufMgosWkEh4TEFVVFAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:47:27.574270Z"},"content_sha256":"eae5be4d5cfd92ed68cad5a11c9a21fb365f1ec2741534aeebd4dff17a0c9d2d","schema_version":"1.0","event_id":"sha256:eae5be4d5cfd92ed68cad5a11c9a21fb365f1ec2741534aeebd4dff17a0c9d2d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:RQZALTNGMDXCYHKR5GETS7KDPS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Continuation Method for Nash Equilibria in Structured Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"B. Blum, C. R. Shelton, D. Koller","submitted_at":"2011-09-29T18:51:28Z","abstract_excerpt":"Structured game representations have recently attracted interest as models for multi-agent artificial intelligence scenarios, with rational behavior most commonly characterized by Nash equilibria.  This paper presents efficient, exact algorithms for computing Nash equilibria in structured game representations, including both graphical games and multi-agent influence diagrams (MAIDs).  The algorithms are derived from a continuation method for normal-form and extensive-form games due to Govindan and Wilson; they follow a trajectory through a space of perturbed games and their equilibria, exploit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5886","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-18T04:10:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iN+1QhppBBBL6m9IfX/dO6e8rDI4L3vJacxakQJl9IA9dasBZ2i3+D3UQafQ+l764SZnalZsK80Rnz9AANAyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:47:27.574644Z"},"content_sha256":"340e9d2404f2f4ccfeeaae50e8c5619c4c443394ae33858a5f64a24346294e47","schema_version":"1.0","event_id":"sha256:340e9d2404f2f4ccfeeaae50e8c5619c4c443394ae33858a5f64a24346294e47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RQZALTNGMDXCYHKR5GETS7KDPS/bundle.json","state_url":"https://pith.science/pith/RQZALTNGMDXCYHKR5GETS7KDPS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RQZALTNGMDXCYHKR5GETS7KDPS/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-08T23:47:27Z","links":{"resolver":"https://pith.science/pith/RQZALTNGMDXCYHKR5GETS7KDPS","bundle":"https://pith.science/pith/RQZALTNGMDXCYHKR5GETS7KDPS/bundle.json","state":"https://pith.science/pith/RQZALTNGMDXCYHKR5GETS7KDPS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RQZALTNGMDXCYHKR5GETS7KDPS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:RQZALTNGMDXCYHKR5GETS7KDPS","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":"e756a019df88468363fa6ec9f9585d1d191fa8c04427cd02ed260e0c13a52621","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-09-29T18:51:28Z","title_canon_sha256":"1ea567372c2802b7c430c434dc120966288bcc65dd7426e3ce661695a145ed5a"},"schema_version":"1.0","source":{"id":"1110.5886","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.5886","created_at":"2026-05-18T04:10:11Z"},{"alias_kind":"arxiv_version","alias_value":"1110.5886v1","created_at":"2026-05-18T04:10:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5886","created_at":"2026-05-18T04:10:11Z"},{"alias_kind":"pith_short_12","alias_value":"RQZALTNGMDXC","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RQZALTNGMDXCYHKR","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RQZALTNG","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:340e9d2404f2f4ccfeeaae50e8c5619c4c443394ae33858a5f64a24346294e47","target":"graph","created_at":"2026-05-18T04:10:11Z","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":"Structured game representations have recently attracted interest as models for multi-agent artificial intelligence scenarios, with rational behavior most commonly characterized by Nash equilibria.  This paper presents efficient, exact algorithms for computing Nash equilibria in structured game representations, including both graphical games and multi-agent influence diagrams (MAIDs).  The algorithms are derived from a continuation method for normal-form and extensive-form games due to Govindan and Wilson; they follow a trajectory through a space of perturbed games and their equilibria, exploit","authors_text":"B. Blum, C. R. Shelton, D. Koller","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-09-29T18:51:28Z","title":"A Continuation Method for Nash Equilibria in Structured Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5886","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:eae5be4d5cfd92ed68cad5a11c9a21fb365f1ec2741534aeebd4dff17a0c9d2d","target":"record","created_at":"2026-05-18T04:10:11Z","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":"e756a019df88468363fa6ec9f9585d1d191fa8c04427cd02ed260e0c13a52621","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-09-29T18:51:28Z","title_canon_sha256":"1ea567372c2802b7c430c434dc120966288bcc65dd7426e3ce661695a145ed5a"},"schema_version":"1.0","source":{"id":"1110.5886","kind":"arxiv","version":1}},"canonical_sha256":"8c3205cda660ee2c1d51e989397d437c89506f0e7ee6dd67303413e74707f58d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c3205cda660ee2c1d51e989397d437c89506f0e7ee6dd67303413e74707f58d","first_computed_at":"2026-05-18T04:10:11.003719Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:10:11.003719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JkZbOQZXuTU55y6hcHs+kcz1mi2obpt3f9cjuB63XwfJgrF63UXj3SigBBObNeQdCpvA2KKdTlBSOYI0EB0KDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:10:11.004565Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.5886","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eae5be4d5cfd92ed68cad5a11c9a21fb365f1ec2741534aeebd4dff17a0c9d2d","sha256:340e9d2404f2f4ccfeeaae50e8c5619c4c443394ae33858a5f64a24346294e47"],"state_sha256":"06f5907a0d1f2f512cbd4d35ce33b23e79894d12a01a14825a33a053fa1882d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c4wH0j+lr6OTXWrNCR0ZKKOPPQ7E2fjYjse2qNRN7LDPtIT9fvAsFAJ64CoHXBfpWJviS6SlQxDsnLYvRK7/DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T23:47:27.576537Z","bundle_sha256":"906449a25addb0c57edab42f486513929322cb5e757a9a3d9990ae96309e2c0c"}}