{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:A3TAFEGS5KBP5ZXDHCYTMDFWBZ","short_pith_number":"pith:A3TAFEGS","schema_version":"1.0","canonical_sha256":"06e60290d2ea82fee6e338b1360cb60e483a550868ed14ee467610605b5d7ce0","source":{"kind":"arxiv","id":"2505.24264","version":1},"attestation_state":"computed","paper":{"title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Andr\\'e Freitas, Louise A. Dennis, Marco Valentino, Xin Quan","submitted_at":"2025-05-30T06:38:39Z","abstract_excerpt":"Natural language explanations play a fundamental role in Natural Language Inference (NLI) by revealing how premises logically entail hypotheses. Recent work has shown that the interaction of large language models (LLMs) with theorem provers (TPs) can help verify and improve the validity of NLI explanations. However, TPs require translating natural language into machine-verifiable formal representations, a process that introduces the risk of semantic information loss and unfaithful interpretation, an issue compounded by LLMs' challenges in capturing critical logical structures with sufficient p"},"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":"2505.24264","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-05-30T06:38:39Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"2681487e94d012d4b8f2ff4b83428d16cffbe77f7d4f63a52e7877e2bb62c617","abstract_canon_sha256":"fa0fea2daeffe15867654892de8d2d62614518781222cff1efa1a71814f124c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:12:45.474851Z","signature_b64":"N7p5Xj1pDH4xx6jeNHeF2dFSAp/b4BtPLDY/nVCGo68nf4wyebmp5UPvZzjOrD/J92o5/FXk0vkRttFgZopABg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06e60290d2ea82fee6e338b1360cb60e483a550868ed14ee467610605b5d7ce0","last_reissued_at":"2026-07-05T11:12:45.474356Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:12:45.474356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Andr\\'e Freitas, Louise A. Dennis, Marco Valentino, Xin Quan","submitted_at":"2025-05-30T06:38:39Z","abstract_excerpt":"Natural language explanations play a fundamental role in Natural Language Inference (NLI) by revealing how premises logically entail hypotheses. Recent work has shown that the interaction of large language models (LLMs) with theorem provers (TPs) can help verify and improve the validity of NLI explanations. However, TPs require translating natural language into machine-verifiable formal representations, a process that introduces the risk of semantic information loss and unfaithful interpretation, an issue compounded by LLMs' challenges in capturing critical logical structures with sufficient p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.24264","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/2505.24264/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":"2505.24264","created_at":"2026-07-05T11:12:45.474415+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.24264v1","created_at":"2026-07-05T11:12:45.474415+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.24264","created_at":"2026-07-05T11:12:45.474415+00:00"},{"alias_kind":"pith_short_12","alias_value":"A3TAFEGS5KBP","created_at":"2026-07-05T11:12:45.474415+00:00"},{"alias_kind":"pith_short_16","alias_value":"A3TAFEGS5KBP5ZXD","created_at":"2026-07-05T11:12:45.474415+00:00"},{"alias_kind":"pith_short_8","alias_value":"A3TAFEGS","created_at":"2026-07-05T11:12:45.474415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.09449","citing_title":"Reasoning without Gold Standards: A Proxy-Judge Theory of Autoformalization","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A3TAFEGS5KBP5ZXDHCYTMDFWBZ","json":"https://pith.science/pith/A3TAFEGS5KBP5ZXDHCYTMDFWBZ.json","graph_json":"https://pith.science/api/pith-number/A3TAFEGS5KBP5ZXDHCYTMDFWBZ/graph.json","events_json":"https://pith.science/api/pith-number/A3TAFEGS5KBP5ZXDHCYTMDFWBZ/events.json","paper":"https://pith.science/paper/A3TAFEGS"},"agent_actions":{"view_html":"https://pith.science/pith/A3TAFEGS5KBP5ZXDHCYTMDFWBZ","download_json":"https://pith.science/pith/A3TAFEGS5KBP5ZXDHCYTMDFWBZ.json","view_paper":"https://pith.science/paper/A3TAFEGS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.24264&json=true","fetch_graph":"https://pith.science/api/pith-number/A3TAFEGS5KBP5ZXDHCYTMDFWBZ/graph.json","fetch_events":"https://pith.science/api/pith-number/A3TAFEGS5KBP5ZXDHCYTMDFWBZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A3TAFEGS5KBP5ZXDHCYTMDFWBZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A3TAFEGS5KBP5ZXDHCYTMDFWBZ/action/storage_attestation","attest_author":"https://pith.science/pith/A3TAFEGS5KBP5ZXDHCYTMDFWBZ/action/author_attestation","sign_citation":"https://pith.science/pith/A3TAFEGS5KBP5ZXDHCYTMDFWBZ/action/citation_signature","submit_replication":"https://pith.science/pith/A3TAFEGS5KBP5ZXDHCYTMDFWBZ/action/replication_record"}},"created_at":"2026-07-05T11:12:45.474415+00:00","updated_at":"2026-07-05T11:12:45.474415+00:00"}