{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3V62W2P3FZOMPTSVXL44JITJNJ","short_pith_number":"pith:3V62W2P3","canonical_record":{"source":{"id":"1906.10396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-25T09:08:39Z","cross_cats_sorted":[],"title_canon_sha256":"9852aa283d85c8dda2d549959f96a88ae10fd35d1bff1a0cc9e62b1de5179e79","abstract_canon_sha256":"d125680109363d02c74df4e0d0284435b43e9d23a536b55d5041b71dae04b822"},"schema_version":"1.0"},"canonical_sha256":"dd7dab69fb2e5cc7ce55baf9c4a2696a6212d1684a26834e0f82f9d62c763d53","source":{"kind":"arxiv","id":"1906.10396","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.10396","created_at":"2026-05-17T23:42:18Z"},{"alias_kind":"arxiv_version","alias_value":"1906.10396v1","created_at":"2026-05-17T23:42:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10396","created_at":"2026-05-17T23:42:18Z"},{"alias_kind":"pith_short_12","alias_value":"3V62W2P3FZOM","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3V62W2P3FZOMPTSV","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3V62W2P3","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3V62W2P3FZOMPTSVXL44JITJNJ","target":"record","payload":{"canonical_record":{"source":{"id":"1906.10396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-25T09:08:39Z","cross_cats_sorted":[],"title_canon_sha256":"9852aa283d85c8dda2d549959f96a88ae10fd35d1bff1a0cc9e62b1de5179e79","abstract_canon_sha256":"d125680109363d02c74df4e0d0284435b43e9d23a536b55d5041b71dae04b822"},"schema_version":"1.0"},"canonical_sha256":"dd7dab69fb2e5cc7ce55baf9c4a2696a6212d1684a26834e0f82f9d62c763d53","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:18.190113Z","signature_b64":"d+mm5H1DAM1QUVgm1wzPwOI+CKs4HnefJ3cQTN7v5Zmr+Zmt/p2JgyKsbpu+hZEvv7U0woKoM/4hZOEc8boZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd7dab69fb2e5cc7ce55baf9c4a2696a6212d1684a26834e0f82f9d62c763d53","last_reissued_at":"2026-05-17T23:42:18.189659Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:18.189659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.10396","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-17T23:42:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fLv7MJ7spHmFntc6szCpkWb2OuF/rQCxR3GcdJ4OFkTOQEYmCz3oktPisgVc9oamHDHhFU9oLVCnUJd7b0EFAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:21:02.397797Z"},"content_sha256":"43ac2edcb08acf32ab4a37f8ee578bb5230092868d974f6ff3873f5773f1f454","schema_version":"1.0","event_id":"sha256:43ac2edcb08acf32ab4a37f8ee578bb5230092868d974f6ff3873f5773f1f454"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3V62W2P3FZOMPTSVXL44JITJNJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A hybrid penalty method for a class of optimization problems with multiple rank constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Akiko Takeda, Ivan Markovsky, Tianxiang Liu, Ting Kei Pong","submitted_at":"2019-06-25T09:08:39Z","abstract_excerpt":"In this paper, we consider the problem of minimizing a smooth objective over multiple rank constraints on Hankel-structured matrices. This kind of problems arises in system identification, system theory and signal processing, where the rank constraints are typically \"hard constraints\". To solve these problems, we propose a hybrid penalty method that combines a penalty method with a post-processing scheme. Specifically, we solve the penalty subproblems until the penalty parameter reaches a given threshold, and then switch to a local alternating \"pseudo-projection'' method to further reduce cons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10396","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-17T23:42:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Dmm5nI2RIwSGBbBUIfBolKCEflUf73idmwdFtX+dvZQVeRYviLN6XaXXNs5SzB+7wl406Nowt9xg92q+YGbBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:21:02.398494Z"},"content_sha256":"c9d1b13af98c731a3d15942713c0db2302a342687f9ec6872d9033dd8f38599b","schema_version":"1.0","event_id":"sha256:c9d1b13af98c731a3d15942713c0db2302a342687f9ec6872d9033dd8f38599b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3V62W2P3FZOMPTSVXL44JITJNJ/bundle.json","state_url":"https://pith.science/pith/3V62W2P3FZOMPTSVXL44JITJNJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3V62W2P3FZOMPTSVXL44JITJNJ/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-30T05:21:02Z","links":{"resolver":"https://pith.science/pith/3V62W2P3FZOMPTSVXL44JITJNJ","bundle":"https://pith.science/pith/3V62W2P3FZOMPTSVXL44JITJNJ/bundle.json","state":"https://pith.science/pith/3V62W2P3FZOMPTSVXL44JITJNJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3V62W2P3FZOMPTSVXL44JITJNJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3V62W2P3FZOMPTSVXL44JITJNJ","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":"d125680109363d02c74df4e0d0284435b43e9d23a536b55d5041b71dae04b822","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-25T09:08:39Z","title_canon_sha256":"9852aa283d85c8dda2d549959f96a88ae10fd35d1bff1a0cc9e62b1de5179e79"},"schema_version":"1.0","source":{"id":"1906.10396","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.10396","created_at":"2026-05-17T23:42:18Z"},{"alias_kind":"arxiv_version","alias_value":"1906.10396v1","created_at":"2026-05-17T23:42:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10396","created_at":"2026-05-17T23:42:18Z"},{"alias_kind":"pith_short_12","alias_value":"3V62W2P3FZOM","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3V62W2P3FZOMPTSV","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3V62W2P3","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:c9d1b13af98c731a3d15942713c0db2302a342687f9ec6872d9033dd8f38599b","target":"graph","created_at":"2026-05-17T23:42:18Z","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":"In this paper, we consider the problem of minimizing a smooth objective over multiple rank constraints on Hankel-structured matrices. This kind of problems arises in system identification, system theory and signal processing, where the rank constraints are typically \"hard constraints\". To solve these problems, we propose a hybrid penalty method that combines a penalty method with a post-processing scheme. Specifically, we solve the penalty subproblems until the penalty parameter reaches a given threshold, and then switch to a local alternating \"pseudo-projection'' method to further reduce cons","authors_text":"Akiko Takeda, Ivan Markovsky, Tianxiang Liu, Ting Kei Pong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-25T09:08:39Z","title":"A hybrid penalty method for a class of optimization problems with multiple rank constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10396","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:43ac2edcb08acf32ab4a37f8ee578bb5230092868d974f6ff3873f5773f1f454","target":"record","created_at":"2026-05-17T23:42:18Z","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":"d125680109363d02c74df4e0d0284435b43e9d23a536b55d5041b71dae04b822","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-25T09:08:39Z","title_canon_sha256":"9852aa283d85c8dda2d549959f96a88ae10fd35d1bff1a0cc9e62b1de5179e79"},"schema_version":"1.0","source":{"id":"1906.10396","kind":"arxiv","version":1}},"canonical_sha256":"dd7dab69fb2e5cc7ce55baf9c4a2696a6212d1684a26834e0f82f9d62c763d53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd7dab69fb2e5cc7ce55baf9c4a2696a6212d1684a26834e0f82f9d62c763d53","first_computed_at":"2026-05-17T23:42:18.189659Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:18.189659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d+mm5H1DAM1QUVgm1wzPwOI+CKs4HnefJ3cQTN7v5Zmr+Zmt/p2JgyKsbpu+hZEvv7U0woKoM/4hZOEc8boZDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:18.190113Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.10396","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43ac2edcb08acf32ab4a37f8ee578bb5230092868d974f6ff3873f5773f1f454","sha256:c9d1b13af98c731a3d15942713c0db2302a342687f9ec6872d9033dd8f38599b"],"state_sha256":"9d36d32dc0c6c314a5d001e8cb6a1876789e129f3db69621115b8e6ede2e88ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z5uCkhf3+qrTm+4+FIqmzgZKq2acZPaCUFrcEsEghldKBbgJ7yVUcqDHpHN6FfFjZro5st+q+qX2pDqd+2cJBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:21:02.402284Z","bundle_sha256":"e2bb2c739e1d3530e9612497c938291c0a1b8407b73edc0f2b022b469b93232b"}}