{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GCRVF3YIQTARAQSAE6AC7GCXPR","short_pith_number":"pith:GCRVF3YI","schema_version":"1.0","canonical_sha256":"30a352ef0884c110424027802f98577c49c9dc01e59732db4e311053869c6c3f","source":{"kind":"arxiv","id":"1804.00761","version":1},"attestation_state":"computed","paper":{"title":"BBCPOP: A Sparse Doubly Nonnegative Relaxation of Polynomial Optimization Problems with Binary, Box and Complementarity Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Akiko Takeda, Kim-Chuan Toh, Masakazu Kojima, Naoki Ito, Sunyoung Kim","submitted_at":"2018-04-02T23:44:15Z","abstract_excerpt":"The software package BBCPOP is a MATLAB implementation of a hierarchy of sparse doubly nonnegative (DNN) relaxations of a class of polynomial optimization (minimization) problems (POPs) with binary, box and complementarity (BBC) constraints. Given a POP in the class and a relaxation order, BBCPOP constructs a simple conic optimization problem (COP), which serves as a DNN relaxation of the POP, and then solves the COP by applying the bisection and projection (BP) method. The COP is expressed with a linear objective function and constraints described as a single hyperplane and two cones, which a"},"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":"1804.00761","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-02T23:44:15Z","cross_cats_sorted":[],"title_canon_sha256":"d7aaa5f7189fccbaac46ff38f41b234317217288842061b411bf3d28d87c2c3f","abstract_canon_sha256":"51d6b7e1348448e3d0e86494ec65b9559620489563c5ff6c8036c530a3bfacd0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:32.249800Z","signature_b64":"xTNxKQycaYiN69EiNghh3cnMVdLPFwQCV+K6iUcY3dL4tuwPxXH058nMhYaNBAkFWwRe01xuUTVkNlvYBiAxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30a352ef0884c110424027802f98577c49c9dc01e59732db4e311053869c6c3f","last_reissued_at":"2026-05-18T00:19:32.249197Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:32.249197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BBCPOP: A Sparse Doubly Nonnegative Relaxation of Polynomial Optimization Problems with Binary, Box and Complementarity Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Akiko Takeda, Kim-Chuan Toh, Masakazu Kojima, Naoki Ito, Sunyoung Kim","submitted_at":"2018-04-02T23:44:15Z","abstract_excerpt":"The software package BBCPOP is a MATLAB implementation of a hierarchy of sparse doubly nonnegative (DNN) relaxations of a class of polynomial optimization (minimization) problems (POPs) with binary, box and complementarity (BBC) constraints. Given a POP in the class and a relaxation order, BBCPOP constructs a simple conic optimization problem (COP), which serves as a DNN relaxation of the POP, and then solves the COP by applying the bisection and projection (BP) method. The COP is expressed with a linear objective function and constraints described as a single hyperplane and two cones, which a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00761","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":"1804.00761","created_at":"2026-05-18T00:19:32.249288+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.00761v1","created_at":"2026-05-18T00:19:32.249288+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00761","created_at":"2026-05-18T00:19:32.249288+00:00"},{"alias_kind":"pith_short_12","alias_value":"GCRVF3YIQTAR","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GCRVF3YIQTARAQSA","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GCRVF3YI","created_at":"2026-05-18T12:32:25.280505+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/GCRVF3YIQTARAQSAE6AC7GCXPR","json":"https://pith.science/pith/GCRVF3YIQTARAQSAE6AC7GCXPR.json","graph_json":"https://pith.science/api/pith-number/GCRVF3YIQTARAQSAE6AC7GCXPR/graph.json","events_json":"https://pith.science/api/pith-number/GCRVF3YIQTARAQSAE6AC7GCXPR/events.json","paper":"https://pith.science/paper/GCRVF3YI"},"agent_actions":{"view_html":"https://pith.science/pith/GCRVF3YIQTARAQSAE6AC7GCXPR","download_json":"https://pith.science/pith/GCRVF3YIQTARAQSAE6AC7GCXPR.json","view_paper":"https://pith.science/paper/GCRVF3YI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.00761&json=true","fetch_graph":"https://pith.science/api/pith-number/GCRVF3YIQTARAQSAE6AC7GCXPR/graph.json","fetch_events":"https://pith.science/api/pith-number/GCRVF3YIQTARAQSAE6AC7GCXPR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GCRVF3YIQTARAQSAE6AC7GCXPR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GCRVF3YIQTARAQSAE6AC7GCXPR/action/storage_attestation","attest_author":"https://pith.science/pith/GCRVF3YIQTARAQSAE6AC7GCXPR/action/author_attestation","sign_citation":"https://pith.science/pith/GCRVF3YIQTARAQSAE6AC7GCXPR/action/citation_signature","submit_replication":"https://pith.science/pith/GCRVF3YIQTARAQSAE6AC7GCXPR/action/replication_record"}},"created_at":"2026-05-18T00:19:32.249288+00:00","updated_at":"2026-05-18T00:19:32.249288+00:00"}