{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TRGEUVHWMYQV77M3OXIJ3LLV52","short_pith_number":"pith:TRGEUVHW","schema_version":"1.0","canonical_sha256":"9c4c4a54f666215ffd9b75d09dad75eea28026d9c148a73473ce1bb8f75e56b5","source":{"kind":"arxiv","id":"1901.11454","version":1},"attestation_state":"computed","paper":{"title":"Efficient Ridesharing Order Dispatching with Mean Field Multi-Agent Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Chenxi Wang, Guobin Wu, Jieping Ye, Jun Wang, Minne Li, Yan Jiao, Yaodong Yang, Zhichen Gong, Zhiwei (Tony) Qin","submitted_at":"2019-01-31T16:26:48Z","abstract_excerpt":"A fundamental question in any peer-to-peer ridesharing system is how to, both effectively and efficiently, dispatch user's ride requests to the right driver in real time. Traditional rule-based solutions usually work on a simplified problem setting, which requires a sophisticated hand-crafted weight design for either centralized authority control or decentralized multi-agent scheduling systems. Although recent approaches have used reinforcement learning to provide centralized combinatorial optimization algorithms with informative weight values, their single-agent setting can hardly model the c"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1901.11454","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-01-31T16:26:48Z","cross_cats_sorted":[],"title_canon_sha256":"e8b438bcfbe44ae38d1c076bca91eab8f905a6a65f2bc806bdb5dd988c116d26","abstract_canon_sha256":"729d66ebc663212b75f026c9775b9070cae62735236c3dfb27d75a67ad6abf82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:01.838865Z","signature_b64":"iRfnGS1IEBIy+X/8gVmQ6+iWzFIRjLpywUnvx4fYpM4C7RU8F4jvevee3QN5M5YAOIe0MCSco+pGM+GoJYPzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c4c4a54f666215ffd9b75d09dad75eea28026d9c148a73473ce1bb8f75e56b5","last_reissued_at":"2026-05-17T23:55:01.838352Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:01.838352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Ridesharing Order Dispatching with Mean Field Multi-Agent Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Chenxi Wang, Guobin Wu, Jieping Ye, Jun Wang, Minne Li, Yan Jiao, Yaodong Yang, Zhichen Gong, Zhiwei (Tony) Qin","submitted_at":"2019-01-31T16:26:48Z","abstract_excerpt":"A fundamental question in any peer-to-peer ridesharing system is how to, both effectively and efficiently, dispatch user's ride requests to the right driver in real time. Traditional rule-based solutions usually work on a simplified problem setting, which requires a sophisticated hand-crafted weight design for either centralized authority control or decentralized multi-agent scheduling systems. Although recent approaches have used reinforcement learning to provide centralized combinatorial optimization algorithms with informative weight values, their single-agent setting can hardly model the c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.11454","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.11454","created_at":"2026-05-17T23:55:01.838441+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.11454v1","created_at":"2026-05-17T23:55:01.838441+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.11454","created_at":"2026-05-17T23:55:01.838441+00:00"},{"alias_kind":"pith_short_12","alias_value":"TRGEUVHWMYQV","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"TRGEUVHWMYQV77M3","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"TRGEUVHW","created_at":"2026-05-18T12:33:30.264802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TRGEUVHWMYQV77M3OXIJ3LLV52","json":"https://pith.science/pith/TRGEUVHWMYQV77M3OXIJ3LLV52.json","graph_json":"https://pith.science/api/pith-number/TRGEUVHWMYQV77M3OXIJ3LLV52/graph.json","events_json":"https://pith.science/api/pith-number/TRGEUVHWMYQV77M3OXIJ3LLV52/events.json","paper":"https://pith.science/paper/TRGEUVHW"},"agent_actions":{"view_html":"https://pith.science/pith/TRGEUVHWMYQV77M3OXIJ3LLV52","download_json":"https://pith.science/pith/TRGEUVHWMYQV77M3OXIJ3LLV52.json","view_paper":"https://pith.science/paper/TRGEUVHW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.11454&json=true","fetch_graph":"https://pith.science/api/pith-number/TRGEUVHWMYQV77M3OXIJ3LLV52/graph.json","fetch_events":"https://pith.science/api/pith-number/TRGEUVHWMYQV77M3OXIJ3LLV52/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TRGEUVHWMYQV77M3OXIJ3LLV52/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TRGEUVHWMYQV77M3OXIJ3LLV52/action/storage_attestation","attest_author":"https://pith.science/pith/TRGEUVHWMYQV77M3OXIJ3LLV52/action/author_attestation","sign_citation":"https://pith.science/pith/TRGEUVHWMYQV77M3OXIJ3LLV52/action/citation_signature","submit_replication":"https://pith.science/pith/TRGEUVHWMYQV77M3OXIJ3LLV52/action/replication_record"}},"created_at":"2026-05-17T23:55:01.838441+00:00","updated_at":"2026-05-17T23:55:01.838441+00:00"}