{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:XKVMDUTPKEDENZWHRHN5JGV62X","short_pith_number":"pith:XKVMDUTP","canonical_record":{"source":{"id":"2004.10048","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-04-18T13:27:28Z","cross_cats_sorted":["cs.AI","cs.NE","math.CO"],"title_canon_sha256":"d8e0d962b59737a95cef203e8d7c05c0d4ebf50530e086f4405923c4cbee4488","abstract_canon_sha256":"febe5a1786586ebe071525cb3dee460d600c4bcd054a69907785f2575502d422"},"schema_version":"1.0"},"canonical_sha256":"baaac1d26f510646e6c789dbd49abed5e338e0801bdffb25157a7ad5f5f75288","source":{"kind":"arxiv","id":"2004.10048","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.10048","created_at":"2026-07-05T00:56:56Z"},{"alias_kind":"arxiv_version","alias_value":"2004.10048v1","created_at":"2026-07-05T00:56:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.10048","created_at":"2026-07-05T00:56:56Z"},{"alias_kind":"pith_short_12","alias_value":"XKVMDUTPKEDE","created_at":"2026-07-05T00:56:56Z"},{"alias_kind":"pith_short_16","alias_value":"XKVMDUTPKEDENZWH","created_at":"2026-07-05T00:56:56Z"},{"alias_kind":"pith_short_8","alias_value":"XKVMDUTP","created_at":"2026-07-05T00:56:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:XKVMDUTPKEDENZWHRHN5JGV62X","target":"record","payload":{"canonical_record":{"source":{"id":"2004.10048","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-04-18T13:27:28Z","cross_cats_sorted":["cs.AI","cs.NE","math.CO"],"title_canon_sha256":"d8e0d962b59737a95cef203e8d7c05c0d4ebf50530e086f4405923c4cbee4488","abstract_canon_sha256":"febe5a1786586ebe071525cb3dee460d600c4bcd054a69907785f2575502d422"},"schema_version":"1.0"},"canonical_sha256":"baaac1d26f510646e6c789dbd49abed5e338e0801bdffb25157a7ad5f5f75288","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:56:56.974305Z","signature_b64":"jMI0MYH3oUxE6EDtcsns5S8j8xsFvYASd8CJA6qf8HfoKtn6PGN0pIMNB+ePJxWiPg//M1TjDFMTwV9ZWSX+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"baaac1d26f510646e6c789dbd49abed5e338e0801bdffb25157a7ad5f5f75288","last_reissued_at":"2026-07-05T00:56:56.973926Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:56:56.973926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2004.10048","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-07-05T00:56:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YzsthDi+9Pzv6QXZAfm4Kcbyzgq547sdL8VrxYkTygnHZniJr3f0LewRg0I02vKgHKNzFJ1s1lCer6vtzUNVDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T21:27:04.772253Z"},"content_sha256":"ca3ba69b92f512ce8f0ca1711e5183f0a522911b4a44f1a6fe8f4c2c81872bd3","schema_version":"1.0","event_id":"sha256:ca3ba69b92f512ce8f0ca1711e5183f0a522911b4a44f1a6fe8f4c2c81872bd3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:XKVMDUTPKEDENZWHRHN5JGV62X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Devolutionary genetic algorithms with application to the minimum labeling Steiner tree problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NE","math.CO"],"primary_cat":"math.OC","authors_text":"Nassim Dehouche","submitted_at":"2020-04-18T13:27:28Z","abstract_excerpt":"This paper characterizes and discusses devolutionary genetic algorithms and evaluates their performances in solving the minimum labeling Steiner tree (MLST) problem. We define devolutionary algorithms as the process of reaching a feasible solution by devolving a population of super-optimal unfeasible solutions over time. We claim that distinguishing them from the widely used evolutionary algorithms is relevant. The most important distinction lies in the fact that in the former type of processes, the value function decreases over successive generation of solutions, thus providing a natural stop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.10048","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2004.10048/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:56:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N3ATYIBCnnTK0mkQSqt56ig07ZH5im1ddMx7dNtTNgAcP2RWzxqrFKPwZ5yp6f1Zy/iD/47p+rp0lJMdQqEnCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T21:27:04.772749Z"},"content_sha256":"cf905b851cf500c75410575d4aae1b2a5be730ef8f26390097ae31bed9ea2c87","schema_version":"1.0","event_id":"sha256:cf905b851cf500c75410575d4aae1b2a5be730ef8f26390097ae31bed9ea2c87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XKVMDUTPKEDENZWHRHN5JGV62X/bundle.json","state_url":"https://pith.science/pith/XKVMDUTPKEDENZWHRHN5JGV62X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XKVMDUTPKEDENZWHRHN5JGV62X/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-08-04T21:27:04Z","links":{"resolver":"https://pith.science/pith/XKVMDUTPKEDENZWHRHN5JGV62X","bundle":"https://pith.science/pith/XKVMDUTPKEDENZWHRHN5JGV62X/bundle.json","state":"https://pith.science/pith/XKVMDUTPKEDENZWHRHN5JGV62X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XKVMDUTPKEDENZWHRHN5JGV62X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:XKVMDUTPKEDENZWHRHN5JGV62X","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":"febe5a1786586ebe071525cb3dee460d600c4bcd054a69907785f2575502d422","cross_cats_sorted":["cs.AI","cs.NE","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-04-18T13:27:28Z","title_canon_sha256":"d8e0d962b59737a95cef203e8d7c05c0d4ebf50530e086f4405923c4cbee4488"},"schema_version":"1.0","source":{"id":"2004.10048","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.10048","created_at":"2026-07-05T00:56:56Z"},{"alias_kind":"arxiv_version","alias_value":"2004.10048v1","created_at":"2026-07-05T00:56:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.10048","created_at":"2026-07-05T00:56:56Z"},{"alias_kind":"pith_short_12","alias_value":"XKVMDUTPKEDE","created_at":"2026-07-05T00:56:56Z"},{"alias_kind":"pith_short_16","alias_value":"XKVMDUTPKEDENZWH","created_at":"2026-07-05T00:56:56Z"},{"alias_kind":"pith_short_8","alias_value":"XKVMDUTP","created_at":"2026-07-05T00:56:56Z"}],"graph_snapshots":[{"event_id":"sha256:cf905b851cf500c75410575d4aae1b2a5be730ef8f26390097ae31bed9ea2c87","target":"graph","created_at":"2026-07-05T00:56: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2004.10048/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper characterizes and discusses devolutionary genetic algorithms and evaluates their performances in solving the minimum labeling Steiner tree (MLST) problem. We define devolutionary algorithms as the process of reaching a feasible solution by devolving a population of super-optimal unfeasible solutions over time. We claim that distinguishing them from the widely used evolutionary algorithms is relevant. The most important distinction lies in the fact that in the former type of processes, the value function decreases over successive generation of solutions, thus providing a natural stop","authors_text":"Nassim Dehouche","cross_cats":["cs.AI","cs.NE","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-04-18T13:27:28Z","title":"Devolutionary genetic algorithms with application to the minimum labeling Steiner tree problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.10048","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:ca3ba69b92f512ce8f0ca1711e5183f0a522911b4a44f1a6fe8f4c2c81872bd3","target":"record","created_at":"2026-07-05T00:56: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":"febe5a1786586ebe071525cb3dee460d600c4bcd054a69907785f2575502d422","cross_cats_sorted":["cs.AI","cs.NE","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-04-18T13:27:28Z","title_canon_sha256":"d8e0d962b59737a95cef203e8d7c05c0d4ebf50530e086f4405923c4cbee4488"},"schema_version":"1.0","source":{"id":"2004.10048","kind":"arxiv","version":1}},"canonical_sha256":"baaac1d26f510646e6c789dbd49abed5e338e0801bdffb25157a7ad5f5f75288","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"baaac1d26f510646e6c789dbd49abed5e338e0801bdffb25157a7ad5f5f75288","first_computed_at":"2026-07-05T00:56:56.973926Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:56:56.973926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jMI0MYH3oUxE6EDtcsns5S8j8xsFvYASd8CJA6qf8HfoKtn6PGN0pIMNB+ePJxWiPg//M1TjDFMTwV9ZWSX+Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:56:56.974305Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.10048","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca3ba69b92f512ce8f0ca1711e5183f0a522911b4a44f1a6fe8f4c2c81872bd3","sha256:cf905b851cf500c75410575d4aae1b2a5be730ef8f26390097ae31bed9ea2c87"],"state_sha256":"ccab8e1f70adf0604ab279c480d58085b836d045ee13928bbe9f46fc62d70bdc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rB1pRzZ0TsY22RJvV8xYClvhWsARhAlM3i1nnKBAqBSPKAzfoncZ6JkxB4YX9+R/xWPxT/QOzLWtMS4KdWFuBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T21:27:04.776683Z","bundle_sha256":"d81d3c5fa7a5575a3b5f7a331d40e7501ce92714f9447c3ebf8d9fb649be7257"}}