{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PWPQAY2KGSYX2LSQGGWPAT2MRD","short_pith_number":"pith:PWPQAY2K","schema_version":"1.0","canonical_sha256":"7d9f00634a34b17d2e5031acf04f4c88d00362163430b314e745ba75245055d6","source":{"kind":"arxiv","id":"2501.17725","version":1},"attestation_state":"computed","paper":{"title":"Using Code Generation to Solve Open Instances of Combinatorial Design Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.DM","math.CO"],"primary_cat":"cs.AI","authors_text":"Christopher D. Rosin","submitted_at":"2025-01-29T15:57:43Z","abstract_excerpt":"The Handbook of Combinatorial Designs catalogs many types of combinatorial designs, together with lists of open instances for which existence has not yet been determined. We develop a constructive protocol CPro1, which uses Large Language Models (LLMs) to generate code that constructs combinatorial designs and resolves some of these open instances. The protocol starts from a definition of a particular type of design, and a verifier that reliably confirms whether a proposed design is valid. The LLM selects strategies and implements them in code, and scaffolding provides automated hyperparameter"},"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":"2501.17725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-01-29T15:57:43Z","cross_cats_sorted":["cs.CL","cs.DM","math.CO"],"title_canon_sha256":"7ed18b2bc52a545816ba3b6d9d180a8a3d9df6b2b0cdea95111222811af107dc","abstract_canon_sha256":"5614b7b0b1655185cc041ef960da031ddd11de5910cb951621fd70cc981a3e78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:06:57.012334Z","signature_b64":"VtelnVF3QG0TJx4Op0cj21CFba0ILhKHDTBIU1xW88HpBDw8waGTwaOLWEvBEmSY4EdvdsryOcpiRsgq6Qe1BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d9f00634a34b17d2e5031acf04f4c88d00362163430b314e745ba75245055d6","last_reissued_at":"2026-07-05T10:06:57.011855Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:06:57.011855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using Code Generation to Solve Open Instances of Combinatorial Design Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.DM","math.CO"],"primary_cat":"cs.AI","authors_text":"Christopher D. Rosin","submitted_at":"2025-01-29T15:57:43Z","abstract_excerpt":"The Handbook of Combinatorial Designs catalogs many types of combinatorial designs, together with lists of open instances for which existence has not yet been determined. We develop a constructive protocol CPro1, which uses Large Language Models (LLMs) to generate code that constructs combinatorial designs and resolves some of these open instances. The protocol starts from a definition of a particular type of design, and a verifier that reliably confirms whether a proposed design is valid. The LLM selects strategies and implements them in code, and scaffolding provides automated hyperparameter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.17725","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/2501.17725/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":"2501.17725","created_at":"2026-07-05T10:06:57.011909+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.17725v1","created_at":"2026-07-05T10:06:57.011909+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.17725","created_at":"2026-07-05T10:06:57.011909+00:00"},{"alias_kind":"pith_short_12","alias_value":"PWPQAY2KGSYX","created_at":"2026-07-05T10:06:57.011909+00:00"},{"alias_kind":"pith_short_16","alias_value":"PWPQAY2KGSYX2LSQ","created_at":"2026-07-05T10:06:57.011909+00:00"},{"alias_kind":"pith_short_8","alias_value":"PWPQAY2K","created_at":"2026-07-05T10:06:57.011909+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PWPQAY2KGSYX2LSQGGWPAT2MRD","json":"https://pith.science/pith/PWPQAY2KGSYX2LSQGGWPAT2MRD.json","graph_json":"https://pith.science/api/pith-number/PWPQAY2KGSYX2LSQGGWPAT2MRD/graph.json","events_json":"https://pith.science/api/pith-number/PWPQAY2KGSYX2LSQGGWPAT2MRD/events.json","paper":"https://pith.science/paper/PWPQAY2K"},"agent_actions":{"view_html":"https://pith.science/pith/PWPQAY2KGSYX2LSQGGWPAT2MRD","download_json":"https://pith.science/pith/PWPQAY2KGSYX2LSQGGWPAT2MRD.json","view_paper":"https://pith.science/paper/PWPQAY2K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.17725&json=true","fetch_graph":"https://pith.science/api/pith-number/PWPQAY2KGSYX2LSQGGWPAT2MRD/graph.json","fetch_events":"https://pith.science/api/pith-number/PWPQAY2KGSYX2LSQGGWPAT2MRD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PWPQAY2KGSYX2LSQGGWPAT2MRD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PWPQAY2KGSYX2LSQGGWPAT2MRD/action/storage_attestation","attest_author":"https://pith.science/pith/PWPQAY2KGSYX2LSQGGWPAT2MRD/action/author_attestation","sign_citation":"https://pith.science/pith/PWPQAY2KGSYX2LSQGGWPAT2MRD/action/citation_signature","submit_replication":"https://pith.science/pith/PWPQAY2KGSYX2LSQGGWPAT2MRD/action/replication_record"}},"created_at":"2026-07-05T10:06:57.011909+00:00","updated_at":"2026-07-05T10:06:57.011909+00:00"}