{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7AQRVVNLKGSCK4ADH5TLHXQOIU","short_pith_number":"pith:7AQRVVNL","schema_version":"1.0","canonical_sha256":"f8211ad5ab51a42570033f66b3de0e45151932c202122921fcbd6c0211305e13","source":{"kind":"arxiv","id":"1808.01137","version":1},"attestation_state":"computed","paper":{"title":"When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"math.PR","authors_text":"Anders Martinsson, Angelika Steger, Johannes Lengler","submitted_at":"2018-08-03T09:48:51Z","abstract_excerpt":"Hillclimbing is an essential part of any optimization algorithm. An important benchmark for hillclimbing algorithms on pseudo-Boolean functions $f: \\{0,1\\}^n \\to \\mathbb{R}$ are (strictly) montone functions, on which a surprising number of hillclimbers fail to be efficient. For example, the $(1+1)$-Evolutionary Algorithm is a standard hillclimber which flips each bit independently with probability $c/n$ in each round. Perhaps surprisingly, this algorithm shows a phase transition: it optimizes any monotone pseudo-boolean function in quasilinear time if $c<1$, but there are monotone functions fo"},"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":"1808.01137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-03T09:48:51Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"13c3d9f96549907886cd4fcea18e1b33e1846fee95a144f7d6ac033fb5dc8120","abstract_canon_sha256":"fbce45d4140e34e9811cbb27cd2fda0ed3771a0e54a2befc39967a8c65dea527"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:58.897772Z","signature_b64":"2Qlau2thNpPnBmzBOSkdvgRSREFHJPoTn1sLHRsFqG2BUAXGHUmRgHQ+PaG4lRFjHfk5WsGZX05NzuZl7KNrDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8211ad5ab51a42570033f66b3de0e45151932c202122921fcbd6c0211305e13","last_reissued_at":"2026-05-18T00:08:58.897143Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:58.897143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"math.PR","authors_text":"Anders Martinsson, Angelika Steger, Johannes Lengler","submitted_at":"2018-08-03T09:48:51Z","abstract_excerpt":"Hillclimbing is an essential part of any optimization algorithm. An important benchmark for hillclimbing algorithms on pseudo-Boolean functions $f: \\{0,1\\}^n \\to \\mathbb{R}$ are (strictly) montone functions, on which a surprising number of hillclimbers fail to be efficient. For example, the $(1+1)$-Evolutionary Algorithm is a standard hillclimber which flips each bit independently with probability $c/n$ in each round. Perhaps surprisingly, this algorithm shows a phase transition: it optimizes any monotone pseudo-boolean function in quasilinear time if $c<1$, but there are monotone functions fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.01137","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":"1808.01137","created_at":"2026-05-18T00:08:58.897244+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.01137v1","created_at":"2026-05-18T00:08:58.897244+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.01137","created_at":"2026-05-18T00:08:58.897244+00:00"},{"alias_kind":"pith_short_12","alias_value":"7AQRVVNLKGSC","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7AQRVVNLKGSCK4AD","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7AQRVVNL","created_at":"2026-05-18T12:32:11.075285+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/7AQRVVNLKGSCK4ADH5TLHXQOIU","json":"https://pith.science/pith/7AQRVVNLKGSCK4ADH5TLHXQOIU.json","graph_json":"https://pith.science/api/pith-number/7AQRVVNLKGSCK4ADH5TLHXQOIU/graph.json","events_json":"https://pith.science/api/pith-number/7AQRVVNLKGSCK4ADH5TLHXQOIU/events.json","paper":"https://pith.science/paper/7AQRVVNL"},"agent_actions":{"view_html":"https://pith.science/pith/7AQRVVNLKGSCK4ADH5TLHXQOIU","download_json":"https://pith.science/pith/7AQRVVNLKGSCK4ADH5TLHXQOIU.json","view_paper":"https://pith.science/paper/7AQRVVNL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.01137&json=true","fetch_graph":"https://pith.science/api/pith-number/7AQRVVNLKGSCK4ADH5TLHXQOIU/graph.json","fetch_events":"https://pith.science/api/pith-number/7AQRVVNLKGSCK4ADH5TLHXQOIU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7AQRVVNLKGSCK4ADH5TLHXQOIU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7AQRVVNLKGSCK4ADH5TLHXQOIU/action/storage_attestation","attest_author":"https://pith.science/pith/7AQRVVNLKGSCK4ADH5TLHXQOIU/action/author_attestation","sign_citation":"https://pith.science/pith/7AQRVVNLKGSCK4ADH5TLHXQOIU/action/citation_signature","submit_replication":"https://pith.science/pith/7AQRVVNLKGSCK4ADH5TLHXQOIU/action/replication_record"}},"created_at":"2026-05-18T00:08:58.897244+00:00","updated_at":"2026-05-18T00:08:58.897244+00:00"}