{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IR2DPCNYYO2KI5OTGV5G3QIIXA","short_pith_number":"pith:IR2DPCNY","schema_version":"1.0","canonical_sha256":"44743789b8c3b4a475d3357a6dc108b83e43d77466b8c9aed2276e506dfd17e2","source":{"kind":"arxiv","id":"2508.05537","version":1},"attestation_state":"computed","paper":{"title":"Tractable Sharpness-Aware Learning of Probabilistic Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Hrithik Suresh, Narayanan C. Krishnan, Sahil Sidheekh, Sriraam Natarajan, Vishnu Shreeram M.P","submitted_at":"2025-08-07T16:13:24Z","abstract_excerpt":"Probabilistic Circuits (PCs) are a class of generative models that allow exact and tractable inference for a wide range of queries. While recent developments have enabled the learning of deep and expressive PCs, this increased capacity can often lead to overfitting, especially when data is limited. We analyze PC overfitting from a log-likelihood-landscape perspective and show that it is often caused by convergence to sharp optima that generalize poorly. Inspired by sharpness aware minimization in neural networks, we propose a Hessian-based regularizer for training PCs. As a key contribution, w"},"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":"2508.05537","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-07T16:13:24Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"473cafb12d5830eb15539750e3be9fdc8a37155b784924acbe800c5b52928e4c","abstract_canon_sha256":"39605f95a224dadeecb433aae32bbacaa6a24a246461b26fd76d03edf5e18c70"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:50:15.032662Z","signature_b64":"I004nxH2uoOzf5ITWfT/U1UuGkpqWKFDwai/MRXs+4cVSCBACxK8YLLbmvlJLtptFgPP/hZROQY1x1O3IeeZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44743789b8c3b4a475d3357a6dc108b83e43d77466b8c9aed2276e506dfd17e2","last_reissued_at":"2026-07-05T11:50:15.032249Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:50:15.032249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tractable Sharpness-Aware Learning of Probabilistic Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Hrithik Suresh, Narayanan C. Krishnan, Sahil Sidheekh, Sriraam Natarajan, Vishnu Shreeram M.P","submitted_at":"2025-08-07T16:13:24Z","abstract_excerpt":"Probabilistic Circuits (PCs) are a class of generative models that allow exact and tractable inference for a wide range of queries. While recent developments have enabled the learning of deep and expressive PCs, this increased capacity can often lead to overfitting, especially when data is limited. We analyze PC overfitting from a log-likelihood-landscape perspective and show that it is often caused by convergence to sharp optima that generalize poorly. Inspired by sharpness aware minimization in neural networks, we propose a Hessian-based regularizer for training PCs. As a key contribution, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.05537","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.05537/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2508.05537","created_at":"2026-07-05T11:50:15.032304+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.05537v1","created_at":"2026-07-05T11:50:15.032304+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.05537","created_at":"2026-07-05T11:50:15.032304+00:00"},{"alias_kind":"pith_short_12","alias_value":"IR2DPCNYYO2K","created_at":"2026-07-05T11:50:15.032304+00:00"},{"alias_kind":"pith_short_16","alias_value":"IR2DPCNYYO2KI5OT","created_at":"2026-07-05T11:50:15.032304+00:00"},{"alias_kind":"pith_short_8","alias_value":"IR2DPCNY","created_at":"2026-07-05T11:50:15.032304+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/IR2DPCNYYO2KI5OTGV5G3QIIXA","json":"https://pith.science/pith/IR2DPCNYYO2KI5OTGV5G3QIIXA.json","graph_json":"https://pith.science/api/pith-number/IR2DPCNYYO2KI5OTGV5G3QIIXA/graph.json","events_json":"https://pith.science/api/pith-number/IR2DPCNYYO2KI5OTGV5G3QIIXA/events.json","paper":"https://pith.science/paper/IR2DPCNY"},"agent_actions":{"view_html":"https://pith.science/pith/IR2DPCNYYO2KI5OTGV5G3QIIXA","download_json":"https://pith.science/pith/IR2DPCNYYO2KI5OTGV5G3QIIXA.json","view_paper":"https://pith.science/paper/IR2DPCNY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.05537&json=true","fetch_graph":"https://pith.science/api/pith-number/IR2DPCNYYO2KI5OTGV5G3QIIXA/graph.json","fetch_events":"https://pith.science/api/pith-number/IR2DPCNYYO2KI5OTGV5G3QIIXA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IR2DPCNYYO2KI5OTGV5G3QIIXA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IR2DPCNYYO2KI5OTGV5G3QIIXA/action/storage_attestation","attest_author":"https://pith.science/pith/IR2DPCNYYO2KI5OTGV5G3QIIXA/action/author_attestation","sign_citation":"https://pith.science/pith/IR2DPCNYYO2KI5OTGV5G3QIIXA/action/citation_signature","submit_replication":"https://pith.science/pith/IR2DPCNYYO2KI5OTGV5G3QIIXA/action/replication_record"}},"created_at":"2026-07-05T11:50:15.032304+00:00","updated_at":"2026-07-05T11:50:15.032304+00:00"}