{"as_of":"2026-08-21T10:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a78a04261a0746e2e80195ea1c942f96a92b3b334886d167464ae5e19e006703","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:51:53.771805Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.02599/citation-record","integrity":"/paper/2505.02599/integrity","json":"/paper/2505.02599/citation-record.json","paper":"/paper/2505.02599"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:51:53.652408Z","title":"How machine learning informs ride-hailing services: A survey,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.02599","last_updated":"2025-05-05T12:10:11Z","snapshot_observed_at":"2026-08-21T04:46:48.111055Z","submitted_at":"2025-05-05T12:10:11Z","title":"Maximal Compatibility Matching for Preference-Aware Ride-Hailing Systems","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T00:51:53.652408Z"},"links":{"citing_paper":"/paper/2505.02599"},"observation_digest":"sha256:0e1a7125d6f7d1b0482a99fa19902fd6196283d18ee82fa0bc32d1c1be8ffa33","observation_id":"7f2235ac-4605-419d-b890-36873f1684b8","resolution":{"observed_at":"2026-08-16T00:51:53.652408Z","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-16T00:51:54.155217Z","title":"Epoxy resins market—growth, trends, covid-19 im- pact, and forecasts (2022–2027),","venue":null,"work_id":"5b8bfa1d-0378-449a-be1f-1373cff8848e","year":2022},"citing_paper":{"arxiv_id":"2505.02599","last_updated":"2025-05-05T12:10:11Z","snapshot_observed_at":"2026-08-21T04:46:48.111055Z","submitted_at":"2025-05-05T12:10:11Z","title":"Maximal Compatibility Matching for Preference-Aware Ride-Hailing Systems","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T00:51:53.658008Z"},"links":{"citing_paper":"/paper/2505.02599"},"observation_digest":"sha256:c1f83a363d787b57172e188a5f215dd16f8f9d6f693a2415198b038d53079a1b","observation_id":"02e5fe71-ad88-49fd-bdb8-395167f29444","resolution":{"observed_at":"2026-08-16T00:51:54.160390Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T00:51:54.139858Z","title":"Analysis and control of autonomous mobility-on-demand systems,","venue":null,"work_id":"a4dc435b-36ea-4447-9d3e-08cf741ef05f","year":2022},"citing_paper":{"arxiv_id":"2505.02599","last_updated":"2025-05-05T12:10:11Z","snapshot_observed_at":"2026-08-21T04:46:48.111055Z","submitted_at":"2025-05-05T12:10:11Z","title":"Maximal Compatibility Matching for Preference-Aware Ride-Hailing Systems","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T00:51:53.662637Z"},"links":{"citing_paper":"/paper/2505.02599"},"observation_digest":"sha256:1d0e5b7ebb727a91e97e78b2a538364e107884fb4e56585e61607b8e37414532","observation_id":"2e3a3ba8-340b-4344-815d-9bbae9b8f49a","resolution":{"observed_at":"2026-08-16T00:51:54.144762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T00:51:53.667451Z","title":"Dynamic supply-demand balancing policy for cmod fleet,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.02599","last_updated":"2025-05-05T12:10:11Z","snapshot_observed_at":"2026-08-21T04:46:48.111055Z","submitted_at":"2025-05-05T12:10:11Z","title":"Maximal Compatibility Matching for Preference-Aware Ride-Hailing Systems","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T00:51:53.667451Z"},"links":{"citing_paper":"/paper/2505.02599"},"observation_digest":"sha256:9367fded036799783b57df117adef3295af899d185cb48dcf639c98e39f83ed9","observation_id":"d532a97c-533f-4f38-95f2-54103b023387","resolution":{"observed_at":"2026-08-16T00:51:53.667451Z","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-16T00:51:53.672658Z","title":"Vehicle rebalancing for mobility-on-demand systems with ride-sharing,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.02599","last_updated":"2025-05-05T12:10:11Z","snapshot_observed_at":"2026-08-21T04:46:48.111055Z","submitted_at":"2025-05-05T12:10:11Z","title":"Maximal Compatibility Matching for Preference-Aware Ride-Hailing Systems","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T00:51:53.672658Z"},"links":{"citing_paper":"/paper/2505.02599"},"observation_digest":"sha256:54ecdd0ad0ad310b035a41d482678cee00ce07ad133a4d504b8740a1e0dd5645","observation_id":"e148eb3e-c543-482e-b5bf-eb6073595de1","resolution":{"observed_at":"2026-08-16T00:51:53.672658Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.00093","last_updated":"2023-12-29T23:02:34Z","snapshot_observed_at":"2026-08-18T20:26:03.718316Z","submitted_at":"2023-12-29T23:02:34Z","title":"Fairness-Enhancing Vehicle Rebalancing in the Ride-hailing System","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.00093","snapshot_observed_at":"2026-08-16T00:51:53.677552Z","title":"Fairness- enhancing vehicle rebalancing in the ride-hailing system,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.02599","last_updated":"2025-05-05T12:10:11Z","snapshot_observed_at":"2026-08-21T04:46:48.111055Z","submitted_at":"2025-05-05T12:10:11Z","title":"Maximal Compatibility Matching for Preference-Aware Ride-Hailing Systems","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T00:51:53.677552Z"},"links":{"cited_paper":"/paper/2401.00093","citing_paper":"/paper/2505.02599"},"observation_digest":"sha256:fc7b196251dfef0c3faf10e150e45ffaeac137afd243c75825c3154f6c703b08","observation_id":"c3251bd6-c056-4ed3-8244-66c8bb4587fa","resolution":{"observed_at":"2026-08-16T00:51:53.677552Z","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-16T00:51:53.683200Z","title":"Ensuring service fairness in taxi fleet man- agement,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.02599","last_updated":"2025-05-05T12:10:11Z","snapshot_observed_at":"2026-08-21T04:46:48.111055Z","submitted_at":"2025-05-05T12:10:11Z","title":"Maximal Compatibility Matching for Preference-Aware Ride-Hailing Systems","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T00:51:53.683200Z"},"links":{"citing_paper":"/paper/2505.02599"},"observation_digest":"sha256:296b93480d071a658865646d50690b4dec4668a6e6fd562190d2f0812badd225","observation_id":"580515ea-b248-4df5-9850-641f5114a96c","resolution":{"observed_at":"2026-08-16T00:51:53.683200Z","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-16T00:51:54.095523Z","title":"On re-balancing self-interested agents in ride-sourcing transportation networks,","venue":null,"work_id":"5618a2d5-a2f7-41b1-b7b0-e5dce771b722","year":2019},"citing_paper":{"arxiv_id":"2505.02599","last_updated":"2025-05-05T12:10:11Z","snapshot_observed_at":"2026-08-21T04:46:48.111055Z","submitted_at":"2025-05-05T12:10:11Z","title":"Maximal Compatibility Matching for Preference-Aware Ride-Hailing Systems","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T00:51:53.687924Z"},"links":{"citing_paper":"/paper/2505.02599"},"observation_digest":"sha256:1007ddcafe31ad2d0d06f3590a8135fe34d3cca8bc8bd3e961f57d078f020c61","observation_id":"9a08cf1e-4fb2-4c44-b2f1-39805aaa4c73","resolution":{"observed_at":"2026-08-16T00:51:54.100501Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.08238","last_updated":"2024-07-11T07:28:40Z","snapshot_observed_at":"2026-08-20T10:31:06.032946Z","submitted_at":"2024-07-11T07:28:40Z","title":"Integrated User Matching and Pricing in Round-Trip Car-Sharing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.08238","snapshot_observed_at":"2026-08-16T00:51:53.692733Z","title":"Integrated user matching and pricing in round-trip car-sharing,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.02599","last_updated":"2025-05-05T12:10:11Z","snapshot_observed_at":"2026-08-21T04:46:48.111055Z","submitted_at":"2025-05-05T12:10:11Z","title":"Maximal Compatibility Matching for Preference-Aware Ride-Hailing Systems","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T00:51:53.692733Z"},"links":{"cited_paper":"/paper/2407.08238","citing_paper":"/paper/2505.02599"},"observation_digest":"sha256:21e0b50f017dd555a2c37eff8c645a0126e87e086889c0de02fe1b28073d938c","observation_id":"1ac68207-665d-4439-b11f-091504cbeedf","resolution":{"observed_at":"2026-08-16T00:51:53.692733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.16632","last_updated":"2026-07-12T08:02:12Z","snapshot_observed_at":"2026-08-15T10:56:53.688364Z","submitted_at":"2024-12-21T13:56:00Z","title":"Vehicle Rebalancing Under Adherence Uncertainty","version":3},"cited_work":{"arxiv_id":"2412.16632","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.16632","snapshot_observed_at":"2026-08-16T00:51:53.846830Z","title":"Vehicle Rebalancing Under Adherence Uncertainty","venue":"eess.SY","work_id":"1116e37b-967c-4199-afb6-b21f4df16954","year":2024},"citing_paper":{"arxiv_id":"2505.02599","last_updated":"2025-05-05T12:10:11Z","snapshot_observed_at":"2026-08-21T04:46:48.111055Z","submitted_at":"2025-05-05T12:10:11Z","title":"Maximal Compatibility Matching for Preference-Aware Ride-Hailing Systems","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T00:51:53.697761Z"},"links":{"cited_paper":"/paper/2412.16632","citing_paper":"/paper/2505.02599"},"observation_digest":"sha256:ed0306f50a421e6bf23514b2d4361d986b5fbd6644df2a255cecd2055732ed4c","observation_id":"980d7545-6200-4d69-8d27-6b704e5b3683","resolution":{"observed_at":"2026-08-16T00:51:53.853218Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T00:51:54.080285Z","title":"A survey of algorithms for the generalized assignment problem,","venue":null,"work_id":"d837fc1c-5ee5-4368-bbff-6c41fde57896","year":1992},"citing_paper":{"arxiv_id":"2505.02599","last_updated":"2025-05-05T12:10:11Z","snapshot_observed_at":"2026-08-21T04:46:48.111055Z","submitted_at":"2025-05-05T12:10:11Z","title":"Maximal Compatibility Matching for Preference-Aware Ride-Hailing Systems","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T00:51:53.702851Z"},"links":{"citing_paper":"/paper/2505.02599"},"observation_digest":"sha256:97589e031106109e8c04cd20122ab91e1cec51f71f680864d1123f1f3ba1b9ad","observation_id":"4ba0a263-e7af-4e48-a989-f6d193f8b4f0","resolution":{"observed_at":"2026-08-16T00:51:54.085267Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T00:51:53.707249Z","title":"The hungarian method for the assignment problem,","venue":null,"work_id":null,"year":1955},"citing_paper":{"arxiv_id":"2505.02599","last_updated":"2025-05-05T12:10:11Z","snapshot_observed_at":"2026-08-21T04:46:48.111055Z","submitted_at":"2025-05-05T12:10:11Z","title":"Maximal Compatibility Matching for Preference-Aware Ride-Hailing Systems","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T00:51:53.707249Z"},"links":{"citing_paper":"/paper/2505.02599"},"observation_digest":"sha256:000c22fccd13452274085b880f595e07abf232e5220c78ebd6164a3e20bb0d43","observation_id":"ace87c05-4bb2-4378-a5d7-e2f74f1efeee","resolution":{"observed_at":"2026-08-16T00:51:53.707249Z","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-16T00:51:53.711712Z","title":"Dynamic pricing and matching in ride-hailing platforms,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.02599","last_updated":"2025-05-05T12:10:11Z","snapshot_observed_at":"2026-08-21T04:46:48.111055Z","submitted_at":"2025-05-05T12:10:11Z","title":"Maximal Compatibility Matching for Preference-Aware Ride-Hailing Systems","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T00:51:53.711712Z"},"links":{"citing_paper":"/paper/2505.02599"},"observation_digest":"sha256:0710f0a19562d38067b2b8cb89168e78012d5ca7daa79b6a6e50e948b0f6ad6d","observation_id":"2c68afda-4dbc-4aaf-ae1f-8b850c73e1a2","resolution":{"observed_at":"2026-08-16T00:51:53.711712Z","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-16T00:51:54.045551Z","title":"Two-stage stochastic matching and pricing with applications to ride hailing,","venue":null,"work_id":"d5243a57-d38c-4af9-87d5-d5a2ab92fb4f","year":2024},"citing_paper":{"arxiv_id":"2505.02599","last_updated":"2025-05-05T12:10:11Z","snapshot_observed_at":"2026-08-21T04:46:48.111055Z","submitted_at":"2025-05-05T12:10:11Z","title":"Maximal Compatibility Matching for Preference-Aware Ride-Hailing Systems","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T00:51:53.716109Z"},"links":{"citing_paper":"/paper/2505.02599"},"observation_digest":"sha256:4cced99f5deb299d271c34d2bc5c4d55404218f5ee43f46f9f86af74b723ee5c","observation_id":"0814b162-4fd1-4946-affb-73b2e69fc74a","resolution":{"observed_at":"2026-08-16T00:51:54.050499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T00:51:54.029968Z","title":"Robust matching-integrated vehicle rebalancing in ride-hailing system with uncertain demand,","venue":null,"work_id":"76adc287-5762-48b2-bc87-e3ee3e4359ef","year":2021},"citing_paper":{"arxiv_id":"2505.02599","last_updated":"2025-05-05T12:10:11Z","snapshot_observed_at":"2026-08-21T04:46:48.111055Z","submitted_at":"2025-05-05T12:10:11Z","title":"Maximal Compatibility Matching for Preference-Aware Ride-Hailing Systems","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T00:51:53.720589Z"},"links":{"citing_paper":"/paper/2505.02599"},"observation_digest":"sha256:7c3a5401418f15dcdad44b368a9be689b8958634525b2f9e2cd0bb460caab3ff","observation_id":"f06954a5-27be-4106-8ed3-f5da8fae1e8d","resolution":{"observed_at":"2026-08-16T00:51:54.035004Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.03526","last_updated":"2018-08-09T04:03:08Z","snapshot_observed_at":"2026-08-18T17:00:33.850293Z","submitted_at":"2018-08-09T04:03:08Z","title":"Maximum Weight Online Matching with Deadlines","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.03526","snapshot_observed_at":"2026-08-16T00:51:53.725043Z","title":"Maximum weight online matching with deadlines,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.02599","last_updated":"2025-05-05T12:10:11Z","snapshot_observed_at":"2026-08-21T04:46:48.111055Z","submitted_at":"2025-05-05T12:10:11Z","title":"Maximal Compatibility Matching for Preference-Aware Ride-Hailing Systems","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T00:51:53.725043Z"},"links":{"cited_paper":"/paper/1808.03526","citing_paper":"/paper/2505.02599"},"observation_digest":"sha256:c80454893047126e00fe21977756c8a546133a741d8141f5f75435403e7cd53c","observation_id":"00d5bab2-2b62-492c-b198-fdbdf1d9fd38","resolution":{"observed_at":"2026-08-16T00:51:53.725043Z","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-16T00:51:54.014468Z","title":"Deep dispatching: A deep reinforcement learning approach for vehicle dispatching on on- line ride-hailing platform,","venue":null,"work_id":"894e747d-1590-4b9c-831a-c56872f8cc3b","year":2022},"citing_paper":{"arxiv_id":"2505.02599","last_updated":"2025-05-05T12:10:11Z","snapshot_observed_at":"2026-08-21T04:46:48.111055Z","submitted_at":"2025-05-05T12:10:11Z","title":"Maximal Compatibility Matching for Preference-Aware Ride-Hailing Systems","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T00:51:53.730120Z"},"links":{"citing_paper":"/paper/2505.02599"},"observation_digest":"sha256:4a4718bd9c15514c5d047f61476f082d8dc1524e9597eaea83d136cd3da30202","observation_id":"fb5905c7-7043-40bc-b7cd-4fbb3f1a63b5","resolution":{"observed_at":"2026-08-16T00:51:54.019299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.06228","last_updated":"2019-02-17T09:08:52Z","snapshot_observed_at":"2026-08-14T17:15:22.734755Z","submitted_at":"2019-02-17T09:08:52Z","title":"Optimizing Online Matching for Ride-Sourcing Services with Multi-Agent Deep Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"1902.06228","doi":null,"metadata_source":"pith","pith_arxiv_id":"1902.06228","snapshot_observed_at":"2026-08-16T00:51:53.807118Z","title":"Optimizing Online Matching for Ride-Sourcing Services with Multi-Agent Deep Reinforcement Learning","venue":"cs.MA","work_id":"8f0d81c2-64b8-40c2-a8bd-9bf63dd8c876","year":2019},"citing_paper":{"arxiv_id":"2505.02599","last_updated":"2025-05-05T12:10:11Z","snapshot_observed_at":"2026-08-21T04:46:48.111055Z","submitted_at":"2025-05-05T12:10:11Z","title":"Maximal Compatibility Matching for Preference-Aware Ride-Hailing Systems","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T00:51:53.734528Z"},"links":{"cited_paper":"/paper/1902.06228","citing_paper":"/paper/2505.02599"},"observation_digest":"sha256:bd3cc030752e6dcf8b406b5da7e8b6cad357db4266fdab96eb0ad338ec7da8f8","observation_id":"f32682ea-9efc-4537-94fd-760a41c1102b","resolution":{"observed_at":"2026-08-16T00:51:53.814238Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T00:51:53.999522Z","title":"Multi-agent reinforcement learning for order-dispatching via order-vehicle distribution matching,","venue":null,"work_id":"11f6216c-0504-4a9a-b042-43ad60a648f9","year":2019},"citing_paper":{"arxiv_id":"2505.02599","last_updated":"2025-05-05T12:10:11Z","snapshot_observed_at":"2026-08-21T04:46:48.111055Z","submitted_at":"2025-05-05T12:10:11Z","title":"Maximal Compatibility Matching for Preference-Aware Ride-Hailing Systems","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T00:51:53.739447Z"},"links":{"citing_paper":"/paper/2505.02599"},"observation_digest":"sha256:8501b479e0c2063f341be940f370f9cf7a920e50c7a56b4bcb1ff7d7a868a4d3","observation_id":"3a573bf3-b397-4d01-b6c0-ab6c182b7887","resolution":{"observed_at":"2026-08-16T00:51:54.004549Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T00:51:53.744176Z","title":null,"venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2505.02599","last_updated":"2025-05-05T12:10:11Z","snapshot_observed_at":"2026-08-21T04:46:48.111055Z","submitted_at":"2025-05-05T12:10:11Z","title":"Maximal Compatibility Matching for Preference-Aware Ride-Hailing Systems","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T00:51:53.744176Z"},"links":{"citing_paper":"/paper/2505.02599"},"observation_digest":"sha256:abf941553debfd8362391fb77c24ecd8100fcd545d5431267d44096ae2b45c87","observation_id":"bfd8af65-a798-460f-ba61-5961b190d283","resolution":{"observed_at":"2026-08-16T00:51:53.744176Z","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-16T00:51:53.972873Z","title":"Hybrid choice models: Progress and challenges,","venue":null,"work_id":"e05291a2-a413-4d08-84b1-99fcdb15e8df","year":2002},"citing_paper":{"arxiv_id":"2505.02599","last_updated":"2025-05-05T12:10:11Z","snapshot_observed_at":"2026-08-21T04:46:48.111055Z","submitted_at":"2025-05-05T12:10:11Z","title":"Maximal Compatibility Matching for Preference-Aware Ride-Hailing Systems","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T00:51:53.748881Z"},"links":{"citing_paper":"/paper/2505.02599"},"observation_digest":"sha256:cd29056f5866a54cdc5207ade1b12201e0d46ecac0c71440958b5f606c7a135d","observation_id":"4879c4a2-b95a-44cf-9399-ddc14eac32b4","resolution":{"observed_at":"2026-08-16T00:51:53.978427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T00:51:53.956699Z","title":"Matching algorithm for im- proving ride-sharing by incorporating route splits and social factors,","venue":null,"work_id":"ee174500-6ead-478b-ba06-6c459e6554f6","year":2020},"citing_paper":{"arxiv_id":"2505.02599","last_updated":"2025-05-05T12:10:11Z","snapshot_observed_at":"2026-08-21T04:46:48.111055Z","submitted_at":"2025-05-05T12:10:11Z","title":"Maximal Compatibility Matching for Preference-Aware Ride-Hailing Systems","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T00:51:53.753413Z"},"links":{"citing_paper":"/paper/2505.02599"},"observation_digest":"sha256:ce5e01ab6e2adc78d4fa174b463fb6a05c5eb4fb8d47b4cea47acf116e696002","observation_id":"9797319e-b462-4366-b30a-f4ca5db7098a","resolution":{"observed_at":"2026-08-16T00:51:53.961529Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T00:51:53.941318Z","title":"Mobility sharing as a preference matching problem,","venue":null,"work_id":"017e5ada-346d-464d-9961-4a48f7b81a34","year":2018},"citing_paper":{"arxiv_id":"2505.02599","last_updated":"2025-05-05T12:10:11Z","snapshot_observed_at":"2026-08-21T04:46:48.111055Z","submitted_at":"2025-05-05T12:10:11Z","title":"Maximal Compatibility Matching for Preference-Aware Ride-Hailing Systems","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T00:51:53.758129Z"},"links":{"citing_paper":"/paper/2505.02599"},"observation_digest":"sha256:85094b2af02d3737c3bf5f54cfd5eeb9643b6178d471191068441146bd6fe38a","observation_id":"c5c4086c-4db0-435c-9dce-642a508d3024","resolution":{"observed_at":"2026-08-16T00:51:53.946222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T00:51:53.925713Z","title":"User pref- erences in ride-sharing mathematical models for enhanced matching,","venue":null,"work_id":"e72517ab-387c-4fbd-9e33-475f96d32a51","year":2024},"citing_paper":{"arxiv_id":"2505.02599","last_updated":"2025-05-05T12:10:11Z","snapshot_observed_at":"2026-08-21T04:46:48.111055Z","submitted_at":"2025-05-05T12:10:11Z","title":"Maximal Compatibility Matching for Preference-Aware Ride-Hailing Systems","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T00:51:53.762641Z"},"links":{"citing_paper":"/paper/2505.02599"},"observation_digest":"sha256:a15c7be60cf90c1eefe66d5696e2028ca02264284f34f1cf81fa54551bef3050","observation_id":"9929cd5b-e5f0-42b1-ae12-c9503e05d179","resolution":{"observed_at":"2026-08-16T00:51:53.930959Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T00:51:53.910318Z","title":"Understanding and modeling the social preferences for riders in rideshare matching,","venue":null,"work_id":"8d47727a-19d9-4dd4-8c48-9bbf07cd7c3a","year":2021},"citing_paper":{"arxiv_id":"2505.02599","last_updated":"2025-05-05T12:10:11Z","snapshot_observed_at":"2026-08-21T04:46:48.111055Z","submitted_at":"2025-05-05T12:10:11Z","title":"Maximal Compatibility Matching for Preference-Aware Ride-Hailing Systems","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T00:51:53.767391Z"},"links":{"citing_paper":"/paper/2505.02599"},"observation_digest":"sha256:fba456ef8c56c108d0cac889dd262643c2bc1bbdfac1f5e3671d74f7349b936d","observation_id":"6b65a40b-21e3-4a5d-a6a5-e4f1222243f4","resolution":{"observed_at":"2026-08-16T00:51:53.915033Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T00:51:53.894869Z","title":"Stable matching of users in a ridesharing model,","venue":null,"work_id":"28246a11-e523-43a0-83cc-b9f4c58abfdc","year":2022},"citing_paper":{"arxiv_id":"2505.02599","last_updated":"2025-05-05T12:10:11Z","snapshot_observed_at":"2026-08-21T04:46:48.111055Z","submitted_at":"2025-05-05T12:10:11Z","title":"Maximal Compatibility Matching for Preference-Aware Ride-Hailing Systems","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T00:51:53.771805Z"},"links":{"citing_paper":"/paper/2505.02599"},"observation_digest":"sha256:97fb71f83e5d8f3d6080b25f861a6bcc93423104e6504a09e40dc79374933b3e","observation_id":"acd115b9-61d1-4568-8e02-d48f058e475a","resolution":{"observed_at":"2026-08-16T00:51:53.899827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.02599","last_updated":"2025-05-05T12:10:11Z","latest_version":1,"primary_category":"eess.SY","snapshot_observed_at":"2026-08-21T04:46:48.111055Z","submitted_at":"2025-05-05T12:10:11Z","title":"Maximal Compatibility Matching for Preference-Aware Ride-Hailing Systems"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":2,"verified_fuzzy":14},"total_outbound_references":26},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:2505.02599."}