{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:XDDSP5VXWCTG3NDQGX5N6Z6FF7","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":"ac6b0cb6dde2f3f65c15202103616a6679b5c5c2883e0f40ece67d2bb447697c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-05-22T08:37:48Z","title_canon_sha256":"bd740d33825d94af9d5789a5a518987b3cdfcd743a02ea0472875e3ca7021a7b"},"schema_version":"1.0","source":{"id":"2405.13447","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.13447","created_at":"2026-06-03T01:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"2405.13447v2","created_at":"2026-06-03T01:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.13447","created_at":"2026-06-03T01:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"XDDSP5VXWCTG","created_at":"2026-06-03T01:05:03Z"},{"alias_kind":"pith_short_16","alias_value":"XDDSP5VXWCTG3NDQ","created_at":"2026-06-03T01:05:03Z"},{"alias_kind":"pith_short_8","alias_value":"XDDSP5VX","created_at":"2026-06-03T01:05:03Z"}],"graph_snapshots":[{"event_id":"sha256:cc6e4106c1f76222a6bf35e3571bf42af1f805e6ae306a53063aa58411e049a4","target":"graph","created_at":"2026-06-03T01:05:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2405.13447/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of minimizing a polynomial $f$ over the (binary) hypercube. We show that, for a specific set of polynomials, their binary non-negativity (i.e. on the hypercube) can be checked in polynomial time via minimum cut algorithms, from which we construct a linear programming representation for this set of polynomials. We categorize binary polynomials according to their signed support patterns and develop parameterized linear programming representations for binary non-negative polynomials. This allows the construction of signed certificates of binary non-negativity with adjustab","authors_text":"Leo Liberti, Liding Xu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-05-22T08:37:48Z","title":"Relaxations for binary polynomial optimization via signed certificates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.13447","kind":"arxiv","version":2},"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:e7edc51bb981589a9287272a43b3ab67857b1f8b703a09019c7f926bc54f3c40","target":"record","created_at":"2026-06-03T01:05:03Z","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":"ac6b0cb6dde2f3f65c15202103616a6679b5c5c2883e0f40ece67d2bb447697c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-05-22T08:37:48Z","title_canon_sha256":"bd740d33825d94af9d5789a5a518987b3cdfcd743a02ea0472875e3ca7021a7b"},"schema_version":"1.0","source":{"id":"2405.13447","kind":"arxiv","version":2}},"canonical_sha256":"b8c727f6b7b0a66db47035fadf67c52fc35fbdac091bfb896f066c402fe154b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8c727f6b7b0a66db47035fadf67c52fc35fbdac091bfb896f066c402fe154b5","first_computed_at":"2026-06-03T01:05:03.353403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T01:05:03.353403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IUIewZWFCplbFMyAzaACR8WDDUbAWbB02U74nCF2QsTkphHDvnavb77No9JaS52RTQPXXoMB8LuewM7RL8HTDw==","signature_status":"signed_v1","signed_at":"2026-06-03T01:05:03.353916Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.13447","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7edc51bb981589a9287272a43b3ab67857b1f8b703a09019c7f926bc54f3c40","sha256:cc6e4106c1f76222a6bf35e3571bf42af1f805e6ae306a53063aa58411e049a4"],"state_sha256":"fa90626010ed31a49648493c61ccabfd5a7d18e4e8ee21fe4cbeb6980638354e"}