{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:54SDODXD5INB2ABI5JZDCTKX4H","short_pith_number":"pith:54SDODXD","schema_version":"1.0","canonical_sha256":"ef24370ee3ea1a1d0028ea72314d57e1c1a91fb921f9470980b8c486d857a899","source":{"kind":"arxiv","id":"1904.11017","version":2},"attestation_state":"computed","paper":{"title":"The Commute Trip Sharing Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"math.OC","authors_text":"Antoine Legrain, Mohd Hafiz Hasan, Pascal Van Hentenryck","submitted_at":"2019-04-24T18:59:01Z","abstract_excerpt":"Parking pressure has been steadily increasing in cities as well as in university and corporate campuses. To relieve this pressure, this paper studies a car-pooling platform that would match riders and drivers, while guaranteeing a ride back and exploiting spatial and temporal locality. In particular, the paper formalizes the Commute Trip Sharing Problem (CTSP) to find a routing plan that maximizes ride sharing for a set of commute trips. The CTSP is a generalization of the vehicle routing problem with routes that satisfy time window, capacity, pairing, precedence, ride duration, and driver con"},"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":"1904.11017","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-24T18:59:01Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b390ff936826e9761abaed5b573f46b44cd0c30a927c4e97da6e0a1d3aa51f46","abstract_canon_sha256":"f3fcc0a9cfc987b25d74a8c34d9a0d445e0b5fd1ae40c5b68a1beb0602251954"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:04:41.501327Z","signature_b64":"92gWdzm0/YnLZJlhvxINJWOab1jKT9FlFuQ59xPQ2tAhetWY1vjtSU8qSSd/5WUPZdYzcovXxG9Yo+zx2tnfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef24370ee3ea1a1d0028ea72314d57e1c1a91fb921f9470980b8c486d857a899","last_reissued_at":"2026-07-05T00:04:41.500892Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:04:41.500892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Commute Trip Sharing Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"math.OC","authors_text":"Antoine Legrain, Mohd Hafiz Hasan, Pascal Van Hentenryck","submitted_at":"2019-04-24T18:59:01Z","abstract_excerpt":"Parking pressure has been steadily increasing in cities as well as in university and corporate campuses. To relieve this pressure, this paper studies a car-pooling platform that would match riders and drivers, while guaranteeing a ride back and exploiting spatial and temporal locality. In particular, the paper formalizes the Commute Trip Sharing Problem (CTSP) to find a routing plan that maximizes ride sharing for a set of commute trips. The CTSP is a generalization of the vehicle routing problem with routes that satisfy time window, capacity, pairing, precedence, ride duration, and driver con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11017","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1904.11017/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1904.11017","created_at":"2026-07-05T00:04:41.500955+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.11017v2","created_at":"2026-07-05T00:04:41.500955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11017","created_at":"2026-07-05T00:04:41.500955+00:00"},{"alias_kind":"pith_short_12","alias_value":"54SDODXD5INB","created_at":"2026-07-05T00:04:41.500955+00:00"},{"alias_kind":"pith_short_16","alias_value":"54SDODXD5INB2ABI","created_at":"2026-07-05T00:04:41.500955+00:00"},{"alias_kind":"pith_short_8","alias_value":"54SDODXD","created_at":"2026-07-05T00:04:41.500955+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/54SDODXD5INB2ABI5JZDCTKX4H","json":"https://pith.science/pith/54SDODXD5INB2ABI5JZDCTKX4H.json","graph_json":"https://pith.science/api/pith-number/54SDODXD5INB2ABI5JZDCTKX4H/graph.json","events_json":"https://pith.science/api/pith-number/54SDODXD5INB2ABI5JZDCTKX4H/events.json","paper":"https://pith.science/paper/54SDODXD"},"agent_actions":{"view_html":"https://pith.science/pith/54SDODXD5INB2ABI5JZDCTKX4H","download_json":"https://pith.science/pith/54SDODXD5INB2ABI5JZDCTKX4H.json","view_paper":"https://pith.science/paper/54SDODXD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.11017&json=true","fetch_graph":"https://pith.science/api/pith-number/54SDODXD5INB2ABI5JZDCTKX4H/graph.json","fetch_events":"https://pith.science/api/pith-number/54SDODXD5INB2ABI5JZDCTKX4H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/54SDODXD5INB2ABI5JZDCTKX4H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/54SDODXD5INB2ABI5JZDCTKX4H/action/storage_attestation","attest_author":"https://pith.science/pith/54SDODXD5INB2ABI5JZDCTKX4H/action/author_attestation","sign_citation":"https://pith.science/pith/54SDODXD5INB2ABI5JZDCTKX4H/action/citation_signature","submit_replication":"https://pith.science/pith/54SDODXD5INB2ABI5JZDCTKX4H/action/replication_record"}},"created_at":"2026-07-05T00:04:41.500955+00:00","updated_at":"2026-07-05T00:04:41.500955+00:00"}