{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SIOEWKJ2EINOATP6YW6N5TAXWF","short_pith_number":"pith:SIOEWKJ2","schema_version":"1.0","canonical_sha256":"921c4b293a221ae04dfec5bcdecc17b15adef4f936017b9f27de3cd6c4afe642","source":{"kind":"arxiv","id":"1510.01791","version":1},"attestation_state":"computed","paper":{"title":"A Novel MINLP Reformulation for Nonlinear Generalized Disjunctive Programming (GDP) Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anshul Agarwal","submitted_at":"2015-10-07T00:31:13Z","abstract_excerpt":"In optimization problems, often equations and inequalities are represented using if-else (implication) construct which is known to be equivalent to a disjunction. Such statements are modeled and incorporated in an optimization problem using Generalized Disjunctive Programming (GDP). GDP provides a systematic methodology to model optimization problems involving logic disjunctions, logic propositions, and algebraic equations. In order to take advantage of the existing MINLP solvers, GDP problems can be reformulated as the standard MINLP problems. In this work we propose a novel reformulation met"},"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":"1510.01791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-07T00:31:13Z","cross_cats_sorted":[],"title_canon_sha256":"f83c9dc868321801e0ed8add11430e460897f5ce146b2af4d08be5f5ca5f0bc3","abstract_canon_sha256":"2d0ed7f2d8d63d50ec081f2b40641d4a157d88b642693d31fdded8a4b540fe16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:50.372450Z","signature_b64":"SidlmMVFOv7Id6PlpZzEMLc+Ve2TMC5DBaBNyADcYPnBxAcWu/glvGYMXVwilgt4vk2XVfN5U6UxLYWewlNaAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"921c4b293a221ae04dfec5bcdecc17b15adef4f936017b9f27de3cd6c4afe642","last_reissued_at":"2026-05-18T01:30:50.371994Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:50.371994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Novel MINLP Reformulation for Nonlinear Generalized Disjunctive Programming (GDP) Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anshul Agarwal","submitted_at":"2015-10-07T00:31:13Z","abstract_excerpt":"In optimization problems, often equations and inequalities are represented using if-else (implication) construct which is known to be equivalent to a disjunction. Such statements are modeled and incorporated in an optimization problem using Generalized Disjunctive Programming (GDP). GDP provides a systematic methodology to model optimization problems involving logic disjunctions, logic propositions, and algebraic equations. In order to take advantage of the existing MINLP solvers, GDP problems can be reformulated as the standard MINLP problems. In this work we propose a novel reformulation met"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.01791","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":""},"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":"1510.01791","created_at":"2026-05-18T01:30:50.372060+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.01791v1","created_at":"2026-05-18T01:30:50.372060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01791","created_at":"2026-05-18T01:30:50.372060+00:00"},{"alias_kind":"pith_short_12","alias_value":"SIOEWKJ2EINO","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SIOEWKJ2EINOATP6","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SIOEWKJ2","created_at":"2026-05-18T12:29:42.218222+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/SIOEWKJ2EINOATP6YW6N5TAXWF","json":"https://pith.science/pith/SIOEWKJ2EINOATP6YW6N5TAXWF.json","graph_json":"https://pith.science/api/pith-number/SIOEWKJ2EINOATP6YW6N5TAXWF/graph.json","events_json":"https://pith.science/api/pith-number/SIOEWKJ2EINOATP6YW6N5TAXWF/events.json","paper":"https://pith.science/paper/SIOEWKJ2"},"agent_actions":{"view_html":"https://pith.science/pith/SIOEWKJ2EINOATP6YW6N5TAXWF","download_json":"https://pith.science/pith/SIOEWKJ2EINOATP6YW6N5TAXWF.json","view_paper":"https://pith.science/paper/SIOEWKJ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.01791&json=true","fetch_graph":"https://pith.science/api/pith-number/SIOEWKJ2EINOATP6YW6N5TAXWF/graph.json","fetch_events":"https://pith.science/api/pith-number/SIOEWKJ2EINOATP6YW6N5TAXWF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SIOEWKJ2EINOATP6YW6N5TAXWF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SIOEWKJ2EINOATP6YW6N5TAXWF/action/storage_attestation","attest_author":"https://pith.science/pith/SIOEWKJ2EINOATP6YW6N5TAXWF/action/author_attestation","sign_citation":"https://pith.science/pith/SIOEWKJ2EINOATP6YW6N5TAXWF/action/citation_signature","submit_replication":"https://pith.science/pith/SIOEWKJ2EINOATP6YW6N5TAXWF/action/replication_record"}},"created_at":"2026-05-18T01:30:50.372060+00:00","updated_at":"2026-05-18T01:30:50.372060+00:00"}