{"as_of":"2026-08-17T13:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:29472bbe07c7c6fcee25bb8647167909ceb39627338656ef31ef4377b91fc94a","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-06T18:24:53.007708Z","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-17T06:30:58.91139+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/2507.08724/citation-record","integrity":"/paper/2507.08724/integrity","json":"/paper/2507.08724/citation-record.json","paper":"/paper/2507.08724"},"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-06T18:24:55.744746Z","title":"Time optimal trajectories for bounded velocity differential drive vehicles","venue":null,"work_id":"c322d64d-ba3a-49f4-b7c8-cedc9599e215","year":2002},"citing_paper":{"arxiv_id":"2507.08724","last_updated":"2025-07-11T16:24:23Z","snapshot_observed_at":"2026-08-15T11:47:22.712181Z","submitted_at":"2025-07-11T16:24:23Z","title":"Computing optimal trajectories for a tethered pursuer","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T18:24:51.566079Z"},"links":{"citing_paper":"/paper/2507.08724"},"observation_digest":"sha256:84581ad931cc1ae104a7f593805e5d8ac0f04d64c56092f8e97e2e28b8d64e80","observation_id":"f4bd7491-80dd-497c-9297-acd423dfbc24","resolution":{"observed_at":"2026-08-06T18:24:55.820755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:24:55.652589Z","title":"A visibility-based pursuit-evasion game with a circular obstacle","venue":null,"work_id":"3512031b-0f33-4e33-ba41-ebb6093629b9","year":2016},"citing_paper":{"arxiv_id":"2507.08724","last_updated":"2025-07-11T16:24:23Z","snapshot_observed_at":"2026-08-15T11:47:22.712181Z","submitted_at":"2025-07-11T16:24:23Z","title":"Computing optimal trajectories for a tethered pursuer","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T18:24:51.609422Z"},"links":{"citing_paper":"/paper/2507.08724"},"observation_digest":"sha256:3ad36193777102cc5d94a4f5c919e504e6f5d661a01a3345a9ef6cc575873776","observation_id":"7e3522a9-675f-496f-8247-eecd42c0e36f","resolution":{"observed_at":"2026-08-06T18:24:55.678374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:24:55.529596Z","title":"Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time","venue":null,"work_id":"cfecbe33-be34-4d1f-b3f7-9a0f93197cf3","year":2006},"citing_paper":{"arxiv_id":"2507.08724","last_updated":"2025-07-11T16:24:23Z","snapshot_observed_at":"2026-08-15T11:47:22.712181Z","submitted_at":"2025-07-11T16:24:23Z","title":"Computing optimal trajectories for a tethered pursuer","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T18:24:51.680599Z"},"links":{"citing_paper":"/paper/2507.08724"},"observation_digest":"sha256:b39b41a0f439a629c5cee06ccb94955379808bf5eaed21c5a3ec28f512e1c7e1","observation_id":"45064df8-5887-4dce-9406-8ac84e82fd08","resolution":{"observed_at":"2026-08-06T18:24:55.586890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.02141","last_updated":"2024-12-23T14:23:02Z","snapshot_observed_at":"2026-08-17T08:03:57.293215Z","submitted_at":"2024-08-04T20:53:03Z","title":"MASPA: An efficient strategy for path planning with a tethered marsupial robotics system","version":3},"cited_work":{"arxiv_id":"2408.02141","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.02141","snapshot_observed_at":"2026-08-06T18:24:53.079715Z","title":"MASPA: An efficient strategy for path planning with a tethered marsupial robotics system","venue":"cs.RO","work_id":"a3580614-f4ab-4950-9592-936925bbb9f4","year":2024},"citing_paper":{"arxiv_id":"2507.08724","last_updated":"2025-07-11T16:24:23Z","snapshot_observed_at":"2026-08-15T11:47:22.712181Z","submitted_at":"2025-07-11T16:24:23Z","title":"Computing optimal trajectories for a tethered pursuer","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T18:24:51.747333Z"},"links":{"cited_paper":"/paper/2408.02141","citing_paper":"/paper/2507.08724"},"observation_digest":"sha256:e950aaed5b862d46079abd01f5d2eb74c6b6986ebe774ff9164d74262fec96fc","observation_id":"29ea3ae9-52d7-443f-854f-e7cf31e00799","resolution":{"observed_at":"2026-08-06T18:24:53.167364Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:24:55.390067Z","title":"Minimum wheel-rotation paths for differential-drive mobile robots","venue":null,"work_id":"eb072af6-5c10-4ff1-814f-516ca9cba232","year":2009},"citing_paper":{"arxiv_id":"2507.08724","last_updated":"2025-07-11T16:24:23Z","snapshot_observed_at":"2026-08-15T11:47:22.712181Z","submitted_at":"2025-07-11T16:24:23Z","title":"Computing optimal trajectories for a tethered pursuer","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T18:24:51.800119Z"},"links":{"citing_paper":"/paper/2507.08724"},"observation_digest":"sha256:4016b37c79d0df3b3af3a50b6bbbb9d3d23bd73cfa83aca95c2312b3ea9674a2","observation_id":"60886d63-2ad4-428e-a1fc-a1bfffab1b3b","resolution":{"observed_at":"2026-08-06T18:24:55.439341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:24:55.295505Z","title":"Trajectory generation for constant velocity target motion estimation using monocular vision","venue":null,"work_id":"fbf62fad-1c13-4e3a-8467-6b171036ccc0","year":2003},"citing_paper":{"arxiv_id":"2507.08724","last_updated":"2025-07-11T16:24:23Z","snapshot_observed_at":"2026-08-15T11:47:22.712181Z","submitted_at":"2025-07-11T16:24:23Z","title":"Computing optimal trajectories for a tethered pursuer","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T18:24:51.847973Z"},"links":{"citing_paper":"/paper/2507.08724"},"observation_digest":"sha256:273717c8bd4491645f7f78e37b82ea5802a20db30ce3483336e33e46c46a105f","observation_id":"1df5ac94-267a-4c4d-b535-02501771c947","resolution":{"observed_at":"2026-08-06T18:24:55.344489Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:24:55.234459Z","title":"Linear time algorithms for visibility and shortest path problems inside simple polygons","venue":null,"work_id":"56aa121f-dcf1-4625-ab88-76ee7b045dbf","year":1986},"citing_paper":{"arxiv_id":"2507.08724","last_updated":"2025-07-11T16:24:23Z","snapshot_observed_at":"2026-08-15T11:47:22.712181Z","submitted_at":"2025-07-11T16:24:23Z","title":"Computing optimal trajectories for a tethered pursuer","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T18:24:51.892722Z"},"links":{"citing_paper":"/paper/2507.08724"},"observation_digest":"sha256:30f1fc1078ce269614080949239ecabdbb40f61d7fab556c9e42b0aa0c386803","observation_id":"902d69da-c793-480e-899d-3dedbe7d4ed7","resolution":{"observed_at":"2026-08-06T18:24:55.251097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:24:55.184734Z","title":"Computing minimum length paths of a given homotopy class","venue":null,"work_id":"b1f4a82b-ad0b-49b1-be31-6689242e87b7","year":1994},"citing_paper":{"arxiv_id":"2507.08724","last_updated":"2025-07-11T16:24:23Z","snapshot_observed_at":"2026-08-15T11:47:22.712181Z","submitted_at":"2025-07-11T16:24:23Z","title":"Computing optimal trajectories for a tethered pursuer","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T18:24:51.927318Z"},"links":{"citing_paper":"/paper/2507.08724"},"observation_digest":"sha256:06eb881bc0a4f86195b3a4638abc6f64b2cca2ead2991d1840fd1356a7d6082e","observation_id":"acb7f1bc-f1c4-4f1b-9087-c7ededd542ae","resolution":{"observed_at":"2026-08-06T18:24:55.206313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:24:55.123670Z","title":"A marsupial relationship in robotics: A survey","venue":null,"work_id":"2d8dbf11-1874-4cb2-806a-3f2e4445cb60","year":2011},"citing_paper":{"arxiv_id":"2507.08724","last_updated":"2025-07-11T16:24:23Z","snapshot_observed_at":"2026-08-15T11:47:22.712181Z","submitted_at":"2025-07-11T16:24:23Z","title":"Computing optimal trajectories for a tethered pursuer","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T18:24:52.004730Z"},"links":{"citing_paper":"/paper/2507.08724"},"observation_digest":"sha256:0ff4dc6e5beec0df93e79051924b544224d70560f32c26d90146bde6ffd02647","observation_id":"db3a888d-ae7b-4537-a68f-7dce48392230","resolution":{"observed_at":"2026-08-06T18:24:55.153662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:24:55.039471Z","title":"On the complexity of minimum-link path problems","venue":null,"work_id":"dc8b0652-eb60-4c2c-9b0c-a1f96d0da2f5","year":2017},"citing_paper":{"arxiv_id":"2507.08724","last_updated":"2025-07-11T16:24:23Z","snapshot_observed_at":"2026-08-15T11:47:22.712181Z","submitted_at":"2025-07-11T16:24:23Z","title":"Computing optimal trajectories for a tethered pursuer","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T18:24:52.114545Z"},"links":{"citing_paper":"/paper/2507.08724"},"observation_digest":"sha256:d52d28ae4b8305442e6e0c1b1b402b289fe6e5e122508d9c773a265d4c5fcab6","observation_id":"c5439166-7a28-4be7-a733-ad8291a62b10","resolution":{"observed_at":"2026-08-06T18:24:55.073926Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:24:54.935711Z","title":"Motion strategies for maintaining visibility of a moving target","venue":null,"work_id":"2a0b22cb-6e59-452a-bdc0-c42f3d36f559","year":1997},"citing_paper":{"arxiv_id":"2507.08724","last_updated":"2025-07-11T16:24:23Z","snapshot_observed_at":"2026-08-15T11:47:22.712181Z","submitted_at":"2025-07-11T16:24:23Z","title":"Computing optimal trajectories for a tethered pursuer","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T18:24:52.279158Z"},"links":{"citing_paper":"/paper/2507.08724"},"observation_digest":"sha256:a0e6597a1653d9ca2c05a51d8476730558c91ff7a371277e08661417bd066891","observation_id":"7ce57321-e89d-4678-9751-580534de7f7f","resolution":{"observed_at":"2026-08-06T18:24:54.992496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:24:54.837799Z","title":"On finding the convex hull of a simple polygon","venue":null,"work_id":"1c929222-8a0b-4f0d-9704-84b9ff2cccce","year":1983},"citing_paper":{"arxiv_id":"2507.08724","last_updated":"2025-07-11T16:24:23Z","snapshot_observed_at":"2026-08-15T11:47:22.712181Z","submitted_at":"2025-07-11T16:24:23Z","title":"Computing optimal trajectories for a tethered pursuer","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T18:24:52.392741Z"},"links":{"citing_paper":"/paper/2507.08724"},"observation_digest":"sha256:f262a34a2564cdd4e68047dc4afc8a02110e82f528511d588be36a937dd88c3b","observation_id":"6e8c2add-d9b0-49e7-97cb-8b0d0a637179","resolution":{"observed_at":"2026-08-06T18:24:54.869045Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:24:54.755796Z","title":"Link distance problems","venue":null,"work_id":"057f25f7-a9c1-48ef-a948-97cd7b39c37f","year":2000},"citing_paper":{"arxiv_id":"2507.08724","last_updated":"2025-07-11T16:24:23Z","snapshot_observed_at":"2026-08-15T11:47:22.712181Z","submitted_at":"2025-07-11T16:24:23Z","title":"Computing optimal trajectories for a tethered pursuer","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T18:24:52.485683Z"},"links":{"citing_paper":"/paper/2507.08724"},"observation_digest":"sha256:faa3435f9be40dd62e535b3532bfd8d804adb840a4d4cde4ac068981bb4b2222","observation_id":"f30ba78e-a3fd-4a4c-8531-ee840d3da913","resolution":{"observed_at":"2026-08-06T18:24:54.791204Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:24:54.612777Z","title":"Path and trajectory planning of a tethered uav-ugv marsupial robotic system","venue":null,"work_id":"1ae803e1-04a6-4cbf-bf9d-513503f7e3f6","year":2023},"citing_paper":{"arxiv_id":"2507.08724","last_updated":"2025-07-11T16:24:23Z","snapshot_observed_at":"2026-08-15T11:47:22.712181Z","submitted_at":"2025-07-11T16:24:23Z","title":"Computing optimal trajectories for a tethered pursuer","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T18:24:52.558238Z"},"links":{"citing_paper":"/paper/2507.08724"},"observation_digest":"sha256:ee178ead232e70a929cddf731fdcf1d08e70c7469e113c0f2a3b53d3d4819e42","observation_id":"207aaeae-10dc-4d37-bcd5-c1cb7c347f36","resolution":{"observed_at":"2026-08-06T18:24:54.680679Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:24:54.457543Z","title":"Minimum-link paths revisited","venue":null,"work_id":"15027ff3-05c4-488f-ab90-7ef1ee730a26","year":2014},"citing_paper":{"arxiv_id":"2507.08724","last_updated":"2025-07-11T16:24:23Z","snapshot_observed_at":"2026-08-15T11:47:22.712181Z","submitted_at":"2025-07-11T16:24:23Z","title":"Computing optimal trajectories for a tethered pursuer","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T18:24:52.615870Z"},"links":{"citing_paper":"/paper/2507.08724"},"observation_digest":"sha256:380ecbc130eeff69669baf05015bb26f7846f16eef03a199c1ef479172bd2107","observation_id":"4343a6c7-14db-42c5-967f-970da36f3d9c","resolution":{"observed_at":"2026-08-06T18:24:54.527896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:24:54.292445Z","title":"Minimum-link paths among obsta- cles in the plane","venue":null,"work_id":"ffb46486-8bbd-4df4-bb7c-1c165baa0957","year":1992},"citing_paper":{"arxiv_id":"2507.08724","last_updated":"2025-07-11T16:24:23Z","snapshot_observed_at":"2026-08-15T11:47:22.712181Z","submitted_at":"2025-07-11T16:24:23Z","title":"Computing optimal trajectories for a tethered pursuer","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T18:24:52.692789Z"},"links":{"citing_paper":"/paper/2507.08724"},"observation_digest":"sha256:f3a575ccea1cb272ae0ab537565e304f43d39331a27230a2850667ff6dc7acd3","observation_id":"0707a243-787b-47cf-b76a-260d173b6bb2","resolution":{"observed_at":"2026-08-06T18:24:54.354019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:24:54.137543Z","title":"Marsupial and shape-shifting robots for urban search and rescue","venue":null,"work_id":"dd47d2c8-ff61-48d1-b7c9-f2443080e6e5","year":2000},"citing_paper":{"arxiv_id":"2507.08724","last_updated":"2025-07-11T16:24:23Z","snapshot_observed_at":"2026-08-15T11:47:22.712181Z","submitted_at":"2025-07-11T16:24:23Z","title":"Computing optimal trajectories for a tethered pursuer","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T18:24:52.744921Z"},"links":{"citing_paper":"/paper/2507.08724"},"observation_digest":"sha256:dc98bdf5700ff564f35498a517d8aabfa6950512d03b7beb232f10d70e8fb628","observation_id":"a22045c2-5214-4985-96bd-a2ddca5c9f75","resolution":{"observed_at":"2026-08-06T18:24:54.208126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:24:53.974263Z","title":"Marsupial-like mobile robot societies","venue":null,"work_id":"444b9266-3807-45b3-827b-7b36afd73b9c","year":1999},"citing_paper":{"arxiv_id":"2507.08724","last_updated":"2025-07-11T16:24:23Z","snapshot_observed_at":"2026-08-15T11:47:22.712181Z","submitted_at":"2025-07-11T16:24:23Z","title":"Computing optimal trajectories for a tethered pursuer","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T18:24:52.792492Z"},"links":{"citing_paper":"/paper/2507.08724"},"observation_digest":"sha256:cf68c82e6d8c0f003aef1f23fe1d683abad29e74efaf1b7d126f35efa0aebde6","observation_id":"06b33779-af14-46e7-bc85-a5ee88e1b419","resolution":{"observed_at":"2026-08-06T18:24:54.042062Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:24:53.791501Z","title":"Tracking an omnidirectional evader with a differential drive robot","venue":null,"work_id":"6744f7e1-9b1d-444e-a10e-e3a46e6ea993","year":2011},"citing_paper":{"arxiv_id":"2507.08724","last_updated":"2025-07-11T16:24:23Z","snapshot_observed_at":"2026-08-15T11:47:22.712181Z","submitted_at":"2025-07-11T16:24:23Z","title":"Computing optimal trajectories for a tethered pursuer","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T18:24:52.844519Z"},"links":{"citing_paper":"/paper/2507.08724"},"observation_digest":"sha256:5137b101bdc46b78eb4a6cda59d37335b4ca41de581d075b1b86ce65af9fdd61","observation_id":"425ab7e6-c4d5-40ff-b8fd-13897bbf5af1","resolution":{"observed_at":"2026-08-06T18:24:53.846806Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:24:53.645109Z","title":"Multi-robot target detection and tracking: taxonomy and survey","venue":null,"work_id":"1cfd9aa2-c2b0-4a17-99f9-e35e8836ef1a","year":2016},"citing_paper":{"arxiv_id":"2507.08724","last_updated":"2025-07-11T16:24:23Z","snapshot_observed_at":"2026-08-15T11:47:22.712181Z","submitted_at":"2025-07-11T16:24:23Z","title":"Computing optimal trajectories for a tethered pursuer","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T18:24:52.891575Z"},"links":{"citing_paper":"/paper/2507.08724"},"observation_digest":"sha256:4f76ea0757b8f34d1a4a3c7232e61a22ddd5f44b68fc7bb20e082c617400feab","observation_id":"7295ab61-c98a-4f63-bdee-597b06915a4d","resolution":{"observed_at":"2026-08-06T18:24:53.693000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:24:53.546849Z","title":"A linear time algorithm with minimum link paths inside a simple polygon","venue":null,"work_id":"ba951eb9-9ef0-478f-8311-120c1de2edd9","year":1986},"citing_paper":{"arxiv_id":"2507.08724","last_updated":"2025-07-11T16:24:23Z","snapshot_observed_at":"2026-08-15T11:47:22.712181Z","submitted_at":"2025-07-11T16:24:23Z","title":"Computing optimal trajectories for a tethered pursuer","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T18:24:52.926918Z"},"links":{"citing_paper":"/paper/2507.08724"},"observation_digest":"sha256:28ba9bc441ce6784d08c44cd942a684df0bd9e4a265f43d5f7c75e777ceb9255","observation_id":"1de4a171-41a4-4455-abc7-ffb2c2f87d7d","resolution":{"observed_at":"2026-08-06T18:24:53.575287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:24:53.420007Z","title":"Energy-optimal trajectory planning for car- like robots","venue":null,"work_id":"1bb9f84e-937c-4f92-a198-41bf6e732001","year":2014},"citing_paper":{"arxiv_id":"2507.08724","last_updated":"2025-07-11T16:24:23Z","snapshot_observed_at":"2026-08-15T11:47:22.712181Z","submitted_at":"2025-07-11T16:24:23Z","title":"Computing optimal trajectories for a tethered pursuer","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T18:24:52.964295Z"},"links":{"citing_paper":"/paper/2507.08724"},"observation_digest":"sha256:52606cae6e8623c983601964499cfe1c3da6b4ebfef770d3746fa99d60f7473b","observation_id":"12936135-71dc-4c03-a4ff-7dd626a7b885","resolution":{"observed_at":"2026-08-06T18:24:53.489125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:24:53.272409Z","title":"On optimal pursuit trajectories for visibility-based target- tracking game","venue":null,"work_id":"a7abccf8-366c-4d5b-8a58-4db226668514","year":2018},"citing_paper":{"arxiv_id":"2507.08724","last_updated":"2025-07-11T16:24:23Z","snapshot_observed_at":"2026-08-15T11:47:22.712181Z","submitted_at":"2025-07-11T16:24:23Z","title":"Computing optimal trajectories for a tethered pursuer","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T18:24:53.007708Z"},"links":{"citing_paper":"/paper/2507.08724"},"observation_digest":"sha256:225ef8f8c54fd9ac60354dc6f6054b4c734595a0cca08b92dd017f2a8bc17c99","observation_id":"e36bc922-0710-44d1-aafe-65251264a31b","resolution":{"observed_at":"2026-08-06T18:24:53.363689Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.08724","last_updated":"2025-07-11T16:24:23Z","latest_version":1,"primary_category":"cs.CG","snapshot_observed_at":"2026-08-15T11:47:22.712181Z","submitted_at":"2025-07-11T16:24:23Z","title":"Computing optimal trajectories for a tethered pursuer"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":1,"verified_fuzzy":22},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2507.08724."}