{"as_of":"2026-08-04T10:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:892766e63938a933933cc60ce0ab61fc985a5ddb3cb1130316c87ad92e087384","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-30T22:17:02.000552Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+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/2605.23957/citation-record","integrity":"/paper/2605.23957/integrity","json":"/paper/2605.23957/citation-record.json","paper":"/paper/2605.23957"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T14:23:52.288659Z","title":"Bertsekas.Dynamic Program- ming and Optimal Control, Vol","venue":null,"work_id":"fc0a42e9-583a-4bd5-861a-284854c9eb9e","year":2013},"citing_paper":{"arxiv_id":"2605.23957","last_updated":"2026-05-11T18:50:25Z","snapshot_observed_at":"2026-07-06T23:34:03.934151Z","submitted_at":"2026-05-11T18:50:25Z","title":"Low-Cost Labels, Reliable Choices: Rollout-Calibrated Hyper-Heuristics for Job Shop Scheduling","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-30T22:17:02.000552Z"},"links":{"citing_paper":"/paper/2605.23957"},"observation_digest":"sha256:bcb28eaf72a8c7ad65d6cb2f14dcd3e7f7fe074e96a4ee60cae671668c43e045","observation_id":"4c7fde88-cdb3-40ee-a0d8-2dd56837c030","resolution":{"observed_at":"2026-07-07T14:23:52.289831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-07T14:23:52.290380Z","title":"Pickardt, and Mengjie Zhang","venue":null,"work_id":"608223b5-d71c-47f0-b319-a4901a2d2a75","year":2016},"citing_paper":{"arxiv_id":"2605.23957","last_updated":"2026-05-11T18:50:25Z","snapshot_observed_at":"2026-07-06T23:34:03.934151Z","submitted_at":"2026-05-11T18:50:25Z","title":"Low-Cost Labels, Reliable Choices: Rollout-Calibrated Hyper-Heuristics for Job Shop Scheduling","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-30T22:17:02.000552Z"},"links":{"citing_paper":"/paper/2605.23957"},"observation_digest":"sha256:9bb914202ef6fd342b6d59574f662a2799d88584b36f423b124df3a95e95e6e8","observation_id":"6e65a6e0-a5b4-4918-bd5a-8558fbb22096","resolution":{"observed_at":"2026-07-07T14:23:52.291406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-07T14:23:52.312964Z","title":"Burke, Michel Gendreau, Matthew Hyde, Graham Kendall, Gabriela Ochoa, Ender ¨Ozcan, and Rong Qu","venue":null,"work_id":"81e3ce6a-51ac-4234-a56a-d81a62f0bb0a","year":2013},"citing_paper":{"arxiv_id":"2605.23957","last_updated":"2026-05-11T18:50:25Z","snapshot_observed_at":"2026-07-06T23:34:03.934151Z","submitted_at":"2026-05-11T18:50:25Z","title":"Low-Cost Labels, Reliable Choices: Rollout-Calibrated Hyper-Heuristics for Job Shop Scheduling","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-30T22:17:02.000552Z"},"links":{"citing_paper":"/paper/2605.23957"},"observation_digest":"sha256:1947ec1ef95e3862bea3f9f50b17619db9f482fb6264d9788cdec8fc9929b00b","observation_id":"718b3a96-12c5-4794-8c95-a32eb62bb452","resolution":{"observed_at":"2026-07-07T14:23:52.314182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-07T14:23:52.310802Z","title":"Analyzing bandit-based adaptive operator selection mechanisms.Annals of Math- ematics and Artificial Intelligence, 60(1–2):25–64,","venue":null,"work_id":"dd9c6670-c1d0-4fff-b0ba-7e38765ddb2c","year":2010},"citing_paper":{"arxiv_id":"2605.23957","last_updated":"2026-05-11T18:50:25Z","snapshot_observed_at":"2026-07-06T23:34:03.934151Z","submitted_at":"2026-05-11T18:50:25Z","title":"Low-Cost Labels, Reliable Choices: Rollout-Calibrated Hyper-Heuristics for Job Shop Scheduling","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-30T22:17:02.000552Z"},"links":{"citing_paper":"/paper/2605.23957"},"observation_digest":"sha256:fd317f76b760f6617f08b69007f58aac0ec6effe064549750ba70e3327499ed5","observation_id":"20993e33-0ccd-46f7-b932-fff97390cd15","resolution":{"observed_at":"2026-07-07T14:23:52.312052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-07T14:23:52.305499Z","title":"Thompson","venue":null,"work_id":"11868d04-4a24-4448-9386-44eec08cddfc","year":1960},"citing_paper":{"arxiv_id":"2605.23957","last_updated":"2026-05-11T18:50:25Z","snapshot_observed_at":"2026-07-06T23:34:03.934151Z","submitted_at":"2026-05-11T18:50:25Z","title":"Low-Cost Labels, Reliable Choices: Rollout-Calibrated Hyper-Heuristics for Job Shop Scheduling","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-30T22:17:02.000552Z"},"links":{"citing_paper":"/paper/2605.23957"},"observation_digest":"sha256:0f6eecd9d79453c37f7bf66d39df8d5c5bb54739de35e892686c2001288e1b08","observation_id":"e6e77293-5ab1-46e0-81df-fb18991ce2c2","resolution":{"observed_at":"2026-07-07T14:23:52.306542Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-07T14:23:52.308996Z","title":"Efficient dispatching rules for scheduling in a job shop.International Journal of Pro- duction Economics, 48(1):87–105,","venue":null,"work_id":"e74e8a69-5de6-4d1a-a577-c48a01b4df1f","year":1997},"citing_paper":{"arxiv_id":"2605.23957","last_updated":"2026-05-11T18:50:25Z","snapshot_observed_at":"2026-07-06T23:34:03.934151Z","submitted_at":"2026-05-11T18:50:25Z","title":"Low-Cost Labels, Reliable Choices: Rollout-Calibrated Hyper-Heuristics for Job Shop Scheduling","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-30T22:17:02.000552Z"},"links":{"citing_paper":"/paper/2605.23957"},"observation_digest":"sha256:a60230d0c6c81b10bf4bb037c488070fe99295718b337ed9d9bf08f05b399582","observation_id":"ad7e7d15-4abd-4673-8b30-853637f2be4f","resolution":{"observed_at":"2026-07-07T14:23:52.310257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-07T14:23:52.301937Z","title":"Multi-objective parameter configuration of machine learn- ing algorithms using model-based optimization","venue":null,"work_id":"5ee3c57a-0450-4d4d-b4ab-ac03e1cff9fe","year":2016},"citing_paper":{"arxiv_id":"2605.23957","last_updated":"2026-05-11T18:50:25Z","snapshot_observed_at":"2026-07-06T23:34:03.934151Z","submitted_at":"2026-05-11T18:50:25Z","title":"Low-Cost Labels, Reliable Choices: Rollout-Calibrated Hyper-Heuristics for Job Shop Scheduling","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-30T22:17:02.000552Z"},"links":{"citing_paper":"/paper/2605.23957"},"observation_digest":"sha256:b48d6c73533fb6a6555d4b2553eb1a0e6a193c886a557827b556854a328b4330","observation_id":"d742d117-f083-43b5-8229-4c580770c017","resolution":{"observed_at":"2026-07-07T14:23:52.303147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-07T14:23:52.303687Z","title":"Discovering dis- patching rules from data using imitation learning: A case study for the job-shop problem.Journal of Scheduling, 21(4):413–428,","venue":null,"work_id":"2e8e88e6-34f0-4e11-a17f-38a213225149","year":2018},"citing_paper":{"arxiv_id":"2605.23957","last_updated":"2026-05-11T18:50:25Z","snapshot_observed_at":"2026-07-06T23:34:03.934151Z","submitted_at":"2026-05-11T18:50:25Z","title":"Low-Cost Labels, Reliable Choices: Rollout-Calibrated Hyper-Heuristics for Job Shop Scheduling","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-30T22:17:02.000552Z"},"links":{"citing_paper":"/paper/2605.23957"},"observation_digest":"sha256:b1a01cba33cad538099dd0516a8da837bf68ec95c19d7f892fab901b79b96163","observation_id":"929bede3-e817-4c2f-91d2-90b3baa67d15","resolution":{"observed_at":"2026-07-07T14:23:52.304968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-07T14:23:52.307179Z","title":"Learning dispatching rules using random for- est in flexible job shop scheduling problems.International Journal of Production Research, 57(10):3290–3310,","venue":null,"work_id":"57746627-d2b7-4da0-9863-7f193588cf31","year":2019},"citing_paper":{"arxiv_id":"2605.23957","last_updated":"2026-05-11T18:50:25Z","snapshot_observed_at":"2026-07-06T23:34:03.934151Z","submitted_at":"2026-05-11T18:50:25Z","title":"Low-Cost Labels, Reliable Choices: Rollout-Calibrated Hyper-Heuristics for Job Shop Scheduling","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-30T22:17:02.000552Z"},"links":{"citing_paper":"/paper/2605.23957"},"observation_digest":"sha256:d7531e16533a7c7007876d1f6e8da04587306a36b7f5b958ef765cca08d66027","observation_id":"726795cc-fc72-4a6c-b4ff-6a4da8a9cf1c","resolution":{"observed_at":"2026-07-07T14:23:52.308463Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-07T14:23:52.314734Z","title":"POMO: Policy optimization with multiple optima for reinforcement learning","venue":null,"work_id":"33d072ba-b86d-4a28-97ec-e0b42c8a1003","year":2020},"citing_paper":{"arxiv_id":"2605.23957","last_updated":"2026-05-11T18:50:25Z","snapshot_observed_at":"2026-07-06T23:34:03.934151Z","submitted_at":"2026-05-11T18:50:25Z","title":"Low-Cost Labels, Reliable Choices: Rollout-Calibrated Hyper-Heuristics for Job Shop Scheduling","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-30T22:17:02.000552Z"},"links":{"citing_paper":"/paper/2605.23957"},"observation_digest":"sha256:79b91e4b1e0d2a03199cb45bdb4f0495e29b18768fd40ed801d0f54eacf7110d","observation_id":"3392c878-6979-40a6-a7ee-05edb632497f","resolution":{"observed_at":"2026-07-07T14:23:52.315941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-07T14:23:52.298488Z","title":"ASKSSA-CNN-BiLSTM: A novel time se- ries forecasting model for stock price prediction based on an enhanced sparrow search algorithm","venue":null,"work_id":"cb70dbc4-1694-4909-8fef-6c160cd7f8f8","year":2026},"citing_paper":{"arxiv_id":"2605.23957","last_updated":"2026-05-11T18:50:25Z","snapshot_observed_at":"2026-07-06T23:34:03.934151Z","submitted_at":"2026-05-11T18:50:25Z","title":"Low-Cost Labels, Reliable Choices: Rollout-Calibrated Hyper-Heuristics for Job Shop Scheduling","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-30T22:17:02.000552Z"},"links":{"citing_paper":"/paper/2605.23957"},"observation_digest":"sha256:3f55b95f65c0197ccbdf43045e63b498f08fb617120bf861949bc68a2eab9768","observation_id":"8c37f3eb-1d7b-428b-b664-736ddac205a6","resolution":{"observed_at":"2026-07-07T14:23:52.299703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-07T14:23:52.318304Z","title":"Evolution of heuristics: Towards efficient auto- matic algorithm design using large language model","venue":null,"work_id":"2bc89bfa-4fef-4ae3-a738-c720f64c547e","year":2024},"citing_paper":{"arxiv_id":"2605.23957","last_updated":"2026-05-11T18:50:25Z","snapshot_observed_at":"2026-07-06T23:34:03.934151Z","submitted_at":"2026-05-11T18:50:25Z","title":"Low-Cost Labels, Reliable Choices: Rollout-Calibrated Hyper-Heuristics for Job Shop Scheduling","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-30T22:17:02.000552Z"},"links":{"citing_paper":"/paper/2605.23957"},"observation_digest":"sha256:f8213ed96beaf5983e68eedb1ae062e7dc7122bdc602815d1fd9f43dec996bce","observation_id":"f491dbc1-5733-44ee-861e-a36393d28ab7","resolution":{"observed_at":"2026-07-07T14:23:52.319858Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-07T14:23:52.316480Z","title":"MRBMO: An enhanced red-billed blue magpie optimization algorithm for solving numerical optimization challenges.Symmetry, 17(8):1295,","venue":null,"work_id":"fc90f1ca-22c7-413c-89d0-91c14c24cafb","year":2025},"citing_paper":{"arxiv_id":"2605.23957","last_updated":"2026-05-11T18:50:25Z","snapshot_observed_at":"2026-07-06T23:34:03.934151Z","submitted_at":"2026-05-11T18:50:25Z","title":"Low-Cost Labels, Reliable Choices: Rollout-Calibrated Hyper-Heuristics for Job Shop Scheduling","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-30T22:17:02.000552Z"},"links":{"citing_paper":"/paper/2605.23957"},"observation_digest":"sha256:a6923c95a9b185f6c3915bfed81a5a7160be728d1e637fd82aaeaedf0d2bbc5c","observation_id":"bce947d9-2214-4f59-9b59-3ae34a69b4d5","resolution":{"observed_at":"2026-07-07T14:23:52.317761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-07T14:23:52.293412Z","title":null,"venue":null,"work_id":"a46124ae-a098-4990-8de8-6f04e31ac65f","year":2010},"citing_paper":{"arxiv_id":"2605.23957","last_updated":"2026-05-11T18:50:25Z","snapshot_observed_at":"2026-07-06T23:34:03.934151Z","submitted_at":"2026-05-11T18:50:25Z","title":"Low-Cost Labels, Reliable Choices: Rollout-Calibrated Hyper-Heuristics for Job Shop Scheduling","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-30T22:17:02.000552Z"},"links":{"citing_paper":"/paper/2605.23957"},"observation_digest":"sha256:e1d977f1c350d70e447abae6b72037fde2a700d69cfa346168a28469b0d44389","observation_id":"6d68a7d9-5cfa-4dcf-a2c2-93e54182aad4","resolution":{"observed_at":"2026-07-07T14:23:52.294507Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-07T14:23:52.291890Z","title":null,"venue":null,"work_id":"6e917048-5995-44c8-8099-8a763203df15","year":1977},"citing_paper":{"arxiv_id":"2605.23957","last_updated":"2026-05-11T18:50:25Z","snapshot_observed_at":"2026-07-06T23:34:03.934151Z","submitted_at":"2026-05-11T18:50:25Z","title":"Low-Cost Labels, Reliable Choices: Rollout-Calibrated Hyper-Heuristics for Job Shop Scheduling","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-30T22:17:02.000552Z"},"links":{"citing_paper":"/paper/2605.23957"},"observation_digest":"sha256:ab55b22500f1d32491d2f66b4660fbd1880de8c2723a41510cf373648dfee758","observation_id":"ce7da306-7581-4157-be70-6a8300823551","resolution":{"observed_at":"2026-07-07T14:23:52.292896Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.03051","last_updated":"2021-06-06T07:08:58Z","snapshot_observed_at":"2026-07-06T11:16:19.955258Z","submitted_at":"2021-06-06T07:08:58Z","title":"ScheduleNet: Learn to solve multi-agent scheduling problems with reinforcement learning","version":1},"cited_work":{"arxiv_id":"2106.03051","doi":"10.48550/arxiv.2106.03051","metadata_source":"arxiv_reference","pith_arxiv_id":"2106.03051","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"ScheduleNet: Learn to solve multi-agent scheduling problems with reinforcement learning","venue":null,"work_id":"98f0ae47-0e39-4355-b072-592d9dc28d00","year":2021},"citing_paper":{"arxiv_id":"2605.23957","last_updated":"2026-05-11T18:50:25Z","snapshot_observed_at":"2026-07-06T23:34:03.934151Z","submitted_at":"2026-05-11T18:50:25Z","title":"Low-Cost Labels, Reliable Choices: Rollout-Calibrated Hyper-Heuristics for Job Shop Scheduling","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-30T22:17:02.000552Z"},"links":{"cited_paper":"/paper/2106.03051","citing_paper":"/paper/2605.23957"},"observation_digest":"sha256:daf96837d430c5fd18269b5e2524d7dabdc9b0ed45ec22f4346786613412036c","observation_id":"0efc52f5-c0bb-440b-b37e-2521a14670e1","resolution":{"observed_at":"2026-07-01T14:05:46.966504Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-07T14:23:52.320394Z","title":"Pawan Kumar, Emilien Dupont, Francisco J","venue":null,"work_id":"0b467b3e-643a-46d6-8fb1-5996f28a5df2","year":2024},"citing_paper":{"arxiv_id":"2605.23957","last_updated":"2026-05-11T18:50:25Z","snapshot_observed_at":"2026-07-06T23:34:03.934151Z","submitted_at":"2026-05-11T18:50:25Z","title":"Low-Cost Labels, Reliable Choices: Rollout-Calibrated Hyper-Heuristics for Job Shop Scheduling","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-30T22:17:02.000552Z"},"links":{"citing_paper":"/paper/2605.23957"},"observation_digest":"sha256:2cc8ca935c2c7d8a8c49f3b465ee6accf515262a9105243a4752abedb331f9c2","observation_id":"ed5786b4-182a-4b95-8970-f785f9ed9544","resolution":{"observed_at":"2026-07-07T14:23:52.321576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-07T14:23:52.295036Z","title":"TSWOA: An enhanced WOA with triangular walk and spiral flight for engineering design optimization","venue":null,"work_id":"dcecbb21-e8e1-4483-9c14-45cc2627f2ee","year":2025},"citing_paper":{"arxiv_id":"2605.23957","last_updated":"2026-05-11T18:50:25Z","snapshot_observed_at":"2026-07-06T23:34:03.934151Z","submitted_at":"2026-05-11T18:50:25Z","title":"Low-Cost Labels, Reliable Choices: Rollout-Calibrated Hyper-Heuristics for Job Shop Scheduling","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-30T22:17:02.000552Z"},"links":{"citing_paper":"/paper/2605.23957"},"observation_digest":"sha256:36a1258382b9aca0fc6206cd412bd4a64f9111c7b8a408b70cf50d10224a1943","observation_id":"960e7820-f3ce-43fd-ab38-edd59e77e9b5","resolution":{"observed_at":"2026-07-07T14:23:52.296257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-07T14:23:52.296798Z","title":"ReEvo: Large language models as hyper-heuristics with reflective evolution","venue":null,"work_id":"79f3e7d8-0a4d-4e8a-b352-bb825776eb30","year":2024},"citing_paper":{"arxiv_id":"2605.23957","last_updated":"2026-05-11T18:50:25Z","snapshot_observed_at":"2026-07-06T23:34:03.934151Z","submitted_at":"2026-05-11T18:50:25Z","title":"Low-Cost Labels, Reliable Choices: Rollout-Calibrated Hyper-Heuristics for Job Shop Scheduling","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-30T22:17:02.000552Z"},"links":{"citing_paper":"/paper/2605.23957"},"observation_digest":"sha256:d107fe22c80dc121e1e62d2c4c4dbd323c64a5fbabb1c450e75d11cca3ecf6ad","observation_id":"092ce64d-aa20-4dd9-a769-f71589856e70","resolution":{"observed_at":"2026-07-07T14:23:52.297968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-07T14:23:52.300214Z","title":"Learning to dispatch for job shop scheduling via deep reinforcement learning","venue":null,"work_id":"d1ef0aba-bce8-47a1-a9e5-1feccc0cf704","year":2020},"citing_paper":{"arxiv_id":"2605.23957","last_updated":"2026-05-11T18:50:25Z","snapshot_observed_at":"2026-07-06T23:34:03.934151Z","submitted_at":"2026-05-11T18:50:25Z","title":"Low-Cost Labels, Reliable Choices: Rollout-Calibrated Hyper-Heuristics for Job Shop Scheduling","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-30T22:17:02.000552Z"},"links":{"citing_paper":"/paper/2605.23957"},"observation_digest":"sha256:08088ee454a0a420cbae76d698b4ec1d90e68fb6b35752cd17ef930bfc552295","observation_id":"a14b4fe4-d162-4442-90f8-9514785b00f0","resolution":{"observed_at":"2026-07-07T14:23:52.301404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.23957","last_updated":"2026-05-11T18:50:25Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T23:34:03.934151Z","submitted_at":"2026-05-11T18:50:25Z","title":"Low-Cost Labels, Reliable Choices: Rollout-Calibrated Hyper-Heuristics for Job Shop Scheduling"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":1,"verified_fuzzy":17},"total_outbound_references":20},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2605.23957."}