{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:C4KUNIOE7FDOH52QPJ6L5ZFOTV","short_pith_number":"pith:C4KUNIOE","schema_version":"1.0","canonical_sha256":"171546a1c4f946e3f7507a7cbee4ae9d751fa3973cd3feebd6ba063d9332408f","source":{"kind":"arxiv","id":"1806.10327","version":1},"attestation_state":"computed","paper":{"title":"Online Matching in a Ride-Sharing Platform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chinmoy Dutta, Chris Sholley","submitted_at":"2018-06-27T07:52:11Z","abstract_excerpt":"We propose a formal graph-theoretic model for studying the problem of matching rides online in a ride-sharing platform. Unlike most of the literature on online matching, our model, that we call {\\em Online Windowed Non-Bipartite Matching} ($\\mbox{OWNBM}$), pertains to online matching in {\\em non-bipartite} graphs. We show that the edge-weighted and vertex-weighted versions of our model arise naturally in ride-sharing platforms. We provide a randomized $\\frac{1}{4}$-competitive algorithm for the edge-weighted case using a beautiful result of Lehmann, Lehmann and Nisan (EC 2001) for combinatoria"},"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":"1806.10327","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-27T07:52:11Z","cross_cats_sorted":[],"title_canon_sha256":"71babfbf4f49e6f2a1345073ab9d367812bc8d53d5b581b7f6785a65f0984ca9","abstract_canon_sha256":"aaa6e5cf91ef4ff01f128b660205e9fcce706ec683be893dc011fa2bf59d5c6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:12.803165Z","signature_b64":"4yQ+pe3fdneDf3/kb4l0EOxlJT4cUyxp1k7hKps6PYzpxHf+27VtxjDth0FfyJEvwdO6wsnawzw27P9zB4rwAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"171546a1c4f946e3f7507a7cbee4ae9d751fa3973cd3feebd6ba063d9332408f","last_reissued_at":"2026-05-18T00:12:12.802652Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:12.802652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Matching in a Ride-Sharing Platform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chinmoy Dutta, Chris Sholley","submitted_at":"2018-06-27T07:52:11Z","abstract_excerpt":"We propose a formal graph-theoretic model for studying the problem of matching rides online in a ride-sharing platform. Unlike most of the literature on online matching, our model, that we call {\\em Online Windowed Non-Bipartite Matching} ($\\mbox{OWNBM}$), pertains to online matching in {\\em non-bipartite} graphs. We show that the edge-weighted and vertex-weighted versions of our model arise naturally in ride-sharing platforms. We provide a randomized $\\frac{1}{4}$-competitive algorithm for the edge-weighted case using a beautiful result of Lehmann, Lehmann and Nisan (EC 2001) for combinatoria"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10327","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":"1806.10327","created_at":"2026-05-18T00:12:12.802724+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.10327v1","created_at":"2026-05-18T00:12:12.802724+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10327","created_at":"2026-05-18T00:12:12.802724+00:00"},{"alias_kind":"pith_short_12","alias_value":"C4KUNIOE7FDO","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"C4KUNIOE7FDOH52Q","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"C4KUNIOE","created_at":"2026-05-18T12:32:16.446611+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/C4KUNIOE7FDOH52QPJ6L5ZFOTV","json":"https://pith.science/pith/C4KUNIOE7FDOH52QPJ6L5ZFOTV.json","graph_json":"https://pith.science/api/pith-number/C4KUNIOE7FDOH52QPJ6L5ZFOTV/graph.json","events_json":"https://pith.science/api/pith-number/C4KUNIOE7FDOH52QPJ6L5ZFOTV/events.json","paper":"https://pith.science/paper/C4KUNIOE"},"agent_actions":{"view_html":"https://pith.science/pith/C4KUNIOE7FDOH52QPJ6L5ZFOTV","download_json":"https://pith.science/pith/C4KUNIOE7FDOH52QPJ6L5ZFOTV.json","view_paper":"https://pith.science/paper/C4KUNIOE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.10327&json=true","fetch_graph":"https://pith.science/api/pith-number/C4KUNIOE7FDOH52QPJ6L5ZFOTV/graph.json","fetch_events":"https://pith.science/api/pith-number/C4KUNIOE7FDOH52QPJ6L5ZFOTV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C4KUNIOE7FDOH52QPJ6L5ZFOTV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C4KUNIOE7FDOH52QPJ6L5ZFOTV/action/storage_attestation","attest_author":"https://pith.science/pith/C4KUNIOE7FDOH52QPJ6L5ZFOTV/action/author_attestation","sign_citation":"https://pith.science/pith/C4KUNIOE7FDOH52QPJ6L5ZFOTV/action/citation_signature","submit_replication":"https://pith.science/pith/C4KUNIOE7FDOH52QPJ6L5ZFOTV/action/replication_record"}},"created_at":"2026-05-18T00:12:12.802724+00:00","updated_at":"2026-05-18T00:12:12.802724+00:00"}