{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:E2NRGW6JNLBLJJCDCH3T4JKRNB","short_pith_number":"pith:E2NRGW6J","schema_version":"1.0","canonical_sha256":"269b135bc96ac2b4a44311f73e255168721e8bc8bdc7451c35bddbeec4bfcccb","source":{"kind":"arxiv","id":"1307.4289","version":3},"attestation_state":"computed","paper":{"title":"Polynomial time approximation schemes for the traveling repairman and other minimum latency problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ren\\'e Sitters","submitted_at":"2013-07-16T14:38:01Z","abstract_excerpt":"We give a polynomial time, $(1+\\epsilon)$-approximation algorithm for the traveling repairman problem (TRP) in the Euclidean plane and on weighted trees. This improves on the known quasi-polynomial time approximation schemes for these problems. The algorithm is based on a simple technique that reduces the TRP to what we call the \\emph{segmented TSP}. Here, we are given numbers $l_1,\\dots,l_K$ and $n_1,\\dots,n_K$ and we need to find a path that visits at least $n_h$ points within path distance $l_h$ from the starting point for all $h\\in\\{1,\\dots,K\\}$. A solution is $\\alpha$-approximate if at le"},"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":"1307.4289","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-16T14:38:01Z","cross_cats_sorted":[],"title_canon_sha256":"9d9e56ec700361a6643abcfdce5b1a88f9647e791ae4e6ac3d13bb000084792c","abstract_canon_sha256":"2ffe0c9c88f2eaccd04755ccb1d5f228276a6c46791f48250a7234e88625b9cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:28.849628Z","signature_b64":"TgpHKvPvOZEImn1hGuvrwAFEIaY00qgUSkTBu8Xr3HtNGi1dRZonZ2jujx7DN/uG0zAE6WFFax4MoSdcGtWxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"269b135bc96ac2b4a44311f73e255168721e8bc8bdc7451c35bddbeec4bfcccb","last_reissued_at":"2026-05-18T02:42:28.848033Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:28.848033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial time approximation schemes for the traveling repairman and other minimum latency problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ren\\'e Sitters","submitted_at":"2013-07-16T14:38:01Z","abstract_excerpt":"We give a polynomial time, $(1+\\epsilon)$-approximation algorithm for the traveling repairman problem (TRP) in the Euclidean plane and on weighted trees. This improves on the known quasi-polynomial time approximation schemes for these problems. The algorithm is based on a simple technique that reduces the TRP to what we call the \\emph{segmented TSP}. Here, we are given numbers $l_1,\\dots,l_K$ and $n_1,\\dots,n_K$ and we need to find a path that visits at least $n_h$ points within path distance $l_h$ from the starting point for all $h\\in\\{1,\\dots,K\\}$. A solution is $\\alpha$-approximate if at le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4289","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":""},"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":"1307.4289","created_at":"2026-05-18T02:42:28.848203+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.4289v3","created_at":"2026-05-18T02:42:28.848203+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4289","created_at":"2026-05-18T02:42:28.848203+00:00"},{"alias_kind":"pith_short_12","alias_value":"E2NRGW6JNLBL","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"E2NRGW6JNLBLJJCD","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"E2NRGW6J","created_at":"2026-05-18T12:27:43.054852+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/E2NRGW6JNLBLJJCDCH3T4JKRNB","json":"https://pith.science/pith/E2NRGW6JNLBLJJCDCH3T4JKRNB.json","graph_json":"https://pith.science/api/pith-number/E2NRGW6JNLBLJJCDCH3T4JKRNB/graph.json","events_json":"https://pith.science/api/pith-number/E2NRGW6JNLBLJJCDCH3T4JKRNB/events.json","paper":"https://pith.science/paper/E2NRGW6J"},"agent_actions":{"view_html":"https://pith.science/pith/E2NRGW6JNLBLJJCDCH3T4JKRNB","download_json":"https://pith.science/pith/E2NRGW6JNLBLJJCDCH3T4JKRNB.json","view_paper":"https://pith.science/paper/E2NRGW6J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.4289&json=true","fetch_graph":"https://pith.science/api/pith-number/E2NRGW6JNLBLJJCDCH3T4JKRNB/graph.json","fetch_events":"https://pith.science/api/pith-number/E2NRGW6JNLBLJJCDCH3T4JKRNB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E2NRGW6JNLBLJJCDCH3T4JKRNB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E2NRGW6JNLBLJJCDCH3T4JKRNB/action/storage_attestation","attest_author":"https://pith.science/pith/E2NRGW6JNLBLJJCDCH3T4JKRNB/action/author_attestation","sign_citation":"https://pith.science/pith/E2NRGW6JNLBLJJCDCH3T4JKRNB/action/citation_signature","submit_replication":"https://pith.science/pith/E2NRGW6JNLBLJJCDCH3T4JKRNB/action/replication_record"}},"created_at":"2026-05-18T02:42:28.848203+00:00","updated_at":"2026-05-18T02:42:28.848203+00:00"}