{"as_of":"2026-08-18T20:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c2e1cb6dd96d71df939dd76c8303337b2060da89de9c0688b5802607ae7f5d8e","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T11:26:25.795231Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2605.28362/citation-record","integrity":"/paper/2605.28362/integrity","json":"/paper/2605.28362/citation-record.json","paper":"/paper/2605.28362"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T11:26:25.795231Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:16d120e904bc8747f32a65ccc93ceaa9b07c16e767cfff1cc63b73e5f58641ad","observation_id":"1a03d372-6969-407d-baf8-eddad1c769a9","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","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-06-29T11:26:25.795231Z","title":"Sampling-based robot motion planning: A review,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:ec3e07deb790e9272fab070584d4a3c30ed362d314448c430f8695bc6abb6de3","observation_id":"a9612f1d-e610-46a7-824b-c5f08a418f03","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","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-06-29T11:26:25.795231Z","title":"A formal basis for the heuristic determination of minimum cost paths,","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:6a1034fb33878db7653a31e9d609c93fb38aa2860a49f7f57869a0253b70cb5a","observation_id":"ef4d9d50-b9d0-48cb-9e32-11a2c5902b72","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","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-06-29T11:26:25.795231Z","title":"A note on two problems in connexion with graphs,","venue":null,"work_id":null,"year":1959},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:389cc106c415b7b50d9e732c819c12dd6700e44fb28b459dcf843cd4bbe868e6","observation_id":"6c6a482f-b1c0-4f7b-b64e-a6796e58e87d","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","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-06-29T11:26:25.795231Z","title":"Rapidly-exploring random trees : a new tool for path planning,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:8d2be56d1f32f0658d29d4a8aec27343ef80aa22369f50a86780969058d3a522","observation_id":"5fa63c30-2c8c-4557-b78a-a66ad402b2cb","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","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-06-29T11:26:25.795231Z","title":"Prob- abilistic roadmaps for path planning in high-dimensional configuration spaces,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:f6cccaa805f2fc99c0b089c29d27b2e6e97a05675e2236001890eeaf5df3a936","observation_id":"caa28997-dfdc-467e-ab15-d870124d6723","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","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-06-29T11:26:25.795231Z","title":"Chomp: Gradient optimization techniques for efficient motion planning,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:188b9ccd8e6155bcd87260acc8aaabeca5d153464f64d30b693fe7f2f5ddd7c1","observation_id":"1b4a7850-693c-490b-8374-c396d1fbd20c","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","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-06-29T11:26:25.795231Z","title":"Model predictive control: Theory and practice—a survey,","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:f9fe8e7964da2fbbe8bab67a7f2d4eba94770262632928f61d8c68a6ee9652f9","observation_id":"4abd7e3c-8fb2-47cc-b669-88dd8325bb30","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","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-06-29T11:26:25.795231Z","title":"Neural rrt*: Learning-based optimal path planning,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:20e65f29d733ede4f00288397c229368f11431edc7e7e7648eb42372072286ad","observation_id":"72d7d777-e4e6-41ff-af63-46fbe5522905","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","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-06-29T11:26:25.795231Z","title":"Path planning using neural a* search,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:faad999faa2f7a6225473444bf2ee80de16eb593c2875eb5847dedb8407414a5","observation_id":"c83b6103-321e-4e9d-b5d9-e3e3422fbaf8","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","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-06-29T11:26:25.795231Z","title":"Motion planning networks,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:f000cf56234e953ead780627f0c1dee58523453033bdd353bfe8e97f0e68f3dc","observation_id":"e6bb4238-0f01-4f02-b881-ce1202ee9ba8","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","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-06-29T11:26:25.795231Z","title":"A survey on deep learning for robot navigation,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:236cb8c0370abd1221be33643e01362364116bc41babc6e5e47c77488acbe946","observation_id":"58842994-a6bf-4947-9db6-2d5c3d358501","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","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-06-29T11:26:25.795231Z","title":"Motion planning transformers: One model to plan them all,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:7bbcd539474f6740351ad7498323c54a565aa13b0faf10c7cb4a28bc5ee45939","observation_id":"d247682b-63e0-4dbb-bf49-ae7b8e87d718","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","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-06-29T11:26:25.795231Z","title":"Attention is all you need,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:c7b1a2543ac5d096b8ea88886d386dd0821772abded4baa1f804d5f06825e429","observation_id":"42c66bc9-c092-4b77-b55d-5a9e1dcf4f03","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","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-06-29T11:26:25.795231Z","title":"U-net: Convolutional networks for biomedical image segmentation,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:313205da6c78d3d903f39552de0252304648d9a5607241e0bef49dcc883e8970","observation_id":"3d48eef4-86a7-4147-982e-c760b26659df","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","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-06-29T11:26:25.795231Z","title":"Vision transformer with deformable attention,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:408599d4874f138521ec1c4460aa2a529db33e151236edc2a555730c2de0cbd2","observation_id":"e94ea90e-469b-4444-96f5-4a33a51e3bdf","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","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-06-29T11:26:25.795231Z","title":"Learning deconvolution network for semantic segmentation,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:d8686cd5d7c8d3e50dc1c8e463980f787e6ce938d6f5ea4f8747d42f94478f73","observation_id":"0000b47e-4b04-43b6-8fab-bb6dcefed811","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","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-06-29T11:26:25.795231Z","title":"Sensor based motion planning: the hierarchical generalized voronoi graph,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:29e8bd1e7b5cecc40739d3f5d48eca95fb98c75a3b22a8d2571bda5632a53c3b","observation_id":"0456802f-d931-414e-b6cc-99398d7ea98d","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","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-06-29T11:26:25.795231Z","title":"Computational topology: An introduc- tion,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:a66182d8a08afdf043f5de66d488fbaf2f98eaa09679746b558bca405dca5074","observation_id":"e8d2d402-7212-4035-80ad-e9917961b8bb","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","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-06-29T11:26:25.795231Z","title":"Dynamic snake convo- lution based on topological geometric constraints for tubular structure segmentation,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:01b37c6bb6e95f7bb6757a76f1111f50f9ecba43007d1019eec1c12982c72588","observation_id":"18450ded-b375-4957-83e3-6b23083f2275","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.05404","last_updated":"2019-06-12T22:12:44Z","snapshot_observed_at":"2026-08-14T16:16:29.303433Z","submitted_at":"2019-06-12T22:12:44Z","title":"Topology-Preserving Deep Image Segmentation","version":1},"cited_work":{"arxiv_id":"1906.05404","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.05404","snapshot_observed_at":"2026-06-29T13:03:26.948326Z","title":"Topology-Preserving Deep Image Segmentation","venue":"cs.CV","work_id":"3462520a-fd11-49df-b3c8-c0cf87d02ee8","year":2019},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"cited_paper":"/paper/1906.05404","citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:6ad4cb3cb864c2d2a7c007e5594109d4f4ec189edc8e4f952ff1dc236125a225","observation_id":"4bbc7eba-3643-432a-be27-3371e83806f6","resolution":{"observed_at":"2026-06-29T13:03:26.949575Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T11:26:25.795231Z","title":"Sampling-based algorithms for optimal motion planning,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:2d41aa2b8d02e435afc4438aedddad58f58bf15776e80cd2f6a6c01101e4c537","observation_id":"52e304f8-da1a-4e46-9c66-46db4bbdece4","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","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-06-29T11:26:25.795231Z","title":"Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:165b7f9c67724963e45029eb14f50171ed225d52f6a932c5f6b2bd42bde04efe","observation_id":"9d2a9365-fb68-4138-846b-e6491917388f","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","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-06-29T11:26:25.795231Z","title":"Learning sampling distributions for robot motion planning,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:f968c348d90c54516fc9c1fe786397fa82e20278aa6ebfa7010c284181de4c9b","observation_id":"33df4820-a046-4dcf-ad16-3db70fa24d62","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","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-06-29T11:26:25.795231Z","title":"Fully convolutional networks for semantic segmentation,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:258ac1825e53e1efba7d613d48f34f2af7088b2a4ebafbb6cf878ecd689477f8","observation_id":"9b1dcb80-2763-4aa1-83cb-ef7803630b68","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.11929","last_updated":"2021-06-03T13:08:56Z","snapshot_observed_at":"2026-08-16T09:25:53.087782Z","submitted_at":"2020-10-22T17:55:59Z","title":"An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale","version":2},"cited_work":{"arxiv_id":"2010.11929","doi":"10.1175/jcli-d-22-0357.1","metadata_source":"pith","pith_arxiv_id":"2010.11929","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale","venue":"cs.CV","work_id":"e96730e3-129b-4db6-b981-15ab7932e297","year":2020},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"cited_paper":"/paper/2010.11929","citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:c28755a34e03efb057d8f65118fbe414f4b2f29cacf35080de94349feb8f54c7","observation_id":"799e4c34-c863-465e-b699-b0287da380c8","resolution":{"observed_at":"2026-06-29T13:03:26.943668Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T11:26:25.795231Z","title":"Swin transformer: Hierarchical vision transformer using shifted win- dows,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:94a90b538c46bbca463d869b43f524959f0e14333980f395a55711eba000a9e3","observation_id":"7d682857-a6de-4d8c-b3b9-974030ae6580","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","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-06-29T11:26:25.795231Z","title":"Segformer: Simple and efficient design for semantic segmentation with transformers,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:67cf64c4db34e5b8d63605f2cc8900d09a23ae8bb30817c777e40389c4bd51b8","observation_id":"fbd51785-1d5e-4018-b6b6-4d73b2cd31d9","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","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-06-29T11:26:25.795231Z","title":"The perceptron: a probabilistic model for information storage and organization in the brain","venue":null,"work_id":null,"year":1958},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:e4bec1979888da7e8e04e57d17cb8fdcb89c79032c5457c771f9052617b68afb","observation_id":"b11c3cb1-dabc-4ef6-ad8f-ba1647d11eb5","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","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-06-29T11:26:25.795231Z","title":"V-net: Fully convolutional neural networks for volumetric medical image segmentation,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:a015e0bff3e15c9ddf0e02f81cd13a2b9b383370d88b753bafdfd2a4e602c168","observation_id":"fb02cf69-a5c6-475f-b1a5-fba617f49749","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.00243","last_updated":"2017-07-14T18:52:26Z","snapshot_observed_at":"2026-08-16T06:51:02.949740Z","submitted_at":"2017-07-02T05:53:49Z","title":"Deep GrabCut for Object Selection","version":2},"cited_work":{"arxiv_id":"1707.00243","doi":null,"metadata_source":"pith","pith_arxiv_id":"1707.00243","snapshot_observed_at":"2026-06-29T13:03:26.944891Z","title":"Deep GrabCut for Object Selection","venue":"cs.CV","work_id":"e341bddb-1b51-4090-b2ed-51e8924f4964","year":2017},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"cited_paper":"/paper/1707.00243","citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:13522fb66733e7452d6b3aa0ff3d0fa4b0537948c0b812e9eddf075deb69a3a2","observation_id":"53aa38c9-441f-4779-ae81-70452d761dc2","resolution":{"observed_at":"2026-06-29T13:03:26.946090Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T11:26:25.795231Z","title":"Beyond the pixel-wise loss for topology-aware delineation,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:9f9f93fcc2ec327603b9c91751404afe4963f1442c828342f4a81cd45a962576","observation_id":"f42c80b5-17a1-49cd-a8de-3b5ec64d4877","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","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-06-29T11:26:25.795231Z","title":"Goodfellow, Y","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:474e36763ec14eb75b24f91ab1fb1dc0298953907e81827b8739206fae630405","observation_id":"c0db74b4-1dc5-409c-a02d-b995599b79bc","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-17T19:26:44.032537Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":"1412.6980","doi":"10.1002/mrm.28086","metadata_source":"pith","pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Adam: A Method for Stochastic Optimization","venue":"cs.LG","work_id":"1910796d-9b52-4683-bf5c-de9632c1028b","year":2014},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:fa2a8547e568d60960744297b17ea05f412e10ef8ff0878ef216d1d9dc715313","observation_id":"b82aef9b-6ffc-455a-8d8e-2799898aff28","resolution":{"observed_at":"2026-06-29T13:03:26.952013Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T11:26:25.795231Z","title":"Decoupled weight decay regularization,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-29T11:26:25.795231Z"},"links":{"citing_paper":"/paper/2605.28362"},"observation_digest":"sha256:31c8755be2f25e2ddef49fd299abdc5a5f2e96fe4011fc24cf0525c3425cc02d","observation_id":"40c6c5d8-202f-470b-a60e-92d275f36686","resolution":{"observed_at":"2026-06-29T11:26:25.795231Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.28362","last_updated":"2026-05-27T11:59:03Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-18T20:00:22.721625Z","submitted_at":"2026-05-27T11:59:03Z","title":"Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":31,"verified_exact":4,"verified_fuzzy":0},"total_outbound_references":35},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 0 inbound Pith citation observations for arXiv:2605.28362."}