{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:TUNVAAL23OIJ5CKBWCFMYDH6WU","short_pith_number":"pith:TUNVAAL2","schema_version":"1.0","canonical_sha256":"9d1b50017adb909e8941b08acc0cfeb53e75392a321d04389802bd24b73a322d","source":{"kind":"arxiv","id":"2311.06035","version":1},"attestation_state":"computed","paper":{"title":"A Time-invariant Network Flow Model for Ride-pooling in Mobility-on-Demand Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Fabio Paparella, Leonardo Pedroso, Mauro Salazar, Theo Hofman","submitted_at":"2023-11-10T12:43:28Z","abstract_excerpt":"This paper presents a framework to incorporate ride-pooling from a mesoscopic point of view, within time-invariant network flow models of Mobility-on-Demand systems. The resulting problem structure remains identical to a standard network flow model, a linear problem, which can be solved in polynomial time for a given ride-pooling request assignment. In order to compute such a ride-pooling assignment, we devise a polynomial-time knapsack-like algorithm that is optimal w.r.t. the minimum user travel time instance of the original problem. Finally, we conduct two case studies of Sioux Falls and Ma"},"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":"2311.06035","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2023-11-10T12:43:28Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"3ea6fb7facc2743a6eda703f8415ec98e38297c36a7840dbddad1231dbcf06f2","abstract_canon_sha256":"35fa8656a96fcddd521cb5d148b78d28ef915d2028d6ebda4cfa4f78c14818e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:11:26.912424Z","signature_b64":"s449QmIIKrvL38mxWPCvlqFV3FBYKOBj+ILsK7A8VJxkE5E9YoKNa4NAMqCLl3eEGjHYYbAYymeIW/DJFhfNAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d1b50017adb909e8941b08acc0cfeb53e75392a321d04389802bd24b73a322d","last_reissued_at":"2026-07-05T07:11:26.911990Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:11:26.911990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Time-invariant Network Flow Model for Ride-pooling in Mobility-on-Demand Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Fabio Paparella, Leonardo Pedroso, Mauro Salazar, Theo Hofman","submitted_at":"2023-11-10T12:43:28Z","abstract_excerpt":"This paper presents a framework to incorporate ride-pooling from a mesoscopic point of view, within time-invariant network flow models of Mobility-on-Demand systems. The resulting problem structure remains identical to a standard network flow model, a linear problem, which can be solved in polynomial time for a given ride-pooling request assignment. In order to compute such a ride-pooling assignment, we devise a polynomial-time knapsack-like algorithm that is optimal w.r.t. the minimum user travel time instance of the original problem. Finally, we conduct two case studies of Sioux Falls and Ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.06035","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.06035/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2311.06035","created_at":"2026-07-05T07:11:26.912052+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.06035v1","created_at":"2026-07-05T07:11:26.912052+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.06035","created_at":"2026-07-05T07:11:26.912052+00:00"},{"alias_kind":"pith_short_12","alias_value":"TUNVAAL23OIJ","created_at":"2026-07-05T07:11:26.912052+00:00"},{"alias_kind":"pith_short_16","alias_value":"TUNVAAL23OIJ5CKB","created_at":"2026-07-05T07:11:26.912052+00:00"},{"alias_kind":"pith_short_8","alias_value":"TUNVAAL2","created_at":"2026-07-05T07:11:26.912052+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/TUNVAAL23OIJ5CKBWCFMYDH6WU","json":"https://pith.science/pith/TUNVAAL23OIJ5CKBWCFMYDH6WU.json","graph_json":"https://pith.science/api/pith-number/TUNVAAL23OIJ5CKBWCFMYDH6WU/graph.json","events_json":"https://pith.science/api/pith-number/TUNVAAL23OIJ5CKBWCFMYDH6WU/events.json","paper":"https://pith.science/paper/TUNVAAL2"},"agent_actions":{"view_html":"https://pith.science/pith/TUNVAAL23OIJ5CKBWCFMYDH6WU","download_json":"https://pith.science/pith/TUNVAAL23OIJ5CKBWCFMYDH6WU.json","view_paper":"https://pith.science/paper/TUNVAAL2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.06035&json=true","fetch_graph":"https://pith.science/api/pith-number/TUNVAAL23OIJ5CKBWCFMYDH6WU/graph.json","fetch_events":"https://pith.science/api/pith-number/TUNVAAL23OIJ5CKBWCFMYDH6WU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TUNVAAL23OIJ5CKBWCFMYDH6WU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TUNVAAL23OIJ5CKBWCFMYDH6WU/action/storage_attestation","attest_author":"https://pith.science/pith/TUNVAAL23OIJ5CKBWCFMYDH6WU/action/author_attestation","sign_citation":"https://pith.science/pith/TUNVAAL23OIJ5CKBWCFMYDH6WU/action/citation_signature","submit_replication":"https://pith.science/pith/TUNVAAL23OIJ5CKBWCFMYDH6WU/action/replication_record"}},"created_at":"2026-07-05T07:11:26.912052+00:00","updated_at":"2026-07-05T07:11:26.912052+00:00"}