{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EJMRPLRKHAQLHWG3FGKWJWWXQL","short_pith_number":"pith:EJMRPLRK","schema_version":"1.0","canonical_sha256":"225917ae2a3820b3d8db299564dad782efbecb61af27e9e319416897e20c90ab","source":{"kind":"arxiv","id":"1807.00755","version":1},"attestation_state":"computed","paper":{"title":"LeapsAndBounds: A Method for Approximately Optimal Algorithm Configuration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andr\\'as Gy\\\"orgy, Csaba Szepesv\\'ari, Gell\\'ert Weisz","submitted_at":"2018-07-02T15:44:36Z","abstract_excerpt":"We consider the problem of configuring general-purpose solvers to run efficiently on problem instances drawn from an unknown distribution. The goal of the configurator is to find a configuration that runs fast on average on most instances, and do so with the least amount of total work. It can run a chosen solver on a random instance until the solver finishes or a timeout is reached. We propose LeapsAndBounds, an algorithm that tests configurations on randomly selected problem instances for longer and longer time. We prove that the capped expected runtime of the configuration returned by LeapsA"},"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":"1807.00755","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-02T15:44:36Z","cross_cats_sorted":["cs.AI","math.OC","stat.ML"],"title_canon_sha256":"0ac5087cfa0ff5126234d123c40556ceac6bebfd0ff59fa424b5b134e4482f80","abstract_canon_sha256":"7bc9c65b93d1288ed61715117f572e18ac6b8939754b32edbae8381adf64d534"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:51.501900Z","signature_b64":"49gmIBw0cV8jJqGcP/UhZ7r7FpkbJbHjCXGrP+1cWHgdZVbtkX2OYi58C4Enz+QO0TkSn1W/OqLBNIRU6eARDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"225917ae2a3820b3d8db299564dad782efbecb61af27e9e319416897e20c90ab","last_reissued_at":"2026-05-18T00:11:51.501280Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:51.501280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LeapsAndBounds: A Method for Approximately Optimal Algorithm Configuration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andr\\'as Gy\\\"orgy, Csaba Szepesv\\'ari, Gell\\'ert Weisz","submitted_at":"2018-07-02T15:44:36Z","abstract_excerpt":"We consider the problem of configuring general-purpose solvers to run efficiently on problem instances drawn from an unknown distribution. The goal of the configurator is to find a configuration that runs fast on average on most instances, and do so with the least amount of total work. It can run a chosen solver on a random instance until the solver finishes or a timeout is reached. We propose LeapsAndBounds, an algorithm that tests configurations on randomly selected problem instances for longer and longer time. We prove that the capped expected runtime of the configuration returned by LeapsA"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00755","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":""},"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":"1807.00755","created_at":"2026-05-18T00:11:51.501390+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.00755v1","created_at":"2026-05-18T00:11:51.501390+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00755","created_at":"2026-05-18T00:11:51.501390+00:00"},{"alias_kind":"pith_short_12","alias_value":"EJMRPLRKHAQL","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EJMRPLRKHAQLHWG3","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EJMRPLRK","created_at":"2026-05-18T12:32:22.470017+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/EJMRPLRKHAQLHWG3FGKWJWWXQL","json":"https://pith.science/pith/EJMRPLRKHAQLHWG3FGKWJWWXQL.json","graph_json":"https://pith.science/api/pith-number/EJMRPLRKHAQLHWG3FGKWJWWXQL/graph.json","events_json":"https://pith.science/api/pith-number/EJMRPLRKHAQLHWG3FGKWJWWXQL/events.json","paper":"https://pith.science/paper/EJMRPLRK"},"agent_actions":{"view_html":"https://pith.science/pith/EJMRPLRKHAQLHWG3FGKWJWWXQL","download_json":"https://pith.science/pith/EJMRPLRKHAQLHWG3FGKWJWWXQL.json","view_paper":"https://pith.science/paper/EJMRPLRK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.00755&json=true","fetch_graph":"https://pith.science/api/pith-number/EJMRPLRKHAQLHWG3FGKWJWWXQL/graph.json","fetch_events":"https://pith.science/api/pith-number/EJMRPLRKHAQLHWG3FGKWJWWXQL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EJMRPLRKHAQLHWG3FGKWJWWXQL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EJMRPLRKHAQLHWG3FGKWJWWXQL/action/storage_attestation","attest_author":"https://pith.science/pith/EJMRPLRKHAQLHWG3FGKWJWWXQL/action/author_attestation","sign_citation":"https://pith.science/pith/EJMRPLRKHAQLHWG3FGKWJWWXQL/action/citation_signature","submit_replication":"https://pith.science/pith/EJMRPLRKHAQLHWG3FGKWJWWXQL/action/replication_record"}},"created_at":"2026-05-18T00:11:51.501390+00:00","updated_at":"2026-05-18T00:11:51.501390+00:00"}