{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GSVLEGT2675XRDLC5GMXCIDQ5A","short_pith_number":"pith:GSVLEGT2","canonical_record":{"source":{"id":"1710.03285","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-09T19:49:11Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"d238e45fed141e9c82b65f32ce325f0ffad6909e2caac708e59c792b73beb316","abstract_canon_sha256":"89858f4d872ea88b8d9803735938b2ea7b9c4792dd4002d2ab66cdfc093d18bf"},"schema_version":"1.0"},"canonical_sha256":"34aab21a7af7fb788d62e999712070e8044e6e167ba72bdbf076c31807670284","source":{"kind":"arxiv","id":"1710.03285","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03285","created_at":"2026-05-18T00:32:50Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03285v2","created_at":"2026-05-18T00:32:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03285","created_at":"2026-05-18T00:32:50Z"},{"alias_kind":"pith_short_12","alias_value":"GSVLEGT2675X","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GSVLEGT2675XRDLC","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GSVLEGT2","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GSVLEGT2675XRDLC5GMXCIDQ5A","target":"record","payload":{"canonical_record":{"source":{"id":"1710.03285","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-09T19:49:11Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"d238e45fed141e9c82b65f32ce325f0ffad6909e2caac708e59c792b73beb316","abstract_canon_sha256":"89858f4d872ea88b8d9803735938b2ea7b9c4792dd4002d2ab66cdfc093d18bf"},"schema_version":"1.0"},"canonical_sha256":"34aab21a7af7fb788d62e999712070e8044e6e167ba72bdbf076c31807670284","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:50.038207Z","signature_b64":"m72XnJjzc4VoYot/PSjik6nEsT22naGv109WnEbw++QGtMOXUmN3Gx6vxmrZv3+xVhir45dfyLltTrIgelrABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34aab21a7af7fb788d62e999712070e8044e6e167ba72bdbf076c31807670284","last_reissued_at":"2026-05-18T00:32:50.037560Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:50.037560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.03285","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:32:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dlN4vns/q60OmMUKxc4RKAR0ADC3Ns+Oz9T7nuWWPiETRrmpChEA0VbcBJQ9ZnChb7RN/CnxdCMMfMTPOYSfCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:42:28.959862Z"},"content_sha256":"f5550a879673716ed1d83373d52ba504f534104e5b5eeccb8cd19816b99d4f4a","schema_version":"1.0","event_id":"sha256:f5550a879673716ed1d83373d52ba504f534104e5b5eeccb8cd19816b99d4f4a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GSVLEGT2675XRDLC5GMXCIDQ5A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coresets for Dependency Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Alejandro Molina, Alexander Munteanu, Kristian Kersting","submitted_at":"2017-10-09T19:49:11Z","abstract_excerpt":"Many applications infer the structure of a probabilistic graphical model from data to elucidate the relationships between variables. But how can we train graphical models on a massive data set? In this paper, we show how to construct coresets -compressed data sets which can be used as proxy for the original data and have provably bounded worst case error- for Gaussian dependency networks (DNs), i.e., cyclic directed graphical models over Gaussians, where the parents of each variable are its Markov blanket. Specifically, we prove that Gaussian DNs admit coresets of size independent of the size "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03285","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:32:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I3mafacGaPz2VCuMIBL4mt/ETVwqoBkKQoFmJ5eFxFiWwrxipnYysS/7sTk4iRaiyGKrzdp9JxA4VE1tfp6kAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:42:28.960344Z"},"content_sha256":"ccb0c072660cdf3d156d6b72e83c8f68ed2fe4588da1e8a1c0c240c84c84e6d5","schema_version":"1.0","event_id":"sha256:ccb0c072660cdf3d156d6b72e83c8f68ed2fe4588da1e8a1c0c240c84c84e6d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GSVLEGT2675XRDLC5GMXCIDQ5A/bundle.json","state_url":"https://pith.science/pith/GSVLEGT2675XRDLC5GMXCIDQ5A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GSVLEGT2675XRDLC5GMXCIDQ5A/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-27T23:42:28Z","links":{"resolver":"https://pith.science/pith/GSVLEGT2675XRDLC5GMXCIDQ5A","bundle":"https://pith.science/pith/GSVLEGT2675XRDLC5GMXCIDQ5A/bundle.json","state":"https://pith.science/pith/GSVLEGT2675XRDLC5GMXCIDQ5A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GSVLEGT2675XRDLC5GMXCIDQ5A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GSVLEGT2675XRDLC5GMXCIDQ5A","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":"89858f4d872ea88b8d9803735938b2ea7b9c4792dd4002d2ab66cdfc093d18bf","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-09T19:49:11Z","title_canon_sha256":"d238e45fed141e9c82b65f32ce325f0ffad6909e2caac708e59c792b73beb316"},"schema_version":"1.0","source":{"id":"1710.03285","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03285","created_at":"2026-05-18T00:32:50Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03285v2","created_at":"2026-05-18T00:32:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03285","created_at":"2026-05-18T00:32:50Z"},{"alias_kind":"pith_short_12","alias_value":"GSVLEGT2675X","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GSVLEGT2675XRDLC","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GSVLEGT2","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:ccb0c072660cdf3d156d6b72e83c8f68ed2fe4588da1e8a1c0c240c84c84e6d5","target":"graph","created_at":"2026-05-18T00:32:50Z","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":"Many applications infer the structure of a probabilistic graphical model from data to elucidate the relationships between variables. But how can we train graphical models on a massive data set? In this paper, we show how to construct coresets -compressed data sets which can be used as proxy for the original data and have provably bounded worst case error- for Gaussian dependency networks (DNs), i.e., cyclic directed graphical models over Gaussians, where the parents of each variable are its Markov blanket. Specifically, we prove that Gaussian DNs admit coresets of size independent of the size ","authors_text":"Alejandro Molina, Alexander Munteanu, Kristian Kersting","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-09T19:49:11Z","title":"Coresets for Dependency Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03285","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:f5550a879673716ed1d83373d52ba504f534104e5b5eeccb8cd19816b99d4f4a","target":"record","created_at":"2026-05-18T00:32:50Z","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":"89858f4d872ea88b8d9803735938b2ea7b9c4792dd4002d2ab66cdfc093d18bf","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-09T19:49:11Z","title_canon_sha256":"d238e45fed141e9c82b65f32ce325f0ffad6909e2caac708e59c792b73beb316"},"schema_version":"1.0","source":{"id":"1710.03285","kind":"arxiv","version":2}},"canonical_sha256":"34aab21a7af7fb788d62e999712070e8044e6e167ba72bdbf076c31807670284","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34aab21a7af7fb788d62e999712070e8044e6e167ba72bdbf076c31807670284","first_computed_at":"2026-05-18T00:32:50.037560Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:50.037560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m72XnJjzc4VoYot/PSjik6nEsT22naGv109WnEbw++QGtMOXUmN3Gx6vxmrZv3+xVhir45dfyLltTrIgelrABA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:50.038207Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.03285","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5550a879673716ed1d83373d52ba504f534104e5b5eeccb8cd19816b99d4f4a","sha256:ccb0c072660cdf3d156d6b72e83c8f68ed2fe4588da1e8a1c0c240c84c84e6d5"],"state_sha256":"14ef28fb594e69f2cee2a86cf415094023d34aaba63a7cd7c01e946215d58cb3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sOPSFSWUUzZU5nELJuk1OZ5Q0t53Dn6501auZa27pvw5s65T+PVc5lNOBvMfHFi7rqO1zVwEPMJYCPoU7Ks+CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:42:28.962983Z","bundle_sha256":"b6958f7a0b734454d20206af7650eead50a3d7c874b58210a2c2b69f02e7338b"}}