{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:RFVBWREWAMO3ZYSSBS7DY27T2X","short_pith_number":"pith:RFVBWREW","schema_version":"1.0","canonical_sha256":"896a1b4496031dbce2520cbe3c6bf3d5e203127ce27a55d3601f5e845fd58412","source":{"kind":"arxiv","id":"2103.07367","version":3},"attestation_state":"computed","paper":{"title":"Tight Competitive Analyses of Online Car-sharing Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ho-Lin Chen, Kazuo Iwama, Kuan-Yun Lai, Ya-Chun Liang","submitted_at":"2021-03-12T16:03:44Z","abstract_excerpt":"The car-sharing problem, proposed by Luo, Erlebach and Xu in 2018, mainly focuses on an online model in which there are two locations: 0 and 1, and $k$ total cars. Each request which specifies its pick-up time and pick-up location (among 0 and 1, and the other is the drop-off location) is released in each stage a fixed amount of time before its specified start (i.e. pick-up) time. The time between the booking (i.e. released) time and the start time is enough to move empty cars between 0 and 1 for relocation if they are not used in that stage. The model, called $k$S2L-F, assumes that requests i"},"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":"2103.07367","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-03-12T16:03:44Z","cross_cats_sorted":[],"title_canon_sha256":"380a864f2e62d6cacad3fed10f902a06e63b9035ccd034ab0ef8b4b2373c4c00","abstract_canon_sha256":"c898172787d92368b8c013dafe9a1c8f46f3d2416f6b75c3c144300e6607ac73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:55:12.556780Z","signature_b64":"m7by8umBtWdF7ov5t0QTiY9fxzEb0B1vKbihwhAVq9f/O+Xvm3yh29BHl89pARiBDVdLwlv6Sp2/PQGQsKRtDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"896a1b4496031dbce2520cbe3c6bf3d5e203127ce27a55d3601f5e845fd58412","last_reissued_at":"2026-07-05T02:55:12.556284Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:55:12.556284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Competitive Analyses of Online Car-sharing Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ho-Lin Chen, Kazuo Iwama, Kuan-Yun Lai, Ya-Chun Liang","submitted_at":"2021-03-12T16:03:44Z","abstract_excerpt":"The car-sharing problem, proposed by Luo, Erlebach and Xu in 2018, mainly focuses on an online model in which there are two locations: 0 and 1, and $k$ total cars. Each request which specifies its pick-up time and pick-up location (among 0 and 1, and the other is the drop-off location) is released in each stage a fixed amount of time before its specified start (i.e. pick-up) time. The time between the booking (i.e. released) time and the start time is enough to move empty cars between 0 and 1 for relocation if they are not used in that stage. The model, called $k$S2L-F, assumes that requests i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.07367","kind":"arxiv","version":3},"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/2103.07367/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":"2103.07367","created_at":"2026-07-05T02:55:12.556345+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.07367v3","created_at":"2026-07-05T02:55:12.556345+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.07367","created_at":"2026-07-05T02:55:12.556345+00:00"},{"alias_kind":"pith_short_12","alias_value":"RFVBWREWAMO3","created_at":"2026-07-05T02:55:12.556345+00:00"},{"alias_kind":"pith_short_16","alias_value":"RFVBWREWAMO3ZYSS","created_at":"2026-07-05T02:55:12.556345+00:00"},{"alias_kind":"pith_short_8","alias_value":"RFVBWREW","created_at":"2026-07-05T02:55:12.556345+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/RFVBWREWAMO3ZYSSBS7DY27T2X","json":"https://pith.science/pith/RFVBWREWAMO3ZYSSBS7DY27T2X.json","graph_json":"https://pith.science/api/pith-number/RFVBWREWAMO3ZYSSBS7DY27T2X/graph.json","events_json":"https://pith.science/api/pith-number/RFVBWREWAMO3ZYSSBS7DY27T2X/events.json","paper":"https://pith.science/paper/RFVBWREW"},"agent_actions":{"view_html":"https://pith.science/pith/RFVBWREWAMO3ZYSSBS7DY27T2X","download_json":"https://pith.science/pith/RFVBWREWAMO3ZYSSBS7DY27T2X.json","view_paper":"https://pith.science/paper/RFVBWREW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.07367&json=true","fetch_graph":"https://pith.science/api/pith-number/RFVBWREWAMO3ZYSSBS7DY27T2X/graph.json","fetch_events":"https://pith.science/api/pith-number/RFVBWREWAMO3ZYSSBS7DY27T2X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RFVBWREWAMO3ZYSSBS7DY27T2X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RFVBWREWAMO3ZYSSBS7DY27T2X/action/storage_attestation","attest_author":"https://pith.science/pith/RFVBWREWAMO3ZYSSBS7DY27T2X/action/author_attestation","sign_citation":"https://pith.science/pith/RFVBWREWAMO3ZYSSBS7DY27T2X/action/citation_signature","submit_replication":"https://pith.science/pith/RFVBWREWAMO3ZYSSBS7DY27T2X/action/replication_record"}},"created_at":"2026-07-05T02:55:12.556345+00:00","updated_at":"2026-07-05T02:55:12.556345+00:00"}