{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2SIDBADN4VY7OYR7ASFICVX4UQ","short_pith_number":"pith:2SIDBADN","schema_version":"1.0","canonical_sha256":"d49030806de571f7623f048a8156fca40e9bf65c830f1ed00301b17451472931","source":{"kind":"arxiv","id":"1402.4199","version":1},"attestation_state":"computed","paper":{"title":"Sums of Squares on the Hypercube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.AG","authors_text":"Grigoriy Blekherman, James Pfeiffer, Jo\\~ao Gouveia","submitted_at":"2014-02-18T01:07:33Z","abstract_excerpt":"Let X be a finite set of points in R^n. A polynomial p nonnegative on X can be written as a sum of squares of rational functions modulo the vanishing ideal I(X). From the point of view of applications, such as polynomial optimization, we are interested in rational function representations of small degree. We derive a general upper bound in terms of the Hilbert function of X, and we show that this upper bound is tight for the case of quadratic functions on the hypercube C={0,1}^n, a very well studied case in combinatorial optimization. Using the lower bounds for C we construct a family of globa"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1402.4199","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2014-02-18T01:07:33Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"aa8e4fc7254c69b694196f2d49752c5ad0c080829f9eb90c41e51245cdfd16f6","abstract_canon_sha256":"d313e085edcd81df7eabc55f1087726906471231e86a566acd9f7b9ff194997c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:44.545026Z","signature_b64":"pawEXBdmYJ2gBMTrp+J0TSQunBXH/hTyklxgTHU30dzBvopjNmpkDu7uy1aSLDZitZCmLxHjegQwjDaz3R53Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d49030806de571f7623f048a8156fca40e9bf65c830f1ed00301b17451472931","last_reissued_at":"2026-05-18T02:58:44.544190Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:44.544190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sums of Squares on the Hypercube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.AG","authors_text":"Grigoriy Blekherman, James Pfeiffer, Jo\\~ao Gouveia","submitted_at":"2014-02-18T01:07:33Z","abstract_excerpt":"Let X be a finite set of points in R^n. A polynomial p nonnegative on X can be written as a sum of squares of rational functions modulo the vanishing ideal I(X). From the point of view of applications, such as polynomial optimization, we are interested in rational function representations of small degree. We derive a general upper bound in terms of the Hilbert function of X, and we show that this upper bound is tight for the case of quadratic functions on the hypercube C={0,1}^n, a very well studied case in combinatorial optimization. Using the lower bounds for C we construct a family of globa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4199","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1402.4199","created_at":"2026-05-18T02:58:44.544336+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.4199v1","created_at":"2026-05-18T02:58:44.544336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4199","created_at":"2026-05-18T02:58:44.544336+00:00"},{"alias_kind":"pith_short_12","alias_value":"2SIDBADN4VY7","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"2SIDBADN4VY7OYR7","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"2SIDBADN","created_at":"2026-05-18T12:28:11.866339+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2SIDBADN4VY7OYR7ASFICVX4UQ","json":"https://pith.science/pith/2SIDBADN4VY7OYR7ASFICVX4UQ.json","graph_json":"https://pith.science/api/pith-number/2SIDBADN4VY7OYR7ASFICVX4UQ/graph.json","events_json":"https://pith.science/api/pith-number/2SIDBADN4VY7OYR7ASFICVX4UQ/events.json","paper":"https://pith.science/paper/2SIDBADN"},"agent_actions":{"view_html":"https://pith.science/pith/2SIDBADN4VY7OYR7ASFICVX4UQ","download_json":"https://pith.science/pith/2SIDBADN4VY7OYR7ASFICVX4UQ.json","view_paper":"https://pith.science/paper/2SIDBADN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.4199&json=true","fetch_graph":"https://pith.science/api/pith-number/2SIDBADN4VY7OYR7ASFICVX4UQ/graph.json","fetch_events":"https://pith.science/api/pith-number/2SIDBADN4VY7OYR7ASFICVX4UQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2SIDBADN4VY7OYR7ASFICVX4UQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2SIDBADN4VY7OYR7ASFICVX4UQ/action/storage_attestation","attest_author":"https://pith.science/pith/2SIDBADN4VY7OYR7ASFICVX4UQ/action/author_attestation","sign_citation":"https://pith.science/pith/2SIDBADN4VY7OYR7ASFICVX4UQ/action/citation_signature","submit_replication":"https://pith.science/pith/2SIDBADN4VY7OYR7ASFICVX4UQ/action/replication_record"}},"created_at":"2026-05-18T02:58:44.544336+00:00","updated_at":"2026-05-18T02:58:44.544336+00:00"}