{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GIG6SVGNX3JGJBZOKQGUEEM3VO","short_pith_number":"pith:GIG6SVGN","canonical_record":{"source":{"id":"1603.05937","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.PM","submitted_at":"2016-03-18T17:49:09Z","cross_cats_sorted":["q-fin.RM"],"title_canon_sha256":"fa52198d231f77d79c78ca2bf266e848f89366267fde5fb63eb6ce8c3408fddc","abstract_canon_sha256":"03b50eb377903928e4eca976cd0f83269bc9b5d8c2b9e8df6e70185b909e104b"},"schema_version":"1.0"},"canonical_sha256":"320de954cdbed264872e540d42119bab9fd9bf9b81f0874e909b47b4f21bfec7","source":{"kind":"arxiv","id":"1603.05937","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05937","created_at":"2026-05-18T00:54:52Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05937v2","created_at":"2026-05-18T00:54:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05937","created_at":"2026-05-18T00:54:52Z"},{"alias_kind":"pith_short_12","alias_value":"GIG6SVGNX3JG","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GIG6SVGNX3JGJBZO","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GIG6SVGN","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GIG6SVGNX3JGJBZOKQGUEEM3VO","target":"record","payload":{"canonical_record":{"source":{"id":"1603.05937","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.PM","submitted_at":"2016-03-18T17:49:09Z","cross_cats_sorted":["q-fin.RM"],"title_canon_sha256":"fa52198d231f77d79c78ca2bf266e848f89366267fde5fb63eb6ce8c3408fddc","abstract_canon_sha256":"03b50eb377903928e4eca976cd0f83269bc9b5d8c2b9e8df6e70185b909e104b"},"schema_version":"1.0"},"canonical_sha256":"320de954cdbed264872e540d42119bab9fd9bf9b81f0874e909b47b4f21bfec7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:52.847380Z","signature_b64":"9UhgbnzXj+/Hy8atG2PA1n7NVHmA+y+5x9+BRUXj8QcwXqn7smWU+O48ySiD0/YoRRexngJO3GyeHW+Wg7L1DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"320de954cdbed264872e540d42119bab9fd9bf9b81f0874e909b47b4f21bfec7","last_reissued_at":"2026-05-18T00:54:52.846860Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:52.846860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.05937","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:54:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b9794HVEAMFoqMJ3vZ2LL5WvZ3mLbAjX07jov2O32kZpwlDFs44sDF0BByh5ctSPWmvihit4R3YIYdiy9hqVAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:06:49.248624Z"},"content_sha256":"971aaa6510b468d934c697b8713aff6b0271210bd87c4db186c494db122a1521","schema_version":"1.0","event_id":"sha256:971aaa6510b468d934c697b8713aff6b0271210bd87c4db186c494db122a1521"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GIG6SVGNX3JGJBZOKQGUEEM3VO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How to Combine a Billion Alphas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-fin.RM"],"primary_cat":"q-fin.PM","authors_text":"Willie Yu, Zura Kakushadze","submitted_at":"2016-03-18T17:49:09Z","abstract_excerpt":"We give an explicit algorithm and source code for computing optimal weights for combining a large number N of alphas. This algorithm does not cost O(N^3) or even O(N^2) operations but is much cheaper, in fact, the number of required operations scales linearly with N. We discuss how in the absence of binary or quasi-binary clustering of alphas, which is not observed in practice, the optimization problem simplifies when N is large. Our algorithm does not require computing principal components or inverting large matrices, nor does it require iterations. The number of risk factors it employs, whic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05937","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:54:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YSXpriUoSZLJh3AY6dpEFPXXbKJXeyrrcW/U2iZspnpgaSc4Qcwj66q5jWhl0xtYMS4z0yhqIg+aZ73id4I5DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:06:49.248985Z"},"content_sha256":"5eb6e6a164feae28f58b60928906a2d4e426f42ff1bd63a32ef5e1c72c819297","schema_version":"1.0","event_id":"sha256:5eb6e6a164feae28f58b60928906a2d4e426f42ff1bd63a32ef5e1c72c819297"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GIG6SVGNX3JGJBZOKQGUEEM3VO/bundle.json","state_url":"https://pith.science/pith/GIG6SVGNX3JGJBZOKQGUEEM3VO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GIG6SVGNX3JGJBZOKQGUEEM3VO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T04:06:49Z","links":{"resolver":"https://pith.science/pith/GIG6SVGNX3JGJBZOKQGUEEM3VO","bundle":"https://pith.science/pith/GIG6SVGNX3JGJBZOKQGUEEM3VO/bundle.json","state":"https://pith.science/pith/GIG6SVGNX3JGJBZOKQGUEEM3VO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GIG6SVGNX3JGJBZOKQGUEEM3VO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GIG6SVGNX3JGJBZOKQGUEEM3VO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"03b50eb377903928e4eca976cd0f83269bc9b5d8c2b9e8df6e70185b909e104b","cross_cats_sorted":["q-fin.RM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.PM","submitted_at":"2016-03-18T17:49:09Z","title_canon_sha256":"fa52198d231f77d79c78ca2bf266e848f89366267fde5fb63eb6ce8c3408fddc"},"schema_version":"1.0","source":{"id":"1603.05937","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05937","created_at":"2026-05-18T00:54:52Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05937v2","created_at":"2026-05-18T00:54:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05937","created_at":"2026-05-18T00:54:52Z"},{"alias_kind":"pith_short_12","alias_value":"GIG6SVGNX3JG","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GIG6SVGNX3JGJBZO","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GIG6SVGN","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:5eb6e6a164feae28f58b60928906a2d4e426f42ff1bd63a32ef5e1c72c819297","target":"graph","created_at":"2026-05-18T00:54:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We give an explicit algorithm and source code for computing optimal weights for combining a large number N of alphas. This algorithm does not cost O(N^3) or even O(N^2) operations but is much cheaper, in fact, the number of required operations scales linearly with N. We discuss how in the absence of binary or quasi-binary clustering of alphas, which is not observed in practice, the optimization problem simplifies when N is large. Our algorithm does not require computing principal components or inverting large matrices, nor does it require iterations. The number of risk factors it employs, whic","authors_text":"Willie Yu, Zura Kakushadze","cross_cats":["q-fin.RM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.PM","submitted_at":"2016-03-18T17:49:09Z","title":"How to Combine a Billion Alphas"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05937","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:971aaa6510b468d934c697b8713aff6b0271210bd87c4db186c494db122a1521","target":"record","created_at":"2026-05-18T00:54:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"03b50eb377903928e4eca976cd0f83269bc9b5d8c2b9e8df6e70185b909e104b","cross_cats_sorted":["q-fin.RM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.PM","submitted_at":"2016-03-18T17:49:09Z","title_canon_sha256":"fa52198d231f77d79c78ca2bf266e848f89366267fde5fb63eb6ce8c3408fddc"},"schema_version":"1.0","source":{"id":"1603.05937","kind":"arxiv","version":2}},"canonical_sha256":"320de954cdbed264872e540d42119bab9fd9bf9b81f0874e909b47b4f21bfec7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"320de954cdbed264872e540d42119bab9fd9bf9b81f0874e909b47b4f21bfec7","first_computed_at":"2026-05-18T00:54:52.846860Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:52.846860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9UhgbnzXj+/Hy8atG2PA1n7NVHmA+y+5x9+BRUXj8QcwXqn7smWU+O48ySiD0/YoRRexngJO3GyeHW+Wg7L1DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:52.847380Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.05937","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:971aaa6510b468d934c697b8713aff6b0271210bd87c4db186c494db122a1521","sha256:5eb6e6a164feae28f58b60928906a2d4e426f42ff1bd63a32ef5e1c72c819297"],"state_sha256":"c9c3a38049bdad4da53cd79a58939bef6c71f31a1139e7a15df5d7d87010bc61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j8ccbyn/tvYgwysZIutJakjxQ2RgTs+83RPMX/pirfOf9bkqTVrbsUa5RE1Wn0DL+HbjFUn+b7AJjTlzD6+/BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T04:06:49.251339Z","bundle_sha256":"daf753dbf1fcc99d6932750ea3dd7450db3bce3b235def8d5ab5c1c799362215"}}