{"as_of":"2026-08-22T23:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dc7a53de29e13ae2f5a21b3a43128e6c0fa59c6a028e2675b1f8e1a3c449213a","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T10:13:23.305694Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-05T15:19:17.402754Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.08848","last_updated":"2024-12-09T19:06:53Z","snapshot_observed_at":"2026-08-19T22:09:11.633274Z","submitted_at":"2024-07-11T20:15:00Z","title":"GCS*: Forward Heuristic Search on Implicit Graphs of Convex Sets","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.08848","snapshot_observed_at":"2026-08-12T10:50:59.795652Z","title":"Gcs*: Forward heuristic search on implicit graphs of convex sets,","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-18T15:12:52.962434Z","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":32,"source":"pdf_text","source_observed_at":"2026-08-12T10:50:59.795652Z"},"links":{"cited_paper":"/paper/2407.08848","citing_paper":"/paper/2411.18913"},"observation_digest":"sha256:edf48e057916d7149be39d03fe61a768acd44d3f62b2389972df3f3e03ed8aa4","observation_id":"fea2f1bf-1e81-4bd5-955d-62e37ff2251f","resolution":{"observed_at":"2026-08-12T10:50:59.795652Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.08848","last_updated":"2024-12-09T19:06:53Z","snapshot_observed_at":"2026-08-19T22:09:11.633274Z","submitted_at":"2024-07-11T20:15:00Z","title":"GCS*: Forward Heuristic Search on Implicit Graphs of Convex Sets","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.08848","snapshot_observed_at":"2026-08-16T10:13:23.305694Z","title":"GCS*: Forward heuristic search on implicit graphs of convex sets","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.18978","last_updated":"2025-04-26T17:32:53Z","snapshot_observed_at":"2026-08-18T15:12:52.230435Z","submitted_at":"2025-04-26T17:32:53Z","title":"A biconvex method for minimum-time motion planning through sequences of convex sets","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T10:13:23.305694Z"},"links":{"cited_paper":"/paper/2407.08848","citing_paper":"/paper/2504.18978"},"observation_digest":"sha256:2c89b48d7d7ebfe5c032807dd8f88dbe9e8b1bf80d4b7cfefa81e0a33422fc5c","observation_id":"571e42bc-c691-4e9b-8e51-5de68492a552","resolution":{"observed_at":"2026-08-16T10:13:23.305694Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.08848","last_updated":"2024-12-09T19:06:53Z","snapshot_observed_at":"2026-08-19T22:09:11.633274Z","submitted_at":"2024-07-11T20:15:00Z","title":"GCS*: Forward Heuristic Search on Implicit Graphs of Convex Sets","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.08848","snapshot_observed_at":"2026-08-06T17:30:45.587408Z","title":"GCS*: Forward heuristic search on implicit graphs of convex sets","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-18T15:12:51.451522Z","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":8,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:45.587408Z"},"links":{"cited_paper":"/paper/2407.08848","citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:bd5e4e851387e63525466d7b05d004b77c55014b165f5fa57d6ce14f0508f0a5","observation_id":"8889b036-c53f-4814-8adc-e0aa1e718f5e","resolution":{"observed_at":"2026-08-06T17:30:45.587408Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.08848","last_updated":"2024-12-09T19:06:53Z","snapshot_observed_at":"2026-08-19T22:09:11.633274Z","submitted_at":"2024-07-11T20:15:00Z","title":"GCS*: Forward Heuristic Search on Implicit Graphs of Convex Sets","version":3},"cited_work":{"arxiv_id":"2407.08848","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.08848","snapshot_observed_at":"2026-08-05T15:19:17.402754Z","title":"GCS*: Forward Heuristic Search on Implicit Graphs of Convex Sets","venue":"cs.RO","work_id":"60763925-dc9f-4d3c-babf-cb0aff507074","year":2024},"citing_paper":{"arxiv_id":"2508.20095","last_updated":"2025-08-27T17:59:36Z","snapshot_observed_at":"2026-08-16T15:48:29.453132Z","submitted_at":"2025-08-27T17:59:36Z","title":"Discrete-Guided Diffusion for Scalable and Safe Multi-Robot Motion Planning","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-05T15:19:17.174620Z"},"links":{"cited_paper":"/paper/2407.08848","citing_paper":"/paper/2508.20095"},"observation_digest":"sha256:ae25cd608b9965c01ed3447275f453ded1d4d19af13f7e7cd4173ab8c228c223","observation_id":"44d318bc-850b-4316-a78c-dc9570c1e02a","resolution":{"observed_at":"2026-08-05T15:19:17.411102Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.08848","last_updated":"2024-12-09T19:06:53Z","snapshot_observed_at":"2026-08-19T22:09:11.633274Z","submitted_at":"2024-07-11T20:15:00Z","title":"GCS*: Forward Heuristic Search on Implicit Graphs of Convex Sets","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.08848","snapshot_observed_at":"2026-08-15T15:10:14.598915Z","title":"GCS*: Forward heuristic search on implicit graphs of convex sets,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.02834","last_updated":"2026-08-03T19:48:24Z","snapshot_observed_at":"2026-08-18T15:13:31.141691Z","submitted_at":"2026-08-03T19:48:24Z","title":"Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T15:10:14.598915Z"},"links":{"cited_paper":"/paper/2407.08848","citing_paper":"/paper/2608.02834"},"observation_digest":"sha256:51d8e961dc16a4c6c1b1ae927c241b85d7285c59d940da681077df2e7cf1f21a","observation_id":"c519a300-7869-4585-bce1-b5187767197d","resolution":{"observed_at":"2026-08-15T15:10:14.598915Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2407.08848/citation-record","integrity":"/paper/2407.08848/integrity","json":"/paper/2407.08848/citation-record.json","paper":"/paper/2407.08848"},"outbound":[],"paper":{"arxiv_id":"2407.08848","last_updated":"2024-12-09T19:06:53Z","latest_version":3,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-19T22:09:11.633274Z","submitted_at":"2024-07-11T20:15:00Z","title":"GCS*: Forward Heuristic Search on Implicit Graphs of Convex Sets"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2407.08848."}