{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:HIFHMIKRBAYSCGLKO225A52YJI","short_pith_number":"pith:HIFHMIKR","schema_version":"1.0","canonical_sha256":"3a0a762151083121196a76b5d077584a34d4eb9a1dbcd2afbabc32346e5a03cb","source":{"kind":"arxiv","id":"2210.14722","version":3},"attestation_state":"computed","paper":{"title":"Online TSP with Known Locations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bruno Escoffier, Evripidis Bampis, Michalis Xefteris, Niklas Hahn","submitted_at":"2022-10-26T13:51:49Z","abstract_excerpt":"In this paper, we consider the Online Traveling Salesperson Problem (OLTSP) where the locations of the requests are known in advance, but not their arrival times. We study both the open variant, in which the algorithm is not required to return to the origin when all the requests are served, as well as the closed variant, in which the algorithm has to return to the origin after serving all the requests. Our aim is to measure the impact of the extra knowledge of the locations on the competitiveness of the problem. We present an online 3/2-competitive algorithm for the general case and a matching"},"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":"2210.14722","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-10-26T13:51:49Z","cross_cats_sorted":[],"title_canon_sha256":"178a4661cdfaa966e4be928f84b564d04367cdba27904209fb653730d2b5e2de","abstract_canon_sha256":"ef2b18b2a857209c20d2c789ff6e3a9427a03bb36d13e6d5a466b0d3b8c04217"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:12:16.908057Z","signature_b64":"8s0+reAyxIX6TybALKheNDvwDuzm4C1amQ0N4M2BtU/p23VwmakKhCSIscgEAr5D64aO3sjJQBXlioJiVImqDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a0a762151083121196a76b5d077584a34d4eb9a1dbcd2afbabc32346e5a03cb","last_reissued_at":"2026-07-05T05:12:16.907637Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:12:16.907637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online TSP with Known Locations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bruno Escoffier, Evripidis Bampis, Michalis Xefteris, Niklas Hahn","submitted_at":"2022-10-26T13:51:49Z","abstract_excerpt":"In this paper, we consider the Online Traveling Salesperson Problem (OLTSP) where the locations of the requests are known in advance, but not their arrival times. We study both the open variant, in which the algorithm is not required to return to the origin when all the requests are served, as well as the closed variant, in which the algorithm has to return to the origin after serving all the requests. Our aim is to measure the impact of the extra knowledge of the locations on the competitiveness of the problem. We present an online 3/2-competitive algorithm for the general case and a matching"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.14722","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/2210.14722/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":"2210.14722","created_at":"2026-07-05T05:12:16.907697+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.14722v3","created_at":"2026-07-05T05:12:16.907697+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.14722","created_at":"2026-07-05T05:12:16.907697+00:00"},{"alias_kind":"pith_short_12","alias_value":"HIFHMIKRBAYS","created_at":"2026-07-05T05:12:16.907697+00:00"},{"alias_kind":"pith_short_16","alias_value":"HIFHMIKRBAYSCGLK","created_at":"2026-07-05T05:12:16.907697+00:00"},{"alias_kind":"pith_short_8","alias_value":"HIFHMIKR","created_at":"2026-07-05T05:12:16.907697+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/HIFHMIKRBAYSCGLKO225A52YJI","json":"https://pith.science/pith/HIFHMIKRBAYSCGLKO225A52YJI.json","graph_json":"https://pith.science/api/pith-number/HIFHMIKRBAYSCGLKO225A52YJI/graph.json","events_json":"https://pith.science/api/pith-number/HIFHMIKRBAYSCGLKO225A52YJI/events.json","paper":"https://pith.science/paper/HIFHMIKR"},"agent_actions":{"view_html":"https://pith.science/pith/HIFHMIKRBAYSCGLKO225A52YJI","download_json":"https://pith.science/pith/HIFHMIKRBAYSCGLKO225A52YJI.json","view_paper":"https://pith.science/paper/HIFHMIKR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.14722&json=true","fetch_graph":"https://pith.science/api/pith-number/HIFHMIKRBAYSCGLKO225A52YJI/graph.json","fetch_events":"https://pith.science/api/pith-number/HIFHMIKRBAYSCGLKO225A52YJI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HIFHMIKRBAYSCGLKO225A52YJI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HIFHMIKRBAYSCGLKO225A52YJI/action/storage_attestation","attest_author":"https://pith.science/pith/HIFHMIKRBAYSCGLKO225A52YJI/action/author_attestation","sign_citation":"https://pith.science/pith/HIFHMIKRBAYSCGLKO225A52YJI/action/citation_signature","submit_replication":"https://pith.science/pith/HIFHMIKRBAYSCGLKO225A52YJI/action/replication_record"}},"created_at":"2026-07-05T05:12:16.907697+00:00","updated_at":"2026-07-05T05:12:16.907697+00:00"}