{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3JX55UNYFDQGWLNAB6PJKROJZN","short_pith_number":"pith:3JX55UNY","schema_version":"1.0","canonical_sha256":"da6fded1b828e06b2da00f9e9545c9cb7bee938af14c024536f547d7a0c5b827","source":{"kind":"arxiv","id":"1808.08609","version":1},"attestation_state":"computed","paper":{"title":"Adversarially Regularising Neural NLI Models to Integrate Logical Background Knowledge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Pasquale Minervini, Sebastian Riedel","submitted_at":"2018-08-26T18:36:20Z","abstract_excerpt":"Adversarial examples are inputs to machine learning models designed to cause the model to make a mistake. They are useful for understanding the shortcomings of machine learning models, interpreting their results, and for regularisation. In NLP, however, most example generation strategies produce input text by using known, pre-specified semantic transformations, requiring significant manual effort and in-depth understanding of the problem and domain. In this paper, we investigate the problem of automatically generating adversarial examples that violate a set of given First-Order Logic constrain"},"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":"1808.08609","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-26T18:36:20Z","cross_cats_sorted":["cs.AI","cs.CL","stat.ML"],"title_canon_sha256":"8e838119d6d6016838dd711bdc115d9fa7f996d0a741646f21989e646b15ff23","abstract_canon_sha256":"7d71436e2c402ea9bf0a63deb288e75058a552795e02d31db9c5ca9fe99f9d2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:13.892638Z","signature_b64":"zBt/IzI9foWIAgUvV4jOa1wPgPMh4FNKRQr/Ua2leTNQ/aGpC6qDTE0xDe6WZ33oPm2iuWziWAjQf9LFI0dFBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da6fded1b828e06b2da00f9e9545c9cb7bee938af14c024536f547d7a0c5b827","last_reissued_at":"2026-05-18T00:07:13.891948Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:13.891948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adversarially Regularising Neural NLI Models to Integrate Logical Background Knowledge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Pasquale Minervini, Sebastian Riedel","submitted_at":"2018-08-26T18:36:20Z","abstract_excerpt":"Adversarial examples are inputs to machine learning models designed to cause the model to make a mistake. They are useful for understanding the shortcomings of machine learning models, interpreting their results, and for regularisation. In NLP, however, most example generation strategies produce input text by using known, pre-specified semantic transformations, requiring significant manual effort and in-depth understanding of the problem and domain. In this paper, we investigate the problem of automatically generating adversarial examples that violate a set of given First-Order Logic constrain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08609","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":"1808.08609","created_at":"2026-05-18T00:07:13.892060+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.08609v1","created_at":"2026-05-18T00:07:13.892060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08609","created_at":"2026-05-18T00:07:13.892060+00:00"},{"alias_kind":"pith_short_12","alias_value":"3JX55UNYFDQG","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"3JX55UNYFDQGWLNA","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"3JX55UNY","created_at":"2026-05-18T12:32:02.567920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.17696","citing_title":"Understanding the Logic of Direct Preference Alignment through Logic","ref_index":2017,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3JX55UNYFDQGWLNAB6PJKROJZN","json":"https://pith.science/pith/3JX55UNYFDQGWLNAB6PJKROJZN.json","graph_json":"https://pith.science/api/pith-number/3JX55UNYFDQGWLNAB6PJKROJZN/graph.json","events_json":"https://pith.science/api/pith-number/3JX55UNYFDQGWLNAB6PJKROJZN/events.json","paper":"https://pith.science/paper/3JX55UNY"},"agent_actions":{"view_html":"https://pith.science/pith/3JX55UNYFDQGWLNAB6PJKROJZN","download_json":"https://pith.science/pith/3JX55UNYFDQGWLNAB6PJKROJZN.json","view_paper":"https://pith.science/paper/3JX55UNY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.08609&json=true","fetch_graph":"https://pith.science/api/pith-number/3JX55UNYFDQGWLNAB6PJKROJZN/graph.json","fetch_events":"https://pith.science/api/pith-number/3JX55UNYFDQGWLNAB6PJKROJZN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3JX55UNYFDQGWLNAB6PJKROJZN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3JX55UNYFDQGWLNAB6PJKROJZN/action/storage_attestation","attest_author":"https://pith.science/pith/3JX55UNYFDQGWLNAB6PJKROJZN/action/author_attestation","sign_citation":"https://pith.science/pith/3JX55UNYFDQGWLNAB6PJKROJZN/action/citation_signature","submit_replication":"https://pith.science/pith/3JX55UNYFDQGWLNAB6PJKROJZN/action/replication_record"}},"created_at":"2026-05-18T00:07:13.892060+00:00","updated_at":"2026-05-18T00:07:13.892060+00:00"}