{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LHK67XGOUVVYDHS7JRQW7ZLPMC","short_pith_number":"pith:LHK67XGO","schema_version":"1.0","canonical_sha256":"59d5efdccea56b819e5f4c616fe56f60a21a41bb5cb78b57c95ed0b4e9ee340f","source":{"kind":"arxiv","id":"2505.23881","version":1},"attestation_state":"computed","paper":{"title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","math.CO"],"primary_cat":"cs.AI","authors_text":"Christopher D. Rosin","submitted_at":"2025-05-29T17:45:50Z","abstract_excerpt":"Large Language Models (LLMs) with reasoning are trained to iteratively generate and refine their answers before finalizing them, which can help with applications to mathematics and code generation. We apply code generation with reasoning LLMs to a specific task in the mathematical field of combinatorial design. This field studies diverse types of combinatorial designs, many of which have lists of open instances for which existence has not yet been determined. The Constructive Protocol CPro1 uses LLMs to generate search heuristics that have the potential to construct solutions to small open ins"},"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.23881","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-05-29T17:45:50Z","cross_cats_sorted":["cs.CL","math.CO"],"title_canon_sha256":"8f3fec810fd83f7c198dd896eb4b446bdc6441a93f7fcfdb8bcc9b14552e6dfd","abstract_canon_sha256":"cfa645dbeb24c1ee01a329ceb9ce315c92121b08abbbf8cb3ac30c72634f4e3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:12:37.239042Z","signature_b64":"opblsKCJX5Bl08m5ui3jL+hCvtdnd8dwSuoRX63gU5cwymCeIQhoiTIxmbXdghNPADNSpFGQd5W35D5sHxaiDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59d5efdccea56b819e5f4c616fe56f60a21a41bb5cb78b57c95ed0b4e9ee340f","last_reissued_at":"2026-07-05T11:12:37.238531Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:12:37.238531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","math.CO"],"primary_cat":"cs.AI","authors_text":"Christopher D. Rosin","submitted_at":"2025-05-29T17:45:50Z","abstract_excerpt":"Large Language Models (LLMs) with reasoning are trained to iteratively generate and refine their answers before finalizing them, which can help with applications to mathematics and code generation. We apply code generation with reasoning LLMs to a specific task in the mathematical field of combinatorial design. This field studies diverse types of combinatorial designs, many of which have lists of open instances for which existence has not yet been determined. The Constructive Protocol CPro1 uses LLMs to generate search heuristics that have the potential to construct solutions to small open ins"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.23881","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.23881/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.23881","created_at":"2026-07-05T11:12:37.238591+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.23881v1","created_at":"2026-07-05T11:12:37.238591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.23881","created_at":"2026-07-05T11:12:37.238591+00:00"},{"alias_kind":"pith_short_12","alias_value":"LHK67XGOUVVY","created_at":"2026-07-05T11:12:37.238591+00:00"},{"alias_kind":"pith_short_16","alias_value":"LHK67XGOUVVYDHS7","created_at":"2026-07-05T11:12:37.238591+00:00"},{"alias_kind":"pith_short_8","alias_value":"LHK67XGO","created_at":"2026-07-05T11:12:37.238591+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.08424","citing_title":"Constructions of Covering Sequences and Arrays","ref_index":44,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LHK67XGOUVVYDHS7JRQW7ZLPMC","json":"https://pith.science/pith/LHK67XGOUVVYDHS7JRQW7ZLPMC.json","graph_json":"https://pith.science/api/pith-number/LHK67XGOUVVYDHS7JRQW7ZLPMC/graph.json","events_json":"https://pith.science/api/pith-number/LHK67XGOUVVYDHS7JRQW7ZLPMC/events.json","paper":"https://pith.science/paper/LHK67XGO"},"agent_actions":{"view_html":"https://pith.science/pith/LHK67XGOUVVYDHS7JRQW7ZLPMC","download_json":"https://pith.science/pith/LHK67XGOUVVYDHS7JRQW7ZLPMC.json","view_paper":"https://pith.science/paper/LHK67XGO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.23881&json=true","fetch_graph":"https://pith.science/api/pith-number/LHK67XGOUVVYDHS7JRQW7ZLPMC/graph.json","fetch_events":"https://pith.science/api/pith-number/LHK67XGOUVVYDHS7JRQW7ZLPMC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LHK67XGOUVVYDHS7JRQW7ZLPMC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LHK67XGOUVVYDHS7JRQW7ZLPMC/action/storage_attestation","attest_author":"https://pith.science/pith/LHK67XGOUVVYDHS7JRQW7ZLPMC/action/author_attestation","sign_citation":"https://pith.science/pith/LHK67XGOUVVYDHS7JRQW7ZLPMC/action/citation_signature","submit_replication":"https://pith.science/pith/LHK67XGOUVVYDHS7JRQW7ZLPMC/action/replication_record"}},"created_at":"2026-07-05T11:12:37.238591+00:00","updated_at":"2026-07-05T11:12:37.238591+00:00"}