{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:G7AUIOCE7IPVAFSOLPRJN7Q35W","short_pith_number":"pith:G7AUIOCE","canonical_record":{"source":{"id":"1007.2371","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.NA","submitted_at":"2010-07-14T16:30:00Z","cross_cats_sorted":["math.OC","stat.CO"],"title_canon_sha256":"4c49ba4de633c14a5fff1a37ad5fc57234b2520fbaf5f663558106e99acaa935","abstract_canon_sha256":"c6777b59c192677a73b8bfb8af8fc2977efba711a7f51e2c3cb2afffd8b31e78"},"schema_version":"1.0"},"canonical_sha256":"37c1443844fa1f50164e5be296fe1bedb518cb6cdc3d759fa9f45ded20aed4bf","source":{"kind":"arxiv","id":"1007.2371","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.2371","created_at":"2026-05-18T03:10:00Z"},{"alias_kind":"arxiv_version","alias_value":"1007.2371v1","created_at":"2026-05-18T03:10:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2371","created_at":"2026-05-18T03:10:00Z"},{"alias_kind":"pith_short_12","alias_value":"G7AUIOCE7IPV","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"G7AUIOCE7IPVAFSO","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"G7AUIOCE","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:G7AUIOCE7IPVAFSOLPRJN7Q35W","target":"record","payload":{"canonical_record":{"source":{"id":"1007.2371","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.NA","submitted_at":"2010-07-14T16:30:00Z","cross_cats_sorted":["math.OC","stat.CO"],"title_canon_sha256":"4c49ba4de633c14a5fff1a37ad5fc57234b2520fbaf5f663558106e99acaa935","abstract_canon_sha256":"c6777b59c192677a73b8bfb8af8fc2977efba711a7f51e2c3cb2afffd8b31e78"},"schema_version":"1.0"},"canonical_sha256":"37c1443844fa1f50164e5be296fe1bedb518cb6cdc3d759fa9f45ded20aed4bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:00.840124Z","signature_b64":"xjn2mWqsIuk2H4VPPPHCN9LAuAFmTmCJ6PyWz4E2RI7yAdHafsJfvDiKpxsPOplQwJr/Otrp8fZZEE7+SeU4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37c1443844fa1f50164e5be296fe1bedb518cb6cdc3d759fa9f45ded20aed4bf","last_reissued_at":"2026-05-18T03:10:00.839669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:00.839669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.2371","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-05-18T03:10:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ojtQ/c26cawqA63I5kw9hrUQbCsGBY2PkrF2x3Lxu0DYESJ1sGkFM4KjprUJqyVZ73Z8FhTXdm/jMFhfblnbAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T22:44:21.381149Z"},"content_sha256":"b899d4d98f7f72eb031398f190e93a7bda31a88d66ffac64aa894e19fed7df68","schema_version":"1.0","event_id":"sha256:b899d4d98f7f72eb031398f190e93a7bda31a88d66ffac64aa894e19fed7df68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:G7AUIOCE7IPVAFSOLPRJN7Q35W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MM Algorithms for Geometric and Signomial Programming","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.OC","stat.CO"],"primary_cat":"math.NA","authors_text":"Hua Zhou, Kenneth Lange","submitted_at":"2010-07-14T16:30:00Z","abstract_excerpt":"This paper derives new algorithms for signomial programming, a generalization of geometric programming. The algorithms are based on a generic principle for optimization called the MM algorithm. In this setting, one can apply the geometric-arithmetic mean inequality and a supporting hyperplane inequality to create a surrogate function with parameters separated. Thus, unconstrained signomial programming reduces to a sequence of one-dimensional minimization problems. Simple examples demonstrate that the MM algorithm derived can converge to a boundary point or to one point of a continuum of minimu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2371","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"},"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-05-18T03:10:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FJmI3Dkpq46uqyng0TKnkN+GG0gCDlmbJraQAaGeFPoJnU6PC9WHx0FhRgH5ZxDIEif3duLWtRHcddyp8uU0Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T22:44:21.381854Z"},"content_sha256":"75508450216c4e8ea2ce428d5efd71c4ced515a61ff41bd71f50af5c4b812864","schema_version":"1.0","event_id":"sha256:75508450216c4e8ea2ce428d5efd71c4ced515a61ff41bd71f50af5c4b812864"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G7AUIOCE7IPVAFSOLPRJN7Q35W/bundle.json","state_url":"https://pith.science/pith/G7AUIOCE7IPVAFSOLPRJN7Q35W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G7AUIOCE7IPVAFSOLPRJN7Q35W/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-06-06T22:44:21Z","links":{"resolver":"https://pith.science/pith/G7AUIOCE7IPVAFSOLPRJN7Q35W","bundle":"https://pith.science/pith/G7AUIOCE7IPVAFSOLPRJN7Q35W/bundle.json","state":"https://pith.science/pith/G7AUIOCE7IPVAFSOLPRJN7Q35W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G7AUIOCE7IPVAFSOLPRJN7Q35W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:G7AUIOCE7IPVAFSOLPRJN7Q35W","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":"c6777b59c192677a73b8bfb8af8fc2977efba711a7f51e2c3cb2afffd8b31e78","cross_cats_sorted":["math.OC","stat.CO"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.NA","submitted_at":"2010-07-14T16:30:00Z","title_canon_sha256":"4c49ba4de633c14a5fff1a37ad5fc57234b2520fbaf5f663558106e99acaa935"},"schema_version":"1.0","source":{"id":"1007.2371","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.2371","created_at":"2026-05-18T03:10:00Z"},{"alias_kind":"arxiv_version","alias_value":"1007.2371v1","created_at":"2026-05-18T03:10:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2371","created_at":"2026-05-18T03:10:00Z"},{"alias_kind":"pith_short_12","alias_value":"G7AUIOCE7IPV","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"G7AUIOCE7IPVAFSO","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"G7AUIOCE","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:75508450216c4e8ea2ce428d5efd71c4ced515a61ff41bd71f50af5c4b812864","target":"graph","created_at":"2026-05-18T03:10:00Z","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":"This paper derives new algorithms for signomial programming, a generalization of geometric programming. The algorithms are based on a generic principle for optimization called the MM algorithm. In this setting, one can apply the geometric-arithmetic mean inequality and a supporting hyperplane inequality to create a surrogate function with parameters separated. Thus, unconstrained signomial programming reduces to a sequence of one-dimensional minimization problems. Simple examples demonstrate that the MM algorithm derived can converge to a boundary point or to one point of a continuum of minimu","authors_text":"Hua Zhou, Kenneth Lange","cross_cats":["math.OC","stat.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.NA","submitted_at":"2010-07-14T16:30:00Z","title":"MM Algorithms for Geometric and Signomial Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2371","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:b899d4d98f7f72eb031398f190e93a7bda31a88d66ffac64aa894e19fed7df68","target":"record","created_at":"2026-05-18T03:10:00Z","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":"c6777b59c192677a73b8bfb8af8fc2977efba711a7f51e2c3cb2afffd8b31e78","cross_cats_sorted":["math.OC","stat.CO"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.NA","submitted_at":"2010-07-14T16:30:00Z","title_canon_sha256":"4c49ba4de633c14a5fff1a37ad5fc57234b2520fbaf5f663558106e99acaa935"},"schema_version":"1.0","source":{"id":"1007.2371","kind":"arxiv","version":1}},"canonical_sha256":"37c1443844fa1f50164e5be296fe1bedb518cb6cdc3d759fa9f45ded20aed4bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37c1443844fa1f50164e5be296fe1bedb518cb6cdc3d759fa9f45ded20aed4bf","first_computed_at":"2026-05-18T03:10:00.839669Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:00.839669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xjn2mWqsIuk2H4VPPPHCN9LAuAFmTmCJ6PyWz4E2RI7yAdHafsJfvDiKpxsPOplQwJr/Otrp8fZZEE7+SeU4Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:00.840124Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.2371","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b899d4d98f7f72eb031398f190e93a7bda31a88d66ffac64aa894e19fed7df68","sha256:75508450216c4e8ea2ce428d5efd71c4ced515a61ff41bd71f50af5c4b812864"],"state_sha256":"ac52518e99951f13bbf65f2847556529a26d0d5f8575fdf3dae27b9bc5499f90"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SLKTK9Ee+y7sRNThn4yDFlhOHe3I3RgJG7q2ybgvJa2qLOtzXwA87evFulgJIFjUFm0bU2BZIazb0C4tEuoOBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T22:44:21.387215Z","bundle_sha256":"7ab47e5cc4119a4b560e7d8dadc9b3b58c817d359e091138bca101008d8077eb"}}