{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZKLKCFEAA75X2BBIQW4CTYRCTW","short_pith_number":"pith:ZKLKCFEA","schema_version":"1.0","canonical_sha256":"ca96a1148007fb7d042885b829e2229daa11867eb881e9b8f9b3eed959a110e2","source":{"kind":"arxiv","id":"1909.03342","version":2},"attestation_state":"computed","paper":{"title":"Unlimited Budget Analysis of Randomised Search Heuristics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.NE","authors_text":"Christine Zarges, Jun He, Thomas Jansen","submitted_at":"2019-09-07T21:30:58Z","abstract_excerpt":"Performance analysis of all kinds of randomised search heuristics is a rapidly growing and developing field. Run time and solution quality are two popular measures of the performance of these algorithms. The focus of this paper is on the solution quality an optimisation heuristic achieves, not on the time it takes to reach this goal, setting it far apart from runtime analysis. We contribute to its further development by introducing a novel analytical framework, called unlimited budget analysis, to derive the expected fitness value after arbitrary computational steps. It has its roots in the ve"},"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":"1909.03342","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-09-07T21:30:58Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"35507a59c6beb85b091b5573ded195630d53959411547fe01299889a785085f7","abstract_canon_sha256":"52416a2f8def8f13fdb8ddbbea95cccc3ca7a0b13bd9b238256a183c54ec8bdc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:17:54.927487Z","signature_b64":"bV+7P9P0qzz73OFsqlae/bWIHUZc71aI02NEowzxU3SqZ091fRHbBsOzqL9Tx1LY/nthgDsvIJlDMZC7t4cWDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca96a1148007fb7d042885b829e2229daa11867eb881e9b8f9b3eed959a110e2","last_reissued_at":"2026-07-05T00:17:54.927049Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:17:54.927049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unlimited Budget Analysis of Randomised Search Heuristics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.NE","authors_text":"Christine Zarges, Jun He, Thomas Jansen","submitted_at":"2019-09-07T21:30:58Z","abstract_excerpt":"Performance analysis of all kinds of randomised search heuristics is a rapidly growing and developing field. Run time and solution quality are two popular measures of the performance of these algorithms. The focus of this paper is on the solution quality an optimisation heuristic achieves, not on the time it takes to reach this goal, setting it far apart from runtime analysis. We contribute to its further development by introducing a novel analytical framework, called unlimited budget analysis, to derive the expected fitness value after arbitrary computational steps. It has its roots in the ve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.03342","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.03342/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1909.03342","created_at":"2026-07-05T00:17:54.927103+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.03342v2","created_at":"2026-07-05T00:17:54.927103+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.03342","created_at":"2026-07-05T00:17:54.927103+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZKLKCFEAA75X","created_at":"2026-07-05T00:17:54.927103+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZKLKCFEAA75X2BBI","created_at":"2026-07-05T00:17:54.927103+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZKLKCFEA","created_at":"2026-07-05T00:17:54.927103+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/ZKLKCFEAA75X2BBIQW4CTYRCTW","json":"https://pith.science/pith/ZKLKCFEAA75X2BBIQW4CTYRCTW.json","graph_json":"https://pith.science/api/pith-number/ZKLKCFEAA75X2BBIQW4CTYRCTW/graph.json","events_json":"https://pith.science/api/pith-number/ZKLKCFEAA75X2BBIQW4CTYRCTW/events.json","paper":"https://pith.science/paper/ZKLKCFEA"},"agent_actions":{"view_html":"https://pith.science/pith/ZKLKCFEAA75X2BBIQW4CTYRCTW","download_json":"https://pith.science/pith/ZKLKCFEAA75X2BBIQW4CTYRCTW.json","view_paper":"https://pith.science/paper/ZKLKCFEA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.03342&json=true","fetch_graph":"https://pith.science/api/pith-number/ZKLKCFEAA75X2BBIQW4CTYRCTW/graph.json","fetch_events":"https://pith.science/api/pith-number/ZKLKCFEAA75X2BBIQW4CTYRCTW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZKLKCFEAA75X2BBIQW4CTYRCTW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZKLKCFEAA75X2BBIQW4CTYRCTW/action/storage_attestation","attest_author":"https://pith.science/pith/ZKLKCFEAA75X2BBIQW4CTYRCTW/action/author_attestation","sign_citation":"https://pith.science/pith/ZKLKCFEAA75X2BBIQW4CTYRCTW/action/citation_signature","submit_replication":"https://pith.science/pith/ZKLKCFEAA75X2BBIQW4CTYRCTW/action/replication_record"}},"created_at":"2026-07-05T00:17:54.927103+00:00","updated_at":"2026-07-05T00:17:54.927103+00:00"}