{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XDLE563GTIU274DQUOOFFXFIFA","short_pith_number":"pith:XDLE563G","canonical_record":{"source":{"id":"1706.00596","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-02T09:01:15Z","cross_cats_sorted":[],"title_canon_sha256":"74aa9101671f21b29130f1f9b6ac4cb9c4e44b5189b8a3864957da58ee1d212a","abstract_canon_sha256":"10df9da351105288be2fffac37bab5a99923cc82a01395f6d18535f362527df8"},"schema_version":"1.0"},"canonical_sha256":"b8d64efb669a29aff070a39c52dca8282b79b91d4a6f51cf72e2d224dac1af86","source":{"kind":"arxiv","id":"1706.00596","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.00596","created_at":"2026-05-18T00:26:46Z"},{"alias_kind":"arxiv_version","alias_value":"1706.00596v2","created_at":"2026-05-18T00:26:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00596","created_at":"2026-05-18T00:26:46Z"},{"alias_kind":"pith_short_12","alias_value":"XDLE563GTIU2","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"XDLE563GTIU274DQ","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"XDLE563G","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XDLE563GTIU274DQUOOFFXFIFA","target":"record","payload":{"canonical_record":{"source":{"id":"1706.00596","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-02T09:01:15Z","cross_cats_sorted":[],"title_canon_sha256":"74aa9101671f21b29130f1f9b6ac4cb9c4e44b5189b8a3864957da58ee1d212a","abstract_canon_sha256":"10df9da351105288be2fffac37bab5a99923cc82a01395f6d18535f362527df8"},"schema_version":"1.0"},"canonical_sha256":"b8d64efb669a29aff070a39c52dca8282b79b91d4a6f51cf72e2d224dac1af86","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:46.151228Z","signature_b64":"7SQb95rN13Y9QW2FcukvWIF17ySI2r4gwCznXgjANUM3z2fVXpSGkS45B4ioIuLIGl2Gs2lqi4n1g1f4jvXIBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8d64efb669a29aff070a39c52dca8282b79b91d4a6f51cf72e2d224dac1af86","last_reissued_at":"2026-05-18T00:26:46.150559Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:46.150559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.00596","source_version":2,"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:26:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V+JXgezPxa+CJxwTwUKrOhgXGhw+krj+hd6v60hNzkKCy1UW4OuLrlGaOjANvHxLU2Hv+JOJ95xRe3i0pzUHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:52:20.782150Z"},"content_sha256":"4bca7797f9077c777b18a9100109b1165bd496082b377a6c0fd9b0eed5cb4680","schema_version":"1.0","event_id":"sha256:4bca7797f9077c777b18a9100109b1165bd496082b377a6c0fd9b0eed5cb4680"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XDLE563GTIU274DQUOOFFXFIFA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An efficient global optimization algorithm for maximizing the sum of two generalized Rayleigh quotients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Longfei Wang, Xiaohui Wang, Yong Xia","submitted_at":"2017-06-02T09:01:15Z","abstract_excerpt":"Maximizing the sum of two generalized Rayleigh quotients (SRQ) can be reformulated as a one-dimensional optimization problem, where the function value evaluations are reduced to solving semi-definite programming (SDP) subproblems. In this paper, we first use the dual SDP subproblem to construct an explicit overestimation and then propose a branch-and-bound algorithm to globally solve (SRQ). Numerical results demonstrate that it is even more efficient than the recent SDP-based heuristic algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00596","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":""},"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:26:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OjWCyH1Opw1YiRtfBumSiAStkG0k13YTBY9baD5kLtsLy4eXV5RlaJOWmDftJVG8CcUv5OYXlQSYqRernQ4PDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:52:20.782858Z"},"content_sha256":"06d29ab404f7d4fe80bfd7186c646bbb284c7c49aa630cbe033a1c4989997a84","schema_version":"1.0","event_id":"sha256:06d29ab404f7d4fe80bfd7186c646bbb284c7c49aa630cbe033a1c4989997a84"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XDLE563GTIU274DQUOOFFXFIFA/bundle.json","state_url":"https://pith.science/pith/XDLE563GTIU274DQUOOFFXFIFA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XDLE563GTIU274DQUOOFFXFIFA/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-29T19:52:20Z","links":{"resolver":"https://pith.science/pith/XDLE563GTIU274DQUOOFFXFIFA","bundle":"https://pith.science/pith/XDLE563GTIU274DQUOOFFXFIFA/bundle.json","state":"https://pith.science/pith/XDLE563GTIU274DQUOOFFXFIFA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XDLE563GTIU274DQUOOFFXFIFA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XDLE563GTIU274DQUOOFFXFIFA","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":"10df9da351105288be2fffac37bab5a99923cc82a01395f6d18535f362527df8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-02T09:01:15Z","title_canon_sha256":"74aa9101671f21b29130f1f9b6ac4cb9c4e44b5189b8a3864957da58ee1d212a"},"schema_version":"1.0","source":{"id":"1706.00596","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.00596","created_at":"2026-05-18T00:26:46Z"},{"alias_kind":"arxiv_version","alias_value":"1706.00596v2","created_at":"2026-05-18T00:26:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00596","created_at":"2026-05-18T00:26:46Z"},{"alias_kind":"pith_short_12","alias_value":"XDLE563GTIU2","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"XDLE563GTIU274DQ","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"XDLE563G","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:06d29ab404f7d4fe80bfd7186c646bbb284c7c49aa630cbe033a1c4989997a84","target":"graph","created_at":"2026-05-18T00:26:46Z","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":"Maximizing the sum of two generalized Rayleigh quotients (SRQ) can be reformulated as a one-dimensional optimization problem, where the function value evaluations are reduced to solving semi-definite programming (SDP) subproblems. In this paper, we first use the dual SDP subproblem to construct an explicit overestimation and then propose a branch-and-bound algorithm to globally solve (SRQ). Numerical results demonstrate that it is even more efficient than the recent SDP-based heuristic algorithm.","authors_text":"Longfei Wang, Xiaohui Wang, Yong Xia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-02T09:01:15Z","title":"An efficient global optimization algorithm for maximizing the sum of two generalized Rayleigh quotients"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00596","kind":"arxiv","version":2},"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:4bca7797f9077c777b18a9100109b1165bd496082b377a6c0fd9b0eed5cb4680","target":"record","created_at":"2026-05-18T00:26:46Z","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":"10df9da351105288be2fffac37bab5a99923cc82a01395f6d18535f362527df8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-02T09:01:15Z","title_canon_sha256":"74aa9101671f21b29130f1f9b6ac4cb9c4e44b5189b8a3864957da58ee1d212a"},"schema_version":"1.0","source":{"id":"1706.00596","kind":"arxiv","version":2}},"canonical_sha256":"b8d64efb669a29aff070a39c52dca8282b79b91d4a6f51cf72e2d224dac1af86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8d64efb669a29aff070a39c52dca8282b79b91d4a6f51cf72e2d224dac1af86","first_computed_at":"2026-05-18T00:26:46.150559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:46.150559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7SQb95rN13Y9QW2FcukvWIF17ySI2r4gwCznXgjANUM3z2fVXpSGkS45B4ioIuLIGl2Gs2lqi4n1g1f4jvXIBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:46.151228Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.00596","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4bca7797f9077c777b18a9100109b1165bd496082b377a6c0fd9b0eed5cb4680","sha256:06d29ab404f7d4fe80bfd7186c646bbb284c7c49aa630cbe033a1c4989997a84"],"state_sha256":"4bfc666918f94e771ca0f4a5ef8af013b9261cc8f0b503aae021ee666edd601a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LJuw7lkXXAv5vp2wzkPgy0xdx9belFALAKHa149ufeRKEShHKbDnJ+bBK/TUIu2FxRtVp50TAPIyQ4bxqg2LDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T19:52:20.786726Z","bundle_sha256":"c48289d2a2af03a54a9c83cb3847807c59f36176a987298458243bbfd848253d"}}