{"as_of":"2026-08-10T08:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6cbe167a3b4d81bfba0a78cd246cdc6f9488ee30eca64b1461f6ce6742864726","coverage":[{"denominator":104,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T03:44:36.121772Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.11705/citation-record","integrity":"/paper/2607.11705/integrity","json":"/paper/2607.11705/citation-record.json","paper":"/paper/2607.11705"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Minimal data, maximum clarity: A heuristic for explaining optimization,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:78414518f97b1f247b7e0fe1cca74e5e719155e9ef7eec8c9668ef8d87612513","observation_id":"4a71926a-12b6-48d9-8c58-7d96827b10cf","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Moot: a repository of many multi-objective optimiza- tion tasks,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:893f907e49a5964beeb19407a13dcb02a3146f9ec616d113e7ba75a8c5c7d656","observation_id":"ea6cd312-0391-481a-ab67-c418923b71ea","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Promisetune: Unveiling causally promising and explainable configuration tuning,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:247a1a6aae04b67be2c4710fbc144816aaaa5b56d8fdad8225424b84e8847e44","observation_id":"89a6f547-ffba-4904-9670-840d954c8580","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Can large language models improve se active learning via warm-starts?","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:577c869431619a782b8b122c7bf7ce1d763cd6ba9f0cf7db4833f05ed89107af","observation_id":"83d70118-137f-43d6-a671-c757b75068b9","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.21086","last_updated":"2026-07-22T23:31:26Z","snapshot_observed_at":"2026-08-07T16:34:03.568286Z","submitted_at":"2025-03-27T02:02:06Z","title":"Less Noise, More Signal: the DRR Effect for Better Optimizations of a Range of SE Tasks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.21086","snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Less noise, more signal: Drr for better optimizations of se tasks,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"cited_paper":"/paper/2503.21086","citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:dfb205dba06e9104cdbec132b0c6a904e9e4957303a6043f932bcca21fb8231e","observation_id":"d0d8b6da-fbac-4b84-9b1f-bf92d8cb09f9","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Learning from very little data: On the value of landscape analysis for predicting software project health,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:10c170ab57e20a9a3efb1e00bbee9aff335712130c488ecc0936956f711e0fbe","observation_id":"d42b2ac5-476d-4006-b228-e89bb0d305d6","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Finding faster configurations using flash,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:395792991f650e917cfad6b5898192652d7e9283a5f591939c4cdb285edc484e","observation_id":"0101af79-dc0b-420d-8b09-2c9495b53f1a","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Russell and P","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:87c4874fc03728c400c72db7d39f627b39535e7690052bdbd53478e893e76240","observation_id":"a21a9b8d-0e03-49e7-a8af-74f11d2d8831","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"A theoretical and empirical study of search-based testing: Local, global, and hybrid search,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:65a805c63dabd80d32258b477bd0824d714796fcbbd5e06684690e8d84064a2c","observation_id":"20663359-07eb-44c4-a39b-8fa2759e19e6","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Search-based software engineering: Trends, techniques and applications,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:a9c862f1b9a67fa6127060225422d26272c4c77edeaf652390a20d4d0bfbc297","observation_id":"16f0c163-d1bb-456a-9f75-0f65a5d22855","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Pyart: Python api recommendation in real-time,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:080ad0945b0d5f6053cb04270bd4a2806ea23b4a6263710c372cdd1b0a6323de","observation_id":"b032bc2d-f246-4e72-8943-16e8b5e2deb0","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Optimization by simulated annealing,","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:f18aa41736891fc0e7b59d94895b03323af564a8af944a2778f8bd8c97c2eebe","observation_id":"11f0ccf0-a153-40e6-b978-744bc9dd04b6","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"The current state and future of search based software engineering,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:7610e01556f08b93d1144b429a186d2929e794a1456000cab37bb994d183a41b","observation_id":"68fba568-8fca-4da3-b606-3150448814cd","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Search-based fault local- ization,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:dd3b7fef97275526f2f435b759ef16b1524e90968f946be6451b0e48bbcc4b2d","observation_id":"dac7adbf-f2fe-4d83-9f1c-e5d52324e081","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Evolutionsstrategie,","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:b501fc2826bf79f1bb15a05d2c7f5fb475a209ca91994195c8a407e9c505c880","observation_id":"42cf1962-d739-48d7-9a21-be77b5c12dab","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Test suite generation with the many independent objective (mio) algorithm,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:882078c5fb648adde307dff55528fee2cb8821c3b96c63efd37842ae00893bd5","observation_id":"7277586b-94a0-415f-8876-56ed6782b76d","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Iterated local search,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:76ff90ee2b79d85d349c6fefca1da79ea7863872633e29f753c3475c84546b73","observation_id":"05359d22-34c1-4d8d-b3b9-83d2b575e38a","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"A genetic programming based iterated local search for software project scheduling,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:ba7b0c310b4e715d42230f6f99b431e9b89274e6a2e04ba36581cdac5490318d","observation_id":"2292415f-38cd-4eda-959c-0e115ca4017a","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Tabu search—part i,","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:1fc491059b55927750f77ee54730b55cdcb3c85f3464332a01a1dcf7e457648b","observation_id":"e58f4676-5bd8-4dc8-bc8d-459225d7c21a","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"A tabu search algorithm for structural software testing,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:36b27a7820250df14be1aa244c8a5c2e06e7a41519c9cb383ca639cfc66da7ee","observation_id":"f02ff132-71f2-4319-9a1c-7ff13340ad93","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Transfer learning for cross- company software defect prediction,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:38b88b1820ff740e2841dc7ef455f098ad669a869fb8d8611d1661dc9dada28c","observation_id":"8e83cc0f-bfc2-47b9-88be-66c92a3fcd67","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"How to “dodge","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:1e715d29a7e36457754c2a84d52b29e7d2104aff83c9c60adb263eff9ebb27b6","observation_id":"3237108e-42ad-4bbf-bc92-2b6107470781","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":null,"venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:6015825eae72285e22dd309a03083d9222953983662ab87250e45ae840a62b7a","observation_id":"9119e904-7999-401b-a23f-621b64fedf36","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Genprog: A generic method for automatic software repair,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:04cb9b76f7804246175d53360310e36f18579f71b4611a57e73027ce8f597ac2","observation_id":"c2f70f60-2d0c-4efa-908a-9a7122756749","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"An empirical study of meta-and hyper-heuristic search for multi-objective release planning,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:d191f4af127af4355005c8f18249daa186e59dcf4703984c5b61be933b088271","observation_id":"135cd72f-9901-4126-8ae2-a62621389c56","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"From recombination of genes to the estimation of distributions i. binary parameters,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:1694b6212a49c98c487e369ea6ee305e96a4b2b1b15b527ca95b30a331e09940","observation_id":"0e969017-53db-4125-8b73-0ed4d4ccc11e","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Test data generation for mutation testing based on markov chain usage model and estimation of distribution algorithm,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:fdada4dfc395de54e1d6d9faca2863a42c406f075d0c57bf546850a5b1a3bb70","observation_id":"22700547-13e0-45a8-aa17-baca7c178f56","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Particle swarm optimization,","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:73ffd50639af4afadc1b927412638411fe6e4dcebf9091c77444230a43a873db","observation_id":"da20b2c2-9f0b-41f5-8855-e4b289c0339e","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Learning seed-adaptive mutation strategies for greybox fuzzing,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:4f77b447cd6badbb89fca7203c7016117021d4a199035b272d75d58922677cd5","observation_id":"1910308d-1529-4522-bded-ed3cc483b11e","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Differential evolution–a simple and efficient heuristic for global optimization over continuous spaces,","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:ec439c7ab4e6760e4ee93bc145ef571a912b73a30f7e16b20edb66ef46a6e2c6","observation_id":"779004dc-912e-4fbc-8c64-243b5d64bc16","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Easy over hard: A case study on deep learning,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:bfc3506a091b7e822187b899a038ce6fddec19e0f8cb9cdd64bbb84a031f1815","observation_id":"8202411b-3e61-4e8e-8f50-d2ad9c9e05ad","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Sequential model-based optimization for general algorithm configuration,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:ce8af6f7196904b0f8d8f4cd25ba266bd092f695fe6a85dbe090b4fe4932769f","observation_id":"83a9d22e-a525-4fcf-ab81-7cbeb33778d4","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"How low can you go? the data-light SE challenge,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:81fc05b3f6d17949d6a9babde6b2b6077e8bff613a346953ec3e4202f64cdc23","observation_id":"8bf7accf-f476-41cf-8967-8d1e93c5c75b","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Algorithms for hyper-parameter optimization,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:3a4ebb45cd4a56d0215a812bd430892ceb4f9e5e57695a0d8ccf24de181225c2","observation_id":"b1a9081c-b741-4df2-ac99-d10d687dd2cd","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Efficient compiler autotuning via bayesian optimization,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:bc43f612e5913b044d64e6495baa9d0db75a2e850681a5d04715e0fc1d05f44f","observation_id":"48fc0607-e01e-4e73-9b70-0f846b5ceda5","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"“sampling","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:1891398bc2fb6325ead939384fc2efd9e91bc38370f706c95d16977a22b2588a","observation_id":"6304445a-9fc6-4a1d-b08e-253500ee1c77","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Accuracy can lie: On the impact of surrogate model in configuration tuning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:f55c8d494cbd257d743fb4ecf402e6e93fa5571a1dcf5c09d04f6f19b54c63a4","observation_id":"6606aeea-6d29-49f3-a4ab-3bafbc833ff2","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Random search for hyper-parameter opti- mization","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:512635f4d91a6d2aff07f95cb8a08adee552e11abbc41f672a686e76218f90a0","observation_id":"5250f527-9552-4652-b75a-872d0c28f416","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"A fast and elitist multiobjective genetic algorithm: Nsga-ii,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:d26ad1bdfe3897bb69a7c4bc6ff8c498d0ae061bf617c92c8f0fbf3541d8344d","observation_id":"aad304e7-1c0d-471f-85df-eabd12c7c3b9","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Many-objective software remodularization using nsga-iii,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:79368fda6d7bc06ed149ffe303d155f44f9e079d9303d2910f8040aa85e2fe24","observation_id":"bbeb0508-1b08-4af5-90b4-197f19cf7db8","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"A multi-objective test data generation approach for mutation testing of feature models,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:99787785a3103f22fd314148df8d7d6c022181dbf950d7441f74c0891b2b53f8","observation_id":"6e15cbcf-6eda-483d-ae93-626589aa8bdd","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Spea2: Improving the strength pareto evolutionary algorithm,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:8bc32a600170c53868ce755d61d473b468348b7ec798383c3b5fabd373670ecb","observation_id":"356aad16-2fbf-4124-88da-d27f369aefbb","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Sms-emoa: Multiobjective selection based on dominated hypervolume,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:2544c99825568052b978cd29fbcb772018badc62964e6989673ad39051d2c89e","observation_id":"d9ecb7a1-1899-46e0-8e0c-eca72c13b31e","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"An empirical study on pareto based multi-objective feature selection for software defect prediction,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:19eee67e47fd84b45756d8e399e3908d50fc8658acfcad4da41764564d5e5702","observation_id":"a8106113-6448-4282-b650-1ba36ebf378e","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Moea/d: A multiobjective evolutionary algorithm based on decomposition,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:07ad197a6d4f23b8ce01ac57e64b1085873ab7eb714309dafaaeda75a5dabb78","observation_id":"c47384ef-b423-4edf-8cc0-2eb6389150ab","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Compiler auto-tuning via critical flag selection,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:573c3f40701f4f58a2893b4310ef9cf8aa3eb70893a10882d5c122dde0289d54","observation_id":"93e98a5c-44e3-40b9-9374-1fd5cc25a4a5","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Automatic database management system tuning through large-scale machine learn- ing,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:4f571c082048e5a30c844c2865fa768738961ab57b581a86b3ca33d2e30d528c","observation_id":"e7a9ec7b-dca3-49ec-a87a-2b90d082e0a4","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"On the value of user preferences in search-based software engineering: A case study in software product lines,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:fe4bd23e97417db44f92b910917999af4c36a18beb8d50e7554dc9ccfeba26e7","observation_id":"25ab67bf-b074-456e-ad9d-3a278d94b2bb","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"An end-to-end automatic cloud database tuning system using deep reinforcement learning,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:3f635381824272baca8a975820b647df8d9154c2b7be2e3227d1d0815da19d7e","observation_id":"10c0548c-effe-4681-a5c9-b8cbf3380991","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Iterative generation of adversarial example for deep code models,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:addf84c7a7011c90bac401b4d8a4f32a496f609cd80fe7cea0a9294162fc8196","observation_id":"b17d52f7-1a94-4857-a939-ef1e70f92780","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"No free lunch theorems for optimization,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:06ccc75b223cd05e3524e531e019679066c78c3bab4df5e0e73a5365e0c0c37d","observation_id":"6628f77d-0387-47fb-a0cf-ed1b95057af9","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Toward automated algorithm design: A survey and practical guide to meta- black-box-optimization,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:b4c8fe566251275a11774d36403083d6c022acdabd0d39eab32a98e0a0aa8035","observation_id":"8c52c74b-0572-4792-bceb-46fb66cd2698","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"How efficient is llm-generated code? a rigorous & high-standard benchmark,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:7c5781eb04f0b16d31c2a359b1f32f7e059ed7b549a4a14565c8790dc2ca9c10","observation_id":"d6f6e265-6ddc-45a6-80eb-f36cc2ac5706","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Simpler hyperparameter optimization for software analytics: Why, how, when?","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:871c716bffe9b7839e800343a5671f963b23a5907693c90b827a756abf7656e8","observation_id":"a10d6a91-0025-429f-9ddf-94d626dd855b","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Analysing the fitness landscape of search-based software testing problems,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:a3c92cbe752dcddd3afed18cbc688911abe1b59203edff0a56461827a623b4fb","observation_id":"a5737340-ac4c-4283-ac7b-33b3c213bcc1","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Causes and effects of fitness landscapes in unit test generation,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:b89ae8ebb64d0f7e0838d5f5c922c4fed82ea1c97cdce45055c0ff48340d31f3","observation_id":"e9c70ace-ff79-4f65-bfc3-699e38920312","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Large language models for software engi- neering: A systematic literature review,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:e698ad6c93b15aebe21345d93350be0e6e52ccd1dd4907f5ac1fa91b22ecbb81","observation_id":"9b5757d4-d8ee-4229-a788-ea5761ec1a92","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"The design, analysis and interpretation of reper- tory grids,","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:e3b97956dc58eba7cabe140aaea597802e7286db92dbf0f72d6b3a885e96a992","observation_id":"7953f753-fae6-4fb4-9673-e29884a5eb41","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Heuristics for systems engineering cost estimation,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:ef5eff42e83bce57a6dfdebc54d858d18c8265d50f53d5dfd749d7d2fa27c05d","observation_id":"2dac029e-58bd-4baf-ade0-a75428e20baa","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Identifying self-admitted technical debts with jitterbug: A two-step approach,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:7a6091a1b4aad763a7ffc6ebb2bbb372b1c2b8260f3a1dc1e87680ff62236903","observation_id":"d415e699-7725-440d-b693-4ee98307c351","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Data quality matters: A case study on data label correctness for security bug report prediction,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:9c986226ddf0da4077b6171058ff7f47df9da2f5c65553bf496c47dd778d8ea9","observation_id":"807ab23b-0345-4883-a577-45389c9edf9d","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Detecting false alarms from automatic static analysis tools: How far are we?","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:5e927bc38c78a11e8583404d9ef69c30a54f59c6e3d7caba5ea8fda4b444a0fc","observation_id":"b93456ae-3537-4974-b81f-f31d3bb4e1d4","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Data quality: Some comments on the nasa software defect datasets,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:b160e13b73ee797c53459a9f4ac989892e35431122b7134333d4d9be57d242e1","observation_id":"e4c9d465-7c7d-4563-a38c-b2e94ce6ab35","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"A large-scale empirical study of just-in-time quality assurance,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:d9a0293996512c668592096d202044787511e59f39baad679f93c4b40050eb11","observation_id":"d5617754-ee84-4356-805e-881bb5732116","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Can llms re- place manual annotation of software engineering artifacts?","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:b693c1bd27c9b9db03b4d0bf474c7be5ed3316dd4eded54c1f7453336863dfd6","observation_id":"b6d07957-b681-42af-b604-41464d22ada6","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Hpobench: A collection of reproducible multi-fidelity benchmark problems for hpo,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:de1c6f7fe8732727ae20d07db851654b88c5273ff1bd877553dfb79bf2445489","observation_id":"b07ba090-2eb7-47ad-a1c7-86abf457056f","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Hebo: Pushing the limits of sample-efficient hyper-parameter optimisation,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:5f6499f95609436366f9c446df6613b1c01ffb0c64b862a2e1e0bda81e4e6002","observation_id":"79d4fb92-737b-42e4-a5c1-d813801459db","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Scalable global optimization via local bayesian optimization,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:f29b2cef42e850f9c8940bd8886d7d13c168f52bd16086490b81418ac4b90e3b","observation_id":"7b541729-7652-4ed6-8925-26c74cc3784e","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Unicorn: Reasoning about configurable system performance through the lens of causality,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:97a98c619c62d29c4ad108695ed04e9241ba59f8d8ac6f7ff3ec474c3aa164bc","observation_id":"6880fdb8-49d7-42c9-83a4-9c9f975bb947","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Llamatune: sample-efficient dbms configuration tuning,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:b6e3b56e021bb3d5a6dbec7f37ab1e78bc023557cd0827dbd38e5bc473c22818","observation_id":"5b2a7cb5-5b8a-4a6e-85c7-28bb381ba44e","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Available: https://doi.org/10.14778/3551793.3551844","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:8078ad8a87b14fcde7ee574d35b7ee509fad7bd117bf98303be5045950c47c9d","observation_id":"9a33d748-3543-47b1-a407-e4ba9b26c450","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Qtune: A query-aware database tuning system with deep reinforcement learning,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:da7a45c30f3e4923f5fe4615c180c436beaa02378221ff29688fc6470f0379e1","observation_id":"7b164406-4853-4356-bea1-9e5d6ef74709","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Mathematical discoveries from program search with large language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:5f0dd7b6b54520cc8c05576628c92737858ea96f4eec77314b9a067e84703f17","observation_id":"9b11ee3a-c4ca-4946-b319-1e1e0bd97235","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Reevo: Large language models as hyper-heuristics with reflective evolution,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:523604ac249753ac3abcfadc88cd91b654666759ff7380285c60753423d59c7e","observation_id":"21f9e3c2-e278-46d0-9dfb-2726eaae7d1c","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Genetic programming as a means for programming computers by natural selection,","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:5d9a800abb824edd633353c8493d26097abe8385e58dce9b092d401346fc8459","observation_id":"4bb52b56-e18d-4e01-8594-4d9be69ff5ea","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part i: solving problems with box constraints,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:4ef1eaf599cbcb364eb59606d35a87f651e36432c71e3738a51501f5eb5a11b1","observation_id":"a257bf7c-37e4-47c4-a94b-6748df19c40b","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"The weights can be harmful: Pareto search versus weighted search in multi-objective search-based software engineering,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:772ca68e45304e9cc90de7a5b98fb6f8f6174f80e9abcd00a6c2e07a2aa8b2f3","observation_id":"1c2f3305-d383-4190-b1c5-6e85775c91ca","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Mmo: meta multi-objectivization for software configuration tuning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:f81ff29314453d3e5c8a52f4e022bd225d3eaaebba45b6620d41aafc5a5b2757","observation_id":"78ad3a55-dd8d-4d8d-8ebd-9529fcf66e91","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Practical bayesian optimiza- tion of machine learning algorithms,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:c8f79a04b52f2320b8edeb8a162e34a3f038616dc3e1cd1d45469c87bee4a506","observation_id":"0852bacf-249b-4a9d-a78d-9f123355b1df","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Etune: Efficient con- figuration tuning for big-data software systems via configuration space reduction,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:a79b551d776273c5049a9a5bc8bf96a2d717d1500cdd326658a0a1a8837944eb","observation_id":"e1962161-9984-4924-9da3-f1327066f9e0","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Dually hierarchical drift adaptation for online configuration performance learning,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:5b59bbff7b90dcbe51ec9aed9e0de77c8160dd1592194289a4cf56cabdc99ce6","observation_id":"bea21730-d860-443a-b449-f9e0ee07a777","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Cotune: Co-evolutionary configuration tuning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:cf3283c94d7dac87b5cb8e7deb3ec59b6fd70ddaa39bef21b64be3d1f4321fcc","observation_id":"0d0bf3b0-449a-47c9-a837-7aea181c764a","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Compiler autotuning through multiple- phase learning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:ebdd86c85b6386fae5062be2236727638b885af86e01a459982f00f4a26f452f","observation_id":"11598357-a295-4e24-a026-85d06c24d897","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Unveiling many faces of surrogate models for configuration tuning: A fitness landscape analysis perspec- tive,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:f2d1890811b489fd7318778dea3a49fd65bbcd7994a3c925627ee0a145f01d23","observation_id":"d830e7dd-8fa2-43ed-837e-3b4cfe4be96c","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Learning from delayed rewards,","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:315f7864c5d58b401b88466c5d5d5afcc78d5e9211473c0e3f5f5b624f0cb347","observation_id":"5b5ad87d-cd6d-4bf2-8649-130a6eebb0e7","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Human-level control through deep reinforcement learning,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:9fcf1aa1e4dfc5f4e1c14a291bc4a7152fc7749b4cd30c7fe8d0e348d0d1554d","observation_id":"fecda742-5ad0-4a0e-b0d8-47ab5db07782","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Instance space analysis for algorithm testing: Methodology and software tools,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:e185ffc1473b2ed30422b28d0f63280e1875157aa8765a35ae1e701ce01b2193","observation_id":"fb8cd96e-66da-4654-8ad4-c2b6eb30697e","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Instance space analysis of search-based software testing,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:d89c0da91a11b481702b0b17d2715f3d209da8619dd6d92259c4136353477446","observation_id":"5a075462-63f2-4a54-8194-7c924e4ce10b","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Bohb: Robust and efficient hyperparameter optimization at scale,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:c6770b494534820adf1bd8a27b1a333f206d89bbbdb3c4a4d8b8021b6417a6ce","observation_id":"e8d8ff3d-7a8d-49ae-a883-ec3443673d0f","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"DEHB: Evolutionary hyberband for scalable, robust and efficient hyperparameter optimization,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:c2cc405b994925ecd07010bf44087c403cf304c54600698209819b6d347ce1c7","observation_id":"41174038-b2d0-4d91-af42-2d0865b81bda","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.04528","last_updated":"2024-11-11T17:30:55Z","snapshot_observed_at":"2026-08-07T19:40:18.648013Z","submitted_at":"2023-12-07T18:46:50Z","title":"Using Large Language Models for Hyperparameter Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.04528","snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Using large language models for hyperparameter optimization,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"cited_paper":"/paper/2312.04528","citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:62e01c081934bf07659fa88c795c70dd6c65be797dfb83cd2c4435ad0a1a665c","observation_id":"cf2084e1-41fd-4344-910e-1dda105c6ec8","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Language model crossover: Variation through few-shot prompting,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:00b8db8d140d2d6d40833cf43a8848f5943385f6619dec4af5841e56f7d99b01","observation_id":"b4b812c1-9203-4f39-93a1-3d7586a0cdee","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Yahpo gym-an efficient multi-objective multi-fidelity benchmark for hyperparameter optimization,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:f9270f0c097afda19ebc5ca0b3aa1abd709564296ccd77553324ff28927d8edd","observation_id":"956e5c97-a76f-4c11-b887-dad1c02d1cfb","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Surrogate NAS benchmarks: Going beyond the limited search spaces of tabular NAS benchmarks,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:5f21f53a29a8d6b846a600dde2c438378128816932308c750303c17a9d60eb8d","observation_id":"e8707993-6ee3-4acc-9ba0-0188a20ac99a","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Efficient benchmarking of hyperparameter optimizers via surrogates,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:14fda466410e8c9213ab49dcc4f1a9d916651edb8be8ca76488c977fde03df3c","observation_id":"bff7da0f-5e97-43d8-9608-213f3ba9c4e8","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Efficient benchmarking of algorithm configurators via model- based surrogates,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:ea8af93c9d6229373c80987f8089bebeed0e5738de385e7e2dfeebdbb084586a","observation_id":"950528ba-cc7a-4f6f-9924-f54e1ae1b0fd","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"A cluster analysis method for grouping means in the analysis of variance,","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:c7f68d9987f59333044b4f2f91b86e4ceec5f46d579ce5e0837258284fc59836","observation_id":"e89c4e94-a6ee-43c2-9218-75fef5e6fc33","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Exploratory landscape analysis,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:a324f5a8ab7d130df4e271f154ee87cf1f1f85a428fbd44fd1220487c0cf4eb7","observation_id":"b896db23-e61d-4f0f-83c3-2c19892d3f73","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Detecting funnel structures by means of exploratory landscape analysis,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:c6770f2a547d192cd822611a2a0266a52ffe6098dfb9a568a699b391bfb9cf00","observation_id":"2ce1a512-6a1e-4eb3-8d0c-ad20ed459914","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:44:36.121772Z","title":"Fitness distance correlation as a measure of problem difficulty for genetic algorithms","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-07-14T03:44:36.121772Z"},"links":{"citing_paper":"/paper/2607.11705"},"observation_digest":"sha256:a2055786e311158e97c9440522f249c9e456687c9d4e52c1e78633df08b29b5e","observation_id":"ecdfd028-bc14-443f-9989-c22fc7a8996a","resolution":{"observed_at":"2026-07-14T03:44:36.121772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.11705","last_updated":"2026-07-13T15:33:52Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-09T21:46:29.568139Z","submitted_at":"2026-07-13T15:33:52Z","title":"Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":100,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":104},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 100 of 104 outbound references and 0 inbound Pith citation observations for arXiv:2607.11705."}