{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UJL4CV26LATJEOOIC5GHM5ARNZ","short_pith_number":"pith:UJL4CV26","canonical_record":{"source":{"id":"1501.00293","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-01T17:42:16Z","cross_cats_sorted":[],"title_canon_sha256":"d07ca97b5460f4035f87aaf20b1ac766200cf5e98e82ac26e381d03ae105d7cd","abstract_canon_sha256":"f5dbe8f06b50a89c192e9fcca02b30ce94ef22b4b0f750832794f3426181e590"},"schema_version":"1.0"},"canonical_sha256":"a257c1575e58269239c8174c7674116e421f5430dec1ea14e44ff5cffdfefc52","source":{"kind":"arxiv","id":"1501.00293","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00293","created_at":"2026-05-18T01:33:24Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00293v2","created_at":"2026-05-18T01:33:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00293","created_at":"2026-05-18T01:33:24Z"},{"alias_kind":"pith_short_12","alias_value":"UJL4CV26LATJ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UJL4CV26LATJEOOI","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UJL4CV26","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UJL4CV26LATJEOOIC5GHM5ARNZ","target":"record","payload":{"canonical_record":{"source":{"id":"1501.00293","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-01T17:42:16Z","cross_cats_sorted":[],"title_canon_sha256":"d07ca97b5460f4035f87aaf20b1ac766200cf5e98e82ac26e381d03ae105d7cd","abstract_canon_sha256":"f5dbe8f06b50a89c192e9fcca02b30ce94ef22b4b0f750832794f3426181e590"},"schema_version":"1.0"},"canonical_sha256":"a257c1575e58269239c8174c7674116e421f5430dec1ea14e44ff5cffdfefc52","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:24.239207Z","signature_b64":"qKO14Wc60JVeDtnznutXOPaFbAWBjnwDj0BFV+iSdv2oAD69hQduFAx2WBVbTrXZiHqSxVYDtgb5VAM7yZ0FAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a257c1575e58269239c8174c7674116e421f5430dec1ea14e44ff5cffdfefc52","last_reissued_at":"2026-05-18T01:33:24.238729Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:24.238729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.00293","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-18T01:33:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A0PnTgcCzo+5ucBygvT/asyBFogKTAc+IEygWPlBZuYFRW+80AS5S8ftAlKojAvSq0AfgjuRZnfPw+vmlTVDBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T11:00:25.638380Z"},"content_sha256":"9b342b8bd3cd6eb2d7fdc5b8a466a585eb3bf20508709a4eba733438579aab37","schema_version":"1.0","event_id":"sha256:9b342b8bd3cd6eb2d7fdc5b8a466a585eb3bf20508709a4eba733438579aab37"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UJL4CV26LATJEOOIC5GHM5ARNZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Continuous-time limit of dynamic games with incomplete information and a more informed player","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Fabien Gensbittel (GREMAQ)","submitted_at":"2015-01-01T17:42:16Z","abstract_excerpt":"We study a two-player, zero-sum, dynamic game with incomplete information where one of the players is more informed than his opponent. We analyze the limit value as the players play more and more frequently. The more informed player observes the realization of a Markov process (X,Y) on which the payoffs depend, while the less informed player only observes Y and his opponent's actions. We show the existence of a limit value as the time span between two consecutive stages goes to zero. This value is characterized through an auxiliary optimization problem and as the unique viscosity solution of a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00293","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-18T01:33:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P/ZZXDkeRzRt3MNCFe5LkVIz6qzLfms9OgDtLvoH4QQXoQxbvHRlfmjWcK3jqFOKQ3PGNuHo3FjbYVJrRhlJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T11:00:25.638725Z"},"content_sha256":"b825c93fb1fddf18bc8686f48d3cb5d1f7bf282cb620662be87b599b376b4902","schema_version":"1.0","event_id":"sha256:b825c93fb1fddf18bc8686f48d3cb5d1f7bf282cb620662be87b599b376b4902"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UJL4CV26LATJEOOIC5GHM5ARNZ/bundle.json","state_url":"https://pith.science/pith/UJL4CV26LATJEOOIC5GHM5ARNZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UJL4CV26LATJEOOIC5GHM5ARNZ/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-26T11:00:25Z","links":{"resolver":"https://pith.science/pith/UJL4CV26LATJEOOIC5GHM5ARNZ","bundle":"https://pith.science/pith/UJL4CV26LATJEOOIC5GHM5ARNZ/bundle.json","state":"https://pith.science/pith/UJL4CV26LATJEOOIC5GHM5ARNZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UJL4CV26LATJEOOIC5GHM5ARNZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UJL4CV26LATJEOOIC5GHM5ARNZ","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":"f5dbe8f06b50a89c192e9fcca02b30ce94ef22b4b0f750832794f3426181e590","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-01T17:42:16Z","title_canon_sha256":"d07ca97b5460f4035f87aaf20b1ac766200cf5e98e82ac26e381d03ae105d7cd"},"schema_version":"1.0","source":{"id":"1501.00293","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00293","created_at":"2026-05-18T01:33:24Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00293v2","created_at":"2026-05-18T01:33:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00293","created_at":"2026-05-18T01:33:24Z"},{"alias_kind":"pith_short_12","alias_value":"UJL4CV26LATJ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UJL4CV26LATJEOOI","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UJL4CV26","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:b825c93fb1fddf18bc8686f48d3cb5d1f7bf282cb620662be87b599b376b4902","target":"graph","created_at":"2026-05-18T01:33:24Z","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 study a two-player, zero-sum, dynamic game with incomplete information where one of the players is more informed than his opponent. We analyze the limit value as the players play more and more frequently. The more informed player observes the realization of a Markov process (X,Y) on which the payoffs depend, while the less informed player only observes Y and his opponent's actions. We show the existence of a limit value as the time span between two consecutive stages goes to zero. This value is characterized through an auxiliary optimization problem and as the unique viscosity solution of a","authors_text":"Fabien Gensbittel (GREMAQ)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-01T17:42:16Z","title":"Continuous-time limit of dynamic games with incomplete information and a more informed player"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00293","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:9b342b8bd3cd6eb2d7fdc5b8a466a585eb3bf20508709a4eba733438579aab37","target":"record","created_at":"2026-05-18T01:33:24Z","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":"f5dbe8f06b50a89c192e9fcca02b30ce94ef22b4b0f750832794f3426181e590","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-01T17:42:16Z","title_canon_sha256":"d07ca97b5460f4035f87aaf20b1ac766200cf5e98e82ac26e381d03ae105d7cd"},"schema_version":"1.0","source":{"id":"1501.00293","kind":"arxiv","version":2}},"canonical_sha256":"a257c1575e58269239c8174c7674116e421f5430dec1ea14e44ff5cffdfefc52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a257c1575e58269239c8174c7674116e421f5430dec1ea14e44ff5cffdfefc52","first_computed_at":"2026-05-18T01:33:24.238729Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:24.238729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qKO14Wc60JVeDtnznutXOPaFbAWBjnwDj0BFV+iSdv2oAD69hQduFAx2WBVbTrXZiHqSxVYDtgb5VAM7yZ0FAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:24.239207Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.00293","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b342b8bd3cd6eb2d7fdc5b8a466a585eb3bf20508709a4eba733438579aab37","sha256:b825c93fb1fddf18bc8686f48d3cb5d1f7bf282cb620662be87b599b376b4902"],"state_sha256":"d870551ef731e31563ea728ebbb739b906df4ccaaa874b2d2de7161f66c2ecd2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ws1+ShrEOVs3Xt4/Zg5S2b1dOQ2AdT0pmWHl8Ccx2uMHpZySd8pZMg2rtptRUT1dX4IZ9tA63M2Fh3m4IN1tCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T11:00:25.640584Z","bundle_sha256":"5c83619acf53c0503462b0b084064e5003c255a04cb42beba2d7284b366048b8"}}