{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:E2NRGW6JNLBLJJCDCH3T4JKRNB","short_pith_number":"pith:E2NRGW6J","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"},"canonical_sha256":"269b135bc96ac2b4a44311f73e255168721e8bc8bdc7451c35bddbeec4bfcccb","source":{"kind":"arxiv","id":"1307.4289","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4289","created_at":"2026-05-18T02:42:28Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4289v3","created_at":"2026-05-18T02:42:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4289","created_at":"2026-05-18T02:42:28Z"},{"alias_kind":"pith_short_12","alias_value":"E2NRGW6JNLBL","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"E2NRGW6JNLBLJJCD","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"E2NRGW6J","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:E2NRGW6JNLBLJJCDCH3T4JKRNB","target":"record","payload":{"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"},"canonical_sha256":"269b135bc96ac2b4a44311f73e255168721e8bc8bdc7451c35bddbeec4bfcccb","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"},"source_kind":"arxiv","source_id":"1307.4289","source_version":3,"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:42:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"deRapiG2VefZtOV5SFZpHrbHOUgWX19om2pNOnQITvG+u6xqoAHwWXSWf1LHP19IE9MVEaxEeMowRhkkQ6bVAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:41:42.532165Z"},"content_sha256":"6730613c73c753014612cd194b671898ab5ebdf87c5051b631e62e1aef0ded99","schema_version":"1.0","event_id":"sha256:6730613c73c753014612cd194b671898ab5ebdf87c5051b631e62e1aef0ded99"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:E2NRGW6JNLBLJJCDCH3T4JKRNB","target":"graph","payload":{"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"},"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:42:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B1gQ12lW9MNQM8HoF/lzMl15JXJmFglv8v4ucUQrIuCuqfoycuUfCL8q/Kr9rorGla4BC/gSRnhkqtV3eLJxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:41:42.532905Z"},"content_sha256":"68ff0353f1fb8e710d7e33603a9b7cf8514bad7a5075ccde64ee9fe42b257cc3","schema_version":"1.0","event_id":"sha256:68ff0353f1fb8e710d7e33603a9b7cf8514bad7a5075ccde64ee9fe42b257cc3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E2NRGW6JNLBLJJCDCH3T4JKRNB/bundle.json","state_url":"https://pith.science/pith/E2NRGW6JNLBLJJCDCH3T4JKRNB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E2NRGW6JNLBLJJCDCH3T4JKRNB/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-11T07:41:42Z","links":{"resolver":"https://pith.science/pith/E2NRGW6JNLBLJJCDCH3T4JKRNB","bundle":"https://pith.science/pith/E2NRGW6JNLBLJJCDCH3T4JKRNB/bundle.json","state":"https://pith.science/pith/E2NRGW6JNLBLJJCDCH3T4JKRNB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E2NRGW6JNLBLJJCDCH3T4JKRNB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:E2NRGW6JNLBLJJCDCH3T4JKRNB","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":"2ffe0c9c88f2eaccd04755ccb1d5f228276a6c46791f48250a7234e88625b9cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-16T14:38:01Z","title_canon_sha256":"9d9e56ec700361a6643abcfdce5b1a88f9647e791ae4e6ac3d13bb000084792c"},"schema_version":"1.0","source":{"id":"1307.4289","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4289","created_at":"2026-05-18T02:42:28Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4289v3","created_at":"2026-05-18T02:42:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4289","created_at":"2026-05-18T02:42:28Z"},{"alias_kind":"pith_short_12","alias_value":"E2NRGW6JNLBL","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"E2NRGW6JNLBLJJCD","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"E2NRGW6J","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:68ff0353f1fb8e710d7e33603a9b7cf8514bad7a5075ccde64ee9fe42b257cc3","target":"graph","created_at":"2026-05-18T02:42:28Z","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 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","authors_text":"Ren\\'e Sitters","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-16T14:38:01Z","title":"Polynomial time approximation schemes for the traveling repairman and other minimum latency problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4289","kind":"arxiv","version":3},"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:6730613c73c753014612cd194b671898ab5ebdf87c5051b631e62e1aef0ded99","target":"record","created_at":"2026-05-18T02:42:28Z","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":"2ffe0c9c88f2eaccd04755ccb1d5f228276a6c46791f48250a7234e88625b9cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-16T14:38:01Z","title_canon_sha256":"9d9e56ec700361a6643abcfdce5b1a88f9647e791ae4e6ac3d13bb000084792c"},"schema_version":"1.0","source":{"id":"1307.4289","kind":"arxiv","version":3}},"canonical_sha256":"269b135bc96ac2b4a44311f73e255168721e8bc8bdc7451c35bddbeec4bfcccb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"269b135bc96ac2b4a44311f73e255168721e8bc8bdc7451c35bddbeec4bfcccb","first_computed_at":"2026-05-18T02:42:28.848033Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:28.848033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TgpHKvPvOZEImn1hGuvrwAFEIaY00qgUSkTBu8Xr3HtNGi1dRZonZ2jujx7DN/uG0zAE6WFFax4MoSdcGtWxCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:28.849628Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.4289","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6730613c73c753014612cd194b671898ab5ebdf87c5051b631e62e1aef0ded99","sha256:68ff0353f1fb8e710d7e33603a9b7cf8514bad7a5075ccde64ee9fe42b257cc3"],"state_sha256":"7201d504e0ef9dc2b5bd92ca2039b56424d7fa4b9ba2b48f030ef798b75004ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"60492hMy+rmxVepw41YpSWi69wIfmAEke/43dmYaKTk17/PLaV3QJ2VpII+N0Y1muxeHurfbVo3wqzdnuHH9DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T07:41:42.536917Z","bundle_sha256":"b6c0987b6596060a27a9c83ddb881c4c0424503b105d01bc8428ba16dddc6e2b"}}