{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OVIGUBIZS6EHOKF3WRXXLRGSKJ","short_pith_number":"pith:OVIGUBIZ","schema_version":"1.0","canonical_sha256":"75506a051997887728bbb46f75c4d25271870ae1819564e2c8f7c10d9f958835","source":{"kind":"arxiv","id":"1901.07906","version":1},"attestation_state":"computed","paper":{"title":"How Many Passengers Can We Serve with Ride-sharing?","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.DS","authors_text":"Zeren Tan","submitted_at":"2019-01-22T08:48:30Z","abstract_excerpt":"Ride-sharing can reduce traffic congestion and thus reduce gas emissions and save travel time. However, transportation system with ride-sharing is currently inefficient due to low occupancy rate, high travel demand and some other factors. Existing literature did not consider ride-sharing with multi-request grouped in one trip. In our paper, we firstly proposed a graph-based algorithm that can obtain an approximation solution in polynomial time and then proposed an exact algorithm to solve this problem with maximizing the number of passenegers served in $O(1.2312^{|\\mathcal{E}|})$ time."},"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":"1901.07906","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2019-01-22T08:48:30Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"b03269bb24f912e42bd7e4d408a53c5d3a7ca6841f24a12fb423a2febae31c16","abstract_canon_sha256":"04cd6825b5658387ec838efe1fbe9a5a9d9ae52e488dce21f6f9a85bb7bb21fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:39.491553Z","signature_b64":"YIP5jEErRoIqKxNsisdl4H4bhQziu9vgkHF2cFQokflakq7PM+XXOoDautuNyjeTWW4JmVnYFrs19Tkrp2btAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75506a051997887728bbb46f75c4d25271870ae1819564e2c8f7c10d9f958835","last_reissued_at":"2026-05-17T23:55:39.491169Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:39.491169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How Many Passengers Can We Serve with Ride-sharing?","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.DS","authors_text":"Zeren Tan","submitted_at":"2019-01-22T08:48:30Z","abstract_excerpt":"Ride-sharing can reduce traffic congestion and thus reduce gas emissions and save travel time. However, transportation system with ride-sharing is currently inefficient due to low occupancy rate, high travel demand and some other factors. Existing literature did not consider ride-sharing with multi-request grouped in one trip. In our paper, we firstly proposed a graph-based algorithm that can obtain an approximation solution in polynomial time and then proposed an exact algorithm to solve this problem with maximizing the number of passenegers served in $O(1.2312^{|\\mathcal{E}|})$ time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07906","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.07906","created_at":"2026-05-17T23:55:39.491235+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.07906v1","created_at":"2026-05-17T23:55:39.491235+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07906","created_at":"2026-05-17T23:55:39.491235+00:00"},{"alias_kind":"pith_short_12","alias_value":"OVIGUBIZS6EH","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"OVIGUBIZS6EHOKF3","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"OVIGUBIZ","created_at":"2026-05-18T12:33:24.271573+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/OVIGUBIZS6EHOKF3WRXXLRGSKJ","json":"https://pith.science/pith/OVIGUBIZS6EHOKF3WRXXLRGSKJ.json","graph_json":"https://pith.science/api/pith-number/OVIGUBIZS6EHOKF3WRXXLRGSKJ/graph.json","events_json":"https://pith.science/api/pith-number/OVIGUBIZS6EHOKF3WRXXLRGSKJ/events.json","paper":"https://pith.science/paper/OVIGUBIZ"},"agent_actions":{"view_html":"https://pith.science/pith/OVIGUBIZS6EHOKF3WRXXLRGSKJ","download_json":"https://pith.science/pith/OVIGUBIZS6EHOKF3WRXXLRGSKJ.json","view_paper":"https://pith.science/paper/OVIGUBIZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.07906&json=true","fetch_graph":"https://pith.science/api/pith-number/OVIGUBIZS6EHOKF3WRXXLRGSKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/OVIGUBIZS6EHOKF3WRXXLRGSKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OVIGUBIZS6EHOKF3WRXXLRGSKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OVIGUBIZS6EHOKF3WRXXLRGSKJ/action/storage_attestation","attest_author":"https://pith.science/pith/OVIGUBIZS6EHOKF3WRXXLRGSKJ/action/author_attestation","sign_citation":"https://pith.science/pith/OVIGUBIZS6EHOKF3WRXXLRGSKJ/action/citation_signature","submit_replication":"https://pith.science/pith/OVIGUBIZS6EHOKF3WRXXLRGSKJ/action/replication_record"}},"created_at":"2026-05-17T23:55:39.491235+00:00","updated_at":"2026-05-17T23:55:39.491235+00:00"}