{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DLY6KUY5KXXVYZFS7V5XIAN2TT","short_pith_number":"pith:DLY6KUY5","schema_version":"1.0","canonical_sha256":"1af1e5531d55ef5c64b2fd7b7401ba9ceddd63d9e4b63d4548beebd2a1c67f14","source":{"kind":"arxiv","id":"1607.01151","version":3},"attestation_state":"computed","paper":{"title":"Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jean-Bernard Lasserre (IMT, Kim-Chuan Toh (NUS), LAAS-MAC), Tillmann Weisser (LAAS-MAC)","submitted_at":"2016-07-05T08:56:00Z","abstract_excerpt":"We provide a sparse version of the bounded degree SOS hierarchy BSOS [7] for polynomial optimization problems. It permits to treat large scale problems which satisfy a structured sparsity pattern. When the sparsity pattern satisfies the running intersection property this Sparse-BSOS hierarchy of semidefinite programs (with semidefinite constraints of fixed size) converges to the global optimum of the original problem. Moreover, for the class of SOS-convex problems, finite convergence takes place at the first step of the hierarchy, just as in the dense version."},"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":"1607.01151","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-05T08:56:00Z","cross_cats_sorted":[],"title_canon_sha256":"e4dcbfc71598ab5d7eb03dd400f7e911dcf607a9a14a36c8ecc66fee0a1bf51e","abstract_canon_sha256":"d98805ab663cdd5c209a996d90f712a91c08205741bfe364e0a84f68d2bc0166"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:35.765106Z","signature_b64":"/eY27lr1EDfjsM+2ShgWwVGlYh5k13bdcgyj9xysLrV7VsmA36uVX9hvtDJdnYGBMAxmtl1Ft953dWQbAgoADg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1af1e5531d55ef5c64b2fd7b7401ba9ceddd63d9e4b63d4548beebd2a1c67f14","last_reissued_at":"2026-05-18T00:43:35.764699Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:35.764699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jean-Bernard Lasserre (IMT, Kim-Chuan Toh (NUS), LAAS-MAC), Tillmann Weisser (LAAS-MAC)","submitted_at":"2016-07-05T08:56:00Z","abstract_excerpt":"We provide a sparse version of the bounded degree SOS hierarchy BSOS [7] for polynomial optimization problems. It permits to treat large scale problems which satisfy a structured sparsity pattern. When the sparsity pattern satisfies the running intersection property this Sparse-BSOS hierarchy of semidefinite programs (with semidefinite constraints of fixed size) converges to the global optimum of the original problem. Moreover, for the class of SOS-convex problems, finite convergence takes place at the first step of the hierarchy, just as in the dense version."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01151","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":"1607.01151","created_at":"2026-05-18T00:43:35.764757+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.01151v3","created_at":"2026-05-18T00:43:35.764757+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01151","created_at":"2026-05-18T00:43:35.764757+00:00"},{"alias_kind":"pith_short_12","alias_value":"DLY6KUY5KXXV","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DLY6KUY5KXXVYZFS","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DLY6KUY5","created_at":"2026-05-18T12:30:12.583610+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/DLY6KUY5KXXVYZFS7V5XIAN2TT","json":"https://pith.science/pith/DLY6KUY5KXXVYZFS7V5XIAN2TT.json","graph_json":"https://pith.science/api/pith-number/DLY6KUY5KXXVYZFS7V5XIAN2TT/graph.json","events_json":"https://pith.science/api/pith-number/DLY6KUY5KXXVYZFS7V5XIAN2TT/events.json","paper":"https://pith.science/paper/DLY6KUY5"},"agent_actions":{"view_html":"https://pith.science/pith/DLY6KUY5KXXVYZFS7V5XIAN2TT","download_json":"https://pith.science/pith/DLY6KUY5KXXVYZFS7V5XIAN2TT.json","view_paper":"https://pith.science/paper/DLY6KUY5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.01151&json=true","fetch_graph":"https://pith.science/api/pith-number/DLY6KUY5KXXVYZFS7V5XIAN2TT/graph.json","fetch_events":"https://pith.science/api/pith-number/DLY6KUY5KXXVYZFS7V5XIAN2TT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DLY6KUY5KXXVYZFS7V5XIAN2TT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DLY6KUY5KXXVYZFS7V5XIAN2TT/action/storage_attestation","attest_author":"https://pith.science/pith/DLY6KUY5KXXVYZFS7V5XIAN2TT/action/author_attestation","sign_citation":"https://pith.science/pith/DLY6KUY5KXXVYZFS7V5XIAN2TT/action/citation_signature","submit_replication":"https://pith.science/pith/DLY6KUY5KXXVYZFS7V5XIAN2TT/action/replication_record"}},"created_at":"2026-05-18T00:43:35.764757+00:00","updated_at":"2026-05-18T00:43:35.764757+00:00"}