{"as_of":"2026-08-13T11:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:63685b18cd4ebbff97b1816d38de138ec1b229a9d63016789c452ce24c8a8e44","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-13T06:32:02.005865+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-13T06:15:37.239447Z","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:ccf1174d889264fdc0461f843b501918d5a823e25513f0c81deb41d679a9ce76","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T06:15:37.239447Z","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:5ec6b0303bee647d90658b30f4d183a347cf138314a265b91d27fa5bbed78354","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T06:15:37.239447Z","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:da2651baf44cdabffd9cf76ca1defde3f0b69df7eb3ab48e5e1b085be49c8e00","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T06:15:37.239447Z","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:878e2253c3da8c861648f09933a05a0f4f52d660e9b05d75739d95b0ffe6bb54","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T06:15:37.239447Z","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:415da7982ad5d3bbcb7b2d64d11fb5d2537c31ac7b9b27eed8bc180c70b9b0f8","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T06:15:37.239447Z","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:cc8292a0ed7f9dfb462fce1c32a09979f36d75e9edf349cc87817f207a4ad003","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T06:15:37.239447Z","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:4c84d1a8a3f2e55062ee43bf99ac4563864f7c260b64f6f1597683bda376feb5","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T06:15:37.239447Z","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:e18b20875c94e1163e6ae6585c6568e202584cb27cedd4742d6ea220cabfeefc","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T06:15:37.239447Z","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:beaea302c88305983834f129abf961cce27c3de1e00fcf2f7da884fbfa1e924f","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T06:15:37.239447Z","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:21496d1cf46a7a3bce73fd87942a9820d2e3e7c8406b54fb844476549eb41a98","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-13T06:15:37.239447Z","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:f738e3fd17f387d3d8820a82d658fea3b928285a6a4a767994dd5a02a21fcb4f","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T06:15:37.239447Z","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:bcaf46fbd0f87dbaed7cbda9cfdd0e42629a966e82e9ccb5803dcf5eb9cc934e","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T06:15:37.239447Z","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:82d8910e53bbf3bacde2bc63fa244261c3fe0080ceb3c7be142eb68d3b7541e6","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T06:15:37.239447Z","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:30f784cca5cbd70206ffda3ddc02fd73c3e03fc331df3e1522b9f89b1f9e611e","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T10:28:19.779036Z","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-13T06:15:37.239447Z","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:343ec3139f4f67865fef3a728ae87b64cc56598ccbef99c7fb555afb2f159abd","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-13T06:15:37.239447Z","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:7302b466e3d7bf0800d50f0ef7345b47a3120ea2aeec1182d76e36862b974701","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T06:15:37.239447Z","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:d2fcfaf49d731301bc64ed24336667772cf074321e0466ff569550b357205df1","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T06:15:37.239447Z","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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2501.17991."}