{"as_of":"2026-08-15T16:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:256e8c69ade7665b0478e2d76e03476cb7df635c3b231927427c1026ee16f66a","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":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":10,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T10:50:59.783128Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-10T06:15:00.866473Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.12649","last_updated":"2024-11-13T20:00:39Z","snapshot_observed_at":"2026-08-12T22:21:46.357774Z","submitted_at":"2024-10-16T15:13:27Z","title":"Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.12649","snapshot_observed_at":"2026-08-12T10:50:59.783128Z","title":"Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.18913","last_updated":"2025-04-14T02:47:15Z","snapshot_observed_at":"2026-08-14T08:31:21.165457Z","submitted_at":"2024-11-28T05:08:00Z","title":"Planning Shorter Paths in Graphs of Convex Sets by Undistorting Parametrized Configuration Spaces","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T10:50:59.783128Z"},"links":{"cited_paper":"/paper/2410.12649","citing_paper":"/paper/2411.18913"},"observation_digest":"sha256:c36eba3b96fef6d9dc4bfd7bff2f1c4342e0ba96d500806825f29b414072ee4a","observation_id":"ac68d266-00dc-43a5-9326-3e46d227514f","resolution":{"observed_at":"2026-08-12T10:50:59.783128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.12649","last_updated":"2024-11-13T20:00:39Z","snapshot_observed_at":"2026-08-12T22:21:46.357774Z","submitted_at":"2024-10-16T15:13:27Z","title":"Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space","version":2},"cited_work":{"arxiv_id":"2410.12649","doi":"10.48550/arxiv.2410.12649","metadata_source":"arxiv_reference","pith_arxiv_id":"2410.12649","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Faster algorithms for growing collision-free convex polytopes in robot configuration space","venue":null,"work_id":"52c43f19-7bbd-4ec8-9259-ba9a2b628183","year":2024},"citing_paper":{"arxiv_id":"2503.04929","last_updated":"2026-05-22T04:52:07Z","snapshot_observed_at":"2026-08-08T19:32:53.653103Z","submitted_at":"2025-03-06T20:00:56Z","title":"Neural Configuration-Space Barriers for Manipulation Planning and Control","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-23T00:46:48.786908Z"},"links":{"cited_paper":"/paper/2410.12649","citing_paper":"/paper/2503.04929"},"observation_digest":"sha256:6f20a6432cd9f6cecf19f6e7d13e1da0e4091dcf7c63c1bc326412756d335af5","observation_id":"4ca6c070-966b-4d6c-85f5-7c2ffb42dfd6","resolution":{"observed_at":"2026-05-23T00:47:19.007817Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.12649","last_updated":"2024-11-13T20:00:39Z","snapshot_observed_at":"2026-08-12T22:21:46.357774Z","submitted_at":"2024-10-16T15:13:27Z","title":"Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space","version":2},"cited_work":{"arxiv_id":"2410.12649","doi":"10.48550/arxiv.2410.12649","metadata_source":"arxiv_reference","pith_arxiv_id":"2410.12649","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Faster algorithms for growing collision-free convex polytopes in robot configuration space","venue":null,"work_id":"52c43f19-7bbd-4ec8-9259-ba9a2b628183","year":2024},"citing_paper":{"arxiv_id":"2503.04929","last_updated":"2026-05-22T04:52:07Z","snapshot_observed_at":"2026-08-08T19:32:53.653103Z","submitted_at":"2025-03-06T20:00:56Z","title":"Neural Configuration-Space Barriers for Manipulation Planning and Control","version":4},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-25T08:46:47.801893Z"},"links":{"cited_paper":"/paper/2410.12649","citing_paper":"/paper/2503.04929"},"observation_digest":"sha256:dae2abb00cc4a8038e838e798f48b6275e2d0e157df5dbf2a3e05b21145120df","observation_id":"da3e16cc-5f5b-4875-a282-d2347e5c5049","resolution":{"observed_at":"2026-05-25T08:50:32.886047Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.12649","last_updated":"2024-11-13T20:00:39Z","snapshot_observed_at":"2026-08-12T22:21:46.357774Z","submitted_at":"2024-10-16T15:13:27Z","title":"Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.12649","snapshot_observed_at":"2026-08-06T17:30:49.674096Z","title":"Faster algorithms for growing collision-free convex polytopes in robot configuration space","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-15T02:20:11.590608Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:49.674096Z"},"links":{"cited_paper":"/paper/2410.12649","citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:b361bc8b5d5ea7ddb871df707f240ad3a7a6e4ebc5d33550d4c6e9fd86644974","observation_id":"bcb972c7-cf6e-4870-9ce3-4bed143cba18","resolution":{"observed_at":"2026-08-06T17:30:49.674096Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.12649","last_updated":"2024-11-13T20:00:39Z","snapshot_observed_at":"2026-08-12T22:21:46.357774Z","submitted_at":"2024-10-16T15:13:27Z","title":"Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.12649","snapshot_observed_at":"2026-08-05T15:19:17.237204Z","title":"Approximating robot configuration spaces with few convex sets using clique covers of visibility graphs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.20095","last_updated":"2025-08-27T17:59:36Z","snapshot_observed_at":"2026-08-12T13:18:13.672030Z","submitted_at":"2025-08-27T17:59:36Z","title":"Discrete-Guided Diffusion for Scalable and Safe Multi-Robot Motion Planning","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-05T15:19:17.237204Z"},"links":{"cited_paper":"/paper/2410.12649","citing_paper":"/paper/2508.20095"},"observation_digest":"sha256:c42bcc7cf3f15b00f07e0dea086afdde3afdd9b2bb40cc799ae25e30656e9b7e","observation_id":"4b19598a-057d-46f5-990d-3428b63c509a","resolution":{"observed_at":"2026-08-05T15:19:17.237204Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.12649","last_updated":"2024-11-13T20:00:39Z","snapshot_observed_at":"2026-08-12T22:21:46.357774Z","submitted_at":"2024-10-16T15:13:27Z","title":"Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space","version":2},"cited_work":{"arxiv_id":"2410.12649","doi":"10.48550/arxiv.2410.12649","metadata_source":"arxiv_reference","pith_arxiv_id":"2410.12649","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Faster algorithms for growing collision-free convex polytopes in robot configuration space","venue":null,"work_id":"52c43f19-7bbd-4ec8-9259-ba9a2b628183","year":2024},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-15T13:51:41.409895Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"cited_paper":"/paper/2410.12649","citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:68b1e94321b91c84ab8e0ae040cda4c72bedce4afb62a0d62cdfc1523c5edc99","observation_id":"d4c431e9-3797-4b3d-a9ed-47df5319ac99","resolution":{"observed_at":"2026-05-25T04:35:20.740394Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.12649","last_updated":"2024-11-13T20:00:39Z","snapshot_observed_at":"2026-08-12T22:21:46.357774Z","submitted_at":"2024-10-16T15:13:27Z","title":"Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space","version":2},"cited_work":{"arxiv_id":"2410.12649","doi":"10.48550/arxiv.2410.12649","metadata_source":"arxiv_reference","pith_arxiv_id":"2410.12649","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Faster algorithms for growing collision-free convex polytopes in robot configuration space","venue":null,"work_id":"52c43f19-7bbd-4ec8-9259-ba9a2b628183","year":2024},"citing_paper":{"arxiv_id":"2606.12027","last_updated":"2026-06-10T12:49:47Z","snapshot_observed_at":"2026-08-14T07:48:26.978472Z","submitted_at":"2026-06-10T12:49:47Z","title":"Learning Unions of Convex Sets via Invertible Latent Decomposition for Path Planning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-27T09:34:55.919165Z"},"links":{"cited_paper":"/paper/2410.12649","citing_paper":"/paper/2606.12027"},"observation_digest":"sha256:b1cda7e683c3f334b3db7c574846801e4cea1ac30c9cf50e7173c7c75f466b6e","observation_id":"23a6ffcb-e91a-4604-b4b1-d10803a6f433","resolution":{"observed_at":"2026-07-03T11:28:04.200802Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.12649","last_updated":"2024-11-13T20:00:39Z","snapshot_observed_at":"2026-08-12T22:21:46.357774Z","submitted_at":"2024-10-16T15:13:27Z","title":"Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space","version":2},"cited_work":{"arxiv_id":"2410.12649","doi":"10.48550/arxiv.2410.12649","metadata_source":"arxiv_reference","pith_arxiv_id":"2410.12649","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Faster algorithms for growing collision-free convex polytopes in robot configuration space","venue":null,"work_id":"52c43f19-7bbd-4ec8-9259-ba9a2b628183","year":2024},"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":22,"source":"pdf_text","source_observed_at":"2026-06-27T00:09:30.656365Z"},"links":{"cited_paper":"/paper/2410.12649","citing_paper":"/paper/2606.18516"},"observation_digest":"sha256:718f3a2c0bee97cbf42af44bc3d1d51cfd742c52d4325078e5d80a894984b71d","observation_id":"c861c930-b98a-4706-bb82-5ae8731056c4","resolution":{"observed_at":"2026-06-27T00:10:15.915712Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.12649","last_updated":"2024-11-13T20:00:39Z","snapshot_observed_at":"2026-08-12T22:21:46.357774Z","submitted_at":"2024-10-16T15:13:27Z","title":"Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space","version":2},"cited_work":{"arxiv_id":"2410.12649","doi":"10.48550/arxiv.2410.12649","metadata_source":"arxiv_reference","pith_arxiv_id":"2410.12649","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Faster algorithms for growing collision-free convex polytopes in robot configuration space","venue":null,"work_id":"52c43f19-7bbd-4ec8-9259-ba9a2b628183","year":2024},"citing_paper":{"arxiv_id":"2606.22278","last_updated":"2026-06-21T00:11:46Z","snapshot_observed_at":"2026-08-07T05:45:40.967519Z","submitted_at":"2026-06-21T00:11:46Z","title":"Any-Body Guard: Universal Safeguarding for Manipulation Policies via Action Masking","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-26T10:59:44.035262Z"},"links":{"cited_paper":"/paper/2410.12649","citing_paper":"/paper/2606.22278"},"observation_digest":"sha256:dc41e5437725ba7509dd6bcbf2a4e3d1003700a3931bb9dedc8380a9e33044a8","observation_id":"84ed37fa-e796-4f87-beab-0f4d98a30521","resolution":{"observed_at":"2026-07-04T08:49:41.810077Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.12649","last_updated":"2024-11-13T20:00:39Z","snapshot_observed_at":"2026-08-12T22:21:46.357774Z","submitted_at":"2024-10-16T15:13:27Z","title":"Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.12649","snapshot_observed_at":"2026-08-08T06:08:32.373939Z","title":"Faster algorithms for growing collision-free c onvex poly- topes in robot configuration space,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-12T09:43:12.353809Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.373939Z"},"links":{"cited_paper":"/paper/2410.12649","citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:7484b3a33e31f4b9d40d710cfea083e72490faa5f643d04af26183fff3acceef","observation_id":"4f10724a-aa54-40d3-9ac4-84a72ff60e93","resolution":{"observed_at":"2026-08-08T06:08:32.373939Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2410.12649/citation-record","integrity":"/paper/2410.12649/integrity","json":"/paper/2410.12649/citation-record.json","paper":"/paper/2410.12649"},"outbound":[],"paper":{"arxiv_id":"2410.12649","last_updated":"2024-11-13T20:00:39Z","latest_version":2,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-12T22:21:46.357774Z","submitted_at":"2024-10-16T15:13:27Z","title":"Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 10 inbound Pith citation observations for arXiv:2410.12649."}