{"as_of":"2026-08-10T12:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ee577d30db8b700b758b2d865be81b456625d89627ffb38c922fef8dc102006f","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-06T17:30:48.050028Z","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-01T20:36:12.396563Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.08909","last_updated":"2024-10-11T15:29:49Z","snapshot_observed_at":"2026-08-10T02:08:08.701119Z","submitted_at":"2024-10-11T15:29:49Z","title":"Implicit Graph Search for Planning on Graphs of Convex Sets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.08909","snapshot_observed_at":"2026-08-06T17:30:48.050028Z","title":"Implicit graph search for planning on 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-10T02:08:35.421855Z","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":40,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:48.050028Z"},"links":{"cited_paper":"/paper/2410.08909","citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:1793898951f6c295a8ffd6d4bfd18fe82a2b97a500cd3809f213712d5e346011","observation_id":"cfc57827-1c77-4832-bb39-f2553b265562","resolution":{"observed_at":"2026-08-06T17:30:48.050028Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.08909","last_updated":"2024-10-11T15:29:49Z","snapshot_observed_at":"2026-08-10T02:08:08.701119Z","submitted_at":"2024-10-11T15:29:49Z","title":"Implicit Graph Search for Planning on Graphs of Convex Sets","version":1},"cited_work":{"arxiv_id":"2410.08909","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.08909","snapshot_observed_at":"2026-07-01T20:36:12.396563Z","title":"Impl icit graph search for planning on graphs of convex sets,","venue":null,"work_id":"00b36be1-bbf7-45fe-af76-c6c705947a17","year":2024},"citing_paper":{"arxiv_id":"2606.00842","last_updated":"2026-05-30T18:32:39Z","snapshot_observed_at":"2026-08-06T19:48:46.479242Z","submitted_at":"2026-05-30T18:32:39Z","title":"A Framework for Motion Planning with Temporal Logic Precedence Specifications via Augmented Graphs of Convex Sets","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-28T18:13:52.404253Z"},"links":{"cited_paper":"/paper/2410.08909","citing_paper":"/paper/2606.00842"},"observation_digest":"sha256:31dae74b05fe7e1e552eee4e857571be6fd516b4beaea5fbd7d8c62e1da8489c","observation_id":"033641c0-927c-478a-9102-e5228fb5de98","resolution":{"observed_at":"2026-07-01T20:36:12.398184Z","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":"2410.08909","last_updated":"2024-10-11T15:29:49Z","snapshot_observed_at":"2026-08-10T02:08:08.701119Z","submitted_at":"2024-10-11T15:29:49Z","title":"Implicit Graph Search for Planning on Graphs of Convex Sets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.08909","snapshot_observed_at":"2026-07-13T01:29:26.731593Z","title":"Natarajan, C","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09648","last_updated":"2026-07-10T17:46:32Z","snapshot_observed_at":"2026-08-07T05:50:47.998882Z","submitted_at":"2026-07-10T17:46:32Z","title":"B-spline Policy: Accelerating Manipulation Policies via B-spline Action Representations","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-13T01:29:26.731593Z"},"links":{"cited_paper":"/paper/2410.08909","citing_paper":"/paper/2607.09648"},"observation_digest":"sha256:4a999d5ab634db0f2a8622c5073284b9a0b35d68c70a0598f9954f3e6544491a","observation_id":"bd8151ae-f65e-464a-9e3f-2b2e35fe4fcf","resolution":{"observed_at":"2026-07-13T01:29:26.731593Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.08909","last_updated":"2024-10-11T15:29:49Z","snapshot_observed_at":"2026-08-10T02:08:08.701119Z","submitted_at":"2024-10-11T15:29:49Z","title":"Implicit Graph Search for Planning on Graphs of Convex Sets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.08909","snapshot_observed_at":"2026-08-01T22:37:41.927507Z","title":"Implicit graph search for planning on graphs of convex sets,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.15690","last_updated":"2026-07-17T07:06:38Z","snapshot_observed_at":"2026-08-10T02:08:34.802711Z","submitted_at":"2026-07-17T07:06:38Z","title":"Obstacle-Aware Four-Dimensional Trajectory Design for Urban Air Mobility","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T22:37:41.927507Z"},"links":{"cited_paper":"/paper/2410.08909","citing_paper":"/paper/2607.15690"},"observation_digest":"sha256:b6c6db06adb6b3dead6075af2979b08756e550c0531b82e769f2f550daafe552","observation_id":"8be47111-b266-4aac-98c1-d0d9eb42f930","resolution":{"observed_at":"2026-08-01T22:37:41.927507Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2410.08909/citation-record","integrity":"/paper/2410.08909/integrity","json":"/paper/2410.08909/citation-record.json","paper":"/paper/2410.08909"},"outbound":[],"paper":{"arxiv_id":"2410.08909","last_updated":"2024-10-11T15:29:49Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-10T02:08:08.701119Z","submitted_at":"2024-10-11T15:29:49Z","title":"Implicit Graph Search for Planning on 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-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:2410.08909."}