{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WR6RTYAD2ABOGHOXK7L3LA3DRW","short_pith_number":"pith:WR6RTYAD","canonical_record":{"source":{"id":"1702.08088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-02-26T21:23:33Z","cross_cats_sorted":["cs.LG","q-bio.GN","q-bio.QM","stat.AP"],"title_canon_sha256":"cdfaade6e2ffa026270db24af8a7e39d03d3b00909d7ee713332733547aa5837","abstract_canon_sha256":"8302820eba4df159469bf88fe40cabd065bd6ea101065deb0cdffb5ff3d6f88d"},"schema_version":"1.0"},"canonical_sha256":"b47d19e003d002e31dd757d7b583638d98891a7dbfd01223335078de3253756f","source":{"kind":"arxiv","id":"1702.08088","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08088","created_at":"2026-05-18T00:49:56Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08088v1","created_at":"2026-05-18T00:49:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08088","created_at":"2026-05-18T00:49:56Z"},{"alias_kind":"pith_short_12","alias_value":"WR6RTYAD2ABO","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WR6RTYAD2ABOGHOX","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WR6RTYAD","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WR6RTYAD2ABOGHOXK7L3LA3DRW","target":"record","payload":{"canonical_record":{"source":{"id":"1702.08088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-02-26T21:23:33Z","cross_cats_sorted":["cs.LG","q-bio.GN","q-bio.QM","stat.AP"],"title_canon_sha256":"cdfaade6e2ffa026270db24af8a7e39d03d3b00909d7ee713332733547aa5837","abstract_canon_sha256":"8302820eba4df159469bf88fe40cabd065bd6ea101065deb0cdffb5ff3d6f88d"},"schema_version":"1.0"},"canonical_sha256":"b47d19e003d002e31dd757d7b583638d98891a7dbfd01223335078de3253756f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:56.073151Z","signature_b64":"hShUlw2wF9ndcP7x4rjv26hJXRwgcYfyQ6Mae58DFfMN+7GFNplHZkhXQBaXIVtnOIw+gZtGUIBEGE8jDB2PBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b47d19e003d002e31dd757d7b583638d98891a7dbfd01223335078de3253756f","last_reissued_at":"2026-05-18T00:49:56.072496Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:56.072496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.08088","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-18T00:49:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yY4k2Lm7HbumCV7R16E40Ld6XIT65J6CjHaAEs2ed0l1GuGZIV0KMjJpM2mXcqfoP0SFYDTpbR9zCoYH8R6BCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T15:07:06.212078Z"},"content_sha256":"889ede1457e59fd5342d10c151dce6108f1063f61ce0282a7289f8985467abd5","schema_version":"1.0","event_id":"sha256:889ede1457e59fd5342d10c151dce6108f1063f61ce0282a7289f8985467abd5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WR6RTYAD2ABOGHOXK7L3LA3DRW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Selection of training populations (and other subset selection problems) with an accelerated genetic algorithm (STPGA: An R-package for selection of training populations with a genetic algorithm)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","q-bio.GN","q-bio.QM","stat.AP"],"primary_cat":"stat.ME","authors_text":"Deniz Akdemir","submitted_at":"2017-02-26T21:23:33Z","abstract_excerpt":"Optimal subset selection is an important task that has numerous algorithms designed for it and has many application areas. STPGA contains a special genetic algorithm supplemented with a tabu memory property (that keeps track of previously tried solutions and their fitness for a number of iterations), and with a regression of the fitness of the solutions on their coding that is used to form the ideal estimated solution (look ahead property) to search for solutions of generic optimal subset selection problems. I have initially developed the programs for the specific problem of selecting training"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08088","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-18T00:49:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cJg7inKo6hPlzVscp7NlACA6Fkf04AjSfM53O/Bw04mj4go4+EdsE2NomKwQCMfjxI0K676dFSJWKfDFnyaSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T15:07:06.212470Z"},"content_sha256":"aa5c75f1a5a0e9469f43bd20683ac3df6ef57969e60ee374d5fe39a6a187618b","schema_version":"1.0","event_id":"sha256:aa5c75f1a5a0e9469f43bd20683ac3df6ef57969e60ee374d5fe39a6a187618b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WR6RTYAD2ABOGHOXK7L3LA3DRW/bundle.json","state_url":"https://pith.science/pith/WR6RTYAD2ABOGHOXK7L3LA3DRW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WR6RTYAD2ABOGHOXK7L3LA3DRW/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-07-01T15:07:06Z","links":{"resolver":"https://pith.science/pith/WR6RTYAD2ABOGHOXK7L3LA3DRW","bundle":"https://pith.science/pith/WR6RTYAD2ABOGHOXK7L3LA3DRW/bundle.json","state":"https://pith.science/pith/WR6RTYAD2ABOGHOXK7L3LA3DRW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WR6RTYAD2ABOGHOXK7L3LA3DRW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WR6RTYAD2ABOGHOXK7L3LA3DRW","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":"8302820eba4df159469bf88fe40cabd065bd6ea101065deb0cdffb5ff3d6f88d","cross_cats_sorted":["cs.LG","q-bio.GN","q-bio.QM","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-02-26T21:23:33Z","title_canon_sha256":"cdfaade6e2ffa026270db24af8a7e39d03d3b00909d7ee713332733547aa5837"},"schema_version":"1.0","source":{"id":"1702.08088","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08088","created_at":"2026-05-18T00:49:56Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08088v1","created_at":"2026-05-18T00:49:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08088","created_at":"2026-05-18T00:49:56Z"},{"alias_kind":"pith_short_12","alias_value":"WR6RTYAD2ABO","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WR6RTYAD2ABOGHOX","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WR6RTYAD","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:aa5c75f1a5a0e9469f43bd20683ac3df6ef57969e60ee374d5fe39a6a187618b","target":"graph","created_at":"2026-05-18T00:49: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":"Optimal subset selection is an important task that has numerous algorithms designed for it and has many application areas. STPGA contains a special genetic algorithm supplemented with a tabu memory property (that keeps track of previously tried solutions and their fitness for a number of iterations), and with a regression of the fitness of the solutions on their coding that is used to form the ideal estimated solution (look ahead property) to search for solutions of generic optimal subset selection problems. I have initially developed the programs for the specific problem of selecting training","authors_text":"Deniz Akdemir","cross_cats":["cs.LG","q-bio.GN","q-bio.QM","stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-02-26T21:23:33Z","title":"Selection of training populations (and other subset selection problems) with an accelerated genetic algorithm (STPGA: An R-package for selection of training populations with a genetic algorithm)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08088","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:889ede1457e59fd5342d10c151dce6108f1063f61ce0282a7289f8985467abd5","target":"record","created_at":"2026-05-18T00:49: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":"8302820eba4df159469bf88fe40cabd065bd6ea101065deb0cdffb5ff3d6f88d","cross_cats_sorted":["cs.LG","q-bio.GN","q-bio.QM","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-02-26T21:23:33Z","title_canon_sha256":"cdfaade6e2ffa026270db24af8a7e39d03d3b00909d7ee713332733547aa5837"},"schema_version":"1.0","source":{"id":"1702.08088","kind":"arxiv","version":1}},"canonical_sha256":"b47d19e003d002e31dd757d7b583638d98891a7dbfd01223335078de3253756f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b47d19e003d002e31dd757d7b583638d98891a7dbfd01223335078de3253756f","first_computed_at":"2026-05-18T00:49:56.072496Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:56.072496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hShUlw2wF9ndcP7x4rjv26hJXRwgcYfyQ6Mae58DFfMN+7GFNplHZkhXQBaXIVtnOIw+gZtGUIBEGE8jDB2PBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:56.073151Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.08088","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:889ede1457e59fd5342d10c151dce6108f1063f61ce0282a7289f8985467abd5","sha256:aa5c75f1a5a0e9469f43bd20683ac3df6ef57969e60ee374d5fe39a6a187618b"],"state_sha256":"788056bcc5b8bd03eb5029e5d1ee1722224e158e478f79567742af0bfd5e5a3b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"78PfdKBoNqj2gxIiMy5LaJV8zN44smOL6Tw1WhZFYAFqczB1M5K4v0uoYuVkb9daFcdooBXhmUxocq9JYlGbCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T15:07:06.214654Z","bundle_sha256":"1083465372911f43be7d125e8179864f8d5859b7b5158aab590dd6e4d8a75ed7"}}