{"as_of":"2026-08-08T08:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f481b8ef00b9dbe57a2ec03725ff220cbb8a621358564837b3bd8ae9170b3174","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T06:05:28.782823Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"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.06028/citation-record","integrity":"/paper/2506.06028/integrity","json":"/paper/2506.06028/citation-record.json","paper":"/paper/2506.06028"},"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-07T06:05:30.813999Z","title":"Coverage for robotics – a survey of recent results,","venue":null,"work_id":"e8135fea-2c05-4ba6-908b-f2fbd4189f6d","year":2001},"citing_paper":{"arxiv_id":"2506.06028","last_updated":"2025-06-06T12:20:45Z","snapshot_observed_at":"2026-08-07T05:59:33.673790Z","submitted_at":"2025-06-06T12:20:45Z","title":"End-to-End Framework for Robot Lawnmower Coverage Path Planning using Cellular Decomposition","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T06:05:26.720355Z"},"links":{"citing_paper":"/paper/2506.06028"},"observation_digest":"sha256:cb51a3b4e84fcc9d7f7672b00b4145698a9271f96ed49cc975a939ae44a2f94b","observation_id":"fd0b9657-bae3-48cb-8098-399e7087f3a8","resolution":{"observed_at":"2026-08-07T06:05:30.815950Z","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-07T06:05:30.807879Z","title":"A survey on coverage path planning for robotics,","venue":null,"work_id":"dbaab605-1123-419e-bd8c-957d371f0adf","year":2013},"citing_paper":{"arxiv_id":"2506.06028","last_updated":"2025-06-06T12:20:45Z","snapshot_observed_at":"2026-08-07T05:59:33.673790Z","submitted_at":"2025-06-06T12:20:45Z","title":"End-to-End Framework for Robot Lawnmower Coverage Path Planning using Cellular Decomposition","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T06:05:26.771991Z"},"links":{"citing_paper":"/paper/2506.06028"},"observation_digest":"sha256:124b97066e60a46a4e7e87b4a14e5eec914bf9924d9de47ca0f667c3c6e7f83f","observation_id":"2e608df7-c375-4454-9a88-292af69c5d5c","resolution":{"observed_at":"2026-08-07T06:05:30.809894Z","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-07T06:05:30.802205Z","title":"Coverage path planning: The boustrophedon cellular decomposition,","venue":null,"work_id":"5eb586f1-dc16-4462-afd4-8a292f46c251","year":1998},"citing_paper":{"arxiv_id":"2506.06028","last_updated":"2025-06-06T12:20:45Z","snapshot_observed_at":"2026-08-07T05:59:33.673790Z","submitted_at":"2025-06-06T12:20:45Z","title":"End-to-End Framework for Robot Lawnmower Coverage Path Planning using Cellular Decomposition","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T06:05:26.839958Z"},"links":{"citing_paper":"/paper/2506.06028"},"observation_digest":"sha256:c4101552bf8af9ee5aa9feaaf5b849bac11d2c392f24ca183f561c21fd243a9e","observation_id":"2a793063-1ba9-4ee6-aaf7-910d9e095b7e","resolution":{"observed_at":"2026-08-07T06:05:30.804325Z","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-07T06:05:30.796272Z","title":"Planning paths of complete coverage of an unstructured environment by a mobile robot,","venue":null,"work_id":"64cc6dc4-3906-4c4b-9f64-ccf0daadbf66","year":2007},"citing_paper":{"arxiv_id":"2506.06028","last_updated":"2025-06-06T12:20:45Z","snapshot_observed_at":"2026-08-07T05:59:33.673790Z","submitted_at":"2025-06-06T12:20:45Z","title":"End-to-End Framework for Robot Lawnmower Coverage Path Planning using Cellular Decomposition","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T06:05:26.906560Z"},"links":{"citing_paper":"/paper/2506.06028"},"observation_digest":"sha256:362db3f2d14f3ca79fdc650d3b2917a1d6ee666f081cf1e685f3a0a9f72e830e","observation_id":"50ce7ce8-b72b-4c21-999a-79bb094b25b0","resolution":{"observed_at":"2026-08-07T06:05:30.798389Z","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-07T06:05:30.790447Z","title":"A solution to vicinity problem of obstacles in complete coverage path planning,","venue":null,"work_id":"658a075a-54ac-4bdb-82dc-e15388fcad83","year":2002},"citing_paper":{"arxiv_id":"2506.06028","last_updated":"2025-06-06T12:20:45Z","snapshot_observed_at":"2026-08-07T05:59:33.673790Z","submitted_at":"2025-06-06T12:20:45Z","title":"End-to-End Framework for Robot Lawnmower Coverage Path Planning using Cellular Decomposition","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T06:05:26.975988Z"},"links":{"citing_paper":"/paper/2506.06028"},"observation_digest":"sha256:969ec2e5336d853c92e7aad7075d06df01cc03bf1cbf7fa366c4ff09dcf6d83b","observation_id":"a324b8d2-252b-490b-ae94-78badd12f697","resolution":{"observed_at":"2026-08-07T06:05:30.792483Z","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-07T06:05:30.785033Z","title":"Robotic mowing of tall fescue at 90 mm cutting height: Random trajectories vs. systematic trajectories,","venue":null,"work_id":"c98083bb-a45d-47eb-835a-134f1bd1614a","year":2021},"citing_paper":{"arxiv_id":"2506.06028","last_updated":"2025-06-06T12:20:45Z","snapshot_observed_at":"2026-08-07T05:59:33.673790Z","submitted_at":"2025-06-06T12:20:45Z","title":"End-to-End Framework for Robot Lawnmower Coverage Path Planning using Cellular Decomposition","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T06:05:27.041593Z"},"links":{"citing_paper":"/paper/2506.06028"},"observation_digest":"sha256:b5468e727479c991e28fed61da3c2e1375369b332a3895dd00cff46bf7930cd7","observation_id":"0c6194fa-4ac9-4995-b7a7-a997a1c8321e","resolution":{"observed_at":"2026-08-07T06:05:30.787174Z","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-07T06:05:30.779105Z","title":"Ub-anc plan- ner: Energy efficient coverage path planning with multiple drones,","venue":null,"work_id":"96c62463-e2e1-4af2-b820-cde35f0dfef5","year":2017},"citing_paper":{"arxiv_id":"2506.06028","last_updated":"2025-06-06T12:20:45Z","snapshot_observed_at":"2026-08-07T05:59:33.673790Z","submitted_at":"2025-06-06T12:20:45Z","title":"End-to-End Framework for Robot Lawnmower Coverage Path Planning using Cellular Decomposition","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T06:05:27.123559Z"},"links":{"citing_paper":"/paper/2506.06028"},"observation_digest":"sha256:0b825d1be19093d97ce1e531e7eb3cbc9a5966a8cb60d01c007306e818d1825f","observation_id":"bc8de887-1949-4803-afe6-5d89d5913c3b","resolution":{"observed_at":"2026-08-07T06:05:30.781318Z","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-07T06:05:30.773244Z","title":"Coverage path planning for decomposition reconfig- urable grid-maps using deep reinforcement learning based travelling salesman problem,","venue":null,"work_id":"cc82af1d-275f-4e67-aec7-dedf91b03673","year":2020},"citing_paper":{"arxiv_id":"2506.06028","last_updated":"2025-06-06T12:20:45Z","snapshot_observed_at":"2026-08-07T05:59:33.673790Z","submitted_at":"2025-06-06T12:20:45Z","title":"End-to-End Framework for Robot Lawnmower Coverage Path Planning using Cellular Decomposition","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T06:05:27.219817Z"},"links":{"citing_paper":"/paper/2506.06028"},"observation_digest":"sha256:27259a83429edcf091248fa26d54085b7e8270e7a3a8e1f999afaae88f487c96","observation_id":"942f7bed-0b75-4895-8a3f-7db9ef306f01","resolution":{"observed_at":"2026-08-07T06:05:30.775402Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:05:27.317299Z","title":"Approximation algorithms for the geometric covering salesman problem,","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2506.06028","last_updated":"2025-06-06T12:20:45Z","snapshot_observed_at":"2026-08-07T05:59:33.673790Z","submitted_at":"2025-06-06T12:20:45Z","title":"End-to-End Framework for Robot Lawnmower Coverage Path Planning using Cellular Decomposition","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T06:05:27.317299Z"},"links":{"citing_paper":"/paper/2506.06028"},"observation_digest":"sha256:e7c746640fc10b12a2e78d8af073ab972a4b6d8564cabfc406abf2462a88a0af","observation_id":"e74f8c30-d2d8-4014-ba1d-60dc0a6d2c5b","resolution":{"observed_at":"2026-08-07T06:05:27.317299Z","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-07T06:05:30.766835Z","title":"Spanning-tree based coverage of contin- uous areas by a mobile robot,","venue":null,"work_id":"519df69b-5c42-4e78-9f68-6f8b0125c7e3","year":2001},"citing_paper":{"arxiv_id":"2506.06028","last_updated":"2025-06-06T12:20:45Z","snapshot_observed_at":"2026-08-07T05:59:33.673790Z","submitted_at":"2025-06-06T12:20:45Z","title":"End-to-End Framework for Robot Lawnmower Coverage Path Planning using Cellular Decomposition","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T06:05:27.426100Z"},"links":{"citing_paper":"/paper/2506.06028"},"observation_digest":"sha256:4c27ba17572260223c02b9718320b5a56c0ae3dc0b7e59f4c4d54aad752cf9ae","observation_id":"03eced4b-7471-410b-bb5a-5e0cea6a9b3f","resolution":{"observed_at":"2026-08-07T06:05:30.769354Z","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-07T06:05:30.760547Z","title":"Discrete cuckoo search algorithm for the travelling salesman problem,","venue":null,"work_id":"ffbe6180-c863-4818-ae9c-bcc20614904a","year":2014},"citing_paper":{"arxiv_id":"2506.06028","last_updated":"2025-06-06T12:20:45Z","snapshot_observed_at":"2026-08-07T05:59:33.673790Z","submitted_at":"2025-06-06T12:20:45Z","title":"End-to-End Framework for Robot Lawnmower Coverage Path Planning using Cellular Decomposition","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T06:05:27.570501Z"},"links":{"citing_paper":"/paper/2506.06028"},"observation_digest":"sha256:1cda01b64da817957b7e86d1e7b80a3089de61b8e9bff4ab082ddf7cf6aa7482","observation_id":"f56688c3-c774-43e5-ba26-fa795a4c643f","resolution":{"observed_at":"2026-08-07T06:05:30.762894Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:05:27.607086Z","title":"Approximation algorithms for lawn mowing and milling,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2506.06028","last_updated":"2025-06-06T12:20:45Z","snapshot_observed_at":"2026-08-07T05:59:33.673790Z","submitted_at":"2025-06-06T12:20:45Z","title":"End-to-End Framework for Robot Lawnmower Coverage Path Planning using Cellular Decomposition","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T06:05:27.607086Z"},"links":{"citing_paper":"/paper/2506.06028"},"observation_digest":"sha256:1e67dd2162eb03d92864e47a0aa166619aaa79b5f0d9c9e4f3863e3769124059","observation_id":"f46b4c8d-04c7-497d-b752-c56976e2e869","resolution":{"observed_at":"2026-08-07T06:05:27.607086Z","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-07T06:05:30.753986Z","title":"Region filling operations with random obstacle avoidance for mobile robots,","venue":null,"work_id":"560cc8a7-6166-40cd-9c5a-57908ae8fc77","year":1988},"citing_paper":{"arxiv_id":"2506.06028","last_updated":"2025-06-06T12:20:45Z","snapshot_observed_at":"2026-08-07T05:59:33.673790Z","submitted_at":"2025-06-06T12:20:45Z","title":"End-to-End Framework for Robot Lawnmower Coverage Path Planning using Cellular Decomposition","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T06:05:27.715198Z"},"links":{"citing_paper":"/paper/2506.06028"},"observation_digest":"sha256:0e9187f8f7c8afe908928bf665dd46cf78d7c7c2ecf70e6cd1b830137388601e","observation_id":"2fa00827-8996-4698-9cc4-cd6ffc9fce25","resolution":{"observed_at":"2026-08-07T06:05:30.756212Z","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-07T06:05:30.717939Z","title":"Cleaning robot control,","venue":null,"work_id":"29e2ff71-b5a4-4645-a1fd-9af059ba4cf4","year":1988},"citing_paper":{"arxiv_id":"2506.06028","last_updated":"2025-06-06T12:20:45Z","snapshot_observed_at":"2026-08-07T05:59:33.673790Z","submitted_at":"2025-06-06T12:20:45Z","title":"End-to-End Framework for Robot Lawnmower Coverage Path Planning using Cellular Decomposition","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T06:05:27.823855Z"},"links":{"citing_paper":"/paper/2506.06028"},"observation_digest":"sha256:13ac9d4422f8110036727265892d590c5786eaf6879591c633d82de92fd86dcd","observation_id":"7ae0e016-a775-4448-97b0-c82995cd65e1","resolution":{"observed_at":"2026-08-07T06:05:30.749889Z","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-07T06:05:30.447454Z","title":"Coverage path planning for uavs based on enhanced exact cellular decomposition method,","venue":null,"work_id":"20db149a-7121-4bfc-a313-b77e6d398233","year":2011},"citing_paper":{"arxiv_id":"2506.06028","last_updated":"2025-06-06T12:20:45Z","snapshot_observed_at":"2026-08-07T05:59:33.673790Z","submitted_at":"2025-06-06T12:20:45Z","title":"End-to-End Framework for Robot Lawnmower Coverage Path Planning using Cellular Decomposition","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T06:05:27.932565Z"},"links":{"citing_paper":"/paper/2506.06028"},"observation_digest":"sha256:bfc2fd5c6a4c70e19cf16f4691e936d57d6d5502e90bf8ded09eb87631312707","observation_id":"b8281392-4f31-4146-a9ac-cc25d88a1931","resolution":{"observed_at":"2026-08-07T06:05:30.561154Z","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-07T06:05:30.275697Z","title":"The constriction decomposition method for coverage path planning,","venue":null,"work_id":"372c6dec-d2c7-4d32-8ba1-692076741008","year":2016},"citing_paper":{"arxiv_id":"2506.06028","last_updated":"2025-06-06T12:20:45Z","snapshot_observed_at":"2026-08-07T05:59:33.673790Z","submitted_at":"2025-06-06T12:20:45Z","title":"End-to-End Framework for Robot Lawnmower Coverage Path Planning using Cellular Decomposition","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T06:05:28.040871Z"},"links":{"citing_paper":"/paper/2506.06028"},"observation_digest":"sha256:500b4e3ff6a954a787f8a9aa965e2aa5ada3057c7cca9201dc43e9f9f2b95b19","observation_id":"6b29671d-d54b-4913-830f-35fb35cfed51","resolution":{"observed_at":"2026-08-07T06:05:30.339503Z","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-07T06:05:30.125403Z","title":"Complete coverage control for nonholo- nomic mobile robots in dynamic environments,","venue":null,"work_id":"c6759d62-552d-4e69-a28e-1de886503d92","year":2006},"citing_paper":{"arxiv_id":"2506.06028","last_updated":"2025-06-06T12:20:45Z","snapshot_observed_at":"2026-08-07T05:59:33.673790Z","submitted_at":"2025-06-06T12:20:45Z","title":"End-to-End Framework for Robot Lawnmower Coverage Path Planning using Cellular Decomposition","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T06:05:28.152970Z"},"links":{"citing_paper":"/paper/2506.06028"},"observation_digest":"sha256:4a6d4b2045e4d8f2c2ed1ef5b1a698335d40f0ae6dbcb3d8d556574f25bab459","observation_id":"70ffd442-a915-4d06-a1b9-fca57a367885","resolution":{"observed_at":"2026-08-07T06:05:30.223582Z","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-07T06:05:29.926763Z","title":"Coverage path planning software for autonomous robotic lawn mower using dubins’ curve,","venue":null,"work_id":"7108205d-7493-4e68-9559-18ccfc7c25d3","year":2017},"citing_paper":{"arxiv_id":"2506.06028","last_updated":"2025-06-06T12:20:45Z","snapshot_observed_at":"2026-08-07T05:59:33.673790Z","submitted_at":"2025-06-06T12:20:45Z","title":"End-to-End Framework for Robot Lawnmower Coverage Path Planning using Cellular Decomposition","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T06:05:28.257844Z"},"links":{"citing_paper":"/paper/2506.06028"},"observation_digest":"sha256:e44e5a4a97637760a6a29cc142b79d4c14ed599b16e9118739ccc9eeb8008b83","observation_id":"d553a757-70c1-42fd-8446-cb640145f668","resolution":{"observed_at":"2026-08-07T06:05:30.019770Z","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-07T06:05:29.695079Z","title":"An efficient hybrid data clustering method based on k-harmonic means and particle swarm optimization,","venue":null,"work_id":"3aea5c51-eb47-4247-9982-bfad12e50025","year":2009},"citing_paper":{"arxiv_id":"2506.06028","last_updated":"2025-06-06T12:20:45Z","snapshot_observed_at":"2026-08-07T05:59:33.673790Z","submitted_at":"2025-06-06T12:20:45Z","title":"End-to-End Framework for Robot Lawnmower Coverage Path Planning using Cellular Decomposition","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T06:05:28.365935Z"},"links":{"citing_paper":"/paper/2506.06028"},"observation_digest":"sha256:40cd8101177e900f58e29f8ece41e3d8b19c2446b57b6d903e5768f6ace8cf20","observation_id":"32b474da-a709-4ec2-b17b-7e7b243ab673","resolution":{"observed_at":"2026-08-07T06:05:29.821294Z","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-07T06:05:29.506972Z","title":"Coverage of known spaces: The boustrophedon cellular decomposition,","venue":null,"work_id":"d203b182-5922-4652-bce9-d18450d89f18","year":2000},"citing_paper":{"arxiv_id":"2506.06028","last_updated":"2025-06-06T12:20:45Z","snapshot_observed_at":"2026-08-07T05:59:33.673790Z","submitted_at":"2025-06-06T12:20:45Z","title":"End-to-End Framework for Robot Lawnmower Coverage Path Planning using Cellular Decomposition","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T06:05:28.457024Z"},"links":{"citing_paper":"/paper/2506.06028"},"observation_digest":"sha256:372f717ea39f46e11f9a4bbb8b21476afb3e9ab4a4fc5c5c9b7115cfc3078b17","observation_id":"6a71966f-54ef-453e-8268-56ba761d61c0","resolution":{"observed_at":"2026-08-07T06:05:29.598453Z","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-07T06:05:29.366864Z","title":"Spiral-stc: an on-line coverage algorithm of grid environments by a mobile robot,","venue":null,"work_id":"8734102b-1f3e-4f6f-941e-6bd069508ea5","year":2002},"citing_paper":{"arxiv_id":"2506.06028","last_updated":"2025-06-06T12:20:45Z","snapshot_observed_at":"2026-08-07T05:59:33.673790Z","submitted_at":"2025-06-06T12:20:45Z","title":"End-to-End Framework for Robot Lawnmower Coverage Path Planning using Cellular Decomposition","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T06:05:28.533424Z"},"links":{"citing_paper":"/paper/2506.06028"},"observation_digest":"sha256:b61716494cbd22b5bdffba46d1c349913526f84f88028e3e8ab8afaee54ff7cb","observation_id":"fc54b8c4-96f4-4c9d-a317-3ece5e4cf532","resolution":{"observed_at":"2026-08-07T06:05:29.435021Z","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-07T06:05:29.159575Z","title":"Gps/imu data fusion using multisensor kalman filtering: introduction of contextual aspects,","venue":null,"work_id":"d610ad25-d326-401d-b886-0c10fe94e8f3","year":2006},"citing_paper":{"arxiv_id":"2506.06028","last_updated":"2025-06-06T12:20:45Z","snapshot_observed_at":"2026-08-07T05:59:33.673790Z","submitted_at":"2025-06-06T12:20:45Z","title":"End-to-End Framework for Robot Lawnmower Coverage Path Planning using Cellular Decomposition","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T06:05:28.674402Z"},"links":{"citing_paper":"/paper/2506.06028"},"observation_digest":"sha256:8331f0cf88de84509b06479014a296de6023bc05fddbebf5475feb5152bd6f5c","observation_id":"16057a37-022c-48a5-8d38-ed69b7d35a64","resolution":{"observed_at":"2026-08-07T06:05:29.286198Z","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-07T06:05:28.916616Z","title":"Performance evaluation of the rtk-gnss navigating under different landscape,","venue":null,"work_id":"95e2f2e2-0168-4cf0-8df6-af34d6625c93","year":2018},"citing_paper":{"arxiv_id":"2506.06028","last_updated":"2025-06-06T12:20:45Z","snapshot_observed_at":"2026-08-07T05:59:33.673790Z","submitted_at":"2025-06-06T12:20:45Z","title":"End-to-End Framework for Robot Lawnmower Coverage Path Planning using Cellular Decomposition","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T06:05:28.782823Z"},"links":{"citing_paper":"/paper/2506.06028"},"observation_digest":"sha256:64b22178bdd95ec00054c4dc66f3cac38c453087765fb170475806fe00b12410","observation_id":"1d8b5a88-74a8-446b-8ef8-10c7479362ef","resolution":{"observed_at":"2026-08-07T06:05:29.019466Z","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"}}],"paper":{"arxiv_id":"2506.06028","last_updated":"2025-06-06T12:20:45Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-07T05:59:33.673790Z","submitted_at":"2025-06-06T12:20:45Z","title":"End-to-End Framework for Robot Lawnmower Coverage Path Planning using Cellular Decomposition"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":21},"total_outbound_references":23},"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 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2506.06028."}