{"as_of":"2026-08-11T03:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7fb7ef6e99b035073666c61b181adc298315783b65ff66aa3fddf469836f932e","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-10T06:31:04.303077+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-09T16:50:21.000316Z","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-03T04:57:38.238971Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.05846","last_updated":"2024-09-02T20:06:03Z","snapshot_observed_at":"2026-08-07T17:37:09.996561Z","submitted_at":"2024-06-09T16:34:03Z","title":"Fast and Certifiable Trajectory Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.05846","snapshot_observed_at":"2026-08-09T16:50:21.000316Z","title":"Fast and certifiable trajectory optimiza- tion","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01055","last_updated":"2025-04-26T06:00:04Z","snapshot_observed_at":"2026-08-10T20:53:05.993538Z","submitted_at":"2025-02-03T05:01:39Z","title":"On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-09T16:50:21.000316Z"},"links":{"cited_paper":"/paper/2406.05846","citing_paper":"/paper/2502.01055"},"observation_digest":"sha256:13e4dca199eb96ff03f8e5cf976d0e5ed1cb1dc5f8131520deb07913c3626e02","observation_id":"38499929-080c-4b46-99f1-53df200df506","resolution":{"observed_at":"2026-08-09T16:50:21.000316Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.05846","last_updated":"2024-09-02T20:06:03Z","snapshot_observed_at":"2026-08-07T17:37:09.996561Z","submitted_at":"2024-06-09T16:34:03Z","title":"Fast and Certifiable Trajectory Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.05846","snapshot_observed_at":"2026-08-09T11:04:28.206654Z","title":"Fast and certifiable trajectory optimiza- tion","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.02829","last_updated":"2025-09-04T20:11:46Z","snapshot_observed_at":"2026-08-09T20:01:40.002068Z","submitted_at":"2025-02-05T02:13:51Z","title":"Global Contact-Rich Planning with Sparsity-Rich Semidefinite Relaxations","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T11:04:28.206654Z"},"links":{"cited_paper":"/paper/2406.05846","citing_paper":"/paper/2502.02829"},"observation_digest":"sha256:680e2a2a9771ae1c96e3a9fc7e0e222957d9691dfd5758a7f2da70f0a63afe30","observation_id":"27b83a86-e63c-4057-99bd-d4f45f49b7f3","resolution":{"observed_at":"2026-08-09T11:04:28.206654Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.05846","last_updated":"2024-09-02T20:06:03Z","snapshot_observed_at":"2026-08-07T17:37:09.996561Z","submitted_at":"2024-06-09T16:34:03Z","title":"Fast and Certifiable Trajectory Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.05846","snapshot_observed_at":"2026-08-08T22:06:07.667683Z","title":"Fast and certifiable trajectory optimiza- tion","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.667683Z"},"links":{"cited_paper":"/paper/2406.05846","citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:202e2629f85be929a965b64a036fb711c5c6ad71d197d2d80b843f90ec09513b","observation_id":"6e6e74b1-f081-4549-9c56-385ab9b13e3c","resolution":{"observed_at":"2026-08-08T22:06:07.667683Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.05846","last_updated":"2024-09-02T20:06:03Z","snapshot_observed_at":"2026-08-07T17:37:09.996561Z","submitted_at":"2024-06-09T16:34:03Z","title":"Fast and Certifiable Trajectory Optimization","version":3},"cited_work":{"arxiv_id":"2406.05846","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.05846","snapshot_observed_at":"2026-07-03T04:57:38.238971Z","title":"arXiv preprint arXiv:2406.05846 , year=","venue":null,"work_id":"b4136caa-e78f-445f-b8d2-960f3aaf13bf","year":null},"citing_paper":{"arxiv_id":"2606.10579","last_updated":"2026-06-09T08:45:08Z","snapshot_observed_at":"2026-08-08T06:26:51.054401Z","submitted_at":"2026-06-09T08:45:08Z","title":"LieIPM: Lie Group Interior Point Method for Direct Trajectory Optimization of Rigid Bodies","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-06-27T13:33:03.356383Z"},"links":{"cited_paper":"/paper/2406.05846","citing_paper":"/paper/2606.10579"},"observation_digest":"sha256:3db30d9635076f941a3591b69e950fe841b739e9f03aa2f4335e6fb20d4319e3","observation_id":"c4207108-9135-4977-a5ec-d3cdb75d5eaf","resolution":{"observed_at":"2026-07-03T04:57:38.240323Z","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":"2406.05846","last_updated":"2024-09-02T20:06:03Z","snapshot_observed_at":"2026-08-07T17:37:09.996561Z","submitted_at":"2024-06-09T16:34:03Z","title":"Fast and Certifiable Trajectory Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.05846","snapshot_observed_at":"2026-07-14T04:28:21.910782Z","title":"Fast and certifiable trajectory optimization,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11603","last_updated":"2026-07-13T14:27:47Z","snapshot_observed_at":"2026-08-06T23:14:56.198057Z","submitted_at":"2026-07-13T14:27:47Z","title":"WarpMPC: Large-Batch MPC on GPU via ADMM with Unrolled $LDL^\\top$ Factorization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-14T04:28:21.910782Z"},"links":{"cited_paper":"/paper/2406.05846","citing_paper":"/paper/2607.11603"},"observation_digest":"sha256:6b72920ca42d54f028e5a7b7f3eceeb5e7d787057da39a170987402b4e259ed6","observation_id":"378cf97a-0bd6-404c-bc7e-7cb1a8e0ee56","resolution":{"observed_at":"2026-07-14T04:28:21.910782Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2406.05846/citation-record","integrity":"/paper/2406.05846/integrity","json":"/paper/2406.05846/citation-record.json","paper":"/paper/2406.05846"},"outbound":[],"paper":{"arxiv_id":"2406.05846","last_updated":"2024-09-02T20:06:03Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T17:37:09.996561Z","submitted_at":"2024-06-09T16:34:03Z","title":"Fast and Certifiable Trajectory Optimization"},"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 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2406.05846."}