{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:C6GA4Y3MKBF2GK4HXL65POZENJ","short_pith_number":"pith:C6GA4Y3M","schema_version":"1.0","canonical_sha256":"178c0e636c504ba32b87bafdd7bb246a602fcba946e92e909313c40874075d7a","source":{"kind":"arxiv","id":"1906.10835","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.10835","created_at":"2026-05-17T23:42:07.704002+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.10835v2","created_at":"2026-05-17T23:42:07.704002+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10835","created_at":"2026-05-17T23:42:07.704002+00:00"},{"alias_kind":"pith_short_12","alias_value":"C6GA4Y3MKBF2","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"C6GA4Y3MKBF2GK4H","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"C6GA4Y3M","created_at":"2026-05-18T12:33:12.712433+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/C6GA4Y3MKBF2GK4HXL65POZENJ","json":"https://pith.science/pith/C6GA4Y3MKBF2GK4HXL65POZENJ.json","graph_json":"https://pith.science/api/pith-number/C6GA4Y3MKBF2GK4HXL65POZENJ/graph.json","events_json":"https://pith.science/api/pith-number/C6GA4Y3MKBF2GK4HXL65POZENJ/events.json","paper":"https://pith.science/paper/C6GA4Y3M"},"agent_actions":{"view_html":"https://pith.science/pith/C6GA4Y3MKBF2GK4HXL65POZENJ","download_json":"https://pith.science/pith/C6GA4Y3MKBF2GK4HXL65POZENJ.json","view_paper":"https://pith.science/paper/C6GA4Y3M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.10835&json=true","fetch_graph":"https://pith.science/api/pith-number/C6GA4Y3MKBF2GK4HXL65POZENJ/graph.json","fetch_events":"https://pith.science/api/pith-number/C6GA4Y3MKBF2GK4HXL65POZENJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C6GA4Y3MKBF2GK4HXL65POZENJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C6GA4Y3MKBF2GK4HXL65POZENJ/action/storage_attestation","attest_author":"https://pith.science/pith/C6GA4Y3MKBF2GK4HXL65POZENJ/action/author_attestation","sign_citation":"https://pith.science/pith/C6GA4Y3MKBF2GK4HXL65POZENJ/action/citation_signature","submit_replication":"https://pith.science/pith/C6GA4Y3MKBF2GK4HXL65POZENJ/action/replication_record"}},"created_at":"2026-05-17T23:42:07.704002+00:00","updated_at":"2026-05-17T23:42:07.704002+00:00"}