{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:R4S4TH3WQFJ2AKPK37SG66G7MO","short_pith_number":"pith:R4S4TH3W","canonical_record":{"source":{"id":"1301.6685","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-23T15:57:18Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"63008632da6a3545086b3ea38e76498d13ba3ed4ec23c1bbca59001b9eb4802d","abstract_canon_sha256":"2e90c1b77c05293a7a063957ae5277d713c77522a2386a1c4c9524bc608ff925"},"schema_version":"1.0"},"canonical_sha256":"8f25c99f768153a029eadfe46f78df63820a41c80ba707faeb0281b4f3b90963","source":{"kind":"arxiv","id":"1301.6685","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6685","created_at":"2026-05-18T02:07:32Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6685v2","created_at":"2026-05-18T02:07:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6685","created_at":"2026-05-18T02:07:32Z"},{"alias_kind":"pith_short_12","alias_value":"R4S4TH3WQFJ2","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"R4S4TH3WQFJ2AKPK","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"R4S4TH3W","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:R4S4TH3WQFJ2AKPK37SG66G7MO","target":"record","payload":{"canonical_record":{"source":{"id":"1301.6685","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-23T15:57:18Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"63008632da6a3545086b3ea38e76498d13ba3ed4ec23c1bbca59001b9eb4802d","abstract_canon_sha256":"2e90c1b77c05293a7a063957ae5277d713c77522a2386a1c4c9524bc608ff925"},"schema_version":"1.0"},"canonical_sha256":"8f25c99f768153a029eadfe46f78df63820a41c80ba707faeb0281b4f3b90963","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:07:32.466405Z","signature_b64":"zP6gGjeXa2Pdu2V7Lwl/7eXYeykOLtUKUJ1x676tN3jaIjWVbFYeLz3VJ1IKngPTs03Z+0IjHX1eH1DxhXXUDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f25c99f768153a029eadfe46f78df63820a41c80ba707faeb0281b4f3b90963","last_reissued_at":"2026-05-18T02:07:32.465924Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:07:32.465924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.6685","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-18T02:07:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ugjseSMbjVN3A5prnGqFfsGBE8KKzrMaFN/D3iYSnCG1ZWbINNutA55DThFWWpzd/7RT3pw/GkjTtslT8Ve4DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:04:21.137123Z"},"content_sha256":"7f8741081792d934f5df898514d49f99a9f1f46e9a3041178efcd712b99d2e7a","schema_version":"1.0","event_id":"sha256:7f8741081792d934f5df898514d49f99a9f1f46e9a3041178efcd712b99d2e7a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:R4S4TH3WQFJ2AKPK37SG66G7MO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Learning from Sparse Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"David Heckerman, David Maxwell Chickering","submitted_at":"2013-01-23T15:57:18Z","abstract_excerpt":"We describe two techniques that significantly improve the running time of several standard machine-learning algorithms when data is sparse. The first technique is an algorithm that effeciently extracts one-way and two-way counts--either real or expected-- from discrete data. Extracting such counts is a fundamental step in learning algorithms for constructing a variety of models including decision trees, decision graphs, Bayesian networks, and naive-Bayes clustering models. The second technique is an algorithm that efficiently performs the E-step of the EM algorithm (i.e. inference) when applie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6685","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-18T02:07:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wdF3Fzpo5oD0da2Xr/M+3vF7rJJrEzN3fGb/RCE4LZHIbT0bNuTxwFbluCVH2DSIgd0W56dFW5zJQH8Vp9xuDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:04:21.137484Z"},"content_sha256":"7ac920d7461dd8ec30171e29eeadeedd79a3e7e3d6397a381468928999a29827","schema_version":"1.0","event_id":"sha256:7ac920d7461dd8ec30171e29eeadeedd79a3e7e3d6397a381468928999a29827"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R4S4TH3WQFJ2AKPK37SG66G7MO/bundle.json","state_url":"https://pith.science/pith/R4S4TH3WQFJ2AKPK37SG66G7MO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R4S4TH3WQFJ2AKPK37SG66G7MO/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-03T02:04:21Z","links":{"resolver":"https://pith.science/pith/R4S4TH3WQFJ2AKPK37SG66G7MO","bundle":"https://pith.science/pith/R4S4TH3WQFJ2AKPK37SG66G7MO/bundle.json","state":"https://pith.science/pith/R4S4TH3WQFJ2AKPK37SG66G7MO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R4S4TH3WQFJ2AKPK37SG66G7MO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:R4S4TH3WQFJ2AKPK37SG66G7MO","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":"2e90c1b77c05293a7a063957ae5277d713c77522a2386a1c4c9524bc608ff925","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-23T15:57:18Z","title_canon_sha256":"63008632da6a3545086b3ea38e76498d13ba3ed4ec23c1bbca59001b9eb4802d"},"schema_version":"1.0","source":{"id":"1301.6685","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6685","created_at":"2026-05-18T02:07:32Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6685v2","created_at":"2026-05-18T02:07:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6685","created_at":"2026-05-18T02:07:32Z"},{"alias_kind":"pith_short_12","alias_value":"R4S4TH3WQFJ2","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"R4S4TH3WQFJ2AKPK","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"R4S4TH3W","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:7ac920d7461dd8ec30171e29eeadeedd79a3e7e3d6397a381468928999a29827","target":"graph","created_at":"2026-05-18T02:07:32Z","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 describe two techniques that significantly improve the running time of several standard machine-learning algorithms when data is sparse. The first technique is an algorithm that effeciently extracts one-way and two-way counts--either real or expected-- from discrete data. Extracting such counts is a fundamental step in learning algorithms for constructing a variety of models including decision trees, decision graphs, Bayesian networks, and naive-Bayes clustering models. The second technique is an algorithm that efficiently performs the E-step of the EM algorithm (i.e. inference) when applie","authors_text":"David Heckerman, David Maxwell Chickering","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-23T15:57:18Z","title":"Fast Learning from Sparse Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6685","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:7f8741081792d934f5df898514d49f99a9f1f46e9a3041178efcd712b99d2e7a","target":"record","created_at":"2026-05-18T02:07:32Z","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":"2e90c1b77c05293a7a063957ae5277d713c77522a2386a1c4c9524bc608ff925","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-23T15:57:18Z","title_canon_sha256":"63008632da6a3545086b3ea38e76498d13ba3ed4ec23c1bbca59001b9eb4802d"},"schema_version":"1.0","source":{"id":"1301.6685","kind":"arxiv","version":2}},"canonical_sha256":"8f25c99f768153a029eadfe46f78df63820a41c80ba707faeb0281b4f3b90963","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f25c99f768153a029eadfe46f78df63820a41c80ba707faeb0281b4f3b90963","first_computed_at":"2026-05-18T02:07:32.465924Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:07:32.465924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zP6gGjeXa2Pdu2V7Lwl/7eXYeykOLtUKUJ1x676tN3jaIjWVbFYeLz3VJ1IKngPTs03Z+0IjHX1eH1DxhXXUDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:07:32.466405Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6685","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f8741081792d934f5df898514d49f99a9f1f46e9a3041178efcd712b99d2e7a","sha256:7ac920d7461dd8ec30171e29eeadeedd79a3e7e3d6397a381468928999a29827"],"state_sha256":"8d5fde62fed2ab013ecc45a972729d77a40c26a7e2ba3507668f6e1faff391bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a73o3Xe8bnujgKJJfaY47xJJlzuiA/qrFosRyTBcSX1fVLffmqSAWRjs0AF/FnFbvd+LZ1sjreIg1aiAYBElBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:04:21.139564Z","bundle_sha256":"c9b61b9e10c09e7119332cf89be699311b7f332dd1630ecc3ee9da2b7123da4a"}}