{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WKEXMQBTGTRYRSFH46NHJYU2TO","short_pith_number":"pith:WKEXMQBT","schema_version":"1.0","canonical_sha256":"b28976403334e388c8a7e79a74e29a9baf49195bd2d9340b58939bed5098715f","source":{"kind":"arxiv","id":"2502.16757","version":1},"attestation_state":"computed","paper":{"title":"Entailment-Preserving First-order Logic Representations in Natural Language Entailment","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Heng Ji, Jinu Lee, Julia Hockenmaier, Qi Liu, Runzhi Ma, Vincent Han, Ziqi Wang","submitted_at":"2025-02-24T00:18:17Z","abstract_excerpt":"First-order logic (FOL) can represent the logical entailment semantics of natural language (NL) sentences, but determining natural language entailment using FOL remains a challenge. To address this, we propose the Entailment-Preserving FOL representations (EPF) task and introduce reference-free evaluation metrics for EPF, the Entailment-Preserving Rate (EPR) family. In EPF, one should generate FOL representations from multi-premise natural language entailment data (e.g. EntailmentBank) so that the automatic prover's result preserves the entailment labels. Experiments show that existing methods"},"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":"2502.16757","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-02-24T00:18:17Z","cross_cats_sorted":[],"title_canon_sha256":"9dbf82fa3f5c860a23c66b49bd3a4cb1914a9325ce944d0df561566e5cfac33b","abstract_canon_sha256":"9804b6f2410fc20ae25e756286a4b4791dd209ea3759eb421cb0db110ff62d26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:18:59.137278Z","signature_b64":"XjdWH2hGZtfrroGt2ZH7m+mxmi0WIbtDZ6nmTsqO16ER678ToDVi8STgWr47IJ4R59ALrZ+1uzwd7J3zdXHgCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b28976403334e388c8a7e79a74e29a9baf49195bd2d9340b58939bed5098715f","last_reissued_at":"2026-07-05T10:18:59.136740Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:18:59.136740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Entailment-Preserving First-order Logic Representations in Natural Language Entailment","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Heng Ji, Jinu Lee, Julia Hockenmaier, Qi Liu, Runzhi Ma, Vincent Han, Ziqi Wang","submitted_at":"2025-02-24T00:18:17Z","abstract_excerpt":"First-order logic (FOL) can represent the logical entailment semantics of natural language (NL) sentences, but determining natural language entailment using FOL remains a challenge. To address this, we propose the Entailment-Preserving FOL representations (EPF) task and introduce reference-free evaluation metrics for EPF, the Entailment-Preserving Rate (EPR) family. In EPF, one should generate FOL representations from multi-premise natural language entailment data (e.g. EntailmentBank) so that the automatic prover's result preserves the entailment labels. Experiments show that existing methods"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.16757","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/2502.16757/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":"2502.16757","created_at":"2026-07-05T10:18:59.136835+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.16757v1","created_at":"2026-07-05T10:18:59.136835+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.16757","created_at":"2026-07-05T10:18:59.136835+00:00"},{"alias_kind":"pith_short_12","alias_value":"WKEXMQBTGTRY","created_at":"2026-07-05T10:18:59.136835+00:00"},{"alias_kind":"pith_short_16","alias_value":"WKEXMQBTGTRYRSFH","created_at":"2026-07-05T10:18:59.136835+00:00"},{"alias_kind":"pith_short_8","alias_value":"WKEXMQBT","created_at":"2026-07-05T10:18:59.136835+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.24264","citing_title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WKEXMQBTGTRYRSFH46NHJYU2TO","json":"https://pith.science/pith/WKEXMQBTGTRYRSFH46NHJYU2TO.json","graph_json":"https://pith.science/api/pith-number/WKEXMQBTGTRYRSFH46NHJYU2TO/graph.json","events_json":"https://pith.science/api/pith-number/WKEXMQBTGTRYRSFH46NHJYU2TO/events.json","paper":"https://pith.science/paper/WKEXMQBT"},"agent_actions":{"view_html":"https://pith.science/pith/WKEXMQBTGTRYRSFH46NHJYU2TO","download_json":"https://pith.science/pith/WKEXMQBTGTRYRSFH46NHJYU2TO.json","view_paper":"https://pith.science/paper/WKEXMQBT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.16757&json=true","fetch_graph":"https://pith.science/api/pith-number/WKEXMQBTGTRYRSFH46NHJYU2TO/graph.json","fetch_events":"https://pith.science/api/pith-number/WKEXMQBTGTRYRSFH46NHJYU2TO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WKEXMQBTGTRYRSFH46NHJYU2TO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WKEXMQBTGTRYRSFH46NHJYU2TO/action/storage_attestation","attest_author":"https://pith.science/pith/WKEXMQBTGTRYRSFH46NHJYU2TO/action/author_attestation","sign_citation":"https://pith.science/pith/WKEXMQBTGTRYRSFH46NHJYU2TO/action/citation_signature","submit_replication":"https://pith.science/pith/WKEXMQBTGTRYRSFH46NHJYU2TO/action/replication_record"}},"created_at":"2026-07-05T10:18:59.136835+00:00","updated_at":"2026-07-05T10:18:59.136835+00:00"}