{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:K3TAOS7URUHFPYXLH3NDUTSPI6","short_pith_number":"pith:K3TAOS7U","schema_version":"1.0","canonical_sha256":"56e6074bf48d0e57e2eb3eda3a4e4f47a9789fc3382c500a537de8e9042b96a5","source":{"kind":"arxiv","id":"1901.01855","version":2},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.01855","created_at":"2026-05-17T23:53:49.705183+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.01855v2","created_at":"2026-05-17T23:53:49.705183+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01855","created_at":"2026-05-17T23:53:49.705183+00:00"},{"alias_kind":"pith_short_12","alias_value":"K3TAOS7URUHF","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"K3TAOS7URUHFPYXL","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"K3TAOS7U","created_at":"2026-05-18T12:33:21.387695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K3TAOS7URUHFPYXLH3NDUTSPI6","json":"https://pith.science/pith/K3TAOS7URUHFPYXLH3NDUTSPI6.json","graph_json":"https://pith.science/api/pith-number/K3TAOS7URUHFPYXLH3NDUTSPI6/graph.json","events_json":"https://pith.science/api/pith-number/K3TAOS7URUHFPYXLH3NDUTSPI6/events.json","paper":"https://pith.science/paper/K3TAOS7U"},"agent_actions":{"view_html":"https://pith.science/pith/K3TAOS7URUHFPYXLH3NDUTSPI6","download_json":"https://pith.science/pith/K3TAOS7URUHFPYXLH3NDUTSPI6.json","view_paper":"https://pith.science/paper/K3TAOS7U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.01855&json=true","fetch_graph":"https://pith.science/api/pith-number/K3TAOS7URUHFPYXLH3NDUTSPI6/graph.json","fetch_events":"https://pith.science/api/pith-number/K3TAOS7URUHFPYXLH3NDUTSPI6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K3TAOS7URUHFPYXLH3NDUTSPI6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K3TAOS7URUHFPYXLH3NDUTSPI6/action/storage_attestation","attest_author":"https://pith.science/pith/K3TAOS7URUHFPYXLH3NDUTSPI6/action/author_attestation","sign_citation":"https://pith.science/pith/K3TAOS7URUHFPYXLH3NDUTSPI6/action/citation_signature","submit_replication":"https://pith.science/pith/K3TAOS7URUHFPYXLH3NDUTSPI6/action/replication_record"}},"created_at":"2026-05-17T23:53:49.705183+00:00","updated_at":"2026-05-17T23:53:49.705183+00:00"}