{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:SWLKOJV7JX2OHS4UGXD5MI243R","short_pith_number":"pith:SWLKOJV7","canonical_record":{"source":{"id":"0904.4060","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2009-04-26T20:36:56Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"dcb8110518dac1b22c024a66b2352a155d5a3ea9342f7bfab0c722332a6d048a","abstract_canon_sha256":"276783b7d1b79c332ec72bd909b0a3ba351df795789d92101aaf35627654b1f3"},"schema_version":"1.0"},"canonical_sha256":"9596a726bf4df4e3cb9435c7d6235cdc71d20816d08b81510c51f8c100975be1","source":{"kind":"arxiv","id":"0904.4060","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0904.4060","created_at":"2026-05-18T04:36:51Z"},{"alias_kind":"arxiv_version","alias_value":"0904.4060v3","created_at":"2026-05-18T04:36:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.4060","created_at":"2026-05-18T04:36:51Z"},{"alias_kind":"pith_short_12","alias_value":"SWLKOJV7JX2O","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"SWLKOJV7JX2OHS4U","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"SWLKOJV7","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:SWLKOJV7JX2OHS4UGXD5MI243R","target":"record","payload":{"canonical_record":{"source":{"id":"0904.4060","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2009-04-26T20:36:56Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"dcb8110518dac1b22c024a66b2352a155d5a3ea9342f7bfab0c722332a6d048a","abstract_canon_sha256":"276783b7d1b79c332ec72bd909b0a3ba351df795789d92101aaf35627654b1f3"},"schema_version":"1.0"},"canonical_sha256":"9596a726bf4df4e3cb9435c7d6235cdc71d20816d08b81510c51f8c100975be1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:36:51.368879Z","signature_b64":"gDBd4kPQXuhMeNAGxhNJ4Qpyg5poyz4fAmRLr260sLd0K3n35TgMe5B7ABEtRw88UEEIp3yE32HRvSmvEDTSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9596a726bf4df4e3cb9435c7d6235cdc71d20816d08b81510c51f8c100975be1","last_reissued_at":"2026-05-18T04:36:51.368441Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:36:51.368441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0904.4060","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-18T04:36:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k+EPkipb8rRVl2XZlYlfomyTOCZKX+fizcBl+h+XeOZZU1pBrptlfXVgw3U5PYnlN4vFQJxscOSIYTeypUwQAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:14:40.064366Z"},"content_sha256":"208a18fbc70e5e5ab280d3d9c0a61a3b62418c8325581f8705d8725507eda8a6","schema_version":"1.0","event_id":"sha256:208a18fbc70e5e5ab280d3d9c0a61a3b62418c8325581f8705d8725507eda8a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:SWLKOJV7JX2OHS4UGXD5MI243R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimization and NP_R-Completeness of Certain Fewnomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.AG","authors_text":"David C. Thompson, J. Maurice Rojas, Philippe Pebay","submitted_at":"2009-04-26T20:36:56Z","abstract_excerpt":"We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n+2)-nomial with a constant term, allowing real exponents as well as real coefficients. Our complexity bounds count field operations and inequality checks, and are polynomial in n and the logarithm of a certain condition number. For the special case of polynomials (i.e., integer exponents), the log of our condition number is quadratic in the sparse encoding. The best previous complexity bounds were exponential in the sparse encoding, even for n fixed. Along the way, we extend the theory of A"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.4060","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-18T04:36:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VKsHu02g0Zt2AsDyK/8LjNPXryA8lqm9zcgVelCQ7cpj/SliUNOH1uVChC2XXEdda3OQ8OO8kSZUuAEkZjuNCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:14:40.065029Z"},"content_sha256":"0b8644f2c4e925e01aaaabea2dbe2c25edae9be92637897879f58dbd7c1228d2","schema_version":"1.0","event_id":"sha256:0b8644f2c4e925e01aaaabea2dbe2c25edae9be92637897879f58dbd7c1228d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SWLKOJV7JX2OHS4UGXD5MI243R/bundle.json","state_url":"https://pith.science/pith/SWLKOJV7JX2OHS4UGXD5MI243R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SWLKOJV7JX2OHS4UGXD5MI243R/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-25T17:14:40Z","links":{"resolver":"https://pith.science/pith/SWLKOJV7JX2OHS4UGXD5MI243R","bundle":"https://pith.science/pith/SWLKOJV7JX2OHS4UGXD5MI243R/bundle.json","state":"https://pith.science/pith/SWLKOJV7JX2OHS4UGXD5MI243R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SWLKOJV7JX2OHS4UGXD5MI243R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:SWLKOJV7JX2OHS4UGXD5MI243R","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":"276783b7d1b79c332ec72bd909b0a3ba351df795789d92101aaf35627654b1f3","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2009-04-26T20:36:56Z","title_canon_sha256":"dcb8110518dac1b22c024a66b2352a155d5a3ea9342f7bfab0c722332a6d048a"},"schema_version":"1.0","source":{"id":"0904.4060","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0904.4060","created_at":"2026-05-18T04:36:51Z"},{"alias_kind":"arxiv_version","alias_value":"0904.4060v3","created_at":"2026-05-18T04:36:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.4060","created_at":"2026-05-18T04:36:51Z"},{"alias_kind":"pith_short_12","alias_value":"SWLKOJV7JX2O","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"SWLKOJV7JX2OHS4U","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"SWLKOJV7","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:0b8644f2c4e925e01aaaabea2dbe2c25edae9be92637897879f58dbd7c1228d2","target":"graph","created_at":"2026-05-18T04:36: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 give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n+2)-nomial with a constant term, allowing real exponents as well as real coefficients. Our complexity bounds count field operations and inequality checks, and are polynomial in n and the logarithm of a certain condition number. For the special case of polynomials (i.e., integer exponents), the log of our condition number is quadratic in the sparse encoding. The best previous complexity bounds were exponential in the sparse encoding, even for n fixed. Along the way, we extend the theory of A","authors_text":"David C. Thompson, J. Maurice Rojas, Philippe Pebay","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2009-04-26T20:36:56Z","title":"Optimization and NP_R-Completeness of Certain Fewnomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.4060","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:208a18fbc70e5e5ab280d3d9c0a61a3b62418c8325581f8705d8725507eda8a6","target":"record","created_at":"2026-05-18T04:36: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":"276783b7d1b79c332ec72bd909b0a3ba351df795789d92101aaf35627654b1f3","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2009-04-26T20:36:56Z","title_canon_sha256":"dcb8110518dac1b22c024a66b2352a155d5a3ea9342f7bfab0c722332a6d048a"},"schema_version":"1.0","source":{"id":"0904.4060","kind":"arxiv","version":3}},"canonical_sha256":"9596a726bf4df4e3cb9435c7d6235cdc71d20816d08b81510c51f8c100975be1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9596a726bf4df4e3cb9435c7d6235cdc71d20816d08b81510c51f8c100975be1","first_computed_at":"2026-05-18T04:36:51.368441Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:36:51.368441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gDBd4kPQXuhMeNAGxhNJ4Qpyg5poyz4fAmRLr260sLd0K3n35TgMe5B7ABEtRw88UEEIp3yE32HRvSmvEDTSCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:36:51.368879Z","signed_message":"canonical_sha256_bytes"},"source_id":"0904.4060","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:208a18fbc70e5e5ab280d3d9c0a61a3b62418c8325581f8705d8725507eda8a6","sha256:0b8644f2c4e925e01aaaabea2dbe2c25edae9be92637897879f58dbd7c1228d2"],"state_sha256":"90604b964976471685eed6979b5a6a063109c7697c130ea4a43230c12c3ce2d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GuLnqgzMcb3WHVopGGH4tfH23JP+TW5lB86Ox0N+M61QnlgYpOG2DMnfqg1x1RlxOGiBj8c5XstXnKVvyfQeAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:14:40.068756Z","bundle_sha256":"0c4f0dc949235dd88f9e43e89b9a1eb2e8f045083a8630dc6665dc2bfcdb9314"}}