{"as_of":"2026-08-16T17:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:30e2555a924f2c01ff416371d61cbb5fa2177bf8391dfdc5ca652d9c37f1e24b","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-21T04:22:15.860850Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-26T05:46:24.349598Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-04T12:49:53.030715Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"cited_work":{"arxiv_id":"2605.20625","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.20625","snapshot_observed_at":"2026-07-04T12:49:53.030715Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","venue":"eess.SY","work_id":"5e6c972a-b457-495d-ac0d-ff3ac47e19ff","year":2026},"citing_paper":{"arxiv_id":"2606.23585","last_updated":"2026-06-22T16:49:53Z","snapshot_observed_at":"2026-08-10T01:26:38.747116Z","submitted_at":"2026-06-22T16:49:53Z","title":"Decentralized Autonomous Traffic Management through Corridor Networks","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-26T05:46:24.349598Z"},"links":{"cited_paper":"/paper/2605.20625","citing_paper":"/paper/2606.23585"},"observation_digest":"sha256:90bdcc71241f790e6580d8765d0bc68c1b7ffa5afa0ca9c86ef38ca2c8b4e2b3","observation_id":"5dbb2819-46f9-46cf-9f41-7871e12eb577","resolution":{"observed_at":"2026-07-04T12:49:53.031912Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2605.20625/citation-record","integrity":"/paper/2605.20625/integrity","json":"/paper/2605.20625/citation-record.json","paper":"/paper/2605.20625"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"(2025, 10) Compendium to FAA aerospace forecast FY 2025-2045 emerging aviation entrants: Unmanned aircraft systems and Advanced air mobility","venue":null,"work_id":"39e4faf0-9df1-4d16-90ae-30abf78fff00","year":2025},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:08f934b997f067f9335c482de36f555b4455ed552db406b14a7f1899488d48fd","observation_id":"d4ed4897-14df-4a6e-8805-22799edbb180","resolution":{"observed_at":"2026-05-21T04:24:33.766640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"84c4b16d-f782-479c-a3aa-af8328575e48","year":null},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:dbd12fbd010b55dd33e847f6afbb297f0f8c266a351a2d768c01f3d712b13268","observation_id":"c4e90ab3-dcc6-4aef-8ce4-5de15eee6486","resolution":{"observed_at":"2026-05-21T04:23:57.889888Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"Design and Evaluation of a Corridors-in-the-Sky Concept: The Benefits and Feasibility of Adding Highly Structured Routes to a Mixed Equipage Environment","venue":null,"work_id":"c9ad2a21-35f0-4249-826d-95daf112a67b","year":2012},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:d4853336e1c1d4722a762f847e0b657ce65475d47ec7ff089195913c16201628","observation_id":"eac671f1-df16-4e5a-9ce6-dd08715bc30f","resolution":{"observed_at":"2026-05-21T04:24:33.769323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"The Advanced Air Mobility National Strategy: A Bold Policy Vision for 2025–2035","venue":null,"work_id":"49e40804-bd8e-40e4-bc82-4895d393c989","year":2025},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:b640d71da3d24c664d769548f82e0acf47d1170c29b1a2833d21a7479b18da5d","observation_id":"22611eea-fa90-45db-9187-0ec943267140","resolution":{"observed_at":"2026-05-21T04:23:57.927258Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"SESAR Joint Undertaking|U-space CONOPS 4th Edition","venue":null,"work_id":"05419586-915b-46e0-9cba-7bca2a43190a","year":2023},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:11b6f52d662216facb7148473b84512d567e29c3e49fa58f1919c6a24e166634","observation_id":"b2a06855-b70d-4ab8-9da6-3039217fb7b0","resolution":{"observed_at":"2026-05-21T04:23:57.923271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"A quasi-dynamic air traffic assignment model for mitigating air traffic complexity and congestion for high-density UAM operations","venue":null,"work_id":"ac706c3c-2af4-4f1b-9250-0d4f808d007c","year":2023},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:60e14715045fcfa92459459c144cbf47db03e3059ee08d561f36e681ae328394","observation_id":"9d8f5d42-5d65-4f30-943e-80dddacc4a8b","resolution":{"observed_at":"2026-05-21T04:23:57.917860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"Decentralized Coordination of Autonomous Traffic Through Advanced Air Mobility Corridors","venue":null,"work_id":"769954c2-93b9-44d0-bc1e-54f27012d4b2","year":2026},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:341203461389bbfb6ee5f28336f8a0363b932ef64e452d6f7aa6b61c305a2b8e","observation_id":"62d8876a-4817-4b81-8c5c-a083bf7fcd15","resolution":{"observed_at":"2026-05-21T04:23:57.911722Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"Traf- fic management protocols for advanced air mobility","venue":null,"work_id":"8e06efef-80c3-43ea-8965-0b7b7d33725d","year":2023},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:31261d0dbe783a8dd8917211ba66abbf76b04db993df2b43b40b77eef0ade7b1","observation_id":"7b8b637b-161c-4def-8a72-dd307828bc44","resolution":{"observed_at":"2026-05-21T04:23:57.907979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"Introduction to TCAS II, Version 7.1","venue":null,"work_id":"c95b1640-fa34-4bec-919e-e257d96ea42a","year":2011},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:f726926ad4c5731f4ccf8bdf1b1aff369da68ea5c5f5b4329ad8a58e824e6e49","observation_id":"dd011e5c-8e10-4758-aa28-ff1960d28fb5","resolution":{"observed_at":"2026-05-21T04:23:57.909894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"Next-generation airborne collision avoidance system","venue":null,"work_id":"a36b9797-3903-4d94-8f58-55f0375560a2","year":2012},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:e88231d5c37287cf2e2ea048d677b723e7a3ca2487eb224b07a9a8bdff21b598","observation_id":"7b9f4715-d307-4d86-9ae1-658a6ccc664a","resolution":{"observed_at":"2026-05-21T04:23:57.913796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"Tactical conflict resolution in urban airspace for unmanned aerial vehicles operations using attention-based deep reinforcement learning","venue":null,"work_id":"754456dd-209f-4767-b14e-144dbe1322ae","year":2023},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:461d51880a9c192269526656f168beb02fe3dd5cef89695f8bb24ff763a98f97","observation_id":"54ddd4d5-1db5-4ae2-9225-992e93c4f5bd","resolution":{"observed_at":"2026-05-21T04:23:57.915866Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"Resolving Conflicting Constraints in Multi-Agent Reinforcement Learning with Layered Safety","venue":null,"work_id":"30fb7cf9-c4ff-4d2b-8d33-727f43aced23","year":2025},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:92872649bab12161a0cdb602c4d9833997f6a52361da95f6afa2a3053ba2bdb1","observation_id":"2f56c1c2-fb64-47a4-87ce-11406c7a5acd","resolution":{"observed_at":"2026-05-21T04:23:57.921608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07-06T02:31:49.277058Z","title":null,"venue":null,"work_id":"2b3ef240-b16e-41ef-8b79-f29aba4b8cb5","year":2002},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:4c8acdccd0563d2b35e8e70446fc7546570f41092c3f4fbc5f5de3a96a7284a6","observation_id":"ead5d236-2b4f-4438-83ac-b4b4c904c922","resolution":{"observed_at":"2026-05-21T04:23:57.919694Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"Efficiency and fairness in unmanned air traffic flow manage- ment","venue":null,"work_id":"4bb21d70-cd23-42b8-94e2-c60568bef3ec","year":2021},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:26ea45133814d8595ebea70f74d71877dccad52d942123e476fe82d50c291bd4","observation_id":"76cfda50-719c-42e7-93ba-5954bf0326d9","resolution":{"observed_at":"2026-05-21T04:24:33.763103Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"Hamilton-Jacobi multi-time reachability","venue":null,"work_id":"4f434839-0afc-460f-8a40-13228bcbe00d","year":2022},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:439365ceb0ec756658e8e98228266815990241246a60b0170d630fc2239927f2","observation_id":"c516a3b8-85a0-4717-82b1-4e49df486392","resolution":{"observed_at":"2026-05-21T04:24:33.807671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"TTR-Based Reward for Reinforcement Learn- ing with Implicit Model Priors","venue":null,"work_id":"d37f75cb-9e65-414e-a51a-a0bca341f49e","year":2020},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:5b6c778372d82363a8773488e954f94b9e75a5e99f171bd01b395079305362e5","observation_id":"97c6cd51-454b-4881-9f26-a0e08b2eef8e","resolution":{"observed_at":"2026-05-21T04:24:33.750024Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"Decentralized Control Synthesis for Air Traffic Management in Urban Air Mobility","venue":null,"work_id":"188121d4-5ac7-4c30-8fd4-b72b73c3ae76","year":2021},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:4bb9283c6e534ace32d2ceffe3b095fd7dbb8bdecde358a1ec5cafca828cd15e","observation_id":"dad64b80-8637-4905-ae8c-06e44811be01","resolution":{"observed_at":"2026-05-21T04:24:33.757441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"HMARL-CBF–Hierarchical Multi-Agent Rein- forcement Learning with Control Barrier Functions for Safety-Critical Autonomous Systems","venue":null,"work_id":"4c31e495-27e9-4cdb-a57b-f9b6d2e72fe0","year":2025},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:23df166e6ad36be11caa060def0de12bdee4f2f0e3f9219e03399489ea8c9d9c","observation_id":"02c832bf-2afb-4cdb-8366-48edf0ee1baf","resolution":{"observed_at":"2026-05-21T04:24:33.802828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2603.05762","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Combinatorial Safety-Critical Coordination of Multi-Agent Systems via Mixed- Integer Responsibility Allocation and Control Barrier Functions","venue":null,"work_id":"59c3657f-b911-4766-a9a4-5c03edfadf9f","year":2026},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:59b26dd844509105ebede578f2a38cea291db02ff85c963d8a4306fe7ef4ae35","observation_id":"6a2b1c3e-bf52-48e6-b655-c73f25374bad","resolution":{"observed_at":"2026-05-21T04:23:57.482595Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"Sastry,Nonlinear systems: analysis, stability, and control","venue":null,"work_id":"df2c1088-249e-4fad-8b1e-b15014cbf330","year":2013},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:f100d78bf22d317150be37c971fc6f6652a8a71c81fb4391508e7ba3af3b3ecd","observation_id":"822d0d43-02ed-4b75-b683-2d416a411d3d","resolution":{"observed_at":"2026-05-21T04:24:33.797667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"Data-Driven Safety Filters: Hamilton-Jacobi Reachability, Control Barrier Functions, and Predictive Methods for Uncertain Systems","venue":null,"work_id":"0a0a93ec-4e7f-4cf1-9048-43373d748d60","year":2023},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:8b1d855aebdf9f712977493116f9a337fbcfc1e85519e3b0f046422020f22fbf","observation_id":"f6d592b5-575d-42c4-9ed0-31c08441700f","resolution":{"observed_at":"2026-05-21T04:24:33.752444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"Aubin, A","venue":null,"work_id":"c89c1ef3-0575-453b-80d2-89c76fbdd634","year":2011},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:489a841cd8ef0a785abbf8337cbfc91f62971d56ff66fcb240bfb9cf2a7747d7","observation_id":"800e6c7b-0914-4ac2-b27c-ca78ad8a9878","resolution":{"observed_at":"2026-05-21T04:24:33.813555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"Bardi and I","venue":null,"work_id":"3e0f3904-7b38-476c-ac70-5faf1051446c","year":1997},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:72c5f281a26d5d31d4fa65b6f25993f2f4b0934942396c2fa85d3e5744fa9d78","observation_id":"26128551-4f5d-4df4-aa71-dc2595283c8e","resolution":{"observed_at":"2026-05-21T04:24:33.824847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"Reach-avoid problems with time-varying dynamics, targets and constraints","venue":null,"work_id":"d66f7f4a-9e52-42ed-aa63-56b1d59c5f26","year":2015},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:d54bdac60493ede70987db071666db3bf82304df74a4619b9d4fef439eb7e393","observation_id":"d46dc2a0-0979-4e82-88c3-4645eb238c8a","resolution":{"observed_at":"2026-05-21T04:24:33.821340Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"Deepreach: A deep learning approach to high-dimensional reachability","venue":null,"work_id":"de780245-2d58-47f4-82f3-d1bf52ddd02b","year":2021},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:5517588d02f87fd83d798e34896729e36adefbd41751ec5cc8e9621bbe7ad667","observation_id":"44364d73-29fb-408e-966a-b0fca64aadac","resolution":{"observed_at":"2026-05-21T04:24:33.805461Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"Control barrier function based quadratic programs for safety critical systems","venue":null,"work_id":"007a777a-1ca3-4f88-a073-62fe52241692","year":2016},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:60984135d87461f0acd1cba85a081e608f7652d2ac57c5fc05fe2edbf6f83861","observation_id":"d2b264eb-4c32-4602-b004-efae083c00f6","resolution":{"observed_at":"2026-05-21T04:24:33.800208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"Robust control barrier–value functions for safety-critical control","venue":null,"work_id":"fc676d15-ddc2-428d-b0b7-d201b1ca8bd2","year":2021},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:126c94db778636bfd541010cd76798d2dc2360b658f4dd9f5ab95bdcbda21430","observation_id":"6ca6c037-1cb1-4651-8f5c-aae42b782b74","resolution":{"observed_at":"2026-05-21T04:24:33.810445Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"Discrete GCBF Proximal Policy Optimization for Multi-agent Safe Optimal Control","venue":null,"work_id":"43102fba-8ddb-4189-9460-d33fd9fa8067","year":2025},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:b81af0de665e0f7900656e0c54c9d6d7ddaf69bce95feaa74ac10251f17042ff","observation_id":"b8cc6e09-ef87-4d33-b454-1b31c7b48ba0","resolution":{"observed_at":"2026-05-21T04:24:33.787297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"Safety with agency: Human-centered safety filter with application to ai-assisted motorsports","venue":null,"work_id":"a7744b49-d506-4989-a3ed-c601ec275a14","year":2025},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:6ba58efd793074e71cabce4cc7ddc5173406b534461e9afdcdf2883d9d47d58a","observation_id":"406a4046-4de7-4aec-ac7f-82d1abf3a768","resolution":{"observed_at":"2026-05-21T04:24:33.791448Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2310.17180","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A forward reachability perspective on robust control invariance and discount factors in reachability analysis","venue":null,"work_id":"bf2753dc-4fa5-4314-b126-333bc7ccc1f9","year":2023},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:2d899b3e57bc07f12f9170538a8658e0f839221f5807b503a33a5e6a080f0c5d","observation_id":"0856999e-3196-4af5-bbbc-16b54c92d07d","resolution":{"observed_at":"2026-05-21T04:23:57.479829Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"One- shot computation of reachable sets for differential games","venue":null,"work_id":"75385525-e133-4a5a-a171-c0b454107000","year":2013},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:440f7996fd40cb7cb67f469949ea634fbb216c0208784e918f60f0313309b44f","observation_id":"fb837ca7-f739-4bca-8f17-95b106659273","resolution":{"observed_at":"2026-05-21T04:24:33.794439Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"helperOC: Optimal Control Toolbox for Hamilton-Jacobi Reachability","venue":null,"work_id":"3b83d1d7-89b8-44af-a24d-b090eba66174","year":null},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:173fc871453805342b0c4c842b5d7aa0f283e94328f33c4addc390fd72e35040","observation_id":"c69925fe-1293-4461-bbcf-e4ba9db1fae2","resolution":{"observed_at":"2026-05-21T04:24:33.779393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"A New Measure of Rank Correlation","venue":null,"work_id":"87304625-1291-4bf7-9658-592be4d7a19d","year":1938},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:c6562070b57c0bb106bf9e74358cd9d0b49f994e61281dd4a0d7402b03592b08","observation_id":"9c9210ab-d5c4-47e8-82ea-c3d366fac451","resolution":{"observed_at":"2026-05-21T04:24:33.760158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"Joby Aviation - Official Website","venue":null,"work_id":"429530f8-a73c-4994-b396-bcbec47e4455","year":2026},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:1ca298d63af87b5dcd03483ba5dd23d0db15abf3c25c897c19a75cfd4b1d5a52","observation_id":"56a5183c-2d34-4f23-915f-a9abd884de8e","resolution":{"observed_at":"2026-05-21T04:24:33.776814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"Midnight eVTOL - Aircraft Performance Specs","venue":null,"work_id":"1e322176-8ada-4164-a4c2-9b374d6228a7","year":2026},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:b14b28b51526d0fdf9ca3405ce51ebb43cc0327fe28175e1e21bb74a26076a0e","observation_id":"adeb6c07-e5c3-49c9-9a67-ab9a49c7e6d1","resolution":{"observed_at":"2026-05-21T04:24:33.773129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"Wisk Aero - Our Aircraft","venue":null,"work_id":"bbcd35f9-5b8e-4f84-9202-579903562b22","year":2026},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:1a3b9cf19cd67c0f7012bcd5a2518e37ac4608447226a0b5f87d8cdcfb0d83db","observation_id":"a8a8a853-6c69-4c43-8d12-d17dd22d7305","resolution":{"observed_at":"2026-05-21T04:23:57.888044Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"Aeronautical Information Manual (AIM), Chapter 7: Safety of Flight, Section 7: Near Midair Collision Reporting","venue":null,"work_id":"25cf0b49-892b-4ba2-a15c-e1ce192f880b","year":null},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:a43dd035eae16401098337d84d3255c3f777171e2d8c5098702875d18288b55a","observation_id":"54d99edd-1c2b-4fe4-b96a-3a123348ce1a","resolution":{"observed_at":"2026-05-21T04:23:57.891890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"Safety Barrier Certificates for Collisions-Free Multirobot Systems","venue":null,"work_id":"319645ca-f86e-4871-bf89-2848e055ac15","year":2017},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:ece1b8ab68e28fd162f61a535368260bed8c8f4b22d7c6e7de07247ebb20c44b","observation_id":"a5993e78-b365-47d8-ad7a-22d1f37a66ba","resolution":{"observed_at":"2026-05-21T04:24:33.783888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-06-05T21:23:00.469572Z","title":"OSQP: An Operator Splitting Solver for Quadratic Programs","venue":null,"work_id":"fceacbeb-68a0-4a0e-9bb3-b1d8df0f3e9c","year":2020},"citing_paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-21T04:22:15.860850Z"},"links":{"citing_paper":"/paper/2605.20625"},"observation_digest":"sha256:1645df53475f58fdf5f0b93e8be6428e315511623e90399095faeef222d50831","observation_id":"c5de8048-d98f-40bd-a1df-239352c969ac","resolution":{"observed_at":"2026-05-21T04:23:57.925127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.20625","last_updated":"2026-05-20T02:16:49Z","latest_version":1,"primary_category":"eess.SY","snapshot_observed_at":"2026-08-14T02:20:37.904009Z","submitted_at":"2026-05-20T02:16:49Z","title":"Time-To-Reach Separation and Safety Filtering for Safe, Fair, and Efficient Multi-Agent Coordination"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":2,"verified_fuzzy":35},"total_outbound_references":39},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 1 inbound Pith citation observation for arXiv:2605.20625."}