{"as_of":"2026-08-09T06:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:68fce879cf6d42ba92814190312ea2066e76627f103b515fdb9fd2403214f08e","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-09T06:31:02.800959+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-08-08T01:38:58.003371Z","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:24554b8619f904e1bfdbb02755cd282f951ece45bc08e076b450717ec34f1636","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T01:38:58.003371Z","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:8e9a98b764d6de33d9226d4b8388df4240013888077f9933bab0faf22112da0c","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T01:38:58.003371Z","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:4aa10077b9e66974699b4f467296e005dceda38b9daf039f7d1291069716ee33","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T01:38:58.003371Z","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:037e64df03e50e506f6f9efa05679830210450f7a6fedfa7102b83c56d607c35","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T01:38:58.003371Z","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:59f794c90f1a6263d1f6ff808439a57640002bbb8f83f4258cd17cde7c4e9867","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T01:38:58.003371Z","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:f9c6bf7175991fcb5595ed1cf5b45fb257517f11815c47ffaf7aa57aca8e225c","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T01:38:58.003371Z","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:7e6ef87b140689ea44cbb101416198122211f8e9fcd5a5f8ce605e8f8890fc2a","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T01:38:58.003371Z","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:f214f289f0747807102f352ee6e095cc267053e06b9adbc14f8026f3e7a404ad","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T01:38:58.003371Z","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:cbd2f5fccc8e27bce656576adff12a11aa382f047a0cc1e1829145703f1d8c56","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T01:38:58.003371Z","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:c00ed3b6b7bd81259a8536abc43afe24cd452afc635b2211c2bc29cefd005d7d","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T01:38:58.003371Z","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:4d75719b2ec8adbbd8e623792dc98c3ee0826c88e36e2eae2c3a7290dc0e407c","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T01:38:58.003371Z","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:e1977833ad534b89444f9772fcccaf212049048d6cccc772199b025feda2e67a","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T01:38:58.003371Z","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:db243f9e045d3f6082c4309a1fed4cbaf1f484cc8a4d4cac5be88f0b774aa02c","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T01:38:58.003371Z","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:dd275821ca58973fa3bc59cd002eb1513515d2c2c74edbd86a476d9934187efa","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T01:38:58.003371Z","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:dee4aa00244cc72f60a46ac8f849d62dd6ecafd27b675a45a44467b8b87292b2","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-05T02:28:24.338817Z","title":"ScheduleNet: Learn to solve multi-agent scheduling problems with reinforcement learning","venue":"arXiv (Cornell University)","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-08-08T01:38:58.003371Z","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:1eff0a49101cbbe1a152b397b63419875c6e1cef92395ce390c3da119a1fe725","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T01:38:58.003371Z","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:56347e5c5ff06681f6c2e04cd0d410842bce1eac7eb0d806df72ff18ad865c27","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T01:38:58.003371Z","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:405585797dab18a85ae1bfc02ec0692b5beaccf27cc81ee2552bb5cdf47e839d","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T01:38:58.003371Z","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:b2f2065ec4abf4b040e860f18ebe62bf5f156c85faee29c87451918928df644d","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T01:38:58.003371Z","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:ca691b09af86f5ef7044ff0040e48b83eee24bc10e19e22c2e9c5d8a08b65c6f","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-08T01:38:58.003371Z","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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2605.23957."}