{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SNHQM6PNQWZVCN6GI3MYM45U4F","short_pith_number":"pith:SNHQM6PN","canonical_record":{"source":{"id":"2608.07040","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-08-07T09:50:52Z","cross_cats_sorted":[],"title_canon_sha256":"3de6d03005250f7ab2a7b742f206c8bda1d50876fc337783f47476e6e5e0148d","abstract_canon_sha256":"6a96125e58d9c963c1dd8cdb6830e822ef1f77041f063b779d10a68790c5a3be"},"schema_version":"1.0"},"canonical_sha256":"934f0679ed85b35137c646d98673b4e145ebeb4db6f9945a14ea1818b1e8b37d","source":{"kind":"arxiv","id":"2608.07040","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.07040","created_at":"2026-08-10T01:12:57Z"},{"alias_kind":"arxiv_version","alias_value":"2608.07040v1","created_at":"2026-08-10T01:12:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.07040","created_at":"2026-08-10T01:12:57Z"},{"alias_kind":"pith_short_12","alias_value":"SNHQM6PNQWZV","created_at":"2026-08-10T01:12:57Z"},{"alias_kind":"pith_short_16","alias_value":"SNHQM6PNQWZVCN6G","created_at":"2026-08-10T01:12:57Z"},{"alias_kind":"pith_short_8","alias_value":"SNHQM6PN","created_at":"2026-08-10T01:12:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SNHQM6PNQWZVCN6GI3MYM45U4F","target":"record","payload":{"canonical_record":{"source":{"id":"2608.07040","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-08-07T09:50:52Z","cross_cats_sorted":[],"title_canon_sha256":"3de6d03005250f7ab2a7b742f206c8bda1d50876fc337783f47476e6e5e0148d","abstract_canon_sha256":"6a96125e58d9c963c1dd8cdb6830e822ef1f77041f063b779d10a68790c5a3be"},"schema_version":"1.0"},"canonical_sha256":"934f0679ed85b35137c646d98673b4e145ebeb4db6f9945a14ea1818b1e8b37d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-10T01:12:57.491032Z","signature_b64":"TkQsjaKuwbAwLpbCu+9ca+Jqasn+ViH3LMAF87IymuLIIuBDazydQDv+9duRvm8FKVRVfVJwlZrELRYUOaTTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"934f0679ed85b35137c646d98673b4e145ebeb4db6f9945a14ea1818b1e8b37d","last_reissued_at":"2026-08-10T01:12:57.488124Z","signature_status":"signed_v1","first_computed_at":"2026-08-10T01:12:57.488124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.07040","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-10T01:12:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ouJkSUPWWbHkPWaP5ue58zVwYm0UQK9dMZQLKqoeRRZcaxSedNUr9nxK8YzLyGbeERLyWWN7PXyjD2K85Sz+Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T14:23:04.893615Z"},"content_sha256":"e22898d7e59928900dd30237a38c7042fd3e8af5fe2274ab942cbcf72ff84a69","schema_version":"1.0","event_id":"sha256:e22898d7e59928900dd30237a38c7042fd3e8af5fe2274ab942cbcf72ff84a69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SNHQM6PNQWZVCN6GI3MYM45U4F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Not All Problems Are Best Modeled as MILP: A DSL-Centric Framework for Flexible and Accurate Optimization Modeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Hongyuan Su, Ke Tang, Qingwen Peng, Shaofeng Zhang, Shengcai Liu, Yong Li, Zefang Zong","submitted_at":"2026-08-07T09:50:52Z","abstract_excerpt":"Solving combinatorial optimization problems (COPs) requires not only efficient algorithms but also carefully crafted formulations. While recent works have leveraged LLMs to automate optimization modeling, current frameworks predominantly rely on a rigid mixed-integer linear programming (MILP) paradigm. In this paper, we argue that not all problems are best modeled as MILP, as forcing complex domains into linear constraints can induce prohibitive modeling complexity and severely restrict solver flexibility. To address this, we propose OptiDSL, a framework that shifts the focus from rigid MILP f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.07040","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/2608.07040/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-10T01:12:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TAKLA7V4e4UlLTJQeOYnFB3JvqNcE20E7U12mN9kp7Xzum97do3/mlG423uamWQTKMsrrv9wk+q0iSDoTePmDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T14:23:04.894174Z"},"content_sha256":"555ba7c211dcac515f6b3f10c7b472f46eac7cd51ccf398443d9975a0a296521","schema_version":"1.0","event_id":"sha256:555ba7c211dcac515f6b3f10c7b472f46eac7cd51ccf398443d9975a0a296521"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SNHQM6PNQWZVCN6GI3MYM45U4F/bundle.json","state_url":"https://pith.science/pith/SNHQM6PNQWZVCN6GI3MYM45U4F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SNHQM6PNQWZVCN6GI3MYM45U4F/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-22T14:23:04Z","links":{"resolver":"https://pith.science/pith/SNHQM6PNQWZVCN6GI3MYM45U4F","bundle":"https://pith.science/pith/SNHQM6PNQWZVCN6GI3MYM45U4F/bundle.json","state":"https://pith.science/pith/SNHQM6PNQWZVCN6GI3MYM45U4F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SNHQM6PNQWZVCN6GI3MYM45U4F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SNHQM6PNQWZVCN6GI3MYM45U4F","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6a96125e58d9c963c1dd8cdb6830e822ef1f77041f063b779d10a68790c5a3be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-08-07T09:50:52Z","title_canon_sha256":"3de6d03005250f7ab2a7b742f206c8bda1d50876fc337783f47476e6e5e0148d"},"schema_version":"1.0","source":{"id":"2608.07040","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.07040","created_at":"2026-08-10T01:12:57Z"},{"alias_kind":"arxiv_version","alias_value":"2608.07040v1","created_at":"2026-08-10T01:12:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.07040","created_at":"2026-08-10T01:12:57Z"},{"alias_kind":"pith_short_12","alias_value":"SNHQM6PNQWZV","created_at":"2026-08-10T01:12:57Z"},{"alias_kind":"pith_short_16","alias_value":"SNHQM6PNQWZVCN6G","created_at":"2026-08-10T01:12:57Z"},{"alias_kind":"pith_short_8","alias_value":"SNHQM6PN","created_at":"2026-08-10T01:12:57Z"}],"graph_snapshots":[{"event_id":"sha256:555ba7c211dcac515f6b3f10c7b472f46eac7cd51ccf398443d9975a0a296521","target":"graph","created_at":"2026-08-10T01:12:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.07040/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Solving combinatorial optimization problems (COPs) requires not only efficient algorithms but also carefully crafted formulations. While recent works have leveraged LLMs to automate optimization modeling, current frameworks predominantly rely on a rigid mixed-integer linear programming (MILP) paradigm. In this paper, we argue that not all problems are best modeled as MILP, as forcing complex domains into linear constraints can induce prohibitive modeling complexity and severely restrict solver flexibility. To address this, we propose OptiDSL, a framework that shifts the focus from rigid MILP f","authors_text":"Hongyuan Su, Ke Tang, Qingwen Peng, Shaofeng Zhang, Shengcai Liu, Yong Li, Zefang Zong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-08-07T09:50:52Z","title":"Not All Problems Are Best Modeled as MILP: A DSL-Centric Framework for Flexible and Accurate Optimization Modeling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.07040","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e22898d7e59928900dd30237a38c7042fd3e8af5fe2274ab942cbcf72ff84a69","target":"record","created_at":"2026-08-10T01:12:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6a96125e58d9c963c1dd8cdb6830e822ef1f77041f063b779d10a68790c5a3be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-08-07T09:50:52Z","title_canon_sha256":"3de6d03005250f7ab2a7b742f206c8bda1d50876fc337783f47476e6e5e0148d"},"schema_version":"1.0","source":{"id":"2608.07040","kind":"arxiv","version":1}},"canonical_sha256":"934f0679ed85b35137c646d98673b4e145ebeb4db6f9945a14ea1818b1e8b37d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"934f0679ed85b35137c646d98673b4e145ebeb4db6f9945a14ea1818b1e8b37d","first_computed_at":"2026-08-10T01:12:57.488124Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-10T01:12:57.488124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TkQsjaKuwbAwLpbCu+9ca+Jqasn+ViH3LMAF87IymuLIIuBDazydQDv+9duRvm8FKVRVfVJwlZrELRYUOaTTDg==","signature_status":"signed_v1","signed_at":"2026-08-10T01:12:57.491032Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.07040","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e22898d7e59928900dd30237a38c7042fd3e8af5fe2274ab942cbcf72ff84a69","sha256:555ba7c211dcac515f6b3f10c7b472f46eac7cd51ccf398443d9975a0a296521"],"state_sha256":"24683a7ba734a4cdc0edbe3273e263b4a6e562e8b9be265599d4417600f9eda4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5MHSCqKcfhB3c7HE9hdQlqlqznpCxZ3JYOV5fO0WmzZf3dSSxK/34D79Pwa/2FVlIjsa2PiiQ62XZSb7UXO9Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T14:23:04.898120Z","bundle_sha256":"46746c0c53e77440f86ecf80c34a56c2fe150ed60ffcba7301606310b10eac6a"}}