{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:I6QJUQW333NQPTHUVDAOMJ2QSU","short_pith_number":"pith:I6QJUQW3","schema_version":"1.0","canonical_sha256":"47a09a42dbdedb07ccf4a8c0e627509514eeaf446bf3ef52e9317792436b8e42","source":{"kind":"arxiv","id":"2502.17840","version":1},"attestation_state":"computed","paper":{"title":"A Combinatorial Identities Benchmark for Theorem Proving via Automated Theorem Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Beibei Xiong, Hangyu Lv, Haojia Shan, Jianlin Wang, Lihong Zhi, Zhengfeng Yang","submitted_at":"2025-02-25T04:41:49Z","abstract_excerpt":"Large language models (LLMs) have significantly advanced formal theorem proving, yet the scarcity of high-quality training data constrains their capabilities in complex mathematical domains. Combinatorics, a cornerstone of mathematics, provides essential tools for analyzing discrete structures and solving optimization problems. However, its inherent complexity makes it particularly challenging for automated theorem proving (ATP) for combinatorial identities. To address this, we manually construct LeanComb, combinatorial identities benchmark in Lean, which is, to our knowledge, the first formal"},"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.17840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-02-25T04:41:49Z","cross_cats_sorted":[],"title_canon_sha256":"152131417da08c6ab4e638690b02cdaf76f31b1bd00cf2b4a5ba17f2f65b750d","abstract_canon_sha256":"51e5b19ce0070658f3f8ce958908e3e51fedeadcb232ec2ff2a920c8e2b81ba9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:19:44.856832Z","signature_b64":"RnbPyJCJI6TpKdWQCt2L7CXPuAiVR3cYDdECEXjovJbTZ+/wmxrOi3awqWBes30eYF0uwkWERCqqDEJHlAtCCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47a09a42dbdedb07ccf4a8c0e627509514eeaf446bf3ef52e9317792436b8e42","last_reissued_at":"2026-07-05T10:19:44.856497Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:19:44.856497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Combinatorial Identities Benchmark for Theorem Proving via Automated Theorem Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Beibei Xiong, Hangyu Lv, Haojia Shan, Jianlin Wang, Lihong Zhi, Zhengfeng Yang","submitted_at":"2025-02-25T04:41:49Z","abstract_excerpt":"Large language models (LLMs) have significantly advanced formal theorem proving, yet the scarcity of high-quality training data constrains their capabilities in complex mathematical domains. Combinatorics, a cornerstone of mathematics, provides essential tools for analyzing discrete structures and solving optimization problems. However, its inherent complexity makes it particularly challenging for automated theorem proving (ATP) for combinatorial identities. To address this, we manually construct LeanComb, combinatorial identities benchmark in Lean, which is, to our knowledge, the first formal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.17840","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.17840/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.17840","created_at":"2026-07-05T10:19:44.856553+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.17840v1","created_at":"2026-07-05T10:19:44.856553+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.17840","created_at":"2026-07-05T10:19:44.856553+00:00"},{"alias_kind":"pith_short_12","alias_value":"I6QJUQW333NQ","created_at":"2026-07-05T10:19:44.856553+00:00"},{"alias_kind":"pith_short_16","alias_value":"I6QJUQW333NQPTHU","created_at":"2026-07-05T10:19:44.856553+00:00"},{"alias_kind":"pith_short_8","alias_value":"I6QJUQW3","created_at":"2026-07-05T10:19:44.856553+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.03171","citing_title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I6QJUQW333NQPTHUVDAOMJ2QSU","json":"https://pith.science/pith/I6QJUQW333NQPTHUVDAOMJ2QSU.json","graph_json":"https://pith.science/api/pith-number/I6QJUQW333NQPTHUVDAOMJ2QSU/graph.json","events_json":"https://pith.science/api/pith-number/I6QJUQW333NQPTHUVDAOMJ2QSU/events.json","paper":"https://pith.science/paper/I6QJUQW3"},"agent_actions":{"view_html":"https://pith.science/pith/I6QJUQW333NQPTHUVDAOMJ2QSU","download_json":"https://pith.science/pith/I6QJUQW333NQPTHUVDAOMJ2QSU.json","view_paper":"https://pith.science/paper/I6QJUQW3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.17840&json=true","fetch_graph":"https://pith.science/api/pith-number/I6QJUQW333NQPTHUVDAOMJ2QSU/graph.json","fetch_events":"https://pith.science/api/pith-number/I6QJUQW333NQPTHUVDAOMJ2QSU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I6QJUQW333NQPTHUVDAOMJ2QSU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I6QJUQW333NQPTHUVDAOMJ2QSU/action/storage_attestation","attest_author":"https://pith.science/pith/I6QJUQW333NQPTHUVDAOMJ2QSU/action/author_attestation","sign_citation":"https://pith.science/pith/I6QJUQW333NQPTHUVDAOMJ2QSU/action/citation_signature","submit_replication":"https://pith.science/pith/I6QJUQW333NQPTHUVDAOMJ2QSU/action/replication_record"}},"created_at":"2026-07-05T10:19:44.856553+00:00","updated_at":"2026-07-05T10:19:44.856553+00:00"}