{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MFIZAMAX5OJWWYHOXX44PJHHXA","short_pith_number":"pith:MFIZAMAX","schema_version":"1.0","canonical_sha256":"6151903017eb936b60eebdf9c7a4e7b812cc37d20e8a73808a4fe1824b5b4db9","source":{"kind":"arxiv","id":"2507.17211","version":1},"attestation_state":"computed","paper":{"title":"EFS: Evolutionary Factor Searching for Sparse Portfolio Optimization Using Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"q-fin.PM","authors_text":"Chen Liu, Haochen Luo, Yuan Zhang","submitted_at":"2025-07-23T05:07:54Z","abstract_excerpt":"Sparse portfolio optimization is a fundamental yet challenging problem in quantitative finance, since traditional approaches heavily relying on historical return statistics and static objectives can hardly adapt to dynamic market regimes. To address this issue, we propose Evolutionary Factor Search (EFS), a novel framework that leverages large language models (LLMs) to automate the generation and evolution of alpha factors for sparse portfolio construction. By reformulating the asset selection problem as a top-m ranking task guided by LLM-generated factors, EFS incorporates an evolutionary fee"},"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":"2507.17211","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"q-fin.PM","submitted_at":"2025-07-23T05:07:54Z","cross_cats_sorted":[],"title_canon_sha256":"66905d6cc2d369b7814145b2827f0012e31b8fc1fb55d426b90e708038b77aae","abstract_canon_sha256":"520b9a328de76db7a2f4f1b5672e9d899ce4a03d9d6773ded591a9178c4903bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:42:03.498701Z","signature_b64":"9VHH5y/I4ADESdPSJm/q+IYFh4nrkFwOwdz8+a4rFSPTJV1D0d+bgTUnLs37AMzeKVCxFriTggsEbTf1iRsEAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6151903017eb936b60eebdf9c7a4e7b812cc37d20e8a73808a4fe1824b5b4db9","last_reissued_at":"2026-07-05T11:42:03.498167Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:42:03.498167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"EFS: Evolutionary Factor Searching for Sparse Portfolio Optimization Using Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"q-fin.PM","authors_text":"Chen Liu, Haochen Luo, Yuan Zhang","submitted_at":"2025-07-23T05:07:54Z","abstract_excerpt":"Sparse portfolio optimization is a fundamental yet challenging problem in quantitative finance, since traditional approaches heavily relying on historical return statistics and static objectives can hardly adapt to dynamic market regimes. To address this issue, we propose Evolutionary Factor Search (EFS), a novel framework that leverages large language models (LLMs) to automate the generation and evolution of alpha factors for sparse portfolio construction. By reformulating the asset selection problem as a top-m ranking task guided by LLM-generated factors, EFS incorporates an evolutionary fee"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.17211","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.17211/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":"2507.17211","created_at":"2026-07-05T11:42:03.498246+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.17211v1","created_at":"2026-07-05T11:42:03.498246+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.17211","created_at":"2026-07-05T11:42:03.498246+00:00"},{"alias_kind":"pith_short_12","alias_value":"MFIZAMAX5OJW","created_at":"2026-07-05T11:42:03.498246+00:00"},{"alias_kind":"pith_short_16","alias_value":"MFIZAMAX5OJWWYHO","created_at":"2026-07-05T11:42:03.498246+00:00"},{"alias_kind":"pith_short_8","alias_value":"MFIZAMAX","created_at":"2026-07-05T11:42:03.498246+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.20625","citing_title":"AlphaMemo: Structured Search-Process Memory for Self-Evolving Alpha Mining Agents","ref_index":52,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MFIZAMAX5OJWWYHOXX44PJHHXA","json":"https://pith.science/pith/MFIZAMAX5OJWWYHOXX44PJHHXA.json","graph_json":"https://pith.science/api/pith-number/MFIZAMAX5OJWWYHOXX44PJHHXA/graph.json","events_json":"https://pith.science/api/pith-number/MFIZAMAX5OJWWYHOXX44PJHHXA/events.json","paper":"https://pith.science/paper/MFIZAMAX"},"agent_actions":{"view_html":"https://pith.science/pith/MFIZAMAX5OJWWYHOXX44PJHHXA","download_json":"https://pith.science/pith/MFIZAMAX5OJWWYHOXX44PJHHXA.json","view_paper":"https://pith.science/paper/MFIZAMAX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.17211&json=true","fetch_graph":"https://pith.science/api/pith-number/MFIZAMAX5OJWWYHOXX44PJHHXA/graph.json","fetch_events":"https://pith.science/api/pith-number/MFIZAMAX5OJWWYHOXX44PJHHXA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MFIZAMAX5OJWWYHOXX44PJHHXA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MFIZAMAX5OJWWYHOXX44PJHHXA/action/storage_attestation","attest_author":"https://pith.science/pith/MFIZAMAX5OJWWYHOXX44PJHHXA/action/author_attestation","sign_citation":"https://pith.science/pith/MFIZAMAX5OJWWYHOXX44PJHHXA/action/citation_signature","submit_replication":"https://pith.science/pith/MFIZAMAX5OJWWYHOXX44PJHHXA/action/replication_record"}},"created_at":"2026-07-05T11:42:03.498246+00:00","updated_at":"2026-07-05T11:42:03.498246+00:00"}