{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:VQXAILR6S5OLN4MWTGTDR6TGBG","short_pith_number":"pith:VQXAILR6","canonical_record":{"source":{"id":"1409.1073","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-09-03T13:17:31Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"746f0083b6b87e4683468f0bd565fb720f9404f236e9d62d001e055e424642fa","abstract_canon_sha256":"8e93da396cce7beba74eaa334ae4e72ef85dcdf153174590ecad738fdfc1d3f5"},"schema_version":"1.0"},"canonical_sha256":"ac2e042e3e975cb6f19699a638fa6609b7bb7f6e3d373d74cd49094307ffc5b4","source":{"kind":"arxiv","id":"1409.1073","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.1073","created_at":"2026-05-18T02:43:08Z"},{"alias_kind":"arxiv_version","alias_value":"1409.1073v1","created_at":"2026-05-18T02:43:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1073","created_at":"2026-05-18T02:43:08Z"},{"alias_kind":"pith_short_12","alias_value":"VQXAILR6S5OL","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VQXAILR6S5OLN4MW","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VQXAILR6","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:VQXAILR6S5OLN4MWTGTDR6TGBG","target":"record","payload":{"canonical_record":{"source":{"id":"1409.1073","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-09-03T13:17:31Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"746f0083b6b87e4683468f0bd565fb720f9404f236e9d62d001e055e424642fa","abstract_canon_sha256":"8e93da396cce7beba74eaa334ae4e72ef85dcdf153174590ecad738fdfc1d3f5"},"schema_version":"1.0"},"canonical_sha256":"ac2e042e3e975cb6f19699a638fa6609b7bb7f6e3d373d74cd49094307ffc5b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:08.889373Z","signature_b64":"ogOy6gkimwAAB8d8AfYD8m8sAkKPEpsJcImixtzSJ597Rbk6xiZyYW/Pow8pNRfl71TtoCcsiOIGJlMBa7ceAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac2e042e3e975cb6f19699a638fa6609b7bb7f6e3d373d74cd49094307ffc5b4","last_reissued_at":"2026-05-18T02:43:08.888970Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:08.888970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.1073","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-18T02:43:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sdUQbAtrfpLLTEsU0A7gC6NeIY9R9kh57VTNb86wNoJTuSjt1+uTuh5a3ah7QIhqRnpwFDDg72F62UjPPo5SCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:05:49.645044Z"},"content_sha256":"a993b061f8e56961184a334c4d03373a707d63f243d18a8cdf10a1291fc8e45a","schema_version":"1.0","event_id":"sha256:a993b061f8e56961184a334c4d03373a707d63f243d18a8cdf10a1291fc8e45a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:VQXAILR6S5OLN4MWTGTDR6TGBG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Performance Analysis on Evolutionary Algorithms for the Minimum Label Spanning Tree Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NE","authors_text":"Jun He, Jun Zhang, Xinsheng Lai, Yuren Zhou","submitted_at":"2014-09-03T13:17:31Z","abstract_excerpt":"Some experimental investigations have shown that evolutionary algorithms (EAs) are efficient for the minimum label spanning tree (MLST) problem. However, we know little about that in theory. As one step towards this issue, we theoretically analyze the performances of the (1+1) EA, a simple version of EAs, and a multi-objective evolutionary algorithm called GSEMO on the MLST problem. We reveal that for the MLST$_{b}$ problem the (1+1) EA and GSEMO achieve a $\\frac{b+1}{2}$-approximation ratio in expected polynomial times of $n$ the number of nodes and $k$ the number of labels. We also show that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1073","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-18T02:43:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"54+HcvvjQ1Y4NtJregSMB1416OhNTq7DsBh2TQNJXCoEfijbkVzZOgJoKTN0M3WooNrvVOBtjpJBstgQY2f0BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:05:49.645419Z"},"content_sha256":"f781090729d86ffee9c713c77494a1e33f6409430bf96e4f23de62ec8b42b343","schema_version":"1.0","event_id":"sha256:f781090729d86ffee9c713c77494a1e33f6409430bf96e4f23de62ec8b42b343"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VQXAILR6S5OLN4MWTGTDR6TGBG/bundle.json","state_url":"https://pith.science/pith/VQXAILR6S5OLN4MWTGTDR6TGBG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VQXAILR6S5OLN4MWTGTDR6TGBG/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-01T06:05:49Z","links":{"resolver":"https://pith.science/pith/VQXAILR6S5OLN4MWTGTDR6TGBG","bundle":"https://pith.science/pith/VQXAILR6S5OLN4MWTGTDR6TGBG/bundle.json","state":"https://pith.science/pith/VQXAILR6S5OLN4MWTGTDR6TGBG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VQXAILR6S5OLN4MWTGTDR6TGBG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VQXAILR6S5OLN4MWTGTDR6TGBG","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":"8e93da396cce7beba74eaa334ae4e72ef85dcdf153174590ecad738fdfc1d3f5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-09-03T13:17:31Z","title_canon_sha256":"746f0083b6b87e4683468f0bd565fb720f9404f236e9d62d001e055e424642fa"},"schema_version":"1.0","source":{"id":"1409.1073","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.1073","created_at":"2026-05-18T02:43:08Z"},{"alias_kind":"arxiv_version","alias_value":"1409.1073v1","created_at":"2026-05-18T02:43:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1073","created_at":"2026-05-18T02:43:08Z"},{"alias_kind":"pith_short_12","alias_value":"VQXAILR6S5OL","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VQXAILR6S5OLN4MW","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VQXAILR6","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:f781090729d86ffee9c713c77494a1e33f6409430bf96e4f23de62ec8b42b343","target":"graph","created_at":"2026-05-18T02:43:08Z","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":"Some experimental investigations have shown that evolutionary algorithms (EAs) are efficient for the minimum label spanning tree (MLST) problem. However, we know little about that in theory. As one step towards this issue, we theoretically analyze the performances of the (1+1) EA, a simple version of EAs, and a multi-objective evolutionary algorithm called GSEMO on the MLST problem. We reveal that for the MLST$_{b}$ problem the (1+1) EA and GSEMO achieve a $\\frac{b+1}{2}$-approximation ratio in expected polynomial times of $n$ the number of nodes and $k$ the number of labels. We also show that","authors_text":"Jun He, Jun Zhang, Xinsheng Lai, Yuren Zhou","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-09-03T13:17:31Z","title":"Performance Analysis on Evolutionary Algorithms for the Minimum Label Spanning Tree Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1073","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:a993b061f8e56961184a334c4d03373a707d63f243d18a8cdf10a1291fc8e45a","target":"record","created_at":"2026-05-18T02:43:08Z","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":"8e93da396cce7beba74eaa334ae4e72ef85dcdf153174590ecad738fdfc1d3f5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-09-03T13:17:31Z","title_canon_sha256":"746f0083b6b87e4683468f0bd565fb720f9404f236e9d62d001e055e424642fa"},"schema_version":"1.0","source":{"id":"1409.1073","kind":"arxiv","version":1}},"canonical_sha256":"ac2e042e3e975cb6f19699a638fa6609b7bb7f6e3d373d74cd49094307ffc5b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac2e042e3e975cb6f19699a638fa6609b7bb7f6e3d373d74cd49094307ffc5b4","first_computed_at":"2026-05-18T02:43:08.888970Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:08.888970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ogOy6gkimwAAB8d8AfYD8m8sAkKPEpsJcImixtzSJ597Rbk6xiZyYW/Pow8pNRfl71TtoCcsiOIGJlMBa7ceAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:08.889373Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.1073","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a993b061f8e56961184a334c4d03373a707d63f243d18a8cdf10a1291fc8e45a","sha256:f781090729d86ffee9c713c77494a1e33f6409430bf96e4f23de62ec8b42b343"],"state_sha256":"c39be77f690c5f61bcbcec2212dd436689ebdbd7eec2899021d2d0f434779594"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ja3zyNT8Q0jZcYrejQeNJWwmfInw6UPQ8U3lCcUnO8ixir08/JNjOy3sB/8fUvYoJ3WU3Srt54X64EMv6cJfBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:05:49.647726Z","bundle_sha256":"08934491121e94c99be8ad6810c62ae590a2bbba0de0f9af504e34226997848d"}}