{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:X4P743VHKWIZJH6KANZDTU6AHC","short_pith_number":"pith:X4P743VH","schema_version":"1.0","canonical_sha256":"bf1ffe6ea75591949fca037239d3c038aa9929467bd57a9858d3d5fa91d6ea00","source":{"kind":"arxiv","id":"1901.04272","version":1},"attestation_state":"computed","paper":{"title":"Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Alexander Birx, Yann Disser","submitted_at":"2019-01-14T12:58:51Z","abstract_excerpt":"The online Dial-a-Ride problem is a fundamental online problem in a metric space, where transportation requests appear over time and may be served in any order by a single server with unit speed. Restricted to the real line, online Dial-a-Ride captures natural problems like controlling a personal elevator. Tight results in terms of competitive ratios are known for the general setting and for online TSP on the line (where source and target of each request coincide). In contrast, online Dial-a-Ride on the line has resisted tight analysis so far, even though it is a very natural online problem. W"},"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":"1901.04272","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-14T12:58:51Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"74802562a6d25baedf0df96e44b204a00362535432fa9d067261bb6fe3a4d375","abstract_canon_sha256":"4392bbc923e9f8be599ed989c4e509038150ec18a4e4cc8821155ac00229de51"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:25.956305Z","signature_b64":"WOR2yEURlew50znx5HH+fB5ljLYI1ELdL9YjvIcp439ocJX8TweiCI/et50Bby4PtZJ9YCoYLlSMyJUpN8wKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf1ffe6ea75591949fca037239d3c038aa9929467bd57a9858d3d5fa91d6ea00","last_reissued_at":"2026-05-17T23:56:25.955747Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:25.955747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Alexander Birx, Yann Disser","submitted_at":"2019-01-14T12:58:51Z","abstract_excerpt":"The online Dial-a-Ride problem is a fundamental online problem in a metric space, where transportation requests appear over time and may be served in any order by a single server with unit speed. Restricted to the real line, online Dial-a-Ride captures natural problems like controlling a personal elevator. Tight results in terms of competitive ratios are known for the general setting and for online TSP on the line (where source and target of each request coincide). In contrast, online Dial-a-Ride on the line has resisted tight analysis so far, even though it is a very natural online problem. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.04272","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":"1901.04272","created_at":"2026-05-17T23:56:25.955854+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.04272v1","created_at":"2026-05-17T23:56:25.955854+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04272","created_at":"2026-05-17T23:56:25.955854+00:00"},{"alias_kind":"pith_short_12","alias_value":"X4P743VHKWIZ","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"X4P743VHKWIZJH6K","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"X4P743VH","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.02858","citing_title":"Improved Bounds for Open Online Dial-a-Ride on the Line","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X4P743VHKWIZJH6KANZDTU6AHC","json":"https://pith.science/pith/X4P743VHKWIZJH6KANZDTU6AHC.json","graph_json":"https://pith.science/api/pith-number/X4P743VHKWIZJH6KANZDTU6AHC/graph.json","events_json":"https://pith.science/api/pith-number/X4P743VHKWIZJH6KANZDTU6AHC/events.json","paper":"https://pith.science/paper/X4P743VH"},"agent_actions":{"view_html":"https://pith.science/pith/X4P743VHKWIZJH6KANZDTU6AHC","download_json":"https://pith.science/pith/X4P743VHKWIZJH6KANZDTU6AHC.json","view_paper":"https://pith.science/paper/X4P743VH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.04272&json=true","fetch_graph":"https://pith.science/api/pith-number/X4P743VHKWIZJH6KANZDTU6AHC/graph.json","fetch_events":"https://pith.science/api/pith-number/X4P743VHKWIZJH6KANZDTU6AHC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X4P743VHKWIZJH6KANZDTU6AHC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X4P743VHKWIZJH6KANZDTU6AHC/action/storage_attestation","attest_author":"https://pith.science/pith/X4P743VHKWIZJH6KANZDTU6AHC/action/author_attestation","sign_citation":"https://pith.science/pith/X4P743VHKWIZJH6KANZDTU6AHC/action/citation_signature","submit_replication":"https://pith.science/pith/X4P743VHKWIZJH6KANZDTU6AHC/action/replication_record"}},"created_at":"2026-05-17T23:56:25.955854+00:00","updated_at":"2026-05-17T23:56:25.955854+00:00"}