{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AKOG6PVLW5RP72GCAW27XKGA2F","short_pith_number":"pith:AKOG6PVL","canonical_record":{"source":{"id":"1810.10513","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-10-24T17:47:50Z","cross_cats_sorted":[],"title_canon_sha256":"c98e8c1075e41f973ef1f82d6d070e2e157e9e65472e78c9e8de4d43002dab9d","abstract_canon_sha256":"6860c1dc268d812a1c0fea01d32e63f8834ba3e3d24d1032ddfc8f66e36066d1"},"schema_version":"1.0"},"canonical_sha256":"029c6f3eabb762ffe8c205b5fba8c0d16c17e959b43284868fe0d26dbe98f0df","source":{"kind":"arxiv","id":"1810.10513","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10513","created_at":"2026-05-18T00:02:22Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10513v1","created_at":"2026-05-18T00:02:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10513","created_at":"2026-05-18T00:02:22Z"},{"alias_kind":"pith_short_12","alias_value":"AKOG6PVLW5RP","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AKOG6PVLW5RP72GC","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AKOG6PVL","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AKOG6PVLW5RP72GCAW27XKGA2F","target":"record","payload":{"canonical_record":{"source":{"id":"1810.10513","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-10-24T17:47:50Z","cross_cats_sorted":[],"title_canon_sha256":"c98e8c1075e41f973ef1f82d6d070e2e157e9e65472e78c9e8de4d43002dab9d","abstract_canon_sha256":"6860c1dc268d812a1c0fea01d32e63f8834ba3e3d24d1032ddfc8f66e36066d1"},"schema_version":"1.0"},"canonical_sha256":"029c6f3eabb762ffe8c205b5fba8c0d16c17e959b43284868fe0d26dbe98f0df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:22.874127Z","signature_b64":"OK1UseFLcRFZCgJz62+T1+IM3po17TaqED6xH5zAjrGF4L9/gYiDv27EkMkQCJKoRVZ6lkuUc1U528MlcjmpBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"029c6f3eabb762ffe8c205b5fba8c0d16c17e959b43284868fe0d26dbe98f0df","last_reissued_at":"2026-05-18T00:02:22.873684Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:22.873684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.10513","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-18T00:02:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZPM0vMX+VVZjzsTddrW9bJAWHn+LYGLB2qURGhRF7TjgIAv8mrDMVonIZaXnDFBINA64B7H8RAV9YrXP4UR4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:53:32.066152Z"},"content_sha256":"8b8df3ed433e7821e3321979267abe7a910162f45ff7776d445cdc582fd835b3","schema_version":"1.0","event_id":"sha256:8b8df3ed433e7821e3321979267abe7a910162f45ff7776d445cdc582fd835b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AKOG6PVLW5RP72GCAW27XKGA2F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Between-Ride Routing for Private Transportation Services","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Ian Schneider, Jun Jie Joseph Kuan, Mardavij Roozbehani, Munther Dahleh","submitted_at":"2018-10-24T17:47:50Z","abstract_excerpt":"Spurred by the growth of transportation network companies and increasing data capabilities, vehicle routing and ride-matching algorithms can improve the efficiency of private transportation services. However, existing routing solutions do not address where drivers should travel after dropping off a passenger and before receiving the next passenger ride request, i.e., during the between-ride period. We address this problem by developing an efficient algorithm to find the optimal policy for drivers between rides in order to maximize driver profits. We model the road network as a graph, and we sh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10513","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-18T00:02:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FX99KPxvNdgN5ASbW6e9dVktryBiUrP+gL3+6fw+MKHiF+aTHMFL/UK3vEhiJwwp19APZEhc4lPewiL7/J/1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:53:32.066850Z"},"content_sha256":"1485ebeb213ff5949135a25018712c1a5113fcad33a2637894d1187a8ff79168","schema_version":"1.0","event_id":"sha256:1485ebeb213ff5949135a25018712c1a5113fcad33a2637894d1187a8ff79168"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AKOG6PVLW5RP72GCAW27XKGA2F/bundle.json","state_url":"https://pith.science/pith/AKOG6PVLW5RP72GCAW27XKGA2F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AKOG6PVLW5RP72GCAW27XKGA2F/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-06-05T03:53:32Z","links":{"resolver":"https://pith.science/pith/AKOG6PVLW5RP72GCAW27XKGA2F","bundle":"https://pith.science/pith/AKOG6PVLW5RP72GCAW27XKGA2F/bundle.json","state":"https://pith.science/pith/AKOG6PVLW5RP72GCAW27XKGA2F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AKOG6PVLW5RP72GCAW27XKGA2F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AKOG6PVLW5RP72GCAW27XKGA2F","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":"6860c1dc268d812a1c0fea01d32e63f8834ba3e3d24d1032ddfc8f66e36066d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-10-24T17:47:50Z","title_canon_sha256":"c98e8c1075e41f973ef1f82d6d070e2e157e9e65472e78c9e8de4d43002dab9d"},"schema_version":"1.0","source":{"id":"1810.10513","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10513","created_at":"2026-05-18T00:02:22Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10513v1","created_at":"2026-05-18T00:02:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10513","created_at":"2026-05-18T00:02:22Z"},{"alias_kind":"pith_short_12","alias_value":"AKOG6PVLW5RP","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AKOG6PVLW5RP72GC","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AKOG6PVL","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:1485ebeb213ff5949135a25018712c1a5113fcad33a2637894d1187a8ff79168","target":"graph","created_at":"2026-05-18T00:02:22Z","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":"Spurred by the growth of transportation network companies and increasing data capabilities, vehicle routing and ride-matching algorithms can improve the efficiency of private transportation services. However, existing routing solutions do not address where drivers should travel after dropping off a passenger and before receiving the next passenger ride request, i.e., during the between-ride period. We address this problem by developing an efficient algorithm to find the optimal policy for drivers between rides in order to maximize driver profits. We model the road network as a graph, and we sh","authors_text":"Ian Schneider, Jun Jie Joseph Kuan, Mardavij Roozbehani, Munther Dahleh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-10-24T17:47:50Z","title":"Between-Ride Routing for Private Transportation Services"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10513","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:8b8df3ed433e7821e3321979267abe7a910162f45ff7776d445cdc582fd835b3","target":"record","created_at":"2026-05-18T00:02:22Z","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":"6860c1dc268d812a1c0fea01d32e63f8834ba3e3d24d1032ddfc8f66e36066d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-10-24T17:47:50Z","title_canon_sha256":"c98e8c1075e41f973ef1f82d6d070e2e157e9e65472e78c9e8de4d43002dab9d"},"schema_version":"1.0","source":{"id":"1810.10513","kind":"arxiv","version":1}},"canonical_sha256":"029c6f3eabb762ffe8c205b5fba8c0d16c17e959b43284868fe0d26dbe98f0df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"029c6f3eabb762ffe8c205b5fba8c0d16c17e959b43284868fe0d26dbe98f0df","first_computed_at":"2026-05-18T00:02:22.873684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:22.873684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OK1UseFLcRFZCgJz62+T1+IM3po17TaqED6xH5zAjrGF4L9/gYiDv27EkMkQCJKoRVZ6lkuUc1U528MlcjmpBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:22.874127Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.10513","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b8df3ed433e7821e3321979267abe7a910162f45ff7776d445cdc582fd835b3","sha256:1485ebeb213ff5949135a25018712c1a5113fcad33a2637894d1187a8ff79168"],"state_sha256":"70318990eda5c0cd62cb8de65bd1d80bf182c6d158c623e5ab71741f3d07d9e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B5LCMIyuAfdXybhkPXENi6KxTG3qB9xjPhhfxMeCsLn7+KsUHZW22OENvxszTybd/lJmdlThcpULtFPVH4pMDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T03:53:32.071073Z","bundle_sha256":"c72a5eccad980dab9e970817d67425acb320145e56f3410caae40583e441c7f0"}}