{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BD56UO2LWP4VHQGWTSJDRXBBWO","short_pith_number":"pith:BD56UO2L","schema_version":"1.0","canonical_sha256":"08fbea3b4bb3f953c0d69c9238dc21b38ed4790a78155d7918322162e691733c","source":{"kind":"arxiv","id":"1704.06838","version":1},"attestation_state":"computed","paper":{"title":"A Decomposition Algorithm to Solve the Multi-Hop Peer-to-Peer Ride-Matching Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Neda Masoud, R. Jayakrishnan","submitted_at":"2017-04-22T19:14:32Z","abstract_excerpt":"In this paper, we mathematically model the multi-hop Peer-to-Peer (P2P) ride-matching problem as a binary program. We formulate this problem as a many-to-many problem in which a rider can travel by transferring between multiple drivers, and a driver can carry multiple riders. We propose a pre-processing procedure to reduce the size of the problem, and devise a decomposition algorithm to solve the original ride-matching problem to optimality by means of solving multiple smaller problems. We conduct extensive numerical experiments to demonstrate the computational efficiency of the proposed algor"},"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":"1704.06838","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-22T19:14:32Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"ebc4e39e4a32390aaa205bf72e2922c58af147c2c1dd420ed4c8ccfad7d920f4","abstract_canon_sha256":"c47683eda91009450fa65a80bf49b9a8de98201d87eee1644d3faf96ab484bfe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:55.619173Z","signature_b64":"kIzUz5Vf8JfD8tBRnIbiAa5PzIJakF8ZH2DVwKZtIE30Yg5ik3hA/+BqpaEL1acFc+DXv7t0DbdxF+JR+ffFCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08fbea3b4bb3f953c0d69c9238dc21b38ed4790a78155d7918322162e691733c","last_reissued_at":"2026-05-18T00:45:55.618641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:55.618641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Decomposition Algorithm to Solve the Multi-Hop Peer-to-Peer Ride-Matching Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Neda Masoud, R. Jayakrishnan","submitted_at":"2017-04-22T19:14:32Z","abstract_excerpt":"In this paper, we mathematically model the multi-hop Peer-to-Peer (P2P) ride-matching problem as a binary program. We formulate this problem as a many-to-many problem in which a rider can travel by transferring between multiple drivers, and a driver can carry multiple riders. We propose a pre-processing procedure to reduce the size of the problem, and devise a decomposition algorithm to solve the original ride-matching problem to optimality by means of solving multiple smaller problems. We conduct extensive numerical experiments to demonstrate the computational efficiency of the proposed algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06838","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":"1704.06838","created_at":"2026-05-18T00:45:55.618735+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.06838v1","created_at":"2026-05-18T00:45:55.618735+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06838","created_at":"2026-05-18T00:45:55.618735+00:00"},{"alias_kind":"pith_short_12","alias_value":"BD56UO2LWP4V","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BD56UO2LWP4VHQGW","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BD56UO2L","created_at":"2026-05-18T12:31:08.081275+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/BD56UO2LWP4VHQGWTSJDRXBBWO","json":"https://pith.science/pith/BD56UO2LWP4VHQGWTSJDRXBBWO.json","graph_json":"https://pith.science/api/pith-number/BD56UO2LWP4VHQGWTSJDRXBBWO/graph.json","events_json":"https://pith.science/api/pith-number/BD56UO2LWP4VHQGWTSJDRXBBWO/events.json","paper":"https://pith.science/paper/BD56UO2L"},"agent_actions":{"view_html":"https://pith.science/pith/BD56UO2LWP4VHQGWTSJDRXBBWO","download_json":"https://pith.science/pith/BD56UO2LWP4VHQGWTSJDRXBBWO.json","view_paper":"https://pith.science/paper/BD56UO2L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.06838&json=true","fetch_graph":"https://pith.science/api/pith-number/BD56UO2LWP4VHQGWTSJDRXBBWO/graph.json","fetch_events":"https://pith.science/api/pith-number/BD56UO2LWP4VHQGWTSJDRXBBWO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BD56UO2LWP4VHQGWTSJDRXBBWO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BD56UO2LWP4VHQGWTSJDRXBBWO/action/storage_attestation","attest_author":"https://pith.science/pith/BD56UO2LWP4VHQGWTSJDRXBBWO/action/author_attestation","sign_citation":"https://pith.science/pith/BD56UO2LWP4VHQGWTSJDRXBBWO/action/citation_signature","submit_replication":"https://pith.science/pith/BD56UO2LWP4VHQGWTSJDRXBBWO/action/replication_record"}},"created_at":"2026-05-18T00:45:55.618735+00:00","updated_at":"2026-05-18T00:45:55.618735+00:00"}