{"as_of":"2026-08-11T11:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d28d81253fba75c7df666085ad476ae90a10ddc9f1fd7eebf17b8fad256fa666","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T19:55:37.799315Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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/2509.08986/citation-record","integrity":"/paper/2509.08986/integrity","json":"/paper/2509.08986/citation-record.json","paper":"/paper/2509.08986"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2007.03488","last_updated":"2020-12-16T22:36:27Z","snapshot_observed_at":"2026-07-06T09:36:09.122377Z","submitted_at":"2020-07-07T14:20:26Z","title":"Benchmarking in Optimization: Best Practice and Open Issues","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.03488","snapshot_observed_at":"2026-08-04T19:55:37.749997Z","title":"Malan, Jason H","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2509.08986","last_updated":"2025-09-10T20:33:54Z","snapshot_observed_at":"2026-08-10T21:28:16.328424Z","submitted_at":"2025-09-10T20:33:54Z","title":"Time-Fair Benchmarking for Metaheuristics: A Restart-Fair Protocol for Fixed-Time Comparisons","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-04T19:55:37.749997Z"},"links":{"cited_paper":"/paper/2007.03488","citing_paper":"/paper/2509.08986"},"observation_digest":"sha256:c3c58cd5b28239200049a0016cfa94232822b531ae71844b0643ea56c13425ce","observation_id":"e81509b0-9a7a-47f2-8373-064ac0d04679","resolution":{"observed_at":"2026-08-04T19:55:37.749997Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05281","last_updated":"2018-10-11T22:53:59Z","snapshot_observed_at":"2026-08-10T21:28:25.410687Z","submitted_at":"2018-10-11T22:53:59Z","title":"IOHprofiler: A Benchmarking and Profiling Tool for Iterative Optimization Heuristics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05281","snapshot_observed_at":"2026-08-04T19:55:37.755195Z","title":"Iohprofiler: A benchmarking and profiling tool for iterative optimization heuristics","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.08986","last_updated":"2025-09-10T20:33:54Z","snapshot_observed_at":"2026-08-10T21:28:16.328424Z","submitted_at":"2025-09-10T20:33:54Z","title":"Time-Fair Benchmarking for Metaheuristics: A Restart-Fair Protocol for Fixed-Time Comparisons","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-04T19:55:37.755195Z"},"links":{"cited_paper":"/paper/1810.05281","citing_paper":"/paper/2509.08986"},"observation_digest":"sha256:56ed8a9d88824e60093383ec90ad7ef388d9ee8e01da1891bf3ec1d1824faec0","observation_id":"ded522b7-e80f-4a99-97bb-6367159d87a0","resolution":{"observed_at":"2026-08-04T19:55:37.755195Z","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-08-04T19:55:37.759826Z","title":"Dolan and Jorge J","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2509.08986","last_updated":"2025-09-10T20:33:54Z","snapshot_observed_at":"2026-08-10T21:28:16.328424Z","submitted_at":"2025-09-10T20:33:54Z","title":"Time-Fair Benchmarking for Metaheuristics: A Restart-Fair Protocol for Fixed-Time Comparisons","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-04T19:55:37.759826Z"},"links":{"citing_paper":"/paper/2509.08986"},"observation_digest":"sha256:6564eab4c4f6e406f82976990cab2dfc3d54148d5e500c797f2eaf81e98e2743","observation_id":"da5bbb6b-1c0a-4685-995e-51b995f1b2ac","resolution":{"observed_at":"2026-08-04T19:55:37.759826Z","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-08-04T19:55:37.764005Z","title":"A generic bet-and-run strategy for speeding up stochastic local search","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.08986","last_updated":"2025-09-10T20:33:54Z","snapshot_observed_at":"2026-08-10T21:28:16.328424Z","submitted_at":"2025-09-10T20:33:54Z","title":"Time-Fair Benchmarking for Metaheuristics: A Restart-Fair Protocol for Fixed-Time Comparisons","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-04T19:55:37.764005Z"},"links":{"citing_paper":"/paper/2509.08986"},"observation_digest":"sha256:a9f3e264d1b83a2d8f1a84c07b883452431b75d26607388ef6ca58a480548279","observation_id":"2815a227-601f-4c35-bc70-a9ad29e3e832","resolution":{"observed_at":"2026-08-04T19:55:37.764005Z","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-08-04T19:55:37.768622Z","title":"Real-parameter black-box optimization benchmarking 2010: Experimental setup","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2509.08986","last_updated":"2025-09-10T20:33:54Z","snapshot_observed_at":"2026-08-10T21:28:16.328424Z","submitted_at":"2025-09-10T20:33:54Z","title":"Time-Fair Benchmarking for Metaheuristics: A Restart-Fair Protocol for Fixed-Time Comparisons","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-04T19:55:37.768622Z"},"links":{"citing_paper":"/paper/2509.08986"},"observation_digest":"sha256:75a8d0fe5bb111609efb40de198b69ae6d1a65af07fb1867383048a5a77c4af6","observation_id":"1c51d852-4b34-403d-a88f-f0bb6ef924e5","resolution":{"observed_at":"2026-08-04T19:55:37.768622Z","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":"10.1007/978-3-319-07124-4_8-1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:58:33.013988Z","title":"Hoos, and Kevin Leyton-Brown","venue":null,"work_id":"175bb2c2-30d1-44ee-aad4-a1e74352df62","year":2019},"citing_paper":{"arxiv_id":"2509.08986","last_updated":"2025-09-10T20:33:54Z","snapshot_observed_at":"2026-08-10T21:28:16.328424Z","submitted_at":"2025-09-10T20:33:54Z","title":"Time-Fair Benchmarking for Metaheuristics: A Restart-Fair Protocol for Fixed-Time Comparisons","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-04T19:55:37.773011Z"},"links":{"citing_paper":"/paper/2509.08986"},"observation_digest":"sha256:68f7a1c4a3af989adf05fa0bf0bfc6cf2b2414fe49399a6c247bd94fd74345ce","observation_id":"ee968bd5-ee68-42d5-83ee-01b9c1be6617","resolution":{"observed_at":"2026-08-04T19:58:33.111713Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-69404-7_9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Learning a reactive restart strategy to improve stochastic search","venue":"Lecture notes in computer science","work_id":"6513f3ec-9c79-4201-8087-7501a37b8017","year":2017},"citing_paper":{"arxiv_id":"2509.08986","last_updated":"2025-09-10T20:33:54Z","snapshot_observed_at":"2026-08-10T21:28:16.328424Z","submitted_at":"2025-09-10T20:33:54Z","title":"Time-Fair Benchmarking for Metaheuristics: A Restart-Fair Protocol for Fixed-Time Comparisons","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-04T19:55:37.777945Z"},"links":{"citing_paper":"/paper/2509.08986"},"observation_digest":"sha256:3613f48e9aca7bf88756f58cbf7a2d9e37266e8b78059e1fa8bbdce893a8d247","observation_id":"2e39abcf-72ae-420b-8604-3d5ed9fbb1e0","resolution":{"observed_at":"2026-08-04T19:58:32.877514Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-02538-9_9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Exploratory analysis of stochastic local search algorithms in biobjective optimization","venue":null,"work_id":"eee87725-510d-4a21-bab7-7aba26276ebb","year":2010},"citing_paper":{"arxiv_id":"2509.08986","last_updated":"2025-09-10T20:33:54Z","snapshot_observed_at":"2026-08-10T21:28:16.328424Z","submitted_at":"2025-09-10T20:33:54Z","title":"Time-Fair Benchmarking for Metaheuristics: A Restart-Fair Protocol for Fixed-Time Comparisons","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-04T19:55:37.782215Z"},"links":{"citing_paper":"/paper/2509.08986"},"observation_digest":"sha256:f9239054ed9bcc8d2c77014e10c272f599cee5185037a6a0b51c8a6a50972a07","observation_id":"f5344d55-5971-4076-a930-6ad8cb482226","resolution":{"observed_at":"2026-08-04T19:58:32.586215Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T19:55:37.786515Z","title":"Benchmarking for metaheuristic black-box optimization: Perspectives and open challenges","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.08986","last_updated":"2025-09-10T20:33:54Z","snapshot_observed_at":"2026-08-10T21:28:16.328424Z","submitted_at":"2025-09-10T20:33:54Z","title":"Time-Fair Benchmarking for Metaheuristics: A Restart-Fair Protocol for Fixed-Time Comparisons","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-04T19:55:37.786515Z"},"links":{"citing_paper":"/paper/2509.08986"},"observation_digest":"sha256:1654e8512484bfbdac946603ae031ad0e126612cb856570effe827ec32d80bcb","observation_id":"e52c15c8-f2ab-4992-af50-79f7721cb67f","resolution":{"observed_at":"2026-08-04T19:55:37.786515Z","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-08-04T19:55:37.790887Z","title":"Performance measure and tool for benchmarking metaheuristic optimization algorithms","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.08986","last_updated":"2025-09-10T20:33:54Z","snapshot_observed_at":"2026-08-10T21:28:16.328424Z","submitted_at":"2025-09-10T20:33:54Z","title":"Time-Fair Benchmarking for Metaheuristics: A Restart-Fair Protocol for Fixed-Time Comparisons","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-04T19:55:37.790887Z"},"links":{"citing_paper":"/paper/2509.08986"},"observation_digest":"sha256:8f9aeb245ece547f6dd4af1ea5b9ca25bbc36e7cb943ed96c8b82b438b7ea814","observation_id":"ed10b2a5-75ed-4185-8fbd-e8c8cb04c430","resolution":{"observed_at":"2026-08-04T19:55:37.790887Z","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":"10.1186/s40537-025-01260-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Ieco: an improved educational competition optimizer for state-of-the-art engineering optimization","venue":"Journal Of Big Data","work_id":"6c567765-9ccb-47d0-8ee8-df0ee7d5658d","year":2025},"citing_paper":{"arxiv_id":"2509.08986","last_updated":"2025-09-10T20:33:54Z","snapshot_observed_at":"2026-08-10T21:28:16.328424Z","submitted_at":"2025-09-10T20:33:54Z","title":"Time-Fair Benchmarking for Metaheuristics: A Restart-Fair Protocol for Fixed-Time Comparisons","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-04T19:55:37.795177Z"},"links":{"citing_paper":"/paper/2509.08986"},"observation_digest":"sha256:c24b479f48c2f9cb8c3e4629b4774019390960369c7c4dd327345cfc3664e40a","observation_id":"1c645ade-8f5f-4691-a73b-750c4fb80e02","resolution":{"observed_at":"2026-08-04T19:58:32.318994Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1806.08984","last_updated":"2018-06-23T15:36:04Z","snapshot_observed_at":"2026-08-09T18:55:55.705460Z","submitted_at":"2018-06-23T15:36:04Z","title":"An Improved Generic Bet-and-Run Strategy for Speeding Up Stochastic Local Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.08984","snapshot_observed_at":"2026-08-04T19:55:37.799315Z","title":"An improved generic bet-and-run strategy for speeding up stochastic local search","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.08986","last_updated":"2025-09-10T20:33:54Z","snapshot_observed_at":"2026-08-10T21:28:16.328424Z","submitted_at":"2025-09-10T20:33:54Z","title":"Time-Fair Benchmarking for Metaheuristics: A Restart-Fair Protocol for Fixed-Time Comparisons","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-04T19:55:37.799315Z"},"links":{"cited_paper":"/paper/1806.08984","citing_paper":"/paper/2509.08986"},"observation_digest":"sha256:f0a4fd71e91c6dad46e21311105517f05f4c128eb7142b01054eec827916bdf3","observation_id":"d88e7995-b66b-4803-8174-ab7666858ccd","resolution":{"observed_at":"2026-08-04T19:55:37.799315Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.08986","last_updated":"2025-09-10T20:33:54Z","latest_version":1,"primary_category":"cs.NE","snapshot_observed_at":"2026-08-10T21:28:16.328424Z","submitted_at":"2025-09-10T20:33:54Z","title":"Time-Fair Benchmarking for Metaheuristics: A Restart-Fair Protocol for Fixed-Time Comparisons"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":4,"verified_fuzzy":0},"total_outbound_references":12},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:2509.08986."}