{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:R6XNLPLMXDS2RNHG5CDHBADDXS","short_pith_number":"pith:R6XNLPLM","schema_version":"1.0","canonical_sha256":"8faed5bd6cb8e5a8b4e6e886708063bc8aeddb9bb25476e0308415dbdcc0758b","source":{"kind":"arxiv","id":"2302.09350","version":1},"attestation_state":"computed","paper":{"title":"BERT is not The Count: Learning to Match Mathematical Statements with Proofs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Maximin Coavoux, Shay B. Cohen, Weixian Waylon Li, Yftah Ziser","submitted_at":"2023-02-18T14:48:20Z","abstract_excerpt":"We introduce a task consisting in matching a proof to a given mathematical statement. The task fits well within current research on Mathematical Information Retrieval and, more generally, mathematical article analysis (Mathematical Sciences, 2014). We present a dataset for the task (the MATcH dataset) consisting of over 180k statement-proof pairs extracted from modern mathematical research articles. We find this dataset highly representative of our task, as it consists of relatively new findings useful to mathematicians. We propose a bilinear similarity model and two decoding methods to match "},"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":"2302.09350","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-02-18T14:48:20Z","cross_cats_sorted":[],"title_canon_sha256":"4c20aa069d44fa0d59b23fe89f382442112b31bac827a7fb64db552981db4b2f","abstract_canon_sha256":"d5bc6e33c011367064f8ff4e435aeb8021e91c79bfa3d85bbb5c237358e2b1de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:43:24.755868Z","signature_b64":"yZ36TCuqvJq2H+WGKxPdXsALjpofyHGW+ou7PDagHK/cTt4CUQSUV50oqcisjzrj6g+JGnABiHhY9INT5LCBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8faed5bd6cb8e5a8b4e6e886708063bc8aeddb9bb25476e0308415dbdcc0758b","last_reissued_at":"2026-07-05T05:43:24.755438Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:43:24.755438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BERT is not The Count: Learning to Match Mathematical Statements with Proofs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Maximin Coavoux, Shay B. Cohen, Weixian Waylon Li, Yftah Ziser","submitted_at":"2023-02-18T14:48:20Z","abstract_excerpt":"We introduce a task consisting in matching a proof to a given mathematical statement. The task fits well within current research on Mathematical Information Retrieval and, more generally, mathematical article analysis (Mathematical Sciences, 2014). We present a dataset for the task (the MATcH dataset) consisting of over 180k statement-proof pairs extracted from modern mathematical research articles. We find this dataset highly representative of our task, as it consists of relatively new findings useful to mathematicians. We propose a bilinear similarity model and two decoding methods to match "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.09350","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/2302.09350/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":"2302.09350","created_at":"2026-07-05T05:43:24.755485+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.09350v1","created_at":"2026-07-05T05:43:24.755485+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.09350","created_at":"2026-07-05T05:43:24.755485+00:00"},{"alias_kind":"pith_short_12","alias_value":"R6XNLPLMXDS2","created_at":"2026-07-05T05:43:24.755485+00:00"},{"alias_kind":"pith_short_16","alias_value":"R6XNLPLMXDS2RNHG","created_at":"2026-07-05T05:43:24.755485+00:00"},{"alias_kind":"pith_short_8","alias_value":"R6XNLPLM","created_at":"2026-07-05T05:43:24.755485+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.16207","citing_title":"From Informal to Formal -- Incorporating and Evaluating LLMs on Natural Language Requirements to Verifiable Formal Proofs","ref_index":2016,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R6XNLPLMXDS2RNHG5CDHBADDXS","json":"https://pith.science/pith/R6XNLPLMXDS2RNHG5CDHBADDXS.json","graph_json":"https://pith.science/api/pith-number/R6XNLPLMXDS2RNHG5CDHBADDXS/graph.json","events_json":"https://pith.science/api/pith-number/R6XNLPLMXDS2RNHG5CDHBADDXS/events.json","paper":"https://pith.science/paper/R6XNLPLM"},"agent_actions":{"view_html":"https://pith.science/pith/R6XNLPLMXDS2RNHG5CDHBADDXS","download_json":"https://pith.science/pith/R6XNLPLMXDS2RNHG5CDHBADDXS.json","view_paper":"https://pith.science/paper/R6XNLPLM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.09350&json=true","fetch_graph":"https://pith.science/api/pith-number/R6XNLPLMXDS2RNHG5CDHBADDXS/graph.json","fetch_events":"https://pith.science/api/pith-number/R6XNLPLMXDS2RNHG5CDHBADDXS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R6XNLPLMXDS2RNHG5CDHBADDXS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R6XNLPLMXDS2RNHG5CDHBADDXS/action/storage_attestation","attest_author":"https://pith.science/pith/R6XNLPLMXDS2RNHG5CDHBADDXS/action/author_attestation","sign_citation":"https://pith.science/pith/R6XNLPLMXDS2RNHG5CDHBADDXS/action/citation_signature","submit_replication":"https://pith.science/pith/R6XNLPLMXDS2RNHG5CDHBADDXS/action/replication_record"}},"created_at":"2026-07-05T05:43:24.755485+00:00","updated_at":"2026-07-05T05:43:24.755485+00:00"}