{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MIWNEPAXNP3VTVVWDCIY2NAQOP","short_pith_number":"pith:MIWNEPAX","schema_version":"1.0","canonical_sha256":"622cd23c176bf759d6b618918d341073d437967f284c6ee114522867eac31b49","source":{"kind":"arxiv","id":"1404.5489","version":3},"attestation_state":"computed","paper":{"title":"Border Basis relaxation for polynomial optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"Bernard Mourrain (GALAAD2), Marta Abril Bucero (GALAAD2)","submitted_at":"2014-04-22T13:25:12Z","abstract_excerpt":"A relaxation method based on border basis reduction which improves the efficiency of Lasserre's approach is proposed to compute the optimum of a polynomial function on a basic closed semi algebraic set. A new stopping criterion is given to detect when the relaxation sequence reaches the minimum, using a sparse flat extension criterion. We also provide a new algorithm to reconstruct a finite sum of weighted Dirac measures from a truncated sequence of moments, which can be applied to other sparse reconstruction problems. As an application, we obtain a new algorithm to compute zero-dimensional mi"},"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":"1404.5489","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2014-04-22T13:25:12Z","cross_cats_sorted":[],"title_canon_sha256":"02c53305baf0025b12ca16046f977d6df0e8c8ae72ddc3bd19150161dd5318d1","abstract_canon_sha256":"164693eeddce1fd369b231ef8b8eadf2e504ace99282229e42be84ecb7b8621a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:55.549325Z","signature_b64":"49LLTdPgU9Hyh4KfUYXaNAWfsaffDqWTEV6+nqJAGdoxoYNl5MreTNiN/mHpDIDPmXMjjmxjkoqqAfwMsHSfBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"622cd23c176bf759d6b618918d341073d437967f284c6ee114522867eac31b49","last_reissued_at":"2026-05-18T01:34:55.548786Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:55.548786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Border Basis relaxation for polynomial optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"Bernard Mourrain (GALAAD2), Marta Abril Bucero (GALAAD2)","submitted_at":"2014-04-22T13:25:12Z","abstract_excerpt":"A relaxation method based on border basis reduction which improves the efficiency of Lasserre's approach is proposed to compute the optimum of a polynomial function on a basic closed semi algebraic set. A new stopping criterion is given to detect when the relaxation sequence reaches the minimum, using a sparse flat extension criterion. We also provide a new algorithm to reconstruct a finite sum of weighted Dirac measures from a truncated sequence of moments, which can be applied to other sparse reconstruction problems. As an application, we obtain a new algorithm to compute zero-dimensional mi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5489","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1404.5489","created_at":"2026-05-18T01:34:55.548851+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.5489v3","created_at":"2026-05-18T01:34:55.548851+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5489","created_at":"2026-05-18T01:34:55.548851+00:00"},{"alias_kind":"pith_short_12","alias_value":"MIWNEPAXNP3V","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MIWNEPAXNP3VTVVW","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MIWNEPAX","created_at":"2026-05-18T12:28:38.356838+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/MIWNEPAXNP3VTVVWDCIY2NAQOP","json":"https://pith.science/pith/MIWNEPAXNP3VTVVWDCIY2NAQOP.json","graph_json":"https://pith.science/api/pith-number/MIWNEPAXNP3VTVVWDCIY2NAQOP/graph.json","events_json":"https://pith.science/api/pith-number/MIWNEPAXNP3VTVVWDCIY2NAQOP/events.json","paper":"https://pith.science/paper/MIWNEPAX"},"agent_actions":{"view_html":"https://pith.science/pith/MIWNEPAXNP3VTVVWDCIY2NAQOP","download_json":"https://pith.science/pith/MIWNEPAXNP3VTVVWDCIY2NAQOP.json","view_paper":"https://pith.science/paper/MIWNEPAX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.5489&json=true","fetch_graph":"https://pith.science/api/pith-number/MIWNEPAXNP3VTVVWDCIY2NAQOP/graph.json","fetch_events":"https://pith.science/api/pith-number/MIWNEPAXNP3VTVVWDCIY2NAQOP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MIWNEPAXNP3VTVVWDCIY2NAQOP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MIWNEPAXNP3VTVVWDCIY2NAQOP/action/storage_attestation","attest_author":"https://pith.science/pith/MIWNEPAXNP3VTVVWDCIY2NAQOP/action/author_attestation","sign_citation":"https://pith.science/pith/MIWNEPAXNP3VTVVWDCIY2NAQOP/action/citation_signature","submit_replication":"https://pith.science/pith/MIWNEPAXNP3VTVVWDCIY2NAQOP/action/replication_record"}},"created_at":"2026-05-18T01:34:55.548851+00:00","updated_at":"2026-05-18T01:34:55.548851+00:00"}