{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GTJ6HK34DJSKP5BOB3O7SEJAXS","short_pith_number":"pith:GTJ6HK34","canonical_record":{"source":{"id":"1205.1223","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2012-05-06T15:12:19Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"d787ec893b2d68e4d356f07f87a20386f64ec2a353a05fa1ee45ffdd9e5b4e64","abstract_canon_sha256":"379a8d90698eef548632212f09259051a25ff0d7e6b60e7569886048f8d0a4d3"},"schema_version":"1.0"},"canonical_sha256":"34d3e3ab7c1a64a7f42e0eddf91120bca09586820e19c002484630201fe57720","source":{"kind":"arxiv","id":"1205.1223","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1223","created_at":"2026-05-18T03:16:49Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1223v4","created_at":"2026-05-18T03:16:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1223","created_at":"2026-05-18T03:16:49Z"},{"alias_kind":"pith_short_12","alias_value":"GTJ6HK34DJSK","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GTJ6HK34DJSKP5BO","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GTJ6HK34","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GTJ6HK34DJSKP5BOB3O7SEJAXS","target":"record","payload":{"canonical_record":{"source":{"id":"1205.1223","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2012-05-06T15:12:19Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"d787ec893b2d68e4d356f07f87a20386f64ec2a353a05fa1ee45ffdd9e5b4e64","abstract_canon_sha256":"379a8d90698eef548632212f09259051a25ff0d7e6b60e7569886048f8d0a4d3"},"schema_version":"1.0"},"canonical_sha256":"34d3e3ab7c1a64a7f42e0eddf91120bca09586820e19c002484630201fe57720","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:49.822887Z","signature_b64":"6M6LRESJ6kSQjnvuTG+Bvc2qhkGE6Q8rb2gTfOkjUBZSbn8tWgiirWS17q2TA4lEVNknlBJgguBhfxPEMzKSAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34d3e3ab7c1a64a7f42e0eddf91120bca09586820e19c002484630201fe57720","last_reissued_at":"2026-05-18T03:16:49.822327Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:49.822327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.1223","source_version":4,"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:16:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9btamlcbXpTuRF4BcpNxi7j9IROCI90hP5x+xMwCTpmlWholR2hlu5dHA4ax5BQWvYDaZXfO2uFInX7RmevjBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T18:08:19.019948Z"},"content_sha256":"aab074f8dc212180520249cba10490d7719ba6a552535f22ee60ccc1950fc7a7","schema_version":"1.0","event_id":"sha256:aab074f8dc212180520249cba10490d7719ba6a552535f22ee60ccc1950fc7a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GTJ6HK34DJSKP5BOB3O7SEJAXS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proving Inequalities and Solving Global Optimization Problems via Simplified CAD Projection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"cs.SC","authors_text":"Bican Xia, Jingjun Han, Zhi Jin","submitted_at":"2012-05-06T15:12:19Z","abstract_excerpt":"Let $\\xx_n=(x_1,\\ldots,x_n)$ and $f\\in \\R[\\xx_n,k]$. The problem of finding all $k_0$ such that $f(\\xx_n,k_0)\\ge 0$ on $\\mathbb{R}^n$ is considered in this paper, which obviously takes as a special case the problem of computing the global infimum or proving the semi-definiteness of a polynomial.\n  For solving the problems, we propose a simplified Brown's CAD projection operator, \\Nproj, of which the projection scale is always no larger than that of Brown's. For many problems, the scale is much smaller than that of Brown's. As a result, the lifting phase is also simplified. Some new algorithms "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1223","kind":"arxiv","version":4},"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:16:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y9hwt303kyr3PLaKeMZ3e2IAcQK3o1BfBypP2Y/4CjQTrZSe7zroupu8+P3L8n1m9Xw5z7unUkjaso3q7oWsCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T18:08:19.020337Z"},"content_sha256":"be1542fa3ec86c4ff9c921cf003e39245c2ed3e7be4f3c5556cc7d5618b02a75","schema_version":"1.0","event_id":"sha256:be1542fa3ec86c4ff9c921cf003e39245c2ed3e7be4f3c5556cc7d5618b02a75"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GTJ6HK34DJSKP5BOB3O7SEJAXS/bundle.json","state_url":"https://pith.science/pith/GTJ6HK34DJSKP5BOB3O7SEJAXS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GTJ6HK34DJSKP5BOB3O7SEJAXS/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-29T18:08:19Z","links":{"resolver":"https://pith.science/pith/GTJ6HK34DJSKP5BOB3O7SEJAXS","bundle":"https://pith.science/pith/GTJ6HK34DJSKP5BOB3O7SEJAXS/bundle.json","state":"https://pith.science/pith/GTJ6HK34DJSKP5BOB3O7SEJAXS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GTJ6HK34DJSKP5BOB3O7SEJAXS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GTJ6HK34DJSKP5BOB3O7SEJAXS","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":"379a8d90698eef548632212f09259051a25ff0d7e6b60e7569886048f8d0a4d3","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2012-05-06T15:12:19Z","title_canon_sha256":"d787ec893b2d68e4d356f07f87a20386f64ec2a353a05fa1ee45ffdd9e5b4e64"},"schema_version":"1.0","source":{"id":"1205.1223","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1223","created_at":"2026-05-18T03:16:49Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1223v4","created_at":"2026-05-18T03:16:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1223","created_at":"2026-05-18T03:16:49Z"},{"alias_kind":"pith_short_12","alias_value":"GTJ6HK34DJSK","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GTJ6HK34DJSKP5BO","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GTJ6HK34","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:be1542fa3ec86c4ff9c921cf003e39245c2ed3e7be4f3c5556cc7d5618b02a75","target":"graph","created_at":"2026-05-18T03:16:49Z","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":"Let $\\xx_n=(x_1,\\ldots,x_n)$ and $f\\in \\R[\\xx_n,k]$. The problem of finding all $k_0$ such that $f(\\xx_n,k_0)\\ge 0$ on $\\mathbb{R}^n$ is considered in this paper, which obviously takes as a special case the problem of computing the global infimum or proving the semi-definiteness of a polynomial.\n  For solving the problems, we propose a simplified Brown's CAD projection operator, \\Nproj, of which the projection scale is always no larger than that of Brown's. For many problems, the scale is much smaller than that of Brown's. As a result, the lifting phase is also simplified. Some new algorithms ","authors_text":"Bican Xia, Jingjun Han, Zhi Jin","cross_cats":["math.AG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2012-05-06T15:12:19Z","title":"Proving Inequalities and Solving Global Optimization Problems via Simplified CAD Projection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1223","kind":"arxiv","version":4},"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:aab074f8dc212180520249cba10490d7719ba6a552535f22ee60ccc1950fc7a7","target":"record","created_at":"2026-05-18T03:16:49Z","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":"379a8d90698eef548632212f09259051a25ff0d7e6b60e7569886048f8d0a4d3","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2012-05-06T15:12:19Z","title_canon_sha256":"d787ec893b2d68e4d356f07f87a20386f64ec2a353a05fa1ee45ffdd9e5b4e64"},"schema_version":"1.0","source":{"id":"1205.1223","kind":"arxiv","version":4}},"canonical_sha256":"34d3e3ab7c1a64a7f42e0eddf91120bca09586820e19c002484630201fe57720","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34d3e3ab7c1a64a7f42e0eddf91120bca09586820e19c002484630201fe57720","first_computed_at":"2026-05-18T03:16:49.822327Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:49.822327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6M6LRESJ6kSQjnvuTG+Bvc2qhkGE6Q8rb2gTfOkjUBZSbn8tWgiirWS17q2TA4lEVNknlBJgguBhfxPEMzKSAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:49.822887Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.1223","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aab074f8dc212180520249cba10490d7719ba6a552535f22ee60ccc1950fc7a7","sha256:be1542fa3ec86c4ff9c921cf003e39245c2ed3e7be4f3c5556cc7d5618b02a75"],"state_sha256":"2295e8c454789346a4ea3f6030ce87ba1320c9103fd6c98249b1f89e00286b57"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fWmVjxwWuP3/eZRZJ3NnHlM3JwxyBFflKcXOa+o84aVMZfU9zsfL8dsnC1RvK40FObM1joW2AECN9Q0+wj5XBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T18:08:19.022719Z","bundle_sha256":"1cf9da0075077e7d763d2ef2bd94eea1f070f2cd16de00daed5799dda0def1b6"}}