{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6WEZTCPMWFVCA7NJMWS744FGTG","short_pith_number":"pith:6WEZTCPM","canonical_record":{"source":{"id":"1312.1400","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-05T00:55:24Z","cross_cats_sorted":[],"title_canon_sha256":"1f07510fb69c3a7edfe3f67786645a658058a829f06bc08eeecc4f33212a631f","abstract_canon_sha256":"25218b9501940c38151583ab3aae8100930e398254cc92b47f94fa832fc61fac"},"schema_version":"1.0"},"canonical_sha256":"f5899989ecb16a207da965a5fe70a69984b1ae9daaa68df8ac9be6f2c8767807","source":{"kind":"arxiv","id":"1312.1400","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1400","created_at":"2026-05-18T00:56:53Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1400v1","created_at":"2026-05-18T00:56:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1400","created_at":"2026-05-18T00:56:53Z"},{"alias_kind":"pith_short_12","alias_value":"6WEZTCPMWFVC","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6WEZTCPMWFVCA7NJ","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6WEZTCPM","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6WEZTCPMWFVCA7NJMWS744FGTG","target":"record","payload":{"canonical_record":{"source":{"id":"1312.1400","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-05T00:55:24Z","cross_cats_sorted":[],"title_canon_sha256":"1f07510fb69c3a7edfe3f67786645a658058a829f06bc08eeecc4f33212a631f","abstract_canon_sha256":"25218b9501940c38151583ab3aae8100930e398254cc92b47f94fa832fc61fac"},"schema_version":"1.0"},"canonical_sha256":"f5899989ecb16a207da965a5fe70a69984b1ae9daaa68df8ac9be6f2c8767807","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:53.394566Z","signature_b64":"175VNav4PoSha3UlGSJL87pE4v7+3kxy/8lpZJcrxqFaoPd9eltyjwxn+DaVaVdB8nFlvpSRKxXhmuKgXjSdCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5899989ecb16a207da965a5fe70a69984b1ae9daaa68df8ac9be6f2c8767807","last_reissued_at":"2026-05-18T00:56:53.393890Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:53.393890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.1400","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-18T00:56:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lgZ4uJZne96CfHlVVFgkxDAcDItpderEAWH+AwTV0qI13WAkYk4TC6KFZFQz2ypGIJ90BAVMPKpmd/vtEFMJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:53:20.104767Z"},"content_sha256":"9a3aada1829e71b9b2e888c70c659dcd880c5d9ca546d1121c0fafd1a709b20f","schema_version":"1.0","event_id":"sha256:9a3aada1829e71b9b2e888c70c659dcd880c5d9ca546d1121c0fafd1a709b20f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6WEZTCPMWFVCA7NJMWS744FGTG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Revisit to Quadratic Programming with One Inequality Quadratic Constraint via Matrix Pencil","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gang-Xuan Lin, Ruey-Lin Sheu, Yong Hsia","submitted_at":"2013-12-05T00:55:24Z","abstract_excerpt":"The quadratic programming over one inequality quadratic constraint (QP1QC) is a very special case of quadratically constrained quadratic programming (QCQP) and attracted much attention since early 1990's. It is now understood that, under the primal Slater condition, (QP1QC) has a tight SDP relaxation (PSDP). The optimal solution to (QP1QC), if exists, can be obtained by a matrix rank one decomposition of the optimal matrix X? to (PSDP). In this paper, we pay a revisit to (QP1QC) by analyzing the associated matrix pencil of two symmetric real matrices A and B, the former matrix of which defines"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1400","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-18T00:56:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f9SN1Oova7tDMGwvqgRu63RAGgNRscGx0CPdv1mPMTEOpXz4jxclM56PCDCSgIVC+R8Pn5ZlwVrArHUDBV7FCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:53:20.105494Z"},"content_sha256":"2ab531c83bbf5c0bad32f4d8f38d669ed4d608c4215b7a107c32852743c73a56","schema_version":"1.0","event_id":"sha256:2ab531c83bbf5c0bad32f4d8f38d669ed4d608c4215b7a107c32852743c73a56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6WEZTCPMWFVCA7NJMWS744FGTG/bundle.json","state_url":"https://pith.science/pith/6WEZTCPMWFVCA7NJMWS744FGTG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6WEZTCPMWFVCA7NJMWS744FGTG/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-31T10:53:20Z","links":{"resolver":"https://pith.science/pith/6WEZTCPMWFVCA7NJMWS744FGTG","bundle":"https://pith.science/pith/6WEZTCPMWFVCA7NJMWS744FGTG/bundle.json","state":"https://pith.science/pith/6WEZTCPMWFVCA7NJMWS744FGTG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6WEZTCPMWFVCA7NJMWS744FGTG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6WEZTCPMWFVCA7NJMWS744FGTG","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":"25218b9501940c38151583ab3aae8100930e398254cc92b47f94fa832fc61fac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-05T00:55:24Z","title_canon_sha256":"1f07510fb69c3a7edfe3f67786645a658058a829f06bc08eeecc4f33212a631f"},"schema_version":"1.0","source":{"id":"1312.1400","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1400","created_at":"2026-05-18T00:56:53Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1400v1","created_at":"2026-05-18T00:56:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1400","created_at":"2026-05-18T00:56:53Z"},{"alias_kind":"pith_short_12","alias_value":"6WEZTCPMWFVC","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6WEZTCPMWFVCA7NJ","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6WEZTCPM","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:2ab531c83bbf5c0bad32f4d8f38d669ed4d608c4215b7a107c32852743c73a56","target":"graph","created_at":"2026-05-18T00:56:53Z","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":"The quadratic programming over one inequality quadratic constraint (QP1QC) is a very special case of quadratically constrained quadratic programming (QCQP) and attracted much attention since early 1990's. It is now understood that, under the primal Slater condition, (QP1QC) has a tight SDP relaxation (PSDP). The optimal solution to (QP1QC), if exists, can be obtained by a matrix rank one decomposition of the optimal matrix X? to (PSDP). In this paper, we pay a revisit to (QP1QC) by analyzing the associated matrix pencil of two symmetric real matrices A and B, the former matrix of which defines","authors_text":"Gang-Xuan Lin, Ruey-Lin Sheu, Yong Hsia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-05T00:55:24Z","title":"A Revisit to Quadratic Programming with One Inequality Quadratic Constraint via Matrix Pencil"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1400","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:9a3aada1829e71b9b2e888c70c659dcd880c5d9ca546d1121c0fafd1a709b20f","target":"record","created_at":"2026-05-18T00:56:53Z","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":"25218b9501940c38151583ab3aae8100930e398254cc92b47f94fa832fc61fac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-05T00:55:24Z","title_canon_sha256":"1f07510fb69c3a7edfe3f67786645a658058a829f06bc08eeecc4f33212a631f"},"schema_version":"1.0","source":{"id":"1312.1400","kind":"arxiv","version":1}},"canonical_sha256":"f5899989ecb16a207da965a5fe70a69984b1ae9daaa68df8ac9be6f2c8767807","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5899989ecb16a207da965a5fe70a69984b1ae9daaa68df8ac9be6f2c8767807","first_computed_at":"2026-05-18T00:56:53.393890Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:53.393890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"175VNav4PoSha3UlGSJL87pE4v7+3kxy/8lpZJcrxqFaoPd9eltyjwxn+DaVaVdB8nFlvpSRKxXhmuKgXjSdCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:53.394566Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.1400","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a3aada1829e71b9b2e888c70c659dcd880c5d9ca546d1121c0fafd1a709b20f","sha256:2ab531c83bbf5c0bad32f4d8f38d669ed4d608c4215b7a107c32852743c73a56"],"state_sha256":"39d680aec66315a801f6b1f2756402dd4da5d26f640d8d2f0f096b9783cee677"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MUKgmaXL5SEop09PuR/g2LV67AvibI7D5dLLlox/Mckx7Bw40dVEWom2VZWqJ1txu4N0vmPvUtxuu2ylIiSyAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T10:53:20.109708Z","bundle_sha256":"e4526d40be9626269cdd8e49cba603440d567c963fbd06286b27330ab13f39c1"}}