{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HOGJINK5YZ35VRNOZXW5OK3YBC","short_pith_number":"pith:HOGJINK5","canonical_record":{"source":{"id":"1305.6537","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-05-28T15:42:51Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"0c714f4807939d7fb1b60c622f5e7494f4def6370bde2a9f727349ddb64018ba","abstract_canon_sha256":"ba5db2fa08ba66d07b32bb721d9b5a2c6eda6cb44922ca45934eb6dd01857492"},"schema_version":"1.0"},"canonical_sha256":"3b8c94355dc677dac5aecdedd72b780882e4422033eae633afc9c08b29a5171b","source":{"kind":"arxiv","id":"1305.6537","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6537","created_at":"2026-05-18T03:24:40Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6537v1","created_at":"2026-05-18T03:24:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6537","created_at":"2026-05-18T03:24:40Z"},{"alias_kind":"pith_short_12","alias_value":"HOGJINK5YZ35","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HOGJINK5YZ35VRNO","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HOGJINK5","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HOGJINK5YZ35VRNOZXW5OK3YBC","target":"record","payload":{"canonical_record":{"source":{"id":"1305.6537","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-05-28T15:42:51Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"0c714f4807939d7fb1b60c622f5e7494f4def6370bde2a9f727349ddb64018ba","abstract_canon_sha256":"ba5db2fa08ba66d07b32bb721d9b5a2c6eda6cb44922ca45934eb6dd01857492"},"schema_version":"1.0"},"canonical_sha256":"3b8c94355dc677dac5aecdedd72b780882e4422033eae633afc9c08b29a5171b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:24:40.502215Z","signature_b64":"ENP6g9BLu3V3QpEzaEDMLo0lG5T9oiLeA/Ofn2PS6fK9pDBXAuZtk08Bo7AOFHThNcFguwEyFhxSHNosCYW3Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b8c94355dc677dac5aecdedd72b780882e4422033eae633afc9c08b29a5171b","last_reissued_at":"2026-05-18T03:24:40.501614Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:24:40.501614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.6537","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:24:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ohdJuEGGtm4R2ie95AeSJG3oeNkCNNnex/ZXGNThWx2/1zeauqXYfFC7G3YmShfyD2ql6mKLaJ1lFyW238RBCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T11:19:43.723548Z"},"content_sha256":"80020306114aa0e74b090a788d3d5598bf3a198d5f99221d68f186f2f0c1e410","schema_version":"1.0","event_id":"sha256:80020306114aa0e74b090a788d3d5598bf3a198d5f99221d68f186f2f0c1e410"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HOGJINK5YZ35VRNOZXW5OK3YBC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Cooperative Coevolutionary Genetic Algorithm for Learning Bayesian Network Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Arthur Carvalho","submitted_at":"2013-05-28T15:42:51Z","abstract_excerpt":"We propose a cooperative coevolutionary genetic algorithm for learning Bayesian network structures from fully observable data sets. Since this problem can be decomposed into two dependent subproblems, that is to find an ordering of the nodes and an optimal connectivity matrix, our algorithm uses two subpopulations, each one representing a subtask. We describe the empirical results obtained with simulations of the Alarm and Insurance networks. We show that our algorithm outperforms the deterministic algorithm K2."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6537","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:24:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NPuYu3nK/1BxqxcBYGrMnDR6iTjeEaQb0P+X34qd33cX4tCB1YdV8HBYLJEPKu1mRg2fvvs94lMqt4h5JVlxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T11:19:43.723902Z"},"content_sha256":"b6aac0eebbc190cdae3de47bfee0c98090adf326f09a6d2c33893083bc7df3d8","schema_version":"1.0","event_id":"sha256:b6aac0eebbc190cdae3de47bfee0c98090adf326f09a6d2c33893083bc7df3d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HOGJINK5YZ35VRNOZXW5OK3YBC/bundle.json","state_url":"https://pith.science/pith/HOGJINK5YZ35VRNOZXW5OK3YBC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HOGJINK5YZ35VRNOZXW5OK3YBC/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-26T11:19:43Z","links":{"resolver":"https://pith.science/pith/HOGJINK5YZ35VRNOZXW5OK3YBC","bundle":"https://pith.science/pith/HOGJINK5YZ35VRNOZXW5OK3YBC/bundle.json","state":"https://pith.science/pith/HOGJINK5YZ35VRNOZXW5OK3YBC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HOGJINK5YZ35VRNOZXW5OK3YBC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HOGJINK5YZ35VRNOZXW5OK3YBC","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":"ba5db2fa08ba66d07b32bb721d9b5a2c6eda6cb44922ca45934eb6dd01857492","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-05-28T15:42:51Z","title_canon_sha256":"0c714f4807939d7fb1b60c622f5e7494f4def6370bde2a9f727349ddb64018ba"},"schema_version":"1.0","source":{"id":"1305.6537","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6537","created_at":"2026-05-18T03:24:40Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6537v1","created_at":"2026-05-18T03:24:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6537","created_at":"2026-05-18T03:24:40Z"},{"alias_kind":"pith_short_12","alias_value":"HOGJINK5YZ35","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HOGJINK5YZ35VRNO","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HOGJINK5","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:b6aac0eebbc190cdae3de47bfee0c98090adf326f09a6d2c33893083bc7df3d8","target":"graph","created_at":"2026-05-18T03:24:40Z","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":"We propose a cooperative coevolutionary genetic algorithm for learning Bayesian network structures from fully observable data sets. Since this problem can be decomposed into two dependent subproblems, that is to find an ordering of the nodes and an optimal connectivity matrix, our algorithm uses two subpopulations, each one representing a subtask. We describe the empirical results obtained with simulations of the Alarm and Insurance networks. We show that our algorithm outperforms the deterministic algorithm K2.","authors_text":"Arthur Carvalho","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-05-28T15:42:51Z","title":"A Cooperative Coevolutionary Genetic Algorithm for Learning Bayesian Network Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6537","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:80020306114aa0e74b090a788d3d5598bf3a198d5f99221d68f186f2f0c1e410","target":"record","created_at":"2026-05-18T03:24:40Z","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":"ba5db2fa08ba66d07b32bb721d9b5a2c6eda6cb44922ca45934eb6dd01857492","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-05-28T15:42:51Z","title_canon_sha256":"0c714f4807939d7fb1b60c622f5e7494f4def6370bde2a9f727349ddb64018ba"},"schema_version":"1.0","source":{"id":"1305.6537","kind":"arxiv","version":1}},"canonical_sha256":"3b8c94355dc677dac5aecdedd72b780882e4422033eae633afc9c08b29a5171b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b8c94355dc677dac5aecdedd72b780882e4422033eae633afc9c08b29a5171b","first_computed_at":"2026-05-18T03:24:40.501614Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:24:40.501614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ENP6g9BLu3V3QpEzaEDMLo0lG5T9oiLeA/Ofn2PS6fK9pDBXAuZtk08Bo7AOFHThNcFguwEyFhxSHNosCYW3Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:24:40.502215Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.6537","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80020306114aa0e74b090a788d3d5598bf3a198d5f99221d68f186f2f0c1e410","sha256:b6aac0eebbc190cdae3de47bfee0c98090adf326f09a6d2c33893083bc7df3d8"],"state_sha256":"45c66b2b818c81c58c776534fc0c85885aafd02863e7b106fc0569628c73e300"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8uZYM+D20vD2652A6oT02bF8CfbeVp3Lf87ocmdzODL5JniJd5pZieV1VP4wxaocxQycKfDBmat/SqAK0WQ0CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T11:19:43.725910Z","bundle_sha256":"01e6764953ecf943995757297e4f71aca9d7f9b36625772d83eb4dc94bc23cb6"}}