{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JLIAHFQSWXM35UF6BMKJPBHRTE","short_pith_number":"pith:JLIAHFQS","schema_version":"1.0","canonical_sha256":"4ad0039612b5d9bed0be0b149784f199246b895cb4d18fe02d8166a72d23f520","source":{"kind":"arxiv","id":"1711.03091","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.03091","created_at":"2026-05-18T00:02:45.473090+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.03091v4","created_at":"2026-05-18T00:02:45.473090+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03091","created_at":"2026-05-18T00:02:45.473090+00:00"},{"alias_kind":"pith_short_12","alias_value":"JLIAHFQSWXM3","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JLIAHFQSWXM35UF6","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JLIAHFQS","created_at":"2026-05-18T12:31:24.725408+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/JLIAHFQSWXM35UF6BMKJPBHRTE","json":"https://pith.science/pith/JLIAHFQSWXM35UF6BMKJPBHRTE.json","graph_json":"https://pith.science/api/pith-number/JLIAHFQSWXM35UF6BMKJPBHRTE/graph.json","events_json":"https://pith.science/api/pith-number/JLIAHFQSWXM35UF6BMKJPBHRTE/events.json","paper":"https://pith.science/paper/JLIAHFQS"},"agent_actions":{"view_html":"https://pith.science/pith/JLIAHFQSWXM35UF6BMKJPBHRTE","download_json":"https://pith.science/pith/JLIAHFQSWXM35UF6BMKJPBHRTE.json","view_paper":"https://pith.science/paper/JLIAHFQS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.03091&json=true","fetch_graph":"https://pith.science/api/pith-number/JLIAHFQSWXM35UF6BMKJPBHRTE/graph.json","fetch_events":"https://pith.science/api/pith-number/JLIAHFQSWXM35UF6BMKJPBHRTE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JLIAHFQSWXM35UF6BMKJPBHRTE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JLIAHFQSWXM35UF6BMKJPBHRTE/action/storage_attestation","attest_author":"https://pith.science/pith/JLIAHFQSWXM35UF6BMKJPBHRTE/action/author_attestation","sign_citation":"https://pith.science/pith/JLIAHFQSWXM35UF6BMKJPBHRTE/action/citation_signature","submit_replication":"https://pith.science/pith/JLIAHFQSWXM35UF6BMKJPBHRTE/action/replication_record"}},"created_at":"2026-05-18T00:02:45.473090+00:00","updated_at":"2026-05-18T00:02:45.473090+00:00"}