{"as_of":"2026-08-12T12:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3f566e2fc5d4d3343c5607ced7b13ca7427e7972d3538f0db134bb896c10c62c","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T00:09:17.460014Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T19:40:46.711050Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-10T19:40:47.252087Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"cited_work":{"arxiv_id":"2412.01937","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.01937","snapshot_observed_at":"2026-08-10T19:40:47.252087Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","venue":"cs.AI","work_id":"d6d4e7be-de4f-46d8-99a7-5083951e263b","year":2024},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.711050Z"},"links":{"cited_paper":"/paper/2412.01937","citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:ca1d7aa14a9e2e8b258c7b539a910d89bfac749d222926534f76c387ad0e72d2","observation_id":"4683f929-c1df-40be-b0bb-204ecaa93c45","resolution":{"observed_at":"2026-08-10T19:40:47.256797Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.01937/citation-record","integrity":"/paper/2412.01937/integrity","json":"/paper/2412.01937/citation-record.json","paper":"/paper/2412.01937"},"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-12T00:09:17.978560Z","title":"Graph puzzles, homotopy, and the alternating group","venue":null,"work_id":"5c6e37e2-e2ff-4957-89c9-973d1af7341a","year":1974},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.317711Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:2013d1b05d428c369a19c973a81611d710a09394bce595545db53f0f2da63a0d","observation_id":"277a57b4-ae31-4b15-85ff-84531fb44659","resolution":{"observed_at":"2026-08-12T00:09:17.982355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T00:09:17.965923Z","title":"Discrete configuration spaces of squares and hexagons","venue":null,"work_id":"025bc863-0d35-406a-a840-6415927b2a7a","year":2020},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.322199Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:fde465030efc0e37f1490f4c2667555cafd4904dfc5e6627bf646aa6ba3e2089","observation_id":"9b22c0b3-45c6-43dd-93d4-170b2e5c6340","resolution":{"observed_at":"2026-08-12T00:09:17.969880Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2201.00919","last_updated":"2022-01-04T00:36:30Z","snapshot_observed_at":"2026-08-10T21:26:21.195539Z","submitted_at":"2022-01-04T00:36:30Z","title":"Parity Property of Hexagonal Sliding Puzzles","version":1},"cited_work":{"arxiv_id":"2201.00919","doi":null,"metadata_source":"pith","pith_arxiv_id":"2201.00919","snapshot_observed_at":"2026-08-12T00:09:17.541592Z","title":"Parity Property of Hexagonal Sliding Puzzles","venue":"math.CO","work_id":"d0b8850a-d19d-44a3-9174-7b52acaf17a3","year":2022},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.326577Z"},"links":{"cited_paper":"/paper/2201.00919","citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:866bd085625c0268409411bb5b93deabdf689a7c7d4d6afe5a5d4dfc01fc88f1","observation_id":"ea10d1aa-7cb0-4d44-a2e9-15158ff37413","resolution":{"observed_at":"2026-08-12T00:09:17.546092Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.14143","last_updated":"2023-07-26T12:17:41Z","snapshot_observed_at":"2026-07-06T15:58:47.788295Z","submitted_at":"2023-07-26T12:17:41Z","title":"Higher-dimensional cubical sliding puzzles","version":1},"cited_work":{"arxiv_id":"2307.14143","doi":null,"metadata_source":"pith","pith_arxiv_id":"2307.14143","snapshot_observed_at":"2026-08-12T00:09:17.520194Z","title":"Higher-dimensional cubical sliding puzzles","venue":"math.CO","work_id":"db3ea015-c8a7-45bc-bbe2-6daf8f69fbd9","year":2023},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.330929Z"},"links":{"cited_paper":"/paper/2307.14143","citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:e0dc2ec8307ed8083c2f8204379af1873b5b4f1944ce5415993da70f3ba81db5","observation_id":"0526918d-c770-4220-bc77-e8ae414060b3","resolution":{"observed_at":"2026-08-12T00:09:17.526688Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T00:09:17.953445Z","title":"Finding the shortest move-sequence in the graph-generalized 15-puzzle is NP-hard","venue":null,"work_id":"bae4fc69-f0fa-4ea3-a4df-c33bc4528e2c","year":2011},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.335473Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:c8fe03232a52dceb9539ab9811cda19fd2e2b481a55c51ec47fc6f354e5e21f1","observation_id":"a42575cc-a50d-4843-9a7f-1f8376e24f49","resolution":{"observed_at":"2026-08-12T00:09:17.957802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T00:09:17.939912Z","title":"A formal basis for the heuristic determination of minimum cost paths","venue":null,"work_id":"92f3b66f-a946-446e-846a-9fc279fa7279","year":1968},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.339802Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:0c0adf33865f0b8f1109badce4d6f2b762fd33263d207a1da539312be24ba13d","observation_id":"233de0e6-c87e-425e-b442-b79f83c6473e","resolution":{"observed_at":"2026-08-12T00:09:17.944177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T00:09:17.925133Z","title":"Reinforcement Learning: An Introduction","venue":null,"work_id":"cf757203-2cc1-4ef8-88c3-666b4302f803","year":1999},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.343986Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:e05e5d0be73daf6ae29af7e54b363bac952984112c7ca97c4a4fa83ab8df5c08","observation_id":"5d94cdd4-fd3c-4e01-8653-155e177edbc9","resolution":{"observed_at":"2026-08-12T00:09:17.929632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T00:09:17.911574Z","title":"Markov games as a framework for multi-agent reinforcement learning","venue":null,"work_id":"a2771747-f171-436a-98d7-c37ab4839808","year":1994},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.347747Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:ef20f8ebecb30b30e2301a2e5a01ff3c28f914448c425da64c16e999c46c5d22","observation_id":"f1005c7d-a1ce-4ce1-b4d3-26bb46dcc150","resolution":{"observed_at":"2026-08-12T00:09:17.915816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T00:09:17.897570Z","title":"Reinforcement learning and approximate dynamic programming for feedback control","venue":null,"work_id":"a811e28c-7451-4dcb-9e58-cecd322fefb0","year":2013},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.351260Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:1d87266cf80317b228e2b1dc52a1c43ea9d9ab7dc18d3fa4c11a378100a498d9","observation_id":"3b1c73fd-9910-4846-8ab0-d1df048ade0d","resolution":{"observed_at":"2026-08-12T00:09:17.902191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T00:09:17.884439Z","title":"Approximate Dynamic Programming: Solving the curses of dimensionality , volume","venue":null,"work_id":"c1028fe9-7128-4149-8832-ed3d6b00b47d","year":null},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.354700Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:944f179d0dcbd2f044673b962f5bd68dc4819504aef7161f7d347bf36c956fd2","observation_id":"b949817b-6353-4930-a1da-96239c68dbb6","resolution":{"observed_at":"2026-08-12T00:09:17.888740Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T00:09:17.361830Z","title":"Reinforcement learning: An introduction","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.361830Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:b89810fb66db7cd3b6eae398d3e919195d7564db3c7f72af0a73785992ce7e1f","observation_id":"a095627c-ba75-4be1-abd7-24678e23616e","resolution":{"observed_at":"2026-08-12T00:09:17.361830Z","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-12T00:09:17.848835Z","title":"Simulation-based optimization, volume 62","venue":null,"work_id":"059fc7f1-2148-400d-afa8-3e3e1eb46d20","year":2015},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.365430Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:050d5c1e4dcdbc9fa25ce4648ec560b502394a09362f4b3dfea1bdcf4c088459","observation_id":"c5dd788a-9aca-4602-b42c-b2b4e7943553","resolution":{"observed_at":"2026-08-12T00:09:17.852931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T00:09:17.835397Z","title":"A comprehensive survey of multiagent rein- forcement learning","venue":null,"work_id":"1b911e53-e179-4d20-ba0a-c1ff9286df84","year":2008},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.368852Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:798ec511d8b02b7039aa12977b941ae22efeb0dc7326e180436eef7f65936430","observation_id":"07bb3d43-fc1d-44cc-89aa-b42976628b74","resolution":{"observed_at":"2026-08-12T00:09:17.839746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T00:09:17.821825Z","title":"Nature-inspired optimization algorithms, volume 2","venue":null,"work_id":"6a12cb76-36bc-4443-93c4-b2902e2214af","year":2020},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.372270Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:77323783fc0e8bda4e77088f3f65ef9bfa3add08ac9ffdfefbc5cca0b165ab03","observation_id":"7cee7011-91e9-47b7-a0f9-d5850d0de9cf","resolution":{"observed_at":"2026-08-12T00:09:17.825924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T00:09:17.809478Z","title":"Optimal dynamic treatment regimes","venue":null,"work_id":"4e81db88-5d9c-4c0a-a31d-bf542b822d08","year":2003},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.375780Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:8ad09db38db7e77fd1e5325a0480433aaf812f37f0d650e8d2a521e5392cbc29","observation_id":"38444cec-710c-4c75-8625-5cd8fd966769","resolution":{"observed_at":"2026-08-12T00:09:17.813259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T00:09:17.796652Z","title":"A Markovian Decision Process","venue":null,"work_id":"ffa2b136-90fa-43e4-9bc8-6d0328d22731","year":1957},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.379612Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:203bff1b21c0fea1a946b2c1aa37b27fbcaca8b9e10e06142a721aee6f6c134c","observation_id":"f0564aaf-61bf-4473-93de-42abbb609890","resolution":{"observed_at":"2026-08-12T00:09:17.800711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T00:09:17.384165Z","title":"Reinforcement learning for combinatorial optimization: A survey","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.384165Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:f04f9b46eff2dc1fe0bd987c44fce71d8aeb5a75417fcd93e73318a75b1fe369","observation_id":"8120860c-483e-4c14-883c-4afba3dd4d2e","resolution":{"observed_at":"2026-08-12T00:09:17.384165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.09940","last_updated":"2017-01-12T23:55:36Z","snapshot_observed_at":"2026-08-11T22:02:29.962183Z","submitted_at":"2016-11-29T23:22:39Z","title":"Neural Combinatorial Optimization with Reinforcement Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.09940","snapshot_observed_at":"2026-08-12T00:09:17.388761Z","title":"Neural combinatorial optimization with reinforcement learning","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.388761Z"},"links":{"cited_paper":"/paper/1611.09940","citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:da2bfb61b4a2b86d87565ac2e5fcda629305edf70133b8e6d1dc6c80c24938d7","observation_id":"61393451-d04d-4e2c-8a11-38f25518e81c","resolution":{"observed_at":"2026-08-12T00:09:17.388761Z","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-12T00:09:17.774254Z","title":"Reinforcement learning for solving the vehicle routing problem","venue":null,"work_id":"760d16cc-6a9a-4f7f-acf9-14f98040c427","year":2018},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.393573Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:eea75114e491a3db0915ec931ae0db19d70bd4f8dd9ac1bb1e024c166bc43284","observation_id":"243f20a0-91ba-44b4-ba78-3f5df31e05aa","resolution":{"observed_at":"2026-08-12T00:09:17.778712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T00:09:17.759590Z","title":"Exploratory combinatorial opti- mization with reinforcement learning","venue":null,"work_id":"6a64c3a1-8dc5-4a0b-8883-e457dc7c3939","year":2020},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.397617Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:5b1f3dcb1950aa521fdf5fe40f3850ec50dfd9b9ad92207736e0d591e20acda6","observation_id":"4b4d8f63-2e3b-4ee2-8022-265b5303fd24","resolution":{"observed_at":"2026-08-12T00:09:17.764925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T00:09:17.747328Z","title":"Combinatorial optimization with graph convolutional networks and guided tree search","venue":null,"work_id":"fc0dc814-68cb-4276-b3d2-32ee5db2b5d4","year":2018},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.401021Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:cb9a1be679f8c54814491eab57a6a3c064107c934492a504ccf54b9a00edd80c","observation_id":"0aa9809d-31b0-4442-8c40-7eb8bc6aa6d9","resolution":{"observed_at":"2026-08-12T00:09:17.751028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T00:09:17.735009Z","title":"Learning combinatorial optimization algorithms over graphs","venue":null,"work_id":"1fbb0dfe-7126-4d63-9ff3-58c8dd2a011f","year":2017},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.404465Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:acf428ad13e7bee173a77af14b7fef696829306377f79e9fea1bdce0b81efc03","observation_id":"299f2d56-efd4-4f96-a022-c34026239a73","resolution":{"observed_at":"2026-08-12T00:09:17.738997Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T00:09:17.723002Z","title":"Learning local search heuristics for boolean satisfiability","venue":null,"work_id":"c3619363-97fa-4fc5-9256-a3d9eb550551","year":2019},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.408345Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:28f8db4398b5f08572e916b00249bff81d407b865f0d86322412c5682d48ec71","observation_id":"123812c6-bfc8-4866-b32b-fe41e9dcc273","resolution":{"observed_at":"2026-08-12T00:09:17.726928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T00:09:17.710370Z","title":"Deep-pack: A vision-based 2d online bin packing algorithm with deep reinforcement learning","venue":null,"work_id":"e1d60623-71f0-4440-b870-7c4fe184cd17","year":2019},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.411692Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:51676f9b2bdde24c3876a4576b67360d5b799b7feb23cb73b6acf17f7faf1969","observation_id":"0f586ecf-39ce-4047-8050-2c8ca5ce69e9","resolution":{"observed_at":"2026-08-12T00:09:17.714694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.04333","last_updated":"2021-08-02T09:50:24Z","snapshot_observed_at":"2026-08-06T23:01:54.111230Z","submitted_at":"2021-07-09T10:00:30Z","title":"Attend2Pack: Bin Packing through Deep Reinforcement Learning with Attention","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.04333","snapshot_observed_at":"2026-08-12T00:09:17.415073Z","title":"Attend2pack: Bin packing through deep reinforcement learning with attention","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.415073Z"},"links":{"cited_paper":"/paper/2107.04333","citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:c729981f5133d17f12087173ae2916c0ea16d115088f3fd9aaca05b6ae2e8d07","observation_id":"74da2770-1174-48ef-83b2-0a95298d2418","resolution":{"observed_at":"2026-08-12T00:09:17.415073Z","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-12T00:09:17.697786Z","title":null,"venue":null,"work_id":"341fb6e6-794a-4ed8-ab09-2545a7e5a968","year":1992},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.419407Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:69ae675769eaafc1a17e0f0cc1b811f21802d2c0b84d61dd86cb2a527a0236b6","observation_id":"9a446e3f-2823-4084-8a8f-9b8e757af59e","resolution":{"observed_at":"2026-08-12T00:09:17.701400Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T00:09:17.685450Z","title":"aRNAque: an evolutionary algorithm for inverse pseudoknotted RNA folding inspired by L´ evy flights.BMC Bioinformatics , 23(1):335, 2022","venue":null,"work_id":"bf532b73-14d6-4187-ae83-f44189e69b26","year":2022},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.422898Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:826bcb53e1a7de4679410f0ee3e3b1a8359db913ab8385cb19952fe8fe52af63","observation_id":"91e32ce2-5f06-4c9f-88de-eeadc33d99ed","resolution":{"observed_at":"2026-08-12T00:09:17.689353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T00:09:17.672560Z","title":"A simple evolutionary algorithm guided by local mutations for an efficient rna design","venue":null,"work_id":"1cf7eae0-e48e-4783-8ccd-b5dae0809f30","year":2021},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.427229Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:3d5605e84cd5be33f705e273d643e6ff5508299d25a3994226724b3f80cedeb0","observation_id":"6446191e-b0ef-420a-8fc7-4ece76026c8f","resolution":{"observed_at":"2026-08-12T00:09:17.676883Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T00:09:17.659855Z","title":"Evolutionary solution for the RNA design problem","venue":null,"work_id":"7c0627fe-6fa7-4641-94ed-8fefca485e8f","year":2014},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.431240Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:0d25a3a9cc8feb5970e45f8e2aa73f86695fdb1fcdf9ab6138f1cf4c6d892c17","observation_id":"c93752e0-323f-4754-87fb-bede57f3bdee","resolution":{"observed_at":"2026-08-12T00:09:17.663802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T00:09:17.646539Z","title":"ERD: a fast and reliable tool for RNA design including constraints","venue":null,"work_id":"ae7790ac-564b-496c-a374-e4e018398295","year":2015},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.434757Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:7bf96b6a2e90f8e91d5899c1d85c7909ae1769e7bcc80c568e256e83950d0015","observation_id":"0b4388e5-d696-4573-b3e8-e2eb1ae80ab7","resolution":{"observed_at":"2026-08-12T00:09:17.651274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T00:09:17.633180Z","title":"RnaPredict—an evolutionary algorithm for RNA secondary structure prediction","venue":null,"work_id":"b949a00f-b906-48b0-a38e-78df1bf80baa","year":2008},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.438466Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:ab843436b204fe9503ee206b5a411ebc8524b9a850234bc4fb2a13cec8ba0d37","observation_id":"75e271d0-30c8-4f71-92f8-69c75ebf49ae","resolution":{"observed_at":"2026-08-12T00:09:17.637749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T00:09:17.620468Z","title":"An introduction to genetic algorithms","venue":null,"work_id":"8bd1f3d0-d407-4cfd-8aff-ec16024b5d2b","year":1998},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.442214Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:f6a68012689612be6382014ec1379c9e260e30f25b25664e9d149d31b4a59c55","observation_id":"4660c215-481b-4160-be87-b428695a9a0c","resolution":{"observed_at":"2026-08-12T00:09:17.624613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T00:09:17.607354Z","title":"An evolutionary algorithm for the vehicle routing problem with route balancing","venue":null,"work_id":"9e3b6b10-3f3f-4ce9-9f36-1ed2355a21cc","year":2009},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.445815Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:53b334b0940255b8242e8006fd9590137ea1f81a4791559b4469bfe59067fe2c","observation_id":"8560716b-778d-4d21-af66-ee35bf01bccb","resolution":{"observed_at":"2026-08-12T00:09:17.611561Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T00:09:17.593168Z","title":"A hybrid genetic algorithm for the vehicle routing problem with simultaneous pickup and delivery","venue":null,"work_id":"ee0adffe-21e0-424a-a1e9-08b491e11eb8","year":2009},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.449686Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:6a3d65f6130cbbd18824dd0b2aaf9dc57557e5e2204d325c4476b90b0db161c7","observation_id":"16cbb8ea-c80e-414a-884d-3ce81fb56f5f","resolution":{"observed_at":"2026-08-12T00:09:17.597488Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T00:09:17.579789Z","title":"Graph puzzles, homotopy, and the alternating group","venue":null,"work_id":"11b0b5d4-f34d-453b-99c3-6b4c6ff244dd","year":1974},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.453119Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:467a10bd49bfaef30ac4b22655c2f851d12117119762e73e626a5ccc55d91cb5","observation_id":"8d8a1af1-7267-4b98-b1a3-f55b2a88d8eb","resolution":{"observed_at":"2026-08-12T00:09:17.584600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T00:09:17.567426Z","title":"Artificial Intelligence: A Modern Approach (2nd ed.)","venue":null,"work_id":"f6c60ce8-9bad-4199-b6be-284e030aac60","year":2003},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.456654Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:df8a888bee30c750947214629ddf039cf625558b4f2738fab7625adde34cda04","observation_id":"aa5b858c-32f7-4d1b-8ad3-a43f170430a2","resolution":{"observed_at":"2026-08-12T00:09:17.571505Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T00:09:17.554781Z","title":"Reinforcement learning-assisted evolutionary algorithm: A survey and research opportunities","venue":null,"work_id":"8ea3fd1a-1c1d-4004-a33a-ada4472f5a46","year":2024},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.460014Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:a9811e25b53122c0d4e3486df9c133b874829c98c75447aca2e3245f98d37202","observation_id":"3e71e412-ff05-4d48-8c68-2032effb8c6d","resolution":{"observed_at":"2026-08-12T00:09:17.559029Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T00:09:17.872220Z","title":null,"venue":null,"work_id":"86e08ef5-a18f-4da0-bdfe-beeda2b0f851","year":2007},"citing_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"reference_index":703,"source":"pdf_text","source_observed_at":"2026-08-12T00:09:17.358329Z"},"links":{"citing_paper":"/paper/2412.01937"},"observation_digest":"sha256:a343216f9ae7041ce4e3325b08eb95c0a1898bbd7d12d1c6715b9f93c8a61808","observation_id":"e6be5e27-5b14-4dd0-ab78-2f1e13d1e1f6","resolution":{"observed_at":"2026-08-12T00:09:17.875918Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":1,"unresolved":5,"verified_exact":2,"verified_fuzzy":29},"total_outbound_references":38},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 1 inbound Pith citation observation for arXiv:2412.01937."}