{"as_of":"2026-08-08T11:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:066f90f9c7ac3e25ab480d98588dcf8146c8988c5d196027dea6f52c68c8c6a0","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:03:47.063096Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2506.01107/citation-record","integrity":"/paper/2506.01107/integrity","json":"/paper/2506.01107/citation-record.json","paper":"/paper/2506.01107"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:52.589926Z","title":"Theory of Randomized Search Heuristics","venue":null,"work_id":"afbd8e66-f68b-4c37-8d16-c0178fceaa31","year":2011},"citing_paper":{"arxiv_id":"2506.01107","last_updated":"2025-09-01T09:09:18Z","snapshot_observed_at":"2026-08-07T11:48:18.629923Z","submitted_at":"2025-06-01T18:16:06Z","title":"Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T12:03:44.777901Z"},"links":{"citing_paper":"/paper/2506.01107"},"observation_digest":"sha256:f4e89337afae2ad7c78135261e540a86ff0b1d013843e6de1bd5a78a9ab539e0","observation_id":"01c0f508-85ee-4913-aef2-7b610dd34275","resolution":{"observed_at":"2026-08-07T12:03:52.727208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:49.920587Z","title":"Recent advances in selec- tion hyper-heuristics","venue":null,"work_id":"9fbdd2be-4a13-462e-9efb-baf7390d487e","year":2020},"citing_paper":{"arxiv_id":"2506.01107","last_updated":"2025-09-01T09:09:18Z","snapshot_observed_at":"2026-08-07T11:48:18.629923Z","submitted_at":"2025-06-01T18:16:06Z","title":"Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T12:03:45.620887Z"},"links":{"citing_paper":"/paper/2506.01107"},"observation_digest":"sha256:0e176f03cce132a3581f2a4a8a6e96bad8a4707248cc055a87599500bf70c85f","observation_id":"54c0406e-ba73-4ad6-9c8d-4de9420b2992","resolution":{"observed_at":"2026-08-07T12:03:50.044345Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:49.654644Z","title":"On the analysis of the (1+1) evolution- ary algorithm","venue":null,"work_id":"cc3758ff-08da-4602-992f-b4cb4f5011f4","year":2002},"citing_paper":{"arxiv_id":"2506.01107","last_updated":"2025-09-01T09:09:18Z","snapshot_observed_at":"2026-08-07T11:48:18.629923Z","submitted_at":"2025-06-01T18:16:06Z","title":"Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T12:03:45.706201Z"},"links":{"citing_paper":"/paper/2506.01107"},"observation_digest":"sha256:94dc32d736ddc84dab33275c4c6734fbb097757c7fae894cdab13f5f6b4a77b3","observation_id":"87db342f-82ad-41f9-8590-56faa1cd094d","resolution":{"observed_at":"2026-08-07T12:03:49.759215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:49.139786Z","title":null,"venue":null,"work_id":"629add31-52c2-49bd-a7a3-7cf9c517553d","year":2019},"citing_paper":{"arxiv_id":"2506.01107","last_updated":"2025-09-01T09:09:18Z","snapshot_observed_at":"2026-08-07T11:48:18.629923Z","submitted_at":"2025-06-01T18:16:06Z","title":"Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T12:03:45.913101Z"},"links":{"citing_paper":"/paper/2506.01107"},"observation_digest":"sha256:ec1ff92593c659d6cbb51774e5c88c88bc8699d880b9a1951f961f3888468a32","observation_id":"593c1205-38c4-4aae-8f7c-197f50ece7b8","resolution":{"observed_at":"2026-08-07T12:03:49.211969Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:48.650351Z","title":"Oliveto, and John Alasdair Warwicker","venue":null,"work_id":"32360048-b9d3-43db-928f-547316249106","year":2019},"citing_paper":{"arxiv_id":"2506.01107","last_updated":"2025-09-01T09:09:18Z","snapshot_observed_at":"2026-08-07T11:48:18.629923Z","submitted_at":"2025-06-01T18:16:06Z","title":"Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T12:03:46.095737Z"},"links":{"citing_paper":"/paper/2506.01107"},"observation_digest":"sha256:3e13020ed85f8e85f7825a1b856d4df762f4321a82b589ca1cdadad1a75ab297","observation_id":"542acc17-7a45-4767-a056-8afca3d3e3f0","resolution":{"observed_at":"2026-08-07T12:03:48.827125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:48.463730Z","title":"Oliveto, and John Alasdair Warwicker","venue":null,"work_id":"b2e009c0-22b4-4cdb-9a75-1007b72d8065","year":2020},"citing_paper":{"arxiv_id":"2506.01107","last_updated":"2025-09-01T09:09:18Z","snapshot_observed_at":"2026-08-07T11:48:18.629923Z","submitted_at":"2025-06-01T18:16:06Z","title":"Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T12:03:46.205593Z"},"links":{"citing_paper":"/paper/2506.01107"},"observation_digest":"sha256:327904f06b79e8ddcd560c14ded7d258ccffdaec4af8f91af18e5e06679c11de","observation_id":"db6ce4d5-a7cb-496d-81bc-3391e53def62","resolution":{"observed_at":"2026-08-07T12:03:48.562486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:48.198137Z","title":"Oliveto, and John Alasdair Warwicker","venue":null,"work_id":"11415362-f054-4dc8-9310-61093202875d","year":2023},"citing_paper":{"arxiv_id":"2506.01107","last_updated":"2025-09-01T09:09:18Z","snapshot_observed_at":"2026-08-07T11:48:18.629923Z","submitted_at":"2025-06-01T18:16:06Z","title":"Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T12:03:46.315538Z"},"links":{"citing_paper":"/paper/2506.01107"},"observation_digest":"sha256:9181150cb34a26ab54204c46095ee22d801a2cf644fdff746f679c323006ef1f","observation_id":"42845d80-f5c2-4774-b074-889a89a9d647","resolution":{"observed_at":"2026-08-07T12:03:48.308383Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:47.984396Z","title":"Bioinspired Computation in Combinatorial Opti- mization – Algorithms and Their Computational Complex- ity","venue":null,"work_id":"e8e11db9-10aa-4d71-87e9-14b75a78f05e","year":2010},"citing_paper":{"arxiv_id":"2506.01107","last_updated":"2025-09-01T09:09:18Z","snapshot_observed_at":"2026-08-07T11:48:18.629923Z","submitted_at":"2025-06-01T18:16:06Z","title":"Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T12:03:46.425467Z"},"links":{"citing_paper":"/paper/2506.01107"},"observation_digest":"sha256:7136913a327d98faf099a3445584bdfbda51bfa4514b04242b2c15bd2f8de8c7","observation_id":"30b8f408-43a6-4dac-b78a-df04f61d4616","resolution":{"observed_at":"2026-08-07T12:03:48.072340Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:47.228814Z","title":"Theorem 17 (Simplified version of Wald’s equation – [Wald, 1944]; [Doerr and K ¨unnemann, 2015 ])","venue":null,"work_id":"61f4af69-f9cb-4612-853e-b39c487abf4c","year":1944},"citing_paper":{"arxiv_id":"2506.01107","last_updated":"2025-09-01T09:09:18Z","snapshot_observed_at":"2026-08-07T11:48:18.629923Z","submitted_at":"2025-06-01T18:16:06Z","title":"Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T12:03:47.063096Z"},"links":{"citing_paper":"/paper/2506.01107"},"observation_digest":"sha256:7f6fd25637e7526dfb379d855e92386115470d101b8db27554589bd42dfcd194","observation_id":"c2eb6894-439a-48d0-b372-5df7700186bd","resolution":{"observed_at":"2026-08-07T12:03:47.298728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:47.401318Z","title":"Evolutionary Learning: Advances in Theories and Algo- rithms","venue":null,"work_id":"8f970a39-646a-4631-b19a-c4e766db3b2b","year":2019},"citing_paper":{"arxiv_id":"2506.01107","last_updated":"2025-09-01T09:09:18Z","snapshot_observed_at":"2026-08-07T11:48:18.629923Z","submitted_at":"2025-06-01T18:16:06Z","title":"Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator","version":2},"reference_index":1944,"source":"pdf_text","source_observed_at":"2026-08-07T12:03:46.853112Z"},"links":{"citing_paper":"/paper/2506.01107"},"observation_digest":"sha256:72432c1b38616879079f9d23ab7393b616e4f661bfb92d6ab4247051344889cb","observation_id":"2cc88a3e-5b89-47e6-8173-800529db66ac","resolution":{"observed_at":"2026-08-07T12:03:47.516182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:51.568610Z","title":"https://dlmf.nist.gov/, Release 1.2.3 of 2024-12-15","venue":null,"work_id":"fa826e02-8fc0-48f2-945b-bb197532bde5","year":2024},"citing_paper":{"arxiv_id":"2506.01107","last_updated":"2025-09-01T09:09:18Z","snapshot_observed_at":"2026-08-07T11:48:18.629923Z","submitted_at":"2025-06-01T18:16:06Z","title":"Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator","version":2},"reference_index":2000,"source":"pdf_text","source_observed_at":"2026-08-07T12:03:45.016715Z"},"links":{"citing_paper":"/paper/2506.01107"},"observation_digest":"sha256:9220b278f81bc6af13dcafc9a14afd6caa92da0e183ecfc199c2cbfd49df3273","observation_id":"66edeeb6-7b63-4222-b128-6313734e492a","resolution":{"observed_at":"2026-08-07T12:03:51.785253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:49.386546Z","title":"Analyzing Evolutionary Al- gorithms – The Computer Science Perspective","venue":null,"work_id":"f18912ae-afd6-462a-97d3-563ad704bcc4","year":2013},"citing_paper":{"arxiv_id":"2506.01107","last_updated":"2025-09-01T09:09:18Z","snapshot_observed_at":"2026-08-07T11:48:18.629923Z","submitted_at":"2025-06-01T18:16:06Z","title":"Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator","version":2},"reference_index":2002,"source":"pdf_text","source_observed_at":"2026-08-07T12:03:45.804752Z"},"links":{"citing_paper":"/paper/2506.01107"},"observation_digest":"sha256:881dfaa9d8648a0ebc9a39869882ee775a270930202793ac78b74b8d2cbb7529","observation_id":"002a259f-4c6c-4ff3-911a-ae14c532832b","resolution":{"observed_at":"2026-08-07T12:03:49.519174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:47.714815Z","title":"On cumulative sums of ran- dom variables","venue":null,"work_id":"e4f96e49-5067-4bff-9e76-083fa742a483","year":1944},"citing_paper":{"arxiv_id":"2506.01107","last_updated":"2025-09-01T09:09:18Z","snapshot_observed_at":"2026-08-07T11:48:18.629923Z","submitted_at":"2025-06-01T18:16:06Z","title":"Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator","version":2},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-07T12:03:46.568831Z"},"links":{"citing_paper":"/paper/2506.01107"},"observation_digest":"sha256:1ba355464ad08ec194590ffd34cb78f1e7802d43af195a28c58a8b4c33f4cf48","observation_id":"3ad0cd13-f18c-4830-b974-beb37affd8d3","resolution":{"observed_at":"2026-08-07T12:03:47.857943Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:52.281877Z","title":"Burke, Michel Gendreau, Matthew R","venue":null,"work_id":"1a913229-9148-492d-86c6-ef86b6c6180b","year":2013},"citing_paper":{"arxiv_id":"2506.01107","last_updated":"2025-09-01T09:09:18Z","snapshot_observed_at":"2026-08-07T11:48:18.629923Z","submitted_at":"2025-06-01T18:16:06Z","title":"Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator","version":2},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-07T12:03:44.836797Z"},"links":{"citing_paper":"/paper/2506.01107"},"observation_digest":"sha256:27297cd3e87b818b14ebc04cb195823f7fc1579b31395238b9710fabb1ef3eeb","observation_id":"fb980ecb-296f-4a43-b571-4a395befbe1b","resolution":{"observed_at":"2026-08-07T12:03:52.439997Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:50.659865Z","title":"Oliveto, and John Alasdair Warwicker","venue":null,"work_id":"e5497823-b5fe-405c-9c4f-01fe11bd8723","year":2018},"citing_paper":{"arxiv_id":"2506.01107","last_updated":"2025-09-01T09:09:18Z","snapshot_observed_at":"2026-08-07T11:48:18.629923Z","submitted_at":"2025-06-01T18:16:06Z","title":"Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator","version":2},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-07T12:03:45.282547Z"},"links":{"citing_paper":"/paper/2506.01107"},"observation_digest":"sha256:9c5b3532facca08a20d4e70d85932fdfada7e5b9c590b42b27f53219609ef2e1","observation_id":"32adf27e-c8ba-4001-9097-7d9f89731115","resolution":{"observed_at":"2026-08-07T12:03:50.753257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:51.979582Z","title":"Cowling, Graham Kendall, and Eric Soubeiga","venue":null,"work_id":"76794394-3ffc-437e-bd85-7322eb480e62","year":2000},"citing_paper":{"arxiv_id":"2506.01107","last_updated":"2025-09-01T09:09:18Z","snapshot_observed_at":"2026-08-07T11:48:18.629923Z","submitted_at":"2025-06-01T18:16:06Z","title":"Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator","version":2},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-07T12:03:44.915603Z"},"links":{"citing_paper":"/paper/2506.01107"},"observation_digest":"sha256:b046b5d7e97b35281d8fc959a557263771d00297c3c31500645705cebb60d8c1","observation_id":"e4a4ca46-4057-4d6c-9c79-f74e1ffad6c4","resolution":{"observed_at":"2026-08-07T12:03:52.144609Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:51.246765Z","title":"Theory of Evolutionary Computation— Recent Developments in Discrete Optimization","venue":null,"work_id":"894a2167-6a6f-4968-8f6f-0fba0aac2e36","year":2020},"citing_paper":{"arxiv_id":"2506.01107","last_updated":"2025-09-01T09:09:18Z","snapshot_observed_at":"2026-08-07T11:48:18.629923Z","submitted_at":"2025-06-01T18:16:06Z","title":"Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator","version":2},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-07T12:03:45.128384Z"},"links":{"citing_paper":"/paper/2506.01107"},"observation_digest":"sha256:67c783bdec00c00a8c1ecf91b5f91f5b989593c5db492eb795d27ff826304ef4","observation_id":"7bd30ab1-fd61-4674-8f19-85b1b91eaebb","resolution":{"observed_at":"2026-08-07T12:03:51.400885Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:50.386438Z","title":"Lutzeyer, and Aur´elien Stumpf","venue":null,"work_id":"d13fa295-a9df-4374-9ecf-ba769c76a2f0","year":2023},"citing_paper":{"arxiv_id":"2506.01107","last_updated":"2025-09-01T09:09:18Z","snapshot_observed_at":"2026-08-07T11:48:18.629923Z","submitted_at":"2025-06-01T18:16:06Z","title":"Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-07T12:03:45.358170Z"},"links":{"citing_paper":"/paper/2506.01107"},"observation_digest":"sha256:19756132317132aa7bfcb7e93f64f39eb92aee80ea7ddc4b978fd707e81e0cb1","observation_id":"45a80991-4712-4676-a615-fdde8c4d89b2","resolution":{"observed_at":"2026-08-07T12:03:50.480820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:48.941361Z","title":"A runtime analysis of simple hyper-heuristics: to mix or not to mix operators","venue":null,"work_id":"aa39a062-3911-4de7-b415-b012cbbcb93b","year":2013},"citing_paper":{"arxiv_id":"2506.01107","last_updated":"2025-09-01T09:09:18Z","snapshot_observed_at":"2026-08-07T11:48:18.629923Z","submitted_at":"2025-06-01T18:16:06Z","title":"Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-07T12:03:45.994676Z"},"links":{"citing_paper":"/paper/2506.01107"},"observation_digest":"sha256:2b4f89b0a48a26e9dbdaea8a78b838c79f57f3d20f611f50c8a240341ead8dfe","observation_id":"fd8d5d10-bd4a-49cb-b257-35a5e7ce576d","resolution":{"observed_at":"2026-08-07T12:03:49.058607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:50.903242Z","title":"[Doerr et al., 2012] Benjamin Doerr, Daniel Johannsen, and Carola Winzen","venue":null,"work_id":"41ae7d3d-3b70-44b8-9a87-5dfa39cd0c20","year":2012},"citing_paper":{"arxiv_id":"2506.01107","last_updated":"2025-09-01T09:09:18Z","snapshot_observed_at":"2026-08-07T11:48:18.629923Z","submitted_at":"2025-06-01T18:16:06Z","title":"Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T12:03:45.215139Z"},"links":{"citing_paper":"/paper/2506.01107"},"observation_digest":"sha256:9f1d5cd6f15d260b649a9c26a5f575979f929537f00b080cf60ac2f1c13660dd","observation_id":"247a7fa8-b3c6-40d4-a8bc-922934399745","resolution":{"observed_at":"2026-08-07T12:03:51.042574Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:50.186665Z","title":"How well does the Metropolis algorithm cope with local op- tima? In Genetic and Evolutionary Computation Con- ference, GECCO 2023, pages 1000–1008","venue":null,"work_id":"a8d3abe4-36a3-45cb-a4c8-8159ee7cc04c","year":2023},"citing_paper":{"arxiv_id":"2506.01107","last_updated":"2025-09-01T09:09:18Z","snapshot_observed_at":"2026-08-07T11:48:18.629923Z","submitted_at":"2025-06-01T18:16:06Z","title":"Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T12:03:45.511041Z"},"links":{"citing_paper":"/paper/2506.01107"},"observation_digest":"sha256:f6e02aae67cefd60c1b260be1566f8dd59ba4626eedd823c3d96b713c80cf0db","observation_id":"6926ca51-4482-410b-835d-3766c128a3ec","resolution":{"observed_at":"2026-08-07T12:03:50.254838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.01107","last_updated":"2025-09-01T09:09:18Z","latest_version":2,"primary_category":"cs.NE","snapshot_observed_at":"2026-08-07T11:48:18.629923Z","submitted_at":"2025-06-01T18:16:06Z","title":"Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":20},"total_outbound_references":21},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2506.01107."}