{"as_of":"2026-08-09T01:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e29dd6d1f617fbe4f1bd6952b711b39fe257246d3ee35269090513a259695630","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:24:22.196151Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-05T03:29:30.150948Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-05T03:30:38.651710Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.11021","last_updated":"2025-07-15T06:28:32Z","snapshot_observed_at":"2026-08-07T23:14:11.665960Z","submitted_at":"2025-07-15T06:28:32Z","title":"Approximate solutions to games of ordered preference","version":1},"cited_work":{"arxiv_id":"2507.11021","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.11021","snapshot_observed_at":"2026-07-05T03:30:38.651710Z","title":"Approximate solutions to games of ordered preference","venue":null,"work_id":"f5167901-2737-4af0-aa0d-68efbde033d3","year":2025},"citing_paper":{"arxiv_id":"2604.20428","last_updated":"2026-06-11T15:23:27Z","snapshot_observed_at":"2026-07-06T23:06:55.880484Z","submitted_at":"2026-04-22T10:49:09Z","title":"Lexicographic Minimum-Violation Motion Planning using Signal Temporal Logic","version":1},"reference_index":102,"source":"pdf_text","source_observed_at":"2026-05-10T00:12:28.536579Z"},"links":{"cited_paper":"/paper/2507.11021","citing_paper":"/paper/2604.20428"},"observation_digest":"sha256:c3678e4b04daadbb52fb84d420b965573bdb6d88e988f2182da8966b63da1ca3","observation_id":"4ebc0517-7e2a-4c6f-994b-12599adaf5ad","resolution":{"observed_at":"2026-05-10T00:14:46.663201Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.11021","last_updated":"2025-07-15T06:28:32Z","snapshot_observed_at":"2026-08-07T23:14:11.665960Z","submitted_at":"2025-07-15T06:28:32Z","title":"Approximate solutions to games of ordered preference","version":1},"cited_work":{"arxiv_id":"2507.11021","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.11021","snapshot_observed_at":"2026-07-05T03:30:38.651710Z","title":"Approximate solutions to games of ordered preference","venue":null,"work_id":"f5167901-2737-4af0-aa0d-68efbde033d3","year":2025},"citing_paper":{"arxiv_id":"2604.20428","last_updated":"2026-06-11T15:23:27Z","snapshot_observed_at":"2026-07-06T23:06:55.880484Z","submitted_at":"2026-04-22T10:49:09Z","title":"Lexicographic Minimum-Violation Motion Planning using Signal Temporal Logic","version":2},"reference_index":102,"source":"pdf_text","source_observed_at":"2026-07-05T03:29:30.150948Z"},"links":{"cited_paper":"/paper/2507.11021","citing_paper":"/paper/2604.20428"},"observation_digest":"sha256:48b29a799f7e249804b4d702831a585828d3f3a7db6177ddd685db3d6bd57a25","observation_id":"84bd7096-8bb2-4d11-8a4f-cad15d99ecec","resolution":{"observed_at":"2026-07-05T03:30:38.653788Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2507.11021/citation-record","integrity":"/paper/2507.11021/integrity","json":"/paper/2507.11021/citation-record.json","paper":"/paper/2507.11021"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1177/0048393","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:24:23.440269Z","title":"Mistakes about preferences in the social sciences,","venue":null,"work_id":"77caedaf-c8e1-48e1-83b2-9f9e9b216428","year":2011},"citing_paper":{"arxiv_id":"2507.11021","last_updated":"2025-07-15T06:28:32Z","snapshot_observed_at":"2026-08-07T23:14:11.665960Z","submitted_at":"2025-07-15T06:28:32Z","title":"Approximate solutions to games of ordered preference","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T17:24:19.552385Z"},"links":{"citing_paper":"/paper/2507.11021"},"observation_digest":"sha256:dc85d6edd019fd415de650715569b00226c03437e7cde2bb0a25b4392664061f","observation_id":"9bde7abd-df50-452b-bf9d-0be1ac31ae1c","resolution":{"observed_at":"2026-08-06T17:24:23.512419Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/lra.202","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:24:23.312702Z","title":"Posetal games: Efficiency, existence, and refinement of equilibria in games with prioritized metrics,","venue":null,"work_id":"b9ba52e6-74c4-41be-b4f7-56c11ea8b7e1","year":2022},"citing_paper":{"arxiv_id":"2507.11021","last_updated":"2025-07-15T06:28:32Z","snapshot_observed_at":"2026-08-07T23:14:11.665960Z","submitted_at":"2025-07-15T06:28:32Z","title":"Approximate solutions to games of ordered preference","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T17:24:19.615825Z"},"links":{"citing_paper":"/paper/2507.11021"},"observation_digest":"sha256:1d3e1ec786bf045778f4d5212e194f20b9f21e38928f8211c8355950b2989f9a","observation_id":"b5940d2b-ac86-48bf-9fe2-fa609a08b8af","resolution":{"observed_at":"2026-08-06T17:24:23.378365Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/icra.2017.7","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:24:23.190946Z","title":"Real-time distributed receding horizon motion planning and control for mobile multi-robot dynamic systems,","venue":null,"work_id":"a0caa02e-e83f-48aa-9cfe-83d506bcf4f8","year":2017},"citing_paper":{"arxiv_id":"2507.11021","last_updated":"2025-07-15T06:28:32Z","snapshot_observed_at":"2026-08-07T23:14:11.665960Z","submitted_at":"2025-07-15T06:28:32Z","title":"Approximate solutions to games of ordered preference","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T17:24:19.716157Z"},"links":{"citing_paper":"/paper/2507.11021"},"observation_digest":"sha256:339f67478fbd8e4529e83129f76cd0efd11ee9aa19165758c46eaf903c98079c","observation_id":"34f4f423-8308-4f49-ade0-4e793bf1805b","resolution":{"observed_at":"2026-08-06T17:24:23.239651Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:24:19.812642Z","title":"You can’t always get what you want: Games of ordered preference,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.11021","last_updated":"2025-07-15T06:28:32Z","snapshot_observed_at":"2026-08-07T23:14:11.665960Z","submitted_at":"2025-07-15T06:28:32Z","title":"Approximate solutions to games of ordered preference","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T17:24:19.812642Z"},"links":{"citing_paper":"/paper/2507.11021"},"observation_digest":"sha256:25c1a17bdcb56ac46f87e33f6d091ce219e84ddfff0f31f39eb6c0a436290b19","observation_id":"93928bdd-328b-4de0-b49c-77dced0d1b8f","resolution":{"observed_at":"2026-08-06T17:24:19.812642Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:24:19.891687Z","title":"Receding horizon games with coupling constraints for demand-side manage- ment,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.11021","last_updated":"2025-07-15T06:28:32Z","snapshot_observed_at":"2026-08-07T23:14:11.665960Z","submitted_at":"2025-07-15T06:28:32Z","title":"Approximate solutions to games of ordered preference","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T17:24:19.891687Z"},"links":{"citing_paper":"/paper/2507.11021"},"observation_digest":"sha256:223b0a17a668458b21908e165faa51a8430a37f9365993d355005e54210d9632","observation_id":"73ad1075-c5d0-4cbc-bfe1-b0c9c701f793","resolution":{"observed_at":"2026-08-06T17:24:19.891687Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.12165","last_updated":"2024-04-18T13:15:44Z","snapshot_observed_at":"2026-07-06T18:02:10.806722Z","submitted_at":"2024-04-18T13:15:44Z","title":"Stability Certificates for Receding Horizon Games","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.12165","snapshot_observed_at":"2026-08-06T17:24:19.958361Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.11021","last_updated":"2025-07-15T06:28:32Z","snapshot_observed_at":"2026-08-07T23:14:11.665960Z","submitted_at":"2025-07-15T06:28:32Z","title":"Approximate solutions to games of ordered preference","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T17:24:19.958361Z"},"links":{"cited_paper":"/paper/2404.12165","citing_paper":"/paper/2507.11021"},"observation_digest":"sha256:03cc5a8267a5c83626360fe4b1e10103c235af144a85d282e55e07e9399d76c1","observation_id":"e97278c3-6cbf-4211-81c3-a00e4c62ed90","resolution":{"observed_at":"2026-08-06T17:24:19.958361Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:24:20.044830Z","title":"Liability, ethics, and culture-aware behavior specification using rulebooks,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.11021","last_updated":"2025-07-15T06:28:32Z","snapshot_observed_at":"2026-08-07T23:14:11.665960Z","submitted_at":"2025-07-15T06:28:32Z","title":"Approximate solutions to games of ordered preference","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T17:24:20.044830Z"},"links":{"citing_paper":"/paper/2507.11021"},"observation_digest":"sha256:4c162e45eea406fbb82d6260aecf1d23cb9fa5722ab36e413fa6771c4ffa9e48","observation_id":"cd6d74e1-b783-46b7-95f5-b89a4a351db2","resolution":{"observed_at":"2026-08-06T17:24:20.044830Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.23919/acc50511.202","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:24:23.011560Z","title":"Minimum- violation planning for autonomous systems: Theoretical and practical considerations,","venue":null,"work_id":"1f5e6685-db68-471c-8db9-c1f022cf10c4","year":2021},"citing_paper":{"arxiv_id":"2507.11021","last_updated":"2025-07-15T06:28:32Z","snapshot_observed_at":"2026-08-07T23:14:11.665960Z","submitted_at":"2025-07-15T06:28:32Z","title":"Approximate solutions to games of ordered preference","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T17:24:20.119354Z"},"links":{"citing_paper":"/paper/2507.11021"},"observation_digest":"sha256:22048bf7da32e3a55a2363a662c46452013afd2db4b49162647535d1f12b9eb5","observation_id":"546810e0-c15a-4c4f-8ce5-04ec17431731","resolution":{"observed_at":"2026-08-06T17:24:23.071610Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.11199","last_updated":"2024-09-17T13:54:56Z","snapshot_observed_at":"2026-08-06T05:59:24.254565Z","submitted_at":"2024-09-17T13:54:56Z","title":"Optimization of Rulebooks via Asymptotically Representing Lexicographic Hierarchies for Autonomous Vehicles","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.11199","snapshot_observed_at":"2026-08-06T17:24:20.208621Z","title":"Penlington, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.11021","last_updated":"2025-07-15T06:28:32Z","snapshot_observed_at":"2026-08-07T23:14:11.665960Z","submitted_at":"2025-07-15T06:28:32Z","title":"Approximate solutions to games of ordered preference","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T17:24:20.208621Z"},"links":{"cited_paper":"/paper/2409.11199","citing_paper":"/paper/2507.11021"},"observation_digest":"sha256:bf571af7ecdb0bda9b6d4912bbae20d7362251377effb4b240dc5e1b1a7dbbb1","observation_id":"0cf8081e-213c-44c8-9ca2-64be645025ab","resolution":{"observed_at":"2026-08-06T17:24:20.208621Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:24:25.391900Z","title":"Solving mathematical programs with complementarity constraints arising in nonsmooth optimal control,","venue":null,"work_id":"3516e442-8451-4951-905d-d0311d876b0c","year":2024},"citing_paper":{"arxiv_id":"2507.11021","last_updated":"2025-07-15T06:28:32Z","snapshot_observed_at":"2026-08-07T23:14:11.665960Z","submitted_at":"2025-07-15T06:28:32Z","title":"Approximate solutions to games of ordered preference","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T17:24:20.273455Z"},"links":{"citing_paper":"/paper/2507.11021"},"observation_digest":"sha256:de6cfca859ba40169d042d29094b253f7f7f579d56d12e00fef3975d2d66707f","observation_id":"e4d2ecfe-82ab-4c91-8f65-8daddfae9f1b","resolution":{"observed_at":"2026-08-06T17:24:25.459218Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/tiv.20","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:24:22.816429Z","title":"Game theoretic application to intersection management: A literature review,","venue":null,"work_id":"a5a4b3e6-2a9d-4e33-9ccd-ace467df61e5","year":2024},"citing_paper":{"arxiv_id":"2507.11021","last_updated":"2025-07-15T06:28:32Z","snapshot_observed_at":"2026-08-07T23:14:11.665960Z","submitted_at":"2025-07-15T06:28:32Z","title":"Approximate solutions to games of ordered preference","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T17:24:20.340544Z"},"links":{"citing_paper":"/paper/2507.11021"},"observation_digest":"sha256:c3d4f9d6bb14823b92110f50fcb3558312d17d84683645279b3d40534e81affb","observation_id":"908cf33c-3920-4817-a595-5cd469c17dce","resolution":{"observed_at":"2026-08-06T17:24:22.900712Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:24:20.423491Z","title":"Multi- hypothesis interactions in game-theoretic motion planning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.11021","last_updated":"2025-07-15T06:28:32Z","snapshot_observed_at":"2026-08-07T23:14:11.665960Z","submitted_at":"2025-07-15T06:28:32Z","title":"Approximate solutions to games of ordered preference","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T17:24:20.423491Z"},"links":{"citing_paper":"/paper/2507.11021"},"observation_digest":"sha256:6a8d4c6ab76aeab7ecb6bf6d1c303ca1f8e55771294f95549b72141ea3fa5f61","observation_id":"8a7409f1-834d-4bff-a2b8-33e124f4bf76","resolution":{"observed_at":"2026-08-06T17:24:20.423491Z","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":"2022.32323","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:24:24.023235Z","title":"Maximum-entropy multi-agent dynamic games: Forward and inverse solutions,","venue":null,"work_id":"4453e4fc-e64e-491b-a4b7-5b6321c6fb87","year":2023},"citing_paper":{"arxiv_id":"2507.11021","last_updated":"2025-07-15T06:28:32Z","snapshot_observed_at":"2026-08-07T23:14:11.665960Z","submitted_at":"2025-07-15T06:28:32Z","title":"Approximate solutions to games of ordered preference","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T17:24:20.497550Z"},"links":{"citing_paper":"/paper/2507.11021"},"observation_digest":"sha256:accbbe644901e9988fbc1b45e0d242cc1d5ef35e1065102ac47c6f274a97323d","observation_id":"234abd2a-b7d2-4ae7-9961-44c775a8a0f7","resolution":{"observed_at":"2026-08-06T17:24:24.091829Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.15607/rss.2022.xviii.051","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:24:22.648749Z","title":"Learning mixed strategies in trajectory games,","venue":null,"work_id":"fce30944-ee87-4a00-84ce-96f02299b935","year":2022},"citing_paper":{"arxiv_id":"2507.11021","last_updated":"2025-07-15T06:28:32Z","snapshot_observed_at":"2026-08-07T23:14:11.665960Z","submitted_at":"2025-07-15T06:28:32Z","title":"Approximate solutions to games of ordered preference","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T17:24:20.781278Z"},"links":{"citing_paper":"/paper/2507.11021"},"observation_digest":"sha256:c6331682514f22e4f1fafb62461b3afe5dc699fc1e670a5da5f6c07569263d8c","observation_id":"9b788593-0a0d-4059-839d-c25eb7670df1","resolution":{"observed_at":"2026-08-06T17:24:22.709741Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2023.32808","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:24:23.731805Z","title":"Learning to play trajectory games against opponents with unknown objectives,","venue":null,"work_id":"05febd33-64a7-42a6-b4ae-879ed5798460","year":2023},"citing_paper":{"arxiv_id":"2507.11021","last_updated":"2025-07-15T06:28:32Z","snapshot_observed_at":"2026-08-07T23:14:11.665960Z","submitted_at":"2025-07-15T06:28:32Z","title":"Approximate solutions to games of ordered preference","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T17:24:20.859618Z"},"links":{"citing_paper":"/paper/2507.11021"},"observation_digest":"sha256:f0dfb0713f528834d2891c9b25e7f6bc08ebda5e1c3411a0ac1e85489e8b37cd","observation_id":"5b77c572-8750-47bc-a172-a50cf1d381f5","resolution":{"observed_at":"2026-08-06T17:24:23.779568Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:24:20.940873Z","title":"Game theory-based simultaneous prediction and planning for autonomous vehicle navigation in crowded environments,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.11021","last_updated":"2025-07-15T06:28:32Z","snapshot_observed_at":"2026-08-07T23:14:11.665960Z","submitted_at":"2025-07-15T06:28:32Z","title":"Approximate solutions to games of ordered preference","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T17:24:20.940873Z"},"links":{"citing_paper":"/paper/2507.11021"},"observation_digest":"sha256:77d266ad897d5ed133f2abc3adea4d92a6a9c6df5f937890826cf37d9ac85d0b","observation_id":"08e47e11-1310-4cca-8807-41d63c5f6f9e","resolution":{"observed_at":"2026-08-06T17:24:20.940873Z","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":"10.1109/itsc57777.2","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:24:22.534898Z","title":"An efficient game-theoretic planner for automated lane merging with multi-modal behavior understanding,","venue":null,"work_id":"6c0b3895-0798-4923-9ea8-7d17e54997f6","year":2022},"citing_paper":{"arxiv_id":"2507.11021","last_updated":"2025-07-15T06:28:32Z","snapshot_observed_at":"2026-08-07T23:14:11.665960Z","submitted_at":"2025-07-15T06:28:32Z","title":"Approximate solutions to games of ordered preference","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T17:24:21.024886Z"},"links":{"citing_paper":"/paper/2507.11021"},"observation_digest":"sha256:b73abee73fe88d81f99f821dd5078bd17a2a3e82b8220d52fc80b8cac7f57ca6","observation_id":"5f28a30c-b457-4a11-8e16-17dda7b3aff2","resolution":{"observed_at":"2026-08-06T17:24:22.575708Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:24:21.153720Z","title":"Receding horizon planning with rule hierarchies for autonomous vehicles,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.11021","last_updated":"2025-07-15T06:28:32Z","snapshot_observed_at":"2026-08-07T23:14:11.665960Z","submitted_at":"2025-07-15T06:28:32Z","title":"Approximate solutions to games of ordered preference","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T17:24:21.153720Z"},"links":{"citing_paper":"/paper/2507.11021"},"observation_digest":"sha256:4795895ee5350dad65264fc989e738af7d0109a11129167f67ee8025f2f7b946","observation_id":"979d36f0-e45c-44c2-8e98-709bb833ccea","resolution":{"observed_at":"2026-08-06T17:24:21.153720Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:24:21.287283Z","title":"Hierarchical game-theoretic planning for autonomous vehicles,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.11021","last_updated":"2025-07-15T06:28:32Z","snapshot_observed_at":"2026-08-07T23:14:11.665960Z","submitted_at":"2025-07-15T06:28:32Z","title":"Approximate solutions to games of ordered preference","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T17:24:21.287283Z"},"links":{"citing_paper":"/paper/2507.11021"},"observation_digest":"sha256:b05ce98cb9e18e1f9377f850fdf55e40f47469dcaba675a91b400422d425bcd0","observation_id":"d3ff13ab-eb9d-4c3f-b7ea-38dba1171575","resolution":{"observed_at":"2026-08-06T17:24:21.287283Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:24:21.363364Z","title":"Receding horizon control,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2507.11021","last_updated":"2025-07-15T06:28:32Z","snapshot_observed_at":"2026-08-07T23:14:11.665960Z","submitted_at":"2025-07-15T06:28:32Z","title":"Approximate solutions to games of ordered preference","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T17:24:21.363364Z"},"links":{"citing_paper":"/paper/2507.11021"},"observation_digest":"sha256:8e01f950f73bd46e86718ba1a69212219ffedb009df147e91bf980541cca1bb7","observation_id":"d77b2d8b-1372-401c-a4f0-288ad3a977d5","resolution":{"observed_at":"2026-08-06T17:24:21.363364Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:24:25.217344Z","title":"Peters,ParametricMCPs.jl2025,URL: https://github .com/JuliaGameTheoreticPlanning/ParametricMCPs .jl","venue":null,"work_id":"b858c6bf-8f46-4fcb-aa87-852a16e2ab6f","year":null},"citing_paper":{"arxiv_id":"2507.11021","last_updated":"2025-07-15T06:28:32Z","snapshot_observed_at":"2026-08-07T23:14:11.665960Z","submitted_at":"2025-07-15T06:28:32Z","title":"Approximate solutions to games of ordered preference","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T17:24:21.474852Z"},"links":{"citing_paper":"/paper/2507.11021"},"observation_digest":"sha256:99eafa95c7fe4843bca90e4fbd8e1f6e54bfd23c9aa4fc340309813696edd448","observation_id":"69a49ebe-217d-44f5-8625-3dfd0f82baf9","resolution":{"observed_at":"2026-08-06T17:24:25.283813Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:24:25.036244Z","title":"Fridovich-Keil,Smooth Game Theory","venue":null,"work_id":"1154b877-d8de-4567-9fb6-ceddc608ceca","year":2024},"citing_paper":{"arxiv_id":"2507.11021","last_updated":"2025-07-15T06:28:32Z","snapshot_observed_at":"2026-08-07T23:14:11.665960Z","submitted_at":"2025-07-15T06:28:32Z","title":"Approximate solutions to games of ordered preference","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T17:24:21.590451Z"},"links":{"citing_paper":"/paper/2507.11021"},"observation_digest":"sha256:e58826406b2c3e51a486ffd0e3da59a63d294de121f41af7283d7cec69b8d3bc","observation_id":"acb7e193-aa82-4999-9143-9fd573e6f231","resolution":{"observed_at":"2026-08-06T17:24:25.111011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:24:24.811794Z","title":null,"venue":null,"work_id":"0c180a98-1dff-444f-a505-5049063af2e7","year":2019},"citing_paper":{"arxiv_id":"2507.11021","last_updated":"2025-07-15T06:28:32Z","snapshot_observed_at":"2026-08-07T23:14:11.665960Z","submitted_at":"2025-07-15T06:28:32Z","title":"Approximate solutions to games of ordered preference","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T17:24:21.711180Z"},"links":{"citing_paper":"/paper/2507.11021"},"observation_digest":"sha256:11475b7d84f3c6da9597f0799b34581e4f841d4bf4818623ac0b0e1f58b3a353","observation_id":"b6254d20-c746-4bac-b93d-932da2366f25","resolution":{"observed_at":"2026-08-06T17:24:24.910309Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:24:21.829847Z","title":"Julia: A fresh approach to numerical computing,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.11021","last_updated":"2025-07-15T06:28:32Z","snapshot_observed_at":"2026-08-07T23:14:11.665960Z","submitted_at":"2025-07-15T06:28:32Z","title":"Approximate solutions to games of ordered preference","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T17:24:21.829847Z"},"links":{"citing_paper":"/paper/2507.11021"},"observation_digest":"sha256:8774406df3096b674835496462c7806f1aa2492e3e6cd16318d8fc89d2cef9b8","observation_id":"4061e939-9a19-43bd-b73b-5c8cf3de4719","resolution":{"observed_at":"2026-08-06T17:24:21.829847Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:24:24.607976Z","title":"Peters and A.-C","venue":null,"work_id":"26cd8d38-517b-48f3-8676-348665589ed5","year":null},"citing_paper":{"arxiv_id":"2507.11021","last_updated":"2025-07-15T06:28:32Z","snapshot_observed_at":"2026-08-07T23:14:11.665960Z","submitted_at":"2025-07-15T06:28:32Z","title":"Approximate solutions to games of ordered preference","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T17:24:21.967168Z"},"links":{"citing_paper":"/paper/2507.11021"},"observation_digest":"sha256:217a3dfc6dc4402c1457220d3cf5e4081dd8f25707d262b3d18c25d9444aefca","observation_id":"bc645b7a-1d10-42a0-8fb9-98400514529f","resolution":{"observed_at":"2026-08-06T17:24:24.687838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1080/10556789508805","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:24:22.358198Z","title":"The path solver: A nommonotone stabi- lization scheme for mixed complementarity problems,","venue":null,"work_id":"b855f444-c7c5-4019-867f-a59fd9bc390c","year":1995},"citing_paper":{"arxiv_id":"2507.11021","last_updated":"2025-07-15T06:28:32Z","snapshot_observed_at":"2026-08-07T23:14:11.665960Z","submitted_at":"2025-07-15T06:28:32Z","title":"Approximate solutions to games of ordered preference","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T17:24:22.074067Z"},"links":{"citing_paper":"/paper/2507.11021"},"observation_digest":"sha256:c901deb4928dc7d81715f247c3d4b7a260ef9158be627c18013724d1e499b6ac","observation_id":"c31f91bc-9fc1-4caf-8730-e5168fb2983b","resolution":{"observed_at":"2026-08-06T17:24:22.425059Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.5281/zenodo.15825235","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:24:22.294480Z","title":"de las Heras Molins, E","venue":null,"work_id":"c91e7d32-5bfd-4482-b0b7-21ab85ce8953","year":null},"citing_paper":{"arxiv_id":"2507.11021","last_updated":"2025-07-15T06:28:32Z","snapshot_observed_at":"2026-08-07T23:14:11.665960Z","submitted_at":"2025-07-15T06:28:32Z","title":"Approximate solutions to games of ordered preference","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T17:24:22.196151Z"},"links":{"citing_paper":"/paper/2507.11021"},"observation_digest":"sha256:b3a4db370e7c2d980a24c9f52cc7f5fc272b4b3a54ea9080aea0b818563b2494","observation_id":"5f8333fc-ac70-4f4a-89df-d4f2d47d0b40","resolution":{"observed_at":"2026-08-06T17:24:22.314993Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.11021","last_updated":"2025-07-15T06:28:32Z","latest_version":1,"primary_category":"eess.SY","snapshot_observed_at":"2026-08-07T23:14:11.665960Z","submitted_at":"2025-07-15T06:28:32Z","title":"Approximate solutions to games of ordered preference"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":4,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":10,"verified_fuzzy":3},"total_outbound_references":27},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 2 inbound Pith citation observations for arXiv:2507.11021."}