{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:M2TEAIOM2DG2PYNUAVAAVXGUCS","short_pith_number":"pith:M2TEAIOM","canonical_record":{"source":{"id":"1802.10004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-27T16:23:42Z","cross_cats_sorted":["cs.CC","math.AG","math.OC"],"title_canon_sha256":"51e471fb38784b95649e3d3653547c5ae396bd14e94d1a2accb66a29bcda0895","abstract_canon_sha256":"08d020166b70c9326d357c7ba428a03692a25bdaf62a204e82ed069c76495a29"},"schema_version":"1.0"},"canonical_sha256":"66a64021ccd0cda7e1b405400adcd414b092153e6a049517098980bb7057fd7a","source":{"kind":"arxiv","id":"1802.10004","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.10004","created_at":"2026-05-18T00:22:21Z"},{"alias_kind":"arxiv_version","alias_value":"1802.10004v1","created_at":"2026-05-18T00:22:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10004","created_at":"2026-05-18T00:22:21Z"},{"alias_kind":"pith_short_12","alias_value":"M2TEAIOM2DG2","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"M2TEAIOM2DG2PYNU","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"M2TEAIOM","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:M2TEAIOM2DG2PYNUAVAAVXGUCS","target":"record","payload":{"canonical_record":{"source":{"id":"1802.10004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-27T16:23:42Z","cross_cats_sorted":["cs.CC","math.AG","math.OC"],"title_canon_sha256":"51e471fb38784b95649e3d3653547c5ae396bd14e94d1a2accb66a29bcda0895","abstract_canon_sha256":"08d020166b70c9326d357c7ba428a03692a25bdaf62a204e82ed069c76495a29"},"schema_version":"1.0"},"canonical_sha256":"66a64021ccd0cda7e1b405400adcd414b092153e6a049517098980bb7057fd7a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:21.618928Z","signature_b64":"HywpzrD5wNa+PIJKqeZYk4ULq58TXvYbn+duSCbvsbffyND+oaDNR6vl/47t3vWpKa02e/ymWY2dxO0NcMQBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66a64021ccd0cda7e1b405400adcd414b092153e6a049517098980bb7057fd7a","last_reissued_at":"2026-05-18T00:22:21.618395Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:21.618395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.10004","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:22:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X0pfcNquFKTyZ1d/t5RxbG+y5PN89YfmCWiV5L6RwJBx+rcGuuCs+YlB0jx6nNK3o5yHgciM2J7/1VG42LhsDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:38:51.071710Z"},"content_sha256":"a119404dd152cf77d9fba75802c2170349bab189b04e02662412c4b9295a65fb","schema_version":"1.0","event_id":"sha256:a119404dd152cf77d9fba75802c2170349bab189b04e02662412c4b9295a65fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:M2TEAIOM2DG2PYNUAVAAVXGUCS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.AG","math.OC"],"primary_cat":"cs.DS","authors_text":"Adam Kurpisz, Mareike Dressler, Timo de Wolff","submitted_at":"2018-02-27T16:23:42Z","abstract_excerpt":"Various key problems from theoretical computer science can be expressed as polynomial optimization problems over the boolean hypercube. One particularly successful way to prove complexity bounds for these types of problems are based on sums of squares (SOS) as nonnegativity certificates. In this article, we initiate the analysis of optimization problems over the boolean hypercube via a recent, alternative certificate called sums of nonnegative circuit polynomials (SONC). We show that key results for SOS based certificates remain valid: First, for polynomials, which are nonnegative over the $n$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10004","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:22:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+YJdYLSXEUJ0rMvC6qBCVWADYHX8E2QJnRd7Lg/vTOddZLDMtF0FzgTzP+ssiH5+wVGma6sAymNZcjzqM4IGAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:38:51.072050Z"},"content_sha256":"0e0595a0dc2633285d069646651399b8db172799bcac258244a85e67c21159e6","schema_version":"1.0","event_id":"sha256:0e0595a0dc2633285d069646651399b8db172799bcac258244a85e67c21159e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M2TEAIOM2DG2PYNUAVAAVXGUCS/bundle.json","state_url":"https://pith.science/pith/M2TEAIOM2DG2PYNUAVAAVXGUCS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M2TEAIOM2DG2PYNUAVAAVXGUCS/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-06-22T22:38:51Z","links":{"resolver":"https://pith.science/pith/M2TEAIOM2DG2PYNUAVAAVXGUCS","bundle":"https://pith.science/pith/M2TEAIOM2DG2PYNUAVAAVXGUCS/bundle.json","state":"https://pith.science/pith/M2TEAIOM2DG2PYNUAVAAVXGUCS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M2TEAIOM2DG2PYNUAVAAVXGUCS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:M2TEAIOM2DG2PYNUAVAAVXGUCS","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":"08d020166b70c9326d357c7ba428a03692a25bdaf62a204e82ed069c76495a29","cross_cats_sorted":["cs.CC","math.AG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-27T16:23:42Z","title_canon_sha256":"51e471fb38784b95649e3d3653547c5ae396bd14e94d1a2accb66a29bcda0895"},"schema_version":"1.0","source":{"id":"1802.10004","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.10004","created_at":"2026-05-18T00:22:21Z"},{"alias_kind":"arxiv_version","alias_value":"1802.10004v1","created_at":"2026-05-18T00:22:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10004","created_at":"2026-05-18T00:22:21Z"},{"alias_kind":"pith_short_12","alias_value":"M2TEAIOM2DG2","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"M2TEAIOM2DG2PYNU","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"M2TEAIOM","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:0e0595a0dc2633285d069646651399b8db172799bcac258244a85e67c21159e6","target":"graph","created_at":"2026-05-18T00:22:21Z","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":"Various key problems from theoretical computer science can be expressed as polynomial optimization problems over the boolean hypercube. One particularly successful way to prove complexity bounds for these types of problems are based on sums of squares (SOS) as nonnegativity certificates. In this article, we initiate the analysis of optimization problems over the boolean hypercube via a recent, alternative certificate called sums of nonnegative circuit polynomials (SONC). We show that key results for SOS based certificates remain valid: First, for polynomials, which are nonnegative over the $n$","authors_text":"Adam Kurpisz, Mareike Dressler, Timo de Wolff","cross_cats":["cs.CC","math.AG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-27T16:23:42Z","title":"Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10004","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:a119404dd152cf77d9fba75802c2170349bab189b04e02662412c4b9295a65fb","target":"record","created_at":"2026-05-18T00:22:21Z","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":"08d020166b70c9326d357c7ba428a03692a25bdaf62a204e82ed069c76495a29","cross_cats_sorted":["cs.CC","math.AG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-27T16:23:42Z","title_canon_sha256":"51e471fb38784b95649e3d3653547c5ae396bd14e94d1a2accb66a29bcda0895"},"schema_version":"1.0","source":{"id":"1802.10004","kind":"arxiv","version":1}},"canonical_sha256":"66a64021ccd0cda7e1b405400adcd414b092153e6a049517098980bb7057fd7a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66a64021ccd0cda7e1b405400adcd414b092153e6a049517098980bb7057fd7a","first_computed_at":"2026-05-18T00:22:21.618395Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:21.618395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HywpzrD5wNa+PIJKqeZYk4ULq58TXvYbn+duSCbvsbffyND+oaDNR6vl/47t3vWpKa02e/ymWY2dxO0NcMQBBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:21.618928Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.10004","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a119404dd152cf77d9fba75802c2170349bab189b04e02662412c4b9295a65fb","sha256:0e0595a0dc2633285d069646651399b8db172799bcac258244a85e67c21159e6"],"state_sha256":"c256173e78e139e67d1010e82ef33a0424f48d061b4a943400b5dc73370ed683"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ywEAX2mCoZBxQHmufXNDwcmRjmqfA0A2V4ax1o5ucp/GnYPdiMCqrT0fAA85qPw7bwdqdMrZVAMmreBStcV8BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T22:38:51.073969Z","bundle_sha256":"8211fd7c6557c23eebf1416f4579a42684cbea38dd2e196ffd710c5cd5a50165"}}