{"as_of":"2026-08-08T20:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0d42a66672550e9adf15e2af1f658d93b0c9f2bffd38d0f3ea770f2f21ef88a1","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:30:45.587408Z","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-07-06T18:45:05.905995Z","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-06T17:20:19.942689Z","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:4f8dc74dbcd2cda0eeaa273c6795883cd0bfcbefc28c6abf9443f821f5623179","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-07-06T18:45:05.905995Z","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-07T14:32:33.755841Z","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:37b8ebeeb6f60418bbc8f937aa36a07eb1ff25dbd5fa7aaade583df0e110a43b","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"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-07-06T18:45:05.905995Z","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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2407.08848."}