{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:L2IXOYGOJ7QQUSF5STVARJLEEW","short_pith_number":"pith:L2IXOYGO","schema_version":"1.0","canonical_sha256":"5e917760ce4fe10a48bd94ea08a5642598ab08a14ecf191b5d56ba3f943feb02","source":{"kind":"arxiv","id":"2508.06706","version":1},"attestation_state":"computed","paper":{"title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Al Mehdi Saadat Chowdhury, Jaikrishna Manojkumar Patil, Nathaniel Lee, Paulo Shakarian, YooJung Choi","submitted_at":"2025-08-08T21:17:03Z","abstract_excerpt":"Rule-based methods for knowledge graph completion provide explainable results but often require a significantly large number of rules to achieve competitive performance. This can hinder explainability due to overwhelmingly large rule sets. We discover rule contexts (meaningful subsets of rules that work together) from training data and use learned probability distribution (i.e. probabilistic circuits) over these rule contexts to more rapidly achieve performance of the full rule set. Our approach achieves a 70-96% reduction in number of rules used while outperforming baseline by up to 31$\\times"},"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.06706","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-08-08T21:17:03Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"8de44d35a2f9e70cd341bb4c4ca121ee4d12227f43d063c10de9cd0faad04aca","abstract_canon_sha256":"e49dcfa0d19942d6d48fff5a7f0b590a44fa169d5c0eebfe0cf83b2e881337c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:51:05.227794Z","signature_b64":"nStOsCsb7wRbVErt5GhksP/HjFN09cwUE91siEb8zjIIGFlOhLEFDVkCsVeOnJzwbrjDsfA5z12Dwe/69mCZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e917760ce4fe10a48bd94ea08a5642598ab08a14ecf191b5d56ba3f943feb02","last_reissued_at":"2026-07-05T11:51:05.227309Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:51:05.227309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Al Mehdi Saadat Chowdhury, Jaikrishna Manojkumar Patil, Nathaniel Lee, Paulo Shakarian, YooJung Choi","submitted_at":"2025-08-08T21:17:03Z","abstract_excerpt":"Rule-based methods for knowledge graph completion provide explainable results but often require a significantly large number of rules to achieve competitive performance. This can hinder explainability due to overwhelmingly large rule sets. We discover rule contexts (meaningful subsets of rules that work together) from training data and use learned probability distribution (i.e. probabilistic circuits) over these rule contexts to more rapidly achieve performance of the full rule set. Our approach achieves a 70-96% reduction in number of rules used while outperforming baseline by up to 31$\\times"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.06706","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.06706/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.06706","created_at":"2026-07-05T11:51:05.227376+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.06706v1","created_at":"2026-07-05T11:51:05.227376+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.06706","created_at":"2026-07-05T11:51:05.227376+00:00"},{"alias_kind":"pith_short_12","alias_value":"L2IXOYGOJ7QQ","created_at":"2026-07-05T11:51:05.227376+00:00"},{"alias_kind":"pith_short_16","alias_value":"L2IXOYGOJ7QQUSF5","created_at":"2026-07-05T11:51:05.227376+00:00"},{"alias_kind":"pith_short_8","alias_value":"L2IXOYGO","created_at":"2026-07-05T11:51:05.227376+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/L2IXOYGOJ7QQUSF5STVARJLEEW","json":"https://pith.science/pith/L2IXOYGOJ7QQUSF5STVARJLEEW.json","graph_json":"https://pith.science/api/pith-number/L2IXOYGOJ7QQUSF5STVARJLEEW/graph.json","events_json":"https://pith.science/api/pith-number/L2IXOYGOJ7QQUSF5STVARJLEEW/events.json","paper":"https://pith.science/paper/L2IXOYGO"},"agent_actions":{"view_html":"https://pith.science/pith/L2IXOYGOJ7QQUSF5STVARJLEEW","download_json":"https://pith.science/pith/L2IXOYGOJ7QQUSF5STVARJLEEW.json","view_paper":"https://pith.science/paper/L2IXOYGO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.06706&json=true","fetch_graph":"https://pith.science/api/pith-number/L2IXOYGOJ7QQUSF5STVARJLEEW/graph.json","fetch_events":"https://pith.science/api/pith-number/L2IXOYGOJ7QQUSF5STVARJLEEW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L2IXOYGOJ7QQUSF5STVARJLEEW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L2IXOYGOJ7QQUSF5STVARJLEEW/action/storage_attestation","attest_author":"https://pith.science/pith/L2IXOYGOJ7QQUSF5STVARJLEEW/action/author_attestation","sign_citation":"https://pith.science/pith/L2IXOYGOJ7QQUSF5STVARJLEEW/action/citation_signature","submit_replication":"https://pith.science/pith/L2IXOYGOJ7QQUSF5STVARJLEEW/action/replication_record"}},"created_at":"2026-07-05T11:51:05.227376+00:00","updated_at":"2026-07-05T11:51:05.227376+00:00"}