{"as_of":"2026-08-16T15:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a5fc269d2eb31208727e1beb5f087b37accecc36677e1306bba0170ad0238856","coverage":[{"denominator":60,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":60,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:15:29.039982Z","state":"measured"},{"denominator":60,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":60,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.01720/citation-record","integrity":"/paper/1908.01720/integrity","json":"/paper/1908.01720/citation-record.json","paper":"/paper/1908.01720"},"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-14T15:15:30.062960Z","title":"Applied Soft Computing12(10), 3176–3192 (2012)","venue":null,"work_id":"51b88b43-2bda-45b6-8bac-9f3ff8565dd5","year":2012},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.756202Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:3339a8728d1fc560d025f5f2dfd7d8308779ef831cef87895a612caf6d416b33","observation_id":"7eeec1f9-a27d-4d24-92b3-30e9762e2c67","resolution":{"observed_at":"2026-08-14T15:15:30.066148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:30.053810Z","title":"Journal of Heuristics1(1), 9–32 (1995)","venue":null,"work_id":"2d4487c4-5ba9-4f9d-8f7c-d7bdc5322af8","year":1995},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.760686Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:93bac9ee86a7c8534d88290d21e01ce0db9cfd8ede4f9550d54436fd3a7c7aa7","observation_id":"1b5448bb-8f2e-4d7d-bbc6-faca84784159","resolution":{"observed_at":"2026-08-14T15:15:30.056744Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:30.044510Z","title":"Springer (2013)","venue":null,"work_id":"42ccc45f-dd09-4834-a850-23bc743fb162","year":2013},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.764646Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:443a93d003f1cccc36ab6e2c4b5cc8022c3b141f24ba5e8e47f32d68783760f1","observation_id":"8d0c512b-ede7-4886-9d49-f91dff1fb9b6","resolution":{"observed_at":"2026-08-14T15:15:30.047801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:30.034446Z","title":null,"venue":null,"work_id":"1e706571-12ac-4759-a684-c60bc3374845","year":2005},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.768886Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:b932c17434876d7d16c7b42b8e40793b0b5298de278f6db67dd90a0afc0e6ef8","observation_id":"7d2f3bf4-141a-42f3-bfee-aca9ef859384","resolution":{"observed_at":"2026-08-14T15:15:30.037433Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:30.021256Z","title":"Springer (2006) 27","venue":null,"work_id":"3c26db5d-f1c4-4f39-8d34-bd977381863b","year":2006},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.773050Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:86b8875562e529bc144ecc967e2235800e7901f3eb92a3687cfe6250e4ea76ee","observation_id":"a1a534b1-6ae8-4787-8703-22f6429bd1d1","resolution":{"observed_at":"2026-08-14T15:15:30.026158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:30.006604Z","title":null,"venue":null,"work_id":"6f5eec73-847d-47c9-b814-7cd583ac0e80","year":2015},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.776599Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:9694cc45878d08ad7e8d9b148af0d9127256a6b570392d03bec2e843eab7ef0b","observation_id":"8cf78c40-bc6c-4a4e-90e2-9b52e761d4e3","resolution":{"observed_at":"2026-08-14T15:15:30.011991Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.993939Z","title":"Springer (2010)","venue":null,"work_id":"86a533b0-2524-414f-a1b1-5ad88bb97856","year":2010},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.780376Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:ed7d4858d77a8a1199b23b962ed4055952a699e3170a49f66e52ed0bbd2dafcb","observation_id":"81cf6274-7d71-46d7-b6ed-c28938c3cd82","resolution":{"observed_at":"2026-08-14T15:15:29.997096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.983908Z","title":"In: 30th International conference on machine learning, pp","venue":null,"work_id":"cc3e1d89-7719-470c-925e-a810b2605dd1","year":2014},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.784674Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:753e1b19cc032e8d607461b0b9f5d09c2dcf74783e4f4bb75639906ebc362302","observation_id":"201548a7-1144-4911-8822-d0e16c6a913d","resolution":{"observed_at":"2026-08-14T15:15:29.987104Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.974392Z","title":null,"venue":null,"work_id":"b94bd989-6028-401f-b1b5-9cda5a25035c","year":2004},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.788525Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:d94db20a54fde75dbbb997b016d9ef963464805f61c07129630dec8a9a0b8a60","observation_id":"2eb375b4-a80b-497d-aa4a-44a1625567aa","resolution":{"observed_at":"2026-08-14T15:15:29.977378Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.964966Z","title":"Springer Berlin Heidelberg (2009)","venue":null,"work_id":"9084f1d7-56ac-45a3-b57f-17dbfd39d100","year":2009},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.792082Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:3efe7e4715784a147770df8e4b37427b6c907929b9bd017d2bc04599f394154c","observation_id":"5911a52e-1b7f-49a1-8ba7-ab84b7729761","resolution":{"observed_at":"2026-08-14T15:15:29.968026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.956825Z","title":null,"venue":null,"work_id":"0ec06f76-145f-4e59-b603-ef3ed0bceaf6","year":2007},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.795539Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:f3d6483e8b1c27da1bbc51d12a6f3a0a84113854b9eca4bd3111c4359d442a2f","observation_id":"0a80631a-c77f-4b40-a4e7-125dfea02a8c","resolution":{"observed_at":"2026-08-14T15:15:29.959377Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.948553Z","title":"Behavior Research Methods38(1), 65–76 (2006)","venue":null,"work_id":"56f73ec4-fbc4-4aa6-8ac0-f4d4a41cb4b4","year":2006},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.799211Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:3eccf72921eee0467f2ed194a7f14a6985ea07a7d96065d710f3bc0a0bd99aa5","observation_id":"67d69f05-fd37-4418-9e43-2fa3a4ec7a92","resolution":{"observed_at":"2026-08-14T15:15:29.951457Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.938820Z","title":"In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO ’19, pp","venue":null,"work_id":"b70d87c8-e113-4842-b428-343cd26dcbb3","year":2019},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.802584Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:e503eb6d423b6fc051ac9bc9fb7900b634a13bbbc66717b47d78fc44c38ff550","observation_id":"f0cc3baf-87f6-4891-b03d-55d0ace14ea7","resolution":{"observed_at":"2026-08-14T15:15:29.942202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.928851Z","title":"URL https://CRAN.R-project.org/package=CAISEr","venue":null,"work_id":"08864555-78fd-49b5-89c1-abc4d461eb2f","year":2019},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.805856Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:b6ec9e235b6b0999286394bb43f9927221b9f80cbfabc560f56fae04b348d5ac","observation_id":"9c5d04dd-77b0-412b-a02f-675ad3912537","resolution":{"observed_at":"2026-08-14T15:15:29.932462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.919953Z","title":"Journal of Heuristics25(2), 305–338 (2019)","venue":null,"work_id":"f07b7305-f4ef-4f09-afac-2d04a49c5275","year":2019},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.809137Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:a17e4cd5678a0ce432a82d8d4f2c26f90036c9e213101eb43ec8145712099572","observation_id":"8347f21e-fef1-4afa-9b50-34e9fd617ad8","resolution":{"observed_at":"2026-08-14T15:15:29.922951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.909753Z","title":"IEEE Transactions on Evolutionary Computation 15(6), 848–870 (2011)","venue":null,"work_id":"bc790370-5338-4afb-add9-58847d947293","year":2011},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.812266Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:7f77fe8083401ec4364b1a230a0a29f141477b98671a5f90ac99e1070ad39b53","observation_id":"e4e253f4-cb63-40b7-8fd6-738607f1f66a","resolution":{"observed_at":"2026-08-14T15:15:29.913268Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.899321Z","title":"In: Experimental Methods for the Analysis of Optimization Algorithms, pp","venue":null,"work_id":"4e28872f-282b-4e9e-997a-929f61be7dc6","year":2010},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.815316Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:8fd00a61f70b277305d40ac6f9e67fbfcb8e720849eaef518aaa74cbb3ebc490","observation_id":"81abc9cf-fbd6-4c21-85de-2cd58d6c49d5","resolution":{"observed_at":"2026-08-14T15:15:29.902960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.886307Z","title":"INFORMS Journal on Computing12(1), 24–44 (2000)","venue":null,"work_id":"d76bb600-6456-4304-bfd8-2d0db101172b","year":2000},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.819349Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:3fd6bf662e7d53e10bc0314a2ea93167b4e4dda84cc447b0be8b0f86f5d83aaf","observation_id":"34fee137-a8c6-42f5-9660-45a8e37c1c69","resolution":{"observed_at":"2026-08-14T15:15:29.890779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.873481Z","title":"In: Proceedings of the 2004 IEEE Congress on Evolutionary Computation","venue":null,"work_id":"28419c54-a3c3-44b5-aab9-0a4ab1174f70","year":2004},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.823864Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:9b1e6cf1def3502016038841800eb9835bee6590cfc89ebdd3834204e23851b9","observation_id":"47ed2961-1e0a-4b67-811d-5183951fff33","resolution":{"observed_at":"2026-08-14T15:15:29.877835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.859808Z","title":"Journal of Machine Learning Research7, 1–30 (2006) 28","venue":null,"work_id":"4537ed79-a5bf-449a-ad23-7d0566f93cc6","year":2006},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.828348Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:ec395aea1b51d7e7b0cd1c7b25569f247382d9e35d8767eb3e385d1dc73b1ce3","observation_id":"a30c6f5c-7580-4d8e-b33e-2d9888000d87","resolution":{"observed_at":"2026-08-14T15:15:29.866031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.724475Z","title":"Information Sciences289, 41–58 (2014)","venue":null,"work_id":"ecfba961-99be-4207-b8be-5e9c38c34d2e","year":2014},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.832778Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:7ec659643f9c750451fa1a8373b0c25cdc756b53612a5a4483c3245ccbe537b3","observation_id":"ab3bd87c-c132-4eef-91bb-0149487399ac","resolution":{"observed_at":"2026-08-14T15:15:29.728261Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.714553Z","title":"Swarm and Evolutionary Computation1(1), 3–18 (2011)","venue":null,"work_id":"cbc68018-0b1d-4f81-b370-e6983711b526","year":2011},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.836929Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:02c04e2422c9f0191283347ea144a7d05e6811aefe0c21e58918cce20d784ec7","observation_id":"dbd0fb65-74c1-4985-abf2-65d335b115c5","resolution":{"observed_at":"2026-08-14T15:15:29.718141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.703520Z","title":"Journal of the American Statistical Associ- ation 56(293), 52–64 (1961)","venue":null,"work_id":"3f092fb0-bc9e-46ac-9353-fb351cb41a0f","year":1961},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.840879Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:04ce7dc0d16f053220d06576eea85115cb5c7bedc33758aad4e8858c8a5a227b","observation_id":"ea458c72-61e6-416b-85d4-a89ff97a95ec","resolution":{"observed_at":"2026-08-14T15:15:29.707084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.692259Z","title":"In: Proceedings of the 2002 IEEECongress on Evolutionary Computation","venue":null,"work_id":"59f098d5-81cb-46ff-96e0-95edc09313e3","year":2002},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.844681Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:709ea1cd5850cb67153141e13d309f2d4efa83edf189a40c423b911ecef0e4fe","observation_id":"591b43dd-d010-4d0d-aed2-a0b6eb959357","resolution":{"observed_at":"2026-08-14T15:15:29.696898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.681282Z","title":"Cambridge University Press (2010)","venue":null,"work_id":"62bcb35f-79ee-4e15-9093-051d7e9ed69b","year":2010},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.849154Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:85dd9bfc2474d567fbdb40d3315447c986d36ed82201aca02e32010441ff8276","observation_id":"327d4202-e7f4-4fed-a2e9-837cb7d23987","resolution":{"observed_at":"2026-08-14T15:15:29.685534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.669876Z","title":"Journal of the Royal Statistical Society","venue":null,"work_id":"9d1e0aaa-fb51-4b8b-8a16-d2b2638353a8","year":1954},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.853596Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:1859797260c5281e472301b50cd104f099f55290f11ccdccbcfbb5c2cf474425","observation_id":"cb6653e4-123d-4cef-bd0d-545404e716a5","resolution":{"observed_at":"2026-08-14T15:15:29.674070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0710.2024","last_updated":"2007-10-10T14:46:48Z","snapshot_observed_at":"2026-08-15T10:30:16.327254Z","submitted_at":"2007-10-10T14:46:48Z","title":"Ratios: A short guide to confidence limits and proper use","version":1},"cited_work":{"arxiv_id":"0710.2024","doi":null,"metadata_source":"pith","pith_arxiv_id":"0710.2024","snapshot_observed_at":"2026-08-14T15:15:29.102886Z","title":"Ratios: A short guide to confidence limits and proper use","venue":"stat.AP","work_id":"e97ebf0d-5443-439c-b425-a5ae341a1823","year":2007},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.857545Z"},"links":{"cited_paper":"/paper/0710.2024","citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:073da118641bca63c2b81a0f5e50339e96b52a00951ef5569aa053f00ca6009d","observation_id":"7831e7d8-8481-47ae-a165-b5f22fa8166c","resolution":{"observed_at":"2026-08-14T15:15:29.112258Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.659631Z","title":"Soft Computing 13(10), 959–977 (2009)","venue":null,"work_id":"e3d2c224-9464-4f55-9820-d95d3aaf0a09","year":2009},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.862858Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:ef1b198d37f04161a33f8ab35733887c02b013d11ecd598c1c5debf2c0574758","observation_id":"4b9b3ad0-846e-43cd-912c-0bbf0e0ce990","resolution":{"observed_at":"2026-08-14T15:15:29.662863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.647388Z","title":"Information Sciences180(10), 2044–2064 (2010)","venue":null,"work_id":"aa1c6e3a-89c7-4ef9-8d96-7757f1059eb6","year":2010},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.867012Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:394e6ed10d0fae51215c3e10ec22ba957e5cc4537dcfa0470b86b328bf8d3683","observation_id":"307140e6-cf44-498f-afc9-913cd5df7fa1","resolution":{"observed_at":"2026-08-14T15:15:29.652334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.634855Z","title":"Journal of Heuristics15(6), 617–644 (2008)","venue":null,"work_id":"0661424e-a47b-4492-96e1-4859970333eb","year":2008},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.871190Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:57288702b9a6c9700e850390682f70fe56a72ff50af5490b4fa5516f40fcef54","observation_id":"dff46ce3-b95f-480d-a025-d89286188d81","resolution":{"observed_at":"2026-08-14T15:15:29.638916Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.624680Z","title":"Cam- bridge university press (2006)","venue":null,"work_id":"f7b2644a-bdc7-4fc0-8943-269d0a9b9006","year":2006},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.876148Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:ea6bb3ad0b8fdccfc4c49fc403d6c19566e645e9f8f5a4cc5f4bb4bda5e33465","observation_id":"ad48e528-59a6-4531-9f69-35c90b5292ab","resolution":{"observed_at":"2026-08-14T15:15:29.628201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.613348Z","title":"Annals of Discrete Mathematics 5, 287–326 (1979)","venue":null,"work_id":"58fa2da5-9e42-4e3a-a7dc-9fe2af8a623d","year":1979},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.880576Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:eff2bd52dff4b1e48c6936f4a612e19e667c75a28504011fa9d583df7124daac","observation_id":"7693bc58-c46c-4b81-a010-95611620292e","resolution":{"observed_at":"2026-08-14T15:15:29.617706Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1603.08776","last_updated":"2016-05-19T11:58:22Z","snapshot_observed_at":"2026-08-14T22:04:04.799431Z","submitted_at":"2016-03-29T14:10:14Z","title":"COCO: The Experimental Procedure","version":2},"cited_work":{"arxiv_id":"1603.08776","doi":null,"metadata_source":"pith","pith_arxiv_id":"1603.08776","snapshot_observed_at":"2026-08-14T15:15:29.077684Z","title":"COCO: The Experimental Procedure","venue":"cs.AI","work_id":"d05cb9e7-7b28-46b7-9fe6-7124766a9b37","year":2016},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.884824Z"},"links":{"cited_paper":"/paper/1603.08776","citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:d2ac84039d880cab638903337a0669a66080abc08debfd771ebe73b14630a41e","observation_id":"53bbe477-90f4-4b48-b122-0bbba4e41d67","resolution":{"observed_at":"2026-08-14T15:15:29.085811Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.601266Z","title":"Scandinavian journal of statistics 6(2), 65–70 (1979)","venue":null,"work_id":"e7b0f3bc-6c06-4a7f-bb7b-b3b304973df4","year":1979},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.889055Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:850a2cf45f6874cd2b124fb6449d6b9473a56e9b36c4ed011c29928639cc36dc","observation_id":"79ddf051-9cbb-4299-b3db-ebb336522ccd","resolution":{"observed_at":"2026-08-14T15:15:29.605822Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.588044Z","title":"Operations Research42(2), 201–212 (1994)","venue":null,"work_id":"a2e31993-3b10-4508-81d4-502c8742d99f","year":1994},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.893794Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:304fc4bc61272943c47c269ac533dcc3d8a0f76b0ec83c235703877903630044","observation_id":"a3144c4f-f049-408a-9620-b730bc770975","resolution":{"observed_at":"2026-08-14T15:15:29.593017Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.575659Z","title":"Journal of Heuristics1(1), 33–42 (1996) 29","venue":null,"work_id":"c3eae3c8-6818-4447-b9c4-0d3de14ac15c","year":1996},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.900102Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:7c61a14f7313cfaf7ab1478a212b8f5d2e0291b6762f20c5e1f9eaaf230c0bc8","observation_id":"bfda7b77-853c-4300-aa75-ca6e4233c861","resolution":{"observed_at":"2026-08-14T15:15:29.581003Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.561801Z","title":"Ecological Monographs 54(2), 187–211 (1984)","venue":null,"work_id":"55020dc5-b055-4b2c-a9c3-dc915dfc63ae","year":1984},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.905816Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:5d261002a7d90be994c4fadffeac9c81d119fa61f21292684ca57f6a4c8c5d4a","observation_id":"779de1e0-d23e-4238-a015-f64a847861d8","resolution":{"observed_at":"2026-08-14T15:15:29.567472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.547781Z","title":"John Wiley and Sons Ltd (1991)","venue":null,"work_id":"fce91186-81ef-4056-8386-bc106b74f9a3","year":1991},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.911846Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:31df1b7d80c0ad9ffe1e6c39422846564f1ce9e58ef229443890755c718ea3ec","observation_id":"43bff494-8365-4793-ac3e-a9b9e610f428","resolution":{"observed_at":"2026-08-14T15:15:29.553864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.536702Z","title":null,"venue":null,"work_id":"4db290a6-0bf7-4e86-8672-0ac72e84f586","year":2002},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.916477Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:8942334c3ce3058e0afaf3503be8d1f40cdf02ec9587b9f0e249fa9f4a92919c","observation_id":"979329bd-4d98-4b49-8cd2-310666191a2e","resolution":{"observed_at":"2026-08-14T15:15:29.540982Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.523519Z","title":"Applied Soft Computing37, 217–226 (2015)","venue":null,"work_id":"b3b0d183-8bd2-4474-be0f-2ee69ade879c","year":2015},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.920960Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:7eccc945e3ccbcd44169c27e029b5681461ac1ebe27441380b4f99b2d7d17f9d","observation_id":"e669f82c-e48c-4699-9ea4-8379278780db","resolution":{"observed_at":"2026-08-14T15:15:29.528198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.511798Z","title":"Aca- demic Press, Inc","venue":null,"work_id":"7a71a401-572e-43fc-bb24-130ac254e57f","year":2010},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.925721Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:d2743e587f958e71476d6669d055c521804840c503902d0ecf9b72bcdbfe9e60","observation_id":"b76d7716-3610-4335-ba4e-7dbd433ae03b","resolution":{"observed_at":"2026-08-14T15:15:29.516519Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.499920Z","title":"In: Handbooks in Operations Research and Management Science, vol","venue":null,"work_id":"4e76af4a-211a-4fec-a274-81d1d203cfa6","year":1993},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.930601Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:68161c1ab2681d138b95e693a585abb181c064ac96cfe9b01dd498a10c544b14","observation_id":"8de3fb22-6458-46b2-a31d-2cfcd5ed9435","resolution":{"observed_at":"2026-08-14T15:15:29.504337Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.488859Z","title":null,"venue":null,"work_id":"a1bbaa8f-69f1-4efa-afe4-94644137394c","year":2010},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.935730Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:cbbefdb9de492dad3e72ce284a07f5d410c00332c63b4583f03a44049c28c677","observation_id":"c223f8f9-1a06-40b1-bf9e-4bb4fb23f885","resolution":{"observed_at":"2026-08-14T15:15:29.492463Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.478211Z","title":"The American Statistician 55(3), 187–193 (2001)","venue":null,"work_id":"7702a5d7-4798-47a7-994d-75e031c1742e","year":2001},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.941077Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:2f4496fff11d1eb252972b3caa74380435e503a077a163fba9913b8acb4a05f6","observation_id":"37622486-938d-41b8-931c-31fccde02745","resolution":{"observed_at":"2026-08-14T15:15:29.481909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.465108Z","title":"In preparation","venue":null,"work_id":"f6824c4e-8c61-4dcf-a6e2-3d4867942d33","year":null},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.945937Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:ef79e0ccfa6065116b7d504514a692ee68be38553a550f4657c67e1fa6204c13","observation_id":"9b9787ae-8125-4ca6-a062-5fe9c3ef6595","resolution":{"observed_at":"2026-08-14T15:15:29.470240Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.453092Z","title":"Matthews Malnar & Bailey Inc","venue":null,"work_id":"2a1ee34c-3980-4022-b406-9a5047168d26","year":2010},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.950616Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:c1f6f97eda0b866509438477a7f60ff48945717c13ef29e23089f2833037fb4a","observation_id":"19f8b2de-6c9b-430e-9821-e4b9a7af5bff","resolution":{"observed_at":"2026-08-14T15:15:29.457465Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.441549Z","title":"INFORMS Journal on Computing8(1), 1–15 (1996)","venue":null,"work_id":"5b966126-1264-4e8f-8229-59ab34828ff6","year":1996},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.957127Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:072b8828b04925f19bb4715354ba4e9fc03bcb73d70ce9647cd15d72dd5c398c","observation_id":"9f4b38da-83e5-418d-8013-6144d3dc6fcf","resolution":{"observed_at":"2026-08-14T15:15:29.445295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.430198Z","title":"Fisheries Research 70, 397–407 (2004)","venue":null,"work_id":"1eb7e7a4-fb45-4531-8e60-67a1fb838350","year":2004},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.965332Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:871a43f1321e2a77c0fafc77fbaee36c0ac9e319dce0d4d486cc378d2de6c83a","observation_id":"69ba5bd2-0864-4ec9-9f9e-fa7e8a8a4a35","resolution":{"observed_at":"2026-08-14T15:15:29.434724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.418166Z","title":"John Wiley & Sons (2013)","venue":null,"work_id":"4cb71832-655a-419f-aa18-5e7fc5008c22","year":2013},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.973023Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:21866cb939fd6168ae4e28ce959de37833c95666b4b48080e26cc688c739903b","observation_id":"7ce50db0-4e20-461b-896c-515a0d4e5ba5","resolution":{"observed_at":"2026-08-14T15:15:29.423550Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.405350Z","title":"Wiley (2013)","venue":null,"work_id":"9cdb9fa9-cacd-4e12-a5fb-68480542c9bf","year":2013},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.978207Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:63b49738eeb5a412c65a14124ce81d523485dd58b609993208b41a2d57621871","observation_id":"de5b14f8-0931-4e75-8f01-31252bc2a71f","resolution":{"observed_at":"2026-08-14T15:15:29.410383Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.392130Z","title":"Master’s thesis, Universi- dade Federal de Minas Gerais, Belo Horizonte, Brazil (2019)","venue":null,"work_id":"0b705dc4-64d9-4511-95a9-9b124259c15a","year":2019},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.983783Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:4e6d144ad83c8d873f42f22a58cdc703a395b6db86bed474c5a05fdb7e230078","observation_id":"1403fb96-f6a7-44c4-9240-b446cfe3ed9a","resolution":{"observed_at":"2026-08-14T15:15:29.396841Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.379885Z","title":"R Foundation for Statistical Computing, Vienna, Austria (2017)","venue":null,"work_id":"a1b08797-5c16-4ae6-b898-8e7aab9b47c1","year":2017},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.989081Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:bb18229452623da1904dc1a81c6a4863d97fe87b684a2018908243e98f734692","observation_id":"22722fc5-4a39-4ab1-a40b-2f62f2b73459","resolution":{"observed_at":"2026-08-14T15:15:29.384913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.368002Z","title":null,"venue":null,"work_id":"5598ef98-331f-4537-9f9e-eab3c84dddcc","year":2007},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:28.995116Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:592d0092e1799829e12e168a321c923e4273def0986c1f1483cdc0751e7ceb66","observation_id":"6001cc4a-726c-4660-85e8-457a4d5039b5","resolution":{"observed_at":"2026-08-14T15:15:29.372107Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.354495Z","title":"International Transactions in Operational Research00 (2016)","venue":null,"work_id":"20ad7dff-3678-4de3-b61b-d067b8b34c98","year":2016},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:29.000631Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:18d215182905a47a1731997a82a2f52d4deaf9e2563a75eb5bc571383335b9a7","observation_id":"64648f04-8a89-434a-8314-986c775930cd","resolution":{"observed_at":"2026-08-14T15:15:29.359181Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.343116Z","title":"Annual review of psychology46(1), 561–584 (1995)","venue":null,"work_id":"840ac375-4267-4b05-abfa-e14b9d263c8b","year":1995},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:29.005826Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:88758ab872238384529a8a9f7a26c85f801a139af35c5276f4e9c20bfda1b295","observation_id":"f7ca01cc-c13d-4252-99bf-cc3974a37e8f","resolution":{"observed_at":"2026-08-14T15:15:29.346965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.327406Z","title":"Taylor & Francis (2011)","venue":null,"work_id":"74e585b5-d465-4ea3-bae4-141a85cf5cad","year":2011},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:29.013819Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:a9ac9ea2e4e73fab88863b7db88ace747ea82f76b38cb64947420e27c60040b4","observation_id":"47ea38a3-e6d0-432f-8542-46babea4e9f0","resolution":{"observed_at":"2026-08-14T15:15:29.335003Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.310425Z","title":"In: Handbook of Heuristics, pp","venue":null,"work_id":"0c5b6e49-3644-448d-a807-f4dc35cd27db","year":2018},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:29.019969Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:687201f0dfc0ffbc025304c145ea04aba2ca27ed1185d75e7232b62ae785e432","observation_id":"3c0ea7f0-4876-43cb-82f7-0a0ad7f4121b","resolution":{"observed_at":"2026-08-14T15:15:29.317226Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.284366Z","title":"European Journal of Operational Research211(3), 612–622 (2011)","venue":null,"work_id":"d7f9342c-7e9a-4ea1-b101-fb513cc1b6d7","year":2011},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:29.025423Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:5543ff6f621d01cb83089e82aa285f15c7a91fcc80424eda310460e2ab6981ff","observation_id":"524ce73f-efca-404b-b809-72593cad41ca","resolution":{"observed_at":"2026-08-14T15:15:29.300304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.138222Z","title":"Parallel Problem Solving From Nature - PPSN VIII3242, 172–181 (2004)","venue":null,"work_id":"a6ec29c9-c367-437a-8279-6efad168abfe","year":2004},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:29.030419Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:3135bc14d6e487b92ad068fee6d91171a25b2270d5bc4ab61cda73b6661dfdff","observation_id":"d27c1a43-418f-4d2b-8303-aba2f251e28d","resolution":{"observed_at":"2026-08-14T15:15:29.143518Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:15:29.123927Z","title":"In: Proceedings of the 11th Annual conference on Genetic and evolutionary computation - GECCO09","venue":null,"work_id":"dd72e959-7671-4e3b-a9e4-17abd82a296d","year":2009},"citing_paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-14T15:15:29.039982Z"},"links":{"citing_paper":"/paper/1908.01720"},"observation_digest":"sha256:4bc6c53756930642567093efeaa66c1bf227449df826a6e2e4d53783a2ece2d4","observation_id":"9450ed81-23d3-4c11-8b59-ce79a8829736","resolution":{"observed_at":"2026-08-14T15:15:29.129267Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.01720","last_updated":"2019-08-05T16:53:59Z","latest_version":1,"primary_category":"stat.ME","snapshot_observed_at":"2026-08-16T12:27:21.600174Z","submitted_at":"2019-08-05T16:53:59Z","title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances"},"reference_resolution":{"displayed":60,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":51},"total_outbound_references":60},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 60 of 60 outbound references and 0 inbound Pith citation observations for arXiv:1908.01720."}