{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:OSCIV7Q7KEPEAM3X65LUROIMEE","short_pith_number":"pith:OSCIV7Q7","schema_version":"1.0","canonical_sha256":"74848afe1f511e403377f75748b90c2107047a1870b386da6d033271b4d2ce34","source":{"kind":"arxiv","id":"2505.10099","version":1},"attestation_state":"computed","paper":{"title":"A Scalable Gradient-Based Optimization Framework for Sparse Minimum-Variance Portfolio Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","q-fin.PM"],"primary_cat":"stat.ML","authors_text":"Matias Quiroz, Samuel Muller, Sarat Moka, Vali Asimit","submitted_at":"2025-05-15T09:01:07Z","abstract_excerpt":"Portfolio optimization involves selecting asset weights to minimize a risk-reward objective, such as the portfolio variance in the classical minimum-variance framework. Sparse portfolio selection extends this by imposing a cardinality constraint: only $k$ assets from a universe of $p$ may be included. The standard approach models this problem as a mixed-integer quadratic program and relies on commercial solvers to find the optimal solution. However, the computational costs of such methods increase exponentially with $k$ and $p$, making them too slow for problems of even moderate size. We propo"},"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":"2505.10099","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2025-05-15T09:01:07Z","cross_cats_sorted":["cs.LG","math.OC","q-fin.PM"],"title_canon_sha256":"c24dfb3d56c551c13b9dcf3fa3dddf0593570d3f287deffc600d8581ee267db6","abstract_canon_sha256":"03f49c29626a58d7f5763bb02ff0d725a0f79aed0850aa90551e5fc8aca6a8ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:03:33.250272Z","signature_b64":"xDR5JxU/dLK8CjgQLuj8ZTzT5UyeLXGSHE2PNwaRSW5s0v3LSVcDYP50QvEf019fJJFB22FYN/f2fSOt2Zd3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74848afe1f511e403377f75748b90c2107047a1870b386da6d033271b4d2ce34","last_reissued_at":"2026-07-05T11:03:33.249816Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:03:33.249816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Scalable Gradient-Based Optimization Framework for Sparse Minimum-Variance Portfolio Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","q-fin.PM"],"primary_cat":"stat.ML","authors_text":"Matias Quiroz, Samuel Muller, Sarat Moka, Vali Asimit","submitted_at":"2025-05-15T09:01:07Z","abstract_excerpt":"Portfolio optimization involves selecting asset weights to minimize a risk-reward objective, such as the portfolio variance in the classical minimum-variance framework. Sparse portfolio selection extends this by imposing a cardinality constraint: only $k$ assets from a universe of $p$ may be included. The standard approach models this problem as a mixed-integer quadratic program and relies on commercial solvers to find the optimal solution. However, the computational costs of such methods increase exponentially with $k$ and $p$, making them too slow for problems of even moderate size. We propo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.10099","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/2505.10099/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":"2505.10099","created_at":"2026-07-05T11:03:33.249872+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.10099v1","created_at":"2026-07-05T11:03:33.249872+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.10099","created_at":"2026-07-05T11:03:33.249872+00:00"},{"alias_kind":"pith_short_12","alias_value":"OSCIV7Q7KEPE","created_at":"2026-07-05T11:03:33.249872+00:00"},{"alias_kind":"pith_short_16","alias_value":"OSCIV7Q7KEPEAM3X","created_at":"2026-07-05T11:03:33.249872+00:00"},{"alias_kind":"pith_short_8","alias_value":"OSCIV7Q7","created_at":"2026-07-05T11:03:33.249872+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20141","citing_title":"DASH: A Dimensionality Reduction Method for Large-scale Convex MIQP with Applications in Subset Portfolio Selection","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2607.00722","citing_title":"How does academic performance affect self-efficacy? Interpretable modelling through latent academic achievement","ref_index":98,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OSCIV7Q7KEPEAM3X65LUROIMEE","json":"https://pith.science/pith/OSCIV7Q7KEPEAM3X65LUROIMEE.json","graph_json":"https://pith.science/api/pith-number/OSCIV7Q7KEPEAM3X65LUROIMEE/graph.json","events_json":"https://pith.science/api/pith-number/OSCIV7Q7KEPEAM3X65LUROIMEE/events.json","paper":"https://pith.science/paper/OSCIV7Q7"},"agent_actions":{"view_html":"https://pith.science/pith/OSCIV7Q7KEPEAM3X65LUROIMEE","download_json":"https://pith.science/pith/OSCIV7Q7KEPEAM3X65LUROIMEE.json","view_paper":"https://pith.science/paper/OSCIV7Q7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.10099&json=true","fetch_graph":"https://pith.science/api/pith-number/OSCIV7Q7KEPEAM3X65LUROIMEE/graph.json","fetch_events":"https://pith.science/api/pith-number/OSCIV7Q7KEPEAM3X65LUROIMEE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OSCIV7Q7KEPEAM3X65LUROIMEE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OSCIV7Q7KEPEAM3X65LUROIMEE/action/storage_attestation","attest_author":"https://pith.science/pith/OSCIV7Q7KEPEAM3X65LUROIMEE/action/author_attestation","sign_citation":"https://pith.science/pith/OSCIV7Q7KEPEAM3X65LUROIMEE/action/citation_signature","submit_replication":"https://pith.science/pith/OSCIV7Q7KEPEAM3X65LUROIMEE/action/replication_record"}},"created_at":"2026-07-05T11:03:33.249872+00:00","updated_at":"2026-07-05T11:03:33.249872+00:00"}