{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:JHNHQ3FN7UKGUR4P6FHPQ733CR","short_pith_number":"pith:JHNHQ3FN","schema_version":"1.0","canonical_sha256":"49da786cadfd146a478ff14ef87f7b1459c0334d7c7196e5d9dccd3fc57d1b23","source":{"kind":"arxiv","id":"2412.00717","version":1},"attestation_state":"computed","paper":{"title":"Data-Driven Solution Portfolios","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Maggiori, Marina Drygala, Miltiadis Stouras, Ola Svensson, Sergei Vassilvitskii, Silvio Lattanzi","submitted_at":"2024-12-01T07:43:39Z","abstract_excerpt":"In this paper, we consider a new problem of portfolio optimization using stochastic information. In a setting where there is some uncertainty, we ask how to best select $k$ potential solutions, with the goal of optimizing the value of the best solution. More formally, given a combinatorial problem $\\Pi$, a set of value functions $V$ over the solutions of $\\Pi$, and a distribution $D$ over $V$, our goal is to select $k$ solutions of $\\Pi$ that maximize or minimize the expected value of the {\\em best} of those solutions. For a simple example, consider the classic knapsack problem: given a univer"},"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":"2412.00717","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-12-01T07:43:39Z","cross_cats_sorted":[],"title_canon_sha256":"7ff092b2bfdc163d822d35c8ee22a36549db273fac4da5988a3c5d54ef6b1a9c","abstract_canon_sha256":"3aaa8c4878c55a9a4a4e0a9cc0d4cc7d41d7c8eeb0aa4ea3cc73ac271cf53c30"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:42:45.890289Z","signature_b64":"QLqcai7WVGdNL0cqEU5vjvmngceos9K0hwu8OttG2dkjm08A1+gGTxCGSomMz+xwvBjs4v0pZtdLS4OAsibpAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49da786cadfd146a478ff14ef87f7b1459c0334d7c7196e5d9dccd3fc57d1b23","last_reissued_at":"2026-07-05T09:42:45.889702Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:42:45.889702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data-Driven Solution Portfolios","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Maggiori, Marina Drygala, Miltiadis Stouras, Ola Svensson, Sergei Vassilvitskii, Silvio Lattanzi","submitted_at":"2024-12-01T07:43:39Z","abstract_excerpt":"In this paper, we consider a new problem of portfolio optimization using stochastic information. In a setting where there is some uncertainty, we ask how to best select $k$ potential solutions, with the goal of optimizing the value of the best solution. More formally, given a combinatorial problem $\\Pi$, a set of value functions $V$ over the solutions of $\\Pi$, and a distribution $D$ over $V$, our goal is to select $k$ solutions of $\\Pi$ that maximize or minimize the expected value of the {\\em best} of those solutions. For a simple example, consider the classic knapsack problem: given a univer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.00717","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/2412.00717/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":"2412.00717","created_at":"2026-07-05T09:42:45.889774+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.00717v1","created_at":"2026-07-05T09:42:45.889774+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.00717","created_at":"2026-07-05T09:42:45.889774+00:00"},{"alias_kind":"pith_short_12","alias_value":"JHNHQ3FN7UKG","created_at":"2026-07-05T09:42:45.889774+00:00"},{"alias_kind":"pith_short_16","alias_value":"JHNHQ3FN7UKGUR4P","created_at":"2026-07-05T09:42:45.889774+00:00"},{"alias_kind":"pith_short_8","alias_value":"JHNHQ3FN","created_at":"2026-07-05T09:42:45.889774+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00843","citing_title":"Submodular Maximization over Many Matroids via Ordered Local Search","ref_index":55,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JHNHQ3FN7UKGUR4P6FHPQ733CR","json":"https://pith.science/pith/JHNHQ3FN7UKGUR4P6FHPQ733CR.json","graph_json":"https://pith.science/api/pith-number/JHNHQ3FN7UKGUR4P6FHPQ733CR/graph.json","events_json":"https://pith.science/api/pith-number/JHNHQ3FN7UKGUR4P6FHPQ733CR/events.json","paper":"https://pith.science/paper/JHNHQ3FN"},"agent_actions":{"view_html":"https://pith.science/pith/JHNHQ3FN7UKGUR4P6FHPQ733CR","download_json":"https://pith.science/pith/JHNHQ3FN7UKGUR4P6FHPQ733CR.json","view_paper":"https://pith.science/paper/JHNHQ3FN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.00717&json=true","fetch_graph":"https://pith.science/api/pith-number/JHNHQ3FN7UKGUR4P6FHPQ733CR/graph.json","fetch_events":"https://pith.science/api/pith-number/JHNHQ3FN7UKGUR4P6FHPQ733CR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JHNHQ3FN7UKGUR4P6FHPQ733CR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JHNHQ3FN7UKGUR4P6FHPQ733CR/action/storage_attestation","attest_author":"https://pith.science/pith/JHNHQ3FN7UKGUR4P6FHPQ733CR/action/author_attestation","sign_citation":"https://pith.science/pith/JHNHQ3FN7UKGUR4P6FHPQ733CR/action/citation_signature","submit_replication":"https://pith.science/pith/JHNHQ3FN7UKGUR4P6FHPQ733CR/action/replication_record"}},"created_at":"2026-07-05T09:42:45.889774+00:00","updated_at":"2026-07-05T09:42:45.889774+00:00"}