{"as_of":"2026-08-08T01:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3b4aadf547c8e68fe5feaf4705e9137d2fee22998fccd7c8e424bf24cbc71490","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-07T06:34:17.273281+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-07T06:59:19.893990Z","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:5d721a4999c71248da596b45402180e6631622fc51b478bb97ad3be6c0a669a3","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-07T06:59:19.893990Z","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:c2f17af9b72e3639207a0a8d664da54a016ac79c5adfdbd83aa259517bdf7db7","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-07T06:59:19.893990Z","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:09566287ab6552af23fc80a1b6eed77cd85b3753291cb3e5ed8fef8772aff003","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-07T06:59:19.893990Z","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:cbfdf86a14f42e3215e1cfa77a0813ace3080e6fc8fc74577027a94fd2af2fa1","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-07T06:59:19.893990Z","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:fd35b395f5790a438c65672ac36efc671c36f304627591cff815f6304a779e1a","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-07T06:59:19.893990Z","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:6be2409a65a9f26c965133bed64ff01153df7b414b416ed87ec7829c4aeaf88d","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-07T06:59:19.893990Z","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:6fe7bc7557d2be1871493eec0ac7a7bd604ba9e54ad7cfdb5600a61f1d1d9f19","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-07T06:59:19.893990Z","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:4802ab949957c36348ab4465776233c7c4f5c08bed0e2bf7055f9d64176fe810","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-07T06:59:19.893990Z","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:3c43bcbc54c29ad6eb9cea9cc27822f697c138bceb9393b55450b4cbb3418a18","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-07T06:59:19.893990Z","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:04d6660ae9d57cfcca0026ee3e3fcb13720a2d88820dbe9ecd901d040c6d7284","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-07T06:59:19.893990Z","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:67ff534a2d275a75212625d55cf7340bb87c48bcfd9c18a7b28f867f59aee0ab","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-07T06:59:19.893990Z","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:074f16d6edde2d30349ec09eebc4706b5a810ff489f60f12428929281016e6b8","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-07T06:59:19.893990Z","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:b6277477cd2f2423336dd415fb1f09116f3562c3774323533018c5eeca23980f","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-07T06:59:19.893990Z","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:5d93287b6611bd0fdd5d31a59614bb7a74050a893e7838c05ca8b43e42ab778a","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-07T06:59:19.893990Z","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:d2ee241fcc6d2435a8116382af7f037d6028fd1a55d0ba7a390fd9b1e84e2512","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-07T06:59:19.893990Z","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:186f514f8f8cbf2621de4cdee9e4726e28c208735302b6fe16f4c8936081f8b2","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-07T06:59:19.893990Z","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:003ce159aaac211d81d906159467600f9e2c6d92a8bcf14f2e58f8b8328719e2","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-07T06:59:19.893990Z","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:76c1e9347cf034a0a3ccdb425709ec24356f28324c654f48eec4f1d1decf3c09","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-07T06:59:19.893990Z","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:7558a7b2897dc876a7c8db2841483cbb590eb8f537c15f7dadef9eb8b2042588","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-07T06:59:19.893990Z","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:efa0123d109d47a8cfb9d33733d115a901b5b8a8e20722c1cd00902c04d1fa38","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-07T06:59:19.893990Z","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:87e8a68f1365372f65df1f77d139a3be5810ba5b1acd28d35c322ca6dd6a870c","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-07T06:59:19.893990Z","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:abb6c5d29e54f9b38eb14d1f13106802e46310b5cc5d27999f6b10254b40e41a","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-07T06:59:19.893990Z","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:67dbb6655443a1c2e901a3623178ed1873dc2807ad6b4179d97da2babf364224","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-07T06:59:19.893990Z","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:ecc1162325ae086d6dbd4c65fa88463682385c9f1cf73e6da24f66246aef9505","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-07T06:59:19.893990Z","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:95cf516552af42815415b9a9495cdbb8b660cc360abf310af05c362cef1f2e9c","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-07T06:59:19.893990Z","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:9ee6659fb8bce04a284ad48e154aec0781f27813d3fe4714a0ee1ed0d7265c01","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-07T06:59:19.893990Z","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:8df4c8b60c4dd89f60d7cf0c04e3625bad65ac2d8f6442552af13f5baa84d211","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-07T06:59:19.893990Z","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:12bc2b982d8398b1d60507c9f459ff596516a07d0c480d6ee0d706a150cd90ad","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-07T06:59:19.893990Z","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:ed28874c1600cbb23a30038527f42875d5fb816d2f7b7d0e821c7903081d40fd","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-07T06:59:19.893990Z","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:908c04b03af9756d72421196f30a43c81b096cc3676261ffc2d993c74b91e657","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-07T06:59:19.893990Z","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:6e1aecd0ccf02443ef7a140f0ef21458c0c145efbfd831369119dbf571039724","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-07T06:59:19.893990Z","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:fadcfdf852347884a2876057401f976ca748c7da3684778b4cb7ba10aff36962","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-07T06:59:19.893990Z","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:4c70bf0d20349ebab26f4c58400c264e5d2d41b3a92b81a42cd1a19823b6b964","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-07T06:59:19.893990Z","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:c6a4df4566883b3bbca892894323ea1c65b15586d2bb725d11c1157ba20813d8","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-07T06:59:19.893990Z","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:99b6542eb95dead75b057a66985f24f4a5b73cb3437039e1dc28a6f7e87d8b58","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-07T06:59:19.893990Z","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:8a42628d8fbc70dd09914a34b45f60fee2e0f4df4f0a5532ba2a68224ef445be","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-07T06:59:19.893990Z","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:e957d2fff57546d949b4d3e2616d2dbae2e635dcf8df9db74e2e42c276233e74","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-07T06:59:19.893990Z","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:4c51283535027412da6df0416b3e3a10270d4cc90e905b4ca8b31c3288336473","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-07T06:59:19.893990Z","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:9e3699157e791bbcef7afd2595421b8680adf8a4dcbbb81199b744d9b28ec90e","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-07T06:59:19.893990Z","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:b58fc495eaa23c75863f688e513f941fd8024702f14930f29a161352a5886efe","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-07T06:59:19.893990Z","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:211144090d5b07138512487ad4b56e0ee49b9bb158251067debc64e4c8125dec","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-07T06:59:19.893990Z","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:18d1351ba1281653a6ed255b45e368522562d3a968223750badbb554b32f73f3","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-07T06:59:19.893990Z","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:74cf93ce15852484c7b133a0a37f09740cfc2aab20296ae31e8d715119f228e7","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-07T06:59:19.893990Z","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:f0fb13ddaea0aafdd483972093bcd079c9509b626cc39c386df9480525b6c99a","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-07T06:59:19.893990Z","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:4df2280788121ca35c12f108df805afa62b2429219bafc6d34962ba07a95e425","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-07T06:59:19.893990Z","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:cb08c99fab9defcbd4444bb2098e9454e7df1cf1567bc35887fdff7305eb1a2f","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-07T06:59:19.893990Z","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:bd29dc78c231334733139edf00c175d00dcfa4033070f7af33e2f072d974da86","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-07T06:59:19.893990Z","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:aaf7d9f8018fe6c5bb02299fc25685656a61da8bcee77254c4036f7b2b3f052d","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-07T06:59:19.893990Z","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:332a799eb40aac58b1cfef42f6f52d64065c3d78db4597d58ee0681bbf059477","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-07T06:59:19.893990Z","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:5cc6fcce7f64f741b802b9c70f5cabde992994ed237495a718c4bdf6300e8ab2","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-07T06:59:19.893990Z","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:95411dc750fbe7f0f24f42ba3bf686d379a7a7271bde466565e1f5927da29f80","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-07T06:59:19.893990Z","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:8e90677ab25297a991f3abd4f6a575d436e23468071b4fd0de0202febd3e6f26","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-07T06:59:19.893990Z","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:dbe1b1eccec8664a72b143ab5a99297f7eef6dfc50f8675c140f0a500bdf6799","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-07T06:59:19.893990Z","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:2e3a69cb3d2e6d7c0d60b33f29ccded1183663bbd70c0d5f864dd513aa2c3a15","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-07T06:59:19.893990Z","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:7e59d299908618b1435ea72b39000cf40cfb3c4336961f79e8772e01552d534c","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-07T06:59:19.893990Z","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:e62d0a084c5c188d99b18faaf45a8eb8af5a5f73fc6eb316986df32669b072bd","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-07T06:59:19.893990Z","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:46ac1262b0e410469b6a0b1a60e837d21187ec76bd594753301c2a01da708be4","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-07T06:59:19.893990Z","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:2449c52c9b4cd645b48bbd2a729f5675a9339c0f3bf1326817b4a82d71597646","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-07T06:59:19.893990Z","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:9cdb41bcc777776107127e9da7aa7035aaf625767430b86727da66d86f5064da","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-07T06:59:19.893990Z","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:e05917f64dd2a96a5d6b81844bdb36cc195fe99554fd57e172400c7f819c369f","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-07T06:59:19.893990Z","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:18c9600b7947d7e2c03246f077687b173df19fa0a96bc332ab24c8f27236c68a","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-07T06:59:19.893990Z","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:1025e1f0cc9905d303f21ea2542dfdcc1726869e672563a1ff63d6be8b85e2b6","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-07T06:59:19.893990Z","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:3633fa4d03c258b0cda6686669cb49eed5eba44db546f17b61011692f6f4c861","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-07T06:59:19.893990Z","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:f20f5c744594c34321356d93d374cc46616c5b00e1bb6bdba9a7deb41f55a785","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-07T06:59:19.893990Z","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:40a15ae4dd560df6cd0930b246d5faab933324f9eb3936e057e0163ef7377d68","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-07T06:59:19.893990Z","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:7177da2fdd7ae25e38b3749949ca21d187c1df196b2fe5ab26a0529a45a8bbcd","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-07T06:59:19.893990Z","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:617841cf46cae82c6884b52592f758f8d073656e849d429e0f51f1296e9d4e75","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-07T06:59:19.893990Z","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:50cc6e72264f3d75f4c514548812e7f295c758bc278b5b524372835b592fe181","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-07T06:59:19.893990Z","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:1a26defa3807bc403556d22a68b7b214a87ede489693b713a5116eff96b6a4cb","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-07T06:59:19.893990Z","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:f45982451f86bde457aea684cc2821b13451c002d50d9d395a048742b825694d","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-07T06:59:19.893990Z","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:bfb6d85efb03bb7109e5f149d4c3c5c206e6f2ed52ce2b41eb2439696fcf5684","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-07T06:59:19.893990Z","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:536e8b1486e3b4ad03fe0cd1e396fbb863af005ad37bdc3f399e2ed5b7943a8d","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-07T06:59:19.893990Z","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:cb4d62baefca8033480e78f2fbc8f3ddb8c4f851fc16277fcfd5f4aea808eb38","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-07T06:59:19.893990Z","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:4839552fe8d20a95f5f62a09730048ae27e92a1e066cc10b7c284206254f1a04","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-07T06:59:19.893990Z","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:3f2646740e0d8311df8812d7c463d7b0458e662466d89a8ad910f74ec5cbc9d2","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-07T06:59:19.893990Z","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:ba4261d6786bef1153e0892239f54cecfc224adf20165ef8c9eae354139f90d5","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-07T06:59:19.893990Z","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:590d1dd20ee1619a28c3746495313648dc31da0db88ce5e5aa21e3702d4b50d2","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-07T06:59:19.893990Z","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:2f5b4e4fa85f6371dcbe2b161d707617c0fa95f35f6fd78ec8e4ab3c0d3f8616","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-07T06:59:19.893990Z","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:a2cc2d6d2ab750193d61f369edc35b18bfee5fd5baccfdd0018fa73a6a434c77","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-07T06:59:19.893990Z","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:c10337f792475a5762f2992cfb7ec0354df2e3020838edfe4bce4cb0967d7cd7","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-07T06:59:19.893990Z","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:39210f7b91689991b025597e95d8b0be593ae1622d4d691af21e1c68a7b95225","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-07T06:59:19.893990Z","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:e62ae2680341cd44cbb0a0736771e94aedf5b92dd9326265ed1a34c30620f385","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-07T06:59:19.893990Z","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:7fdd68dd0532d505f8935287dd816c83bea0784ffaeb1374f9473a7f4dfdc0fa","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-07T06:59:19.893990Z","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:1a66caa398a142788e5d37b73062218af8f9953b37aa7f258f3e0f279077207d","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-07T06:59:19.893990Z","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:8d7c819b9bf0b4576b94035737f585a97878d6c3676641b8c66a25d4a6eb8e77","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-07T06:59:19.893990Z","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:6e8d0c2b56526aa5f1103a87a9a5729a215c416a5b29d00fe1358355fb3f5f57","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-07T06:59:19.893990Z","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:1946065d63a5979d23c81f19e505d90b7b59d91573ec8cf20323de2d14137fd4","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-07T06:59:19.893990Z","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:4314638f4bf4b36ef4cc4030700359ff59a667fd0dc425d9c561fd2fb06fad1f","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-07T06:59:19.893990Z","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:7dcd35d9c98592c3fe77a38886d409c2fe0d38c8334ef713780d6e6015949291","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-07T06:59:19.893990Z","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:6e8f8cff54692195ed1ea139ea6b4457a0805bf7c6a5a5594870b325d05226a7","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-07T06:59:19.893990Z","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:e7304e444c2c57df49bcab72b533d75ee6642da7cb69c3a5340aa632c39bffe2","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-07T06:59:19.893990Z","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:2158ed76b2478e2170ea3ddf36ce17b590e122bf9a1e82e606ef00430f42a83d","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-07T06:59:19.893990Z","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:e137d8e32aab30ef3d5372a32362f4a19cc56cee094f5b6f806e7379b10fa5ba","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-07T06:59:19.893990Z","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:7034c8bea7a7f533665748ca5a427ed45f7b9769307545c5fdc2cfd8c2f4be81","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-07T06:59:19.893990Z","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:dcbd912b3ae5a6a2b4c00fa3ea55038773bd4d19487e2c9fc8b685512e67d3dd","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-07T06:59:19.893990Z","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:bfe204991629aaa4701e4059a0ebcfead562502ff6a72c784bd6e42f40a8cf0c","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-07T06:59:19.893990Z","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:406390089b179f6b11035cf69e6099750d9a940d568c87de90b3c72aab3ce095","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-07T06:59:19.893990Z","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:04d5c9a05f4912cfb9382960fc4eaeb7f5d66f1c14595326fb327ce810dd801e","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-07T06:59:19.893990Z","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:0d148471ec5d8793142d87633806e6e9aeec41d31f9479bce42b2d29587be875","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-07T06:59:19.893990Z","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:d8a1ee000df91ecbdaaac866ac9b8d948f2506a67dc055913504911d38600265","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-07T06:59:19.893990Z","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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 100 of 104 outbound references and 0 inbound Pith citation observations for arXiv:2607.11705."}