Paper Citation Record · LEDGER

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization

As of 14 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 0 inbound Pith citation observations for arXiv:2501.07000.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2501.07000 v1

Coverage vector

measured 38 of 38 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-10T21:02:02.348857Z

measured 38 of 38 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-14T06:32:32.682623+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

38 of 38 outbound references displayed

verified exact0
verified fuzzy9
unresolved29
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 9fb80137-9b19-4795-a65d-53cd74b87e1a · outbound

This paper cites Average drift analysis and population scalability,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization Average drift analysis and population scalability,

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-10T21:02:02.200732Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5d56e6f6-8aad-4d3d-8ee6-ee4602abc619 · outbound

This paper cites A new approach for analyzing average time complexity of population-based evolutionary algorithms on unimodal problems,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization A new approach for analyzing average time complexity of population-based evolutionary algorithms on unimodal problems,

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-10T21:02:02.205397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5e94e7f8-2a8c-4989-b0b8-d0bd26260599 · outbound

This paper cites An experimental method to estimate running time of evolutionary algorithms for continuous optimization,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization An experimental method to estimate running time of evolutionary algorithms for continuous optimization,

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-10T21:02:02.209745Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d12ca443-a0c9-40c0-b88d-73ee3299d593 · outbound

This paper cites Runtime analysis for continuous (1+1) evolutionary algorithm based on average gain model (in Chinese),.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization Runtime analysis for continuous (1+1) evolutionary algorithm based on average gain model (in Chinese),

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-10T21:02:02.214059Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a9fcf016-d052-4b41-a132-c6b9b6805b2c · outbound

This paper cites First hitting time analysis of continuous evolutionary algorithms based on average gain,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization First hitting time analysis of continuous evolutionary algorithms based on average gain,

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-10T21:02:02.218536Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e3c04478-0d24-4f4e-831d-bf14577ba98f · outbound

This paper cites A first runtime analysis of the NSGA-II on a multimodal problem,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization A first runtime analysis of the NSGA-II on a multimodal problem,

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T21:02:02.776919Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 3cbab735-7a25-43db-b122-b3cfd08a594a · outbound

This paper cites Runtime analysis for the NSGA-II: proving, quantifying, and explaining the inefficiency for many objectives,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization Runtime analysis for the NSGA-II: proving, quantifying, and explaining the inefficiency for many objectives,

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-10T21:02:02.226820Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 73572be0-ee76-4b52-8472-aaec2ccba5d0 · outbound

This paper cites Runtime analysis for the NSGA-II: Provable speed- ups from crossover,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization Runtime analysis for the NSGA-II: Provable speed- ups from crossover,

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T21:02:02.758118Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 49578370-d26c-4d26-9f9b-2234926f032f · outbound

This paper cites Towards running time analysis of interactive multi-objective evolutionary algorithms,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization Towards running time analysis of interactive multi-objective evolutionary algorithms,

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-10T21:02:02.234614Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 02c2368c-6d91-450b-9d81-1b1d1de1c52b · outbound

This paper cites An archive can bring provable speed-ups in multi-objective evolutionary algorithms,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization An archive can bring provable speed-ups in multi-objective evolutionary algorithms,

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-10T21:02:02.238381Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1bab6d81-2036-49c2-9505-a6be2a0e4569 · outbound

This paper cites Stochastic population update can provably be helpful in multi-objective evolutionary algorithms,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization Stochastic population update can provably be helpful in multi-objective evolutionary algorithms,

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-10T21:02:02.242180Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5b65c1ea-eb2e-4dd8-9633-7147a0364d8b · outbound

This paper cites Better running time of the non-dominated sorting genetic algorithm II (NSGA-II) by using stochastic tournament selection,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization Better running time of the non-dominated sorting genetic algorithm II (NSGA-II) by using stochastic tournament selection,

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-10T21:02:02.246089Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 94fcea21-5df4-45f9-97b8-547662802a17 · outbound

This paper cites Analysis of multiobjective evolutionary algorithms on the biobjective traveling salesman problem (1, 2),.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization Analysis of multiobjective evolutionary algorithms on the biobjective traveling salesman problem (1, 2),

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T21:02:02.715411Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation c8494ab1-2f14-4468-ab59-c5cd0a2bde37 · outbound

This paper cites Quality-diversity algorithms can provably be helpful for optimization,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization Quality-diversity algorithms can provably be helpful for optimization,

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-10T21:02:02.253245Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d215cb1e-5a49-4069-b406-a5c7ae8a99dc · outbound

This paper cites Analysing the robustness of NSGA-II under noise,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization Analysing the robustness of NSGA-II under noise,

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-10T21:02:02.256703Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fa78acae-b06d-4151-82f3-f7ad2e61c9b7 · outbound

This paper cites Drift analysis and average time complexity of evolutionary algorithms,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization Drift analysis and average time complexity of evolutionary algorithms,

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-10T21:02:02.260039Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7df9ea0b-6b4f-4ade-8301-c9fed5317a46 · outbound

This paper cites A survey on recent progress in the theory of evolutionary algorithms for discrete optimization,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization A survey on recent progress in the theory of evolutionary algorithms for discrete optimization,

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-10T21:02:02.263888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7ed62dbb-a561-4c72-83fd-b25bff34e122 · outbound

This paper cites Combining Markov-Chain analysis and drift analysis: The (1+1) evolutionary algorithm on linear functions reloaded.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization Combining Markov-Chain analysis and drift analysis: The (1+1) evolutionary algorithm on linear functions reloaded

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-10T21:02:02.267557Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation eb78faac-437a-41ed-83f9-34c38e175c2a · outbound

This paper cites Simplified drift analysis for proving lower bounds in evolutionary computation,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization Simplified drift analysis for proving lower bounds in evolutionary computation,

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-10T21:02:02.271430Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4037bda0-b849-4a1c-b748-ce158eeae3ef · outbound

This paper cites Tight bounds on the optimization time of a randomized search heuristic on linear functions,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization Tight bounds on the optimization time of a randomized search heuristic on linear functions,

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T21:02:02.658195Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 23bf8315-75b9-491d-94fe-6ab8c0081f8d · outbound

This paper cites Runtime analysis of a co-evolutionary algorithm: Overcoming negative drift in maximin- optimisation,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization Runtime analysis of a co-evolutionary algorithm: Overcoming negative drift in maximin- optimisation,

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-10T21:02:02.279216Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 73797829-57df-4282-a28f-34e390fd3991 · outbound

This paper cites Doerr and F.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization Doerr and F

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T21:02:02.636910Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 218ea89a-2712-4c2d-b9ac-c2b832c9df27 · outbound

This paper cites The interplay of population size and mutation probability in the (1+ λ) EA on OneMax,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization The interplay of population size and mutation probability in the (1+ λ) EA on OneMax,

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T21:02:02.510581Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 551c7318-d0a6-4c9a-bb90-e456e181303d · outbound

This paper cites The impact of random initialization on the runtime of randomized search heuristics,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization The impact of random initialization on the runtime of randomized search heuristics,

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T21:02:02.497141Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation f798c0f4-824b-47b6-bb3d-91771d87c131 · outbound

This paper cites A rigorous complexity analysis of the (1+ 1) evolutionary algorithm for separable functions with Boolean inputs,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization A rigorous complexity analysis of the (1+ 1) evolutionary algorithm for separable functions with Boolean inputs,

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T21:02:02.483346Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation c95e50a0-4a19-40fb-bcec-23282ce6c033 · outbound

This paper cites Runtime analysis of a multi-valued compact genetic algorithm on generalized OneMax,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization Runtime analysis of a multi-valued compact genetic algorithm on generalized OneMax,

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T21:02:02.470137Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 8e3cfd70-1fb7-48b6-abaa-6f3cb82cae95 · outbound

This paper cites Runtime analysis of evolutionary algorithms for the knapsack problem with favorably correlated weights,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization Runtime analysis of evolutionary algorithms for the knapsack problem with favorably correlated weights,

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-10T21:02:02.302703Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation df639593-e3de-4016-9ae6-d32f1a4e5856 · outbound

This paper cites Runtime analysis of the (1+( λ, λ)) genetic algorithm on random satisfiable 3-CNF formulas,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization Runtime analysis of the (1+( λ, λ)) genetic algorithm on random satisfiable 3-CNF formulas,

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-10T21:02:02.307182Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3a9586d2-eaea-4d04-a588-cdf8439d085c · outbound

This paper cites Improved runtime bounds for the (1+ 1) EA on random 3-CNF formulas based on fitness-distance correlation,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization Improved runtime bounds for the (1+ 1) EA on random 3-CNF formulas based on fitness-distance correlation,

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-10T21:02:02.311830Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1384977d-57ab-4ce4-b314-ffb20bbeac95 · outbound

This paper cites A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT,

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-10T21:02:02.316161Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7954940a-4ff8-4915-8c07-8f19124eb032 · outbound

This paper cites Evolutionary computation: Comments on the history and current state,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization Evolutionary computation: Comments on the history and current state,

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-10T21:02:02.320074Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e4a42684-b03f-470b-9070-3e1990bcebad · outbound

This paper cites Durrett, Probability: Theory and Examples.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization Durrett, Probability: Theory and Examples

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-10T21:02:02.324125Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6dc77224-9c1d-4522-9ba6-f9bc196d9eed · outbound

This paper cites A new approach to estimating the expected first hitting time of evolutionary algorithms,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization A new approach to estimating the expected first hitting time of evolutionary algorithms,

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-10T21:02:02.327958Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8eb2386e-b964-4443-ac5c-4f989b439907 · outbound

This paper cites Quality gain analysis of the weighted recombination evolution strategy on general convex quadratic functions,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization Quality gain analysis of the weighted recombination evolution strategy on general convex quadratic functions,

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-10T21:02:02.331923Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 84b744cc-fd20-4ca9-81d6-8f84a74716c0 · outbound

This paper cites Runtime analysis of the (1+ 1) evolutionary algorithm for the chance-constrained knapsack problem,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization Runtime analysis of the (1+ 1) evolutionary algorithm for the chance-constrained knapsack problem,

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-10T21:02:02.335675Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fd3a01ad-fd28-43c5-8136-af395ccdbc3d · outbound

This paper cites Runtime analysis of RLS and the (1+ 1) EA for the chance-constrained knapsack problem with correlated uniform weights,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization Runtime analysis of RLS and the (1+ 1) EA for the chance-constrained knapsack problem with correlated uniform weights,

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-10T21:02:02.339363Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 98a11b59-2200-4bfb-8a32-f8ecb4d13999 · outbound

This paper cites Analysis of the (1+ 1) EA on subclasses of linear functions under uniform and linear constraints,.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization Analysis of the (1+ 1) EA on subclasses of linear functions under uniform and linear constraints,

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-10T21:02:02.344551Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f1b16082-101a-417e-b8cd-a7be0e3cb1fb · outbound

This paper cites an unresolved cited work.

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization Unresolved cited work

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-10T21:02:02.348857Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.