{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:O4Q6VP5S7XLB6G4ZSKUPY7RBLM","short_pith_number":"pith:O4Q6VP5S","canonical_record":{"source":{"id":"1211.4664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-11-20T04:56:50Z","cross_cats_sorted":[],"title_canon_sha256":"7b9fa37295c34f456e1c0a23d76e33212cd01e755663547051046de973b5cdcc","abstract_canon_sha256":"2cff4aba483825affb16d0396c3581d4008852786618ea27c119210dabfc3e0b"},"schema_version":"1.0"},"canonical_sha256":"7721eabfb2fdd61f1b9992a8fc7e215b28a2d96db3a7e6e2acb9bf371391fa92","source":{"kind":"arxiv","id":"1211.4664","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.4664","created_at":"2026-05-18T03:40:25Z"},{"alias_kind":"arxiv_version","alias_value":"1211.4664v1","created_at":"2026-05-18T03:40:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4664","created_at":"2026-05-18T03:40:25Z"},{"alias_kind":"pith_short_12","alias_value":"O4Q6VP5S7XLB","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"O4Q6VP5S7XLB6G4Z","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"O4Q6VP5S","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:O4Q6VP5S7XLB6G4ZSKUPY7RBLM","target":"record","payload":{"canonical_record":{"source":{"id":"1211.4664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-11-20T04:56:50Z","cross_cats_sorted":[],"title_canon_sha256":"7b9fa37295c34f456e1c0a23d76e33212cd01e755663547051046de973b5cdcc","abstract_canon_sha256":"2cff4aba483825affb16d0396c3581d4008852786618ea27c119210dabfc3e0b"},"schema_version":"1.0"},"canonical_sha256":"7721eabfb2fdd61f1b9992a8fc7e215b28a2d96db3a7e6e2acb9bf371391fa92","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:25.010215Z","signature_b64":"+dyh4asJ+dTplDEcXnSVJNfeWGiIqCG5iWjZvjC6i/P8iAPi6NftVTsJj/pQpMGZEMWrafhDljuhkiJSwBuXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7721eabfb2fdd61f1b9992a8fc7e215b28a2d96db3a7e6e2acb9bf371391fa92","last_reissued_at":"2026-05-18T03:40:25.009660Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:25.009660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.4664","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-18T03:40:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uAT8iQMDBuknIIEM/z3rzQnVYBjjv3Iu7cqv+1qM6rp4rxtnKiaqVkuvXKHsSSYSk1RscLeRtzbWfx8WlldUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:32:31.741596Z"},"content_sha256":"c45d9680addefd8bec703474ddc23a88de1c283edbbb4fce5aaaf6468adc0534","schema_version":"1.0","event_id":"sha256:c45d9680addefd8bec703474ddc23a88de1c283edbbb4fce5aaaf6468adc0534"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:O4Q6VP5S7XLB6G4ZSKUPY7RBLM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complete solutions to nonconvex fractional programming problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"David Yang Gao, Ning Ruan","submitted_at":"2012-11-20T04:56:50Z","abstract_excerpt":"This paper presents a canonical dual approach to the problem of minimizing the sum of a quadratic function and the ratio of nonconvex function and quadratic functions, which is a type of non-convex optimization problem subject to an elliptic constraint. We first relax the fractional structure by introducing a family of parametric subproblems. Under certain conditions, we show that the canonical dual of each subproblem becomes a two-dimensional concave maximization problem that exhibits no duality gap. Since the infimum of the optima of the parameterized subproblems leads to a solution to the o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4664","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-18T03:40:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/If+uw00hSg1Vs+E6nEmg6s4n6qn4EoGWTsg6s+NATieevO9nG3T1kzO1HLNCrjsbRmQZDlFlAPnblLgBwJ3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:32:31.742041Z"},"content_sha256":"fd0d64d21e6e695689d308988f8c02717e77c95c9f79e8d1c37921b56e1b4558","schema_version":"1.0","event_id":"sha256:fd0d64d21e6e695689d308988f8c02717e77c95c9f79e8d1c37921b56e1b4558"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O4Q6VP5S7XLB6G4ZSKUPY7RBLM/bundle.json","state_url":"https://pith.science/pith/O4Q6VP5S7XLB6G4ZSKUPY7RBLM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O4Q6VP5S7XLB6G4ZSKUPY7RBLM/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-05T21:32:31Z","links":{"resolver":"https://pith.science/pith/O4Q6VP5S7XLB6G4ZSKUPY7RBLM","bundle":"https://pith.science/pith/O4Q6VP5S7XLB6G4ZSKUPY7RBLM/bundle.json","state":"https://pith.science/pith/O4Q6VP5S7XLB6G4ZSKUPY7RBLM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O4Q6VP5S7XLB6G4ZSKUPY7RBLM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:O4Q6VP5S7XLB6G4ZSKUPY7RBLM","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":"2cff4aba483825affb16d0396c3581d4008852786618ea27c119210dabfc3e0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-11-20T04:56:50Z","title_canon_sha256":"7b9fa37295c34f456e1c0a23d76e33212cd01e755663547051046de973b5cdcc"},"schema_version":"1.0","source":{"id":"1211.4664","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.4664","created_at":"2026-05-18T03:40:25Z"},{"alias_kind":"arxiv_version","alias_value":"1211.4664v1","created_at":"2026-05-18T03:40:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4664","created_at":"2026-05-18T03:40:25Z"},{"alias_kind":"pith_short_12","alias_value":"O4Q6VP5S7XLB","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"O4Q6VP5S7XLB6G4Z","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"O4Q6VP5S","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:fd0d64d21e6e695689d308988f8c02717e77c95c9f79e8d1c37921b56e1b4558","target":"graph","created_at":"2026-05-18T03:40:25Z","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 presents a canonical dual approach to the problem of minimizing the sum of a quadratic function and the ratio of nonconvex function and quadratic functions, which is a type of non-convex optimization problem subject to an elliptic constraint. We first relax the fractional structure by introducing a family of parametric subproblems. Under certain conditions, we show that the canonical dual of each subproblem becomes a two-dimensional concave maximization problem that exhibits no duality gap. Since the infimum of the optima of the parameterized subproblems leads to a solution to the o","authors_text":"David Yang Gao, Ning Ruan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-11-20T04:56:50Z","title":"Complete solutions to nonconvex fractional programming problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4664","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:c45d9680addefd8bec703474ddc23a88de1c283edbbb4fce5aaaf6468adc0534","target":"record","created_at":"2026-05-18T03:40:25Z","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":"2cff4aba483825affb16d0396c3581d4008852786618ea27c119210dabfc3e0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-11-20T04:56:50Z","title_canon_sha256":"7b9fa37295c34f456e1c0a23d76e33212cd01e755663547051046de973b5cdcc"},"schema_version":"1.0","source":{"id":"1211.4664","kind":"arxiv","version":1}},"canonical_sha256":"7721eabfb2fdd61f1b9992a8fc7e215b28a2d96db3a7e6e2acb9bf371391fa92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7721eabfb2fdd61f1b9992a8fc7e215b28a2d96db3a7e6e2acb9bf371391fa92","first_computed_at":"2026-05-18T03:40:25.009660Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:40:25.009660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+dyh4asJ+dTplDEcXnSVJNfeWGiIqCG5iWjZvjC6i/P8iAPi6NftVTsJj/pQpMGZEMWrafhDljuhkiJSwBuXAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:40:25.010215Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.4664","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c45d9680addefd8bec703474ddc23a88de1c283edbbb4fce5aaaf6468adc0534","sha256:fd0d64d21e6e695689d308988f8c02717e77c95c9f79e8d1c37921b56e1b4558"],"state_sha256":"6b932a955691afb7b8122462afa25085c7889dc6f3f32c7aa881da66f1625e53"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8TXihLWVNO4ig4CR5sCPcLa6MliG0WZZD5gD3p+jpYy82Qk/LxQD8816mJlxjhY0vXxjMC7ptED9La6ddlU0BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:32:31.744624Z","bundle_sha256":"656ac417be01d7d69d2046332d41f43afc98003583ec530a479c6d886dee6370"}}