{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GLTLNV6ST3WOA5VWXM4MRKM4FH","short_pith_number":"pith:GLTLNV6S","canonical_record":{"source":{"id":"1605.05802","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"q-fin.MF","submitted_at":"2016-05-19T03:52:54Z","cross_cats_sorted":["math.OC","math.PR"],"title_canon_sha256":"4d6b1e1be8b6486be0044325584384728f57cd1f4a0967498742a840adb47386","abstract_canon_sha256":"b30a8ad9b6feb12e171e2c3bffdb42e1aff21569cf58855735dd4a3d40ab0f52"},"schema_version":"1.0"},"canonical_sha256":"32e6b6d7d29eece076b6bb38c8a99c29c82c22ed27ca91c9db6e5e50bcea5a4b","source":{"kind":"arxiv","id":"1605.05802","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05802","created_at":"2026-05-18T01:14:28Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05802v1","created_at":"2026-05-18T01:14:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05802","created_at":"2026-05-18T01:14:28Z"},{"alias_kind":"pith_short_12","alias_value":"GLTLNV6ST3WO","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GLTLNV6ST3WOA5VW","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GLTLNV6S","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GLTLNV6ST3WOA5VWXM4MRKM4FH","target":"record","payload":{"canonical_record":{"source":{"id":"1605.05802","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"q-fin.MF","submitted_at":"2016-05-19T03:52:54Z","cross_cats_sorted":["math.OC","math.PR"],"title_canon_sha256":"4d6b1e1be8b6486be0044325584384728f57cd1f4a0967498742a840adb47386","abstract_canon_sha256":"b30a8ad9b6feb12e171e2c3bffdb42e1aff21569cf58855735dd4a3d40ab0f52"},"schema_version":"1.0"},"canonical_sha256":"32e6b6d7d29eece076b6bb38c8a99c29c82c22ed27ca91c9db6e5e50bcea5a4b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:28.360464Z","signature_b64":"K6TN6mlujs2WdMsY8Ps2ITnjmngA2AGNqWqyZUqOIc09IN6QFLAiYcMLU+rnd+lqYxoY9e9C4FRuVgoIYIAYAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32e6b6d7d29eece076b6bb38c8a99c29c82c22ed27ca91c9db6e5e50bcea5a4b","last_reissued_at":"2026-05-18T01:14:28.359838Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:28.359838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.05802","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-18T01:14:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HutFXxAzFW8Hx2a7GN5blX0ylnBWqFYYg5qOnAmlq0ynxmoGYTBLrrOvjU+O2/otJkqgdL1JJujaN7scW/JYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:17:49.901265Z"},"content_sha256":"7da69b7eef32a37c10c603f58453536114e4af8fa0060210e47c7e4e229cb7d8","schema_version":"1.0","event_id":"sha256:7da69b7eef32a37c10c603f58453536114e4af8fa0060210e47c7e4e229cb7d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GLTLNV6ST3WOA5VWXM4MRKM4FH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recursive utility maximization under partial information","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC","math.PR"],"primary_cat":"q-fin.MF","authors_text":"Shaolin Ji, Xiaomin Shi","submitted_at":"2016-05-19T03:52:54Z","abstract_excerpt":"This paper concerns the recursive utility maximization problem under partial information. We first transform our problem under partial information into the one under full information. When the generator of the recursive utility is concave, we adopt the variational formulation of the recursive utility which leads to a stochastic game problem and a characterization of the saddle point of the game is obtained. Then, we study the K-ignorance case and explicit saddle points of several examples are obtained. At last, when the generator of the recursive utility is smooth, we employ the terminal pertu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05802","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-18T01:14:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FXL56ZdaqjGKx5MaA+Q4usV6GFg2BdwOW71EbBxN2VGXDtzl92qKGBMdPp/xC9Nt0wd2EB2mmqGqT5RIKJPIBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:17:49.901943Z"},"content_sha256":"a991704df1a8f191240f0e68f60b179b73a1a9dae33feec0ce30ba49bbdb525d","schema_version":"1.0","event_id":"sha256:a991704df1a8f191240f0e68f60b179b73a1a9dae33feec0ce30ba49bbdb525d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GLTLNV6ST3WOA5VWXM4MRKM4FH/bundle.json","state_url":"https://pith.science/pith/GLTLNV6ST3WOA5VWXM4MRKM4FH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GLTLNV6ST3WOA5VWXM4MRKM4FH/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-11T11:17:49Z","links":{"resolver":"https://pith.science/pith/GLTLNV6ST3WOA5VWXM4MRKM4FH","bundle":"https://pith.science/pith/GLTLNV6ST3WOA5VWXM4MRKM4FH/bundle.json","state":"https://pith.science/pith/GLTLNV6ST3WOA5VWXM4MRKM4FH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GLTLNV6ST3WOA5VWXM4MRKM4FH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GLTLNV6ST3WOA5VWXM4MRKM4FH","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":"b30a8ad9b6feb12e171e2c3bffdb42e1aff21569cf58855735dd4a3d40ab0f52","cross_cats_sorted":["math.OC","math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"q-fin.MF","submitted_at":"2016-05-19T03:52:54Z","title_canon_sha256":"4d6b1e1be8b6486be0044325584384728f57cd1f4a0967498742a840adb47386"},"schema_version":"1.0","source":{"id":"1605.05802","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05802","created_at":"2026-05-18T01:14:28Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05802v1","created_at":"2026-05-18T01:14:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05802","created_at":"2026-05-18T01:14:28Z"},{"alias_kind":"pith_short_12","alias_value":"GLTLNV6ST3WO","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GLTLNV6ST3WOA5VW","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GLTLNV6S","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:a991704df1a8f191240f0e68f60b179b73a1a9dae33feec0ce30ba49bbdb525d","target":"graph","created_at":"2026-05-18T01:14:28Z","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 concerns the recursive utility maximization problem under partial information. We first transform our problem under partial information into the one under full information. When the generator of the recursive utility is concave, we adopt the variational formulation of the recursive utility which leads to a stochastic game problem and a characterization of the saddle point of the game is obtained. Then, we study the K-ignorance case and explicit saddle points of several examples are obtained. At last, when the generator of the recursive utility is smooth, we employ the terminal pertu","authors_text":"Shaolin Ji, Xiaomin Shi","cross_cats":["math.OC","math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"q-fin.MF","submitted_at":"2016-05-19T03:52:54Z","title":"Recursive utility maximization under partial information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05802","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:7da69b7eef32a37c10c603f58453536114e4af8fa0060210e47c7e4e229cb7d8","target":"record","created_at":"2026-05-18T01:14:28Z","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":"b30a8ad9b6feb12e171e2c3bffdb42e1aff21569cf58855735dd4a3d40ab0f52","cross_cats_sorted":["math.OC","math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"q-fin.MF","submitted_at":"2016-05-19T03:52:54Z","title_canon_sha256":"4d6b1e1be8b6486be0044325584384728f57cd1f4a0967498742a840adb47386"},"schema_version":"1.0","source":{"id":"1605.05802","kind":"arxiv","version":1}},"canonical_sha256":"32e6b6d7d29eece076b6bb38c8a99c29c82c22ed27ca91c9db6e5e50bcea5a4b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32e6b6d7d29eece076b6bb38c8a99c29c82c22ed27ca91c9db6e5e50bcea5a4b","first_computed_at":"2026-05-18T01:14:28.359838Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:28.359838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K6TN6mlujs2WdMsY8Ps2ITnjmngA2AGNqWqyZUqOIc09IN6QFLAiYcMLU+rnd+lqYxoY9e9C4FRuVgoIYIAYAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:28.360464Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.05802","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7da69b7eef32a37c10c603f58453536114e4af8fa0060210e47c7e4e229cb7d8","sha256:a991704df1a8f191240f0e68f60b179b73a1a9dae33feec0ce30ba49bbdb525d"],"state_sha256":"7e59ee288269e82a51465858a1db5d9632cb426a08134037a6cc25930e7b7760"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Zcw2MV8YD2nW5qzTrtC5+0yQN6mNA+O6NkYxIWFXkG9KAc2TIBoZKCyLcKgRsCGixEoO6/m3Nid4aeK1NzUDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T11:17:49.905768Z","bundle_sha256":"d0a90c1983cc74d6640a78c9313fe5d9e743b25856e81e5c3b8169b7338d55ed"}}