{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XTWNT3XAZS2BLCFEJODOKGI6I2","short_pith_number":"pith:XTWNT3XA","canonical_record":{"source":{"id":"1307.4274","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-07-16T13:45:24Z","cross_cats_sorted":[],"title_canon_sha256":"00da3bc30568b8fb6820ecfc3c8b3bfeed69c1efc6dc5c3b4107ea53f75e0171","abstract_canon_sha256":"e115fda327b7bdae3294b575807255c03c952b90953e515981265a3955e588af"},"schema_version":"1.0"},"canonical_sha256":"bcecd9eee0ccb41588a44b86e5191e46b7a40520b3852d2aa074241b7cef02f1","source":{"kind":"arxiv","id":"1307.4274","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4274","created_at":"2026-05-18T03:18:19Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4274v1","created_at":"2026-05-18T03:18:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4274","created_at":"2026-05-18T03:18:19Z"},{"alias_kind":"pith_short_12","alias_value":"XTWNT3XAZS2B","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XTWNT3XAZS2BLCFE","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XTWNT3XA","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XTWNT3XAZS2BLCFEJODOKGI6I2","target":"record","payload":{"canonical_record":{"source":{"id":"1307.4274","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-07-16T13:45:24Z","cross_cats_sorted":[],"title_canon_sha256":"00da3bc30568b8fb6820ecfc3c8b3bfeed69c1efc6dc5c3b4107ea53f75e0171","abstract_canon_sha256":"e115fda327b7bdae3294b575807255c03c952b90953e515981265a3955e588af"},"schema_version":"1.0"},"canonical_sha256":"bcecd9eee0ccb41588a44b86e5191e46b7a40520b3852d2aa074241b7cef02f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:19.249882Z","signature_b64":"Ba3AwXzINkxkrmKyXKCPCfLGBKXzzcIFdsLI5qFI5ayHI7WI9Cd7jOIUpxkKpb1MQATxZEGzaID+gUg/rJOoBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcecd9eee0ccb41588a44b86e5191e46b7a40520b3852d2aa074241b7cef02f1","last_reissued_at":"2026-05-18T03:18:19.249121Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:19.249121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.4274","source_version":1,"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-18T03:18:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1mWfzRYED0ApMbP9zOHoB9E4RXdIvIrhfVz77XM4gh1tB2gHTfNo9fM4IzDWw7nQgEWBShU9KFVXRNT3aMXKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:54:05.722096Z"},"content_sha256":"8e3768c452274b2f05ca81370922e4063827ac7821a9193e7e1fd88f674ad854","schema_version":"1.0","event_id":"sha256:8e3768c452274b2f05ca81370922e4063827ac7821a9193e7e1fd88f674ad854"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XTWNT3XAZS2BLCFEJODOKGI6I2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Fitness Level Method with Tail Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Carsten Witt","submitted_at":"2013-07-16T13:45:24Z","abstract_excerpt":"The fitness-level method, also called the method of f-based partitions, is an intuitive and widely used technique for the running time analysis of randomized search heuristics. It was originally defined to prove upper and lower bounds on the expected running time. Recently, upper tail bounds were added to the technique; however, these tail bounds only apply to running times that are at least twice as large as the expectation.\n  We remove this restriction and supplement the fitness-level method with sharp tail bounds, including lower tails. As an exemplary application, we prove that the running"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4274","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"},"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-18T03:18:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6uDPUFgL0jWqWHohuZXx0Hp4MjsZ1KXyH7zm1ceQoal1WkUa43qu0sloYUziAMP5Pig1ncn1M4OtPKf9X4zWDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:54:05.722779Z"},"content_sha256":"3a34ff416511f03cf91e5a9432bb1613f3676b8e7655efa65707a3ed63dc2134","schema_version":"1.0","event_id":"sha256:3a34ff416511f03cf91e5a9432bb1613f3676b8e7655efa65707a3ed63dc2134"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XTWNT3XAZS2BLCFEJODOKGI6I2/bundle.json","state_url":"https://pith.science/pith/XTWNT3XAZS2BLCFEJODOKGI6I2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XTWNT3XAZS2BLCFEJODOKGI6I2/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-05-31T21:54:05Z","links":{"resolver":"https://pith.science/pith/XTWNT3XAZS2BLCFEJODOKGI6I2","bundle":"https://pith.science/pith/XTWNT3XAZS2BLCFEJODOKGI6I2/bundle.json","state":"https://pith.science/pith/XTWNT3XAZS2BLCFEJODOKGI6I2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XTWNT3XAZS2BLCFEJODOKGI6I2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XTWNT3XAZS2BLCFEJODOKGI6I2","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":"e115fda327b7bdae3294b575807255c03c952b90953e515981265a3955e588af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-07-16T13:45:24Z","title_canon_sha256":"00da3bc30568b8fb6820ecfc3c8b3bfeed69c1efc6dc5c3b4107ea53f75e0171"},"schema_version":"1.0","source":{"id":"1307.4274","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4274","created_at":"2026-05-18T03:18:19Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4274v1","created_at":"2026-05-18T03:18:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4274","created_at":"2026-05-18T03:18:19Z"},{"alias_kind":"pith_short_12","alias_value":"XTWNT3XAZS2B","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XTWNT3XAZS2BLCFE","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XTWNT3XA","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:3a34ff416511f03cf91e5a9432bb1613f3676b8e7655efa65707a3ed63dc2134","target":"graph","created_at":"2026-05-18T03:18:19Z","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":"The fitness-level method, also called the method of f-based partitions, is an intuitive and widely used technique for the running time analysis of randomized search heuristics. It was originally defined to prove upper and lower bounds on the expected running time. Recently, upper tail bounds were added to the technique; however, these tail bounds only apply to running times that are at least twice as large as the expectation.\n  We remove this restriction and supplement the fitness-level method with sharp tail bounds, including lower tails. As an exemplary application, we prove that the running","authors_text":"Carsten Witt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-07-16T13:45:24Z","title":"The Fitness Level Method with Tail Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4274","kind":"arxiv","version":1},"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:8e3768c452274b2f05ca81370922e4063827ac7821a9193e7e1fd88f674ad854","target":"record","created_at":"2026-05-18T03:18:19Z","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":"e115fda327b7bdae3294b575807255c03c952b90953e515981265a3955e588af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-07-16T13:45:24Z","title_canon_sha256":"00da3bc30568b8fb6820ecfc3c8b3bfeed69c1efc6dc5c3b4107ea53f75e0171"},"schema_version":"1.0","source":{"id":"1307.4274","kind":"arxiv","version":1}},"canonical_sha256":"bcecd9eee0ccb41588a44b86e5191e46b7a40520b3852d2aa074241b7cef02f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bcecd9eee0ccb41588a44b86e5191e46b7a40520b3852d2aa074241b7cef02f1","first_computed_at":"2026-05-18T03:18:19.249121Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:19.249121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ba3AwXzINkxkrmKyXKCPCfLGBKXzzcIFdsLI5qFI5ayHI7WI9Cd7jOIUpxkKpb1MQATxZEGzaID+gUg/rJOoBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:19.249882Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.4274","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e3768c452274b2f05ca81370922e4063827ac7821a9193e7e1fd88f674ad854","sha256:3a34ff416511f03cf91e5a9432bb1613f3676b8e7655efa65707a3ed63dc2134"],"state_sha256":"b073972fc38135c15a5afa6272797f084514c0611ba42e6ef449897ceee68cdf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Smkpucaovwf0r3qnsy/gwHRH0kabuZkj/sqUzhC+KCQfeCpSb9V64Jjrkwx0u9/8RiZ7FxdJg3OOMcHoxJaCAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:54:05.726582Z","bundle_sha256":"c553fbccdc0eaee64c41d5c9e960e640bb373a3a6f4b5cbda4dc1f453b992b88"}}