{"as_of":"2026-08-11T17:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a0dd1cdbd2724cf0b6892d9233cb3ff58a3bfddd34d9a1b93058efba18895961","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-11T06:34:44.6726+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-11T15:14:09.431710Z","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-10T15:25:38.751283Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2106.09125","last_updated":"2021-06-16T20:55:18Z","snapshot_observed_at":"2026-08-11T11:29:51.938219Z","submitted_at":"2021-06-16T20:55:18Z","title":"Convex Optimization for Trajectory Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.09125","snapshot_observed_at":"2026-08-11T15:14:09.431710Z","title":"Convex optimization for trajectory generation,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.11270","last_updated":"2024-12-15T18:24:26Z","snapshot_observed_at":"2026-08-11T15:05:11.233260Z","submitted_at":"2024-12-15T18:24:26Z","title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T15:14:09.431710Z"},"links":{"cited_paper":"/paper/2106.09125","citing_paper":"/paper/2412.11270"},"observation_digest":"sha256:95669e26e45655001cc6f9a6d606d6108f59a7636e03183ed181191495cc4d1a","observation_id":"f2da54e1-b40d-461f-b969-0511252ab33c","resolution":{"observed_at":"2026-08-11T15:14:09.431710Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.09125","last_updated":"2021-06-16T20:55:18Z","snapshot_observed_at":"2026-08-11T11:29:51.938219Z","submitted_at":"2021-06-16T20:55:18Z","title":"Convex Optimization for Trajectory Generation","version":1},"cited_work":{"arxiv_id":"2106.09125","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.09125","snapshot_observed_at":"2026-08-10T15:25:38.751283Z","title":"Convex Optimization for Trajectory Generation","venue":"math.OC","work_id":"77e8bb2f-1b98-4e50-a155-bcabaecb732e","year":2021},"citing_paper":{"arxiv_id":"2501.14173","last_updated":"2025-01-24T01:49:46Z","snapshot_observed_at":"2026-08-11T04:14:46.216972Z","submitted_at":"2025-01-24T01:49:46Z","title":"Constrained Fuel and Time Optimal 6DOF Powered Descent Guidance Using Indirect Optimization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T15:25:37.922652Z"},"links":{"cited_paper":"/paper/2106.09125","citing_paper":"/paper/2501.14173"},"observation_digest":"sha256:a812a5f05edf4a390e41b2a8320490741174d47090a81376ffcc7bc6ccf42cb1","observation_id":"e5874bdd-a698-47c7-8b72-2a316cac106d","resolution":{"observed_at":"2026-08-10T15:25:38.756746Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2106.09125/citation-record","integrity":"/paper/2106.09125/integrity","json":"/paper/2106.09125/citation-record.json","paper":"/paper/2106.09125"},"outbound":[],"paper":{"arxiv_id":"2106.09125","last_updated":"2021-06-16T20:55:18Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-11T11:29:51.938219Z","submitted_at":"2021-06-16T20:55:18Z","title":"Convex Optimization for Trajectory Generation"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2106.09125."}