{"as_of":"2026-08-09T16:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a82adff3d001b21ca33568bcc00dde10138f3950a3f6f719bcb183b42715b5db","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-09T06:31:02.800959+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-09T08:25:50.599316Z","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:9ea3f373b45a0d030d5924150e48a09009bfc586981990cd58e0d4ee6e19e948","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-09T08:25:50.599316Z","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:295bbcafeeb1b835947ee36b5d8b2d692aba1c2e16ef4802beab8d3ce1258222","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-09T08:25:50.599316Z","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:64b08da02de9e630805771203255ef3d326d861c2361b0330e0e1eadf6d542f9","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-09T08:25:50.599316Z","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:680ed285505dee5745a8f59d14b8d97e36f6beb572d6bee91c5a5b8b61f485aa","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-09T08:25:50.599316Z","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:7a9feb5fae365e4e7a1f9ba3439f6674c650166dda284c253464d143dca549be","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-09T08:25:50.599316Z","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:89df602d7c94cf450f196afe0cac840646b50e20b2331f688008c77e108cb8b7","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-09T08:25:50.599316Z","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:4d1779d54b84546a98a4c5a952b0e832f4143d06f6f0872a05649ec12a79844a","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-09T08:25:50.599316Z","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:afb2cd0724c2aea8ae6127919dd8258e65f7cdd65be1f7516d304c73ca7528e1","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-09T08:25:50.599316Z","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:a64735e0792a91d8905215996a3ad4fef4962d8f426261ecb55aacc384b5e132","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-09T08:25:50.599316Z","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:7a0ef3766e50d3295a91c04ec294911866e8dba143fdcda0669a8197c1e90452","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-09T08:25:50.599316Z","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:cdb623d482e277caf9d2db398d865f4a56ca2bc7af8b3d9d93dca1b8840a6a4a","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-09T08:25:50.599316Z","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:1c6bcc1838c712fb08504acb3416c225db8a5d15e0fc1250d4b83bc320c57ab5","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-09T08:25:50.599316Z","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:3b08f6976242ef1673abae094307e085363d3639e0b15c2b36f0d5f80f52ef61","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-09T08:25:50.599316Z","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:12e7f02916b9e23b42cb531edb94ebb0d2baffe33d00d537e8d49a48f55a07ed","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-09T08:25:50.599316Z","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:5814a1cff0c880b35f896c8c12e45f215026c8d93d27ee145ae74ba08db438dc","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-09T08:25:50.599316Z","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:592500e7bb5ce90d92738ccffdf95ccc9d9b3f80f465d007ef646b72347cf04f","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-09T08:25:50.599316Z","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:aff6468d1784d5cfaafe8cb28a1e82cd3bc45322676b21c1ed9f4aac1c41146f","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-09T08:25:50.599316Z","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:0ae0df9355dfabf4553eabf5f57b86501ed3c512475d092804fd109b0ec9774a","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-09T08:25:50.599316Z","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:360c2133b4198fef85e385f66a779ecf97adcff8340752cb44e089e31949789c","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-09T08:25:50.599316Z","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:2becf1493397695e032afba0ccaf41cf02af0480d9fb38a8167be2c0b3b1f9b9","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-09T08:25:50.599316Z","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:d00f4b249f3db6caf3775f036413a169e3e4e36f81d8f34bc149571579af9a84","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-09T08:25:50.599316Z","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:d13cac67cff9fd2a0e01555bd03ecd53048055fda821c51da4088e66e985eb40","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-09T08:25:50.599316Z","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:a26748f14d95f2df96589cd11fe61f4e66aa09cc7922f96c17b62fb429b0f59f","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-09T08:25:50.599316Z","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:3d0d6fd70e06162f8fed575ea370835c7ee15a832d09c6f121c6d32278845c06","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-08-07T15:56:41.420981Z","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-09T08:25:50.599316Z","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:bb601fed3c019d1336c9940f94a05fbde3a8952622969ab3b9339eb71f2308f2","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-09T08:25:50.599316Z","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:f993b45ad563fd1d38e939c111c640a3b3b95f125bba5c36b7b4f6502cf9b8fc","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-09T08:25:50.599316Z","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:69b841dfac85d6c4b81d199e1c4e2730ac01ef626282061857046974e16aa78c","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-09T08:25:50.599316Z","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:6f486548f343655a66525e5ba17bf1c24f925c35d06c817eaa8bb222bf0d135a","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-09T08:25:50.599316Z","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:716548f2f1891efcc77fce0942cd3858a01be2bbfd74afd7ad145ad62df642da","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-09T08:25:50.599316Z","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:84420c4943b6d52098c235deede4bbffccb44e13e2e7c795b4bbaac6a92f0877","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-09T08:25:50.599316Z","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:7b7c372cb617ce06e81b71a91ed325f75a1447c50791aa2c059a07f463baf4fb","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-09T08:25:50.599316Z","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:ac9c6d2b8cef97d158ec40bc589d71cbb767f2c30771226622bb8ab8337d940d","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-09T08:25:50.599316Z","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:3ac8ceec3bbf3fa0a0a2f8184538f06eb4580715d3a52a371b32464e7129186e","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-09T08:25:50.599316Z","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:1d9f59052449c25e4e7c569ce58a0e59bba1bc426d1e0c1753420d77b5954f90","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-09T08:25:50.599316Z","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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:2511.03591."}