{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5EQQA2G4TYJFOPROQREIAD6DV3","short_pith_number":"pith:5EQQA2G4","canonical_record":{"source":{"id":"1604.07535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-26T06:07:30Z","cross_cats_sorted":[],"title_canon_sha256":"6aac0707dcc54f73f80216ebe91a0d4c06251529f8c039da132dc8e25620be43","abstract_canon_sha256":"4a5cd6006386de5c9e5402c1ec191258e4325ad0f26ecaa40a81930dc1eacff2"},"schema_version":"1.0"},"canonical_sha256":"e9210068dc9e12573e2e8448800fc3aed64800648f6e10dcc64ac3d8aa72e8fd","source":{"kind":"arxiv","id":"1604.07535","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5EQQA2G4TYJFOPROQREIAD6DV3","target":"record","payload":{"canonical_record":{"source":{"id":"1604.07535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-26T06:07:30Z","cross_cats_sorted":[],"title_canon_sha256":"6aac0707dcc54f73f80216ebe91a0d4c06251529f8c039da132dc8e25620be43","abstract_canon_sha256":"4a5cd6006386de5c9e5402c1ec191258e4325ad0f26ecaa40a81930dc1eacff2"},"schema_version":"1.0"},"canonical_sha256":"e9210068dc9e12573e2e8448800fc3aed64800648f6e10dcc64ac3d8aa72e8fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:19.563822Z","signature_b64":"UItNt/SLx3DqhSNrNq1w4HmzokAuU2HI28OmQaYHDxMTa7cc16NojEFKnJSv7wCw+lcVdOSlAiGzUa9hhDz1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9210068dc9e12573e2e8448800fc3aed64800648f6e10dcc64ac3d8aa72e8fd","last_reissued_at":"2026-05-18T01:16:19.563251Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:19.563251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.07535","source_version":1,"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-18T01:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Mvj6gEMWa5CwzpdOp1dmF7Oen2Ckz8fSe952xgJHaMeyvEplU9RU+o8WXjUCosjD8KqVetHMtNkkJQ78d1UDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:15:08.038978Z"},"content_sha256":"df06812dfdec47b921505459ce08451a058185e16f6bbb2b61fb83cea475420b","schema_version":"1.0","event_id":"sha256:df06812dfdec47b921505459ce08451a058185e16f6bbb2b61fb83cea475420b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5EQQA2G4TYJFOPROQREIAD6DV3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The $p$-Center Problem in Tree Networks Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aritra Banik, Binay Bhattacharya, Sandip Das, Tsunehiko Kameda, Zhao Song","submitted_at":"2016-04-26T06:07:30Z","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})"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07535","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"},"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-18T01:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L3eiYvwVvsm5MgWUXWQ+JiXSOlgvewu1fmf8I81dL1kDDhcMNVYsgg2DKKWFY0raazmpVg3oI1Dgf5vqWNHoAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:15:08.039701Z"},"content_sha256":"a94edefbf7e812046f7b69e4a710de538a48d8a33d4f637fc166ca041e95ba82","schema_version":"1.0","event_id":"sha256:a94edefbf7e812046f7b69e4a710de538a48d8a33d4f637fc166ca041e95ba82"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5EQQA2G4TYJFOPROQREIAD6DV3/bundle.json","state_url":"https://pith.science/pith/5EQQA2G4TYJFOPROQREIAD6DV3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5EQQA2G4TYJFOPROQREIAD6DV3/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-05-25T18:15:08Z","links":{"resolver":"https://pith.science/pith/5EQQA2G4TYJFOPROQREIAD6DV3","bundle":"https://pith.science/pith/5EQQA2G4TYJFOPROQREIAD6DV3/bundle.json","state":"https://pith.science/pith/5EQQA2G4TYJFOPROQREIAD6DV3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5EQQA2G4TYJFOPROQREIAD6DV3/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"035qTRRwbOiWQkN80D0TEuXkhg4hZbYobcOBsI9v3k3eoQsbE17678bn+WDrgEwcOwBkiEE2caaijaiSX/ivCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:15:08.043285Z","bundle_sha256":"ace02db23a24a895b6aeb0126462a3b61251415c582c8e6c2a4e69def2e6527d"}}