{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KJS3NSPNB2KIERCMTLRTMEBKRX","short_pith_number":"pith:KJS3NSPN","schema_version":"1.0","canonical_sha256":"5265b6c9ed0e9482444c9ae336102a8dfd9800da97ff3652b6a2aec91338fbb6","source":{"kind":"arxiv","id":"1307.2559","version":4},"attestation_state":"computed","paper":{"title":"General Drift Analysis with Tail Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Carsten Witt, Per Kristian Lehre","submitted_at":"2013-07-09T19:40:15Z","abstract_excerpt":"Drift analysis is one of the state-of-the-art techniques for the runtime analysis of randomized search heuristics (RSHs) such as evolutionary algorithms (EAs), simulated annealing etc. The vast majority of existing drift theorems yield bounds on the expected value of the hitting time for a target state, e.g., the set of optimal solutions, without making additional statements on the distribution of this time. We address this lack by providing a general drift theorem that includes bounds on the upper and lower tail of the hitting time distribution. The new tail bounds are applied to prove very p"},"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":"1307.2559","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-07-09T19:40:15Z","cross_cats_sorted":[],"title_canon_sha256":"8fd2c02106af48df279f26b766e3199f9dbe6e598288d0bbb56b48462c3e9052","abstract_canon_sha256":"be2804853f2e8874f4e7fc35a06750411c0d99022aa18ddd22d3df56358c827a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:48.007868Z","signature_b64":"N1ar8p2EhRbanZjvpUih/ZmeJv1Iy9GyItCojY0a1wwQhAtDe7VAMxCrZoqyyLfhH74q+PlDRk6hM1kob07nCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5265b6c9ed0e9482444c9ae336102a8dfd9800da97ff3652b6a2aec91338fbb6","last_reissued_at":"2026-05-18T00:14:48.007239Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:48.007239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"General Drift Analysis with Tail Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Carsten Witt, Per Kristian Lehre","submitted_at":"2013-07-09T19:40:15Z","abstract_excerpt":"Drift analysis is one of the state-of-the-art techniques for the runtime analysis of randomized search heuristics (RSHs) such as evolutionary algorithms (EAs), simulated annealing etc. The vast majority of existing drift theorems yield bounds on the expected value of the hitting time for a target state, e.g., the set of optimal solutions, without making additional statements on the distribution of this time. We address this lack by providing a general drift theorem that includes bounds on the upper and lower tail of the hitting time distribution. The new tail bounds are applied to prove very p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2559","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":"1307.2559","created_at":"2026-05-18T00:14:48.007342+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.2559v4","created_at":"2026-05-18T00:14:48.007342+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2559","created_at":"2026-05-18T00:14:48.007342+00:00"},{"alias_kind":"pith_short_12","alias_value":"KJS3NSPNB2KI","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"KJS3NSPNB2KIERCM","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"KJS3NSPN","created_at":"2026-05-18T12:27:49.015174+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.09047","citing_title":"Sharp Bounds on the Runtime of the (1+1) EA via Drift Analysis and Analytic Combinatorial Tools","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KJS3NSPNB2KIERCMTLRTMEBKRX","json":"https://pith.science/pith/KJS3NSPNB2KIERCMTLRTMEBKRX.json","graph_json":"https://pith.science/api/pith-number/KJS3NSPNB2KIERCMTLRTMEBKRX/graph.json","events_json":"https://pith.science/api/pith-number/KJS3NSPNB2KIERCMTLRTMEBKRX/events.json","paper":"https://pith.science/paper/KJS3NSPN"},"agent_actions":{"view_html":"https://pith.science/pith/KJS3NSPNB2KIERCMTLRTMEBKRX","download_json":"https://pith.science/pith/KJS3NSPNB2KIERCMTLRTMEBKRX.json","view_paper":"https://pith.science/paper/KJS3NSPN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.2559&json=true","fetch_graph":"https://pith.science/api/pith-number/KJS3NSPNB2KIERCMTLRTMEBKRX/graph.json","fetch_events":"https://pith.science/api/pith-number/KJS3NSPNB2KIERCMTLRTMEBKRX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KJS3NSPNB2KIERCMTLRTMEBKRX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KJS3NSPNB2KIERCMTLRTMEBKRX/action/storage_attestation","attest_author":"https://pith.science/pith/KJS3NSPNB2KIERCMTLRTMEBKRX/action/author_attestation","sign_citation":"https://pith.science/pith/KJS3NSPNB2KIERCMTLRTMEBKRX/action/citation_signature","submit_replication":"https://pith.science/pith/KJS3NSPNB2KIERCMTLRTMEBKRX/action/replication_record"}},"created_at":"2026-05-18T00:14:48.007342+00:00","updated_at":"2026-05-18T00:14:48.007342+00:00"}