{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QCPI6ANIK2GS5GIHKO2SP64J6V","short_pith_number":"pith:QCPI6ANI","canonical_record":{"source":{"id":"1711.04401","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-13T03:03:51Z","cross_cats_sorted":[],"title_canon_sha256":"02d4743043e3d5caed45aa0c8d7f42e510b748d5b2f353c74f4031cbdbabdf99","abstract_canon_sha256":"77eb4de6678d3849b9fa9ddf33a3eb5d442af07c1240981be5955c267994881c"},"schema_version":"1.0"},"canonical_sha256":"809e8f01a8568d2e990753b527fb89f55d286cf49d1bd1b7217866bf0fd19cdf","source":{"kind":"arxiv","id":"1711.04401","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04401","created_at":"2026-05-18T00:30:39Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04401v1","created_at":"2026-05-18T00:30:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04401","created_at":"2026-05-18T00:30:39Z"},{"alias_kind":"pith_short_12","alias_value":"QCPI6ANIK2GS","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"QCPI6ANIK2GS5GIH","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"QCPI6ANI","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QCPI6ANIK2GS5GIHKO2SP64J6V","target":"record","payload":{"canonical_record":{"source":{"id":"1711.04401","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-13T03:03:51Z","cross_cats_sorted":[],"title_canon_sha256":"02d4743043e3d5caed45aa0c8d7f42e510b748d5b2f353c74f4031cbdbabdf99","abstract_canon_sha256":"77eb4de6678d3849b9fa9ddf33a3eb5d442af07c1240981be5955c267994881c"},"schema_version":"1.0"},"canonical_sha256":"809e8f01a8568d2e990753b527fb89f55d286cf49d1bd1b7217866bf0fd19cdf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:39.149584Z","signature_b64":"azWoKsghl1x2fVWlBQWAt+SrfTsI7Zapiw+XEanZhkZe0kcju35lu4lapdT9T0qAbkqBmrP0ZZP+OvNW3lKhAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"809e8f01a8568d2e990753b527fb89f55d286cf49d1bd1b7217866bf0fd19cdf","last_reissued_at":"2026-05-18T00:30:39.148880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:39.148880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.04401","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:30:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4iI9I5DpMVHl2TJk5+YjdmTJX3LD/hiB2h8yrA4UkHkltFE+f61j4U3ooZlalJ9O4nnVkBYc3r+pTEZS/6OcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:40:06.499250Z"},"content_sha256":"016918c10e685174cc3eee6c77e7b9ca63d742322c1ea63aea9ef3a5b5f47788","schema_version":"1.0","event_id":"sha256:016918c10e685174cc3eee6c77e7b9ca63d742322c1ea63aea9ef3a5b5f47788"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QCPI6ANIK2GS5GIHKO2SP64J6V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quadratic Programming Over Ellipsoids (with Applications to Constrained Linear Regression and Tensor Decomposition)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrzej Cichocki, Anh-Huy Phan, Danilo Mandic, Masao Yamagishi","submitted_at":"2017-11-13T03:03:51Z","abstract_excerpt":"A novel algorithm to solve the quadratic programming problem over ellipsoids is proposed. This is achieved by splitting the problem into two optimisation sub-problems, quadratic programming over a sphere and orthogonal projection. Next, an augmented-Lagrangian algorithm is developed for this multiple constraint optimisation. Benefit from the fact that the QP over a single sphere can be solved in a closed form by solving a secular equation, we derive a tighter bound of the minimiser of the secular equation. We also propose to generate a new psd matrix with a low condition number from the matric"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04401","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:30:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eD5Blm45d5AlHNjH3vTE9xoP0bUlDd7qge8FAx4nstQ52c55DULhqXYHifjVqihdwo9mQwZtjp/RA669pEURAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:40:06.499934Z"},"content_sha256":"0183b4b50d640974c2b138dcac5dcb326e20a235f3e48910d95b1f0e148064bc","schema_version":"1.0","event_id":"sha256:0183b4b50d640974c2b138dcac5dcb326e20a235f3e48910d95b1f0e148064bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QCPI6ANIK2GS5GIHKO2SP64J6V/bundle.json","state_url":"https://pith.science/pith/QCPI6ANIK2GS5GIHKO2SP64J6V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QCPI6ANIK2GS5GIHKO2SP64J6V/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-31T08:40:06Z","links":{"resolver":"https://pith.science/pith/QCPI6ANIK2GS5GIHKO2SP64J6V","bundle":"https://pith.science/pith/QCPI6ANIK2GS5GIHKO2SP64J6V/bundle.json","state":"https://pith.science/pith/QCPI6ANIK2GS5GIHKO2SP64J6V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QCPI6ANIK2GS5GIHKO2SP64J6V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QCPI6ANIK2GS5GIHKO2SP64J6V","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":"77eb4de6678d3849b9fa9ddf33a3eb5d442af07c1240981be5955c267994881c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-13T03:03:51Z","title_canon_sha256":"02d4743043e3d5caed45aa0c8d7f42e510b748d5b2f353c74f4031cbdbabdf99"},"schema_version":"1.0","source":{"id":"1711.04401","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04401","created_at":"2026-05-18T00:30:39Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04401v1","created_at":"2026-05-18T00:30:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04401","created_at":"2026-05-18T00:30:39Z"},{"alias_kind":"pith_short_12","alias_value":"QCPI6ANIK2GS","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"QCPI6ANIK2GS5GIH","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"QCPI6ANI","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:0183b4b50d640974c2b138dcac5dcb326e20a235f3e48910d95b1f0e148064bc","target":"graph","created_at":"2026-05-18T00:30:39Z","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":"A novel algorithm to solve the quadratic programming problem over ellipsoids is proposed. This is achieved by splitting the problem into two optimisation sub-problems, quadratic programming over a sphere and orthogonal projection. Next, an augmented-Lagrangian algorithm is developed for this multiple constraint optimisation. Benefit from the fact that the QP over a single sphere can be solved in a closed form by solving a secular equation, we derive a tighter bound of the minimiser of the secular equation. We also propose to generate a new psd matrix with a low condition number from the matric","authors_text":"Andrzej Cichocki, Anh-Huy Phan, Danilo Mandic, Masao Yamagishi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-13T03:03:51Z","title":"Quadratic Programming Over Ellipsoids (with Applications to Constrained Linear Regression and Tensor Decomposition)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04401","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:016918c10e685174cc3eee6c77e7b9ca63d742322c1ea63aea9ef3a5b5f47788","target":"record","created_at":"2026-05-18T00:30:39Z","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":"77eb4de6678d3849b9fa9ddf33a3eb5d442af07c1240981be5955c267994881c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-13T03:03:51Z","title_canon_sha256":"02d4743043e3d5caed45aa0c8d7f42e510b748d5b2f353c74f4031cbdbabdf99"},"schema_version":"1.0","source":{"id":"1711.04401","kind":"arxiv","version":1}},"canonical_sha256":"809e8f01a8568d2e990753b527fb89f55d286cf49d1bd1b7217866bf0fd19cdf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"809e8f01a8568d2e990753b527fb89f55d286cf49d1bd1b7217866bf0fd19cdf","first_computed_at":"2026-05-18T00:30:39.148880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:39.148880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"azWoKsghl1x2fVWlBQWAt+SrfTsI7Zapiw+XEanZhkZe0kcju35lu4lapdT9T0qAbkqBmrP0ZZP+OvNW3lKhAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:39.149584Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.04401","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:016918c10e685174cc3eee6c77e7b9ca63d742322c1ea63aea9ef3a5b5f47788","sha256:0183b4b50d640974c2b138dcac5dcb326e20a235f3e48910d95b1f0e148064bc"],"state_sha256":"150be9df357ec4be91b63a485fc91bd7799079e81ad69190229b105c4ba31496"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ro6fhHLCBU0w5ExmjGdv1yvMGqYLjeDakpG7PdpYvwhy0L3snf4eT7Eg7x5qk3zX0AVOGNfTtYRhe/yhInGrBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:40:06.503492Z","bundle_sha256":"b34d43f12659c881da099f0fa03d13fe9782a2586b73539e3ce90f5250769ff8"}}