{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:Z4IMMWTQKTAFAPHTHEF5EGM2E5","short_pith_number":"pith:Z4IMMWTQ","schema_version":"1.0","canonical_sha256":"cf10c65a7054c0503cf3390bd2199a275bbadab47599b7563ee4bc1fccdff80f","source":{"kind":"arxiv","id":"2306.09865","version":2},"attestation_state":"computed","paper":{"title":"On Integrality in Semidefinite Programming for Discrete Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Frank de Meijer, Renata Sotirov","submitted_at":"2023-06-16T14:27:29Z","abstract_excerpt":"It is well-known that by adding integrality constraints to the semidefinite programming (SDP) relaxation of the max-cut problem, the resulting integer semidefinite program is an exact formulation of the problem. In this paper we show similar results for a wide variety of discrete optimization problems for which SDP relaxations have been derived. Based on a comprehensive study on discrete positive semidefinite matrices, we introduce a generic approach to derive mixed-integer semidefinite programming (MISDP) formulations of binary quadratically constrained quadratic programs and binary quadratic"},"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":"2306.09865","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-06-16T14:27:29Z","cross_cats_sorted":[],"title_canon_sha256":"94d757c85eecfb3407196f7a78fdfaf39a4d1a96c48b33a8d45f67972a0a12ec","abstract_canon_sha256":"51aa62ac7e3539d970c5fbe464e3bc7ecf878fc533be74097b064077ea3c155b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:10:25.652288Z","signature_b64":"M7GExtSqswreObfreW83cYcMNHJwfTDNRKzxBT9Htyw9L947JZVQPMqFHTis4xcrmJ39zgLvE5hjrG3oqBYvBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf10c65a7054c0503cf3390bd2199a275bbadab47599b7563ee4bc1fccdff80f","last_reissued_at":"2026-07-05T07:10:25.651813Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:10:25.651813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Integrality in Semidefinite Programming for Discrete Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Frank de Meijer, Renata Sotirov","submitted_at":"2023-06-16T14:27:29Z","abstract_excerpt":"It is well-known that by adding integrality constraints to the semidefinite programming (SDP) relaxation of the max-cut problem, the resulting integer semidefinite program is an exact formulation of the problem. In this paper we show similar results for a wide variety of discrete optimization problems for which SDP relaxations have been derived. Based on a comprehensive study on discrete positive semidefinite matrices, we introduce a generic approach to derive mixed-integer semidefinite programming (MISDP) formulations of binary quadratically constrained quadratic programs and binary quadratic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.09865","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.09865/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2306.09865","created_at":"2026-07-05T07:10:25.651865+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.09865v2","created_at":"2026-07-05T07:10:25.651865+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.09865","created_at":"2026-07-05T07:10:25.651865+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z4IMMWTQKTAF","created_at":"2026-07-05T07:10:25.651865+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z4IMMWTQKTAFAPHT","created_at":"2026-07-05T07:10:25.651865+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z4IMMWTQ","created_at":"2026-07-05T07:10:25.651865+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.18265","citing_title":"Spectral Outer-Approximation Algorithms for Binary Semidefinite Problems","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z4IMMWTQKTAFAPHTHEF5EGM2E5","json":"https://pith.science/pith/Z4IMMWTQKTAFAPHTHEF5EGM2E5.json","graph_json":"https://pith.science/api/pith-number/Z4IMMWTQKTAFAPHTHEF5EGM2E5/graph.json","events_json":"https://pith.science/api/pith-number/Z4IMMWTQKTAFAPHTHEF5EGM2E5/events.json","paper":"https://pith.science/paper/Z4IMMWTQ"},"agent_actions":{"view_html":"https://pith.science/pith/Z4IMMWTQKTAFAPHTHEF5EGM2E5","download_json":"https://pith.science/pith/Z4IMMWTQKTAFAPHTHEF5EGM2E5.json","view_paper":"https://pith.science/paper/Z4IMMWTQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.09865&json=true","fetch_graph":"https://pith.science/api/pith-number/Z4IMMWTQKTAFAPHTHEF5EGM2E5/graph.json","fetch_events":"https://pith.science/api/pith-number/Z4IMMWTQKTAFAPHTHEF5EGM2E5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z4IMMWTQKTAFAPHTHEF5EGM2E5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z4IMMWTQKTAFAPHTHEF5EGM2E5/action/storage_attestation","attest_author":"https://pith.science/pith/Z4IMMWTQKTAFAPHTHEF5EGM2E5/action/author_attestation","sign_citation":"https://pith.science/pith/Z4IMMWTQKTAFAPHTHEF5EGM2E5/action/citation_signature","submit_replication":"https://pith.science/pith/Z4IMMWTQKTAFAPHTHEF5EGM2E5/action/replication_record"}},"created_at":"2026-07-05T07:10:25.651865+00:00","updated_at":"2026-07-05T07:10:25.651865+00:00"}