{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JLIAHFQSWXM35UF6BMKJPBHRTE","short_pith_number":"pith:JLIAHFQS","canonical_record":{"source":{"id":"1711.03091","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T18:50:49Z","cross_cats_sorted":[],"title_canon_sha256":"d41d56981e11f29ec47a8ce64b4daea8ebce4debd5ce3fd95db9e7b605c88a8c","abstract_canon_sha256":"2a92e639a57a7d172c5cd6f93a87568fe94afe32103eab6b7f97b1a54470b5de"},"schema_version":"1.0"},"canonical_sha256":"4ad0039612b5d9bed0be0b149784f199246b895cb4d18fe02d8166a72d23f520","source":{"kind":"arxiv","id":"1711.03091","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03091","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03091v4","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03091","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"JLIAHFQSWXM3","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JLIAHFQSWXM35UF6","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JLIAHFQS","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JLIAHFQSWXM35UF6BMKJPBHRTE","target":"record","payload":{"canonical_record":{"source":{"id":"1711.03091","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T18:50:49Z","cross_cats_sorted":[],"title_canon_sha256":"d41d56981e11f29ec47a8ce64b4daea8ebce4debd5ce3fd95db9e7b605c88a8c","abstract_canon_sha256":"2a92e639a57a7d172c5cd6f93a87568fe94afe32103eab6b7f97b1a54470b5de"},"schema_version":"1.0"},"canonical_sha256":"4ad0039612b5d9bed0be0b149784f199246b895cb4d18fe02d8166a72d23f520","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:45.473425Z","signature_b64":"xFxyTHTzNCBjwsT7JJJjh07oF3BnFNHCKSSUQA6EuIqXfUhqTG2a/lHjW0EJ25EGRI2/Mn+97TfRtimscYiyBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ad0039612b5d9bed0be0b149784f199246b895cb4d18fe02d8166a72d23f520","last_reissued_at":"2026-05-18T00:02:45.473039Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:45.473039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.03091","source_version":4,"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:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5tbEjTr9hNf3ElYPN1W4TsDF3RXmoQQHis/ozhDV/yWYlo8Ckq/gPpb8EfQ+FnwREW1WgbIEGwSNshKelEriCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:42:56.502560Z"},"content_sha256":"f457f26135925cc89df76fb43fe0a4846dec3b7c5783f196892679f7a8ed8e5a","schema_version":"1.0","event_id":"sha256:f457f26135925cc89df76fb43fe0a4846dec3b7c5783f196892679f7a8ed8e5a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JLIAHFQSWXM35UF6BMKJPBHRTE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dispersion for Data-Driven Algorithm Design, Online Learning, and Private Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ellen Vitercik, Maria-Florina Balcan, Travis Dick","submitted_at":"2017-11-08T18:50:49Z","abstract_excerpt":"Data-driven algorithm design, that is, choosing the best algorithm for a specific application, is a crucial problem in modern data science. Practitioners often optimize over a parameterized algorithm family, tuning parameters based on problems from their domain. These procedures have historically come with no guarantees, though a recent line of work studies algorithm selection from a theoretical perspective. We advance the foundations of this field in several directions: we analyze online algorithm selection, where problems arrive one-by-one and the goal is to minimize regret, and private algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03091","kind":"arxiv","version":4},"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:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lT7Hs98DmmBKIrVyppjVyXfXizHKKAZ8iq8G6fcepajnoIYmS8NGmFRpyHWog60/nAbDELntED/7/LyKcdwlDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:42:56.502897Z"},"content_sha256":"d9844e650962e99a8075c07fef4f50f346e5f0cfab4009307aea69030e0aef5f","schema_version":"1.0","event_id":"sha256:d9844e650962e99a8075c07fef4f50f346e5f0cfab4009307aea69030e0aef5f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JLIAHFQSWXM35UF6BMKJPBHRTE/bundle.json","state_url":"https://pith.science/pith/JLIAHFQSWXM35UF6BMKJPBHRTE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JLIAHFQSWXM35UF6BMKJPBHRTE/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-06-20T08:42:56Z","links":{"resolver":"https://pith.science/pith/JLIAHFQSWXM35UF6BMKJPBHRTE","bundle":"https://pith.science/pith/JLIAHFQSWXM35UF6BMKJPBHRTE/bundle.json","state":"https://pith.science/pith/JLIAHFQSWXM35UF6BMKJPBHRTE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JLIAHFQSWXM35UF6BMKJPBHRTE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JLIAHFQSWXM35UF6BMKJPBHRTE","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":"2a92e639a57a7d172c5cd6f93a87568fe94afe32103eab6b7f97b1a54470b5de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T18:50:49Z","title_canon_sha256":"d41d56981e11f29ec47a8ce64b4daea8ebce4debd5ce3fd95db9e7b605c88a8c"},"schema_version":"1.0","source":{"id":"1711.03091","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03091","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03091v4","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03091","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"JLIAHFQSWXM3","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JLIAHFQSWXM35UF6","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JLIAHFQS","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:d9844e650962e99a8075c07fef4f50f346e5f0cfab4009307aea69030e0aef5f","target":"graph","created_at":"2026-05-18T00:02: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"},"paper":{"abstract_excerpt":"Data-driven algorithm design, that is, choosing the best algorithm for a specific application, is a crucial problem in modern data science. Practitioners often optimize over a parameterized algorithm family, tuning parameters based on problems from their domain. These procedures have historically come with no guarantees, though a recent line of work studies algorithm selection from a theoretical perspective. We advance the foundations of this field in several directions: we analyze online algorithm selection, where problems arrive one-by-one and the goal is to minimize regret, and private algo","authors_text":"Ellen Vitercik, Maria-Florina Balcan, Travis Dick","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T18:50:49Z","title":"Dispersion for Data-Driven Algorithm Design, Online Learning, and Private Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03091","kind":"arxiv","version":4},"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:f457f26135925cc89df76fb43fe0a4846dec3b7c5783f196892679f7a8ed8e5a","target":"record","created_at":"2026-05-18T00:02: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":"2a92e639a57a7d172c5cd6f93a87568fe94afe32103eab6b7f97b1a54470b5de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T18:50:49Z","title_canon_sha256":"d41d56981e11f29ec47a8ce64b4daea8ebce4debd5ce3fd95db9e7b605c88a8c"},"schema_version":"1.0","source":{"id":"1711.03091","kind":"arxiv","version":4}},"canonical_sha256":"4ad0039612b5d9bed0be0b149784f199246b895cb4d18fe02d8166a72d23f520","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ad0039612b5d9bed0be0b149784f199246b895cb4d18fe02d8166a72d23f520","first_computed_at":"2026-05-18T00:02:45.473039Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:45.473039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xFxyTHTzNCBjwsT7JJJjh07oF3BnFNHCKSSUQA6EuIqXfUhqTG2a/lHjW0EJ25EGRI2/Mn+97TfRtimscYiyBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:45.473425Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.03091","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f457f26135925cc89df76fb43fe0a4846dec3b7c5783f196892679f7a8ed8e5a","sha256:d9844e650962e99a8075c07fef4f50f346e5f0cfab4009307aea69030e0aef5f"],"state_sha256":"bd15c3dfc07d8a9ee30633c41c2b5609f8003c2c5dba5c9eb15437f16139c35c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7gLsynS6NWLZm5uNj2xedFF+JtTwEVk6rxm5co21BO64q9Zqgw23eWsiW3h4ABjYna44Idz0Fx17I6Ts4+cPBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T08:42:56.504776Z","bundle_sha256":"ed7514d0c3bc011f4a40cc8557f8582732014521549964a29f9525f1bc2e38fd"}}