{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QABMATC5BOHICQLXXRTVWTHWE6","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":"fc794b4769340b3afeb2cbdf6153d235b32b69e769ca0657159a40b18aee665b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-01T16:49:21Z","title_canon_sha256":"551388bd85cf84ccac064df6eb486e26aa58c0a9788e4bc16a30e245eb3d49e0"},"schema_version":"1.0","source":{"id":"1501.00288","kind":"arxiv","version":15}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00288","created_at":"2026-05-18T01:01:52Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00288v15","created_at":"2026-05-18T01:01:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00288","created_at":"2026-05-18T01:01:52Z"},{"alias_kind":"pith_short_12","alias_value":"QABMATC5BOHI","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QABMATC5BOHICQLX","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QABMATC5","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:67be5c8749cd91984c9be97194f38b2d6200074d2d6d9c68a0852cba8704d2a0","target":"graph","created_at":"2026-05-18T01:01:52Z","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"},"paper":{"abstract_excerpt":"We present a class of linear programming approximations for constrained optimization problems. In the case of mixed-integer polynomial optimization problems, if the intersection graph of the constraints has bounded tree-width our construction yields a class of linear size formulations that attain any desired tolerance. As a result, we obtain an approximation scheme for the \"AC-OPF\" problem on graphs with bounded tree-width. We also describe a more general construction for pure binary optimization problems where individual constraints are available through a membership oracle; if the intersecti","authors_text":"Daniel Bienstock, Gonzalo Munoz","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-01T16:49:21Z","title":"LP approximations to mixed-integer polynomial optimization problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00288","kind":"arxiv","version":15},"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:792f26de921e693bb258da2a130eac90fc14561f3a913043364de25459913c65","target":"record","created_at":"2026-05-18T01:01:52Z","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":"fc794b4769340b3afeb2cbdf6153d235b32b69e769ca0657159a40b18aee665b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-01T16:49:21Z","title_canon_sha256":"551388bd85cf84ccac064df6eb486e26aa58c0a9788e4bc16a30e245eb3d49e0"},"schema_version":"1.0","source":{"id":"1501.00288","kind":"arxiv","version":15}},"canonical_sha256":"8002c04c5d0b8e814177bc675b4cf627a28aca11ae2fd19bca6b6dcc3b3e0e00","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8002c04c5d0b8e814177bc675b4cf627a28aca11ae2fd19bca6b6dcc3b3e0e00","first_computed_at":"2026-05-18T01:01:52.466189Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:52.466189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cWEKBnIzEHhbAtSiQMuJUr26WzAugarwOn0t7Qb8PpGSn3XRsiJ3pw6cLCdXEP1tpV0r0OVhh1C5YkHwg4VjAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:52.466806Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.00288","source_kind":"arxiv","source_version":15}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:792f26de921e693bb258da2a130eac90fc14561f3a913043364de25459913c65","sha256:67be5c8749cd91984c9be97194f38b2d6200074d2d6d9c68a0852cba8704d2a0"],"state_sha256":"f636d8c4643a993e371ad5ac1c8dcee3e56c1ed8e69811a66b7e671ef366c261"}