{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:TUNVAAL23OIJ5CKBWCFMYDH6WU","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":"35fa8656a96fcddd521cb5d148b78d28ef915d2028d6ebda4cfa4f78c14818e9","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2023-11-10T12:43:28Z","title_canon_sha256":"3ea6fb7facc2743a6eda703f8415ec98e38297c36a7840dbddad1231dbcf06f2"},"schema_version":"1.0","source":{"id":"2311.06035","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.06035","created_at":"2026-07-05T07:11:26Z"},{"alias_kind":"arxiv_version","alias_value":"2311.06035v1","created_at":"2026-07-05T07:11:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.06035","created_at":"2026-07-05T07:11:26Z"},{"alias_kind":"pith_short_12","alias_value":"TUNVAAL23OIJ","created_at":"2026-07-05T07:11:26Z"},{"alias_kind":"pith_short_16","alias_value":"TUNVAAL23OIJ5CKB","created_at":"2026-07-05T07:11:26Z"},{"alias_kind":"pith_short_8","alias_value":"TUNVAAL2","created_at":"2026-07-05T07:11:26Z"}],"graph_snapshots":[{"event_id":"sha256:3b1a92722d1ae9d60a4822bb8e1aa4f7d7ae67317f2c22134832112b7360c7e3","target":"graph","created_at":"2026-07-05T07:11:26Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2311.06035/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Fabio Paparella, Leonardo Pedroso, Mauro Salazar, Theo Hofman","cross_cats":["cs.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2023-11-10T12:43:28Z","title":"A Time-invariant Network Flow Model for Ride-pooling in Mobility-on-Demand Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.06035","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:1e18867b16ccacd11ef1ef9966919f6e398b7af395eb7a62324716170799e7ae","target":"record","created_at":"2026-07-05T07:11:26Z","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":"35fa8656a96fcddd521cb5d148b78d28ef915d2028d6ebda4cfa4f78c14818e9","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2023-11-10T12:43:28Z","title_canon_sha256":"3ea6fb7facc2743a6eda703f8415ec98e38297c36a7840dbddad1231dbcf06f2"},"schema_version":"1.0","source":{"id":"2311.06035","kind":"arxiv","version":1}},"canonical_sha256":"9d1b50017adb909e8941b08acc0cfeb53e75392a321d04389802bd24b73a322d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d1b50017adb909e8941b08acc0cfeb53e75392a321d04389802bd24b73a322d","first_computed_at":"2026-07-05T07:11:26.911990Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:11:26.911990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s449QmIIKrvL38mxWPCvlqFV3FBYKOBj+ILsK7A8VJxkE5E9YoKNa4NAMqCLl3eEGjHYYbAYymeIW/DJFhfNAg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:11:26.912424Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.06035","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e18867b16ccacd11ef1ef9966919f6e398b7af395eb7a62324716170799e7ae","sha256:3b1a92722d1ae9d60a4822bb8e1aa4f7d7ae67317f2c22134832112b7360c7e3"],"state_sha256":"98d7b06c7677eae8c16ac526ee06b3db0b84fede709e7381a04372d8dd4d1bbc"}