{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FZBUBL7O4WHBZRPSBSKI5QGEIN","short_pith_number":"pith:FZBUBL7O","schema_version":"1.0","canonical_sha256":"2e4340afeee58e1cc5f20c948ec0c44340258acdcb09157f791fa669e3895e78","source":{"kind":"arxiv","id":"2407.08238","version":1},"attestation_state":"computed","paper":{"title":"Integrated User Matching and Pricing in Round-Trip Car-Sharing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Avalpreet Singh Brar, Gioele Zardini, Jaskaranveer Kaur, Rong Su","submitted_at":"2024-07-11T07:28:40Z","abstract_excerpt":"Traditional round-trip car rental systems mandate users to return vehicles to their point of origin, limiting the system adaptability to meet diverse mobility demands. This constraint often leads to fleet under-utilization and incurs high parking costs for idle vehicles. To address this inefficiency, we propose a N-user matching algorithm which is designed to facilitate one-way trips within the round-trip rental framework. Our algorithm addresses the joint problem of optimal pricing and user matching through a Two-Stage Integer Linear Programming (ILP)-based formulation. In the first stage, op"},"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":"2407.08238","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2024-07-11T07:28:40Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"253297b87124324a3553ac5a3c51d96d25fb5c7cbadde48d73c1d2ac1e4e0cb4","abstract_canon_sha256":"59884fba91c4e6066fb26ec25a8c4a667843f8cf94af8816861fbc68eb301483"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:42:45.359068Z","signature_b64":"+y3XRAwNbbCTilXdALjZRvam1dSmYlL88RLZY86b4xXEI2Sxr1mDUkkPnpr66I/FREvKPLM7m2B99gKRAFL7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e4340afeee58e1cc5f20c948ec0c44340258acdcb09157f791fa669e3895e78","last_reissued_at":"2026-07-05T08:42:45.358584Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:42:45.358584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Integrated User Matching and Pricing in Round-Trip Car-Sharing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Avalpreet Singh Brar, Gioele Zardini, Jaskaranveer Kaur, Rong Su","submitted_at":"2024-07-11T07:28:40Z","abstract_excerpt":"Traditional round-trip car rental systems mandate users to return vehicles to their point of origin, limiting the system adaptability to meet diverse mobility demands. This constraint often leads to fleet under-utilization and incurs high parking costs for idle vehicles. To address this inefficiency, we propose a N-user matching algorithm which is designed to facilitate one-way trips within the round-trip rental framework. Our algorithm addresses the joint problem of optimal pricing and user matching through a Two-Stage Integer Linear Programming (ILP)-based formulation. In the first stage, op"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.08238","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.08238/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":"2407.08238","created_at":"2026-07-05T08:42:45.358645+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.08238v1","created_at":"2026-07-05T08:42:45.358645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.08238","created_at":"2026-07-05T08:42:45.358645+00:00"},{"alias_kind":"pith_short_12","alias_value":"FZBUBL7O4WHB","created_at":"2026-07-05T08:42:45.358645+00:00"},{"alias_kind":"pith_short_16","alias_value":"FZBUBL7O4WHBZRPS","created_at":"2026-07-05T08:42:45.358645+00:00"},{"alias_kind":"pith_short_8","alias_value":"FZBUBL7O","created_at":"2026-07-05T08:42:45.358645+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.16632","citing_title":"Vehicle Rebalancing Under Adherence Uncertainty","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FZBUBL7O4WHBZRPSBSKI5QGEIN","json":"https://pith.science/pith/FZBUBL7O4WHBZRPSBSKI5QGEIN.json","graph_json":"https://pith.science/api/pith-number/FZBUBL7O4WHBZRPSBSKI5QGEIN/graph.json","events_json":"https://pith.science/api/pith-number/FZBUBL7O4WHBZRPSBSKI5QGEIN/events.json","paper":"https://pith.science/paper/FZBUBL7O"},"agent_actions":{"view_html":"https://pith.science/pith/FZBUBL7O4WHBZRPSBSKI5QGEIN","download_json":"https://pith.science/pith/FZBUBL7O4WHBZRPSBSKI5QGEIN.json","view_paper":"https://pith.science/paper/FZBUBL7O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.08238&json=true","fetch_graph":"https://pith.science/api/pith-number/FZBUBL7O4WHBZRPSBSKI5QGEIN/graph.json","fetch_events":"https://pith.science/api/pith-number/FZBUBL7O4WHBZRPSBSKI5QGEIN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FZBUBL7O4WHBZRPSBSKI5QGEIN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FZBUBL7O4WHBZRPSBSKI5QGEIN/action/storage_attestation","attest_author":"https://pith.science/pith/FZBUBL7O4WHBZRPSBSKI5QGEIN/action/author_attestation","sign_citation":"https://pith.science/pith/FZBUBL7O4WHBZRPSBSKI5QGEIN/action/citation_signature","submit_replication":"https://pith.science/pith/FZBUBL7O4WHBZRPSBSKI5QGEIN/action/replication_record"}},"created_at":"2026-07-05T08:42:45.358645+00:00","updated_at":"2026-07-05T08:42:45.358645+00:00"}