{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:C6GA4Y3MKBF2GK4HXL65POZENJ","short_pith_number":"pith:C6GA4Y3M","canonical_record":{"source":{"id":"1906.10835","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-26T04:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"a78e655a03bce52dd269fa11edfe08fd01abbe772dacf37c6bf23bac98930ae3","abstract_canon_sha256":"e77cadf5fa4bb4705301c91368342192901e3517e2fddd57e578bb76ed382d07"},"schema_version":"1.0"},"canonical_sha256":"178c0e636c504ba32b87bafdd7bb246a602fcba946e92e909313c40874075d7a","source":{"kind":"arxiv","id":"1906.10835","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.10835","created_at":"2026-05-17T23:42:07Z"},{"alias_kind":"arxiv_version","alias_value":"1906.10835v2","created_at":"2026-05-17T23:42:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10835","created_at":"2026-05-17T23:42:07Z"},{"alias_kind":"pith_short_12","alias_value":"C6GA4Y3MKBF2","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"C6GA4Y3MKBF2GK4H","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"C6GA4Y3M","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:C6GA4Y3MKBF2GK4HXL65POZENJ","target":"record","payload":{"canonical_record":{"source":{"id":"1906.10835","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-26T04:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"a78e655a03bce52dd269fa11edfe08fd01abbe772dacf37c6bf23bac98930ae3","abstract_canon_sha256":"e77cadf5fa4bb4705301c91368342192901e3517e2fddd57e578bb76ed382d07"},"schema_version":"1.0"},"canonical_sha256":"178c0e636c504ba32b87bafdd7bb246a602fcba946e92e909313c40874075d7a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:07.704569Z","signature_b64":"Tsz2I/U3RX27Nxh3FOpscHAWg9MaBCMvvSbdGSu9vXhYu+Olz9EL6+coGjROLxGxGBHH4yyHQq05WW4La1nmCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"178c0e636c504ba32b87bafdd7bb246a602fcba946e92e909313c40874075d7a","last_reissued_at":"2026-05-17T23:42:07.703908Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:07.703908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.10835","source_version":2,"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:42:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v1u0jI89r53tc7J7mvTnOFFFfAa2goVMmDmih/H7d7zJhb/0s3LXrGMPOXVfSDzpSrx9yVHYPc/99TkrGI2rAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:36:08.316208Z"},"content_sha256":"77f95bd27e143c34072a69f6f66bdbc5cd01a67a4d9086a0e08b096fc7ec8ec8","schema_version":"1.0","event_id":"sha256:77f95bd27e143c34072a69f6f66bdbc5cd01a67a4d9086a0e08b096fc7ec8ec8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:C6GA4Y3MKBF2GK4HXL65POZENJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"NERO: Nested Rebalancing Optimization for Mobility on Demand","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ayano Okoso, Keisuke Otaki, Satoshi Koide, Tomoki Nishi","submitted_at":"2019-06-26T04:00:00Z","abstract_excerpt":"Mobility-on-Demand (MoD) services, such as taxi-like services, are promising applications. Rebalancing the vehicle locations against customer requests is a key challenge in the services because imbalance between the two worsens service quality (e.g., longer waiting times). Previous work would be hard to apply to large-scale MoD services because of the computational complexity. In this study, we develop a scalable approach to optimize rebalancing policy in stages from coarse regions to fine regions hierarchically. We prove that the complexity of our method decreases exponentially with increasin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10835","kind":"arxiv","version":2},"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:42:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Yz1C3pqaXg7fjgNDj6bkZJ9FL+m4JTe0/QKv7Ef16tgUDcqPH2Wusp0qecOtQfUY/Xv+pzIMmqIL/45XvCZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:36:08.316872Z"},"content_sha256":"5d2a2dfc3ce2ee8281490a84968c031b18a910cf25c9b30ffb1bd9b6d19543c5","schema_version":"1.0","event_id":"sha256:5d2a2dfc3ce2ee8281490a84968c031b18a910cf25c9b30ffb1bd9b6d19543c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C6GA4Y3MKBF2GK4HXL65POZENJ/bundle.json","state_url":"https://pith.science/pith/C6GA4Y3MKBF2GK4HXL65POZENJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C6GA4Y3MKBF2GK4HXL65POZENJ/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-09T17:36:08Z","links":{"resolver":"https://pith.science/pith/C6GA4Y3MKBF2GK4HXL65POZENJ","bundle":"https://pith.science/pith/C6GA4Y3MKBF2GK4HXL65POZENJ/bundle.json","state":"https://pith.science/pith/C6GA4Y3MKBF2GK4HXL65POZENJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C6GA4Y3MKBF2GK4HXL65POZENJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:C6GA4Y3MKBF2GK4HXL65POZENJ","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":"e77cadf5fa4bb4705301c91368342192901e3517e2fddd57e578bb76ed382d07","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-26T04:00:00Z","title_canon_sha256":"a78e655a03bce52dd269fa11edfe08fd01abbe772dacf37c6bf23bac98930ae3"},"schema_version":"1.0","source":{"id":"1906.10835","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.10835","created_at":"2026-05-17T23:42:07Z"},{"alias_kind":"arxiv_version","alias_value":"1906.10835v2","created_at":"2026-05-17T23:42:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10835","created_at":"2026-05-17T23:42:07Z"},{"alias_kind":"pith_short_12","alias_value":"C6GA4Y3MKBF2","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"C6GA4Y3MKBF2GK4H","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"C6GA4Y3M","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:5d2a2dfc3ce2ee8281490a84968c031b18a910cf25c9b30ffb1bd9b6d19543c5","target":"graph","created_at":"2026-05-17T23:42:07Z","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":"Mobility-on-Demand (MoD) services, such as taxi-like services, are promising applications. Rebalancing the vehicle locations against customer requests is a key challenge in the services because imbalance between the two worsens service quality (e.g., longer waiting times). Previous work would be hard to apply to large-scale MoD services because of the computational complexity. In this study, we develop a scalable approach to optimize rebalancing policy in stages from coarse regions to fine regions hierarchically. We prove that the complexity of our method decreases exponentially with increasin","authors_text":"Ayano Okoso, Keisuke Otaki, Satoshi Koide, Tomoki Nishi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-26T04:00:00Z","title":"NERO: Nested Rebalancing Optimization for Mobility on Demand"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10835","kind":"arxiv","version":2},"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:77f95bd27e143c34072a69f6f66bdbc5cd01a67a4d9086a0e08b096fc7ec8ec8","target":"record","created_at":"2026-05-17T23:42:07Z","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":"e77cadf5fa4bb4705301c91368342192901e3517e2fddd57e578bb76ed382d07","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-26T04:00:00Z","title_canon_sha256":"a78e655a03bce52dd269fa11edfe08fd01abbe772dacf37c6bf23bac98930ae3"},"schema_version":"1.0","source":{"id":"1906.10835","kind":"arxiv","version":2}},"canonical_sha256":"178c0e636c504ba32b87bafdd7bb246a602fcba946e92e909313c40874075d7a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"178c0e636c504ba32b87bafdd7bb246a602fcba946e92e909313c40874075d7a","first_computed_at":"2026-05-17T23:42:07.703908Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:07.703908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tsz2I/U3RX27Nxh3FOpscHAWg9MaBCMvvSbdGSu9vXhYu+Olz9EL6+coGjROLxGxGBHH4yyHQq05WW4La1nmCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:07.704569Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.10835","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77f95bd27e143c34072a69f6f66bdbc5cd01a67a4d9086a0e08b096fc7ec8ec8","sha256:5d2a2dfc3ce2ee8281490a84968c031b18a910cf25c9b30ffb1bd9b6d19543c5"],"state_sha256":"b4424c98983028a7ce2c702a5bb192bf5044d6b06198a23d6dddb5abb398f4b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lsiZ6hRqEZ1b91WJnwNErVhm1BLO7o4M26BobAFxMrghi7CCtLcCoQtsbHGsqA2ejlMAkpnop5BGgPKTgsM/Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T17:36:08.321178Z","bundle_sha256":"96d701459619153bcac08730616dd957b30f577a05a44e2476ed5ebcbe262e74"}}