{"as_of":"2026-08-07T03:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:105880c7b588e931f39648c91ef2ab6185fe8ed078df133d5114230c14734434","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T23:58:35.697166Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+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/2511.03591/citation-record","integrity":"/paper/2511.03591/integrity","json":"/paper/2511.03591/citation-record.json","paper":"/paper/2511.03591"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2011.02608","last_updated":"2020-11-05T01:47:23Z","snapshot_observed_at":"2026-08-05T14:05:37.341344Z","submitted_at":"2020-11-05T01:47:23Z","title":"Learning a Decentralized Multi-arm Motion Planner","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.02608","snapshot_observed_at":"2026-08-03T23:58:32.147366Z","title":"Learning a decentralized multi-arm motion planner,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:32.147366Z"},"links":{"cited_paper":"/paper/2011.02608","citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:a03790285f1ada1669490bb44f049d45f32ab41fc172a0bb325b9c553e555fdf","observation_id":"70347f6e-64ce-4a9b-bf63-bef91cd53410","resolution":{"observed_at":"2026-08-03T23:58:32.147366Z","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-03T23:58:32.262606Z","title":"Roboballet: Planning for multirobot reaching with graph neural networks and reinforcement learning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:32.262606Z"},"links":{"citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:00661e788ad604ff2e88e3302e8a5feb818304f60eae52dcd1dc35ef55d050ec","observation_id":"50fd68bb-617e-415c-8086-2cc15eaebd19","resolution":{"observed_at":"2026-08-03T23:58:32.262606Z","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-03T23:58:32.445295Z","title":"Dynamic collision and deadlock avoidance for multiple robotic manipulators,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:32.445295Z"},"links":{"citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:ffdd95ec68bf4ae443ef8381c55b6332b43843c737a9a3256903b28864eedddd","observation_id":"e8d0a6f5-e198-4884-92e7-0512ed401389","resolution":{"observed_at":"2026-08-03T23:58:32.445295Z","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-03T23:58:32.507631Z","title":"Synchronous minimum-time cooperative manipulation using distributed model predictive control,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:32.507631Z"},"links":{"citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:477077657f1a1a63a1573eb698df28ccedc0aa6eeba955ce17fbde4e60c8f5de","observation_id":"ffe074cf-1f0a-43d2-9315-06800074c19f","resolution":{"observed_at":"2026-08-03T23:58:32.507631Z","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-03T23:58:32.640650Z","title":"Long-horizon multi-robot rearrangement planning for construction assembly,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:32.640650Z"},"links":{"citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:75e05a6efbe247d253a5782bb1e1ea9e2618ff71d8cfb213c70f05373d264f5e","observation_id":"95dcb2b7-bacd-4986-9c29-1684242cebd3","resolution":{"observed_at":"2026-08-03T23:58:32.640650Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.12816","last_updated":"2023-10-19T15:12:21Z","snapshot_observed_at":"2026-07-06T16:35:40.224690Z","submitted_at":"2023-10-19T15:12:21Z","title":"Multi-Robot Local Motion Planning Using Dynamic Optimization Fabrics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.12816","snapshot_observed_at":"2026-08-03T23:58:32.767875Z","title":"Multi-robot local motion planning using dynamic optimization fabrics,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:32.767875Z"},"links":{"cited_paper":"/paper/2310.12816","citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:c17bcca7e358e7b1aebbeb33269fd51e8b6d964d92985c3d2610a35f2a70dced","observation_id":"d31ec428-f555-4104-b1d8-68745bb3e44d","resolution":{"observed_at":"2026-08-03T23:58:32.767875Z","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-03T23:58:32.876678Z","title":"Guaranteed real-time coop- erative collision avoidance for n-dof manipulators,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:32.876678Z"},"links":{"citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:66861a7f141cfc29cd5dc80a20757c96e86325e0a83c41fc67ff7b776faf0a7b","observation_id":"a6ec750d-864e-4e5c-9b80-1d733f17b939","resolution":{"observed_at":"2026-08-03T23:58:32.876678Z","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-03T23:58:33.002589Z","title":"Manipulation planning on constraint manifolds,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:33.002589Z"},"links":{"citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:e3643cda1c79e3112ad45ac7c6522bd3b8fa6d80cea4c172118924056e6b3a7f","observation_id":"a469fc65-1c77-4012-8b17-dc2582175ac2","resolution":{"observed_at":"2026-08-03T23:58:33.002589Z","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-03T23:58:33.111140Z","title":"Sampling-based methods for motion planning with constraints,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:33.111140Z"},"links":{"citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:5511d6851045341d2a6333fc65d5af5a66cdd72356bbe5a43030253034fcfd6b","observation_id":"dabdcb2e-46e3-4d94-93f3-408d0f26d640","resolution":{"observed_at":"2026-08-03T23:58:33.111140Z","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-03T23:58:33.256720Z","title":"Asymptotically-optimal path planning on manifolds","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:33.256720Z"},"links":{"citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:09688c2bf64b9dfc44089f10098d73ea43d4306abebb6f73eb55e56834598b9f","observation_id":"7bc5860a-7754-4c02-8336-397b5bdf93e3","resolution":{"observed_at":"2026-08-03T23:58:33.256720Z","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-03T23:58:33.368121Z","title":"Task space regions: A framework for pose-constrained manipulation planning,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:33.368121Z"},"links":{"citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:526f5740e666dc52f9cb0efc78a129d80476c7cb41c915a33a7cb9faba9551d0","observation_id":"00c5c771-193a-48e0-86f8-dba741563733","resolution":{"observed_at":"2026-08-03T23:58:33.368121Z","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-03T23:58:33.440763Z","title":"Tangent bundle rrt: A randomized algorithm for constrained motion planning,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:33.440763Z"},"links":{"citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:5dbece198278aa8b6e2e4f83e42c0bc91e5be82f3eff04df28d323fef93adbea","observation_id":"a16646af-37fd-4216-b8cc-01b28f576c63","resolution":{"observed_at":"2026-08-03T23:58:33.440763Z","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-03T23:58:33.681777Z","title":"A sampling-based path planner for dual-arm manipulation,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:33.681777Z"},"links":{"citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:639d5787b6c009511855520e4adeb1d26b372a3a8fb78d9682e522871098afe8","observation_id":"5071ac0d-8306-47d8-953b-f230caf0bfa6","resolution":{"observed_at":"2026-08-03T23:58:33.681777Z","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-03T23:58:33.874256Z","title":"Efficient multi-robot motion planning for manifold-constrained manipulators by randomized scheduling and informed path generation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:33.874256Z"},"links":{"citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:3dbfaa9a26e7a42a8421a0b9830277d30a6c477129e353d2c02af37f3a927317","observation_id":"a9ed372a-d196-4a53-ad8d-4c3126323f57","resolution":{"observed_at":"2026-08-03T23:58:33.874256Z","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-03T23:58:33.964643Z","title":"DeepReach: A deep learning approach to high-dimensional reachability,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:33.964643Z"},"links":{"citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:2a42e6f51e3086e6041a22924d1588f739508f7faa34ca93241db820a7611456","observation_id":"9c942ef4-e272-4be1-9e33-5b25f4b8a2bf","resolution":{"observed_at":"2026-08-03T23:58:33.964643Z","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-03T23:58:34.065987Z","title":"Bridging hamilton-jacobi safety analysis and reinforcement learning,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:34.065987Z"},"links":{"citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:4e9ac235668df2247987e772bc1b1c40a548671ff7d67e8347ecb155cbed2309","observation_id":"23de151a-d59c-4be5-85cb-b823713b4609","resolution":{"observed_at":"2026-08-03T23:58:34.065987Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.03228","last_updated":"2024-06-07T18:05:35Z","snapshot_observed_at":"2026-07-06T14:27:34.639236Z","submitted_at":"2022-12-06T18:53:34Z","title":"ISAACS: Iterative Soft Adversarial Actor-Critic for Safety","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.03228","snapshot_observed_at":"2026-08-03T23:58:34.121476Z","title":"Isaacs: Iterative soft adversarial actor-critic for safety,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:34.121476Z"},"links":{"cited_paper":"/paper/2212.03228","citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:1610fe86cb91507066665548f880d1c7ea2b8b479cb9eecf8adaf66e35b52ab0","observation_id":"8dccdb6c-666c-4fe1-937b-51d6ed9854f1","resolution":{"observed_at":"2026-08-03T23:58:34.121476Z","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-03T23:58:34.199843Z","title":"Safety and liveness guarantees through reach-avoid reinforcement learning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:34.199843Z"},"links":{"citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:194c5ec1d9dc7b69add74e0ecebc379fe8de4d1cd4c2f5a4a0de39227ee269fc","observation_id":"9e7e0eb4-ee71-47ae-bfa7-32698d6a3087","resolution":{"observed_at":"2026-08-03T23:58:34.199843Z","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-03T23:58:34.405599Z","title":"Parameterized fast and safe tracking (FaSTrack) using DeepReach,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:34.405599Z"},"links":{"citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:e8dcd6b0e8f2cde08449e408bf5233011251d488bec088e175afb8a9944f7197","observation_id":"37f3b202-36f6-4d19-a171-98334bb657f1","resolution":{"observed_at":"2026-08-03T23:58:34.405599Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.13940","last_updated":"2026-07-02T05:55:32Z","snapshot_observed_at":"2026-08-06T16:10:34.946356Z","submitted_at":"2025-07-18T14:12:56Z","title":"NeHMO: Neural Hamilton-Jacobi Reachability Learning for Decentralized Safe Multi-Arm Motion Planning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.13940","snapshot_observed_at":"2026-08-03T23:58:34.692462Z","title":"Nehmo: Neural hamilton-jacobi reachability learning for decentralized safe multi-agent motion planning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:34.692462Z"},"links":{"cited_paper":"/paper/2507.13940","citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:58198c2f641908419815fe992fd36a550819adf14a4d41c4a460c4497b910edb","observation_id":"c146ab0e-9193-4dff-8077-b682767d501b","resolution":{"observed_at":"2026-08-03T23:58:34.692462Z","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-03T23:58:34.823041Z","title":"Constrained nonlinear kaczmarz projection on intersections of manifolds for coor- dinated multi-robot mobile manipulation,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:34.823041Z"},"links":{"citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:431f3a1d812e3cd6f8631ba62c710fd88661e3b1f39a5267a379dfc51c22c09f","observation_id":"8e78b7a9-bff7-459a-90b3-39bc32700a6f","resolution":{"observed_at":"2026-08-03T23:58:34.823041Z","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-03T23:58:34.990218Z","title":"On infusing reachability-based safety assurance within planning frameworks for human-robot vehicle interactions,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:34.990218Z"},"links":{"citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:c5f71a0498c8946776ed6b7e58acd1f1f8cc4908b4dae3655104c9986468e094","observation_id":"e92c41ca-031e-46c3-ab2c-bf6342230679","resolution":{"observed_at":"2026-08-03T23:58:34.990218Z","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-03T23:58:35.139127Z","title":"Multi-vehicle collision avoidance via hamilton-jacobi reachability and mixed integer program- ming,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:35.139127Z"},"links":{"citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:95525a5fec909e25cc452c174f0eaa68b46932a30a30156fc3a0f0fa34b2d0f0","observation_id":"76deac23-acb8-4019-82fa-72c021d2cb92","resolution":{"observed_at":"2026-08-03T23:58:35.139127Z","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-03T23:58:35.207313Z","title":"Provably safe and scalable multivehicle trajectory planning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:35.207313Z"},"links":{"citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:730a02f8cf84231c3e6b471765d76ad305fc3afb0cc097fa38355b061b9991a5","observation_id":"14ae2920-c1d1-4e99-a427-3161a939a180","resolution":{"observed_at":"2026-08-03T23:58:35.207313Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.03830","last_updated":"2025-05-04T04:46:16Z","snapshot_observed_at":"2026-07-06T21:19:58.642378Z","submitted_at":"2025-05-04T04:46:16Z","title":"Bridging Model Predictive Control and Deep Learning for Scalable Reachability Analysis","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.03830","snapshot_observed_at":"2026-08-03T23:58:35.234717Z","title":"Bridging model predictive control and deep learning for scalable reachability analysis,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:35.234717Z"},"links":{"cited_paper":"/paper/2505.03830","citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:5930501012964a4b9dc81bf74af6cf7b56ea42e2049a7c840cf8706cb65a6693","observation_id":"9a08ad40-fb74-4cf4-beea-b6a17cd14b2c","resolution":{"observed_at":"2026-08-03T23:58:35.234717Z","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-03T23:58:35.294448Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:35.294448Z"},"links":{"citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:99aaf2ed5bb43feb1b658288b3e7330ea7697396ecbc56f99cb2a8daf56b0e10","observation_id":"602c193b-9b12-4c64-ba91-5fd6cd3afff8","resolution":{"observed_at":"2026-08-03T23:58:35.294448Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1410.6445","last_updated":"2014-10-28T23:42:18Z","snapshot_observed_at":"2026-07-06T03:58:18.329666Z","submitted_at":"2014-10-23T18:29:26Z","title":"Reach-Avoid Problems with Time-Varying Dynamics, Targets and Constraints","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1410.6445","snapshot_observed_at":"2026-08-03T23:58:35.347055Z","title":"Reach-avoid problems with time-varying dynamics, targets and constraints,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:35.347055Z"},"links":{"cited_paper":"/paper/1410.6445","citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:bf8afac8d9708691fa1c69415db731fe682fde5b1a26029b7545257019d2898e","observation_id":"859fd1b9-d260-483e-9280-38aca77ac025","resolution":{"observed_at":"2026-08-03T23:58:35.347055Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1709.07523","last_updated":"2017-09-21T21:44:43Z","snapshot_observed_at":"2026-07-06T06:00:47.253151Z","submitted_at":"2017-09-21T21:44:43Z","title":"Hamilton-Jacobi Reachability: A Brief Overview and Recent Advances","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.07523","snapshot_observed_at":"2026-08-03T23:58:35.412709Z","title":"Hamilton-jacobi reachability: A brief overview and recent advances,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:35.412709Z"},"links":{"cited_paper":"/paper/1709.07523","citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:0028acb3333f4f2c986155a973bd2aac7c5c525fe894a96945e021d5a3130ebb","observation_id":"08c1ed8a-a02e-4879-b1d6-d068dd111aaa","resolution":{"observed_at":"2026-08-03T23:58:35.412709Z","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-03T23:58:35.465092Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:35.465092Z"},"links":{"citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:5b80588e9b29b1797fbb6deab6c4c82041d39ab2fdb9d24c3de45db9c0795406","observation_id":"29810877-e29a-45d3-8b1b-885a1b625a91","resolution":{"observed_at":"2026-08-03T23:58:35.465092Z","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-03T23:58:35.491465Z","title":"On the implementation of an interior- point filter line-search algorithm for large-scale nonlinear program- ming,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:35.491465Z"},"links":{"citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:f8d7f8f0d27260e5784a85a6d4a52dae2f9aad393dd0bd89d8bb080d711199f5","observation_id":"ecd41d4b-ef1d-497a-a641-65df8b0d5efa","resolution":{"observed_at":"2026-08-03T23:58:35.491465Z","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-03T23:58:35.558149Z","title":"Safe Planning for Articulated Robots Using Reachability-based Obstacle Avoidance With Spheres,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:35.558149Z"},"links":{"citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:387fbc4e4a70ef93ad1d88af5764229416d3130feccd2b814623cbc18468a8e2","observation_id":"da1f19c2-e6f6-4e56-98c0-b280aec238ae","resolution":{"observed_at":"2026-08-03T23:58:35.558149Z","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-03T23:58:35.657004Z","title":"trimesh","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:35.657004Z"},"links":{"citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:dc47ead58ecdcd95a11b0dd926f9ca427bf48cbc00d893fc448744a28cc9bb54","observation_id":"2f56cc47-6cdd-460e-9655-5335cb36fab0","resolution":{"observed_at":"2026-08-03T23:58:35.657004Z","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-03T23:58:35.697166Z","title":"Verification of neural reachable tubes via scenario optimization and conformal prediction,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:35.697166Z"},"links":{"citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:965a87d8e7398e24584707e42ba23d051c95d4e4cf3b9a22f7199a2873306061","observation_id":"36f16d04-90a8-40ea-943f-553bdf5830f2","resolution":{"observed_at":"2026-08-03T23:58:35.697166Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.03390","last_updated":"2020-12-06T22:57:51Z","snapshot_observed_at":"2026-07-06T10:21:11.124678Z","submitted_at":"2020-12-06T22:57:51Z","title":"On Infusing Reachability-Based Safety Assurance within Planning Frameworks for Human-Robot Vehicle Interactions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.03390","snapshot_observed_at":"2026-08-03T23:58:35.057771Z","title":"Available: https://arxiv.org/abs/2012.03390","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-03T23:58:35.057771Z"},"links":{"cited_paper":"/paper/2012.03390","citing_paper":"/paper/2511.03591"},"observation_digest":"sha256:ff485434f2edd7a6c3a8dfe4d90bf2c793173755962571022e4fa30d81b4a663","observation_id":"a40a9a2c-28c2-469a-a390-37a82f95c875","resolution":{"observed_at":"2026-08-03T23:58:35.057771Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2511.03591","last_updated":"2026-07-01T04:58:59Z","latest_version":2,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-03T23:58:31.584348Z","submitted_at":"2025-11-05T16:11:12Z","title":"Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":34,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":34},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:2511.03591."}