{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OOUUMPLQGFCEWYTXVZGOSQVP6J","short_pith_number":"pith:OOUUMPLQ","canonical_record":{"source":{"id":"1506.02113","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-06T03:56:44Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3242b2c7172b560117ed5e3d7baa3d68eecab7f332dd48538765776d99cd46ff","abstract_canon_sha256":"4dfbf2f6cb0f49db0f127fc88b29cc24402b9458be1bcdb0f1f5c1e915d6f064"},"schema_version":"1.0"},"canonical_sha256":"73a9463d7031444b6277ae4ce942aff2730d17ca704a6bcfb989753a50ef95dd","source":{"kind":"arxiv","id":"1506.02113","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02113","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02113v1","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02113","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"pith_short_12","alias_value":"OOUUMPLQGFCE","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OOUUMPLQGFCEWYTX","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OOUUMPLQ","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OOUUMPLQGFCEWYTXVZGOSQVP6J","target":"record","payload":{"canonical_record":{"source":{"id":"1506.02113","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-06T03:56:44Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3242b2c7172b560117ed5e3d7baa3d68eecab7f332dd48538765776d99cd46ff","abstract_canon_sha256":"4dfbf2f6cb0f49db0f127fc88b29cc24402b9458be1bcdb0f1f5c1e915d6f064"},"schema_version":"1.0"},"canonical_sha256":"73a9463d7031444b6277ae4ce942aff2730d17ca704a6bcfb989753a50ef95dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:52.066112Z","signature_b64":"dGLaJymH2Fu0Lc9D7XDTEmrNCN67ZYJFLdNDsbO6/9LudfkdCKElQII/Q6r1bOwtkqDIdALdLhEeqYnxkOquAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73a9463d7031444b6277ae4ce942aff2730d17ca704a6bcfb989753a50ef95dd","last_reissued_at":"2026-05-18T01:55:52.065565Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:52.065565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.02113","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-18T01:55:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oM6tAc2xwIdd+j2z9t4Rc8i1dVAqDDQyHWcwlRHqDA4j5ocDUUct7xgOSgQVvPfH+ljsyVLtPWZs3O1Y/hmSCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:05:05.599199Z"},"content_sha256":"e29b637e5dd2677e6503c1a994f44d3acbc8cb44154cd5e2bf30dc77fe271252","schema_version":"1.0","event_id":"sha256:e29b637e5dd2677e6503c1a994f44d3acbc8cb44154cd5e2bf30dc77fe271252"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OOUUMPLQGFCEWYTXVZGOSQVP6J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Selective Greedy Equivalence Search: Finding Optimal Bayesian Networks Using a Polynomial Number of Score Evaluations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Christopher Meek, David Maxwell Chickering","submitted_at":"2015-06-06T03:56:44Z","abstract_excerpt":"We introduce Selective Greedy Equivalence Search (SGES), a restricted version of Greedy Equivalence Search (GES). SGES retains the asymptotic correctness of GES but, unlike GES, has polynomial performance guarantees. In particular, we show that when data are sampled independently from a distribution that is perfect with respect to a DAG ${\\cal G}$ defined over the observable variables then, in the limit of large data, SGES will identify ${\\cal G}$'s equivalence class after a number of score evaluations that is (1) polynomial in the number of nodes and (2) exponential in various complexity meas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02113","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-18T01:55:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OJl3ZHBsQQNL/jUGDe2CwdKtAJq6RJnzBQmh5XMRbt+V/yNo2Ve+qrxYgxCJ8ONCFdiF4mhDGvN+2LlAIHpLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:05:05.599867Z"},"content_sha256":"1a5f11d69d9db126f9071bef48e22c174514995a1b71e0db0abe0497f870fb35","schema_version":"1.0","event_id":"sha256:1a5f11d69d9db126f9071bef48e22c174514995a1b71e0db0abe0497f870fb35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OOUUMPLQGFCEWYTXVZGOSQVP6J/bundle.json","state_url":"https://pith.science/pith/OOUUMPLQGFCEWYTXVZGOSQVP6J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OOUUMPLQGFCEWYTXVZGOSQVP6J/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-30T12:05:05Z","links":{"resolver":"https://pith.science/pith/OOUUMPLQGFCEWYTXVZGOSQVP6J","bundle":"https://pith.science/pith/OOUUMPLQGFCEWYTXVZGOSQVP6J/bundle.json","state":"https://pith.science/pith/OOUUMPLQGFCEWYTXVZGOSQVP6J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OOUUMPLQGFCEWYTXVZGOSQVP6J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OOUUMPLQGFCEWYTXVZGOSQVP6J","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":"4dfbf2f6cb0f49db0f127fc88b29cc24402b9458be1bcdb0f1f5c1e915d6f064","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-06T03:56:44Z","title_canon_sha256":"3242b2c7172b560117ed5e3d7baa3d68eecab7f332dd48538765776d99cd46ff"},"schema_version":"1.0","source":{"id":"1506.02113","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02113","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02113v1","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02113","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"pith_short_12","alias_value":"OOUUMPLQGFCE","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OOUUMPLQGFCEWYTX","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OOUUMPLQ","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:1a5f11d69d9db126f9071bef48e22c174514995a1b71e0db0abe0497f870fb35","target":"graph","created_at":"2026-05-18T01:55:52Z","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 introduce Selective Greedy Equivalence Search (SGES), a restricted version of Greedy Equivalence Search (GES). SGES retains the asymptotic correctness of GES but, unlike GES, has polynomial performance guarantees. In particular, we show that when data are sampled independently from a distribution that is perfect with respect to a DAG ${\\cal G}$ defined over the observable variables then, in the limit of large data, SGES will identify ${\\cal G}$'s equivalence class after a number of score evaluations that is (1) polynomial in the number of nodes and (2) exponential in various complexity meas","authors_text":"Christopher Meek, David Maxwell Chickering","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-06T03:56:44Z","title":"Selective Greedy Equivalence Search: Finding Optimal Bayesian Networks Using a Polynomial Number of Score Evaluations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02113","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:e29b637e5dd2677e6503c1a994f44d3acbc8cb44154cd5e2bf30dc77fe271252","target":"record","created_at":"2026-05-18T01:55:52Z","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":"4dfbf2f6cb0f49db0f127fc88b29cc24402b9458be1bcdb0f1f5c1e915d6f064","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-06T03:56:44Z","title_canon_sha256":"3242b2c7172b560117ed5e3d7baa3d68eecab7f332dd48538765776d99cd46ff"},"schema_version":"1.0","source":{"id":"1506.02113","kind":"arxiv","version":1}},"canonical_sha256":"73a9463d7031444b6277ae4ce942aff2730d17ca704a6bcfb989753a50ef95dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73a9463d7031444b6277ae4ce942aff2730d17ca704a6bcfb989753a50ef95dd","first_computed_at":"2026-05-18T01:55:52.065565Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:52.065565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dGLaJymH2Fu0Lc9D7XDTEmrNCN67ZYJFLdNDsbO6/9LudfkdCKElQII/Q6r1bOwtkqDIdALdLhEeqYnxkOquAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:52.066112Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.02113","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e29b637e5dd2677e6503c1a994f44d3acbc8cb44154cd5e2bf30dc77fe271252","sha256:1a5f11d69d9db126f9071bef48e22c174514995a1b71e0db0abe0497f870fb35"],"state_sha256":"b58af447985ad403e4b0fe5c19bdddb015ead8c43fba08573ff7dd931d74d242"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5QvYzzrEd7ANMuvEhGsoJaKnO2TdoK3KuK6j6bWUSBmtHKvGAcacRayWXJwTxL4EPGhv4kA8s/3X/wG5H7jQDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:05:05.603087Z","bundle_sha256":"5fe432b1c0986b7b0a5899e251605c09c1add2ed16bca7db5f55437cb2d77916"}}