{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5EQQA2G4TYJFOPROQREIAD6DV3","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":"4a5cd6006386de5c9e5402c1ec191258e4325ad0f26ecaa40a81930dc1eacff2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-26T06:07:30Z","title_canon_sha256":"6aac0707dcc54f73f80216ebe91a0d4c06251529f8c039da132dc8e25620be43"},"schema_version":"1.0","source":{"id":"1604.07535","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07535","created_at":"2026-05-18T01:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07535v1","created_at":"2026-05-18T01:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07535","created_at":"2026-05-18T01:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"5EQQA2G4TYJF","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5EQQA2G4TYJFOPRO","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5EQQA2G4","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:a94edefbf7e812046f7b69e4a710de538a48d8a33d4f637fc166ca041e95ba82","target":"graph","created_at":"2026-05-18T01:16:19Z","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 present two improved algorithms for weighted discrete $p$-center problem for tree networks with $n$ vertices. One of our proposed algorithms runs in $O(n \\log n + p \\log^2 n \\log(n/p))$ time. For all values of $p$, our algorithm thus runs as fast as or faster than the most efficient $O(n\\log^2 n)$ time algorithm obtained by applying Cole's speed-up technique [cole1987] to the algorithm due to Megiddo and Tamir [megiddo1983], which has remained unchallenged for nearly 30 years. Our other algorithm, which is more practical, runs in $O(n \\log n + p^2 \\log^2(n/p))$ time, and when $p=O(\\sqrt{n})","authors_text":"Aritra Banik, Binay Bhattacharya, Sandip Das, Tsunehiko Kameda, Zhao Song","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-26T06:07:30Z","title":"The $p$-Center Problem in Tree Networks Revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07535","kind":"arxiv","version":1},"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:df06812dfdec47b921505459ce08451a058185e16f6bbb2b61fb83cea475420b","target":"record","created_at":"2026-05-18T01:16:19Z","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":"4a5cd6006386de5c9e5402c1ec191258e4325ad0f26ecaa40a81930dc1eacff2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-26T06:07:30Z","title_canon_sha256":"6aac0707dcc54f73f80216ebe91a0d4c06251529f8c039da132dc8e25620be43"},"schema_version":"1.0","source":{"id":"1604.07535","kind":"arxiv","version":1}},"canonical_sha256":"e9210068dc9e12573e2e8448800fc3aed64800648f6e10dcc64ac3d8aa72e8fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9210068dc9e12573e2e8448800fc3aed64800648f6e10dcc64ac3d8aa72e8fd","first_computed_at":"2026-05-18T01:16:19.563251Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:19.563251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UItNt/SLx3DqhSNrNq1w4HmzokAuU2HI28OmQaYHDxMTa7cc16NojEFKnJSv7wCw+lcVdOSlAiGzUa9hhDz1AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:19.563822Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.07535","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df06812dfdec47b921505459ce08451a058185e16f6bbb2b61fb83cea475420b","sha256:a94edefbf7e812046f7b69e4a710de538a48d8a33d4f637fc166ca041e95ba82"],"state_sha256":"ca44840c4ca0bae78980cd20934d2f13e4ee3420aae608df97e430c190a23004"}