{"as_of":"2026-08-19T05:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6c470df13941b5094c3f444ca9a799e2d2e239756a55dcd2f5b5a583c3282162","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T04:29:15.065418Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2501.17991/citation-record","integrity":"/paper/2501.17991/integrity","json":"/paper/2501.17991/citation-record.json","paper":"/paper/2501.17991"},"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-10T04:29:15.444283Z","title":"Modeling and solving scheduling problems in practice","venue":null,"work_id":"7cf60155-8896-4884-925f-4883634dc5bc","year":2012},"citing_paper":{"arxiv_id":"2501.17991","last_updated":"2025-01-29T20:55:53Z","snapshot_observed_at":"2026-08-18T02:23:09.421216Z","submitted_at":"2025-01-29T20:55:53Z","title":"Investigating the Monte-Carlo Tree Search Approach for the Job Shop Scheduling Problem","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T04:29:14.963349Z"},"links":{"citing_paper":"/paper/2501.17991"},"observation_digest":"sha256:852b5b4382779c8aa000feb546099bddb80987eb262e0d6822bfa1a1d11caae8","observation_id":"9ca90268-1fc9-424f-ae75-9b2546084217","resolution":{"observed_at":"2026-08-10T04:29:15.452379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T04:29:15.421337Z","title":"The shifting bottleneck procedure for job shop scheduling","venue":null,"work_id":"995cf9f1-31b4-4623-a94d-917d10220395","year":1988},"citing_paper":{"arxiv_id":"2501.17991","last_updated":"2025-01-29T20:55:53Z","snapshot_observed_at":"2026-08-18T02:23:09.421216Z","submitted_at":"2025-01-29T20:55:53Z","title":"Investigating the Monte-Carlo Tree Search Approach for the Job Shop Scheduling Problem","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T04:29:14.969431Z"},"links":{"citing_paper":"/paper/2501.17991"},"observation_digest":"sha256:e08da6f32b132e21eb2c8cf66d03e785de83c020f1e110ae316accc82231809f","observation_id":"2b86e6fc-4a5b-4641-aab0-cb765a24e26f","resolution":{"observed_at":"2026-08-10T04:29:15.430075Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T04:29:15.399073Z","title":"The one-machine sequencing problem","venue":null,"work_id":"264860d7-5765-4445-9b4e-7fb6742c80e6","year":1982},"citing_paper":{"arxiv_id":"2501.17991","last_updated":"2025-01-29T20:55:53Z","snapshot_observed_at":"2026-08-18T02:23:09.421216Z","submitted_at":"2025-01-29T20:55:53Z","title":"Investigating the Monte-Carlo Tree Search Approach for the Job Shop Scheduling Problem","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T04:29:14.975813Z"},"links":{"citing_paper":"/paper/2501.17991"},"observation_digest":"sha256:0ca6f008d0fd8e8fcc4f3e352197054be82560a57f9f1c2e163104bc1154c740","observation_id":"54e38022-0dfd-4c66-a19b-f2cecb7bd3a5","resolution":{"observed_at":"2026-08-10T04:29:15.404810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T04:29:15.377061Z","title":"Gelatt, and M","venue":null,"work_id":"5400f45b-8792-4593-b4fa-ead823250d70","year":1983},"citing_paper":{"arxiv_id":"2501.17991","last_updated":"2025-01-29T20:55:53Z","snapshot_observed_at":"2026-08-18T02:23:09.421216Z","submitted_at":"2025-01-29T20:55:53Z","title":"Investigating the Monte-Carlo Tree Search Approach for the Job Shop Scheduling Problem","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T04:29:14.982193Z"},"links":{"citing_paper":"/paper/2501.17991"},"observation_digest":"sha256:6066111782024912fd5869ee1ff36f8c86632757fc5abc9a483bd0ab7ee8c1c4","observation_id":"fb0a51aa-58a8-4ca8-957b-97ac31cfaef0","resolution":{"observed_at":"2026-08-10T04:29:15.384238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T04:29:15.354073Z","title":"Rutenbar","venue":null,"work_id":"4c068f64-04ca-4fe6-81b5-48c62052117f","year":1989},"citing_paper":{"arxiv_id":"2501.17991","last_updated":"2025-01-29T20:55:53Z","snapshot_observed_at":"2026-08-18T02:23:09.421216Z","submitted_at":"2025-01-29T20:55:53Z","title":"Investigating the Monte-Carlo Tree Search Approach for the Job Shop Scheduling Problem","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T04:29:14.989880Z"},"links":{"citing_paper":"/paper/2501.17991"},"observation_digest":"sha256:879139fe6a8f52b0360fb1e0f0ab384ffb27675bcf19259c6f7f881a05df166d","observation_id":"5746a005-e819-4e51-8c8f-1353a82ae6bd","resolution":{"observed_at":"2026-08-10T04:29:15.361397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T04:29:15.330553Z","title":"Applying tabu search to the job- shop scheduling problem","venue":null,"work_id":"28a49d25-d945-4083-a468-9340723c1af7","year":1993},"citing_paper":{"arxiv_id":"2501.17991","last_updated":"2025-01-29T20:55:53Z","snapshot_observed_at":"2026-08-18T02:23:09.421216Z","submitted_at":"2025-01-29T20:55:53Z","title":"Investigating the Monte-Carlo Tree Search Approach for the Job Shop Scheduling Problem","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T04:29:14.995609Z"},"links":{"citing_paper":"/paper/2501.17991"},"observation_digest":"sha256:e820c748153e41c1c2927ec1a2268f74e7ece003f1f56283dbb36ba1746c46c8","observation_id":"16c410b9-9a8a-4a1d-b786-119d4c36052a","resolution":{"observed_at":"2026-08-10T04:29:15.339200Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T04:29:15.305832Z","title":"Nowicki and C","venue":null,"work_id":"230d45c7-ccd1-4827-80e9-8dd71a1d2269","year":1996},"citing_paper":{"arxiv_id":"2501.17991","last_updated":"2025-01-29T20:55:53Z","snapshot_observed_at":"2026-08-18T02:23:09.421216Z","submitted_at":"2025-01-29T20:55:53Z","title":"Investigating the Monte-Carlo Tree Search Approach for the Job Shop Scheduling Problem","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T04:29:15.002171Z"},"links":{"citing_paper":"/paper/2501.17991"},"observation_digest":"sha256:534b2a926af7a4aaa09ecc7698171e332ff1837d862b12cbdf7a177c874461d9","observation_id":"83879a42-2581-49b8-a58b-de71160ba6db","resolution":{"observed_at":"2026-08-10T04:29:15.312440Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T04:29:15.286160Z","title":"An advanced tabu search algorithm for the job shop problem","venue":null,"work_id":"1e78aeff-1825-43eb-b9fb-08a9131a1493","year":2005},"citing_paper":{"arxiv_id":"2501.17991","last_updated":"2025-01-29T20:55:53Z","snapshot_observed_at":"2026-08-18T02:23:09.421216Z","submitted_at":"2025-01-29T20:55:53Z","title":"Investigating the Monte-Carlo Tree Search Approach for the Job Shop Scheduling Problem","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T04:29:15.007611Z"},"links":{"citing_paper":"/paper/2501.17991"},"observation_digest":"sha256:aee7314d4d87c8707ac4da86ed7189218f7b9af89ee9b95c825e81d0cba058df","observation_id":"7be7d2c8-070c-405d-9b45-6702d07695d0","resolution":{"observed_at":"2026-08-10T04:29:15.293072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T04:29:15.268540Z","title":"Learning to dispatch for job shop scheduling via deep rein- forcement learning","venue":null,"work_id":"89030639-e131-4079-9e2e-979fccfec977","year":2020},"citing_paper":{"arxiv_id":"2501.17991","last_updated":"2025-01-29T20:55:53Z","snapshot_observed_at":"2026-08-18T02:23:09.421216Z","submitted_at":"2025-01-29T20:55:53Z","title":"Investigating the Monte-Carlo Tree Search Approach for the Job Shop Scheduling Problem","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T04:29:15.014048Z"},"links":{"citing_paper":"/paper/2501.17991"},"observation_digest":"sha256:22aa284d1d1cd1a7811f722c36aed7247ce46df601b17c1d7f51a4b4cf28db26","observation_id":"919af17f-cc12-4e08-9d97-70af64eb9599","resolution":{"observed_at":"2026-08-10T04:29:15.274269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T04:29:15.019679Z","title":"Mastering the game of go with deep neural networks and tree search","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.17991","last_updated":"2025-01-29T20:55:53Z","snapshot_observed_at":"2026-08-18T02:23:09.421216Z","submitted_at":"2025-01-29T20:55:53Z","title":"Investigating the Monte-Carlo Tree Search Approach for the Job Shop Scheduling Problem","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T04:29:15.019679Z"},"links":{"citing_paper":"/paper/2501.17991"},"observation_digest":"sha256:812b732ac79ddcea67d9f7cdddaef8a3689508d27182b2f732f4e611a536526f","observation_id":"f3122e02-0aca-46f4-b420-91b77063b933","resolution":{"observed_at":"2026-08-10T04:29:15.019679Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T04:29:15.237328Z","title":"Benchmarks for basic scheduling problems","venue":null,"work_id":"e4963500-7cca-4b66-9e49-5f2cc1f24a27","year":1993},"citing_paper":{"arxiv_id":"2501.17991","last_updated":"2025-01-29T20:55:53Z","snapshot_observed_at":"2026-08-18T02:23:09.421216Z","submitted_at":"2025-01-29T20:55:53Z","title":"Investigating the Monte-Carlo Tree Search Approach for the Job Shop Scheduling Problem","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T04:29:15.025481Z"},"links":{"citing_paper":"/paper/2501.17991"},"observation_digest":"sha256:7c8062db4eb0dd7b5f4e6a2b9b26edf6b62cc59accfbb351f83b509714018e96","observation_id":"7d5294b7-0369-4503-95fc-02f12861ca9e","resolution":{"observed_at":"2026-08-10T04:29:15.242594Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T04:29:15.217953Z","title":"A monte-carlo tree search algorithm for the flexible job-shop scheduling in manufacturing systems","venue":null,"work_id":"b7ed8cee-c8bc-4d7a-9dfa-8806fd944083","year":2023},"citing_paper":{"arxiv_id":"2501.17991","last_updated":"2025-01-29T20:55:53Z","snapshot_observed_at":"2026-08-18T02:23:09.421216Z","submitted_at":"2025-01-29T20:55:53Z","title":"Investigating the Monte-Carlo Tree Search Approach for the Job Shop Scheduling Problem","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T04:29:15.031494Z"},"links":{"citing_paper":"/paper/2501.17991"},"observation_digest":"sha256:cabab95488f3f34445f2e25174bee759c140b4f0ad6e9d8c197c0928015ca451","observation_id":"017ece56-bf11-4450-afd0-3d99079dcfa7","resolution":{"observed_at":"2026-08-10T04:29:15.223710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T04:29:15.199528Z","title":"A new mcts-based algorithm for multi-objective flexible job shop scheduling problem","venue":null,"work_id":"ebe98ff7-ba35-47f2-b868-35515b170061","year":2015},"citing_paper":{"arxiv_id":"2501.17991","last_updated":"2025-01-29T20:55:53Z","snapshot_observed_at":"2026-08-18T02:23:09.421216Z","submitted_at":"2025-01-29T20:55:53Z","title":"Investigating the Monte-Carlo Tree Search Approach for the Job Shop Scheduling Problem","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T04:29:15.037771Z"},"links":{"citing_paper":"/paper/2501.17991"},"observation_digest":"sha256:7306679d5e8bccf248c7021e18976bfe6bc19ec8e782999ea9ba280d8ccb7c41","observation_id":"324ad7f7-93df-47e7-80a8-4ea3e7ffc1e7","resolution":{"observed_at":"2026-08-10T04:29:15.205026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T04:29:15.181025Z","title":"A survey of monte carlo tree search methods","venue":null,"work_id":"b4f80ebb-33af-4258-814a-98704dfbe318","year":2012},"citing_paper":{"arxiv_id":"2501.17991","last_updated":"2025-01-29T20:55:53Z","snapshot_observed_at":"2026-08-18T02:23:09.421216Z","submitted_at":"2025-01-29T20:55:53Z","title":"Investigating the Monte-Carlo Tree Search Approach for the Job Shop Scheduling Problem","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T04:29:15.042521Z"},"links":{"citing_paper":"/paper/2501.17991"},"observation_digest":"sha256:43b7aa57925c380c729c246fe6014f867821bd09f155f8f3de73c0885370e9d2","observation_id":"a02022cd-2aec-40b9-9a38-e50858519d9f","resolution":{"observed_at":"2026-08-10T04:29:15.186668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.12794","last_updated":"2025-03-17T10:18:45Z","snapshot_observed_at":"2026-08-16T15:06:04.867573Z","submitted_at":"2023-08-24T13:49:48Z","title":"Job Shop Scheduling Benchmark: Environments and Instances for Learning and Non-learning Methods","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.12794","snapshot_observed_at":"2026-08-10T04:29:15.048414Z","title":"Job shop scheduling benchmark: Environments and instances for learning and non-learning methods","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.17991","last_updated":"2025-01-29T20:55:53Z","snapshot_observed_at":"2026-08-18T02:23:09.421216Z","submitted_at":"2025-01-29T20:55:53Z","title":"Investigating the Monte-Carlo Tree Search Approach for the Job Shop Scheduling Problem","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T04:29:15.048414Z"},"links":{"cited_paper":"/paper/2308.12794","citing_paper":"/paper/2501.17991"},"observation_digest":"sha256:1601d8adc40d21dadfca827acd1a39aa3beb602dd85ec65882246ad79fe8e229","observation_id":"21183623-e437-4ff0-99ec-b953f717ee3a","resolution":{"observed_at":"2026-08-10T04:29:15.048414Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T04:29:15.159393Z","title":"Benchmarks for shop scheduling problems","venue":null,"work_id":"dcd33a83-76d9-46bb-9320-1e0845434ab5","year":1998},"citing_paper":{"arxiv_id":"2501.17991","last_updated":"2025-01-29T20:55:53Z","snapshot_observed_at":"2026-08-18T02:23:09.421216Z","submitted_at":"2025-01-29T20:55:53Z","title":"Investigating the Monte-Carlo Tree Search Approach for the Job Shop Scheduling Problem","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T04:29:15.055166Z"},"links":{"citing_paper":"/paper/2501.17991"},"observation_digest":"sha256:9324ba2a818f8765a902671d1f0d76a2bfb4f68df50e94212768949822c20085","observation_id":"40a4a5ce-961a-41d7-be4d-b6f3e62225e9","resolution":{"observed_at":"2026-08-10T04:29:15.166709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T04:29:15.137401Z","title":null,"venue":null,"work_id":"b938ec2a-1fd6-4377-9867-12381bc5152f","year":null},"citing_paper":{"arxiv_id":"2501.17991","last_updated":"2025-01-29T20:55:53Z","snapshot_observed_at":"2026-08-18T02:23:09.421216Z","submitted_at":"2025-01-29T20:55:53Z","title":"Investigating the Monte-Carlo Tree Search Approach for the Job Shop Scheduling Problem","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T04:29:15.065418Z"},"links":{"citing_paper":"/paper/2501.17991"},"observation_digest":"sha256:b18fd00b81f3da373b756b0124c71928b81018937fb0fedd70958f77e9c2e304","observation_id":"0af249fd-99c1-4f63-bfd2-df393a194bd6","resolution":{"observed_at":"2026-08-10T04:29:15.143972Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.17991","last_updated":"2025-01-29T20:55:53Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-18T02:23:09.421216Z","submitted_at":"2025-01-29T20:55:53Z","title":"Investigating the Monte-Carlo Tree Search Approach for the Job Shop Scheduling Problem"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":14},"total_outbound_references":17},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2501.17991."}