{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OAC4IGJN43573YNKQALTCUAJYM","short_pith_number":"pith:OAC4IGJN","schema_version":"1.0","canonical_sha256":"7005c4192de6fbfde1aa8017315009c333a0902427e3b47eedfd50425fa50826","source":{"kind":"arxiv","id":"1309.6820","version":1},"attestation_state":"computed","paper":{"title":"SparsityBoost: A New Scoring Function for Learning Bayesian Network Structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"David Sontag, Eliot Brenner","submitted_at":"2013-09-26T12:35:41Z","abstract_excerpt":"We give a new consistent scoring function for structure learning of Bayesian networks. In contrast to traditional approaches to scorebased structure learning, such as BDeu or MDL, the complexity penalty that we propose is data-dependent and is given by the probability that a conditional independence test correctly shows that an edge cannot exist. What really distinguishes this new scoring function from earlier work is that it has the property of becoming computationally easier to maximize as the amount of data increases. We prove a polynomial sample complexity result, showing that maximizing t"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1309.6820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-26T12:35:41Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"1136d71685bbbf97a60df7404ff913799921b454042bcaacdd392016df614b26","abstract_canon_sha256":"c98624a7ce8cfd950ecb347d03a08698dd775fbe086b35a8b7426875db98ef2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:10.351129Z","signature_b64":"jqs4sfKOcsRdNTZkckG8/ALTAODBQEZq7vmb3OHV6+GIuqAjOklZphsr33xD1RNgPVDrJ7VWQ/X/NuHXdWRTDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7005c4192de6fbfde1aa8017315009c333a0902427e3b47eedfd50425fa50826","last_reissued_at":"2026-05-18T03:12:10.350397Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:10.350397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SparsityBoost: A New Scoring Function for Learning Bayesian Network Structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"David Sontag, Eliot Brenner","submitted_at":"2013-09-26T12:35:41Z","abstract_excerpt":"We give a new consistent scoring function for structure learning of Bayesian networks. In contrast to traditional approaches to scorebased structure learning, such as BDeu or MDL, the complexity penalty that we propose is data-dependent and is given by the probability that a conditional independence test correctly shows that an edge cannot exist. What really distinguishes this new scoring function from earlier work is that it has the property of becoming computationally easier to maximize as the amount of data increases. We prove a polynomial sample complexity result, showing that maximizing t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6820","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1309.6820","created_at":"2026-05-18T03:12:10.350520+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.6820v1","created_at":"2026-05-18T03:12:10.350520+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6820","created_at":"2026-05-18T03:12:10.350520+00:00"},{"alias_kind":"pith_short_12","alias_value":"OAC4IGJN4357","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OAC4IGJN43573YNK","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OAC4IGJN","created_at":"2026-05-18T12:27:54.935989+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OAC4IGJN43573YNKQALTCUAJYM","json":"https://pith.science/pith/OAC4IGJN43573YNKQALTCUAJYM.json","graph_json":"https://pith.science/api/pith-number/OAC4IGJN43573YNKQALTCUAJYM/graph.json","events_json":"https://pith.science/api/pith-number/OAC4IGJN43573YNKQALTCUAJYM/events.json","paper":"https://pith.science/paper/OAC4IGJN"},"agent_actions":{"view_html":"https://pith.science/pith/OAC4IGJN43573YNKQALTCUAJYM","download_json":"https://pith.science/pith/OAC4IGJN43573YNKQALTCUAJYM.json","view_paper":"https://pith.science/paper/OAC4IGJN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.6820&json=true","fetch_graph":"https://pith.science/api/pith-number/OAC4IGJN43573YNKQALTCUAJYM/graph.json","fetch_events":"https://pith.science/api/pith-number/OAC4IGJN43573YNKQALTCUAJYM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OAC4IGJN43573YNKQALTCUAJYM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OAC4IGJN43573YNKQALTCUAJYM/action/storage_attestation","attest_author":"https://pith.science/pith/OAC4IGJN43573YNKQALTCUAJYM/action/author_attestation","sign_citation":"https://pith.science/pith/OAC4IGJN43573YNKQALTCUAJYM/action/citation_signature","submit_replication":"https://pith.science/pith/OAC4IGJN43573YNKQALTCUAJYM/action/replication_record"}},"created_at":"2026-05-18T03:12:10.350520+00:00","updated_at":"2026-05-18T03:12:10.350520+00:00"}