{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:MI3BR2QF3RIQVFECVVU22JBRBK","short_pith_number":"pith:MI3BR2QF","schema_version":"1.0","canonical_sha256":"623618ea05dc510a9482ad69ad24310a901ac5d318dfaa64868a8a86999e3bc0","source":{"kind":"arxiv","id":"2006.07281","version":1},"attestation_state":"computed","paper":{"title":"Algorithms and Learning for Fair Portfolio Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","cs.GT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aaron Roth, Emily Diana, Hadi Elzayn, Juba Ziani, Michael Kearns, Saeed Sharifi-Malvajerdi, Travis Dick, Zachary Schutzman","submitted_at":"2020-06-12T16:00:41Z","abstract_excerpt":"We consider a variation on the classical finance problem of optimal portfolio design. In our setting, a large population of consumers is drawn from some distribution over risk tolerances, and each consumer must be assigned to a portfolio of lower risk than her tolerance. The consumers may also belong to underlying groups (for instance, of demographic properties or wealth), and the goal is to design a small number of portfolios that are fair across groups in a particular and natural technical sense.\n  Our main results are algorithms for optimal and near-optimal portfolio design for both social "},"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":"2006.07281","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-12T16:00:41Z","cross_cats_sorted":["cs.CE","cs.GT","stat.ML"],"title_canon_sha256":"84cbdeedcfc6e5bb065475afcc3fa5fdd421c4f9ae472e3ae6fbb29633e3d608","abstract_canon_sha256":"2322367aa83e7ee973b88c4a2f8143981ec320802b014c92177afa92514cfa4f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:09:53.311121Z","signature_b64":"g719eyo+zLye4Wq+TGEa2Mz6v4dLn9ZPEEoXP9s9ExEFeO+bUknLa9jF+9X2Kr4FauW9IG5BzZ9nJm3eYjdWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"623618ea05dc510a9482ad69ad24310a901ac5d318dfaa64868a8a86999e3bc0","last_reissued_at":"2026-07-05T01:09:53.310645Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:09:53.310645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms and Learning for Fair Portfolio Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","cs.GT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aaron Roth, Emily Diana, Hadi Elzayn, Juba Ziani, Michael Kearns, Saeed Sharifi-Malvajerdi, Travis Dick, Zachary Schutzman","submitted_at":"2020-06-12T16:00:41Z","abstract_excerpt":"We consider a variation on the classical finance problem of optimal portfolio design. In our setting, a large population of consumers is drawn from some distribution over risk tolerances, and each consumer must be assigned to a portfolio of lower risk than her tolerance. The consumers may also belong to underlying groups (for instance, of demographic properties or wealth), and the goal is to design a small number of portfolios that are fair across groups in a particular and natural technical sense.\n  Our main results are algorithms for optimal and near-optimal portfolio design for both social "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.07281","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/2006.07281/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":"2006.07281","created_at":"2026-07-05T01:09:53.310704+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.07281v1","created_at":"2026-07-05T01:09:53.310704+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.07281","created_at":"2026-07-05T01:09:53.310704+00:00"},{"alias_kind":"pith_short_12","alias_value":"MI3BR2QF3RIQ","created_at":"2026-07-05T01:09:53.310704+00:00"},{"alias_kind":"pith_short_16","alias_value":"MI3BR2QF3RIQVFEC","created_at":"2026-07-05T01:09:53.310704+00:00"},{"alias_kind":"pith_short_8","alias_value":"MI3BR2QF","created_at":"2026-07-05T01:09:53.310704+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/MI3BR2QF3RIQVFECVVU22JBRBK","json":"https://pith.science/pith/MI3BR2QF3RIQVFECVVU22JBRBK.json","graph_json":"https://pith.science/api/pith-number/MI3BR2QF3RIQVFECVVU22JBRBK/graph.json","events_json":"https://pith.science/api/pith-number/MI3BR2QF3RIQVFECVVU22JBRBK/events.json","paper":"https://pith.science/paper/MI3BR2QF"},"agent_actions":{"view_html":"https://pith.science/pith/MI3BR2QF3RIQVFECVVU22JBRBK","download_json":"https://pith.science/pith/MI3BR2QF3RIQVFECVVU22JBRBK.json","view_paper":"https://pith.science/paper/MI3BR2QF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.07281&json=true","fetch_graph":"https://pith.science/api/pith-number/MI3BR2QF3RIQVFECVVU22JBRBK/graph.json","fetch_events":"https://pith.science/api/pith-number/MI3BR2QF3RIQVFECVVU22JBRBK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MI3BR2QF3RIQVFECVVU22JBRBK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MI3BR2QF3RIQVFECVVU22JBRBK/action/storage_attestation","attest_author":"https://pith.science/pith/MI3BR2QF3RIQVFECVVU22JBRBK/action/author_attestation","sign_citation":"https://pith.science/pith/MI3BR2QF3RIQVFECVVU22JBRBK/action/citation_signature","submit_replication":"https://pith.science/pith/MI3BR2QF3RIQVFECVVU22JBRBK/action/replication_record"}},"created_at":"2026-07-05T01:09:53.310704+00:00","updated_at":"2026-07-05T01:09:53.310704+00:00"}