{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IS5OW2CERQ6FRTLDX7NKL5GRII","short_pith_number":"pith:IS5OW2CE","canonical_record":{"source":{"id":"1402.4198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-18T01:07:23Z","cross_cats_sorted":[],"title_canon_sha256":"d10e2a865ad85d2721faf4a497366b626253f7c74b273f24a4ed8dd1659f1e07","abstract_canon_sha256":"0c6a0dac4315f41f183f071440b91fdb27363cb9aa22ad70e9e2815fd08adf81"},"schema_version":"1.0"},"canonical_sha256":"44baeb68448c3c58cd63bfdaa5f4d142290f61b646a66b94480c8a42b2a04457","source":{"kind":"arxiv","id":"1402.4198","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4198","created_at":"2026-05-18T02:58:44Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4198v1","created_at":"2026-05-18T02:58:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4198","created_at":"2026-05-18T02:58:44Z"},{"alias_kind":"pith_short_12","alias_value":"IS5OW2CERQ6F","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IS5OW2CERQ6FRTLD","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IS5OW2CE","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IS5OW2CERQ6FRTLDX7NKL5GRII","target":"record","payload":{"canonical_record":{"source":{"id":"1402.4198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-18T01:07:23Z","cross_cats_sorted":[],"title_canon_sha256":"d10e2a865ad85d2721faf4a497366b626253f7c74b273f24a4ed8dd1659f1e07","abstract_canon_sha256":"0c6a0dac4315f41f183f071440b91fdb27363cb9aa22ad70e9e2815fd08adf81"},"schema_version":"1.0"},"canonical_sha256":"44baeb68448c3c58cd63bfdaa5f4d142290f61b646a66b94480c8a42b2a04457","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:44.556527Z","signature_b64":"81x+Ia8P4FLMoHrotg7NqWN/TyZ1uh+Y01/ZlnjF9w5mMueN4pd6V8f4kFz6xMz1mvCU+8TpwblBtLppfbRbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44baeb68448c3c58cd63bfdaa5f4d142290f61b646a66b94480c8a42b2a04457","last_reissued_at":"2026-05-18T02:58:44.555763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:44.555763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.4198","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-18T02:58:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E5lR8Yns+p3IcY6uG4V9+mYgb9XWwD9Fso8AILf6NchgGzQvRogAbBlGCCaOmQ9YseLiPq3CaCqYED62bscJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:58:40.798250Z"},"content_sha256":"eaf11545a53da8400477dd3dfa1906bf5147d04b0b16a57da747103dd8d29a05","schema_version":"1.0","event_id":"sha256:eaf11545a53da8400477dd3dfa1906bf5147d04b0b16a57da747103dd8d29a05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IS5OW2CERQ6FRTLDX7NKL5GRII","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An SDP Approach For Solving Quadratic Fractional Programming Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ruey-Lin Sheu, Van-Bong Nguyen, Yong Xia","submitted_at":"2014-02-18T01:07:23Z","abstract_excerpt":"This paper considers a fractional programming problem (P) which minimizes a ratio of quadratic functions subject to a two-sided quadratic constraint. As is well-known, the fractional objective function can be replaced by a parametric family of quadratic functions, which makes (P) highly related to, but more difficult than a single quadratic programming problem subject to a similar constraint set. The task is to find the optimal parameter $\\lambda^*$ and then look for the optimal solution if $\\lambda^*$ is attained. Contrasted with the classical Dinkelbach method that iterates over the paramete"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4198","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-18T02:58:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4qVyjkZyl8AtrLiTuHyEDTzmCm7IMTrEGtGE5/GD0iayfn31KWFSboyUTaFTjXFF+4zr73hClD4WHg3Yk5S6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:58:40.798615Z"},"content_sha256":"04f6dcc741f1eb699ffcf6e3a521e093bc06b9c2bcfde3d49924a759eab1936e","schema_version":"1.0","event_id":"sha256:04f6dcc741f1eb699ffcf6e3a521e093bc06b9c2bcfde3d49924a759eab1936e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IS5OW2CERQ6FRTLDX7NKL5GRII/bundle.json","state_url":"https://pith.science/pith/IS5OW2CERQ6FRTLDX7NKL5GRII/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IS5OW2CERQ6FRTLDX7NKL5GRII/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-06-23T17:58:40Z","links":{"resolver":"https://pith.science/pith/IS5OW2CERQ6FRTLDX7NKL5GRII","bundle":"https://pith.science/pith/IS5OW2CERQ6FRTLDX7NKL5GRII/bundle.json","state":"https://pith.science/pith/IS5OW2CERQ6FRTLDX7NKL5GRII/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IS5OW2CERQ6FRTLDX7NKL5GRII/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IS5OW2CERQ6FRTLDX7NKL5GRII","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":"0c6a0dac4315f41f183f071440b91fdb27363cb9aa22ad70e9e2815fd08adf81","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-18T01:07:23Z","title_canon_sha256":"d10e2a865ad85d2721faf4a497366b626253f7c74b273f24a4ed8dd1659f1e07"},"schema_version":"1.0","source":{"id":"1402.4198","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4198","created_at":"2026-05-18T02:58:44Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4198v1","created_at":"2026-05-18T02:58:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4198","created_at":"2026-05-18T02:58:44Z"},{"alias_kind":"pith_short_12","alias_value":"IS5OW2CERQ6F","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IS5OW2CERQ6FRTLD","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IS5OW2CE","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:04f6dcc741f1eb699ffcf6e3a521e093bc06b9c2bcfde3d49924a759eab1936e","target":"graph","created_at":"2026-05-18T02:58:44Z","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 considers a fractional programming problem (P) which minimizes a ratio of quadratic functions subject to a two-sided quadratic constraint. As is well-known, the fractional objective function can be replaced by a parametric family of quadratic functions, which makes (P) highly related to, but more difficult than a single quadratic programming problem subject to a similar constraint set. The task is to find the optimal parameter $\\lambda^*$ and then look for the optimal solution if $\\lambda^*$ is attained. Contrasted with the classical Dinkelbach method that iterates over the paramete","authors_text":"Ruey-Lin Sheu, Van-Bong Nguyen, Yong Xia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-18T01:07:23Z","title":"An SDP Approach For Solving Quadratic Fractional Programming Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4198","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:eaf11545a53da8400477dd3dfa1906bf5147d04b0b16a57da747103dd8d29a05","target":"record","created_at":"2026-05-18T02:58:44Z","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":"0c6a0dac4315f41f183f071440b91fdb27363cb9aa22ad70e9e2815fd08adf81","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-18T01:07:23Z","title_canon_sha256":"d10e2a865ad85d2721faf4a497366b626253f7c74b273f24a4ed8dd1659f1e07"},"schema_version":"1.0","source":{"id":"1402.4198","kind":"arxiv","version":1}},"canonical_sha256":"44baeb68448c3c58cd63bfdaa5f4d142290f61b646a66b94480c8a42b2a04457","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44baeb68448c3c58cd63bfdaa5f4d142290f61b646a66b94480c8a42b2a04457","first_computed_at":"2026-05-18T02:58:44.555763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:44.555763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"81x+Ia8P4FLMoHrotg7NqWN/TyZ1uh+Y01/ZlnjF9w5mMueN4pd6V8f4kFz6xMz1mvCU+8TpwblBtLppfbRbCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:44.556527Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.4198","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eaf11545a53da8400477dd3dfa1906bf5147d04b0b16a57da747103dd8d29a05","sha256:04f6dcc741f1eb699ffcf6e3a521e093bc06b9c2bcfde3d49924a759eab1936e"],"state_sha256":"ba44b2d582055da026e784c862222103634d5371507bd325642cd73a79b516d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9+CBl2eSogDO879eg4TTPjYjWdbkCISOOGjtqRFL+hGs81bwEFM9gk6wUY88i3JmeG/5jB1uXzpYz67hwjqwDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T17:58:40.800600Z","bundle_sha256":"d8e8a5f48ce41a99210df8dc4de0877d086b7a964d9412ba7085332aca798db2"}}