{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:W7ZTE2ZXZ66SCK4JXTSK4NOXYD","short_pith_number":"pith:W7ZTE2ZX","canonical_record":{"source":{"id":"1704.00026","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-03-31T19:00:08Z","cross_cats_sorted":[],"title_canon_sha256":"97b7ee70500a951c00f577a7a322d994485bd3ba43a01e83b41545470d7b5c71","abstract_canon_sha256":"8ea294142739bf1b52fb9602d4d60d386f1a8f30ba9b0e98ab178a33a92e68b7"},"schema_version":"1.0"},"canonical_sha256":"b7f3326b37cfbd212b89bce4ae35d7c0d5190bcd4ef9e45006e451eed02d2651","source":{"kind":"arxiv","id":"1704.00026","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00026","created_at":"2026-05-18T00:14:01Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00026v4","created_at":"2026-05-18T00:14:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00026","created_at":"2026-05-18T00:14:01Z"},{"alias_kind":"pith_short_12","alias_value":"W7ZTE2ZXZ66S","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"W7ZTE2ZXZ66SCK4J","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"W7ZTE2ZX","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:W7ZTE2ZXZ66SCK4JXTSK4NOXYD","target":"record","payload":{"canonical_record":{"source":{"id":"1704.00026","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-03-31T19:00:08Z","cross_cats_sorted":[],"title_canon_sha256":"97b7ee70500a951c00f577a7a322d994485bd3ba43a01e83b41545470d7b5c71","abstract_canon_sha256":"8ea294142739bf1b52fb9602d4d60d386f1a8f30ba9b0e98ab178a33a92e68b7"},"schema_version":"1.0"},"canonical_sha256":"b7f3326b37cfbd212b89bce4ae35d7c0d5190bcd4ef9e45006e451eed02d2651","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:01.204070Z","signature_b64":"IrXVyrv/5KYhyJzgfyD7CLjCfQEiIGmVflltyNWxOAggZg02Fr9jk318/V7+mG8cuwDjWgxRjrf7/lMUADaMBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7f3326b37cfbd212b89bce4ae35d7c0d5190bcd4ef9e45006e451eed02d2651","last_reissued_at":"2026-05-18T00:14:01.203498Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:01.203498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.00026","source_version":4,"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-18T00:14:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ZKQU+DMj21VuA1/Tibq2UvKsS11SlWYXiFlg9kBYNT2zsWuTSJ5RT//MgSy9Ybf5OQpfLfxZK1ZnqhXW2hvDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:41:04.436178Z"},"content_sha256":"1a312c5bb542adb51590629cbf95b1b042a6d88b1cbe6a29d24c17867f61a01d","schema_version":"1.0","event_id":"sha256:1a312c5bb542adb51590629cbf95b1b042a6d88b1cbe6a29d24c17867f61a01d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:W7ZTE2ZXZ66SCK4JXTSK4NOXYD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Upper Bounds on the Runtime of the Univariate Marginal Distribution Algorithm on OneMax","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Carsten Witt","submitted_at":"2017-03-31T19:00:08Z","abstract_excerpt":"A runtime analysis of the Univariate Marginal Distribution Algorithm (UMDA) is presented on the OneMax function for wide ranges of its parameters $\\mu$ and $\\lambda$. If $\\mu\\ge c\\log n$ for some constant $c>0$ and $\\lambda=(1+\\Theta(1))\\mu$, a general bound $O(\\mu n)$ on the expected runtime is obtained. This bound crucially assumes that all marginal probabilities of the algorithm are confined to the interval $[1/n,1-1/n]$. If $\\mu\\ge c' \\sqrt{n}\\log n$ for a constant $c'>0$ and $\\lambda=(1+\\Theta(1))\\mu$, the behavior of the algorithm changes and the bound on the expected runtime becomes $O("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00026","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"},"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-18T00:14:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T/D0mkOpHGNo0Is6K4PrCUsyauGiSBtWJ/ve0HhawLVopYuF9WX5rv+4TtWtZ4WjJqvKPllKkMSagG1pnpoKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:41:04.436540Z"},"content_sha256":"6b749beb1a5102a1d686800ecb82664ca6ee6dc4fcd892faded8554232b2494f","schema_version":"1.0","event_id":"sha256:6b749beb1a5102a1d686800ecb82664ca6ee6dc4fcd892faded8554232b2494f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W7ZTE2ZXZ66SCK4JXTSK4NOXYD/bundle.json","state_url":"https://pith.science/pith/W7ZTE2ZXZ66SCK4JXTSK4NOXYD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W7ZTE2ZXZ66SCK4JXTSK4NOXYD/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-06-01T12:41:04Z","links":{"resolver":"https://pith.science/pith/W7ZTE2ZXZ66SCK4JXTSK4NOXYD","bundle":"https://pith.science/pith/W7ZTE2ZXZ66SCK4JXTSK4NOXYD/bundle.json","state":"https://pith.science/pith/W7ZTE2ZXZ66SCK4JXTSK4NOXYD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W7ZTE2ZXZ66SCK4JXTSK4NOXYD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:W7ZTE2ZXZ66SCK4JXTSK4NOXYD","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":"8ea294142739bf1b52fb9602d4d60d386f1a8f30ba9b0e98ab178a33a92e68b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-03-31T19:00:08Z","title_canon_sha256":"97b7ee70500a951c00f577a7a322d994485bd3ba43a01e83b41545470d7b5c71"},"schema_version":"1.0","source":{"id":"1704.00026","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00026","created_at":"2026-05-18T00:14:01Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00026v4","created_at":"2026-05-18T00:14:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00026","created_at":"2026-05-18T00:14:01Z"},{"alias_kind":"pith_short_12","alias_value":"W7ZTE2ZXZ66S","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"W7ZTE2ZXZ66SCK4J","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"W7ZTE2ZX","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:6b749beb1a5102a1d686800ecb82664ca6ee6dc4fcd892faded8554232b2494f","target":"graph","created_at":"2026-05-18T00:14:01Z","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":"A runtime analysis of the Univariate Marginal Distribution Algorithm (UMDA) is presented on the OneMax function for wide ranges of its parameters $\\mu$ and $\\lambda$. If $\\mu\\ge c\\log n$ for some constant $c>0$ and $\\lambda=(1+\\Theta(1))\\mu$, a general bound $O(\\mu n)$ on the expected runtime is obtained. This bound crucially assumes that all marginal probabilities of the algorithm are confined to the interval $[1/n,1-1/n]$. If $\\mu\\ge c' \\sqrt{n}\\log n$ for a constant $c'>0$ and $\\lambda=(1+\\Theta(1))\\mu$, the behavior of the algorithm changes and the bound on the expected runtime becomes $O(","authors_text":"Carsten Witt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-03-31T19:00:08Z","title":"Upper Bounds on the Runtime of the Univariate Marginal Distribution Algorithm on OneMax"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00026","kind":"arxiv","version":4},"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:1a312c5bb542adb51590629cbf95b1b042a6d88b1cbe6a29d24c17867f61a01d","target":"record","created_at":"2026-05-18T00:14:01Z","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":"8ea294142739bf1b52fb9602d4d60d386f1a8f30ba9b0e98ab178a33a92e68b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-03-31T19:00:08Z","title_canon_sha256":"97b7ee70500a951c00f577a7a322d994485bd3ba43a01e83b41545470d7b5c71"},"schema_version":"1.0","source":{"id":"1704.00026","kind":"arxiv","version":4}},"canonical_sha256":"b7f3326b37cfbd212b89bce4ae35d7c0d5190bcd4ef9e45006e451eed02d2651","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7f3326b37cfbd212b89bce4ae35d7c0d5190bcd4ef9e45006e451eed02d2651","first_computed_at":"2026-05-18T00:14:01.203498Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:01.203498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IrXVyrv/5KYhyJzgfyD7CLjCfQEiIGmVflltyNWxOAggZg02Fr9jk318/V7+mG8cuwDjWgxRjrf7/lMUADaMBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:01.204070Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.00026","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a312c5bb542adb51590629cbf95b1b042a6d88b1cbe6a29d24c17867f61a01d","sha256:6b749beb1a5102a1d686800ecb82664ca6ee6dc4fcd892faded8554232b2494f"],"state_sha256":"4beafdfefb692c5c9758e24b70845de024255d2252a895c57f1f38c89430f32a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fg4VgsAoVS2/bL1CyXqzNGF7XvLD/yeR5HSiPPmb3M2odi+nNcFHo51IH+yyli3JqQlW+LnzWg/G4heJQHY2Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:41:04.438724Z","bundle_sha256":"857ceb2059602cc43727e3a7590dfe7bb525e8809e58b8bb2e089fa2844e7236"}}