{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7ZW2XL2D67MGOGAQJPNXOD6XTT","short_pith_number":"pith:7ZW2XL2D","canonical_record":{"source":{"id":"1903.02716","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-07T03:49:07Z","cross_cats_sorted":[],"title_canon_sha256":"cbf74d813a38d3d5b91934de0d3bf421c589d1682b5afeb2658df6ece894cbe7","abstract_canon_sha256":"d1e74aa0ea82ad7cd9cb9a711e1670fc10f767be977f499a8c6aadaf74b15e62"},"schema_version":"1.0"},"canonical_sha256":"fe6dabaf43f7d86718104bdb770fd79ccb5dd6765c19a6261f41e31a2524ec66","source":{"kind":"arxiv","id":"1903.02716","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02716","created_at":"2026-05-17T23:51:51Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02716v1","created_at":"2026-05-17T23:51:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02716","created_at":"2026-05-17T23:51:51Z"},{"alias_kind":"pith_short_12","alias_value":"7ZW2XL2D67MG","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7ZW2XL2D67MGOGAQ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7ZW2XL2D","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7ZW2XL2D67MGOGAQJPNXOD6XTT","target":"record","payload":{"canonical_record":{"source":{"id":"1903.02716","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-07T03:49:07Z","cross_cats_sorted":[],"title_canon_sha256":"cbf74d813a38d3d5b91934de0d3bf421c589d1682b5afeb2658df6ece894cbe7","abstract_canon_sha256":"d1e74aa0ea82ad7cd9cb9a711e1670fc10f767be977f499a8c6aadaf74b15e62"},"schema_version":"1.0"},"canonical_sha256":"fe6dabaf43f7d86718104bdb770fd79ccb5dd6765c19a6261f41e31a2524ec66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:51.351364Z","signature_b64":"Imdna8ROaNE9QkP22LfWKJJZ+MPj7UMHEET29fvYpVIOm2x5+rWodSMJE7p4cptDDAQDc36DB6Xuj16TZh9NDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe6dabaf43f7d86718104bdb770fd79ccb5dd6765c19a6261f41e31a2524ec66","last_reissued_at":"2026-05-17T23:51:51.350697Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:51.350697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.02716","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:51:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fcNIVVAhec34EFMJrRW2/Ajer4s0hbWZkPfqnrvUf0RajNO2cY0h++ztrqoj+WjBNPJn1UHa85+/oe0CzqqpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:27:41.973908Z"},"content_sha256":"9bc8288e179be6d84ad79a8476b5d854ab3ebd252c31dc1652af5b7f2347b49c","schema_version":"1.0","event_id":"sha256:9bc8288e179be6d84ad79a8476b5d854ab3ebd252c31dc1652af5b7f2347b49c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7ZW2XL2D67MGOGAQJPNXOD6XTT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Can Sophisticated Dispatching Strategy Acquired by Reinforcement Learning? - A Case Study in Dynamic Courier Dispatching System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Haoyuan Hu, Rongqi Li, Yichen Yao, Yinghui Xu, Yinzhi Zhou, Yujie Chen, Yu Qian, Zili Wu","submitted_at":"2019-03-07T03:49:07Z","abstract_excerpt":"In this paper, we study a courier dispatching problem (CDP) raised from an online pickup-service platform of Alibaba. The CDP aims to assign a set of couriers to serve pickup requests with stochastic spatial and temporal arrival rate among urban regions. The objective is to maximize the revenue of served requests given a limited number of couriers over a period of time. Many online algorithms such as dynamic matching and vehicle routing strategy from existing literature could be applied to tackle this problem. However, these methods rely on appropriately predefined optimization objectives at e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02716","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:51:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y4woEemQnXXcFloc/N18cTGE2RzSig7jos2burIa5DP3vDHZ2JxUIIrMvs2/crEMHETqv3jrtDXrTkDDJ+RcAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:27:41.974263Z"},"content_sha256":"0e09596358ceff06bda16422a17467dcd7cd597add674a54d404a968f71bf775","schema_version":"1.0","event_id":"sha256:0e09596358ceff06bda16422a17467dcd7cd597add674a54d404a968f71bf775"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7ZW2XL2D67MGOGAQJPNXOD6XTT/bundle.json","state_url":"https://pith.science/pith/7ZW2XL2D67MGOGAQJPNXOD6XTT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7ZW2XL2D67MGOGAQJPNXOD6XTT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T05:27:41Z","links":{"resolver":"https://pith.science/pith/7ZW2XL2D67MGOGAQJPNXOD6XTT","bundle":"https://pith.science/pith/7ZW2XL2D67MGOGAQJPNXOD6XTT/bundle.json","state":"https://pith.science/pith/7ZW2XL2D67MGOGAQJPNXOD6XTT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7ZW2XL2D67MGOGAQJPNXOD6XTT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7ZW2XL2D67MGOGAQJPNXOD6XTT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d1e74aa0ea82ad7cd9cb9a711e1670fc10f767be977f499a8c6aadaf74b15e62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-07T03:49:07Z","title_canon_sha256":"cbf74d813a38d3d5b91934de0d3bf421c589d1682b5afeb2658df6ece894cbe7"},"schema_version":"1.0","source":{"id":"1903.02716","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02716","created_at":"2026-05-17T23:51:51Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02716v1","created_at":"2026-05-17T23:51:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02716","created_at":"2026-05-17T23:51:51Z"},{"alias_kind":"pith_short_12","alias_value":"7ZW2XL2D67MG","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7ZW2XL2D67MGOGAQ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7ZW2XL2D","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:0e09596358ceff06bda16422a17467dcd7cd597add674a54d404a968f71bf775","target":"graph","created_at":"2026-05-17T23:51:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper, we study a courier dispatching problem (CDP) raised from an online pickup-service platform of Alibaba. The CDP aims to assign a set of couriers to serve pickup requests with stochastic spatial and temporal arrival rate among urban regions. The objective is to maximize the revenue of served requests given a limited number of couriers over a period of time. Many online algorithms such as dynamic matching and vehicle routing strategy from existing literature could be applied to tackle this problem. However, these methods rely on appropriately predefined optimization objectives at e","authors_text":"Haoyuan Hu, Rongqi Li, Yichen Yao, Yinghui Xu, Yinzhi Zhou, Yujie Chen, Yu Qian, Zili Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-07T03:49:07Z","title":"Can Sophisticated Dispatching Strategy Acquired by Reinforcement Learning? - A Case Study in Dynamic Courier Dispatching System"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02716","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9bc8288e179be6d84ad79a8476b5d854ab3ebd252c31dc1652af5b7f2347b49c","target":"record","created_at":"2026-05-17T23:51:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d1e74aa0ea82ad7cd9cb9a711e1670fc10f767be977f499a8c6aadaf74b15e62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-07T03:49:07Z","title_canon_sha256":"cbf74d813a38d3d5b91934de0d3bf421c589d1682b5afeb2658df6ece894cbe7"},"schema_version":"1.0","source":{"id":"1903.02716","kind":"arxiv","version":1}},"canonical_sha256":"fe6dabaf43f7d86718104bdb770fd79ccb5dd6765c19a6261f41e31a2524ec66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe6dabaf43f7d86718104bdb770fd79ccb5dd6765c19a6261f41e31a2524ec66","first_computed_at":"2026-05-17T23:51:51.350697Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:51.350697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Imdna8ROaNE9QkP22LfWKJJZ+MPj7UMHEET29fvYpVIOm2x5+rWodSMJE7p4cptDDAQDc36DB6Xuj16TZh9NDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:51.351364Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.02716","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9bc8288e179be6d84ad79a8476b5d854ab3ebd252c31dc1652af5b7f2347b49c","sha256:0e09596358ceff06bda16422a17467dcd7cd597add674a54d404a968f71bf775"],"state_sha256":"d63a65abecc1e4c920a34d0d79ec7344bdbfc7816184d224192cdecfeb4c7fff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ez3akc1L1fG6n57nrGtUgXD4pVHaSs6uN3qN/4MxCSgGVTJxNg0kCCqQZGQGcOF0KjnMW3lhBLp980pYZ7mHCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T05:27:41.976345Z","bundle_sha256":"a7d2b9aaca7834dad2b0ab0d3dc334e1d3578723db618603ac885752bcd2ac7c"}}