{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:UVL2EWQ6DKLUQ7ZO4B4W2IXVKX","short_pith_number":"pith:UVL2EWQ6","schema_version":"1.0","canonical_sha256":"a557a25a1e1a97487f2ee0796d22f555f9bcca8b48f3dcf7eb320d4604101a40","source":{"kind":"arxiv","id":"2109.13006","version":1},"attestation_state":"computed","paper":{"title":"RuleBert: Teaching Soft Rules to Pre-trained Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG","cs.LO","cs.NE"],"primary_cat":"cs.AI","authors_text":"Mohammed Saeed, Naser Ahmadi, Paolo Papotti, Preslav Nakov","submitted_at":"2021-09-24T16:19:25Z","abstract_excerpt":"While pre-trained language models (PLMs) are the go-to solution to tackle many natural language processing problems, they are still very limited in their ability to capture and to use common-sense knowledge. In fact, even if information is available in the form of approximate (soft) logical rules, it is not clear how to transfer it to a PLM in order to improve its performance for deductive reasoning tasks. Here, we aim to bridge this gap by teaching PLMs how to reason with soft Horn rules. We introduce a classification task where, given facts and soft rules, the PLM should return a prediction "},"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":"2109.13006","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-09-24T16:19:25Z","cross_cats_sorted":["cs.CL","cs.LG","cs.LO","cs.NE"],"title_canon_sha256":"62de8d8d3073d9c3730c05f319d62ab8539e431b8dc4c5d8bea7237299297c5d","abstract_canon_sha256":"d2e8bab4664ff8dbee7618d7b9713383c361e717cd618e7e2d9f8e8389a43d98"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:17:40.137592Z","signature_b64":"IqTIqFcyy5wbYlkGij/i9pwgD6zR4dsnCLsW9cNw70rCSduQInYoPI9cRuCwtWdkOocxYcBFhjp7DPHS7udICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a557a25a1e1a97487f2ee0796d22f555f9bcca8b48f3dcf7eb320d4604101a40","last_reissued_at":"2026-07-05T03:17:40.136973Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:17:40.136973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RuleBert: Teaching Soft Rules to Pre-trained Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG","cs.LO","cs.NE"],"primary_cat":"cs.AI","authors_text":"Mohammed Saeed, Naser Ahmadi, Paolo Papotti, Preslav Nakov","submitted_at":"2021-09-24T16:19:25Z","abstract_excerpt":"While pre-trained language models (PLMs) are the go-to solution to tackle many natural language processing problems, they are still very limited in their ability to capture and to use common-sense knowledge. In fact, even if information is available in the form of approximate (soft) logical rules, it is not clear how to transfer it to a PLM in order to improve its performance for deductive reasoning tasks. Here, we aim to bridge this gap by teaching PLMs how to reason with soft Horn rules. We introduce a classification task where, given facts and soft rules, the PLM should return a prediction "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.13006","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/2109.13006/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":"2109.13006","created_at":"2026-07-05T03:17:40.137030+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.13006v1","created_at":"2026-07-05T03:17:40.137030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.13006","created_at":"2026-07-05T03:17:40.137030+00:00"},{"alias_kind":"pith_short_12","alias_value":"UVL2EWQ6DKLU","created_at":"2026-07-05T03:17:40.137030+00:00"},{"alias_kind":"pith_short_16","alias_value":"UVL2EWQ6DKLUQ7ZO","created_at":"2026-07-05T03:17:40.137030+00:00"},{"alias_kind":"pith_short_8","alias_value":"UVL2EWQ6","created_at":"2026-07-05T03:17:40.137030+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.20564","citing_title":"Where Reasoning Breaks: Logic-Aware Path Selection by Controlling Logical Connectives in LLMs Reasoning Chains","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UVL2EWQ6DKLUQ7ZO4B4W2IXVKX","json":"https://pith.science/pith/UVL2EWQ6DKLUQ7ZO4B4W2IXVKX.json","graph_json":"https://pith.science/api/pith-number/UVL2EWQ6DKLUQ7ZO4B4W2IXVKX/graph.json","events_json":"https://pith.science/api/pith-number/UVL2EWQ6DKLUQ7ZO4B4W2IXVKX/events.json","paper":"https://pith.science/paper/UVL2EWQ6"},"agent_actions":{"view_html":"https://pith.science/pith/UVL2EWQ6DKLUQ7ZO4B4W2IXVKX","download_json":"https://pith.science/pith/UVL2EWQ6DKLUQ7ZO4B4W2IXVKX.json","view_paper":"https://pith.science/paper/UVL2EWQ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.13006&json=true","fetch_graph":"https://pith.science/api/pith-number/UVL2EWQ6DKLUQ7ZO4B4W2IXVKX/graph.json","fetch_events":"https://pith.science/api/pith-number/UVL2EWQ6DKLUQ7ZO4B4W2IXVKX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UVL2EWQ6DKLUQ7ZO4B4W2IXVKX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UVL2EWQ6DKLUQ7ZO4B4W2IXVKX/action/storage_attestation","attest_author":"https://pith.science/pith/UVL2EWQ6DKLUQ7ZO4B4W2IXVKX/action/author_attestation","sign_citation":"https://pith.science/pith/UVL2EWQ6DKLUQ7ZO4B4W2IXVKX/action/citation_signature","submit_replication":"https://pith.science/pith/UVL2EWQ6DKLUQ7ZO4B4W2IXVKX/action/replication_record"}},"created_at":"2026-07-05T03:17:40.137030+00:00","updated_at":"2026-07-05T03:17:40.137030+00:00"}