{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GCRVF3YIQTARAQSAE6AC7GCXPR","short_pith_number":"pith:GCRVF3YI","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"},"canonical_sha256":"30a352ef0884c110424027802f98577c49c9dc01e59732db4e311053869c6c3f","source":{"kind":"arxiv","id":"1804.00761","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00761","created_at":"2026-05-18T00:19:32Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00761v1","created_at":"2026-05-18T00:19:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00761","created_at":"2026-05-18T00:19:32Z"},{"alias_kind":"pith_short_12","alias_value":"GCRVF3YIQTAR","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GCRVF3YIQTARAQSA","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GCRVF3YI","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GCRVF3YIQTARAQSAE6AC7GCXPR","target":"record","payload":{"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"},"canonical_sha256":"30a352ef0884c110424027802f98577c49c9dc01e59732db4e311053869c6c3f","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"},"source_kind":"arxiv","source_id":"1804.00761","source_version":1,"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-18T00:19:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cbWjJW0/yBASDyhm9rp7wzHperZTYPCccaNLraeiimBAPR1FmDJak23J3AKBbSLbDuyjBCGr76snX+igvxU8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:01:48.671539Z"},"content_sha256":"87ebe4e74f3724935efc0974a0b8c27968a0317058042148df00dcb0eb5e1512","schema_version":"1.0","event_id":"sha256:87ebe4e74f3724935efc0974a0b8c27968a0317058042148df00dcb0eb5e1512"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GCRVF3YIQTARAQSAE6AC7GCXPR","target":"graph","payload":{"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"},"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-18T00:19:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bg5FPg6DOoxEzSzZVuHByVBPfgLtIkhw4KJn2msHp3eIctnlZtid0YM2HBY06fk94lBlI/LcXNBWH53g2BSJAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:01:48.672267Z"},"content_sha256":"8d68f6c6500cd865ec75479c2dbb6cd80d3b54b27c7420fa6fc65fb3b92295ad","schema_version":"1.0","event_id":"sha256:8d68f6c6500cd865ec75479c2dbb6cd80d3b54b27c7420fa6fc65fb3b92295ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GCRVF3YIQTARAQSAE6AC7GCXPR/bundle.json","state_url":"https://pith.science/pith/GCRVF3YIQTARAQSAE6AC7GCXPR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GCRVF3YIQTARAQSAE6AC7GCXPR/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-25T18:01:48Z","links":{"resolver":"https://pith.science/pith/GCRVF3YIQTARAQSAE6AC7GCXPR","bundle":"https://pith.science/pith/GCRVF3YIQTARAQSAE6AC7GCXPR/bundle.json","state":"https://pith.science/pith/GCRVF3YIQTARAQSAE6AC7GCXPR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GCRVF3YIQTARAQSAE6AC7GCXPR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GCRVF3YIQTARAQSAE6AC7GCXPR","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":"51d6b7e1348448e3d0e86494ec65b9559620489563c5ff6c8036c530a3bfacd0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-02T23:44:15Z","title_canon_sha256":"d7aaa5f7189fccbaac46ff38f41b234317217288842061b411bf3d28d87c2c3f"},"schema_version":"1.0","source":{"id":"1804.00761","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00761","created_at":"2026-05-18T00:19:32Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00761v1","created_at":"2026-05-18T00:19:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00761","created_at":"2026-05-18T00:19:32Z"},{"alias_kind":"pith_short_12","alias_value":"GCRVF3YIQTAR","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GCRVF3YIQTARAQSA","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GCRVF3YI","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:8d68f6c6500cd865ec75479c2dbb6cd80d3b54b27c7420fa6fc65fb3b92295ad","target":"graph","created_at":"2026-05-18T00:19:32Z","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":"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","authors_text":"Akiko Takeda, Kim-Chuan Toh, Masakazu Kojima, Naoki Ito, Sunyoung Kim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-02T23:44:15Z","title":"BBCPOP: A Sparse Doubly Nonnegative Relaxation of Polynomial Optimization Problems with Binary, Box and Complementarity Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00761","kind":"arxiv","version":1},"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:87ebe4e74f3724935efc0974a0b8c27968a0317058042148df00dcb0eb5e1512","target":"record","created_at":"2026-05-18T00:19:32Z","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":"51d6b7e1348448e3d0e86494ec65b9559620489563c5ff6c8036c530a3bfacd0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-02T23:44:15Z","title_canon_sha256":"d7aaa5f7189fccbaac46ff38f41b234317217288842061b411bf3d28d87c2c3f"},"schema_version":"1.0","source":{"id":"1804.00761","kind":"arxiv","version":1}},"canonical_sha256":"30a352ef0884c110424027802f98577c49c9dc01e59732db4e311053869c6c3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30a352ef0884c110424027802f98577c49c9dc01e59732db4e311053869c6c3f","first_computed_at":"2026-05-18T00:19:32.249197Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:32.249197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xTNxKQycaYiN69EiNghh3cnMVdLPFwQCV+K6iUcY3dL4tuwPxXH058nMhYaNBAkFWwRe01xuUTVkNlvYBiAxDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:32.249800Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.00761","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87ebe4e74f3724935efc0974a0b8c27968a0317058042148df00dcb0eb5e1512","sha256:8d68f6c6500cd865ec75479c2dbb6cd80d3b54b27c7420fa6fc65fb3b92295ad"],"state_sha256":"2ffe9048f0ce9c87eb16bbbbeb022b7259d253b5918e8fd9a5e40347bcab548a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lfZ3ZlDOQMqRsBfoojV2GbgArgiaiZvtUhR5sXkfGYe3s04uXAE92PuBMihGy/J+CQ0BFUVEl2x3VSY0aFxkCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:01:48.676396Z","bundle_sha256":"ade7c2d00fc58fca1b3d44225a1f312fc407281ecc38bb4a3e1a161e509161be"}}