{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:JHNHQ3FN7UKGUR4P6FHPQ733CR","short_pith_number":"pith:JHNHQ3FN","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"},"canonical_sha256":"49da786cadfd146a478ff14ef87f7b1459c0334d7c7196e5d9dccd3fc57d1b23","source":{"kind":"arxiv","id":"2412.00717","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.00717","created_at":"2026-07-05T09:42:45Z"},{"alias_kind":"arxiv_version","alias_value":"2412.00717v1","created_at":"2026-07-05T09:42:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.00717","created_at":"2026-07-05T09:42:45Z"},{"alias_kind":"pith_short_12","alias_value":"JHNHQ3FN7UKG","created_at":"2026-07-05T09:42:45Z"},{"alias_kind":"pith_short_16","alias_value":"JHNHQ3FN7UKGUR4P","created_at":"2026-07-05T09:42:45Z"},{"alias_kind":"pith_short_8","alias_value":"JHNHQ3FN","created_at":"2026-07-05T09:42:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:JHNHQ3FN7UKGUR4P6FHPQ733CR","target":"record","payload":{"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"},"canonical_sha256":"49da786cadfd146a478ff14ef87f7b1459c0334d7c7196e5d9dccd3fc57d1b23","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"},"source_kind":"arxiv","source_id":"2412.00717","source_version":1,"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-07-05T09:42:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qt4hIIpCUMQsr0g0/GoiEXsyjexETXAPTB+C4++/y8imzMvSNiLc4LDgMRXnDpl0/l7pegTiwO1m90vXlxmHCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T07:30:41.813100Z"},"content_sha256":"874082e19fba904482e429a10f42f6fa565ae8dcc98eb458a3c4929146559b44","schema_version":"1.0","event_id":"sha256:874082e19fba904482e429a10f42f6fa565ae8dcc98eb458a3c4929146559b44"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:JHNHQ3FN7UKGUR4P6FHPQ733CR","target":"graph","payload":{"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"},"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-07-05T09:42:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CooTMsqD5Z3ziSyG4xY7yrdU9UPauyeF/JHz4yNLA2BvBrH+mXsWUYuI/30NsFW1NK5Fs5C6fjpkRH93v7n4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T07:30:41.813877Z"},"content_sha256":"cd8112b6ccf32fd11b0b64ab3436fe92c33180771ff1b4a90764e11537f30fc6","schema_version":"1.0","event_id":"sha256:cd8112b6ccf32fd11b0b64ab3436fe92c33180771ff1b4a90764e11537f30fc6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JHNHQ3FN7UKGUR4P6FHPQ733CR/bundle.json","state_url":"https://pith.science/pith/JHNHQ3FN7UKGUR4P6FHPQ733CR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JHNHQ3FN7UKGUR4P6FHPQ733CR/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-08-10T07:30:41Z","links":{"resolver":"https://pith.science/pith/JHNHQ3FN7UKGUR4P6FHPQ733CR","bundle":"https://pith.science/pith/JHNHQ3FN7UKGUR4P6FHPQ733CR/bundle.json","state":"https://pith.science/pith/JHNHQ3FN7UKGUR4P6FHPQ733CR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JHNHQ3FN7UKGUR4P6FHPQ733CR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:JHNHQ3FN7UKGUR4P6FHPQ733CR","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":"3aaa8c4878c55a9a4a4e0a9cc0d4cc7d41d7c8eeb0aa4ea3cc73ac271cf53c30","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-12-01T07:43:39Z","title_canon_sha256":"7ff092b2bfdc163d822d35c8ee22a36549db273fac4da5988a3c5d54ef6b1a9c"},"schema_version":"1.0","source":{"id":"2412.00717","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.00717","created_at":"2026-07-05T09:42:45Z"},{"alias_kind":"arxiv_version","alias_value":"2412.00717v1","created_at":"2026-07-05T09:42:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.00717","created_at":"2026-07-05T09:42:45Z"},{"alias_kind":"pith_short_12","alias_value":"JHNHQ3FN7UKG","created_at":"2026-07-05T09:42:45Z"},{"alias_kind":"pith_short_16","alias_value":"JHNHQ3FN7UKGUR4P","created_at":"2026-07-05T09:42:45Z"},{"alias_kind":"pith_short_8","alias_value":"JHNHQ3FN","created_at":"2026-07-05T09:42:45Z"}],"graph_snapshots":[{"event_id":"sha256:cd8112b6ccf32fd11b0b64ab3436fe92c33180771ff1b4a90764e11537f30fc6","target":"graph","created_at":"2026-07-05T09:42:45Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.00717/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Andreas Maggiori, Marina Drygala, Miltiadis Stouras, Ola Svensson, Sergei Vassilvitskii, Silvio Lattanzi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-12-01T07:43:39Z","title":"Data-Driven Solution Portfolios"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.00717","kind":"arxiv","version":1},"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:874082e19fba904482e429a10f42f6fa565ae8dcc98eb458a3c4929146559b44","target":"record","created_at":"2026-07-05T09:42:45Z","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":"3aaa8c4878c55a9a4a4e0a9cc0d4cc7d41d7c8eeb0aa4ea3cc73ac271cf53c30","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-12-01T07:43:39Z","title_canon_sha256":"7ff092b2bfdc163d822d35c8ee22a36549db273fac4da5988a3c5d54ef6b1a9c"},"schema_version":"1.0","source":{"id":"2412.00717","kind":"arxiv","version":1}},"canonical_sha256":"49da786cadfd146a478ff14ef87f7b1459c0334d7c7196e5d9dccd3fc57d1b23","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49da786cadfd146a478ff14ef87f7b1459c0334d7c7196e5d9dccd3fc57d1b23","first_computed_at":"2026-07-05T09:42:45.889702Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:42:45.889702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QLqcai7WVGdNL0cqEU5vjvmngceos9K0hwu8OttG2dkjm08A1+gGTxCGSomMz+xwvBjs4v0pZtdLS4OAsibpAw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:42:45.890289Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.00717","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:874082e19fba904482e429a10f42f6fa565ae8dcc98eb458a3c4929146559b44","sha256:cd8112b6ccf32fd11b0b64ab3436fe92c33180771ff1b4a90764e11537f30fc6"],"state_sha256":"11ce1fa11d5633f36826735eb1436a657bc5f904b63c8b4bbce3486e28735534"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uvOWhl33cgII8wglFTNTgWQuoYNW1fn3lRg7SkvLYOQJyQrT407h0Af7qW/9XBufv5QF4OW06Jac/N8n0E65AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T07:30:41.821832Z","bundle_sha256":"7314b0f28b7516ab56173c06eb7a6610e51083476d87b0ba72232a1abaa864d3"}}