{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FOXL5QZPAOVPGJU4LU5HTDIZPE","short_pith_number":"pith:FOXL5QZP","schema_version":"1.0","canonical_sha256":"2baebec32f03aaf3269c5d3a798d19791cf94c4bea70ee11f432a176128c5f71","source":{"kind":"arxiv","id":"2503.10642","version":1},"attestation_state":"computed","paper":{"title":"Text2Zinc: A Cross-Domain Dataset for Modeling Optimization and Satisfaction Problems in MiniZinc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Akash Singirikonda, Karthik Uppuluri, Serdar Kadioglu","submitted_at":"2025-02-22T04:13:53Z","abstract_excerpt":"There is growing interest in utilizing large language models (LLMs) as co-pilots for combinatorial optimization and constraint programming tasks across various problems. This paper aims to advance this line of research by introducing Text2Zinc}, a cross-domain dataset for capturing optimization and satisfaction problems specified in natural language text. Our work is distinguished from previous attempts by integrating both satisfaction and optimization problems within a unified dataset using a solver-agnostic modeling language. To achieve this, we leverage MiniZinc's solver-and-paradigm-agnost"},"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":"2503.10642","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-02-22T04:13:53Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4880714a5d0b39c648363911426cb340d8680d00b38ebaa87c391117d9dee3b4","abstract_canon_sha256":"9eb6fffdc08b021d43f27a80f689b47ecea7fb241e7299cae18c9fbec2c46a29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:31:02.752377Z","signature_b64":"9CiRU9K1LBLK65Tb8Hw4M0Hh7inejjASow19rd80fLMTMt0GQXeclH4SXVzDOeEV2lvF1AV3PKJPVw4Uv9k8Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2baebec32f03aaf3269c5d3a798d19791cf94c4bea70ee11f432a176128c5f71","last_reissued_at":"2026-07-05T10:31:02.751380Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:31:02.751380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Text2Zinc: A Cross-Domain Dataset for Modeling Optimization and Satisfaction Problems in MiniZinc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Akash Singirikonda, Karthik Uppuluri, Serdar Kadioglu","submitted_at":"2025-02-22T04:13:53Z","abstract_excerpt":"There is growing interest in utilizing large language models (LLMs) as co-pilots for combinatorial optimization and constraint programming tasks across various problems. This paper aims to advance this line of research by introducing Text2Zinc}, a cross-domain dataset for capturing optimization and satisfaction problems specified in natural language text. Our work is distinguished from previous attempts by integrating both satisfaction and optimization problems within a unified dataset using a solver-agnostic modeling language. To achieve this, we leverage MiniZinc's solver-and-paradigm-agnost"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.10642","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/2503.10642/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":"2503.10642","created_at":"2026-07-05T10:31:02.751511+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.10642v1","created_at":"2026-07-05T10:31:02.751511+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.10642","created_at":"2026-07-05T10:31:02.751511+00:00"},{"alias_kind":"pith_short_12","alias_value":"FOXL5QZPAOVP","created_at":"2026-07-05T10:31:02.751511+00:00"},{"alias_kind":"pith_short_16","alias_value":"FOXL5QZPAOVPGJU4","created_at":"2026-07-05T10:31:02.751511+00:00"},{"alias_kind":"pith_short_8","alias_value":"FOXL5QZP","created_at":"2026-07-05T10:31:02.751511+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25832","citing_title":"MiniOpt: Reasoning to Model and Solve General Optimization Problems with Limited Resources","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2606.25832","citing_title":"MiniOpt: Reasoning to Model and Solve General Optimization Problems with Limited Resources","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20849","citing_title":"Large Language Models for Operations Research: A Comprehensive Survey","ref_index":164,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01675","citing_title":"CP-SynC: Multi-Agent Zero-Shot Constraint Modeling in MiniZinc with Synthesized Checkers","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FOXL5QZPAOVPGJU4LU5HTDIZPE","json":"https://pith.science/pith/FOXL5QZPAOVPGJU4LU5HTDIZPE.json","graph_json":"https://pith.science/api/pith-number/FOXL5QZPAOVPGJU4LU5HTDIZPE/graph.json","events_json":"https://pith.science/api/pith-number/FOXL5QZPAOVPGJU4LU5HTDIZPE/events.json","paper":"https://pith.science/paper/FOXL5QZP"},"agent_actions":{"view_html":"https://pith.science/pith/FOXL5QZPAOVPGJU4LU5HTDIZPE","download_json":"https://pith.science/pith/FOXL5QZPAOVPGJU4LU5HTDIZPE.json","view_paper":"https://pith.science/paper/FOXL5QZP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.10642&json=true","fetch_graph":"https://pith.science/api/pith-number/FOXL5QZPAOVPGJU4LU5HTDIZPE/graph.json","fetch_events":"https://pith.science/api/pith-number/FOXL5QZPAOVPGJU4LU5HTDIZPE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FOXL5QZPAOVPGJU4LU5HTDIZPE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FOXL5QZPAOVPGJU4LU5HTDIZPE/action/storage_attestation","attest_author":"https://pith.science/pith/FOXL5QZPAOVPGJU4LU5HTDIZPE/action/author_attestation","sign_citation":"https://pith.science/pith/FOXL5QZPAOVPGJU4LU5HTDIZPE/action/citation_signature","submit_replication":"https://pith.science/pith/FOXL5QZPAOVPGJU4LU5HTDIZPE/action/replication_record"}},"created_at":"2026-07-05T10:31:02.751511+00:00","updated_at":"2026-07-05T10:31:02.751511+00:00"}