{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:L2MAK646IVAUABKAPUK5A35NLS","short_pith_number":"pith:L2MAK646","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"},"canonical_sha256":"5e98057b9e45414005407d15d06fad5c94f511b27e0d287d4212efbdfa45802b","source":{"kind":"arxiv","id":"2606.21823","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.21823","created_at":"2026-06-23T01:13:23Z"},{"alias_kind":"arxiv_version","alias_value":"2606.21823v1","created_at":"2026-06-23T01:13:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21823","created_at":"2026-06-23T01:13:23Z"},{"alias_kind":"pith_short_12","alias_value":"L2MAK646IVAU","created_at":"2026-06-23T01:13:23Z"},{"alias_kind":"pith_short_16","alias_value":"L2MAK646IVAUABKA","created_at":"2026-06-23T01:13:23Z"},{"alias_kind":"pith_short_8","alias_value":"L2MAK646","created_at":"2026-06-23T01:13:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:L2MAK646IVAUABKAPUK5A35NLS","target":"record","payload":{"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"},"canonical_sha256":"5e98057b9e45414005407d15d06fad5c94f511b27e0d287d4212efbdfa45802b","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"},"source_kind":"arxiv","source_id":"2606.21823","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-06-23T01:13:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HxjCvMQH8BSJWMA2WkIkMt/27BRmDGsUgPuULYJO7ZJlpkaxEt9/W17gr2SKh9Fye4Vj0uygB0M+7oYEVtIOAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T11:03:39.220607Z"},"content_sha256":"fbe5a4d22c38190ab96dc412a0f5d0b19410b89acefbfd5a036509997f53134c","schema_version":"1.0","event_id":"sha256:fbe5a4d22c38190ab96dc412a0f5d0b19410b89acefbfd5a036509997f53134c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:L2MAK646IVAUABKAPUK5A35NLS","target":"graph","payload":{"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"},"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-06-23T01:13:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5WEZwo83N5hcNUFkvCJ4FmENbPY4krrzlunKBsVhelDJYPHU2nZW3ChNBLfdZ/m+APg422lQe7lAky3jqHtFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T11:03:39.220983Z"},"content_sha256":"0ff640ae75fcef8932fcf71c9e50d16099bb30614956eb748826b3b2ea9a08dc","schema_version":"1.0","event_id":"sha256:0ff640ae75fcef8932fcf71c9e50d16099bb30614956eb748826b3b2ea9a08dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L2MAK646IVAUABKAPUK5A35NLS/bundle.json","state_url":"https://pith.science/pith/L2MAK646IVAUABKAPUK5A35NLS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L2MAK646IVAUABKAPUK5A35NLS/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-07-05T11:03:39Z","links":{"resolver":"https://pith.science/pith/L2MAK646IVAUABKAPUK5A35NLS","bundle":"https://pith.science/pith/L2MAK646IVAUABKAPUK5A35NLS/bundle.json","state":"https://pith.science/pith/L2MAK646IVAUABKAPUK5A35NLS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L2MAK646IVAUABKAPUK5A35NLS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:L2MAK646IVAUABKAPUK5A35NLS","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":"35afaea112bccff0505f7d115da0872aac4b26da25105eab8c2b6559aac59c04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-20T01:24:17Z","title_canon_sha256":"df1aa9c14f13cdb155eca022e03480ecd0a729b994de93f1edceffb5c7bc9575"},"schema_version":"1.0","source":{"id":"2606.21823","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.21823","created_at":"2026-06-23T01:13:23Z"},{"alias_kind":"arxiv_version","alias_value":"2606.21823v1","created_at":"2026-06-23T01:13:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21823","created_at":"2026-06-23T01:13:23Z"},{"alias_kind":"pith_short_12","alias_value":"L2MAK646IVAU","created_at":"2026-06-23T01:13:23Z"},{"alias_kind":"pith_short_16","alias_value":"L2MAK646IVAUABKA","created_at":"2026-06-23T01:13:23Z"},{"alias_kind":"pith_short_8","alias_value":"L2MAK646","created_at":"2026-06-23T01:13:23Z"}],"graph_snapshots":[{"event_id":"sha256:0ff640ae75fcef8932fcf71c9e50d16099bb30614956eb748826b3b2ea9a08dc","target":"graph","created_at":"2026-06-23T01:13:23Z","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/2606.21823/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Masakazu Kojima, Naohiko Arima, Sunyoung Kim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-20T01:24:17Z","title":"Local-to-Global Exactness of SDP Relaxations for Sparse QCQPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.21823","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:fbe5a4d22c38190ab96dc412a0f5d0b19410b89acefbfd5a036509997f53134c","target":"record","created_at":"2026-06-23T01:13:23Z","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":"35afaea112bccff0505f7d115da0872aac4b26da25105eab8c2b6559aac59c04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-20T01:24:17Z","title_canon_sha256":"df1aa9c14f13cdb155eca022e03480ecd0a729b994de93f1edceffb5c7bc9575"},"schema_version":"1.0","source":{"id":"2606.21823","kind":"arxiv","version":1}},"canonical_sha256":"5e98057b9e45414005407d15d06fad5c94f511b27e0d287d4212efbdfa45802b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e98057b9e45414005407d15d06fad5c94f511b27e0d287d4212efbdfa45802b","first_computed_at":"2026-06-23T01:13:23.777432Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T01:13:23.777432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"50GxoJRAAl9oeliWhbIrRKqhrCLYAiXWO8eZLYy0lLaQyxJlT7Lq71Pp67bO1abfXUoqr5rCJhHLxzKIfcNsDw==","signature_status":"signed_v1","signed_at":"2026-06-23T01:13:23.777943Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.21823","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fbe5a4d22c38190ab96dc412a0f5d0b19410b89acefbfd5a036509997f53134c","sha256:0ff640ae75fcef8932fcf71c9e50d16099bb30614956eb748826b3b2ea9a08dc"],"state_sha256":"c09363265e609457eb18aa33f13483a86a03e5d9e762db579fcc0f3cabe62ed5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O+OSVbnMopky/YYGrBrTJLICR01fnhKgStAvw9ao0tGidgFwwsrCutVz4ZVACGt9YelHW+vuj/gbWcPioJphAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T11:03:39.222948Z","bundle_sha256":"f02c92c37b278bd4876fcc76c21f478df9db858b29593be866075b516173cdff"}}