{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:4NM73QAC4TRDV7GZNZZCIAMU2P","short_pith_number":"pith:4NM73QAC","canonical_record":{"source":{"id":"2407.06143","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-07-08T17:18:24Z","cross_cats_sorted":[],"title_canon_sha256":"813360a91b18260880173e0595e20a08c300f8e40df9f6b704465bebd6e50c5a","abstract_canon_sha256":"726e30898b9717a061f0d9f3db082143a1c660b1842ef6ae82ad564acd21bdc6"},"schema_version":"1.0"},"canonical_sha256":"e359fdc002e4e23afcd96e72240194d3dc6e9d0731ac0f96da329c5c08f0202d","source":{"kind":"arxiv","id":"2407.06143","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.06143","created_at":"2026-07-05T10:36:26Z"},{"alias_kind":"arxiv_version","alias_value":"2407.06143v2","created_at":"2026-07-05T10:36:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.06143","created_at":"2026-07-05T10:36:26Z"},{"alias_kind":"pith_short_12","alias_value":"4NM73QAC4TRD","created_at":"2026-07-05T10:36:26Z"},{"alias_kind":"pith_short_16","alias_value":"4NM73QAC4TRDV7GZ","created_at":"2026-07-05T10:36:26Z"},{"alias_kind":"pith_short_8","alias_value":"4NM73QAC","created_at":"2026-07-05T10:36:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:4NM73QAC4TRDV7GZNZZCIAMU2P","target":"record","payload":{"canonical_record":{"source":{"id":"2407.06143","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-07-08T17:18:24Z","cross_cats_sorted":[],"title_canon_sha256":"813360a91b18260880173e0595e20a08c300f8e40df9f6b704465bebd6e50c5a","abstract_canon_sha256":"726e30898b9717a061f0d9f3db082143a1c660b1842ef6ae82ad564acd21bdc6"},"schema_version":"1.0"},"canonical_sha256":"e359fdc002e4e23afcd96e72240194d3dc6e9d0731ac0f96da329c5c08f0202d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:36:26.322929Z","signature_b64":"nfyAGcdAxT9rQMzEiI22thjcvVabuAu7oiYT0yjmJBxAVAK1O+zaFZ42kgob949aXaNLO1lmS5x1LwK8Rvd+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e359fdc002e4e23afcd96e72240194d3dc6e9d0731ac0f96da329c5c08f0202d","last_reissued_at":"2026-07-05T10:36:26.322118Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:36:26.322118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2407.06143","source_version":2,"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-07-05T10:36:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nuaF1meUKN7/USzH1Ito63aiAJ8PqqRFI2JqOVNwZn+xvvaIPH3t3g67AAHcNmIamqg0Vxn4j7wFkbaTGR1eAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T00:34:07.822174Z"},"content_sha256":"e63751a3838712596cfb4b704adae3feece3571c5143393326282f0b5d461c88","schema_version":"1.0","event_id":"sha256:e63751a3838712596cfb4b704adae3feece3571c5143393326282f0b5d461c88"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:4NM73QAC4TRDV7GZNZZCIAMU2P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parabolic Approximation & Relaxation for MINLP","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adrian G\\\"o{\\ss}, Alexander Martin, Robert Burlacu","submitted_at":"2024-07-08T17:18:24Z","abstract_excerpt":"We propose an approach based on quadratic approximations for solving general Mixed-Integer Nonlinear Programming (MINLP) problems. Specifically, our approach entails the global approximation of the epigraphs of constraint functions by means of paraboloids, which are polynomials of degree two with univariate quadratic terms, and relies on a Lipschitz property only. These approximations are then integrated into the original problem. To this end, we introduce a novel approach to compute globally valid epigraph approximations by paraboloids via a Mixed-Integer Linear Programming (MIP) model. We em"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.06143","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/2407.06143/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-07-05T10:36:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mkjIbT614/4hvzz3CIy0A7LCNFnZUtvAPgSYyZdaPbZCpmIgJZf45EFJZTzWYyCGT0eIrtBRZW3blbkg2vFADQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T00:34:07.822668Z"},"content_sha256":"e24f0510e972014fc12caba2c8a260ad3a03a5a898bcb66a57ec94ca68ab5f0e","schema_version":"1.0","event_id":"sha256:e24f0510e972014fc12caba2c8a260ad3a03a5a898bcb66a57ec94ca68ab5f0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4NM73QAC4TRDV7GZNZZCIAMU2P/bundle.json","state_url":"https://pith.science/pith/4NM73QAC4TRDV7GZNZZCIAMU2P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4NM73QAC4TRDV7GZNZZCIAMU2P/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-05T00:34:07Z","links":{"resolver":"https://pith.science/pith/4NM73QAC4TRDV7GZNZZCIAMU2P","bundle":"https://pith.science/pith/4NM73QAC4TRDV7GZNZZCIAMU2P/bundle.json","state":"https://pith.science/pith/4NM73QAC4TRDV7GZNZZCIAMU2P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4NM73QAC4TRDV7GZNZZCIAMU2P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:4NM73QAC4TRDV7GZNZZCIAMU2P","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":"726e30898b9717a061f0d9f3db082143a1c660b1842ef6ae82ad564acd21bdc6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-07-08T17:18:24Z","title_canon_sha256":"813360a91b18260880173e0595e20a08c300f8e40df9f6b704465bebd6e50c5a"},"schema_version":"1.0","source":{"id":"2407.06143","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.06143","created_at":"2026-07-05T10:36:26Z"},{"alias_kind":"arxiv_version","alias_value":"2407.06143v2","created_at":"2026-07-05T10:36:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.06143","created_at":"2026-07-05T10:36:26Z"},{"alias_kind":"pith_short_12","alias_value":"4NM73QAC4TRD","created_at":"2026-07-05T10:36:26Z"},{"alias_kind":"pith_short_16","alias_value":"4NM73QAC4TRDV7GZ","created_at":"2026-07-05T10:36:26Z"},{"alias_kind":"pith_short_8","alias_value":"4NM73QAC","created_at":"2026-07-05T10:36:26Z"}],"graph_snapshots":[{"event_id":"sha256:e24f0510e972014fc12caba2c8a260ad3a03a5a898bcb66a57ec94ca68ab5f0e","target":"graph","created_at":"2026-07-05T10:36:26Z","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/2407.06143/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose an approach based on quadratic approximations for solving general Mixed-Integer Nonlinear Programming (MINLP) problems. Specifically, our approach entails the global approximation of the epigraphs of constraint functions by means of paraboloids, which are polynomials of degree two with univariate quadratic terms, and relies on a Lipschitz property only. These approximations are then integrated into the original problem. To this end, we introduce a novel approach to compute globally valid epigraph approximations by paraboloids via a Mixed-Integer Linear Programming (MIP) model. We em","authors_text":"Adrian G\\\"o{\\ss}, Alexander Martin, Robert Burlacu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-07-08T17:18:24Z","title":"Parabolic Approximation & Relaxation for MINLP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.06143","kind":"arxiv","version":2},"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:e63751a3838712596cfb4b704adae3feece3571c5143393326282f0b5d461c88","target":"record","created_at":"2026-07-05T10:36:26Z","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":"726e30898b9717a061f0d9f3db082143a1c660b1842ef6ae82ad564acd21bdc6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-07-08T17:18:24Z","title_canon_sha256":"813360a91b18260880173e0595e20a08c300f8e40df9f6b704465bebd6e50c5a"},"schema_version":"1.0","source":{"id":"2407.06143","kind":"arxiv","version":2}},"canonical_sha256":"e359fdc002e4e23afcd96e72240194d3dc6e9d0731ac0f96da329c5c08f0202d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e359fdc002e4e23afcd96e72240194d3dc6e9d0731ac0f96da329c5c08f0202d","first_computed_at":"2026-07-05T10:36:26.322118Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:36:26.322118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nfyAGcdAxT9rQMzEiI22thjcvVabuAu7oiYT0yjmJBxAVAK1O+zaFZ42kgob949aXaNLO1lmS5x1LwK8Rvd+DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:36:26.322929Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.06143","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e63751a3838712596cfb4b704adae3feece3571c5143393326282f0b5d461c88","sha256:e24f0510e972014fc12caba2c8a260ad3a03a5a898bcb66a57ec94ca68ab5f0e"],"state_sha256":"dc3f0af0aa1a1976199752abb63a2faa8366cb5a198daa641b91ca59312bfb0b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"omfG+TL6WCaBo7JDPnIWLShMRdOhP2wrTV3E/cLZCfWXHWwt3VhucPaI3pbUSQ69tou7DVyOMrWychLqd03KBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T00:34:07.826076Z","bundle_sha256":"b42c2f5fb9117f1986e897dbb7c15c907a49e386d1988c13fd3e1456ae362008"}}