{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RGQVSKFUJIVYFTSSOWK36IWGXQ","short_pith_number":"pith:RGQVSKFU","canonical_record":{"source":{"id":"1404.0752","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-04-03T03:15:26Z","cross_cats_sorted":[],"title_canon_sha256":"d2b167a931495eb4e0abdb2345bed33210aadf333e37427b1bf4d933b1fbd33e","abstract_canon_sha256":"8972de76c68ac9d174756603722511670564856a41fa43fc798a9b8c929e10b0"},"schema_version":"1.0"},"canonical_sha256":"89a15928b44a2b82ce527595bf22c6bc21b9ff0a1a04a7f17e9f24a154d269f8","source":{"kind":"arxiv","id":"1404.0752","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0752","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0752v1","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0752","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"pith_short_12","alias_value":"RGQVSKFUJIVY","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RGQVSKFUJIVYFTSS","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RGQVSKFU","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RGQVSKFUJIVYFTSSOWK36IWGXQ","target":"record","payload":{"canonical_record":{"source":{"id":"1404.0752","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-04-03T03:15:26Z","cross_cats_sorted":[],"title_canon_sha256":"d2b167a931495eb4e0abdb2345bed33210aadf333e37427b1bf4d933b1fbd33e","abstract_canon_sha256":"8972de76c68ac9d174756603722511670564856a41fa43fc798a9b8c929e10b0"},"schema_version":"1.0"},"canonical_sha256":"89a15928b44a2b82ce527595bf22c6bc21b9ff0a1a04a7f17e9f24a154d269f8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:55.581969Z","signature_b64":"iW8wkbu4HsQnrnTkM8BKXnir9qqJFD4LWuYXgW9vgS/JseCr5pfmK8PG3vvjMR35h0lj9kG2rshheWjl6BxZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89a15928b44a2b82ce527595bf22c6bc21b9ff0a1a04a7f17e9f24a154d269f8","last_reissued_at":"2026-05-18T02:54:55.581441Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:55.581441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.0752","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-18T02:54:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gYoVxUSx7JUhbDH6EesVvGHeCFACPTdjymSlW/D/84MhgwXJ9DI9DSKoA3+ItdpKHnLPVeCDhr7HVbij8u9EBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:17:15.006462Z"},"content_sha256":"39378b788c24ab064e550b75e364e53b995c6ce4bbf5196a7aa0204e89ef6e20","schema_version":"1.0","event_id":"sha256:39378b788c24ab064e550b75e364e53b995c6ce4bbf5196a7aa0204e89ef6e20"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RGQVSKFUJIVYFTSSOWK36IWGXQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Search Strategy for Aggregation and Discretization of Attributes of Bayesian Networks Using Minimum Description Length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Daniel Tran, Jem Corcoran, Nicholas Levine","submitted_at":"2014-04-03T03:15:26Z","abstract_excerpt":"Bayesian networks are convenient graphical expressions for high dimensional probability distributions representing complex relationships between a large number of random variables. They have been employed extensively in areas such as bioinformatics, artificial intelligence, diagnosis, and risk management. The recovery of the structure of a network from data is of prime importance for the purposes of modeling, analysis, and prediction. Most recovery algorithms in the literature assume either discrete of continuous but Gaussian data. For general continuous data, discretization is usually employe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0752","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-18T02:54:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5TpuiCNuStqSXfE5jZyY/rEAzkkABX409H2bIAxEYUOeYLQCByVQGJMHden77Z1KnOeaN4OoF+T78L1PpM+nDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:17:15.006836Z"},"content_sha256":"392287f1c8ad734a85eda47ccd2220a24663b8a6ba114fa43af0305f48243811","schema_version":"1.0","event_id":"sha256:392287f1c8ad734a85eda47ccd2220a24663b8a6ba114fa43af0305f48243811"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RGQVSKFUJIVYFTSSOWK36IWGXQ/bundle.json","state_url":"https://pith.science/pith/RGQVSKFUJIVYFTSSOWK36IWGXQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RGQVSKFUJIVYFTSSOWK36IWGXQ/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-29T13:17:15Z","links":{"resolver":"https://pith.science/pith/RGQVSKFUJIVYFTSSOWK36IWGXQ","bundle":"https://pith.science/pith/RGQVSKFUJIVYFTSSOWK36IWGXQ/bundle.json","state":"https://pith.science/pith/RGQVSKFUJIVYFTSSOWK36IWGXQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RGQVSKFUJIVYFTSSOWK36IWGXQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RGQVSKFUJIVYFTSSOWK36IWGXQ","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":"8972de76c68ac9d174756603722511670564856a41fa43fc798a9b8c929e10b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-04-03T03:15:26Z","title_canon_sha256":"d2b167a931495eb4e0abdb2345bed33210aadf333e37427b1bf4d933b1fbd33e"},"schema_version":"1.0","source":{"id":"1404.0752","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0752","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0752v1","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0752","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"pith_short_12","alias_value":"RGQVSKFUJIVY","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RGQVSKFUJIVYFTSS","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RGQVSKFU","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:392287f1c8ad734a85eda47ccd2220a24663b8a6ba114fa43af0305f48243811","target":"graph","created_at":"2026-05-18T02:54:55Z","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":"Bayesian networks are convenient graphical expressions for high dimensional probability distributions representing complex relationships between a large number of random variables. They have been employed extensively in areas such as bioinformatics, artificial intelligence, diagnosis, and risk management. The recovery of the structure of a network from data is of prime importance for the purposes of modeling, analysis, and prediction. Most recovery algorithms in the literature assume either discrete of continuous but Gaussian data. For general continuous data, discretization is usually employe","authors_text":"Daniel Tran, Jem Corcoran, Nicholas Levine","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-04-03T03:15:26Z","title":"An Efficient Search Strategy for Aggregation and Discretization of Attributes of Bayesian Networks Using Minimum Description Length"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0752","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:39378b788c24ab064e550b75e364e53b995c6ce4bbf5196a7aa0204e89ef6e20","target":"record","created_at":"2026-05-18T02:54:55Z","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":"8972de76c68ac9d174756603722511670564856a41fa43fc798a9b8c929e10b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-04-03T03:15:26Z","title_canon_sha256":"d2b167a931495eb4e0abdb2345bed33210aadf333e37427b1bf4d933b1fbd33e"},"schema_version":"1.0","source":{"id":"1404.0752","kind":"arxiv","version":1}},"canonical_sha256":"89a15928b44a2b82ce527595bf22c6bc21b9ff0a1a04a7f17e9f24a154d269f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89a15928b44a2b82ce527595bf22c6bc21b9ff0a1a04a7f17e9f24a154d269f8","first_computed_at":"2026-05-18T02:54:55.581441Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:55.581441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iW8wkbu4HsQnrnTkM8BKXnir9qqJFD4LWuYXgW9vgS/JseCr5pfmK8PG3vvjMR35h0lj9kG2rshheWjl6BxZBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:55.581969Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.0752","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39378b788c24ab064e550b75e364e53b995c6ce4bbf5196a7aa0204e89ef6e20","sha256:392287f1c8ad734a85eda47ccd2220a24663b8a6ba114fa43af0305f48243811"],"state_sha256":"7282e2d6522d115fc6662ac747cc08e5f29ca1ca632d3ba2c19126bccb219107"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PC607r3WnwT9Aa7nUEPPD/E/shpezsnISFvRVGyxAwMZAI9qwgxpH6NPvflsP2m2GcMLdpIKd0AQHgD5awH6Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T13:17:15.008736Z","bundle_sha256":"a9437fb809d92f0d0fd3a0e3fe6b911e528d0d1caf99ed97a54f95533de619d3"}}