{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VDJYTCBSX3ELACJSBKEHQ5PWNO","short_pith_number":"pith:VDJYTCBS","canonical_record":{"source":{"id":"1609.02609","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-08T21:55:07Z","cross_cats_sorted":[],"title_canon_sha256":"fa021d2e1f69a59c09a613dd3442068451b3cd0ec39eb36dee15c15feb86da4b","abstract_canon_sha256":"9be7c0ff05661f18dd0b72e7efd76dc1040b4a18472073574bacf95c44e73129"},"schema_version":"1.0"},"canonical_sha256":"a8d3898832bec8b009320a887875f66bbcfb4e161de14e83310cbcd765eafa99","source":{"kind":"arxiv","id":"1609.02609","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.02609","created_at":"2026-05-18T01:04:52Z"},{"alias_kind":"arxiv_version","alias_value":"1609.02609v1","created_at":"2026-05-18T01:04:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02609","created_at":"2026-05-18T01:04:52Z"},{"alias_kind":"pith_short_12","alias_value":"VDJYTCBSX3EL","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VDJYTCBSX3ELACJS","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VDJYTCBS","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VDJYTCBSX3ELACJSBKEHQ5PWNO","target":"record","payload":{"canonical_record":{"source":{"id":"1609.02609","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-08T21:55:07Z","cross_cats_sorted":[],"title_canon_sha256":"fa021d2e1f69a59c09a613dd3442068451b3cd0ec39eb36dee15c15feb86da4b","abstract_canon_sha256":"9be7c0ff05661f18dd0b72e7efd76dc1040b4a18472073574bacf95c44e73129"},"schema_version":"1.0"},"canonical_sha256":"a8d3898832bec8b009320a887875f66bbcfb4e161de14e83310cbcd765eafa99","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:52.978946Z","signature_b64":"hNqXxPvE3RVIRIq4g93hXvLTBPKS8NMoaSzwz9by3OmHeOVGgXTm5QVA+wztwNk+GWhMQLVdsUxslO/Ys84/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8d3898832bec8b009320a887875f66bbcfb4e161de14e83310cbcd765eafa99","last_reissued_at":"2026-05-18T01:04:52.978491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:52.978491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.02609","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-18T01:04:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R6MtNEU33URTSSWPRNdbQMWF/SdP1x2yDJYjUrsw0s/MW2jWOOwbnVC/OHRP4879q8TEEeNXcplIOMb8wze+Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:29:32.977935Z"},"content_sha256":"beceeec1fa0052b930a412c31f8bbd11530fd46bb0590c0cacda93bb8ca92d14","schema_version":"1.0","event_id":"sha256:beceeec1fa0052b930a412c31f8bbd11530fd46bb0590c0cacda93bb8ca92d14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VDJYTCBSX3ELACJSBKEHQ5PWNO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Iterative Method for Nonconvex Quadratically Constrained Quadratic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chuangchuang Sun, Ran Dai","submitted_at":"2016-09-08T21:55:07Z","abstract_excerpt":"This paper examines the nonconvex quadratically constrained quadratic programming (QCQP) problems using an iterative method. One of the existing approaches for solving nonconvex QCQP problems relaxes the rank one constraint on the unknown matrix into semidefinite constraint to obtain the bound on the optimal value without finding the exact solution. By reconsidering the rank one matrix, an iterative rank minimization (IRM) method is proposed to gradually approach the rank one constraint. Each iteration of IRM is formulated as a convex problem with semidefinite constraints. An augmented Lagrang"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.02609","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-18T01:04:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zoN/yFvYnDis3UMWrs965LnhYZsV9vC6+d34oC4vYc7o1Z46sxFykMd37jaN9Ok5u5NTZf87iJ5ytaaXmiylAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:29:32.978777Z"},"content_sha256":"f329929d8b24d0d34df2683a6c6c59b18c6d8876ed0e32cf83a9b570190c9a59","schema_version":"1.0","event_id":"sha256:f329929d8b24d0d34df2683a6c6c59b18c6d8876ed0e32cf83a9b570190c9a59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VDJYTCBSX3ELACJSBKEHQ5PWNO/bundle.json","state_url":"https://pith.science/pith/VDJYTCBSX3ELACJSBKEHQ5PWNO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VDJYTCBSX3ELACJSBKEHQ5PWNO/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-05-31T22:29:32Z","links":{"resolver":"https://pith.science/pith/VDJYTCBSX3ELACJSBKEHQ5PWNO","bundle":"https://pith.science/pith/VDJYTCBSX3ELACJSBKEHQ5PWNO/bundle.json","state":"https://pith.science/pith/VDJYTCBSX3ELACJSBKEHQ5PWNO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VDJYTCBSX3ELACJSBKEHQ5PWNO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VDJYTCBSX3ELACJSBKEHQ5PWNO","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":"9be7c0ff05661f18dd0b72e7efd76dc1040b4a18472073574bacf95c44e73129","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-08T21:55:07Z","title_canon_sha256":"fa021d2e1f69a59c09a613dd3442068451b3cd0ec39eb36dee15c15feb86da4b"},"schema_version":"1.0","source":{"id":"1609.02609","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.02609","created_at":"2026-05-18T01:04:52Z"},{"alias_kind":"arxiv_version","alias_value":"1609.02609v1","created_at":"2026-05-18T01:04:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02609","created_at":"2026-05-18T01:04:52Z"},{"alias_kind":"pith_short_12","alias_value":"VDJYTCBSX3EL","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VDJYTCBSX3ELACJS","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VDJYTCBS","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:f329929d8b24d0d34df2683a6c6c59b18c6d8876ed0e32cf83a9b570190c9a59","target":"graph","created_at":"2026-05-18T01:04:52Z","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":"This paper examines the nonconvex quadratically constrained quadratic programming (QCQP) problems using an iterative method. One of the existing approaches for solving nonconvex QCQP problems relaxes the rank one constraint on the unknown matrix into semidefinite constraint to obtain the bound on the optimal value without finding the exact solution. By reconsidering the rank one matrix, an iterative rank minimization (IRM) method is proposed to gradually approach the rank one constraint. Each iteration of IRM is formulated as a convex problem with semidefinite constraints. An augmented Lagrang","authors_text":"Chuangchuang Sun, Ran Dai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-08T21:55:07Z","title":"An Iterative Method for Nonconvex Quadratically Constrained Quadratic Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.02609","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:beceeec1fa0052b930a412c31f8bbd11530fd46bb0590c0cacda93bb8ca92d14","target":"record","created_at":"2026-05-18T01:04:52Z","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":"9be7c0ff05661f18dd0b72e7efd76dc1040b4a18472073574bacf95c44e73129","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-08T21:55:07Z","title_canon_sha256":"fa021d2e1f69a59c09a613dd3442068451b3cd0ec39eb36dee15c15feb86da4b"},"schema_version":"1.0","source":{"id":"1609.02609","kind":"arxiv","version":1}},"canonical_sha256":"a8d3898832bec8b009320a887875f66bbcfb4e161de14e83310cbcd765eafa99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8d3898832bec8b009320a887875f66bbcfb4e161de14e83310cbcd765eafa99","first_computed_at":"2026-05-18T01:04:52.978491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:52.978491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hNqXxPvE3RVIRIq4g93hXvLTBPKS8NMoaSzwz9by3OmHeOVGgXTm5QVA+wztwNk+GWhMQLVdsUxslO/Ys84/Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:52.978946Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.02609","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:beceeec1fa0052b930a412c31f8bbd11530fd46bb0590c0cacda93bb8ca92d14","sha256:f329929d8b24d0d34df2683a6c6c59b18c6d8876ed0e32cf83a9b570190c9a59"],"state_sha256":"81878bbaf6ff3f886fa2b6a791f5240446aaf81b96bc29a4da87391494766bb5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qTyQ1Loq8dlJrJa/hz8dFmvht/jUcr6jsZglnGNn2TYAGGPJzfvq9oqwNYdctNlnwH7MN8C9qvKJo6by/inoDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:29:32.983574Z","bundle_sha256":"baa0983b980e5b94c35d08dcfd6471cb8d3d18bf80ad78b7d4be66ed13a7bdce"}}