{"as_of":"2026-08-08T10:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1bdc2565cfbc355aa1b7b8677f65c87b209d5dad174fa0ca10a2f9dd16fd5316","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:14:26.321548Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2506.00285/citation-record","integrity":"/paper/2506.00285/integrity","json":"/paper/2506.00285/citation-record.json","paper":"/paper/2506.00285"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:14:22.768605Z","title":"G.; Bradtke, S","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:22.768605Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:a8821d9f1255aa91fb74a2116dbcf4b4df5bf2bca2fdaadcc7377b71ec319038","observation_id":"5e1c6c2e-320a-4afa-905a-1726adef76c5","resolution":{"observed_at":"2026-08-07T12:14:22.768605Z","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-07T12:14:32.796510Z","title":null,"venue":null,"work_id":"2b589689-527d-405b-8b94-b01bfc128624","year":2012},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:22.880802Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:adc2ff39b1369abf475c6588ad9c97b388c4017b0964071613b14f36180f1c81","observation_id":"246422c2-19be-4c43-bc2a-0fc619408960","resolution":{"observed_at":"2026-08-07T12:14:32.920714Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:14:32.577336Z","title":null,"venue":null,"work_id":"93fa3b5e-1a9c-4f12-8d9e-f370430235e2","year":2021},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:23.000754Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:6227f3d3d99d7cb4b1f048856004cb05fa2c0a87a42b28fd8849cfbdc705b05d","observation_id":"27c9cf5f-f5a6-403e-90d4-4750a51f022f","resolution":{"observed_at":"2026-08-07T12:14:32.683438Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:14:32.272055Z","title":null,"venue":null,"work_id":"8d6b089d-68be-46ba-910c-61ed71fe3d33","year":2009},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:23.120260Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:2b007959f6e72c3069337f3ff116a01507cb006286e8d7dcbf4131daeb975fd4","observation_id":"106065ed-8cb2-4714-bce5-d59ec6c9324c","resolution":{"observed_at":"2026-08-07T12:14:32.392629Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:14:31.988619Z","title":null,"venue":null,"work_id":"fbd45de7-b624-4c01-87f4-d7eec3bcdc00","year":2014},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:23.213034Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:801b45d1db930de83b632f1c89acb0ed6e211f41d6cd13487bd728d61e5d7095","observation_id":"333d1fcb-6a56-4266-aa13-49415396ce8c","resolution":{"observed_at":"2026-08-07T12:14:32.129937Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:14:31.762525Z","title":null,"venue":null,"work_id":"0b079f37-54c4-49e4-b7e2-00d3828804ad","year":2015},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:23.289220Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:719a1b75c95ab415125279b96634e4d03392d031dd42fe4b3500c6caca92cd1b","observation_id":"33042af0-51e8-4e91-b248-2caa46473074","resolution":{"observed_at":"2026-08-07T12:14:31.870849Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:14:31.529259Z","title":null,"venue":null,"work_id":"6a455c10-122e-4e42-8153-30b0201723f1","year":2016},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:23.373881Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:2544382be76eedd6fe271ebabd080511d1c792ad9af00763aa513c80b4108c14","observation_id":"2ffebbf5-8bcc-4f7d-812d-a8edaf830f19","resolution":{"observed_at":"2026-08-07T12:14:31.628219Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:14:31.268851Z","title":"A.; and Zilberstein, S","venue":null,"work_id":"3b25a53c-8239-41e3-84ca-a37188e3c2a6","year":2001},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:23.452696Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:7261fe87c1afec9f748d186d68b4940729f518b31b3daecae2c72db2c577ba03","observation_id":"f0e838ef-07a0-4d37-9825-9b153aea8fe3","resolution":{"observed_at":"2026-08-07T12:14:31.379146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:14:31.027315Z","title":null,"venue":null,"work_id":"1285fd29-8895-4793-80ad-ad86dc67302b","year":2000},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:23.547891Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:4a4843d0adb5c244ab11f6970d60c32e81880f9db050c586c5a1d52204fa2473","observation_id":"8713c565-7e37-4dc6-8846-95a06d3a99ad","resolution":{"observed_at":"2026-08-07T12:14:31.153951Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:14:23.615383Z","title":"P.; Littman, M","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:23.615383Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:06449b9ce03231b3e6fee49e605dbe678421a6c72e108b9c0d67bce5833acead","observation_id":"645e4a7e-c5cf-4dc4-99b4-b0950e808a82","resolution":{"observed_at":"2026-08-07T12:14:23.615383Z","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-07T12:14:30.756503Z","title":null,"venue":null,"work_id":"d1e7746f-550b-44e5-963e-066fbed4b7f8","year":2019},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:23.701591Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:3391edef4ff20cc192a31204a97aea863230858dedc55396d67a96ee6e3e7681","observation_id":"26dd9602-79c9-4c73-8df0-cf152aa86489","resolution":{"observed_at":"2026-08-07T12:14:30.864440Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:14:30.605073Z","title":null,"venue":null,"work_id":"7d0a065f-f3d3-40a3-a981-da76f6d66ba9","year":2008},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:23.788557Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:671a05992f54ddd99c8fde06d7c22835b668008614d4da20d59da1d20d060e53","observation_id":"24c633d1-ffd1-4f8f-9e4f-87502d0d1a18","resolution":{"observed_at":"2026-08-07T12:14:30.678674Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:14:30.432226Z","title":null,"venue":null,"work_id":"797093b7-6a9a-4d4b-ae1f-b01daf79372f","year":2016},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:23.911158Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:9deec3c87955a73022131014804fa2a77c38090981763d6ba7ad09445b9f3345","observation_id":"44c3902d-7c72-4bf2-855e-0491bbb26b8f","resolution":{"observed_at":"2026-08-07T12:14:30.533155Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:14:30.171849Z","title":null,"venue":null,"work_id":"8cb84bee-e16e-4305-b904-ea643e7920af","year":2018},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:24.033490Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:183eebf64335f626465f7a4adf2037ef1ffd89f1d05fff433628dab6b8c21cd1","observation_id":"c73a8a0d-1e58-486b-b93c-8e8c1619f531","resolution":{"observed_at":"2026-08-07T12:14:30.282993Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:14:29.860252Z","title":null,"venue":null,"work_id":"3d037ed9-2509-4ca8-bcf5-28c3776d94d4","year":2019},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:24.145516Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:8db019761e6a277aae1db7e2910ac8853599cebcdd9bec122fff527e1f7a9118","observation_id":"c7c23d47-e8ac-470e-b972-833fad7cc120","resolution":{"observed_at":"2026-08-07T12:14:29.976735Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:14:29.510914Z","title":null,"venue":null,"work_id":"681a5c36-823c-4aa7-9514-c3ad98ca1e35","year":2018},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:24.289191Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:4eca60d042d8bf87ff49d89a6154fae35ca6ef798adafbfc741a63eee303fd63","observation_id":"49328c70-4a17-47f1-aa0e-e8e082f76ff7","resolution":{"observed_at":"2026-08-07T12:14:29.678409Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:14:29.244100Z","title":null,"venue":null,"work_id":"8bde19ef-81bc-4868-97d6-f7b1cedc9b47","year":2014},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:24.338202Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:c4d685731f7663c74c864d4567acf26d908bb74bf83d5adbe8b18f18ba429fa0","observation_id":"a2147394-128d-4161-a840-561066ec364a","resolution":{"observed_at":"2026-08-07T12:14:29.347895Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:14:29.045394Z","title":null,"venue":null,"work_id":"6aa1c066-7213-4b24-bb87-9dec85da842e","year":2017},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:24.421880Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:690266cab5293615067e5fe53e6067c089db754f0f393b20cdbb2ddf64a50d05","observation_id":"e8a32059-1ad1-478f-b45a-414c6279fa85","resolution":{"observed_at":"2026-08-07T12:14:29.141404Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:14:24.508645Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:24.508645Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:f347a6b3ceeb2989dd192820a21ab78f465d28917812dd43764f3a47aefbec70","observation_id":"eca8200d-54cd-40c9-a9f3-b7f06725830e","resolution":{"observed_at":"2026-08-07T12:14:24.508645Z","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-07T12:14:28.764551Z","title":null,"venue":null,"work_id":"b1d9315f-2601-40e4-b633-a05718c92b11","year":2007},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:24.574349Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:e767846b6453f88e7d6c3a745f3dab29a651cd72f1b334d4850fcae6445a200e","observation_id":"894bc704-97f3-4453-8f76-15be85cf65a2","resolution":{"observed_at":"2026-08-07T12:14:28.868420Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:14:28.461205Z","title":"S.; Veerapaneni, R.; and Likhachev, M","venue":null,"work_id":"b6590527-2406-439e-b80d-7a005b12175e","year":2023},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:24.664165Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:d42fef9721269cf67d68107102daec72376c6b33e020c18f0728e94425cc2ea2","observation_id":"1084f22c-087a-4910-82b3-c763a866db53","resolution":{"observed_at":"2026-08-07T12:14:28.600474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.18775","last_updated":"2024-09-27T14:17:55Z","snapshot_observed_at":"2026-07-06T19:23:24.241057Z","submitted_at":"2024-09-27T14:17:55Z","title":"A POMDP-based hierarchical planning framework for manipulation under pose uncertainty","version":1},"cited_work":{"arxiv_id":"2409.18775","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.18775","snapshot_observed_at":"2026-08-07T12:14:26.511051Z","title":"A POMDP-based hierarchical planning framework for manipulation under pose uncertainty","venue":"cs.RO","work_id":"33a47779-2fcf-4014-89dc-ce8c1e7dd33e","year":2024},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:24.782693Z"},"links":{"cited_paper":"/paper/2409.18775","citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:9a5f3fc6de3f6ed04101aa3270492183742bd8bd98c40cd549310c35e74ab4d4","observation_id":"e997bfe5-6d5f-49e5-9149-a37e897bf74c","resolution":{"observed_at":"2026-08-07T12:14:26.584926Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:14:28.200134Z","title":null,"venue":null,"work_id":"e8588ebf-60aa-4660-8d18-c7d2d83c82af","year":1973},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:24.836260Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:4b5a62ad6cbb7dd807ce10e1db41e0279f03de783a18dcc9b4f657e6eca06743","observation_id":"ff8405cd-4fd9-499b-8ae5-c5dd92ae70b1","resolution":{"observed_at":"2026-08-07T12:14:28.277259Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:14:28.025664Z","title":null,"venue":null,"work_id":"fc4ded07-dbd1-4200-8af8-9c2cebfe59b7","year":2013},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:24.956028Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:e7189842f2dbba9117e6aeaad530ee7a5ddd473cde04ee1e4818e2c5d22658a9","observation_id":"c9b18b56-7c1d-439c-9682-f9134211dca4","resolution":{"observed_at":"2026-08-07T12:14:28.092453Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:14:25.078221Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:25.078221Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:c7b9f3ba4da99edfdab095b81b2e695775e0a8c0b72bbf8d5d3ee114a45dc37b","observation_id":"5a4aa449-13a8-41c9-ac9b-7e60eb677081","resolution":{"observed_at":"2026-08-07T12:14:25.078221Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1207.4166","last_updated":"2012-07-11T15:04:47Z","snapshot_observed_at":"2026-08-04T22:09:41.972943Z","submitted_at":"2012-07-11T15:04:47Z","title":"Heuristic Search Value Iteration for POMDPs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1207.4166","snapshot_observed_at":"2026-08-07T12:14:25.139264Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:25.139264Z"},"links":{"cited_paper":"/paper/1207.4166","citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:e535192726461bc26317db50b8d56d751772dd93c6fef22b2c58a72b6bf6ac48","observation_id":"b87920d4-736e-4779-ae81-3c70ca3b3e1a","resolution":{"observed_at":"2026-08-07T12:14:25.139264Z","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-07T12:14:27.825338Z","title":null,"venue":null,"work_id":"22e8277b-3f5f-4243-a150-820680c95537","year":2013},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:25.241104Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:5ca1a4ebaf7504e6fafbba4aba491bbd7b948ba17e3a2fc3a30e1f5f2acf9614","observation_id":"b1e671b7-7d0f-45ea-b000-9a06131f90d7","resolution":{"observed_at":"2026-08-07T12:14:27.901688Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:14:27.625098Z","title":null,"venue":null,"work_id":"c2b77893-5b77-42a2-a01b-7a8a22cc5475","year":2008},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:25.424154Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:913efda492f12fff8f43c2dad14ca7b8012eda825764530d2cc73fb8ab7b81c9","observation_id":"99c5dead-4370-475b-8b75-b9010de7e3f9","resolution":{"observed_at":"2026-08-07T12:14:27.735744Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:14:27.385364Z","title":null,"venue":null,"work_id":"9a43a0a9-cb05-415a-9281-de32b0c34ce7","year":2019},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:25.599949Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:0cdbc72814b061df2abb7948423ffb99d60681d2d15f10a06b21c273aa8be557","observation_id":"f7624b85-84b2-4a81-b1e9-178b79675746","resolution":{"observed_at":"2026-08-07T12:14:27.470496Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:14:27.144995Z","title":"S.; and Likhachev, M","venue":null,"work_id":"d8783538-3698-485d-949c-d40b52a45b4e","year":2023},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:25.769684Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:aac733b20d7d74e30ffc28e221cfe3d3cf991ad6b7c02631ae0f22e663d3f4ce","observation_id":"f7de913b-b149-4d0d-b0d9-2e05ece95d4d","resolution":{"observed_at":"2026-08-07T12:14:27.261201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:14:26.875127Z","title":null,"venue":null,"work_id":"86dc4f78-11e6-4538-873c-6a302e169d53","year":2010},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:25.885520Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:a2b8cb83a28c8310ec4faec86b9e2438ec46120323c05a670a21aacce005397b","observation_id":"13e866e9-f7ec-4099-b21f-e5afd541ca66","resolution":{"observed_at":"2026-08-07T12:14:27.010090Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:14:26.676773Z","title":null,"venue":null,"work_id":"902e0cad-9cf9-4d2c-8aa3-861cf88fb955","year":1997},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:26.083500Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:0fc780f457bcecd75b189cbaf24a0bcd6425359e09cb04589e4c371df000cc90","observation_id":"b3cfe94f-60c5-43e5-8b83-30b0ee8832af","resolution":{"observed_at":"2026-08-07T12:14:26.748532Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:14:26.223747Z","title":", \" * write output.state after.block = add.period write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:26.223747Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:2a4dda9cb797d7f3e5d94b1cf9c703e2abba160f92c0ee29bf639bdc12e738bc","observation_id":"21da16dd-ed80-43b9-b442-62f48741829b","resolution":{"observed_at":"2026-08-07T12:14:26.223747Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:14:26.321548Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:26.321548Z"},"links":{"citing_paper":"/paper/2506.00285"},"observation_digest":"sha256:97165800053bef141851d1839f5efeee3b0460e509f1809f857cbdf787109d0d","observation_id":"3753746c-f5e5-42e8-adc7-b157f06e5a30","resolution":{"observed_at":"2026-08-07T12:14:26.321548Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.00285","last_updated":"2025-05-30T22:26:26Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-07T12:06:08.598991Z","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":30,"verified_exact":0,"verified_fuzzy":3},"total_outbound_references":34},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:2506.00285."}