{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:L2MAK646IVAUABKAPUK5A35NLS","short_pith_number":"pith:L2MAK646","schema_version":"1.0","canonical_sha256":"5e98057b9e45414005407d15d06fad5c94f511b27e0d287d4212efbdfa45802b","source":{"kind":"arxiv","id":"2606.21823","version":1},"attestation_state":"computed","paper":{"title":"Local-to-Global Exactness of SDP Relaxations for Sparse QCQPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Masakazu Kojima, Naohiko Arima, Sunyoung Kim","submitted_at":"2026-06-20T01:24:17Z","abstract_excerpt":"We study exact semidefinite programming (SDP) relaxation for a given sparse quadratically constrained quadratic program (QCQP). The SDP relaxation is exact if, whenever it has an optimal solution, it admits a rank-at-most-one optimal solution that corresponds to an optimal solution of the QCQP. Using the maximal cliques of a chordal extension of the aggregate sparsity pattern graph of the data matrices, we formulate the SDP relaxation in terms of clique-wise matrix variables and develop a local-to-global framework for certifying exactness. For each clique-wise matrix variable, we introduce a l"},"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":"2606.21823","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-20T01:24:17Z","cross_cats_sorted":[],"title_canon_sha256":"df1aa9c14f13cdb155eca022e03480ecd0a729b994de93f1edceffb5c7bc9575","abstract_canon_sha256":"35afaea112bccff0505f7d115da0872aac4b26da25105eab8c2b6559aac59c04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T01:13:23.777943Z","signature_b64":"50GxoJRAAl9oeliWhbIrRKqhrCLYAiXWO8eZLYy0lLaQyxJlT7Lq71Pp67bO1abfXUoqr5rCJhHLxzKIfcNsDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e98057b9e45414005407d15d06fad5c94f511b27e0d287d4212efbdfa45802b","last_reissued_at":"2026-06-23T01:13:23.777432Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T01:13:23.777432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local-to-Global Exactness of SDP Relaxations for Sparse QCQPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Masakazu Kojima, Naohiko Arima, Sunyoung Kim","submitted_at":"2026-06-20T01:24:17Z","abstract_excerpt":"We study exact semidefinite programming (SDP) relaxation for a given sparse quadratically constrained quadratic program (QCQP). The SDP relaxation is exact if, whenever it has an optimal solution, it admits a rank-at-most-one optimal solution that corresponds to an optimal solution of the QCQP. Using the maximal cliques of a chordal extension of the aggregate sparsity pattern graph of the data matrices, we formulate the SDP relaxation in terms of clique-wise matrix variables and develop a local-to-global framework for certifying exactness. For each clique-wise matrix variable, we introduce a l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.21823","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.21823/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":"2606.21823","created_at":"2026-06-23T01:13:23.777513+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.21823v1","created_at":"2026-06-23T01:13:23.777513+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21823","created_at":"2026-06-23T01:13:23.777513+00:00"},{"alias_kind":"pith_short_12","alias_value":"L2MAK646IVAU","created_at":"2026-06-23T01:13:23.777513+00:00"},{"alias_kind":"pith_short_16","alias_value":"L2MAK646IVAUABKA","created_at":"2026-06-23T01:13:23.777513+00:00"},{"alias_kind":"pith_short_8","alias_value":"L2MAK646","created_at":"2026-06-23T01:13:23.777513+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/L2MAK646IVAUABKAPUK5A35NLS","json":"https://pith.science/pith/L2MAK646IVAUABKAPUK5A35NLS.json","graph_json":"https://pith.science/api/pith-number/L2MAK646IVAUABKAPUK5A35NLS/graph.json","events_json":"https://pith.science/api/pith-number/L2MAK646IVAUABKAPUK5A35NLS/events.json","paper":"https://pith.science/paper/L2MAK646"},"agent_actions":{"view_html":"https://pith.science/pith/L2MAK646IVAUABKAPUK5A35NLS","download_json":"https://pith.science/pith/L2MAK646IVAUABKAPUK5A35NLS.json","view_paper":"https://pith.science/paper/L2MAK646","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.21823&json=true","fetch_graph":"https://pith.science/api/pith-number/L2MAK646IVAUABKAPUK5A35NLS/graph.json","fetch_events":"https://pith.science/api/pith-number/L2MAK646IVAUABKAPUK5A35NLS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L2MAK646IVAUABKAPUK5A35NLS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L2MAK646IVAUABKAPUK5A35NLS/action/storage_attestation","attest_author":"https://pith.science/pith/L2MAK646IVAUABKAPUK5A35NLS/action/author_attestation","sign_citation":"https://pith.science/pith/L2MAK646IVAUABKAPUK5A35NLS/action/citation_signature","submit_replication":"https://pith.science/pith/L2MAK646IVAUABKAPUK5A35NLS/action/replication_record"}},"created_at":"2026-06-23T01:13:23.777513+00:00","updated_at":"2026-06-23T01:13:23.777513+00:00"}