{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:A2RCYKXZKFSNZ57RHSYNSZ6MMS","short_pith_number":"pith:A2RCYKXZ","canonical_record":{"source":{"id":"1611.01708","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-05T23:02:25Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"04b9efa7dbcaa817dd96658864166c9deead5ece75d24b620dcbb100aa2ef2d6","abstract_canon_sha256":"b04e198bdaff307e4d79df1a62f8eca1c7d75d6abef76fa4fe2d694fde49d8ac"},"schema_version":"1.0"},"canonical_sha256":"06a22c2af95164dcf7f13cb0d967cc64a1c05b16ce838d59cc4f82fcbb5f688d","source":{"kind":"arxiv","id":"1611.01708","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01708","created_at":"2026-05-18T00:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01708v2","created_at":"2026-05-18T00:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01708","created_at":"2026-05-18T00:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"A2RCYKXZKFSN","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"A2RCYKXZKFSNZ57R","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"A2RCYKXZ","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:A2RCYKXZKFSNZ57RHSYNSZ6MMS","target":"record","payload":{"canonical_record":{"source":{"id":"1611.01708","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-05T23:02:25Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"04b9efa7dbcaa817dd96658864166c9deead5ece75d24b620dcbb100aa2ef2d6","abstract_canon_sha256":"b04e198bdaff307e4d79df1a62f8eca1c7d75d6abef76fa4fe2d694fde49d8ac"},"schema_version":"1.0"},"canonical_sha256":"06a22c2af95164dcf7f13cb0d967cc64a1c05b16ce838d59cc4f82fcbb5f688d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:42.576522Z","signature_b64":"HsoAKONvSt+L0qMAGDY/FGT4Sa1DSTtuTyNAI7juCVVm/aVAg1VIxSdXijzdkmK95SethqiiXLY6lrif7OMfCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06a22c2af95164dcf7f13cb0d967cc64a1c05b16ce838d59cc4f82fcbb5f688d","last_reissued_at":"2026-05-18T00:19:42.575818Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:42.575818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.01708","source_version":2,"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:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9fcK8v6/Hapi51papdqLv+n1Fr94UEE2RY8oGtYucSX7QduqHGFYz8Ecs6RkjSX1L2eKGryYmted2lyzfD8PBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:25:37.568018Z"},"content_sha256":"bdf75f82bfe2fd6ffcc79016a97203169c411da9428196bebabee35407a4ca55","schema_version":"1.0","event_id":"sha256:bdf75f82bfe2fd6ffcc79016a97203169c411da9428196bebabee35407a4ca55"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:A2RCYKXZKFSNZ57RHSYNSZ6MMS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Detecting Dependencies in Sparse, Multivariate Databases Using Probabilistic Programming and Non-parametric Bayes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Feras Saad, Vikash Mansinghka","submitted_at":"2016-11-05T23:02:25Z","abstract_excerpt":"Datasets with hundreds of variables and many missing values are commonplace. In this setting, it is both statistically and computationally challenging to detect true predictive relationships between variables and also to suppress false positives. This paper proposes an approach that combines probabilistic programming, information theory, and non-parametric Bayes. It shows how to use Bayesian non-parametric modeling to (i) build an ensemble of joint probability models for all the variables; (ii) efficiently detect marginal independencies; and (iii) estimate the conditional mutual information be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01708","kind":"arxiv","version":2},"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:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GPHRMuD2jIhWCZpTODxFWPReYgB90MrcWOKDqybUSxlUX2UsxX/Q/eJLRi1ZWI5kyg1bwMh3QgedqcdI3UXBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:25:37.568389Z"},"content_sha256":"8f5328a42b19afc2ef321d2a8fac9eeb61022c74c3c0b3a91a3a4ad009849dfe","schema_version":"1.0","event_id":"sha256:8f5328a42b19afc2ef321d2a8fac9eeb61022c74c3c0b3a91a3a4ad009849dfe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A2RCYKXZKFSNZ57RHSYNSZ6MMS/bundle.json","state_url":"https://pith.science/pith/A2RCYKXZKFSNZ57RHSYNSZ6MMS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A2RCYKXZKFSNZ57RHSYNSZ6MMS/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-28T10:25:37Z","links":{"resolver":"https://pith.science/pith/A2RCYKXZKFSNZ57RHSYNSZ6MMS","bundle":"https://pith.science/pith/A2RCYKXZKFSNZ57RHSYNSZ6MMS/bundle.json","state":"https://pith.science/pith/A2RCYKXZKFSNZ57RHSYNSZ6MMS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A2RCYKXZKFSNZ57RHSYNSZ6MMS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:A2RCYKXZKFSNZ57RHSYNSZ6MMS","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":"b04e198bdaff307e4d79df1a62f8eca1c7d75d6abef76fa4fe2d694fde49d8ac","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-05T23:02:25Z","title_canon_sha256":"04b9efa7dbcaa817dd96658864166c9deead5ece75d24b620dcbb100aa2ef2d6"},"schema_version":"1.0","source":{"id":"1611.01708","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01708","created_at":"2026-05-18T00:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01708v2","created_at":"2026-05-18T00:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01708","created_at":"2026-05-18T00:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"A2RCYKXZKFSN","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"A2RCYKXZKFSNZ57R","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"A2RCYKXZ","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:8f5328a42b19afc2ef321d2a8fac9eeb61022c74c3c0b3a91a3a4ad009849dfe","target":"graph","created_at":"2026-05-18T00:19:42Z","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":"Datasets with hundreds of variables and many missing values are commonplace. In this setting, it is both statistically and computationally challenging to detect true predictive relationships between variables and also to suppress false positives. This paper proposes an approach that combines probabilistic programming, information theory, and non-parametric Bayes. It shows how to use Bayesian non-parametric modeling to (i) build an ensemble of joint probability models for all the variables; (ii) efficiently detect marginal independencies; and (iii) estimate the conditional mutual information be","authors_text":"Feras Saad, Vikash Mansinghka","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-05T23:02:25Z","title":"Detecting Dependencies in Sparse, Multivariate Databases Using Probabilistic Programming and Non-parametric Bayes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01708","kind":"arxiv","version":2},"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:bdf75f82bfe2fd6ffcc79016a97203169c411da9428196bebabee35407a4ca55","target":"record","created_at":"2026-05-18T00:19:42Z","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":"b04e198bdaff307e4d79df1a62f8eca1c7d75d6abef76fa4fe2d694fde49d8ac","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-05T23:02:25Z","title_canon_sha256":"04b9efa7dbcaa817dd96658864166c9deead5ece75d24b620dcbb100aa2ef2d6"},"schema_version":"1.0","source":{"id":"1611.01708","kind":"arxiv","version":2}},"canonical_sha256":"06a22c2af95164dcf7f13cb0d967cc64a1c05b16ce838d59cc4f82fcbb5f688d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06a22c2af95164dcf7f13cb0d967cc64a1c05b16ce838d59cc4f82fcbb5f688d","first_computed_at":"2026-05-18T00:19:42.575818Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:42.575818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HsoAKONvSt+L0qMAGDY/FGT4Sa1DSTtuTyNAI7juCVVm/aVAg1VIxSdXijzdkmK95SethqiiXLY6lrif7OMfCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:42.576522Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.01708","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bdf75f82bfe2fd6ffcc79016a97203169c411da9428196bebabee35407a4ca55","sha256:8f5328a42b19afc2ef321d2a8fac9eeb61022c74c3c0b3a91a3a4ad009849dfe"],"state_sha256":"677117f4802dc03e02aa858c73adb171567d1e3f0be151f03e264eef7b43417b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A+zoHHFcVAZks8uCq+7CwnmjMSnaTP65HHeX7jRPqPbbcqe+wetzdnvyCpuWfGvKS2Q9NNeCjxxOgOi6jKzLCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:25:37.570392Z","bundle_sha256":"46cbc5053fb04b9e281932b1d45a3c6e3c2f0ab2aeccbe7576522ffd3c575e81"}}