{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IVCUMRLE54AW3Z3ADTWFAWSQ2H","short_pith_number":"pith:IVCUMRLE","canonical_record":{"source":{"id":"1701.07950","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2017-01-27T05:49:32Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"7251369dcdbea8b47c8418a09bc26e11cea1bbb35d496f5b9aec148683828711","abstract_canon_sha256":"c1f932f86ba3780ad0d98b1b9bca471469d534ca46072002fdec8f773da401ba"},"schema_version":"1.0"},"canonical_sha256":"4545464564ef016de7601cec505a50d1cc3c3256d76ad8b1e9ae1076824142d3","source":{"kind":"arxiv","id":"1701.07950","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07950","created_at":"2026-05-18T00:35:04Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07950v3","created_at":"2026-05-18T00:35:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07950","created_at":"2026-05-18T00:35:04Z"},{"alias_kind":"pith_short_12","alias_value":"IVCUMRLE54AW","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IVCUMRLE54AW3Z3A","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IVCUMRLE","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IVCUMRLE54AW3Z3ADTWFAWSQ2H","target":"record","payload":{"canonical_record":{"source":{"id":"1701.07950","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2017-01-27T05:49:32Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"7251369dcdbea8b47c8418a09bc26e11cea1bbb35d496f5b9aec148683828711","abstract_canon_sha256":"c1f932f86ba3780ad0d98b1b9bca471469d534ca46072002fdec8f773da401ba"},"schema_version":"1.0"},"canonical_sha256":"4545464564ef016de7601cec505a50d1cc3c3256d76ad8b1e9ae1076824142d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:04.753881Z","signature_b64":"Qy7DlaOtsqlPe5eHhiE+HAD4rZurZAZr1aSA5+8N6hao9P458kNv1j66IYOWuvCk/UYKGWLdfEzvVYcS19pMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4545464564ef016de7601cec505a50d1cc3c3256d76ad8b1e9ae1076824142d3","last_reissued_at":"2026-05-18T00:35:04.753021Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:04.753021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.07950","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-18T00:35:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NkUQ2n/YgvjSfNhfZ9QETr5VVuukMEadsBVEuLCzDurAcGbJ+/S2FMBK4SEKca16DZgbWqfB7t9NuTnxvjPKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:01:53.593293Z"},"content_sha256":"448d32ed7d46fb883c35e89d72ea9c8d72eede42e233b4fda4d6fe51e8fe3809","schema_version":"1.0","event_id":"sha256:448d32ed7d46fb883c35e89d72ea9c8d72eede42e233b4fda4d6fe51e8fe3809"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IVCUMRLE54AW3Z3ADTWFAWSQ2H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Beyond Evolutionary Algorithms for Search-based Software Engineering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.SE","authors_text":"Jianfeng Chen, Tim Menzies, Vivek Nair","submitted_at":"2017-01-27T05:49:32Z","abstract_excerpt":"Context: Evolutionary algorithms typically require a large number of evaluations (of solutions) to converge - which can be very slow and expensive to evaluate.Objective: To solve search-based software engineering (SE) problems, using fewer evaluations than evolutionary methods.Method: Instead of mutating a small population, we build a very large initial population which is then culled using a recursive bi-clustering chop approach. We evaluate this approach on multiple SE models, unconstrained as well as constrained, and compare its performance with standard evolutionary algorithms. Results: Us"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07950","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-18T00:35:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EToxhGygqociFZqPnvUFfTjfukAZ4wmpWcZEnT5Xd3QvSE4KXOXIKVkTAvVm0Pi2rbCzFY8GcWdRvUVXfJEJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:01:53.593753Z"},"content_sha256":"96e63bb77c4d631d3608241c5459108d3bdac65172caaa4a4421a0e51c5eb3c8","schema_version":"1.0","event_id":"sha256:96e63bb77c4d631d3608241c5459108d3bdac65172caaa4a4421a0e51c5eb3c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IVCUMRLE54AW3Z3ADTWFAWSQ2H/bundle.json","state_url":"https://pith.science/pith/IVCUMRLE54AW3Z3ADTWFAWSQ2H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IVCUMRLE54AW3Z3ADTWFAWSQ2H/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-26T17:01:53Z","links":{"resolver":"https://pith.science/pith/IVCUMRLE54AW3Z3ADTWFAWSQ2H","bundle":"https://pith.science/pith/IVCUMRLE54AW3Z3ADTWFAWSQ2H/bundle.json","state":"https://pith.science/pith/IVCUMRLE54AW3Z3ADTWFAWSQ2H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IVCUMRLE54AW3Z3ADTWFAWSQ2H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IVCUMRLE54AW3Z3ADTWFAWSQ2H","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":"c1f932f86ba3780ad0d98b1b9bca471469d534ca46072002fdec8f773da401ba","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2017-01-27T05:49:32Z","title_canon_sha256":"7251369dcdbea8b47c8418a09bc26e11cea1bbb35d496f5b9aec148683828711"},"schema_version":"1.0","source":{"id":"1701.07950","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07950","created_at":"2026-05-18T00:35:04Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07950v3","created_at":"2026-05-18T00:35:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07950","created_at":"2026-05-18T00:35:04Z"},{"alias_kind":"pith_short_12","alias_value":"IVCUMRLE54AW","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IVCUMRLE54AW3Z3A","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IVCUMRLE","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:96e63bb77c4d631d3608241c5459108d3bdac65172caaa4a4421a0e51c5eb3c8","target":"graph","created_at":"2026-05-18T00:35:04Z","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":"Context: Evolutionary algorithms typically require a large number of evaluations (of solutions) to converge - which can be very slow and expensive to evaluate.Objective: To solve search-based software engineering (SE) problems, using fewer evaluations than evolutionary methods.Method: Instead of mutating a small population, we build a very large initial population which is then culled using a recursive bi-clustering chop approach. We evaluate this approach on multiple SE models, unconstrained as well as constrained, and compare its performance with standard evolutionary algorithms. Results: Us","authors_text":"Jianfeng Chen, Tim Menzies, Vivek Nair","cross_cats":["cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2017-01-27T05:49:32Z","title":"Beyond Evolutionary Algorithms for Search-based Software Engineering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07950","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:448d32ed7d46fb883c35e89d72ea9c8d72eede42e233b4fda4d6fe51e8fe3809","target":"record","created_at":"2026-05-18T00:35:04Z","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":"c1f932f86ba3780ad0d98b1b9bca471469d534ca46072002fdec8f773da401ba","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2017-01-27T05:49:32Z","title_canon_sha256":"7251369dcdbea8b47c8418a09bc26e11cea1bbb35d496f5b9aec148683828711"},"schema_version":"1.0","source":{"id":"1701.07950","kind":"arxiv","version":3}},"canonical_sha256":"4545464564ef016de7601cec505a50d1cc3c3256d76ad8b1e9ae1076824142d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4545464564ef016de7601cec505a50d1cc3c3256d76ad8b1e9ae1076824142d3","first_computed_at":"2026-05-18T00:35:04.753021Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:04.753021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qy7DlaOtsqlPe5eHhiE+HAD4rZurZAZr1aSA5+8N6hao9P458kNv1j66IYOWuvCk/UYKGWLdfEzvVYcS19pMDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:04.753881Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.07950","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:448d32ed7d46fb883c35e89d72ea9c8d72eede42e233b4fda4d6fe51e8fe3809","sha256:96e63bb77c4d631d3608241c5459108d3bdac65172caaa4a4421a0e51c5eb3c8"],"state_sha256":"b81d4bdea0e7ca5d0ef6685a3e5709a32978c0418e614507e9b35254f1fee994"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vgIPBPFyhG8TN7hzEI7YKPs0CWoa1D6gfZrzY0N1ETtsKgBBLIfNo3Uj7cQ7m6GrkiCGJKfSKnEjBZ/y/lQBAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:01:53.596954Z","bundle_sha256":"2cb2e6e712958b6799adb3771d24ab6e929a1c86c48b6ae6d8ee99ddcf419108"}}