{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VMARIHFQXISOY7BMIMTFBYJ4EU","short_pith_number":"pith:VMARIHFQ","schema_version":"1.0","canonical_sha256":"ab01141cb0ba24ec7c2c432650e13c25034bd95e097d3bf54b6941cf296a3a86","source":{"kind":"arxiv","id":"1410.5328","version":2},"attestation_state":"computed","paper":{"title":"Portfolio Selection with Multiple Spectral Risk Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"q-fin.PM","authors_text":"Carlos Abad, Garud Iyengar","submitted_at":"2014-10-20T15:53:19Z","abstract_excerpt":"We propose an iterative gradient-based algorithm to efficiently solve the portfolio selection problem with multiple spectral risk constraints. Since the conditional value at risk (CVaR) is a special case of the spectral risk measure, our algorithm solves portfolio selection problems with multiple CVaR constraints. In each step, the algorithm solves very simple separable convex quadratic programs; hence, we show that the spectral risk constrained portfolio selection problem can be solved using the technology developed for solving mean-variance problems. The algorithm extends to the case where t"},"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":"1410.5328","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.PM","submitted_at":"2014-10-20T15:53:19Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"ded5114629e1242c60570cd77a92ad9bc0199160775af69c13e05f9ff579ca42","abstract_canon_sha256":"c9c223e751d47645dd3026d02dd8a91b8a669c696ee318bd42ca84d365dc4b0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:28.627828Z","signature_b64":"yvTHwclHLzX+8DaswiHzl6dW5tTeZnQTHHj/gA/vVArWPxHaXf7j68JD79mOqlRh9laLP3HlK5Lk9QhU29mhDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab01141cb0ba24ec7c2c432650e13c25034bd95e097d3bf54b6941cf296a3a86","last_reissued_at":"2026-05-18T02:20:28.627159Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:28.627159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Portfolio Selection with Multiple Spectral Risk Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"q-fin.PM","authors_text":"Carlos Abad, Garud Iyengar","submitted_at":"2014-10-20T15:53:19Z","abstract_excerpt":"We propose an iterative gradient-based algorithm to efficiently solve the portfolio selection problem with multiple spectral risk constraints. Since the conditional value at risk (CVaR) is a special case of the spectral risk measure, our algorithm solves portfolio selection problems with multiple CVaR constraints. In each step, the algorithm solves very simple separable convex quadratic programs; hence, we show that the spectral risk constrained portfolio selection problem can be solved using the technology developed for solving mean-variance problems. The algorithm extends to the case where t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5328","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":"1410.5328","created_at":"2026-05-18T02:20:28.627254+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.5328v2","created_at":"2026-05-18T02:20:28.627254+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5328","created_at":"2026-05-18T02:20:28.627254+00:00"},{"alias_kind":"pith_short_12","alias_value":"VMARIHFQXISO","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"VMARIHFQXISOY7BM","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"VMARIHFQ","created_at":"2026-05-18T12:28:54.890064+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/VMARIHFQXISOY7BMIMTFBYJ4EU","json":"https://pith.science/pith/VMARIHFQXISOY7BMIMTFBYJ4EU.json","graph_json":"https://pith.science/api/pith-number/VMARIHFQXISOY7BMIMTFBYJ4EU/graph.json","events_json":"https://pith.science/api/pith-number/VMARIHFQXISOY7BMIMTFBYJ4EU/events.json","paper":"https://pith.science/paper/VMARIHFQ"},"agent_actions":{"view_html":"https://pith.science/pith/VMARIHFQXISOY7BMIMTFBYJ4EU","download_json":"https://pith.science/pith/VMARIHFQXISOY7BMIMTFBYJ4EU.json","view_paper":"https://pith.science/paper/VMARIHFQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.5328&json=true","fetch_graph":"https://pith.science/api/pith-number/VMARIHFQXISOY7BMIMTFBYJ4EU/graph.json","fetch_events":"https://pith.science/api/pith-number/VMARIHFQXISOY7BMIMTFBYJ4EU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VMARIHFQXISOY7BMIMTFBYJ4EU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VMARIHFQXISOY7BMIMTFBYJ4EU/action/storage_attestation","attest_author":"https://pith.science/pith/VMARIHFQXISOY7BMIMTFBYJ4EU/action/author_attestation","sign_citation":"https://pith.science/pith/VMARIHFQXISOY7BMIMTFBYJ4EU/action/citation_signature","submit_replication":"https://pith.science/pith/VMARIHFQXISOY7BMIMTFBYJ4EU/action/replication_record"}},"created_at":"2026-05-18T02:20:28.627254+00:00","updated_at":"2026-05-18T02:20:28.627254+00:00"}