{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BD56UO2LWP4VHQGWTSJDRXBBWO","short_pith_number":"pith:BD56UO2L","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"},"canonical_sha256":"08fbea3b4bb3f953c0d69c9238dc21b38ed4790a78155d7918322162e691733c","source":{"kind":"arxiv","id":"1704.06838","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.06838","created_at":"2026-05-18T00:45:55Z"},{"alias_kind":"arxiv_version","alias_value":"1704.06838v1","created_at":"2026-05-18T00:45:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06838","created_at":"2026-05-18T00:45:55Z"},{"alias_kind":"pith_short_12","alias_value":"BD56UO2LWP4V","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BD56UO2LWP4VHQGW","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BD56UO2L","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BD56UO2LWP4VHQGWTSJDRXBBWO","target":"record","payload":{"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"},"canonical_sha256":"08fbea3b4bb3f953c0d69c9238dc21b38ed4790a78155d7918322162e691733c","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"},"source_kind":"arxiv","source_id":"1704.06838","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:45:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9jqb3FxlQ89lcX9c+DUyd5RfyNwCHhYb/d4Zovx3Iv8vN24026KHDW5L37nY9Qwjc7KuS5rondkiF6on50vvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T07:07:51.644471Z"},"content_sha256":"51483760cd726cf79d701df7870fa14a714366bf2040e508d782e5855201d55c","schema_version":"1.0","event_id":"sha256:51483760cd726cf79d701df7870fa14a714366bf2040e508d782e5855201d55c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BD56UO2LWP4VHQGWTSJDRXBBWO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:45:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eIc5OSC+sYFNvS6hgfRr++h6npLSYF6SfcEaW9+a95NOdvllNqa8lU9QH/8XhzQmXLjpTm4Vegsi5ybHVJExAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T07:07:51.644763Z"},"content_sha256":"8ef50da9105b2bbca0f50c17975d1937a88fcdc54114ab0ff96ce9a7c3636063","schema_version":"1.0","event_id":"sha256:8ef50da9105b2bbca0f50c17975d1937a88fcdc54114ab0ff96ce9a7c3636063"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BD56UO2LWP4VHQGWTSJDRXBBWO/bundle.json","state_url":"https://pith.science/pith/BD56UO2LWP4VHQGWTSJDRXBBWO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BD56UO2LWP4VHQGWTSJDRXBBWO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-21T07:07:51Z","links":{"resolver":"https://pith.science/pith/BD56UO2LWP4VHQGWTSJDRXBBWO","bundle":"https://pith.science/pith/BD56UO2LWP4VHQGWTSJDRXBBWO/bundle.json","state":"https://pith.science/pith/BD56UO2LWP4VHQGWTSJDRXBBWO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BD56UO2LWP4VHQGWTSJDRXBBWO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BD56UO2LWP4VHQGWTSJDRXBBWO","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":"c47683eda91009450fa65a80bf49b9a8de98201d87eee1644d3faf96ab484bfe","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-22T19:14:32Z","title_canon_sha256":"ebc4e39e4a32390aaa205bf72e2922c58af147c2c1dd420ed4c8ccfad7d920f4"},"schema_version":"1.0","source":{"id":"1704.06838","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.06838","created_at":"2026-05-18T00:45:55Z"},{"alias_kind":"arxiv_version","alias_value":"1704.06838v1","created_at":"2026-05-18T00:45:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06838","created_at":"2026-05-18T00:45:55Z"},{"alias_kind":"pith_short_12","alias_value":"BD56UO2LWP4V","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BD56UO2LWP4VHQGW","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BD56UO2L","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:8ef50da9105b2bbca0f50c17975d1937a88fcdc54114ab0ff96ce9a7c3636063","target":"graph","created_at":"2026-05-18T00:45:55Z","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"},"paper":{"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","authors_text":"Neda Masoud, R. Jayakrishnan","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-22T19:14:32Z","title":"A Decomposition Algorithm to Solve the Multi-Hop Peer-to-Peer Ride-Matching Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06838","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:51483760cd726cf79d701df7870fa14a714366bf2040e508d782e5855201d55c","target":"record","created_at":"2026-05-18T00:45:55Z","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":"c47683eda91009450fa65a80bf49b9a8de98201d87eee1644d3faf96ab484bfe","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-22T19:14:32Z","title_canon_sha256":"ebc4e39e4a32390aaa205bf72e2922c58af147c2c1dd420ed4c8ccfad7d920f4"},"schema_version":"1.0","source":{"id":"1704.06838","kind":"arxiv","version":1}},"canonical_sha256":"08fbea3b4bb3f953c0d69c9238dc21b38ed4790a78155d7918322162e691733c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08fbea3b4bb3f953c0d69c9238dc21b38ed4790a78155d7918322162e691733c","first_computed_at":"2026-05-18T00:45:55.618641Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:55.618641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kIzUz5Vf8JfD8tBRnIbiAa5PzIJakF8ZH2DVwKZtIE30Yg5ik3hA/+BqpaEL1acFc+DXv7t0DbdxF+JR+ffFCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:55.619173Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.06838","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51483760cd726cf79d701df7870fa14a714366bf2040e508d782e5855201d55c","sha256:8ef50da9105b2bbca0f50c17975d1937a88fcdc54114ab0ff96ce9a7c3636063"],"state_sha256":"36b345f9ac079cf992ca08a7c895a7b75e0fc260cee326ada7e0e6a4a854c76f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MwtatsAG2WOvNIzXl+oEJPcoV66Lmjq0QAjMPbMVnBYC+NV7Pmi57BZWlNvmy3OoI8WOre0RLdDCtLDY8kFIDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T07:07:51.648448Z","bundle_sha256":"ff0f5cf6fc06aa8e11c1806d1f71e67d3c7abfa468ff5231bfb38d1da009f349"}}