{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:CZQFAAWKUPELGF4XJENGIW34JW","short_pith_number":"pith:CZQFAAWK","schema_version":"1.0","canonical_sha256":"16605002caa3c8b31797491a645b7c4db9adceefd3998eb0a9ef38be769abc07","source":{"kind":"arxiv","id":"2310.07957","version":3},"attestation_state":"computed","paper":{"title":"A New Approach Towards Autoformalization","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Jeffrey Flanigan, Nilay Patel, Rahul Saha","submitted_at":"2023-10-12T00:50:24Z","abstract_excerpt":"Verifying mathematical proofs is difficult, but can be automated with the assistance of a computer. Autoformalization is the task of automatically translating natural language mathematics into a formal language that can be verified by a program. This is a challenging task, and especially for higher-level mathematics found in research papers. Research paper mathematics requires large amounts of background and context. In this paper, we propose an avenue towards tackling autoformalization for research-level mathematics, by breaking the task into easier and more approachable subtasks: unlinked fo"},"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":"2310.07957","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2023-10-12T00:50:24Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"0aa4af105a83991993ed9056045c767133a6fd8d225f8d2333967c5a3a03ced7","abstract_canon_sha256":"0a25adc9c13787135f46d933a61370e6d39638e4cef3cae864912166fbf1e5a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:42:00.037337Z","signature_b64":"hZ0vwRh3R43ore5Mm7/2dHsd5wteOvK5I1WxHjJ1I/8jVCmy5b3qhI1CK5TJyxa9Ue9mYf6AN0rGo2/rlaq+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16605002caa3c8b31797491a645b7c4db9adceefd3998eb0a9ef38be769abc07","last_reissued_at":"2026-07-05T08:42:00.036916Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:42:00.036916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Approach Towards Autoformalization","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Jeffrey Flanigan, Nilay Patel, Rahul Saha","submitted_at":"2023-10-12T00:50:24Z","abstract_excerpt":"Verifying mathematical proofs is difficult, but can be automated with the assistance of a computer. Autoformalization is the task of automatically translating natural language mathematics into a formal language that can be verified by a program. This is a challenging task, and especially for higher-level mathematics found in research papers. Research paper mathematics requires large amounts of background and context. In this paper, we propose an avenue towards tackling autoformalization for research-level mathematics, by breaking the task into easier and more approachable subtasks: unlinked fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.07957","kind":"arxiv","version":3},"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/2310.07957/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":"2310.07957","created_at":"2026-07-05T08:42:00.036977+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.07957v3","created_at":"2026-07-05T08:42:00.036977+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.07957","created_at":"2026-07-05T08:42:00.036977+00:00"},{"alias_kind":"pith_short_12","alias_value":"CZQFAAWKUPEL","created_at":"2026-07-05T08:42:00.036977+00:00"},{"alias_kind":"pith_short_16","alias_value":"CZQFAAWKUPELGF4X","created_at":"2026-07-05T08:42:00.036977+00:00"},{"alias_kind":"pith_short_8","alias_value":"CZQFAAWK","created_at":"2026-07-05T08:42:00.036977+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.18914","citing_title":"FormaRL: Enhancing Autoformalization with no Labeled Data","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CZQFAAWKUPELGF4XJENGIW34JW","json":"https://pith.science/pith/CZQFAAWKUPELGF4XJENGIW34JW.json","graph_json":"https://pith.science/api/pith-number/CZQFAAWKUPELGF4XJENGIW34JW/graph.json","events_json":"https://pith.science/api/pith-number/CZQFAAWKUPELGF4XJENGIW34JW/events.json","paper":"https://pith.science/paper/CZQFAAWK"},"agent_actions":{"view_html":"https://pith.science/pith/CZQFAAWKUPELGF4XJENGIW34JW","download_json":"https://pith.science/pith/CZQFAAWKUPELGF4XJENGIW34JW.json","view_paper":"https://pith.science/paper/CZQFAAWK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.07957&json=true","fetch_graph":"https://pith.science/api/pith-number/CZQFAAWKUPELGF4XJENGIW34JW/graph.json","fetch_events":"https://pith.science/api/pith-number/CZQFAAWKUPELGF4XJENGIW34JW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CZQFAAWKUPELGF4XJENGIW34JW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CZQFAAWKUPELGF4XJENGIW34JW/action/storage_attestation","attest_author":"https://pith.science/pith/CZQFAAWKUPELGF4XJENGIW34JW/action/author_attestation","sign_citation":"https://pith.science/pith/CZQFAAWKUPELGF4XJENGIW34JW/action/citation_signature","submit_replication":"https://pith.science/pith/CZQFAAWKUPELGF4XJENGIW34JW/action/replication_record"}},"created_at":"2026-07-05T08:42:00.036977+00:00","updated_at":"2026-07-05T08:42:00.036977+00:00"}