{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:O3EK5MPYHXOGE6MC47UKFUEOGT","short_pith_number":"pith:O3EK5MPY","schema_version":"1.0","canonical_sha256":"76c8aeb1f83ddc627982e7e8a2d08e34cec839f7b517440f9cd6eca33f2821f3","source":{"kind":"arxiv","id":"2406.16505","version":2},"attestation_state":"computed","paper":{"title":"$\\text{Alpha}^2$: Discovering Logical Formulaic Alphas using Deep Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"q-fin.CP","authors_text":"Feng Xu, Shengyi Jiang, Tianyuan Liu, Xinyu Zhang, Yan Yin, Zongzhang Zhang","submitted_at":"2024-06-24T10:21:29Z","abstract_excerpt":"Alphas are pivotal in providing signals for quantitative trading. The industry highly values the discovery of formulaic alphas for their interpretability and ease of analysis, compared with the expressive yet overfitting-prone black-box alphas. In this work, we focus on discovering formulaic alphas. Prior studies on automatically generating a collection of formulaic alphas were mostly based on genetic programming (GP), which is known to suffer from the problems of being sensitive to the initial population, converting to local optima, and slow computation speed. Recent efforts employing deep re"},"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":"2406.16505","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2024-06-24T10:21:29Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"025bc494271174012ffe7309278d71715068fea5c40a3c8ebe06dcf22a958716","abstract_canon_sha256":"b79d632dd3bcb784fabb4a6185e8e573e5aeaa7c6ab0c82c627417eb079f02dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:36:49.033640Z","signature_b64":"PH3EdcynvRn287gUZ1KBwl17jm094/tPhRZ4yXkRdshDqDAGmOpqkl+jxKeHOKwDe+ylSJSh+jhnSS/PW5rJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76c8aeb1f83ddc627982e7e8a2d08e34cec839f7b517440f9cd6eca33f2821f3","last_reissued_at":"2026-07-05T08:36:49.033091Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:36:49.033091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$\\text{Alpha}^2$: Discovering Logical Formulaic Alphas using Deep Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"q-fin.CP","authors_text":"Feng Xu, Shengyi Jiang, Tianyuan Liu, Xinyu Zhang, Yan Yin, Zongzhang Zhang","submitted_at":"2024-06-24T10:21:29Z","abstract_excerpt":"Alphas are pivotal in providing signals for quantitative trading. The industry highly values the discovery of formulaic alphas for their interpretability and ease of analysis, compared with the expressive yet overfitting-prone black-box alphas. In this work, we focus on discovering formulaic alphas. Prior studies on automatically generating a collection of formulaic alphas were mostly based on genetic programming (GP), which is known to suffer from the problems of being sensitive to the initial population, converting to local optima, and slow computation speed. Recent efforts employing deep re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.16505","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.16505/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2406.16505","created_at":"2026-07-05T08:36:49.033159+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.16505v2","created_at":"2026-07-05T08:36:49.033159+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.16505","created_at":"2026-07-05T08:36:49.033159+00:00"},{"alias_kind":"pith_short_12","alias_value":"O3EK5MPYHXOG","created_at":"2026-07-05T08:36:49.033159+00:00"},{"alias_kind":"pith_short_16","alias_value":"O3EK5MPYHXOGE6MC","created_at":"2026-07-05T08:36:49.033159+00:00"},{"alias_kind":"pith_short_8","alias_value":"O3EK5MPY","created_at":"2026-07-05T08:36:49.033159+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.25055","citing_title":"AlphaSAGE: Structure-Aware Alpha Mining via GFlowNets for Robust Exploration","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15412","citing_title":"From Feedback Loops to Policy Updates: Reinforcement Fine-Tuning for LLM-Based Alpha Factor Discovery","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O3EK5MPYHXOGE6MC47UKFUEOGT","json":"https://pith.science/pith/O3EK5MPYHXOGE6MC47UKFUEOGT.json","graph_json":"https://pith.science/api/pith-number/O3EK5MPYHXOGE6MC47UKFUEOGT/graph.json","events_json":"https://pith.science/api/pith-number/O3EK5MPYHXOGE6MC47UKFUEOGT/events.json","paper":"https://pith.science/paper/O3EK5MPY"},"agent_actions":{"view_html":"https://pith.science/pith/O3EK5MPYHXOGE6MC47UKFUEOGT","download_json":"https://pith.science/pith/O3EK5MPYHXOGE6MC47UKFUEOGT.json","view_paper":"https://pith.science/paper/O3EK5MPY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.16505&json=true","fetch_graph":"https://pith.science/api/pith-number/O3EK5MPYHXOGE6MC47UKFUEOGT/graph.json","fetch_events":"https://pith.science/api/pith-number/O3EK5MPYHXOGE6MC47UKFUEOGT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O3EK5MPYHXOGE6MC47UKFUEOGT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O3EK5MPYHXOGE6MC47UKFUEOGT/action/storage_attestation","attest_author":"https://pith.science/pith/O3EK5MPYHXOGE6MC47UKFUEOGT/action/author_attestation","sign_citation":"https://pith.science/pith/O3EK5MPYHXOGE6MC47UKFUEOGT/action/citation_signature","submit_replication":"https://pith.science/pith/O3EK5MPYHXOGE6MC47UKFUEOGT/action/replication_record"}},"created_at":"2026-07-05T08:36:49.033159+00:00","updated_at":"2026-07-05T08:36:49.033159+00:00"}