{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:APLF3DWMUM3TY66REEVF3ZZKF7","short_pith_number":"pith:APLF3DWM","schema_version":"1.0","canonical_sha256":"03d65d8ecca3373c7bd1212a5de72a2fe6964fd0cad19d290f701a8ddf8a6373","source":{"kind":"arxiv","id":"2502.14760","version":2},"attestation_state":"computed","paper":{"title":"EquivaMap: Leveraging LLMs for Automatic Equivalence Checking of Optimization Formulations","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"cs.AI","authors_text":"Connor Lawless, Ellen Vitercik, Haotian Zhai, Liu Leqi","submitted_at":"2025-02-20T17:35:32Z","abstract_excerpt":"A fundamental problem in combinatorial optimization is identifying equivalent formulations. Despite the growing need for automated equivalence checks -- driven, for example, by optimization copilots, which generate problem formulations from natural language descriptions -- current approaches rely on simple heuristics that fail to reliably check formulation equivalence. Inspired by Karp reductions, in this work we introduce Quasi-Karp equivalence, a formal criterion for determining when two optimization formulations are equivalent based on the existence of a mapping between their decision varia"},"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.14760","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2025-02-20T17:35:32Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"0977286154497ca8a6a2afabacbad18f6d7b58ffbcb82c946e849eff82537ef8","abstract_canon_sha256":"13bd769019f40696accb475a4eefa6bcc3e04d6b8ad34bf0cf3fd8a0288cc409"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:19:03.798669Z","signature_b64":"ujx32ssEWX3+z1qKq3txUgWjX7SXV460M4RTkvXGbQCxDXtb4za5OoJhnVc0CE953MARVvkx0aB9onCjRTbdAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03d65d8ecca3373c7bd1212a5de72a2fe6964fd0cad19d290f701a8ddf8a6373","last_reissued_at":"2026-07-05T11:19:03.798113Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:19:03.798113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"EquivaMap: Leveraging LLMs for Automatic Equivalence Checking of Optimization Formulations","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"cs.AI","authors_text":"Connor Lawless, Ellen Vitercik, Haotian Zhai, Liu Leqi","submitted_at":"2025-02-20T17:35:32Z","abstract_excerpt":"A fundamental problem in combinatorial optimization is identifying equivalent formulations. Despite the growing need for automated equivalence checks -- driven, for example, by optimization copilots, which generate problem formulations from natural language descriptions -- current approaches rely on simple heuristics that fail to reliably check formulation equivalence. Inspired by Karp reductions, in this work we introduce Quasi-Karp equivalence, a formal criterion for determining when two optimization formulations are equivalent based on the existence of a mapping between their decision varia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.14760","kind":"arxiv","version":2},"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.14760/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.14760","created_at":"2026-07-05T11:19:03.798179+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.14760v2","created_at":"2026-07-05T11:19:03.798179+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.14760","created_at":"2026-07-05T11:19:03.798179+00:00"},{"alias_kind":"pith_short_12","alias_value":"APLF3DWMUM3T","created_at":"2026-07-05T11:19:03.798179+00:00"},{"alias_kind":"pith_short_16","alias_value":"APLF3DWMUM3TY66R","created_at":"2026-07-05T11:19:03.798179+00:00"},{"alias_kind":"pith_short_8","alias_value":"APLF3DWM","created_at":"2026-07-05T11:19:03.798179+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.02728","citing_title":"ORPilot: A Production-Oriented Agentic LLM-for-OR Tool for Optimization Modeling","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/APLF3DWMUM3TY66REEVF3ZZKF7","json":"https://pith.science/pith/APLF3DWMUM3TY66REEVF3ZZKF7.json","graph_json":"https://pith.science/api/pith-number/APLF3DWMUM3TY66REEVF3ZZKF7/graph.json","events_json":"https://pith.science/api/pith-number/APLF3DWMUM3TY66REEVF3ZZKF7/events.json","paper":"https://pith.science/paper/APLF3DWM"},"agent_actions":{"view_html":"https://pith.science/pith/APLF3DWMUM3TY66REEVF3ZZKF7","download_json":"https://pith.science/pith/APLF3DWMUM3TY66REEVF3ZZKF7.json","view_paper":"https://pith.science/paper/APLF3DWM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.14760&json=true","fetch_graph":"https://pith.science/api/pith-number/APLF3DWMUM3TY66REEVF3ZZKF7/graph.json","fetch_events":"https://pith.science/api/pith-number/APLF3DWMUM3TY66REEVF3ZZKF7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/APLF3DWMUM3TY66REEVF3ZZKF7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/APLF3DWMUM3TY66REEVF3ZZKF7/action/storage_attestation","attest_author":"https://pith.science/pith/APLF3DWMUM3TY66REEVF3ZZKF7/action/author_attestation","sign_citation":"https://pith.science/pith/APLF3DWMUM3TY66REEVF3ZZKF7/action/citation_signature","submit_replication":"https://pith.science/pith/APLF3DWMUM3TY66REEVF3ZZKF7/action/replication_record"}},"created_at":"2026-07-05T11:19:03.798179+00:00","updated_at":"2026-07-05T11:19:03.798179+00:00"}