{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:K3TAOS7URUHFPYXLH3NDUTSPI6","short_pith_number":"pith:K3TAOS7U","canonical_record":{"source":{"id":"1901.01855","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-07T14:59:15Z","cross_cats_sorted":[],"title_canon_sha256":"3b32b9a48de489c09f31f3b3c6d8748eab256c3f476fbe5a6327ff9b16fe3fd4","abstract_canon_sha256":"934bf14c1e5b7e7faeadb29ced86d6d36709d8364b7b881663ed7299bf3134f9"},"schema_version":"1.0"},"canonical_sha256":"56e6074bf48d0e57e2eb3eda3a4e4f47a9789fc3382c500a537de8e9042b96a5","source":{"kind":"arxiv","id":"1901.01855","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.01855","created_at":"2026-05-17T23:53:49Z"},{"alias_kind":"arxiv_version","alias_value":"1901.01855v2","created_at":"2026-05-17T23:53:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01855","created_at":"2026-05-17T23:53:49Z"},{"alias_kind":"pith_short_12","alias_value":"K3TAOS7URUHF","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"K3TAOS7URUHFPYXL","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"K3TAOS7U","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:K3TAOS7URUHFPYXLH3NDUTSPI6","target":"record","payload":{"canonical_record":{"source":{"id":"1901.01855","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-07T14:59:15Z","cross_cats_sorted":[],"title_canon_sha256":"3b32b9a48de489c09f31f3b3c6d8748eab256c3f476fbe5a6327ff9b16fe3fd4","abstract_canon_sha256":"934bf14c1e5b7e7faeadb29ced86d6d36709d8364b7b881663ed7299bf3134f9"},"schema_version":"1.0"},"canonical_sha256":"56e6074bf48d0e57e2eb3eda3a4e4f47a9789fc3382c500a537de8e9042b96a5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:49.705772Z","signature_b64":"iFrs9flTC+F6frxqbk0rHE9DLhAVwaEp1D6GsmtTY7wnv9N1wbSsKgXY6I1vrNWSnEGmgeQ6/NXWMs9ibrOnCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56e6074bf48d0e57e2eb3eda3a4e4f47a9789fc3382c500a537de8e9042b96a5","last_reissued_at":"2026-05-17T23:53:49.705090Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:49.705090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.01855","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-17T23:53:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mun7l2jZHppYa+VvF/Zpbau2jnOJBUN/qX1UivvHnnNudO6v/negsLm5l/A3B8qyQkl/mIrRxAPC4qfV1LDLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T17:26:31.712868Z"},"content_sha256":"56ba276a4c6a302f362ae6c377be606107caa974be40902f717b9198092520b9","schema_version":"1.0","event_id":"sha256:56ba276a4c6a302f362ae6c377be606107caa974be40902f717b9198092520b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:K3TAOS7URUHFPYXLH3NDUTSPI6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A* Tree Search for Portfolio Management","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Lei Xu, Shikui Tu, Xiaojie Gao","submitted_at":"2019-01-07T14:59:15Z","abstract_excerpt":"We propose a planning-based method to teach an agent to manage portfolio from scratch. Our approach combines deep reinforcement learning techniques with search techniques like AlphaGo. By uniting the advantages in A* search algorithm with Monte Carlo tree search, we come up with a new algorithm named A* tree search in which best information is returned to guide next search. Also, the expansion mode of Monte Carlo tree is improved for a higher utilization of the neural network. The suggested algorithm can also optimize non-differentiable utility function by combinatorial search. This technique "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01855","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-17T23:53:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AY4zgyfymlwNnO7daWdPyPImy/DkLd/j0w24lor4oLwXSD3F85zcYWhPU/+oOkoJKOLVYVqOOsCQHsSMI18FBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T17:26:31.713207Z"},"content_sha256":"b0e601f06d6592371ba464a9a5d93ed0c46e600ac390583019a45154ff1e6e74","schema_version":"1.0","event_id":"sha256:b0e601f06d6592371ba464a9a5d93ed0c46e600ac390583019a45154ff1e6e74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K3TAOS7URUHFPYXLH3NDUTSPI6/bundle.json","state_url":"https://pith.science/pith/K3TAOS7URUHFPYXLH3NDUTSPI6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K3TAOS7URUHFPYXLH3NDUTSPI6/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-07-06T17:26:31Z","links":{"resolver":"https://pith.science/pith/K3TAOS7URUHFPYXLH3NDUTSPI6","bundle":"https://pith.science/pith/K3TAOS7URUHFPYXLH3NDUTSPI6/bundle.json","state":"https://pith.science/pith/K3TAOS7URUHFPYXLH3NDUTSPI6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K3TAOS7URUHFPYXLH3NDUTSPI6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:K3TAOS7URUHFPYXLH3NDUTSPI6","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":"934bf14c1e5b7e7faeadb29ced86d6d36709d8364b7b881663ed7299bf3134f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-07T14:59:15Z","title_canon_sha256":"3b32b9a48de489c09f31f3b3c6d8748eab256c3f476fbe5a6327ff9b16fe3fd4"},"schema_version":"1.0","source":{"id":"1901.01855","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.01855","created_at":"2026-05-17T23:53:49Z"},{"alias_kind":"arxiv_version","alias_value":"1901.01855v2","created_at":"2026-05-17T23:53:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01855","created_at":"2026-05-17T23:53:49Z"},{"alias_kind":"pith_short_12","alias_value":"K3TAOS7URUHF","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"K3TAOS7URUHFPYXL","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"K3TAOS7U","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:b0e601f06d6592371ba464a9a5d93ed0c46e600ac390583019a45154ff1e6e74","target":"graph","created_at":"2026-05-17T23:53:49Z","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 propose a planning-based method to teach an agent to manage portfolio from scratch. Our approach combines deep reinforcement learning techniques with search techniques like AlphaGo. By uniting the advantages in A* search algorithm with Monte Carlo tree search, we come up with a new algorithm named A* tree search in which best information is returned to guide next search. Also, the expansion mode of Monte Carlo tree is improved for a higher utilization of the neural network. The suggested algorithm can also optimize non-differentiable utility function by combinatorial search. This technique ","authors_text":"Lei Xu, Shikui Tu, Xiaojie Gao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-07T14:59:15Z","title":"A* Tree Search for Portfolio Management"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01855","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:56ba276a4c6a302f362ae6c377be606107caa974be40902f717b9198092520b9","target":"record","created_at":"2026-05-17T23:53:49Z","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":"934bf14c1e5b7e7faeadb29ced86d6d36709d8364b7b881663ed7299bf3134f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-07T14:59:15Z","title_canon_sha256":"3b32b9a48de489c09f31f3b3c6d8748eab256c3f476fbe5a6327ff9b16fe3fd4"},"schema_version":"1.0","source":{"id":"1901.01855","kind":"arxiv","version":2}},"canonical_sha256":"56e6074bf48d0e57e2eb3eda3a4e4f47a9789fc3382c500a537de8e9042b96a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56e6074bf48d0e57e2eb3eda3a4e4f47a9789fc3382c500a537de8e9042b96a5","first_computed_at":"2026-05-17T23:53:49.705090Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:49.705090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iFrs9flTC+F6frxqbk0rHE9DLhAVwaEp1D6GsmtTY7wnv9N1wbSsKgXY6I1vrNWSnEGmgeQ6/NXWMs9ibrOnCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:49.705772Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.01855","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56ba276a4c6a302f362ae6c377be606107caa974be40902f717b9198092520b9","sha256:b0e601f06d6592371ba464a9a5d93ed0c46e600ac390583019a45154ff1e6e74"],"state_sha256":"e24c46a54a6b3932d378e6488395b1762c76180708f48a8d46899bc6248b3e08"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q2G+w8UiEGJuFkjbDmBg/+vMpVA/WoxSptH4isBrPPFg/y/Zkf3ogSQnPWK6gdiAHmKETxV2GfgY+1aXnbG5AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T17:26:31.715126Z","bundle_sha256":"6f83b1b66da0b7be5786fe5212922e1d12d961a7477e61b4c4356882730c581a"}}