{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:NMSTL42T36KP7EIOOJX7N7BDIM","short_pith_number":"pith:NMSTL42T","canonical_record":{"source":{"id":"1106.1666","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-06-08T20:56:48Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"df7be5aa0785b87f3e0b7d9974da44af761860fe033cc48d9df55fe7734de5a9","abstract_canon_sha256":"3306e6fa1a77d3dd242f34ab536c1381f284df42e21d2e63fa08eef00a053fe2"},"schema_version":"1.0"},"canonical_sha256":"6b2535f353df94ff910e726ff6fc234313e098251a8f5aded945d1dd040c0922","source":{"kind":"arxiv","id":"1106.1666","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.1666","created_at":"2026-05-18T03:40:51Z"},{"alias_kind":"arxiv_version","alias_value":"1106.1666v1","created_at":"2026-05-18T03:40:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1666","created_at":"2026-05-18T03:40:51Z"},{"alias_kind":"pith_short_12","alias_value":"NMSTL42T36KP","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NMSTL42T36KP7EIO","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NMSTL42T","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:NMSTL42T36KP7EIOOJX7N7BDIM","target":"record","payload":{"canonical_record":{"source":{"id":"1106.1666","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-06-08T20:56:48Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"df7be5aa0785b87f3e0b7d9974da44af761860fe033cc48d9df55fe7734de5a9","abstract_canon_sha256":"3306e6fa1a77d3dd242f34ab536c1381f284df42e21d2e63fa08eef00a053fe2"},"schema_version":"1.0"},"canonical_sha256":"6b2535f353df94ff910e726ff6fc234313e098251a8f5aded945d1dd040c0922","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:51.558800Z","signature_b64":"7WcFY9VENqYQ7dbTq2JNmwX5MtWCr4FD458raJWjxnwAiGKz0AcLkE6Pic33aZ0u9tmYAZYreiD4/WEh6OjaAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b2535f353df94ff910e726ff6fc234313e098251a8f5aded945d1dd040c0922","last_reissued_at":"2026-05-18T03:40:51.557972Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:51.557972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.1666","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:40:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MmhswJoyGkpFSNbyY33C8YHYrDHIKsUQfCUgi2LA7a6umbcTJw2eSyAbfs/2wct9DMYl1XHbIUqFnmr7+tNECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:53:46.684550Z"},"content_sha256":"d72b5ab5a9eebf68461403eb4d12a156752bdcf7bd085c04df21bfe21662d985","schema_version":"1.0","event_id":"sha256:d72b5ab5a9eebf68461403eb4d12a156752bdcf7bd085c04df21bfe21662d985"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:NMSTL42T36KP7EIOOJX7N7BDIM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower bounds for polynomials using geometric programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.OC","authors_text":"Mehdi Ghasemi, Murray Marshall","submitted_at":"2011-06-08T20:56:48Z","abstract_excerpt":"We make use of a result of Hurwitz and Reznick, and a consequence of this result due to Fidalgo and Kovacec, to determine a new sufficient condition for a polynomial $f\\in\\mathbb{R}[X_1,...,X_n]$ of even degree to be a sum of squares. This result generalizes a result of Lasserre and a result of Fidalgo and Kovacec, and it also generalizes the improvements of these results given in [6]. We apply this result to obtain a new lower bound $f_{gp}$ for $f$, and we explain how $f_{gp}$ can be computed using geometric programming. The lower bound $f_{gp}$ is generally not as good as the lower bound $f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1666","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:40:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WIFNdF5N17qigLDh6Xu+Xj6cgxVwzmKwft5CWUHBZtta7aMo9QoZohRJP4VEGnUQ0eLt/myff3per5nAYb5hBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:53:46.684907Z"},"content_sha256":"71216afc6ff23c12d745af193b0a067c9ca23e21bfe75777f1007bc97d8a28a0","schema_version":"1.0","event_id":"sha256:71216afc6ff23c12d745af193b0a067c9ca23e21bfe75777f1007bc97d8a28a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NMSTL42T36KP7EIOOJX7N7BDIM/bundle.json","state_url":"https://pith.science/pith/NMSTL42T36KP7EIOOJX7N7BDIM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NMSTL42T36KP7EIOOJX7N7BDIM/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-05-30T08:53:46Z","links":{"resolver":"https://pith.science/pith/NMSTL42T36KP7EIOOJX7N7BDIM","bundle":"https://pith.science/pith/NMSTL42T36KP7EIOOJX7N7BDIM/bundle.json","state":"https://pith.science/pith/NMSTL42T36KP7EIOOJX7N7BDIM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NMSTL42T36KP7EIOOJX7N7BDIM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:NMSTL42T36KP7EIOOJX7N7BDIM","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":"3306e6fa1a77d3dd242f34ab536c1381f284df42e21d2e63fa08eef00a053fe2","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-06-08T20:56:48Z","title_canon_sha256":"df7be5aa0785b87f3e0b7d9974da44af761860fe033cc48d9df55fe7734de5a9"},"schema_version":"1.0","source":{"id":"1106.1666","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.1666","created_at":"2026-05-18T03:40:51Z"},{"alias_kind":"arxiv_version","alias_value":"1106.1666v1","created_at":"2026-05-18T03:40:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1666","created_at":"2026-05-18T03:40:51Z"},{"alias_kind":"pith_short_12","alias_value":"NMSTL42T36KP","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NMSTL42T36KP7EIO","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NMSTL42T","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:71216afc6ff23c12d745af193b0a067c9ca23e21bfe75777f1007bc97d8a28a0","target":"graph","created_at":"2026-05-18T03:40:51Z","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":"We make use of a result of Hurwitz and Reznick, and a consequence of this result due to Fidalgo and Kovacec, to determine a new sufficient condition for a polynomial $f\\in\\mathbb{R}[X_1,...,X_n]$ of even degree to be a sum of squares. This result generalizes a result of Lasserre and a result of Fidalgo and Kovacec, and it also generalizes the improvements of these results given in [6]. We apply this result to obtain a new lower bound $f_{gp}$ for $f$, and we explain how $f_{gp}$ can be computed using geometric programming. The lower bound $f_{gp}$ is generally not as good as the lower bound $f","authors_text":"Mehdi Ghasemi, Murray Marshall","cross_cats":["math.AG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-06-08T20:56:48Z","title":"Lower bounds for polynomials using geometric programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1666","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:d72b5ab5a9eebf68461403eb4d12a156752bdcf7bd085c04df21bfe21662d985","target":"record","created_at":"2026-05-18T03:40:51Z","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":"3306e6fa1a77d3dd242f34ab536c1381f284df42e21d2e63fa08eef00a053fe2","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-06-08T20:56:48Z","title_canon_sha256":"df7be5aa0785b87f3e0b7d9974da44af761860fe033cc48d9df55fe7734de5a9"},"schema_version":"1.0","source":{"id":"1106.1666","kind":"arxiv","version":1}},"canonical_sha256":"6b2535f353df94ff910e726ff6fc234313e098251a8f5aded945d1dd040c0922","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b2535f353df94ff910e726ff6fc234313e098251a8f5aded945d1dd040c0922","first_computed_at":"2026-05-18T03:40:51.557972Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:40:51.557972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7WcFY9VENqYQ7dbTq2JNmwX5MtWCr4FD458raJWjxnwAiGKz0AcLkE6Pic33aZ0u9tmYAZYreiD4/WEh6OjaAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:40:51.558800Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.1666","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d72b5ab5a9eebf68461403eb4d12a156752bdcf7bd085c04df21bfe21662d985","sha256:71216afc6ff23c12d745af193b0a067c9ca23e21bfe75777f1007bc97d8a28a0"],"state_sha256":"0bdf8104bc415e311dfcda88c62a4655dd410a3dbc212cbd2cdf8e081b354c77"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3TLYnlkmwFlSjVNZIEyU39G2c4ej+vdeJFQkxZoN4F9/3MoTwUvuPNRYtak5GXiDkiFc4sA0rsGzI8rMMVjlCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:53:46.687020Z","bundle_sha256":"2f3984cc7c75b76c8c58111b06a3be7ee1b17249704d2b1e98d46089a87c5abe"}}