{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JWJJJHOWSUC2BSRER3NTH5DAMG","short_pith_number":"pith:JWJJJHOW","canonical_record":{"source":{"id":"1705.02752","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-08T05:58:07Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"8d665173a011c9a87bfe0e18be2ea8a2f5da5011fe9975bf9af74c75165e4ff2","abstract_canon_sha256":"7637dde1b89647199e3fc3bc24a8d90a95d5c66f9cd8fc236cb4dd87f8f220e9"},"schema_version":"1.0"},"canonical_sha256":"4d92949dd69505a0ca248edb33f460619e89e11eee94939d98c1eec57e141402","source":{"kind":"arxiv","id":"1705.02752","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02752","created_at":"2026-05-18T00:21:55Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02752v2","created_at":"2026-05-18T00:21:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02752","created_at":"2026-05-18T00:21:55Z"},{"alias_kind":"pith_short_12","alias_value":"JWJJJHOWSUC2","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JWJJJHOWSUC2BSRE","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JWJJJHOW","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JWJJJHOWSUC2BSRER3NTH5DAMG","target":"record","payload":{"canonical_record":{"source":{"id":"1705.02752","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-08T05:58:07Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"8d665173a011c9a87bfe0e18be2ea8a2f5da5011fe9975bf9af74c75165e4ff2","abstract_canon_sha256":"7637dde1b89647199e3fc3bc24a8d90a95d5c66f9cd8fc236cb4dd87f8f220e9"},"schema_version":"1.0"},"canonical_sha256":"4d92949dd69505a0ca248edb33f460619e89e11eee94939d98c1eec57e141402","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:55.026075Z","signature_b64":"nuKRuiIrLVLLsjX+EjU6xfsPsSntyGKj9mGPeAlMmSJ4qlAobd/7LgaQPoWb4LprMr2+ETzL/DBk8TLyFWwdCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d92949dd69505a0ca248edb33f460619e89e11eee94939d98c1eec57e141402","last_reissued_at":"2026-05-18T00:21:55.025474Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:55.025474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.02752","source_version":2,"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-18T00:21:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x/7iKpDqS3hsoc5U5hnAk3iZ2jagjNvvP//fQU7jyvvjIxmVmmjTgSzxO3egjoR2QFyhf5KOb8kSzvk7nQC/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:49:46.200807Z"},"content_sha256":"ac3cab3248fcb6557bd4e7b4b4f3cf93a03d73eddb3a790dd53f942180f901eb","schema_version":"1.0","event_id":"sha256:ac3cab3248fcb6557bd4e7b4b4f3cf93a03d73eddb3a790dd53f942180f901eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JWJJJHOWSUC2BSRER3NTH5DAMG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An $O(n\\log n)$-Time Algorithm for the k-Center Problem in Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Haitao Wang, Jingru Zhang","submitted_at":"2017-05-08T05:58:07Z","abstract_excerpt":"We consider a classical k-center problem in trees. Let T be a tree of n vertices and every vertex has a nonnegative weight. The problem is to find k centers on the edges of T such that the maximum weighted distance from all vertices to their closest centers is minimized. Megiddo and Tamir (SIAM J. Comput., 1983) gave an algorithm that can solve the problem in $O(n\\log^2 n)$ time by using Cole's parametric search. Since then it has been open for over three decades whether the problem can be solved in $O(n\\log n)$ time. In this paper, we present an $O(n\\log n)$ time algorithm for the problem and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02752","kind":"arxiv","version":2},"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-18T00:21:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DRKEEnNjsH4UDOyFy4ep8exTNpZ1xBlChY/aysmioBS1c4Wq11kHBCHxEPQHdmxLgxhz2Es61ymomhz+12DjAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:49:46.201474Z"},"content_sha256":"bb1eb64cb6207f759088caaf687bd33dbc5dce2b28356837c46d21c79e666e0c","schema_version":"1.0","event_id":"sha256:bb1eb64cb6207f759088caaf687bd33dbc5dce2b28356837c46d21c79e666e0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JWJJJHOWSUC2BSRER3NTH5DAMG/bundle.json","state_url":"https://pith.science/pith/JWJJJHOWSUC2BSRER3NTH5DAMG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JWJJJHOWSUC2BSRER3NTH5DAMG/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-07T18:49:46Z","links":{"resolver":"https://pith.science/pith/JWJJJHOWSUC2BSRER3NTH5DAMG","bundle":"https://pith.science/pith/JWJJJHOWSUC2BSRER3NTH5DAMG/bundle.json","state":"https://pith.science/pith/JWJJJHOWSUC2BSRER3NTH5DAMG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JWJJJHOWSUC2BSRER3NTH5DAMG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JWJJJHOWSUC2BSRER3NTH5DAMG","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":"7637dde1b89647199e3fc3bc24a8d90a95d5c66f9cd8fc236cb4dd87f8f220e9","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-08T05:58:07Z","title_canon_sha256":"8d665173a011c9a87bfe0e18be2ea8a2f5da5011fe9975bf9af74c75165e4ff2"},"schema_version":"1.0","source":{"id":"1705.02752","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02752","created_at":"2026-05-18T00:21:55Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02752v2","created_at":"2026-05-18T00:21:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02752","created_at":"2026-05-18T00:21:55Z"},{"alias_kind":"pith_short_12","alias_value":"JWJJJHOWSUC2","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JWJJJHOWSUC2BSRE","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JWJJJHOW","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:bb1eb64cb6207f759088caaf687bd33dbc5dce2b28356837c46d21c79e666e0c","target":"graph","created_at":"2026-05-18T00:21:55Z","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 consider a classical k-center problem in trees. Let T be a tree of n vertices and every vertex has a nonnegative weight. The problem is to find k centers on the edges of T such that the maximum weighted distance from all vertices to their closest centers is minimized. Megiddo and Tamir (SIAM J. Comput., 1983) gave an algorithm that can solve the problem in $O(n\\log^2 n)$ time by using Cole's parametric search. Since then it has been open for over three decades whether the problem can be solved in $O(n\\log n)$ time. In this paper, we present an $O(n\\log n)$ time algorithm for the problem and","authors_text":"Haitao Wang, Jingru Zhang","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-08T05:58:07Z","title":"An $O(n\\log n)$-Time Algorithm for the k-Center Problem in Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02752","kind":"arxiv","version":2},"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:ac3cab3248fcb6557bd4e7b4b4f3cf93a03d73eddb3a790dd53f942180f901eb","target":"record","created_at":"2026-05-18T00:21:55Z","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":"7637dde1b89647199e3fc3bc24a8d90a95d5c66f9cd8fc236cb4dd87f8f220e9","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-08T05:58:07Z","title_canon_sha256":"8d665173a011c9a87bfe0e18be2ea8a2f5da5011fe9975bf9af74c75165e4ff2"},"schema_version":"1.0","source":{"id":"1705.02752","kind":"arxiv","version":2}},"canonical_sha256":"4d92949dd69505a0ca248edb33f460619e89e11eee94939d98c1eec57e141402","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d92949dd69505a0ca248edb33f460619e89e11eee94939d98c1eec57e141402","first_computed_at":"2026-05-18T00:21:55.025474Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:55.025474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nuKRuiIrLVLLsjX+EjU6xfsPsSntyGKj9mGPeAlMmSJ4qlAobd/7LgaQPoWb4LprMr2+ETzL/DBk8TLyFWwdCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:55.026075Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.02752","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac3cab3248fcb6557bd4e7b4b4f3cf93a03d73eddb3a790dd53f942180f901eb","sha256:bb1eb64cb6207f759088caaf687bd33dbc5dce2b28356837c46d21c79e666e0c"],"state_sha256":"b43db891369dda51bdf5eb5045b8847c8a3c7d2eb608ec6ac9dffe50f3e1fccc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yyrcVio+7YfiZ2MLjKaQsXNU8NWOyOdTLvO+LGQkiQE5jgikt+MlamA20uxn0iOZ701vcJ1lxuYwTeutT6DlCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T18:49:46.204980Z","bundle_sha256":"41e6285c245285c01d34861a967f57ec35d1570c4704441a7ca691fe10947f08"}}