{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TM77CZLSWOER3ZOJPWCZR7ICOM","short_pith_number":"pith:TM77CZLS","schema_version":"1.0","canonical_sha256":"9b3ff16572b3891de5c97d8598fd027310cb45d39156d89d139117903ec7f451","source":{"kind":"arxiv","id":"1902.08218","version":1},"attestation_state":"computed","paper":{"title":"Covering a tree with rooted subtrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Marx, Lin Chen","submitted_at":"2019-02-21T19:09:46Z","abstract_excerpt":"We consider the multiple traveling salesman problem on a weighted tree. In this problem there are $m$ salesmen located at the root initially. Each of them will visit a subset of vertices and return to the root. The goal is to assign a tour to every salesman such that every vertex is visited and the longest tour among all salesmen is minimized. The problem is equivalent to the subtree cover problem, in which we cover a tree with rooted subtrees such that the weight of the maximum weighted subtree is minimized. The classical machine scheduling problem can be viewed as a special case of our probl"},"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":"1902.08218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-21T19:09:46Z","cross_cats_sorted":[],"title_canon_sha256":"8f102c2a46edce347472ba11502e32c4280cd9159d0d492f61913d5a8a2779ed","abstract_canon_sha256":"731fb256b1d31de89a64a1f4ea27f0e2fddcdfe4a1e39231257c260ff02e4052"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:57.975331Z","signature_b64":"y7H2yqFqN4Y6CNHbEaYqsKuho3PYCsFvKF1HBdWY9p6OeCWDrbtQMx3rLWN5XnH6BsmkoZAoSx4zWagzswj5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b3ff16572b3891de5c97d8598fd027310cb45d39156d89d139117903ec7f451","last_reissued_at":"2026-05-17T23:52:57.974590Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:57.974590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Covering a tree with rooted subtrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Marx, Lin Chen","submitted_at":"2019-02-21T19:09:46Z","abstract_excerpt":"We consider the multiple traveling salesman problem on a weighted tree. In this problem there are $m$ salesmen located at the root initially. Each of them will visit a subset of vertices and return to the root. The goal is to assign a tour to every salesman such that every vertex is visited and the longest tour among all salesmen is minimized. The problem is equivalent to the subtree cover problem, in which we cover a tree with rooted subtrees such that the weight of the maximum weighted subtree is minimized. The classical machine scheduling problem can be viewed as a special case of our probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08218","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":"1902.08218","created_at":"2026-05-17T23:52:57.974705+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.08218v1","created_at":"2026-05-17T23:52:57.974705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08218","created_at":"2026-05-17T23:52:57.974705+00:00"},{"alias_kind":"pith_short_12","alias_value":"TM77CZLSWOER","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"TM77CZLSWOER3ZOJ","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"TM77CZLS","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/TM77CZLSWOER3ZOJPWCZR7ICOM","json":"https://pith.science/pith/TM77CZLSWOER3ZOJPWCZR7ICOM.json","graph_json":"https://pith.science/api/pith-number/TM77CZLSWOER3ZOJPWCZR7ICOM/graph.json","events_json":"https://pith.science/api/pith-number/TM77CZLSWOER3ZOJPWCZR7ICOM/events.json","paper":"https://pith.science/paper/TM77CZLS"},"agent_actions":{"view_html":"https://pith.science/pith/TM77CZLSWOER3ZOJPWCZR7ICOM","download_json":"https://pith.science/pith/TM77CZLSWOER3ZOJPWCZR7ICOM.json","view_paper":"https://pith.science/paper/TM77CZLS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.08218&json=true","fetch_graph":"https://pith.science/api/pith-number/TM77CZLSWOER3ZOJPWCZR7ICOM/graph.json","fetch_events":"https://pith.science/api/pith-number/TM77CZLSWOER3ZOJPWCZR7ICOM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TM77CZLSWOER3ZOJPWCZR7ICOM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TM77CZLSWOER3ZOJPWCZR7ICOM/action/storage_attestation","attest_author":"https://pith.science/pith/TM77CZLSWOER3ZOJPWCZR7ICOM/action/author_attestation","sign_citation":"https://pith.science/pith/TM77CZLSWOER3ZOJPWCZR7ICOM/action/citation_signature","submit_replication":"https://pith.science/pith/TM77CZLSWOER3ZOJPWCZR7ICOM/action/replication_record"}},"created_at":"2026-05-17T23:52:57.974705+00:00","updated_at":"2026-05-17T23:52:57.974705+00:00"}