{"as_of":"2026-08-17T15:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:81867109b0c0df8889699b228294f446c3ce0c693661411e24057a0d80014b08","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:45:05.625419Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.10290/citation-record","integrity":"/paper/2507.10290/integrity","json":"/paper/2507.10290/citation-record.json","paper":"/paper/2507.10290"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:45:06.761227Z","title":null,"venue":null,"work_id":"e53fbda5-afe6-4873-b43b-236a49a67a67","year":2010},"citing_paper":{"arxiv_id":"2507.10290","last_updated":"2025-07-16T20:42:16Z","snapshot_observed_at":"2026-08-13T10:50:37.412264Z","submitted_at":"2025-07-14T13:56:59Z","title":"TOP: Trajectory Optimization via Parallel Optimization towards Constant Time Complexity","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T17:45:05.510490Z"},"links":{"citing_paper":"/paper/2507.10290"},"observation_digest":"sha256:b1fe71dd41b668af924138eb9b3690a633cf0d0ac12499d8adf2be4fc99040b7","observation_id":"b4b70df5-94a2-45c9-80a5-44319848f15e","resolution":{"observed_at":"2026-08-06T17:45:06.809142Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:45:05.515100Z","title":"Flatness and defect of non-linear systems: introductory theory and examples,","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2507.10290","last_updated":"2025-07-16T20:42:16Z","snapshot_observed_at":"2026-08-13T10:50:37.412264Z","submitted_at":"2025-07-14T13:56:59Z","title":"TOP: Trajectory Optimization via Parallel Optimization towards Constant Time Complexity","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T17:45:05.515100Z"},"links":{"citing_paper":"/paper/2507.10290"},"observation_digest":"sha256:5470fa42c2c3e56db343caffca71604ef6baf8883b3fffd2bcc9483797a8380d","observation_id":"98a348f9-dc85-445b-8399-ec3a13ccf1e2","resolution":{"observed_at":"2026-08-06T17:45:05.515100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:45:06.659746Z","title":"Minimum snap trajectory generation and control for quadrotors,","venue":null,"work_id":"90e5b131-eea8-40eb-b2ca-2d04ac846355","year":2011},"citing_paper":{"arxiv_id":"2507.10290","last_updated":"2025-07-16T20:42:16Z","snapshot_observed_at":"2026-08-13T10:50:37.412264Z","submitted_at":"2025-07-14T13:56:59Z","title":"TOP: Trajectory Optimization via Parallel Optimization towards Constant Time Complexity","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T17:45:05.518923Z"},"links":{"citing_paper":"/paper/2507.10290"},"observation_digest":"sha256:85b55e25d118872d418cf9bf6c8e1ccdee8f0ad19ff55a3a5db87093922389f8","observation_id":"7a05ba04-f7d4-4df1-a576-e1f21fc02016","resolution":{"observed_at":"2026-08-06T17:45:06.717633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:45:06.563589Z","title":"Trajectory generation for underactuated multirotor vehicles with tilted propellers via a flatness-based method,","venue":null,"work_id":"574483b1-87c7-4ddb-9751-687f2817a899","year":2019},"citing_paper":{"arxiv_id":"2507.10290","last_updated":"2025-07-16T20:42:16Z","snapshot_observed_at":"2026-08-13T10:50:37.412264Z","submitted_at":"2025-07-14T13:56:59Z","title":"TOP: Trajectory Optimization via Parallel Optimization towards Constant Time Complexity","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T17:45:05.523053Z"},"links":{"citing_paper":"/paper/2507.10290"},"observation_digest":"sha256:de729a2fd151b1b7bc17c846d81d49095f56232a9274be4e4f55ebbfa8cd37f0","observation_id":"42dfd87e-aedd-4d7e-9b0e-90acb46af5cb","resolution":{"observed_at":"2026-08-06T17:45:06.597917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:45:06.460568Z","title":"Finding locally optimal, collision-free trajectories with sequential con- vex optimization","venue":null,"work_id":"721d8d7e-e380-4acc-949c-df04e83cd03c","year":2013},"citing_paper":{"arxiv_id":"2507.10290","last_updated":"2025-07-16T20:42:16Z","snapshot_observed_at":"2026-08-13T10:50:37.412264Z","submitted_at":"2025-07-14T13:56:59Z","title":"TOP: Trajectory Optimization via Parallel Optimization towards Constant Time Complexity","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T17:45:05.527728Z"},"links":{"citing_paper":"/paper/2507.10290"},"observation_digest":"sha256:760bde0d907c68c7b2b50e1ea31b0f1e6c6ef0f1acbd2d73beef935f45b04fd3","observation_id":"fac74995-3764-4785-b11d-54594f732e7f","resolution":{"observed_at":"2026-08-06T17:45:06.506025Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:45:05.531963Z","title":"Geometrically constrained tra- jectory optimization for multicopters,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.10290","last_updated":"2025-07-16T20:42:16Z","snapshot_observed_at":"2026-08-13T10:50:37.412264Z","submitted_at":"2025-07-14T13:56:59Z","title":"TOP: Trajectory Optimization via Parallel Optimization towards Constant Time Complexity","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T17:45:05.531963Z"},"links":{"citing_paper":"/paper/2507.10290"},"observation_digest":"sha256:06c542174c5312e9afbfb16e5eb0848f57d02fb33acf4e53de3cb5819512b0fd","observation_id":"3ae9c994-1907-42d4-afcd-4b71f49844dd","resolution":{"observed_at":"2026-08-06T17:45:05.531963Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:45:06.368322Z","title":"Trajectory splitting: A distributed formulation for collision avoiding trajectory optimization,","venue":null,"work_id":"d35198c0-91a4-4edc-b528-2ff3ecb864ad","year":2021},"citing_paper":{"arxiv_id":"2507.10290","last_updated":"2025-07-16T20:42:16Z","snapshot_observed_at":"2026-08-13T10:50:37.412264Z","submitted_at":"2025-07-14T13:56:59Z","title":"TOP: Trajectory Optimization via Parallel Optimization towards Constant Time Complexity","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T17:45:05.536077Z"},"links":{"citing_paper":"/paper/2507.10290"},"observation_digest":"sha256:338ba28c24657cb08ef23cb95df2b665e0b961b1ef6adf813de710def6db8494","observation_id":"e07eff6d-4f5f-46bb-a6e2-ee0d20f634e0","resolution":{"observed_at":"2026-08-06T17:45:06.404554Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:45:05.539909Z","title":"Distributed optimization and statistical learning via the alternating direction method of multipliers,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2507.10290","last_updated":"2025-07-16T20:42:16Z","snapshot_observed_at":"2026-08-13T10:50:37.412264Z","submitted_at":"2025-07-14T13:56:59Z","title":"TOP: Trajectory Optimization via Parallel Optimization towards Constant Time Complexity","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T17:45:05.539909Z"},"links":{"citing_paper":"/paper/2507.10290"},"observation_digest":"sha256:cee82d39a4c58e09e6b994d8730058767763ca485d9de1098cc4dbc2e35d3297","observation_id":"baffa2fe-e47d-469d-824d-e0c6ac71c0a3","resolution":{"observed_at":"2026-08-06T17:45:05.539909Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:45:06.279720Z","title":"Ara*: Anytime a* with provable bounds on sub-optimality,","venue":null,"work_id":"c70b0d85-4e4a-4337-907d-4daa6d2b44d8","year":2003},"citing_paper":{"arxiv_id":"2507.10290","last_updated":"2025-07-16T20:42:16Z","snapshot_observed_at":"2026-08-13T10:50:37.412264Z","submitted_at":"2025-07-14T13:56:59Z","title":"TOP: Trajectory Optimization via Parallel Optimization towards Constant Time Complexity","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T17:45:05.543587Z"},"links":{"citing_paper":"/paper/2507.10290"},"observation_digest":"sha256:fca8961606ab9ebeda37266697f7fd131be9379394d848cef4087dfe5fd3cb66","observation_id":"462cf2b1-ea2a-4a14-9dbe-5daae5e5aec3","resolution":{"observed_at":"2026-08-06T17:45:06.307118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:45:05.551907Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.10290","last_updated":"2025-07-16T20:42:16Z","snapshot_observed_at":"2026-08-13T10:50:37.412264Z","submitted_at":"2025-07-14T13:56:59Z","title":"TOP: Trajectory Optimization via Parallel Optimization towards Constant Time Complexity","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T17:45:05.551907Z"},"links":{"citing_paper":"/paper/2507.10290"},"observation_digest":"sha256:5213e98a3df21f07aee6c28589ae666954d3b39e14e75caef7ec1bda5e04c8b5","observation_id":"cfe9dd43-34ff-4723-b801-9ab55bf469b0","resolution":{"observed_at":"2026-08-06T17:45:05.551907Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:45:06.162592Z","title":"Online graph pruning for pathfinding on grid maps,","venue":null,"work_id":"db42df8e-fc0c-4316-9e55-20b453e06c11","year":2011},"citing_paper":{"arxiv_id":"2507.10290","last_updated":"2025-07-16T20:42:16Z","snapshot_observed_at":"2026-08-13T10:50:37.412264Z","submitted_at":"2025-07-14T13:56:59Z","title":"TOP: Trajectory Optimization via Parallel Optimization towards Constant Time Complexity","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T17:45:05.556142Z"},"links":{"citing_paper":"/paper/2507.10290"},"observation_digest":"sha256:818760226d5e21d9fb59f6abe785c4c4e3b77aa0cd0bb72fd723af2112022190","observation_id":"fdc7a45f-69a5-4a2f-be17-2f7c83adc441","resolution":{"observed_at":"2026-08-06T17:45:06.203111Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:45:05.559819Z","title":"Prob- abilistic roadmaps for path planning in high-dimensional configuration spaces,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2507.10290","last_updated":"2025-07-16T20:42:16Z","snapshot_observed_at":"2026-08-13T10:50:37.412264Z","submitted_at":"2025-07-14T13:56:59Z","title":"TOP: Trajectory Optimization via Parallel Optimization towards Constant Time Complexity","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T17:45:05.559819Z"},"links":{"citing_paper":"/paper/2507.10290"},"observation_digest":"sha256:6054404f092c517de5faa5b6ef4a8c9e0afcabe63eaf8a41f338b947bcb9e74d","observation_id":"c4a9f5c3-9bd1-49d5-b0cd-207d36d8c384","resolution":{"observed_at":"2026-08-06T17:45:05.559819Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:45:05.563817Z","title":"Rapidly-exploring random trees: A new tool for path planning,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2507.10290","last_updated":"2025-07-16T20:42:16Z","snapshot_observed_at":"2026-08-13T10:50:37.412264Z","submitted_at":"2025-07-14T13:56:59Z","title":"TOP: Trajectory Optimization via Parallel Optimization towards Constant Time Complexity","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T17:45:05.563817Z"},"links":{"citing_paper":"/paper/2507.10290"},"observation_digest":"sha256:62af6720043fafce8210be482c70e082529a955d09109c747bdf6fac1a4416e2","observation_id":"c2258ae1-f467-4a44-a935-e6eb7e78aa0f","resolution":{"observed_at":"2026-08-06T17:45:05.563817Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:45:05.567478Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2507.10290","last_updated":"2025-07-16T20:42:16Z","snapshot_observed_at":"2026-08-13T10:50:37.412264Z","submitted_at":"2025-07-14T13:56:59Z","title":"TOP: Trajectory Optimization via Parallel Optimization towards Constant Time Complexity","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T17:45:05.567478Z"},"links":{"citing_paper":"/paper/2507.10290"},"observation_digest":"sha256:05104ae748d821dbc8e905f8dc2bb533fbd30e85e1b2f80463990eae6d09732e","observation_id":"17104e93-88cb-482a-9c1d-91f87148716e","resolution":{"observed_at":"2026-08-06T17:45:05.567478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:45:06.003294Z","title":"Gpops-ii: A matlab software for solving multiple-phase optimal control problems using hp-adaptive gaussian quadrature collocation methods and sparse nonlinear programming,","venue":null,"work_id":"258b9555-a7c6-418b-a6e2-503063a42c52","year":2014},"citing_paper":{"arxiv_id":"2507.10290","last_updated":"2025-07-16T20:42:16Z","snapshot_observed_at":"2026-08-13T10:50:37.412264Z","submitted_at":"2025-07-14T13:56:59Z","title":"TOP: Trajectory Optimization via Parallel Optimization towards Constant Time Complexity","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T17:45:05.571064Z"},"links":{"citing_paper":"/paper/2507.10290"},"observation_digest":"sha256:d99d6cedb828be9ba8f56c96911a83beec4266ebe616fd51a9ca9dc65e19ffd0","observation_id":"2a9dd953-225a-4166-ad7c-a4dc33462be9","resolution":{"observed_at":"2026-08-06T17:45:06.062242Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:45:05.865261Z","title":"d{2} slam: Decentralized and distributed collaborative visual-inertial slam system for aerial swarm,","venue":null,"work_id":"6b2ab404-114d-4e56-a610-c99c3245165a","year":2024},"citing_paper":{"arxiv_id":"2507.10290","last_updated":"2025-07-16T20:42:16Z","snapshot_observed_at":"2026-08-13T10:50:37.412264Z","submitted_at":"2025-07-14T13:56:59Z","title":"TOP: Trajectory Optimization via Parallel Optimization towards Constant Time Complexity","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T17:45:05.575197Z"},"links":{"citing_paper":"/paper/2507.10290"},"observation_digest":"sha256:0b479f12add084f484eecb1efd448a21a473f44841230aa4572634de2be8c9dc","observation_id":"b27a24fb-276b-4df3-8ee6-f60a1d188c82","resolution":{"observed_at":"2026-08-06T17:45:05.927398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:45:05.806879Z","title":"Introducing multi-convexity in path constrained trajectory optimization for mobile manipulators,","venue":null,"work_id":"e8105b27-6d9e-4d64-8a54-ece44ff266f0","year":2020},"citing_paper":{"arxiv_id":"2507.10290","last_updated":"2025-07-16T20:42:16Z","snapshot_observed_at":"2026-08-13T10:50:37.412264Z","submitted_at":"2025-07-14T13:56:59Z","title":"TOP: Trajectory Optimization via Parallel Optimization towards Constant Time Complexity","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T17:45:05.582474Z"},"links":{"citing_paper":"/paper/2507.10290"},"observation_digest":"sha256:49076d07f774c0c0279a34a01c5f2827517c65a080dd16a5d6134dc26ad29a9b","observation_id":"fb366ef0-df15-4610-bfef-4de176dba130","resolution":{"observed_at":"2026-08-06T17:45:05.822128Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:45:05.773272Z","title":"Long-horizon motion planning via sampling and segmented trajectory optimization,","venue":null,"work_id":"ba8c5306-8a2c-405e-aa39-f5cd50057bf2","year":2022},"citing_paper":{"arxiv_id":"2507.10290","last_updated":"2025-07-16T20:42:16Z","snapshot_observed_at":"2026-08-13T10:50:37.412264Z","submitted_at":"2025-07-14T13:56:59Z","title":"TOP: Trajectory Optimization via Parallel Optimization towards Constant Time Complexity","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T17:45:05.591185Z"},"links":{"citing_paper":"/paper/2507.10290"},"observation_digest":"sha256:050b0a5d18d01c35b54a6c915e61fe555684a5fc8e6e329f8756604b60b87976","observation_id":"ebecb29e-245e-4896-8f8b-51d3c0a8a4cb","resolution":{"observed_at":"2026-08-06T17:45:05.789204Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1610.02967","last_updated":"2018-04-06T10:52:50Z","snapshot_observed_at":"2026-08-14T21:36:14.589922Z","submitted_at":"2016-10-07T12:59:46Z","title":"Distributed Convex Optimization with Many Convex Constraints","version":2},"cited_work":{"arxiv_id":"1610.02967","doi":null,"metadata_source":"pith","pith_arxiv_id":"1610.02967","snapshot_observed_at":"2026-08-06T17:45:05.690758Z","title":"Distributed Convex Optimization with Many Convex Constraints","venue":"math.OC","work_id":"87954c75-1f56-4ab9-a2fe-17b2876d3618","year":2016},"citing_paper":{"arxiv_id":"2507.10290","last_updated":"2025-07-16T20:42:16Z","snapshot_observed_at":"2026-08-13T10:50:37.412264Z","submitted_at":"2025-07-14T13:56:59Z","title":"TOP: Trajectory Optimization via Parallel Optimization towards Constant Time Complexity","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T17:45:05.599176Z"},"links":{"cited_paper":"/paper/1610.02967","citing_paper":"/paper/2507.10290"},"observation_digest":"sha256:cfb7c4afede2c315081563cdbe541b7013f8e835cfde7392ce20aecf1a2d521a","observation_id":"d31a396c-2392-4de9-b44e-c4c7eba72ec7","resolution":{"observed_at":"2026-08-06T17:45:05.704424Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:45:05.740974Z","title":"On the limited memory bfgs method for large scale optimization,","venue":null,"work_id":"f6e00783-9f28-496d-bb69-987d4c5b3f8f","year":1989},"citing_paper":{"arxiv_id":"2507.10290","last_updated":"2025-07-16T20:42:16Z","snapshot_observed_at":"2026-08-13T10:50:37.412264Z","submitted_at":"2025-07-14T13:56:59Z","title":"TOP: Trajectory Optimization via Parallel Optimization towards Constant Time Complexity","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T17:45:05.607909Z"},"links":{"citing_paper":"/paper/2507.10290"},"observation_digest":"sha256:238c3449f7647655cd05b78726524f6ba823e95edb2628946210f209ab1ae67b","observation_id":"7738624a-021b-4650-bae8-170bdd7e6e1f","resolution":{"observed_at":"2026-08-06T17:45:05.754556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.02977","last_updated":"2025-03-18T04:19:43Z","snapshot_observed_at":"2026-08-16T14:12:38.999711Z","submitted_at":"2024-03-05T13:58:12Z","title":"Fast Iterative Region Inflation for Computing Large 2-D/3-D Convex Regions of Obstacle-Free Space","version":3},"cited_work":{"arxiv_id":"2403.02977","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.02977","snapshot_observed_at":"2026-08-06T17:45:05.661372Z","title":"Fast Iterative Region Inflation for Computing Large 2-D/3-D Convex Regions of Obstacle-Free Space","venue":"cs.RO","work_id":"273453ad-e6c4-48b9-b3df-b0b64b9270b3","year":2024},"citing_paper":{"arxiv_id":"2507.10290","last_updated":"2025-07-16T20:42:16Z","snapshot_observed_at":"2026-08-13T10:50:37.412264Z","submitted_at":"2025-07-14T13:56:59Z","title":"TOP: Trajectory Optimization via Parallel Optimization towards Constant Time Complexity","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T17:45:05.614972Z"},"links":{"cited_paper":"/paper/2403.02977","citing_paper":"/paper/2507.10290"},"observation_digest":"sha256:f999d3461ed36c41ef9931fd9ac508af9c2d946ba01587d31a8c59e1fd41d86c","observation_id":"ec77ff59-7be0-48f0-943b-5f65dbf5d01d","resolution":{"observed_at":"2026-08-06T17:45:05.672746Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:45:05.716974Z","title":"Fast-lio2: Fast direct lidar- inertial odometry,","venue":null,"work_id":"c57b9f43-dfb3-41a6-8684-162a5ae44036","year":2022},"citing_paper":{"arxiv_id":"2507.10290","last_updated":"2025-07-16T20:42:16Z","snapshot_observed_at":"2026-08-13T10:50:37.412264Z","submitted_at":"2025-07-14T13:56:59Z","title":"TOP: Trajectory Optimization via Parallel Optimization towards Constant Time Complexity","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T17:45:05.625419Z"},"links":{"citing_paper":"/paper/2507.10290"},"observation_digest":"sha256:1ef2565f88e9bf4951605a8486647f06f1339346cb249beac75e11790c3baa2a","observation_id":"68d5aed5-2c47-418b-9e6f-2469d0ba8a8b","resolution":{"observed_at":"2026-08-06T17:45:05.728155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.10290","last_updated":"2025-07-16T20:42:16Z","latest_version":2,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-13T10:50:37.412264Z","submitted_at":"2025-07-14T13:56:59Z","title":"TOP: Trajectory Optimization via Parallel Optimization towards Constant Time Complexity"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":2,"verified_fuzzy":12},"total_outbound_references":22},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 22 of 22 outbound references and 0 inbound Pith citation observations for arXiv:2507.10290."}