{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VRJSFZVLWMNT42WBZ3FV4U6BDX","short_pith_number":"pith:VRJSFZVL","schema_version":"1.0","canonical_sha256":"ac5322e6abb31b3e6ac1cecb5e53c11df7cfbaf4308b7b4cb5739087f47d3a4f","source":{"kind":"arxiv","id":"1901.06581","version":1},"attestation_state":"computed","paper":{"title":"Approximation Algorithms for the A Priori TravelingRepairman","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fatemeh Navidi, Inge Li G{\\o}rtz, Viswanath Nagarajan","submitted_at":"2019-01-19T19:53:52Z","abstract_excerpt":"We consider the a priori traveling repairman problem, which is a stochastic version of the classic traveling repairman problem (also called the traveling deliveryman or minimum latency problem). Given a metric $(V,d)$ with a root $r\\in V$, the traveling repairman problem (TRP) involves finding a tour originating from $r$ that minimizes the sum of arrival-times at all vertices. In its a priori version, we are also given independent probabilities of each vertex being active. We want to find a master tour $\\tau$ originating from $r$ and visiting all vertices. The objective is to minimize the expe"},"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":"1901.06581","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-19T19:53:52Z","cross_cats_sorted":[],"title_canon_sha256":"3d05be90ce835c7a2ef37797b09a092715e7a100eb87ebec64355c5e5e8ecac7","abstract_canon_sha256":"d1378e5d0cc3336917efaa8cfa24573727b6c1f9747468be9f5ba354585e1b9b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:49.753234Z","signature_b64":"BaiEh5mDNWGnA3o6+xUjrjVUffwMyZDBvKxWSca0DuiEJIusgXAJ/o/rlskTbVJTgsw6nxitvmVsW2uvXb9xDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac5322e6abb31b3e6ac1cecb5e53c11df7cfbaf4308b7b4cb5739087f47d3a4f","last_reissued_at":"2026-05-17T23:55:49.752610Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:49.752610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Algorithms for the A Priori TravelingRepairman","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fatemeh Navidi, Inge Li G{\\o}rtz, Viswanath Nagarajan","submitted_at":"2019-01-19T19:53:52Z","abstract_excerpt":"We consider the a priori traveling repairman problem, which is a stochastic version of the classic traveling repairman problem (also called the traveling deliveryman or minimum latency problem). Given a metric $(V,d)$ with a root $r\\in V$, the traveling repairman problem (TRP) involves finding a tour originating from $r$ that minimizes the sum of arrival-times at all vertices. In its a priori version, we are also given independent probabilities of each vertex being active. We want to find a master tour $\\tau$ originating from $r$ and visiting all vertices. The objective is to minimize the expe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06581","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.06581","created_at":"2026-05-17T23:55:49.752708+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.06581v1","created_at":"2026-05-17T23:55:49.752708+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06581","created_at":"2026-05-17T23:55:49.752708+00:00"},{"alias_kind":"pith_short_12","alias_value":"VRJSFZVLWMNT","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"VRJSFZVLWMNT42WB","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"VRJSFZVL","created_at":"2026-05-18T12:33:30.264802+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/VRJSFZVLWMNT42WBZ3FV4U6BDX","json":"https://pith.science/pith/VRJSFZVLWMNT42WBZ3FV4U6BDX.json","graph_json":"https://pith.science/api/pith-number/VRJSFZVLWMNT42WBZ3FV4U6BDX/graph.json","events_json":"https://pith.science/api/pith-number/VRJSFZVLWMNT42WBZ3FV4U6BDX/events.json","paper":"https://pith.science/paper/VRJSFZVL"},"agent_actions":{"view_html":"https://pith.science/pith/VRJSFZVLWMNT42WBZ3FV4U6BDX","download_json":"https://pith.science/pith/VRJSFZVLWMNT42WBZ3FV4U6BDX.json","view_paper":"https://pith.science/paper/VRJSFZVL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.06581&json=true","fetch_graph":"https://pith.science/api/pith-number/VRJSFZVLWMNT42WBZ3FV4U6BDX/graph.json","fetch_events":"https://pith.science/api/pith-number/VRJSFZVLWMNT42WBZ3FV4U6BDX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VRJSFZVLWMNT42WBZ3FV4U6BDX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VRJSFZVLWMNT42WBZ3FV4U6BDX/action/storage_attestation","attest_author":"https://pith.science/pith/VRJSFZVLWMNT42WBZ3FV4U6BDX/action/author_attestation","sign_citation":"https://pith.science/pith/VRJSFZVLWMNT42WBZ3FV4U6BDX/action/citation_signature","submit_replication":"https://pith.science/pith/VRJSFZVLWMNT42WBZ3FV4U6BDX/action/replication_record"}},"created_at":"2026-05-17T23:55:49.752708+00:00","updated_at":"2026-05-17T23:55:49.752708+00:00"}