{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IAACCBICA5QNXPU3WDWMKQ2Y6E","short_pith_number":"pith:IAACCBIC","canonical_record":{"source":{"id":"1808.08431","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-25T14:17:59Z","cross_cats_sorted":["cs.MS","math.AG"],"title_canon_sha256":"595b0f7c8051e6acacff29d4b400a066fdf4df8fa39f017f284d566734228120","abstract_canon_sha256":"5a38a47b1a1141814e5715edcca12937f898d2fe83e2b38d4b98efdc91cc1b8e"},"schema_version":"1.0"},"canonical_sha256":"40002105020760dbbe9bb0ecc54358f121ba4d924b5bef39fa5eb78953bb31e6","source":{"kind":"arxiv","id":"1808.08431","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.08431","created_at":"2026-05-18T00:07:16Z"},{"alias_kind":"arxiv_version","alias_value":"1808.08431v1","created_at":"2026-05-18T00:07:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08431","created_at":"2026-05-18T00:07:16Z"},{"alias_kind":"pith_short_12","alias_value":"IAACCBICA5QN","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"IAACCBICA5QNXPU3","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"IAACCBIC","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IAACCBICA5QNXPU3WDWMKQ2Y6E","target":"record","payload":{"canonical_record":{"source":{"id":"1808.08431","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-25T14:17:59Z","cross_cats_sorted":["cs.MS","math.AG"],"title_canon_sha256":"595b0f7c8051e6acacff29d4b400a066fdf4df8fa39f017f284d566734228120","abstract_canon_sha256":"5a38a47b1a1141814e5715edcca12937f898d2fe83e2b38d4b98efdc91cc1b8e"},"schema_version":"1.0"},"canonical_sha256":"40002105020760dbbe9bb0ecc54358f121ba4d924b5bef39fa5eb78953bb31e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:16.524505Z","signature_b64":"xnShHbyXQ4PEy9iV5fUVetMIXAMwlL67EUd7Mt8SXxby1FoXrbNRq6g0uq1NgKF5doVu/kZ/hM8CWYvs5v+KDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40002105020760dbbe9bb0ecc54358f121ba4d924b5bef39fa5eb78953bb31e6","last_reissued_at":"2026-05-18T00:07:16.523860Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:16.523860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.08431","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-18T00:07:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"td0NnE/Umpujgt2yNG3+aUN2e8Q6iivVQOwM54kayidJw12upCUJV47bms2TUnAJgn2bkIuGPKrUxQipclg0Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:09:36.548727Z"},"content_sha256":"b3fdbfdef6f114897f82545ea3f53af895f04624229a1a7c89614dd4bc3e1174","schema_version":"1.0","event_id":"sha256:b3fdbfdef6f114897f82545ea3f53af895f04624229a1a7c89614dd4bc3e1174"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IAACCBICA5QNXPU3WDWMKQ2Y6E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Experimental Comparison of SONC and SOS Certificates for Unconstrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","math.AG"],"primary_cat":"math.OC","authors_text":"Henning Seidler, Timo de Wolff","submitted_at":"2018-08-25T14:17:59Z","abstract_excerpt":"Finding the minimum of a multivariate real polynomial is a well-known hard problem with various applications. We present a polynomial time algorithm to approximate such lower bounds via sums of nonnegative circuit polynomials (SONC). As a main result, we carry out the first large-scale comparison of SONC, using this algorithm and different geometric programming (GP) solvers, with the classical sums of squares (SOS) approach, using several of the most common semidefinite programming (SDP) solvers. SONC yields bounds competitive to SOS in several cases, but using significantly less time and memo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08431","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-18T00:07:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jgaWnRw/epNrT2S1dCLpWdgZBMZbOH6AL+E/b/yELnGY4lEuQeDthFsobO/aFvpA5Z5VY/icBF4E7W/IB315Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:09:36.549477Z"},"content_sha256":"6fe72669fdf1be77f04049495f409b933f3e144c59c6f978af5d23aed5a50cfd","schema_version":"1.0","event_id":"sha256:6fe72669fdf1be77f04049495f409b933f3e144c59c6f978af5d23aed5a50cfd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IAACCBICA5QNXPU3WDWMKQ2Y6E/bundle.json","state_url":"https://pith.science/pith/IAACCBICA5QNXPU3WDWMKQ2Y6E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IAACCBICA5QNXPU3WDWMKQ2Y6E/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-11T21:09:36Z","links":{"resolver":"https://pith.science/pith/IAACCBICA5QNXPU3WDWMKQ2Y6E","bundle":"https://pith.science/pith/IAACCBICA5QNXPU3WDWMKQ2Y6E/bundle.json","state":"https://pith.science/pith/IAACCBICA5QNXPU3WDWMKQ2Y6E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IAACCBICA5QNXPU3WDWMKQ2Y6E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IAACCBICA5QNXPU3WDWMKQ2Y6E","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":"5a38a47b1a1141814e5715edcca12937f898d2fe83e2b38d4b98efdc91cc1b8e","cross_cats_sorted":["cs.MS","math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-25T14:17:59Z","title_canon_sha256":"595b0f7c8051e6acacff29d4b400a066fdf4df8fa39f017f284d566734228120"},"schema_version":"1.0","source":{"id":"1808.08431","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.08431","created_at":"2026-05-18T00:07:16Z"},{"alias_kind":"arxiv_version","alias_value":"1808.08431v1","created_at":"2026-05-18T00:07:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08431","created_at":"2026-05-18T00:07:16Z"},{"alias_kind":"pith_short_12","alias_value":"IAACCBICA5QN","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"IAACCBICA5QNXPU3","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"IAACCBIC","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:6fe72669fdf1be77f04049495f409b933f3e144c59c6f978af5d23aed5a50cfd","target":"graph","created_at":"2026-05-18T00:07: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":"Finding the minimum of a multivariate real polynomial is a well-known hard problem with various applications. We present a polynomial time algorithm to approximate such lower bounds via sums of nonnegative circuit polynomials (SONC). As a main result, we carry out the first large-scale comparison of SONC, using this algorithm and different geometric programming (GP) solvers, with the classical sums of squares (SOS) approach, using several of the most common semidefinite programming (SDP) solvers. SONC yields bounds competitive to SOS in several cases, but using significantly less time and memo","authors_text":"Henning Seidler, Timo de Wolff","cross_cats":["cs.MS","math.AG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-25T14:17:59Z","title":"An Experimental Comparison of SONC and SOS Certificates for Unconstrained Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08431","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:b3fdbfdef6f114897f82545ea3f53af895f04624229a1a7c89614dd4bc3e1174","target":"record","created_at":"2026-05-18T00:07: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":"5a38a47b1a1141814e5715edcca12937f898d2fe83e2b38d4b98efdc91cc1b8e","cross_cats_sorted":["cs.MS","math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-25T14:17:59Z","title_canon_sha256":"595b0f7c8051e6acacff29d4b400a066fdf4df8fa39f017f284d566734228120"},"schema_version":"1.0","source":{"id":"1808.08431","kind":"arxiv","version":1}},"canonical_sha256":"40002105020760dbbe9bb0ecc54358f121ba4d924b5bef39fa5eb78953bb31e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40002105020760dbbe9bb0ecc54358f121ba4d924b5bef39fa5eb78953bb31e6","first_computed_at":"2026-05-18T00:07:16.523860Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:16.523860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xnShHbyXQ4PEy9iV5fUVetMIXAMwlL67EUd7Mt8SXxby1FoXrbNRq6g0uq1NgKF5doVu/kZ/hM8CWYvs5v+KDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:16.524505Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.08431","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3fdbfdef6f114897f82545ea3f53af895f04624229a1a7c89614dd4bc3e1174","sha256:6fe72669fdf1be77f04049495f409b933f3e144c59c6f978af5d23aed5a50cfd"],"state_sha256":"0d2a39413ee601fbac9f0e648a01641edf05d7904ddc6cf3ecf580a847778581"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DX8LPEIO+KntSVtm4db9D2rZNMSGWFXMhnTNUnkwwh2DlYH7gFriBJpJZp8dkwt4oT/xHvTIvUn6TONQR1lhBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T21:09:36.553624Z","bundle_sha256":"220c4830fe653616d4ad7c42042f3692f372e9905d600e19933b3bf5919db75b"}}