{"as_of":"2026-08-13T12:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:da01504d2a2e520d2c6c46ebf9a282c6b110666ae88015be31e2bf0f9700435b","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-12T12:45:22.980095Z","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-13T06:32:02.005865+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/2411.17034/citation-record","integrity":"/paper/2411.17034/integrity","json":"/paper/2411.17034/citation-record.json","paper":"/paper/2411.17034"},"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-12T12:45:23.355664Z","title":null,"venue":null,"work_id":"0ee7cccd-4639-4184-b27e-4c13a6672598","year":2021},"citing_paper":{"arxiv_id":"2411.17034","last_updated":"2024-11-26T01:59:05Z","snapshot_observed_at":"2026-08-12T12:33:27.828501Z","submitted_at":"2024-11-26T01:59:05Z","title":"Dynamic Programming-Based Redundancy Resolution for Path Planning of Redundant Manipulators Considering Breakpoints","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T12:45:22.867391Z"},"links":{"citing_paper":"/paper/2411.17034"},"observation_digest":"sha256:bb87e9c577ec1c9e2dba050e6841c6bcb731a25e3799a774c1a33ead655ba927","observation_id":"c8b86288-02e0-426d-90ff-4c1fc6fd5109","resolution":{"observed_at":"2026-08-12T12:45:23.360731Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:45:23.340442Z","title":"Lu-zhong, Study of the traditional chinese medicine(tcm) massage robot based on the hybrid mechanism to obtain rolling treatment, Machine Design and Research","venue":null,"work_id":"b922a76a-178b-4047-9edb-5ef74915d507","year":null},"citing_paper":{"arxiv_id":"2411.17034","last_updated":"2024-11-26T01:59:05Z","snapshot_observed_at":"2026-08-12T12:33:27.828501Z","submitted_at":"2024-11-26T01:59:05Z","title":"Dynamic Programming-Based Redundancy Resolution for Path Planning of Redundant Manipulators Considering Breakpoints","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T12:45:22.872863Z"},"links":{"citing_paper":"/paper/2411.17034"},"observation_digest":"sha256:e2c18f8c5e79cd1ec9bd5c3126f3dcda1dda782a0599bd4dcf3fd6744368fd4c","observation_id":"06f0eb6a-1cd9-4fc8-867d-3b82702fd2fe","resolution":{"observed_at":"2026-08-12T12:45:23.345518Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:45:23.326059Z","title":null,"venue":null,"work_id":"abf886d4-482d-405a-9366-9a88a8830215","year":2023},"citing_paper":{"arxiv_id":"2411.17034","last_updated":"2024-11-26T01:59:05Z","snapshot_observed_at":"2026-08-12T12:33:27.828501Z","submitted_at":"2024-11-26T01:59:05Z","title":"Dynamic Programming-Based Redundancy Resolution for Path Planning of Redundant Manipulators Considering Breakpoints","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T12:45:22.877862Z"},"links":{"citing_paper":"/paper/2411.17034"},"observation_digest":"sha256:7fcb956d2f0f26527ac269a9757377fe492ee01f49ce9b4a2234ea9b391ed068","observation_id":"dfeca497-6ea0-4ee1-92b3-a5fda68bdd84","resolution":{"observed_at":"2026-08-12T12:45:23.330400Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:45:23.311130Z","title":"Fahimi, Autonomous robots: Modeling, path planning, and control, 2008","venue":null,"work_id":"d1bbe2c1-0d61-4c5b-a9cb-363deb8d7614","year":2008},"citing_paper":{"arxiv_id":"2411.17034","last_updated":"2024-11-26T01:59:05Z","snapshot_observed_at":"2026-08-12T12:33:27.828501Z","submitted_at":"2024-11-26T01:59:05Z","title":"Dynamic Programming-Based Redundancy Resolution for Path Planning of Redundant Manipulators Considering Breakpoints","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T12:45:22.882751Z"},"links":{"citing_paper":"/paper/2411.17034"},"observation_digest":"sha256:c132847850104bf78ec3e7d4d3e3caa0c41298205305045b17afe199e49a417e","observation_id":"52dd08e8-559d-428d-b4d4-679e832cdcf8","resolution":{"observed_at":"2026-08-12T12:45:23.315800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:45:23.296590Z","title":"Ferrentino, H","venue":null,"work_id":"93025279-3b0e-428f-8c57-48c68c9477a2","year":2022},"citing_paper":{"arxiv_id":"2411.17034","last_updated":"2024-11-26T01:59:05Z","snapshot_observed_at":"2026-08-12T12:33:27.828501Z","submitted_at":"2024-11-26T01:59:05Z","title":"Dynamic Programming-Based Redundancy Resolution for Path Planning of Redundant Manipulators Considering Breakpoints","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T12:45:22.887650Z"},"links":{"citing_paper":"/paper/2411.17034"},"observation_digest":"sha256:d9781f1ef530ec25f310ebd68ecd84bab697bb55e821257187348e45923c77c5","observation_id":"d49000c0-74ac-40b4-b095-17a3171c8587","resolution":{"observed_at":"2026-08-12T12:45:23.301280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:45:23.281959Z","title":null,"venue":null,"work_id":"ebf81cb3-8046-42e6-90ea-fab3ea689a94","year":2018},"citing_paper":{"arxiv_id":"2411.17034","last_updated":"2024-11-26T01:59:05Z","snapshot_observed_at":"2026-08-12T12:33:27.828501Z","submitted_at":"2024-11-26T01:59:05Z","title":"Dynamic Programming-Based Redundancy Resolution for Path Planning of Redundant Manipulators Considering Breakpoints","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T12:45:22.892776Z"},"links":{"citing_paper":"/paper/2411.17034"},"observation_digest":"sha256:4e22f0ccfffcab2a7ef7b0345661f2554492c70d0f3ed22406f8cae6c7612e98","observation_id":"5529b9dd-70f8-4a5e-a621-5711a9a90bca","resolution":{"observed_at":"2026-08-12T12:45:23.286673Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:45:23.267085Z","title":"Colan-Georges, Atlas of full breast ultrasonography, 2016","venue":null,"work_id":"5d040407-1edf-43cc-9cd0-3861606b6a17","year":2016},"citing_paper":{"arxiv_id":"2411.17034","last_updated":"2024-11-26T01:59:05Z","snapshot_observed_at":"2026-08-12T12:33:27.828501Z","submitted_at":"2024-11-26T01:59:05Z","title":"Dynamic Programming-Based Redundancy Resolution for Path Planning of Redundant Manipulators Considering Breakpoints","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T12:45:22.897715Z"},"links":{"citing_paper":"/paper/2411.17034"},"observation_digest":"sha256:9e65658a89318a2414e8c107fdf96e99561c52f5dd96508a74d1c63a2388f30c","observation_id":"707bbadb-a958-46b5-b5ed-6e5388d2d3af","resolution":{"observed_at":"2026-08-12T12:45:23.271823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:45:23.252079Z","title":"URL https://api.semanticscholar.org/CorpusID:247136314","venue":null,"work_id":"bc84e0d1-2ca8-4c83-b2cb-c675ae37d063","year":2022},"citing_paper":{"arxiv_id":"2411.17034","last_updated":"2024-11-26T01:59:05Z","snapshot_observed_at":"2026-08-12T12:33:27.828501Z","submitted_at":"2024-11-26T01:59:05Z","title":"Dynamic Programming-Based Redundancy Resolution for Path Planning of Redundant Manipulators Considering Breakpoints","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T12:45:22.903514Z"},"links":{"citing_paper":"/paper/2411.17034"},"observation_digest":"sha256:2ce028e0d4b2f4e84934b61839c834663a70313d23404c44c5c43d565921a955","observation_id":"358f3a93-5e16-4e80-bf14-e8778d49f073","resolution":{"observed_at":"2026-08-12T12:45:23.256700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:45:23.222065Z","title":"URL https://api.semanticscholar.org/CorpusID:57379257","venue":null,"work_id":"b049fda3-2a46-4b30-8d5d-4c3ba05b66cb","year":2019},"citing_paper":{"arxiv_id":"2411.17034","last_updated":"2024-11-26T01:59:05Z","snapshot_observed_at":"2026-08-12T12:33:27.828501Z","submitted_at":"2024-11-26T01:59:05Z","title":"Dynamic Programming-Based Redundancy Resolution for Path Planning of Redundant Manipulators Considering Breakpoints","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T12:45:22.913318Z"},"links":{"citing_paper":"/paper/2411.17034"},"observation_digest":"sha256:39c5f98e7730812886586083e345a2ed81c9f1c983fc38295ddc4b340b32ae96","observation_id":"edc190c8-dd24-49ed-a889-47377958de39","resolution":{"observed_at":"2026-08-12T12:45:23.226517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:45:23.207271Z","title":"Shimizu, H","venue":null,"work_id":"e2661b40-bea6-49a7-929e-9f1aae58d108","year":2008},"citing_paper":{"arxiv_id":"2411.17034","last_updated":"2024-11-26T01:59:05Z","snapshot_observed_at":"2026-08-12T12:33:27.828501Z","submitted_at":"2024-11-26T01:59:05Z","title":"Dynamic Programming-Based Redundancy Resolution for Path Planning of Redundant Manipulators Considering Breakpoints","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T12:45:22.917772Z"},"links":{"citing_paper":"/paper/2411.17034"},"observation_digest":"sha256:ce553e964cd1d98cbd9835b80b4d48570b45a6b57fae9966dd031a890e6a696b","observation_id":"719b9967-129a-41a9-a266-4eeaa30ce1dd","resolution":{"observed_at":"2026-08-12T12:45:23.212019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:45:23.192069Z","title":"Trutman, M","venue":null,"work_id":"3b561410-2465-4b86-bbf6-e1a65beb80bd","year":2020},"citing_paper":{"arxiv_id":"2411.17034","last_updated":"2024-11-26T01:59:05Z","snapshot_observed_at":"2026-08-12T12:33:27.828501Z","submitted_at":"2024-11-26T01:59:05Z","title":"Dynamic Programming-Based Redundancy Resolution for Path Planning of Redundant Manipulators Considering Breakpoints","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T12:45:22.922196Z"},"links":{"citing_paper":"/paper/2411.17034"},"observation_digest":"sha256:8c51ca03718cd376fc23a7fa45666678f04fd5a50a4c72d8233d209362b3118d","observation_id":"b89b3622-a413-451b-98bc-22be0f14bfef","resolution":{"observed_at":"2026-08-12T12:45:23.196834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:45:23.177408Z","title":null,"venue":null,"work_id":"e7f39341-9acc-41ba-9aab-05934a959cd8","year":1991},"citing_paper":{"arxiv_id":"2411.17034","last_updated":"2024-11-26T01:59:05Z","snapshot_observed_at":"2026-08-12T12:33:27.828501Z","submitted_at":"2024-11-26T01:59:05Z","title":"Dynamic Programming-Based Redundancy Resolution for Path Planning of Redundant Manipulators Considering Breakpoints","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T12:45:22.927176Z"},"links":{"citing_paper":"/paper/2411.17034"},"observation_digest":"sha256:aacbf398be3c47f7e55404dbae3a352dfa392810a21af104835c07480f0f9ea7","observation_id":"7c950a0f-95c6-4f6d-ade5-e616f2322dd4","resolution":{"observed_at":"2026-08-12T12:45:23.182130Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:45:23.162632Z","title":"Gluss, An introduction to dynamic programming, Journal of the Staple Inn Actuarial Society 16 (1961) 261–274","venue":null,"work_id":"acdb89b6-9283-4769-aec2-ec834166f8bf","year":1961},"citing_paper":{"arxiv_id":"2411.17034","last_updated":"2024-11-26T01:59:05Z","snapshot_observed_at":"2026-08-12T12:33:27.828501Z","submitted_at":"2024-11-26T01:59:05Z","title":"Dynamic Programming-Based Redundancy Resolution for Path Planning of Redundant Manipulators Considering Breakpoints","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T12:45:22.932220Z"},"links":{"citing_paper":"/paper/2411.17034"},"observation_digest":"sha256:ee7e0942de731bf5a56e92b39c390df1471a74ca3ee262fa31328e5347da9bd3","observation_id":"90071233-2649-4c2f-8727-e99f20492455","resolution":{"observed_at":"2026-08-12T12:45:23.167385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:45:23.147029Z","title":"Zietz, Dynamic programming: An introduction by example, The Journal of Economic Education 38 (2007) 165 – 186","venue":null,"work_id":"64766022-254c-4c51-baf3-bff039761a03","year":2007},"citing_paper":{"arxiv_id":"2411.17034","last_updated":"2024-11-26T01:59:05Z","snapshot_observed_at":"2026-08-12T12:33:27.828501Z","submitted_at":"2024-11-26T01:59:05Z","title":"Dynamic Programming-Based Redundancy Resolution for Path Planning of Redundant Manipulators Considering Breakpoints","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T12:45:22.937660Z"},"links":{"citing_paper":"/paper/2411.17034"},"observation_digest":"sha256:cbed850b467f3bd262435191877365cf8dbc3fd248bb21c7c2d76e7783784e23","observation_id":"c8785182-d92f-4e9f-9624-94a2c477a8ba","resolution":{"observed_at":"2026-08-12T12:45:23.152209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:45:23.131354Z","title":"URL https://api.semanticscholar.org/CorpusID:14277684","venue":null,"work_id":"cf68a901-84cc-4eeb-a8ef-dccbf8f76bc4","year":1986},"citing_paper":{"arxiv_id":"2411.17034","last_updated":"2024-11-26T01:59:05Z","snapshot_observed_at":"2026-08-12T12:33:27.828501Z","submitted_at":"2024-11-26T01:59:05Z","title":"Dynamic Programming-Based Redundancy Resolution for Path Planning of Redundant Manipulators Considering Breakpoints","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T12:45:22.942184Z"},"links":{"citing_paper":"/paper/2411.17034"},"observation_digest":"sha256:87fa6c4fdbf8df16a1a6abe3ca72c7e032af385cb6b53b49a9bbfb18d6518c11","observation_id":"b2fa4e02-09e4-46a1-9a2b-71b6bdff58e9","resolution":{"observed_at":"2026-08-12T12:45:23.136310Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:45:23.115552Z","title":"Field, Y","venue":null,"work_id":"c3a48149-92d7-420b-ad9c-9f955626f560","year":1996},"citing_paper":{"arxiv_id":"2411.17034","last_updated":"2024-11-26T01:59:05Z","snapshot_observed_at":"2026-08-12T12:33:27.828501Z","submitted_at":"2024-11-26T01:59:05Z","title":"Dynamic Programming-Based Redundancy Resolution for Path Planning of Redundant Manipulators Considering Breakpoints","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T12:45:22.946662Z"},"links":{"citing_paper":"/paper/2411.17034"},"observation_digest":"sha256:cab8f41a34794846f7791455e28e745ad7067a13aa19364f82b096809c8ca45e","observation_id":"773651af-7df7-4176-b37b-74483d0c87ff","resolution":{"observed_at":"2026-08-12T12:45:23.120747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:45:23.098177Z","title":"URL https://api.semanticscholar.org/CorpusID:8644553","venue":null,"work_id":"da1e1efe-7bbc-4363-b065-369511f5d691","year":2015},"citing_paper":{"arxiv_id":"2411.17034","last_updated":"2024-11-26T01:59:05Z","snapshot_observed_at":"2026-08-12T12:33:27.828501Z","submitted_at":"2024-11-26T01:59:05Z","title":"Dynamic Programming-Based Redundancy Resolution for Path Planning of Redundant Manipulators Considering Breakpoints","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T12:45:22.951098Z"},"links":{"citing_paper":"/paper/2411.17034"},"observation_digest":"sha256:282ad4bef6c0b16b8bdaba03a5f4255578f13d03ea6e2bd7ad3b33fb742a33b3","observation_id":"527ac602-0de6-47c9-8aca-7c1a3c3fe7ba","resolution":{"observed_at":"2026-08-12T12:45:23.103719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:45:23.082528Z","title":"Ferrentino, F","venue":null,"work_id":"e23752ae-d037-428d-9169-993da6fc0403","year":2021},"citing_paper":{"arxiv_id":"2411.17034","last_updated":"2024-11-26T01:59:05Z","snapshot_observed_at":"2026-08-12T12:33:27.828501Z","submitted_at":"2024-11-26T01:59:05Z","title":"Dynamic Programming-Based Redundancy Resolution for Path Planning of Redundant Manipulators Considering Breakpoints","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T12:45:22.955779Z"},"links":{"citing_paper":"/paper/2411.17034"},"observation_digest":"sha256:e6e44e37755f843e1988a44e8a758fe96e30939be68611641898b295ea42e15b","observation_id":"711d01b6-49d3-4a45-8c52-69697e21ad91","resolution":{"observed_at":"2026-08-12T12:45:23.087234Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.14363","last_updated":"2024-05-23T09:39:23Z","snapshot_observed_at":"2026-08-13T00:00:45.811557Z","submitted_at":"2024-05-23T09:39:23Z","title":"Optimal Whole Body Trajectory Planning for Mobile Manipulators in Planetary Exploration and Construction","version":1},"cited_work":{"arxiv_id":"2405.14363","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.14363","snapshot_observed_at":"2026-08-12T12:45:23.017238Z","title":"Optimal Whole Body Trajectory Planning for Mobile Manipulators in Planetary Exploration and Construction","venue":"cs.RO","work_id":"8500c66d-5618-452d-be37-5f961e93c6b8","year":2024},"citing_paper":{"arxiv_id":"2411.17034","last_updated":"2024-11-26T01:59:05Z","snapshot_observed_at":"2026-08-12T12:33:27.828501Z","submitted_at":"2024-11-26T01:59:05Z","title":"Dynamic Programming-Based Redundancy Resolution for Path Planning of Redundant Manipulators Considering Breakpoints","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T12:45:22.960388Z"},"links":{"cited_paper":"/paper/2405.14363","citing_paper":"/paper/2411.17034"},"observation_digest":"sha256:8aee95bd6807047713579e4007947a04b26c80f7cd9dc665d526957e89fa4f8c","observation_id":"fa6a1b69-4a7b-4d14-ae36-ae3d884a55f8","resolution":{"observed_at":"2026-08-12T12:45:23.024423Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:45:23.066779Z","title":"Ferrentino, P","venue":null,"work_id":"983e6627-c983-491c-acba-775d7bc4da66","year":2019},"citing_paper":{"arxiv_id":"2411.17034","last_updated":"2024-11-26T01:59:05Z","snapshot_observed_at":"2026-08-12T12:33:27.828501Z","submitted_at":"2024-11-26T01:59:05Z","title":"Dynamic Programming-Based Redundancy Resolution for Path Planning of Redundant Manipulators Considering Breakpoints","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T12:45:22.965566Z"},"links":{"citing_paper":"/paper/2411.17034"},"observation_digest":"sha256:3f0c75de95368673e56072f2976fa071a694020453c868a2f32d2bc1c8b3033b","observation_id":"3a6d8240-242e-46bc-9ae4-b7e7f687d7ec","resolution":{"observed_at":"2026-08-12T12:45:23.071503Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:45:23.236853Z","title":"URL https://api.semanticscholar.org/CorpusID:199541596","venue":null,"work_id":"035aabe5-09bc-4c4d-b91e-a05791c1de8b","year":2019},"citing_paper":{"arxiv_id":"2411.17034","last_updated":"2024-11-26T01:59:05Z","snapshot_observed_at":"2026-08-12T12:33:27.828501Z","submitted_at":"2024-11-26T01:59:05Z","title":"Dynamic Programming-Based Redundancy Resolution for Path Planning of Redundant Manipulators Considering Breakpoints","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T12:45:22.970971Z"},"links":{"citing_paper":"/paper/2411.17034"},"observation_digest":"sha256:64ceaa81fa9e091f9c09e7101f6aa39649693654c6154ebf43f3dc0925424f9a","observation_id":"2d5ede6b-51d8-4e7e-bb2e-2d6737c794e8","resolution":{"observed_at":"2026-08-12T12:45:23.241826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:45:23.050756Z","title":null,"venue":null,"work_id":"2b153287-dbff-4aa0-8707-671b8c70a385","year":1986},"citing_paper":{"arxiv_id":"2411.17034","last_updated":"2024-11-26T01:59:05Z","snapshot_observed_at":"2026-08-12T12:33:27.828501Z","submitted_at":"2024-11-26T01:59:05Z","title":"Dynamic Programming-Based Redundancy Resolution for Path Planning of Redundant Manipulators Considering Breakpoints","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T12:45:22.975471Z"},"links":{"citing_paper":"/paper/2411.17034"},"observation_digest":"sha256:316315cbff1f386133729e5504bcdec69096fa0ec2aa119a76cdbc7ba69e0799","observation_id":"f768f9ab-91a3-4008-ac1f-270d9b45db47","resolution":{"observed_at":"2026-08-12T12:45:23.055414Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:45:23.035459Z","title":"URL https://api.semanticscholar.org/CorpusID:245388527 Z","venue":null,"work_id":"f27966fa-4e3f-45d5-8dc0-d40aa9981c0a","year":2021},"citing_paper":{"arxiv_id":"2411.17034","last_updated":"2024-11-26T01:59:05Z","snapshot_observed_at":"2026-08-12T12:33:27.828501Z","submitted_at":"2024-11-26T01:59:05Z","title":"Dynamic Programming-Based Redundancy Resolution for Path Planning of Redundant Manipulators Considering Breakpoints","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T12:45:22.980095Z"},"links":{"citing_paper":"/paper/2411.17034"},"observation_digest":"sha256:b39f92c96998d736dbce9fb82dde4738b6f39f4d22e2a9ffb7537aa51269bc96","observation_id":"be0ec0ab-02a9-496a-b9da-87667b704907","resolution":{"observed_at":"2026-08-12T12:45:23.040225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.17034","last_updated":"2024-11-26T01:59:05Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-12T12:33:27.828501Z","submitted_at":"2024-11-26T01:59:05Z","title":"Dynamic Programming-Based Redundancy Resolution for Path Planning of Redundant Manipulators Considering Breakpoints"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":17},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2411.17034."}