{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:5IRDYKNRS73PUCBG67PHRQ76XW","short_pith_number":"pith:5IRDYKNR","canonical_record":{"source":{"id":"2503.08141","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-11T07:59:56Z","cross_cats_sorted":[],"title_canon_sha256":"5f53f79b10f1e8b1706a899ecf4c67320990f3dc4a1bafd27d2f8c22874e37c8","abstract_canon_sha256":"be2f973e8aac77aa2b5f5de23398b0896a0c779e894036b61f998b13ec5a5b9f"},"schema_version":"1.0"},"canonical_sha256":"ea223c29b197f6fa0826f7de78c3febd8fbeab2d4e23dabbf183f072fd79abf5","source":{"kind":"arxiv","id":"2503.08141","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.08141","created_at":"2026-07-05T10:28:52Z"},{"alias_kind":"arxiv_version","alias_value":"2503.08141v1","created_at":"2026-07-05T10:28:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.08141","created_at":"2026-07-05T10:28:52Z"},{"alias_kind":"pith_short_12","alias_value":"5IRDYKNRS73P","created_at":"2026-07-05T10:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"5IRDYKNRS73PUCBG","created_at":"2026-07-05T10:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"5IRDYKNR","created_at":"2026-07-05T10:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:5IRDYKNRS73PUCBG67PHRQ76XW","target":"record","payload":{"canonical_record":{"source":{"id":"2503.08141","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-11T07:59:56Z","cross_cats_sorted":[],"title_canon_sha256":"5f53f79b10f1e8b1706a899ecf4c67320990f3dc4a1bafd27d2f8c22874e37c8","abstract_canon_sha256":"be2f973e8aac77aa2b5f5de23398b0896a0c779e894036b61f998b13ec5a5b9f"},"schema_version":"1.0"},"canonical_sha256":"ea223c29b197f6fa0826f7de78c3febd8fbeab2d4e23dabbf183f072fd79abf5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:28:52.044390Z","signature_b64":"42mqVAsTB+RtHk4Q25DX1Jf4f8RvThyqbfyJPKRbjZqQFLyUZ2D6JB8HYIKook75OEH81z6Oo0DgReVhR/ApBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea223c29b197f6fa0826f7de78c3febd8fbeab2d4e23dabbf183f072fd79abf5","last_reissued_at":"2026-07-05T10:28:52.043705Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:28:52.043705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.08141","source_version":1,"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-07-05T10:28:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QA784hCaNN6HTgyerfgrsnT8/p3/JQZbsVfYT5nt48Vcl7q/7JAVcI1PZtbMwX/855lwdv4kP9bJ7Eeyx2/3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T09:04:55.980901Z"},"content_sha256":"c9743010f6f9de620cc34675e4acefdf81b5d115142df27c6e7813e23f26867e","schema_version":"1.0","event_id":"sha256:c9743010f6f9de620cc34675e4acefdf81b5d115142df27c6e7813e23f26867e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:5IRDYKNRS73PUCBG67PHRQ76XW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scaling Probabilistic Circuits via Data Partitioning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Devendra Singh Dhami, Florian Peter Busch, Jonas Seng, Kristian Kersting, Martin Mundt, Pooja Prasad","submitted_at":"2025-03-11T07:59:56Z","abstract_excerpt":"Probabilistic circuits (PCs) enable us to learn joint distributions over a set of random variables and to perform various probabilistic queries in a tractable fashion. Though the tractability property allows PCs to scale beyond non-tractable models such as Bayesian Networks, scaling training and inference of PCs to larger, real-world datasets remains challenging. To remedy the situation, we show how PCs can be learned across multiple machines by recursively partitioning a distributed dataset, thereby unveiling a deep connection between PCs and federated learning (FL). This leads to federated c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.08141","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/2503.08141/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"},"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-07-05T10:28:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k2mOqKL9EEEoMItx5M4vSNe7ev8X2ysTrFvjtuSVW8GjfMOyEwYDE0LybxN+Evlix6ivnjpe00uJ3lYJkYWsBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T09:04:55.981372Z"},"content_sha256":"9771220487b7f589d733a51aa98cd797ccc5677a84490ccc55f75fbb420dea06","schema_version":"1.0","event_id":"sha256:9771220487b7f589d733a51aa98cd797ccc5677a84490ccc55f75fbb420dea06"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5IRDYKNRS73PUCBG67PHRQ76XW/bundle.json","state_url":"https://pith.science/pith/5IRDYKNRS73PUCBG67PHRQ76XW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5IRDYKNRS73PUCBG67PHRQ76XW/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-08-01T09:04:55Z","links":{"resolver":"https://pith.science/pith/5IRDYKNRS73PUCBG67PHRQ76XW","bundle":"https://pith.science/pith/5IRDYKNRS73PUCBG67PHRQ76XW/bundle.json","state":"https://pith.science/pith/5IRDYKNRS73PUCBG67PHRQ76XW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5IRDYKNRS73PUCBG67PHRQ76XW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:5IRDYKNRS73PUCBG67PHRQ76XW","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":"be2f973e8aac77aa2b5f5de23398b0896a0c779e894036b61f998b13ec5a5b9f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-11T07:59:56Z","title_canon_sha256":"5f53f79b10f1e8b1706a899ecf4c67320990f3dc4a1bafd27d2f8c22874e37c8"},"schema_version":"1.0","source":{"id":"2503.08141","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.08141","created_at":"2026-07-05T10:28:52Z"},{"alias_kind":"arxiv_version","alias_value":"2503.08141v1","created_at":"2026-07-05T10:28:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.08141","created_at":"2026-07-05T10:28:52Z"},{"alias_kind":"pith_short_12","alias_value":"5IRDYKNRS73P","created_at":"2026-07-05T10:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"5IRDYKNRS73PUCBG","created_at":"2026-07-05T10:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"5IRDYKNR","created_at":"2026-07-05T10:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:9771220487b7f589d733a51aa98cd797ccc5677a84490ccc55f75fbb420dea06","target":"graph","created_at":"2026-07-05T10:28:52Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2503.08141/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Probabilistic circuits (PCs) enable us to learn joint distributions over a set of random variables and to perform various probabilistic queries in a tractable fashion. Though the tractability property allows PCs to scale beyond non-tractable models such as Bayesian Networks, scaling training and inference of PCs to larger, real-world datasets remains challenging. To remedy the situation, we show how PCs can be learned across multiple machines by recursively partitioning a distributed dataset, thereby unveiling a deep connection between PCs and federated learning (FL). This leads to federated c","authors_text":"Devendra Singh Dhami, Florian Peter Busch, Jonas Seng, Kristian Kersting, Martin Mundt, Pooja Prasad","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-11T07:59:56Z","title":"Scaling Probabilistic Circuits via Data Partitioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.08141","kind":"arxiv","version":1},"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:c9743010f6f9de620cc34675e4acefdf81b5d115142df27c6e7813e23f26867e","target":"record","created_at":"2026-07-05T10:28:52Z","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":"be2f973e8aac77aa2b5f5de23398b0896a0c779e894036b61f998b13ec5a5b9f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-11T07:59:56Z","title_canon_sha256":"5f53f79b10f1e8b1706a899ecf4c67320990f3dc4a1bafd27d2f8c22874e37c8"},"schema_version":"1.0","source":{"id":"2503.08141","kind":"arxiv","version":1}},"canonical_sha256":"ea223c29b197f6fa0826f7de78c3febd8fbeab2d4e23dabbf183f072fd79abf5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea223c29b197f6fa0826f7de78c3febd8fbeab2d4e23dabbf183f072fd79abf5","first_computed_at":"2026-07-05T10:28:52.043705Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:28:52.043705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"42mqVAsTB+RtHk4Q25DX1Jf4f8RvThyqbfyJPKRbjZqQFLyUZ2D6JB8HYIKook75OEH81z6Oo0DgReVhR/ApBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:28:52.044390Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.08141","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9743010f6f9de620cc34675e4acefdf81b5d115142df27c6e7813e23f26867e","sha256:9771220487b7f589d733a51aa98cd797ccc5677a84490ccc55f75fbb420dea06"],"state_sha256":"5362c35d75a3a6fbd444f8454e231110b3e3a9c0a129eee89f720662d8b58c86"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q5UYNAp0bkndsyW8H1ZsevgfuUfsKwJqP4C/Z0fwwToUgAUnu705ixODx723FNG+kzstHiZteYewkqgpOBYbDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T09:04:55.986106Z","bundle_sha256":"e2ae8e0e4f9d591c31e4c58915c3786e823bb4accd07ef98558b9b3a4ac2ee6e"}}