{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XMSO2V2UK4JJGI36RW5B6M73O7","short_pith_number":"pith:XMSO2V2U","canonical_record":{"source":{"id":"1401.1905","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-01-09T07:00:20Z","cross_cats_sorted":[],"title_canon_sha256":"89e0ae4ba378c75feabc919f2fc6eafdd008e0840687ad098a2e1a70ca577192","abstract_canon_sha256":"5120d8503a89a6b774082c09356c35645eb09a0b02f0f6a87396466f8eaec653"},"schema_version":"1.0"},"canonical_sha256":"bb24ed5754571293237e8dba1f33fb77c0964837d843e9ede7e587ab678c71cb","source":{"kind":"arxiv","id":"1401.1905","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.1905","created_at":"2026-05-18T03:02:56Z"},{"alias_kind":"arxiv_version","alias_value":"1401.1905v1","created_at":"2026-05-18T03:02:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1905","created_at":"2026-05-18T03:02:56Z"},{"alias_kind":"pith_short_12","alias_value":"XMSO2V2UK4JJ","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XMSO2V2UK4JJGI36","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XMSO2V2U","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XMSO2V2UK4JJGI36RW5B6M73O7","target":"record","payload":{"canonical_record":{"source":{"id":"1401.1905","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-01-09T07:00:20Z","cross_cats_sorted":[],"title_canon_sha256":"89e0ae4ba378c75feabc919f2fc6eafdd008e0840687ad098a2e1a70ca577192","abstract_canon_sha256":"5120d8503a89a6b774082c09356c35645eb09a0b02f0f6a87396466f8eaec653"},"schema_version":"1.0"},"canonical_sha256":"bb24ed5754571293237e8dba1f33fb77c0964837d843e9ede7e587ab678c71cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:56.307516Z","signature_b64":"y8x26UpySDVNOatHiER7cUoRhn+ekB0qQE/sA8/yJ7eGp835euI3MwUnGXv6bPjxatll4SdtjJ6dEsXNcNugCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb24ed5754571293237e8dba1f33fb77c0964837d843e9ede7e587ab678c71cb","last_reissued_at":"2026-05-18T03:02:56.306934Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:56.306934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.1905","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-18T03:02:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZhpQsgm9LrW3+Bg4dEZhm9hy3z8PD5PJb/xXU9KVLseliAYR87j9A6E+vkawdbQYvB/j6JfkfVPi8XcnHoluBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:02:32.029921Z"},"content_sha256":"7793f9d36ebcb7540640e66be95a4f88dba8fd144ffbe7cedeb45123c1295897","schema_version":"1.0","event_id":"sha256:7793f9d36ebcb7540640e66be95a4f88dba8fd144ffbe7cedeb45123c1295897"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XMSO2V2UK4JJGI36RW5B6M73O7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Parameterized Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Dogan Corus, Frank Neumann, Mojgan Pourhassan, Per Kristian Lehre","submitted_at":"2014-01-09T07:00:20Z","abstract_excerpt":"Bi-level optimisation problems have gained increasing interest in the field of combinatorial optimisation in recent years. With this paper, we start the runtime analysis of evolutionary algorithms for bi-level optimisation problems. We examine two NP-hard problems, the generalised minimum spanning tree problem (GMST), and the generalised travelling salesman problem (GTSP) in the context of parameterised complexity.\n  For the generalised minimum spanning tree problem, we analyse the two approaches presented by Hu and Raidl (2012) with respect to the number of clusters that distinguish each othe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1905","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-18T03:02:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wCHx+Q1qwRWBgT4KFWeeRRkAJWEBaok/KmcpX4O5fBsPc9JZ4UOpoh/ZoNLKL70Y/c+53B6XBlj0zfEbVEW7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:02:32.030472Z"},"content_sha256":"61a62240492dc89ea0ef594936e1c95598cec8b8d2d52cd650ddcd5555788e33","schema_version":"1.0","event_id":"sha256:61a62240492dc89ea0ef594936e1c95598cec8b8d2d52cd650ddcd5555788e33"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XMSO2V2UK4JJGI36RW5B6M73O7/bundle.json","state_url":"https://pith.science/pith/XMSO2V2UK4JJGI36RW5B6M73O7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XMSO2V2UK4JJGI36RW5B6M73O7/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-27T21:02:32Z","links":{"resolver":"https://pith.science/pith/XMSO2V2UK4JJGI36RW5B6M73O7","bundle":"https://pith.science/pith/XMSO2V2UK4JJGI36RW5B6M73O7/bundle.json","state":"https://pith.science/pith/XMSO2V2UK4JJGI36RW5B6M73O7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XMSO2V2UK4JJGI36RW5B6M73O7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XMSO2V2UK4JJGI36RW5B6M73O7","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":"5120d8503a89a6b774082c09356c35645eb09a0b02f0f6a87396466f8eaec653","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-01-09T07:00:20Z","title_canon_sha256":"89e0ae4ba378c75feabc919f2fc6eafdd008e0840687ad098a2e1a70ca577192"},"schema_version":"1.0","source":{"id":"1401.1905","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.1905","created_at":"2026-05-18T03:02:56Z"},{"alias_kind":"arxiv_version","alias_value":"1401.1905v1","created_at":"2026-05-18T03:02:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1905","created_at":"2026-05-18T03:02:56Z"},{"alias_kind":"pith_short_12","alias_value":"XMSO2V2UK4JJ","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XMSO2V2UK4JJGI36","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XMSO2V2U","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:61a62240492dc89ea0ef594936e1c95598cec8b8d2d52cd650ddcd5555788e33","target":"graph","created_at":"2026-05-18T03:02:56Z","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":"Bi-level optimisation problems have gained increasing interest in the field of combinatorial optimisation in recent years. With this paper, we start the runtime analysis of evolutionary algorithms for bi-level optimisation problems. We examine two NP-hard problems, the generalised minimum spanning tree problem (GMST), and the generalised travelling salesman problem (GTSP) in the context of parameterised complexity.\n  For the generalised minimum spanning tree problem, we analyse the two approaches presented by Hu and Raidl (2012) with respect to the number of clusters that distinguish each othe","authors_text":"Dogan Corus, Frank Neumann, Mojgan Pourhassan, Per Kristian Lehre","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-01-09T07:00:20Z","title":"A Parameterized Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1905","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:7793f9d36ebcb7540640e66be95a4f88dba8fd144ffbe7cedeb45123c1295897","target":"record","created_at":"2026-05-18T03:02:56Z","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":"5120d8503a89a6b774082c09356c35645eb09a0b02f0f6a87396466f8eaec653","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-01-09T07:00:20Z","title_canon_sha256":"89e0ae4ba378c75feabc919f2fc6eafdd008e0840687ad098a2e1a70ca577192"},"schema_version":"1.0","source":{"id":"1401.1905","kind":"arxiv","version":1}},"canonical_sha256":"bb24ed5754571293237e8dba1f33fb77c0964837d843e9ede7e587ab678c71cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb24ed5754571293237e8dba1f33fb77c0964837d843e9ede7e587ab678c71cb","first_computed_at":"2026-05-18T03:02:56.306934Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:56.306934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y8x26UpySDVNOatHiER7cUoRhn+ekB0qQE/sA8/yJ7eGp835euI3MwUnGXv6bPjxatll4SdtjJ6dEsXNcNugCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:56.307516Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.1905","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7793f9d36ebcb7540640e66be95a4f88dba8fd144ffbe7cedeb45123c1295897","sha256:61a62240492dc89ea0ef594936e1c95598cec8b8d2d52cd650ddcd5555788e33"],"state_sha256":"47defb875b123682f0d188e8584b328f58ee665a1bb0a11536a2c5b619152366"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B9Ut430ieT72DwlRwsU4BkQgUcW6leTyVVXPE2QySeB95DdDN0VmVxZWQFvE5jCiW+MjCzqHmQb3iOk9WKl0Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:02:32.034029Z","bundle_sha256":"0210e9d9587f82e9acd7dde58efa33456f1caa2537fe3bb289bea56b409810c4"}}