{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4X3NEOTA43JXQEUMZLNNBHXMTD","short_pith_number":"pith:4X3NEOTA","canonical_record":{"source":{"id":"1602.06180","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-19T15:26:22Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"dad6a042ffe39fae138a0c607d3dfdb0a71b426e3248b0d0751fa15af4eab1fe","abstract_canon_sha256":"4985f2c459c2823f5c2e6c9d741404f1a95ae173f1104073719920af52cd2f61"},"schema_version":"1.0"},"canonical_sha256":"e5f6d23a60e6d378128ccadad09eec98ea422ba03f86135f7a32a0f349fa3ecb","source":{"kind":"arxiv","id":"1602.06180","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06180","created_at":"2026-05-18T00:14:16Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06180v3","created_at":"2026-05-18T00:14:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06180","created_at":"2026-05-18T00:14:16Z"},{"alias_kind":"pith_short_12","alias_value":"4X3NEOTA43JX","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4X3NEOTA43JXQEUM","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4X3NEOTA","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4X3NEOTA43JXQEUMZLNNBHXMTD","target":"record","payload":{"canonical_record":{"source":{"id":"1602.06180","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-19T15:26:22Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"dad6a042ffe39fae138a0c607d3dfdb0a71b426e3248b0d0751fa15af4eab1fe","abstract_canon_sha256":"4985f2c459c2823f5c2e6c9d741404f1a95ae173f1104073719920af52cd2f61"},"schema_version":"1.0"},"canonical_sha256":"e5f6d23a60e6d378128ccadad09eec98ea422ba03f86135f7a32a0f349fa3ecb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:16.741888Z","signature_b64":"W2wXZmkZLHrBcLFY3XQZvJ4wokwd2JNh6CZiKgj7ZyUmS5xtLQl0sIv+X2Yeht67KGNkeTPTvDWBgou/ZOUmCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5f6d23a60e6d378128ccadad09eec98ea422ba03f86135f7a32a0f349fa3ecb","last_reissued_at":"2026-05-18T00:14:16.741339Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:16.741339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.06180","source_version":3,"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-18T00:14:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"69LE7gVopFdnm2wR+XOYDmlS/o1uCkz5NLBn19dA2HVn6efgpjq3hs6glq3EiAzfljgvYDAPawCHXDG2t9YfBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:05:19.171418Z"},"content_sha256":"e208ec189a2f137fec2513f4c1c0c3e1dbe56f868acefaacee0806d8a5de4b78","schema_version":"1.0","event_id":"sha256:e208ec189a2f137fec2513f4c1c0c3e1dbe56f868acefaacee0806d8a5de4b78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4X3NEOTA43JXQEUMZLNNBHXMTD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Approach to Constrained Polynomial Optimization via Nonnegative Circuit Polynomials and Geometric Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.OC","authors_text":"Mareike Dressler, Sadik Iliman, Timo de Wolff","submitted_at":"2016-02-19T15:26:22Z","abstract_excerpt":"In this article we combine two developments in polynomial optimization. On the one hand, we consider nonnegativity certificates based on sums of nonnegative circuit polynomials, which were recently introduced by the second and the third author. On the other hand, we investigate geometric programming methods for constrained polynomial optimization problems, which were recently developed by Ghasemi and Marshall. We show that the combination of both results yields a new method to solve certain classes of constrained polynomial optimization problems. We test the new method experimentally and compa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06180","kind":"arxiv","version":3},"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-18T00:14:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TjsVPSB6pA5WEgnOxduuzRVIgD8j6k4z853QJPFIuNTivaPnhrbM9jnD1ON3QpHtvs3kBb1r27XxvdAWAzh/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:05:19.171763Z"},"content_sha256":"40dd896a39c8a85793062e7f02fe7c205c2ce124d7f56e9c991fc726f4747e90","schema_version":"1.0","event_id":"sha256:40dd896a39c8a85793062e7f02fe7c205c2ce124d7f56e9c991fc726f4747e90"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4X3NEOTA43JXQEUMZLNNBHXMTD/bundle.json","state_url":"https://pith.science/pith/4X3NEOTA43JXQEUMZLNNBHXMTD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4X3NEOTA43JXQEUMZLNNBHXMTD/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-01T11:05:19Z","links":{"resolver":"https://pith.science/pith/4X3NEOTA43JXQEUMZLNNBHXMTD","bundle":"https://pith.science/pith/4X3NEOTA43JXQEUMZLNNBHXMTD/bundle.json","state":"https://pith.science/pith/4X3NEOTA43JXQEUMZLNNBHXMTD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4X3NEOTA43JXQEUMZLNNBHXMTD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4X3NEOTA43JXQEUMZLNNBHXMTD","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":"4985f2c459c2823f5c2e6c9d741404f1a95ae173f1104073719920af52cd2f61","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-19T15:26:22Z","title_canon_sha256":"dad6a042ffe39fae138a0c607d3dfdb0a71b426e3248b0d0751fa15af4eab1fe"},"schema_version":"1.0","source":{"id":"1602.06180","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06180","created_at":"2026-05-18T00:14:16Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06180v3","created_at":"2026-05-18T00:14:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06180","created_at":"2026-05-18T00:14:16Z"},{"alias_kind":"pith_short_12","alias_value":"4X3NEOTA43JX","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4X3NEOTA43JXQEUM","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4X3NEOTA","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:40dd896a39c8a85793062e7f02fe7c205c2ce124d7f56e9c991fc726f4747e90","target":"graph","created_at":"2026-05-18T00:14:16Z","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":"In this article we combine two developments in polynomial optimization. On the one hand, we consider nonnegativity certificates based on sums of nonnegative circuit polynomials, which were recently introduced by the second and the third author. On the other hand, we investigate geometric programming methods for constrained polynomial optimization problems, which were recently developed by Ghasemi and Marshall. We show that the combination of both results yields a new method to solve certain classes of constrained polynomial optimization problems. We test the new method experimentally and compa","authors_text":"Mareike Dressler, Sadik Iliman, Timo de Wolff","cross_cats":["math.AG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-19T15:26:22Z","title":"An Approach to Constrained Polynomial Optimization via Nonnegative Circuit Polynomials and Geometric Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06180","kind":"arxiv","version":3},"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:e208ec189a2f137fec2513f4c1c0c3e1dbe56f868acefaacee0806d8a5de4b78","target":"record","created_at":"2026-05-18T00:14:16Z","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":"4985f2c459c2823f5c2e6c9d741404f1a95ae173f1104073719920af52cd2f61","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-19T15:26:22Z","title_canon_sha256":"dad6a042ffe39fae138a0c607d3dfdb0a71b426e3248b0d0751fa15af4eab1fe"},"schema_version":"1.0","source":{"id":"1602.06180","kind":"arxiv","version":3}},"canonical_sha256":"e5f6d23a60e6d378128ccadad09eec98ea422ba03f86135f7a32a0f349fa3ecb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5f6d23a60e6d378128ccadad09eec98ea422ba03f86135f7a32a0f349fa3ecb","first_computed_at":"2026-05-18T00:14:16.741339Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:16.741339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W2wXZmkZLHrBcLFY3XQZvJ4wokwd2JNh6CZiKgj7ZyUmS5xtLQl0sIv+X2Yeht67KGNkeTPTvDWBgou/ZOUmCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:16.741888Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.06180","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e208ec189a2f137fec2513f4c1c0c3e1dbe56f868acefaacee0806d8a5de4b78","sha256:40dd896a39c8a85793062e7f02fe7c205c2ce124d7f56e9c991fc726f4747e90"],"state_sha256":"e6cc7f0a7b9dfe413ad3d545dfb21d95e766e15fe52f370beb2ff8e1b9cf991f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mhDrvKHMDyFu1jswhNtGf1qMa+qwTp8r7bS4dfIOn6IdFFWpI06QytCiRzUhJFaDrz/DUTpIuLYZjkdJ82+SAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:05:19.173724Z","bundle_sha256":"2c82618e6f2596d28740849070fc6a3e0371f5534f29554e14fe63e8e99eaa5a"}}