{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EPELMVD626267FHWFGVRFVP7YR","short_pith_number":"pith:EPELMVD6","schema_version":"1.0","canonical_sha256":"23c8b6547ed7b5ef94f629ab12d5ffc4519f02dea8d3c8688d4a4819fb2cb3cd","source":{"kind":"arxiv","id":"1806.08984","version":1},"attestation_state":"computed","paper":{"title":"An Improved Generic Bet-and-Run Strategy for Speeding Up Stochastic Local Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.NE","authors_text":"Markus Wagner, Thomas Weise, Zijun Wu","submitted_at":"2018-06-23T15:36:04Z","abstract_excerpt":"A commonly used strategy for improving optimization algorithms is to restart the algorithm when it is believed to be trapped in an inferior part of the search space. Building on the recent success of Bet-and-Run approaches for restarted local search solvers, we introduce an improved generic Bet-and-Run strategy. The goal is to obtain the best possible results within a given time budget t using a given black-box optimization algorithm. If no prior knowledge about problem features and algorithm behavior is available, the question about how to use the time budget most efficiently arises. We propo"},"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":"1806.08984","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-06-23T15:36:04Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"381ca6c837ed623bcda175e753549832072497af96d3ba31bca96bf96a06845d","abstract_canon_sha256":"eb3a3b408ea8deacb0d6abe61f3cb7b74ac90cc5d5e389df1a5dbecfb2017264"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:30.687310Z","signature_b64":"CoyVyY/IHyUHhG6ZsUAfuq+HqfzQHkq3cUc8fAauIVDQK56GZuiX0y/1W/joQq/lBK6iKGIBoADO3gAi5oZXCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23c8b6547ed7b5ef94f629ab12d5ffc4519f02dea8d3c8688d4a4819fb2cb3cd","last_reissued_at":"2026-05-18T00:12:30.686772Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:30.686772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Improved Generic Bet-and-Run Strategy for Speeding Up Stochastic Local Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.NE","authors_text":"Markus Wagner, Thomas Weise, Zijun Wu","submitted_at":"2018-06-23T15:36:04Z","abstract_excerpt":"A commonly used strategy for improving optimization algorithms is to restart the algorithm when it is believed to be trapped in an inferior part of the search space. Building on the recent success of Bet-and-Run approaches for restarted local search solvers, we introduce an improved generic Bet-and-Run strategy. The goal is to obtain the best possible results within a given time budget t using a given black-box optimization algorithm. If no prior knowledge about problem features and algorithm behavior is available, the question about how to use the time budget most efficiently arises. We propo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08984","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":"1806.08984","created_at":"2026-05-18T00:12:30.686850+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.08984v1","created_at":"2026-05-18T00:12:30.686850+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08984","created_at":"2026-05-18T00:12:30.686850+00:00"},{"alias_kind":"pith_short_12","alias_value":"EPELMVD62626","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EPELMVD626267FHW","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EPELMVD6","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/EPELMVD626267FHWFGVRFVP7YR","json":"https://pith.science/pith/EPELMVD626267FHWFGVRFVP7YR.json","graph_json":"https://pith.science/api/pith-number/EPELMVD626267FHWFGVRFVP7YR/graph.json","events_json":"https://pith.science/api/pith-number/EPELMVD626267FHWFGVRFVP7YR/events.json","paper":"https://pith.science/paper/EPELMVD6"},"agent_actions":{"view_html":"https://pith.science/pith/EPELMVD626267FHWFGVRFVP7YR","download_json":"https://pith.science/pith/EPELMVD626267FHWFGVRFVP7YR.json","view_paper":"https://pith.science/paper/EPELMVD6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.08984&json=true","fetch_graph":"https://pith.science/api/pith-number/EPELMVD626267FHWFGVRFVP7YR/graph.json","fetch_events":"https://pith.science/api/pith-number/EPELMVD626267FHWFGVRFVP7YR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EPELMVD626267FHWFGVRFVP7YR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EPELMVD626267FHWFGVRFVP7YR/action/storage_attestation","attest_author":"https://pith.science/pith/EPELMVD626267FHWFGVRFVP7YR/action/author_attestation","sign_citation":"https://pith.science/pith/EPELMVD626267FHWFGVRFVP7YR/action/citation_signature","submit_replication":"https://pith.science/pith/EPELMVD626267FHWFGVRFVP7YR/action/replication_record"}},"created_at":"2026-05-18T00:12:30.686850+00:00","updated_at":"2026-05-18T00:12:30.686850+00:00"}