{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PUQ3P2GDHF5OKCO3IGFN3LU6F3","short_pith_number":"pith:PUQ3P2GD","canonical_record":{"source":{"id":"1309.5896","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-09-23T17:54:22Z","cross_cats_sorted":[],"title_canon_sha256":"2b1d43d7676a58d0d8c9ba92bd1e9461342ee4e4583ab3e9c0d53aabcdcbba79","abstract_canon_sha256":"0c524e07fd372483a201e9f44b2518c77a3cfbf05a76aab5ca449819a51bb9c6"},"schema_version":"1.0"},"canonical_sha256":"7d21b7e8c3397ae509db418addae9e2edcf8ad200711ab818d755c9fc5200f3f","source":{"kind":"arxiv","id":"1309.5896","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5896","created_at":"2026-05-18T03:12:33Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5896v1","created_at":"2026-05-18T03:12:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5896","created_at":"2026-05-18T03:12:33Z"},{"alias_kind":"pith_short_12","alias_value":"PUQ3P2GDHF5O","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"PUQ3P2GDHF5OKCO3","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"PUQ3P2GD","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PUQ3P2GDHF5OKCO3IGFN3LU6F3","target":"record","payload":{"canonical_record":{"source":{"id":"1309.5896","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-09-23T17:54:22Z","cross_cats_sorted":[],"title_canon_sha256":"2b1d43d7676a58d0d8c9ba92bd1e9461342ee4e4583ab3e9c0d53aabcdcbba79","abstract_canon_sha256":"0c524e07fd372483a201e9f44b2518c77a3cfbf05a76aab5ca449819a51bb9c6"},"schema_version":"1.0"},"canonical_sha256":"7d21b7e8c3397ae509db418addae9e2edcf8ad200711ab818d755c9fc5200f3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:33.800721Z","signature_b64":"mVtA5MrKxoKH5eEi/lOG4UIChlbiDQOj2/H9Yts/28oQsK3TIqpqnpYsEGkQTGnLX43s2SjTYwwBAP9yInXVCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d21b7e8c3397ae509db418addae9e2edcf8ad200711ab818d755c9fc5200f3f","last_reissued_at":"2026-05-18T03:12:33.799735Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:33.799735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.5896","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:12:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LYWXI9uilkMDRBh3i9Bnjf6DQrBmVnsLsbc+dsHoiGHtyFT0fHyjcGOTZSZGHuUpoGucaKWLFYNdaYKBIWJ9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:01:18.213523Z"},"content_sha256":"cd5ade22013a62306d5169629a3ee0a19bec364f53e8cbc95e7701ace23e89bd","schema_version":"1.0","event_id":"sha256:cd5ade22013a62306d5169629a3ee0a19bec364f53e8cbc95e7701ace23e89bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PUQ3P2GDHF5OKCO3IGFN3LU6F3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Success Rate of Crossover Operators for Genetic Programming with Offspring Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Andreas Beham, Gabriel Kronberger, Michael Affenzeller, Stefan Wagner, Stephan Winkler","submitted_at":"2013-09-23T17:54:22Z","abstract_excerpt":"Genetic programming is a powerful heuristic search technique that is used for a number of real world applications to solve among others regression, classification, and time-series forecasting problems. A lot of progress towards a theoretic description of genetic programming in form of schema theorems has been made, but the internal dynamics and success factors of genetic programming are still not fully understood. In particular, the effects of different crossover operators in combination with offspring selection are largely unknown.\n  This contribution sheds light on the ability of well-known "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5896","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:12:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hTl7SUDoRy2bMJiFnvwt41gLieuMbMW1nQJTozWw5Nu1Dipw4g6dqeIgYW1ehdsSG+b864NrmywHA2RB8Ly3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:01:18.213885Z"},"content_sha256":"7d125c9d09ad8f2320a0c36c9c2786959304931005432bc413d9ddaed7f89996","schema_version":"1.0","event_id":"sha256:7d125c9d09ad8f2320a0c36c9c2786959304931005432bc413d9ddaed7f89996"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PUQ3P2GDHF5OKCO3IGFN3LU6F3/bundle.json","state_url":"https://pith.science/pith/PUQ3P2GDHF5OKCO3IGFN3LU6F3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PUQ3P2GDHF5OKCO3IGFN3LU6F3/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-01T23:01:18Z","links":{"resolver":"https://pith.science/pith/PUQ3P2GDHF5OKCO3IGFN3LU6F3","bundle":"https://pith.science/pith/PUQ3P2GDHF5OKCO3IGFN3LU6F3/bundle.json","state":"https://pith.science/pith/PUQ3P2GDHF5OKCO3IGFN3LU6F3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PUQ3P2GDHF5OKCO3IGFN3LU6F3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PUQ3P2GDHF5OKCO3IGFN3LU6F3","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":"0c524e07fd372483a201e9f44b2518c77a3cfbf05a76aab5ca449819a51bb9c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-09-23T17:54:22Z","title_canon_sha256":"2b1d43d7676a58d0d8c9ba92bd1e9461342ee4e4583ab3e9c0d53aabcdcbba79"},"schema_version":"1.0","source":{"id":"1309.5896","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5896","created_at":"2026-05-18T03:12:33Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5896v1","created_at":"2026-05-18T03:12:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5896","created_at":"2026-05-18T03:12:33Z"},{"alias_kind":"pith_short_12","alias_value":"PUQ3P2GDHF5O","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"PUQ3P2GDHF5OKCO3","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"PUQ3P2GD","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:7d125c9d09ad8f2320a0c36c9c2786959304931005432bc413d9ddaed7f89996","target":"graph","created_at":"2026-05-18T03:12:33Z","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":"Genetic programming is a powerful heuristic search technique that is used for a number of real world applications to solve among others regression, classification, and time-series forecasting problems. A lot of progress towards a theoretic description of genetic programming in form of schema theorems has been made, but the internal dynamics and success factors of genetic programming are still not fully understood. In particular, the effects of different crossover operators in combination with offspring selection are largely unknown.\n  This contribution sheds light on the ability of well-known ","authors_text":"Andreas Beham, Gabriel Kronberger, Michael Affenzeller, Stefan Wagner, Stephan Winkler","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-09-23T17:54:22Z","title":"On the Success Rate of Crossover Operators for Genetic Programming with Offspring Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5896","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:cd5ade22013a62306d5169629a3ee0a19bec364f53e8cbc95e7701ace23e89bd","target":"record","created_at":"2026-05-18T03:12:33Z","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":"0c524e07fd372483a201e9f44b2518c77a3cfbf05a76aab5ca449819a51bb9c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-09-23T17:54:22Z","title_canon_sha256":"2b1d43d7676a58d0d8c9ba92bd1e9461342ee4e4583ab3e9c0d53aabcdcbba79"},"schema_version":"1.0","source":{"id":"1309.5896","kind":"arxiv","version":1}},"canonical_sha256":"7d21b7e8c3397ae509db418addae9e2edcf8ad200711ab818d755c9fc5200f3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d21b7e8c3397ae509db418addae9e2edcf8ad200711ab818d755c9fc5200f3f","first_computed_at":"2026-05-18T03:12:33.799735Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:33.799735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mVtA5MrKxoKH5eEi/lOG4UIChlbiDQOj2/H9Yts/28oQsK3TIqpqnpYsEGkQTGnLX43s2SjTYwwBAP9yInXVCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:33.800721Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.5896","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd5ade22013a62306d5169629a3ee0a19bec364f53e8cbc95e7701ace23e89bd","sha256:7d125c9d09ad8f2320a0c36c9c2786959304931005432bc413d9ddaed7f89996"],"state_sha256":"6419f7faf1e785b435a0841dbbe6c7b99440bbcb01e07b50bd9943f578f8a18f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q/CerMe7aIsvFQgafsFcx7EuHlLNEHQJMDAHGK+mviob8rkiRawRMn9ezbvOBbsyVL2DQgLrcMRl51MTdhnOCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T23:01:18.215781Z","bundle_sha256":"7cf94700a518b88e95b81545cdaf725d14ce0d6d0297a5506e8d86dec7539c05"}}