{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4CKCEXSSPHGXTVDEI3H3KPXDRX","short_pith_number":"pith:4CKCEXSS","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"},"canonical_sha256":"e094225e5279cd79d46446cfb53ee38ddbc242687ac029c255a0874accd9e12c","source":{"kind":"arxiv","id":"1807.06645","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.06645","created_at":"2026-05-18T00:01:32Z"},{"alias_kind":"arxiv_version","alias_value":"1807.06645v2","created_at":"2026-05-18T00:01:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06645","created_at":"2026-05-18T00:01:32Z"},{"alias_kind":"pith_short_12","alias_value":"4CKCEXSSPHGX","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4CKCEXSSPHGXTVDE","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4CKCEXSS","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4CKCEXSSPHGXTVDEI3H3KPXDRX","target":"record","payload":{"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"},"canonical_sha256":"e094225e5279cd79d46446cfb53ee38ddbc242687ac029c255a0874accd9e12c","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"},"source_kind":"arxiv","source_id":"1807.06645","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oIPhHZnESov8UCSIONANURpiMch8rZWslraTJW8h/5EPM74SomZ9lPhbPZHVtlr3JmWNziVlcUklgqhF4DC6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:14:21.512439Z"},"content_sha256":"c8200a18bcba19cf3a04a202c2b1668810c261e60b0cf02537b9d962803fd705","schema_version":"1.0","event_id":"sha256:c8200a18bcba19cf3a04a202c2b1668810c261e60b0cf02537b9d962803fd705"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4CKCEXSSPHGXTVDEI3H3KPXDRX","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zfdwpcfv17Ecn9Ppl9+RBTU1t8bXGA/6062FPJUpXbTG+qyTto4aG65ASIblvEZtz32IYf1YROeJPzsI6gQVDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:14:21.513175Z"},"content_sha256":"fd0b6fd4b992aa4fe88f22721fcfcfe570ce717ecc40a13cbb3839fd5b5435cf","schema_version":"1.0","event_id":"sha256:fd0b6fd4b992aa4fe88f22721fcfcfe570ce717ecc40a13cbb3839fd5b5435cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4CKCEXSSPHGXTVDEI3H3KPXDRX/bundle.json","state_url":"https://pith.science/pith/4CKCEXSSPHGXTVDEI3H3KPXDRX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4CKCEXSSPHGXTVDEI3H3KPXDRX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T19:14:21Z","links":{"resolver":"https://pith.science/pith/4CKCEXSSPHGXTVDEI3H3KPXDRX","bundle":"https://pith.science/pith/4CKCEXSSPHGXTVDEI3H3KPXDRX/bundle.json","state":"https://pith.science/pith/4CKCEXSSPHGXTVDEI3H3KPXDRX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4CKCEXSSPHGXTVDEI3H3KPXDRX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4CKCEXSSPHGXTVDEI3H3KPXDRX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d77a7eea6028b24662a59613f4a171dde23dad39b98f25defefa943e884a9436","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-17T20:04:54Z","title_canon_sha256":"88b239fa9ba9fada54953bc624ee93629df74fecd9dd40c256afb85ee31b425e"},"schema_version":"1.0","source":{"id":"1807.06645","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.06645","created_at":"2026-05-18T00:01:32Z"},{"alias_kind":"arxiv_version","alias_value":"1807.06645v2","created_at":"2026-05-18T00:01:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06645","created_at":"2026-05-18T00:01:32Z"},{"alias_kind":"pith_short_12","alias_value":"4CKCEXSSPHGX","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4CKCEXSSPHGXTVDE","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4CKCEXSS","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:fd0b6fd4b992aa4fe88f22721fcfcfe570ce717ecc40a13cbb3839fd5b5435cf","target":"graph","created_at":"2026-05-18T00:01:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Christian Coester, Elias Koutsoupias","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-17T20:04:54Z","title":"The Online $k$-Taxi Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06645","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c8200a18bcba19cf3a04a202c2b1668810c261e60b0cf02537b9d962803fd705","target":"record","created_at":"2026-05-18T00:01:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d77a7eea6028b24662a59613f4a171dde23dad39b98f25defefa943e884a9436","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-17T20:04:54Z","title_canon_sha256":"88b239fa9ba9fada54953bc624ee93629df74fecd9dd40c256afb85ee31b425e"},"schema_version":"1.0","source":{"id":"1807.06645","kind":"arxiv","version":2}},"canonical_sha256":"e094225e5279cd79d46446cfb53ee38ddbc242687ac029c255a0874accd9e12c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e094225e5279cd79d46446cfb53ee38ddbc242687ac029c255a0874accd9e12c","first_computed_at":"2026-05-18T00:01:32.728024Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:32.728024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eWQVev+AAUPSvrVN4SUvygVBb0dxks60rLCNq37dTl7vgVaUVprTbq/Q1Sa7TCnbGsYfNE7tThhh7mjCHOldBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:32.728556Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.06645","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8200a18bcba19cf3a04a202c2b1668810c261e60b0cf02537b9d962803fd705","sha256:fd0b6fd4b992aa4fe88f22721fcfcfe570ce717ecc40a13cbb3839fd5b5435cf"],"state_sha256":"76f1a2183d20a68e9768f99f3fd3f3776ac4feac5cb6b470ca4be646b43c7764"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4CmebB+HyjUYl78CuuW2SF3cyfh3WgrBGXyY0skbW3Ck1oitASZZG48YDaeYhJ3pLTV8jAJIAwhbfokg3xG0Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:14:21.516974Z","bundle_sha256":"56f2061353b947315ec3b8bd8c98caef54ca02072c5ffabbc64a94cded15a4e2"}}