{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NYUB5NOOZH5CTK5XC24ZVROTLL","short_pith_number":"pith:NYUB5NOO","canonical_record":{"source":{"id":"1409.0098","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-30T10:16:48Z","cross_cats_sorted":[],"title_canon_sha256":"5fab4c9dedf626f14ec0503e62607a52189a13c40189003c40a2c82e38940466","abstract_canon_sha256":"6f3b862cf78ed8fb4a7ce8c1e15dca8eeaca4780373216d590ae1fea277eb246"},"schema_version":"1.0"},"canonical_sha256":"6e281eb5cec9fa29abb716b99ac5d35af15bb9092fe2d6561b4ac32b222ed6b1","source":{"kind":"arxiv","id":"1409.0098","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.0098","created_at":"2026-05-18T01:37:11Z"},{"alias_kind":"arxiv_version","alias_value":"1409.0098v3","created_at":"2026-05-18T01:37:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0098","created_at":"2026-05-18T01:37:11Z"},{"alias_kind":"pith_short_12","alias_value":"NYUB5NOOZH5C","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NYUB5NOOZH5CTK5X","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NYUB5NOO","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NYUB5NOOZH5CTK5XC24ZVROTLL","target":"record","payload":{"canonical_record":{"source":{"id":"1409.0098","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-30T10:16:48Z","cross_cats_sorted":[],"title_canon_sha256":"5fab4c9dedf626f14ec0503e62607a52189a13c40189003c40a2c82e38940466","abstract_canon_sha256":"6f3b862cf78ed8fb4a7ce8c1e15dca8eeaca4780373216d590ae1fea277eb246"},"schema_version":"1.0"},"canonical_sha256":"6e281eb5cec9fa29abb716b99ac5d35af15bb9092fe2d6561b4ac32b222ed6b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:11.417812Z","signature_b64":"IhbQ0hQRSLykbtKvBgqddn/a3/DJhcOyzdNMWiY/X/uDmnl4mIM67bTSULyLQ+Io60XgsDmAOAVa78YU7N39DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e281eb5cec9fa29abb716b99ac5d35af15bb9092fe2d6561b4ac32b222ed6b1","last_reissued_at":"2026-05-18T01:37:11.416917Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:11.416917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.0098","source_version":3,"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:37:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xbK+HfFpDfh8HOGHAFiVCANYqenIdyU51ANn2Mw5o8I5svjZEa6MNGReMxjUGw6wy4hBx2pcQn69h8DkKSRyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T08:28:30.615748Z"},"content_sha256":"bde9e7d254e6642f495db2c59e4b850dd965d1c95ca2dd3ca90163be2fe3a3f6","schema_version":"1.0","event_id":"sha256:bde9e7d254e6642f495db2c59e4b850dd965d1c95ca2dd3ca90163be2fe3a3f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NYUB5NOOZH5CTK5XC24ZVROTLL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An optimal algorithm for the weighted backup 2-center problem on a tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hung-Lung Wang","submitted_at":"2014-08-30T10:16:48Z","abstract_excerpt":"In this paper, we are concerned with the weighted backup 2-center problem on a tree. The backup 2-center problem is a kind of center facility location problem, in which one is asked to deploy two facilities, with a given probability to fail, in a network. Given that the two facilities do not fail simultaneously, the goal is to find two locations, possibly on edges, that minimize the expected value of the maximum distance over all vertices to their closest functioning facility. In the weighted setting, each vertex in the network is associated with a nonnegative weight, and the distance from ver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0098","kind":"arxiv","version":3},"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:37:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MIAMRV0KOfn5w8N5l+8YRjq0ohalL15LtftDjipFLzIsC3ddP/y5RK+NGL2A9UJ8vrvtGhtcurMcNqF8ePv4Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T08:28:30.616088Z"},"content_sha256":"d07f576b2083fb6b749dea98ed7c5bbe659982367d1726e201ae3ae6e4aa60ab","schema_version":"1.0","event_id":"sha256:d07f576b2083fb6b749dea98ed7c5bbe659982367d1726e201ae3ae6e4aa60ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NYUB5NOOZH5CTK5XC24ZVROTLL/bundle.json","state_url":"https://pith.science/pith/NYUB5NOOZH5CTK5XC24ZVROTLL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NYUB5NOOZH5CTK5XC24ZVROTLL/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-12T08:28:30Z","links":{"resolver":"https://pith.science/pith/NYUB5NOOZH5CTK5XC24ZVROTLL","bundle":"https://pith.science/pith/NYUB5NOOZH5CTK5XC24ZVROTLL/bundle.json","state":"https://pith.science/pith/NYUB5NOOZH5CTK5XC24ZVROTLL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NYUB5NOOZH5CTK5XC24ZVROTLL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NYUB5NOOZH5CTK5XC24ZVROTLL","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":"6f3b862cf78ed8fb4a7ce8c1e15dca8eeaca4780373216d590ae1fea277eb246","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-30T10:16:48Z","title_canon_sha256":"5fab4c9dedf626f14ec0503e62607a52189a13c40189003c40a2c82e38940466"},"schema_version":"1.0","source":{"id":"1409.0098","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.0098","created_at":"2026-05-18T01:37:11Z"},{"alias_kind":"arxiv_version","alias_value":"1409.0098v3","created_at":"2026-05-18T01:37:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0098","created_at":"2026-05-18T01:37:11Z"},{"alias_kind":"pith_short_12","alias_value":"NYUB5NOOZH5C","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NYUB5NOOZH5CTK5X","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NYUB5NOO","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:d07f576b2083fb6b749dea98ed7c5bbe659982367d1726e201ae3ae6e4aa60ab","target":"graph","created_at":"2026-05-18T01:37:11Z","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":"In this paper, we are concerned with the weighted backup 2-center problem on a tree. The backup 2-center problem is a kind of center facility location problem, in which one is asked to deploy two facilities, with a given probability to fail, in a network. Given that the two facilities do not fail simultaneously, the goal is to find two locations, possibly on edges, that minimize the expected value of the maximum distance over all vertices to their closest functioning facility. In the weighted setting, each vertex in the network is associated with a nonnegative weight, and the distance from ver","authors_text":"Hung-Lung Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-30T10:16:48Z","title":"An optimal algorithm for the weighted backup 2-center problem on a tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0098","kind":"arxiv","version":3},"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:bde9e7d254e6642f495db2c59e4b850dd965d1c95ca2dd3ca90163be2fe3a3f6","target":"record","created_at":"2026-05-18T01:37:11Z","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":"6f3b862cf78ed8fb4a7ce8c1e15dca8eeaca4780373216d590ae1fea277eb246","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-30T10:16:48Z","title_canon_sha256":"5fab4c9dedf626f14ec0503e62607a52189a13c40189003c40a2c82e38940466"},"schema_version":"1.0","source":{"id":"1409.0098","kind":"arxiv","version":3}},"canonical_sha256":"6e281eb5cec9fa29abb716b99ac5d35af15bb9092fe2d6561b4ac32b222ed6b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e281eb5cec9fa29abb716b99ac5d35af15bb9092fe2d6561b4ac32b222ed6b1","first_computed_at":"2026-05-18T01:37:11.416917Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:11.416917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IhbQ0hQRSLykbtKvBgqddn/a3/DJhcOyzdNMWiY/X/uDmnl4mIM67bTSULyLQ+Io60XgsDmAOAVa78YU7N39DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:11.417812Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.0098","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bde9e7d254e6642f495db2c59e4b850dd965d1c95ca2dd3ca90163be2fe3a3f6","sha256:d07f576b2083fb6b749dea98ed7c5bbe659982367d1726e201ae3ae6e4aa60ab"],"state_sha256":"1a839b46b9e13ab1c66ebee165eba58c3455f9c2891eae482596cbc91076562e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FYw4fqhyEm79zHTG/kEQwkhzBbCYDz0XFH1w73NTW9NcOEzTFQOhWW87QlOhZztyHG9ncIH/ZpLGu7NR/4uJAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T08:28:30.618118Z","bundle_sha256":"3bfc4dfa87126639fad38f3e11a5b48715896e911fde8a69fa4c9d6f576baba6"}}