{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:53RNBBPEGPX7JMOJT4VDWAZYBY","short_pith_number":"pith:53RNBBPE","canonical_record":{"source":{"id":"1501.06158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-25T13:52:36Z","cross_cats_sorted":[],"title_canon_sha256":"945eee4e0a09591c6d9882f7886abed3c4fcf7013027f19b001a7ee4dbabe4de","abstract_canon_sha256":"1d5994a638d016331adbc9623f048bb0cd666e628e6571960752b9b11064228e"},"schema_version":"1.0"},"canonical_sha256":"eee2d085e433eff4b1c99f2a3b03380e0e4d7a470a712a118c1d1ece381e5741","source":{"kind":"arxiv","id":"1501.06158","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06158","created_at":"2026-05-18T02:28:42Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06158v1","created_at":"2026-05-18T02:28:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06158","created_at":"2026-05-18T02:28:42Z"},{"alias_kind":"pith_short_12","alias_value":"53RNBBPEGPX7","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"53RNBBPEGPX7JMOJ","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"53RNBBPE","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:53RNBBPEGPX7JMOJT4VDWAZYBY","target":"record","payload":{"canonical_record":{"source":{"id":"1501.06158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-25T13:52:36Z","cross_cats_sorted":[],"title_canon_sha256":"945eee4e0a09591c6d9882f7886abed3c4fcf7013027f19b001a7ee4dbabe4de","abstract_canon_sha256":"1d5994a638d016331adbc9623f048bb0cd666e628e6571960752b9b11064228e"},"schema_version":"1.0"},"canonical_sha256":"eee2d085e433eff4b1c99f2a3b03380e0e4d7a470a712a118c1d1ece381e5741","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:42.188446Z","signature_b64":"40W3vw5OxbRhNxk0x8Gm7KE75Kg2uMKChfAI3LRK31fEX8NqFJXIDpkJctpkbRpQ4h5KxZymOtfGm8WtVUvzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eee2d085e433eff4b1c99f2a3b03380e0e4d7a470a712a118c1d1ece381e5741","last_reissued_at":"2026-05-18T02:28:42.187793Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:42.187793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.06158","source_version":1,"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-18T02:28:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EwW+QwbiwA2dBUdJCagnT7dRIoOzZtRrQFvWj2gFIc3JE+/kQYuLJOPLffcha1dxPSP551wURhqxMx4rSpaQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:56:37.885953Z"},"content_sha256":"8d57b3e1fe1ec39518559525a7cd5f24e851dc0fc6112c498217e0cde7b1b471","schema_version":"1.0","event_id":"sha256:8d57b3e1fe1ec39518559525a7cd5f24e851dc0fc6112c498217e0cde7b1b471"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:53RNBBPEGPX7JMOJT4VDWAZYBY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TSP with Time Windows and Service Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adi Vardi, Yossi Azar","submitted_at":"2015-01-25T13:52:36Z","abstract_excerpt":"We consider TSP with time windows and service time. In this problem we receive a sequence of requests for a service at nodes in a metric space and a time window for each request. The goal of the online algorithm is to maximize the number of requests served during their time window. The time to traverse an edge is the distance between the incident nodes of that edge. Serving a request requires unit time. We characterize the competitive ratio for each metric space separately. The competitive ratio depends on the relation between the minimum laxity (the minimum length of a time window) and the di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06158","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"},"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-18T02:28:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ITJK+aOH1q+RNcfHWoI4GPVsojw3rJp2jgRfnBH2HO3DljxSfP7mxK3J5iSIrQ+cX8doQ+qfCEtKrrG1LvXAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:56:37.886472Z"},"content_sha256":"14aa01b2e654d3d64ed4f846295d1cf45e59a288bc8d5a012b8ac1cd991106d7","schema_version":"1.0","event_id":"sha256:14aa01b2e654d3d64ed4f846295d1cf45e59a288bc8d5a012b8ac1cd991106d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/53RNBBPEGPX7JMOJT4VDWAZYBY/bundle.json","state_url":"https://pith.science/pith/53RNBBPEGPX7JMOJT4VDWAZYBY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/53RNBBPEGPX7JMOJT4VDWAZYBY/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-05-27T20:56:37Z","links":{"resolver":"https://pith.science/pith/53RNBBPEGPX7JMOJT4VDWAZYBY","bundle":"https://pith.science/pith/53RNBBPEGPX7JMOJT4VDWAZYBY/bundle.json","state":"https://pith.science/pith/53RNBBPEGPX7JMOJT4VDWAZYBY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/53RNBBPEGPX7JMOJT4VDWAZYBY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:53RNBBPEGPX7JMOJT4VDWAZYBY","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":"1d5994a638d016331adbc9623f048bb0cd666e628e6571960752b9b11064228e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-25T13:52:36Z","title_canon_sha256":"945eee4e0a09591c6d9882f7886abed3c4fcf7013027f19b001a7ee4dbabe4de"},"schema_version":"1.0","source":{"id":"1501.06158","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06158","created_at":"2026-05-18T02:28:42Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06158v1","created_at":"2026-05-18T02:28:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06158","created_at":"2026-05-18T02:28:42Z"},{"alias_kind":"pith_short_12","alias_value":"53RNBBPEGPX7","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"53RNBBPEGPX7JMOJ","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"53RNBBPE","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:14aa01b2e654d3d64ed4f846295d1cf45e59a288bc8d5a012b8ac1cd991106d7","target":"graph","created_at":"2026-05-18T02:28:42Z","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 TSP with time windows and service time. In this problem we receive a sequence of requests for a service at nodes in a metric space and a time window for each request. The goal of the online algorithm is to maximize the number of requests served during their time window. The time to traverse an edge is the distance between the incident nodes of that edge. Serving a request requires unit time. We characterize the competitive ratio for each metric space separately. The competitive ratio depends on the relation between the minimum laxity (the minimum length of a time window) and the di","authors_text":"Adi Vardi, Yossi Azar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-25T13:52:36Z","title":"TSP with Time Windows and Service Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06158","kind":"arxiv","version":1},"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:8d57b3e1fe1ec39518559525a7cd5f24e851dc0fc6112c498217e0cde7b1b471","target":"record","created_at":"2026-05-18T02:28:42Z","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":"1d5994a638d016331adbc9623f048bb0cd666e628e6571960752b9b11064228e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-25T13:52:36Z","title_canon_sha256":"945eee4e0a09591c6d9882f7886abed3c4fcf7013027f19b001a7ee4dbabe4de"},"schema_version":"1.0","source":{"id":"1501.06158","kind":"arxiv","version":1}},"canonical_sha256":"eee2d085e433eff4b1c99f2a3b03380e0e4d7a470a712a118c1d1ece381e5741","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eee2d085e433eff4b1c99f2a3b03380e0e4d7a470a712a118c1d1ece381e5741","first_computed_at":"2026-05-18T02:28:42.187793Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:42.187793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"40W3vw5OxbRhNxk0x8Gm7KE75Kg2uMKChfAI3LRK31fEX8NqFJXIDpkJctpkbRpQ4h5KxZymOtfGm8WtVUvzDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:42.188446Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.06158","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d57b3e1fe1ec39518559525a7cd5f24e851dc0fc6112c498217e0cde7b1b471","sha256:14aa01b2e654d3d64ed4f846295d1cf45e59a288bc8d5a012b8ac1cd991106d7"],"state_sha256":"0b6aafa8b0d5e0676c3d451371eda2b822a6281df375743532a0f844d2958841"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cs4G29PyWtXYMdivs973ANrb9M3TbNnyVvRkZPjiflw5/76b5fDIhVHKgWt3iB6coIgqDn2TTrxtB0UT12XnAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:56:37.889659Z","bundle_sha256":"4045686e347b6b289025835548b993dd8b1897a544bd0f64299d87c3c1bfe6d2"}}