{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4CKCEXSSPHGXTVDEI3H3KPXDRX","short_pith_number":"pith:4CKCEXSS","schema_version":"1.0","canonical_sha256":"e094225e5279cd79d46446cfb53ee38ddbc242687ac029c255a0874accd9e12c","source":{"kind":"arxiv","id":"1807.06645","version":2},"attestation_state":"computed","paper":{"title":"The Online $k$-Taxi Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Coester, Elias Koutsoupias","submitted_at":"2018-07-17T20:04:54Z","abstract_excerpt":"We consider the online $k$-taxi problem, a generalization of the $k$-server problem, in which $k$ taxis serve a sequence of requests in a metric space. A request consists of two points $s$ and $t$, representing a passenger that wants to be carried by a taxi from $s$ to $t$. The goal is to serve all requests while minimizing the total distance traveled by all taxis. The problem comes in two flavors, called the easy and the hard $k$-taxi problem: In the easy $k$-taxi problem, the cost is defined as the total distance traveled by the taxis; in the hard $k$-taxi problem, the cost is only the dista"},"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":"1807.06645","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-17T20:04:54Z","cross_cats_sorted":[],"title_canon_sha256":"88b239fa9ba9fada54953bc624ee93629df74fecd9dd40c256afb85ee31b425e","abstract_canon_sha256":"d77a7eea6028b24662a59613f4a171dde23dad39b98f25defefa943e884a9436"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:32.728556Z","signature_b64":"eWQVev+AAUPSvrVN4SUvygVBb0dxks60rLCNq37dTl7vgVaUVprTbq/Q1Sa7TCnbGsYfNE7tThhh7mjCHOldBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e094225e5279cd79d46446cfb53ee38ddbc242687ac029c255a0874accd9e12c","last_reissued_at":"2026-05-18T00:01:32.728024Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:32.728024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Online $k$-Taxi Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Coester, Elias Koutsoupias","submitted_at":"2018-07-17T20:04:54Z","abstract_excerpt":"We consider the online $k$-taxi problem, a generalization of the $k$-server problem, in which $k$ taxis serve a sequence of requests in a metric space. A request consists of two points $s$ and $t$, representing a passenger that wants to be carried by a taxi from $s$ to $t$. The goal is to serve all requests while minimizing the total distance traveled by all taxis. The problem comes in two flavors, called the easy and the hard $k$-taxi problem: In the easy $k$-taxi problem, the cost is defined as the total distance traveled by the taxis; in the hard $k$-taxi problem, the cost is only the dista"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06645","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":""},"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":"1807.06645","created_at":"2026-05-18T00:01:32.728107+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.06645v2","created_at":"2026-05-18T00:01:32.728107+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06645","created_at":"2026-05-18T00:01:32.728107+00:00"},{"alias_kind":"pith_short_12","alias_value":"4CKCEXSSPHGX","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4CKCEXSSPHGXTVDE","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4CKCEXSS","created_at":"2026-05-18T12:32:05.422762+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/4CKCEXSSPHGXTVDEI3H3KPXDRX","json":"https://pith.science/pith/4CKCEXSSPHGXTVDEI3H3KPXDRX.json","graph_json":"https://pith.science/api/pith-number/4CKCEXSSPHGXTVDEI3H3KPXDRX/graph.json","events_json":"https://pith.science/api/pith-number/4CKCEXSSPHGXTVDEI3H3KPXDRX/events.json","paper":"https://pith.science/paper/4CKCEXSS"},"agent_actions":{"view_html":"https://pith.science/pith/4CKCEXSSPHGXTVDEI3H3KPXDRX","download_json":"https://pith.science/pith/4CKCEXSSPHGXTVDEI3H3KPXDRX.json","view_paper":"https://pith.science/paper/4CKCEXSS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.06645&json=true","fetch_graph":"https://pith.science/api/pith-number/4CKCEXSSPHGXTVDEI3H3KPXDRX/graph.json","fetch_events":"https://pith.science/api/pith-number/4CKCEXSSPHGXTVDEI3H3KPXDRX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4CKCEXSSPHGXTVDEI3H3KPXDRX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4CKCEXSSPHGXTVDEI3H3KPXDRX/action/storage_attestation","attest_author":"https://pith.science/pith/4CKCEXSSPHGXTVDEI3H3KPXDRX/action/author_attestation","sign_citation":"https://pith.science/pith/4CKCEXSSPHGXTVDEI3H3KPXDRX/action/citation_signature","submit_replication":"https://pith.science/pith/4CKCEXSSPHGXTVDEI3H3KPXDRX/action/replication_record"}},"created_at":"2026-05-18T00:01:32.728107+00:00","updated_at":"2026-05-18T00:01:32.728107+00:00"}