{"as_of":"2026-08-10T20:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c0314d935ddece8b1572dd20de70a64264947311a9410571c124967f90f17f2a","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T16:25:59.578682Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":1,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2205.04422","last_updated":"2022-05-09T17:03:06Z","snapshot_observed_at":"2026-07-06T13:08:11.000809Z","submitted_at":"2022-05-09T17:03:06Z","title":"Motion Planning around Obstacles with Convex Optimization","version":1},"cited_work":{"arxiv_id":"2205.04422","doi":"10.48550/arxiv.2205.04422","metadata_source":"arxiv_reference","pith_arxiv_id":"2205.04422","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Marcucci, M","venue":"arXiv (Cornell University)","work_id":"e69c6e82-8d79-45fc-9b30-00e69ca56db9","year":2022},"citing_paper":{"arxiv_id":"2307.05973","last_updated":"2023-11-02T06:53:37Z","snapshot_observed_at":"2026-08-05T01:03:23.456778Z","submitted_at":"2023-07-12T07:40:48Z","title":"VoxPoser: Composable 3D Value Maps for Robotic Manipulation with Language Models","version":2},"reference_index":126,"source":"pdf_text","source_observed_at":"2026-05-13T08:57:22.299028Z"},"links":{"cited_paper":"/paper/2205.04422","citing_paper":"/paper/2307.05973"},"observation_digest":"sha256:f445687950273f0858d80c5b6a3b1b6510204f586b23714585edc509679bb960","observation_id":"09584453-adb5-47a0-b912-339dad6632f1","resolution":{"observed_at":"2026-05-13T08:57:22.480091Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.04422","last_updated":"2022-05-09T17:03:06Z","snapshot_observed_at":"2026-07-06T13:08:11.000809Z","submitted_at":"2022-05-09T17:03:06Z","title":"Motion Planning around Obstacles with Convex Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.04422","snapshot_observed_at":"2026-08-03T16:25:59.578682Z","title":"Marcucci, M","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2512.13836","last_updated":"2026-07-03T15:27:44Z","snapshot_observed_at":"2026-08-03T16:25:57.178067Z","submitted_at":"2025-12-15T19:16:47Z","title":"A Convex Obstacle Avoidance Formulation","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T16:25:59.578682Z"},"links":{"cited_paper":"/paper/2205.04422","citing_paper":"/paper/2512.13836"},"observation_digest":"sha256:7e828d5910c3a32de483a791ed7e337b30b738b6045e169178b443795cd11f3e","observation_id":"76a928bc-0a95-4e8d-842b-db0d69c12896","resolution":{"observed_at":"2026-08-03T16:25:59.578682Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.04422","last_updated":"2022-05-09T17:03:06Z","snapshot_observed_at":"2026-07-06T13:08:11.000809Z","submitted_at":"2022-05-09T17:03:06Z","title":"Motion Planning around Obstacles with Convex Optimization","version":1},"cited_work":{"arxiv_id":"2205.04422","doi":"10.48550/arxiv.2205.04422","metadata_source":"arxiv_reference","pith_arxiv_id":"2205.04422","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Marcucci, M","venue":"arXiv (Cornell University)","work_id":"e69c6e82-8d79-45fc-9b30-00e69ca56db9","year":2022},"citing_paper":{"arxiv_id":"2606.18516","last_updated":"2026-06-16T22:14:15Z","snapshot_observed_at":"2026-08-08T07:26:09.910488Z","submitted_at":"2026-06-16T22:14:15Z","title":"Task Allocation and Motion Planning in Dynamic, Cluttered Environments via CBBA and Graphs of Convex Sets","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-27T00:09:30.656365Z"},"links":{"cited_paper":"/paper/2205.04422","citing_paper":"/paper/2606.18516"},"observation_digest":"sha256:c0b2c82d977b72d964a070ea24119fe8feda9a06d7d9a5921604859abf375e34","observation_id":"60c400ed-af24-44d1-916c-6ef395933306","resolution":{"observed_at":"2026-06-27T00:10:15.957577Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.04422","last_updated":"2022-05-09T17:03:06Z","snapshot_observed_at":"2026-07-06T13:08:11.000809Z","submitted_at":"2022-05-09T17:03:06Z","title":"Motion Planning around Obstacles with Convex Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.04422","snapshot_observed_at":"2026-08-01T06:09:35.833556Z","title":"arXiv preprint arXiv:2205.04422 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22020","last_updated":"2026-07-24T06:37:52Z","snapshot_observed_at":"2026-08-10T12:43:33.662867Z","submitted_at":"2026-07-24T06:37:52Z","title":"Embodying Multi-Hand Manipulation Policies by Searching the Assignment and Null Spaces","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-01T06:09:35.833556Z"},"links":{"cited_paper":"/paper/2205.04422","citing_paper":"/paper/2607.22020"},"observation_digest":"sha256:55a142d0ed0b9221f3b3a868208af8ef90298f86fb93ee6a4ea1ebce7e2ff702","observation_id":"8e8c259e-0758-484e-a188-f354b4631541","resolution":{"observed_at":"2026-08-01T06:09:35.833556Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2205.04422/citation-record","integrity":"/paper/2205.04422/integrity","json":"/paper/2205.04422/citation-record.json","paper":"/paper/2205.04422"},"outbound":[],"paper":{"arxiv_id":"2205.04422","last_updated":"2022-05-09T17:03:06Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-07-06T13:08:11.000809Z","submitted_at":"2022-05-09T17:03:06Z","title":"Motion Planning around Obstacles with Convex Optimization"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2205.04422."}