{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3F6T5NIHC6PMBS534J3XUORL6M","short_pith_number":"pith:3F6T5NIH","schema_version":"1.0","canonical_sha256":"d97d3eb507179ec0cbbbe2777a3a2bf31676fe5b4a6ba670064da6047d0ac152","source":{"kind":"arxiv","id":"1308.1827","version":2},"attestation_state":"computed","paper":{"title":"Factorization approach to structured low-rank approximation with applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Ivan Markovsky, Konstantin Usevich, Mariya Ishteva","submitted_at":"2013-08-08T12:34:09Z","abstract_excerpt":"We consider the problem of approximating an affinely structured matrix, for example a Hankel matrix, by a low-rank matrix with the same structure. This problem occurs in system identification, signal processing and computer algebra, among others. We impose the low-rank by modeling the approximation as a product of two factors with reduced dimension. The structure of the low-rank model is enforced by introducing a penalty term in the objective function. The proposed local optimization algorithm is able to solve the weighted structured low-rank approximation problem, as well as to deal with the "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1308.1827","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-08-08T12:34:09Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"73d905b785ced9c009f8ecfccf91cb1ec2682343baf822e6429e335485aa3f73","abstract_canon_sha256":"6e6164ea1c22a8d106294179477e784fd404acd02330502a157b0c991cc73eb3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:09.992921Z","signature_b64":"yqTFj5EXj3YWoSYJS2ScG5po+rERWaKe+hW1bHDKkrfIubnsqNUziTNRINUSLZLmFLAaa+sudCX4CVlw3mb6DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d97d3eb507179ec0cbbbe2777a3a2bf31676fe5b4a6ba670064da6047d0ac152","last_reissued_at":"2026-05-18T02:49:09.992489Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:09.992489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Factorization approach to structured low-rank approximation with applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Ivan Markovsky, Konstantin Usevich, Mariya Ishteva","submitted_at":"2013-08-08T12:34:09Z","abstract_excerpt":"We consider the problem of approximating an affinely structured matrix, for example a Hankel matrix, by a low-rank matrix with the same structure. This problem occurs in system identification, signal processing and computer algebra, among others. We impose the low-rank by modeling the approximation as a product of two factors with reduced dimension. The structure of the low-rank model is enforced by introducing a penalty term in the objective function. The proposed local optimization algorithm is able to solve the weighted structured low-rank approximation problem, as well as to deal with the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1827","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1308.1827","created_at":"2026-05-18T02:49:09.992561+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.1827v2","created_at":"2026-05-18T02:49:09.992561+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1827","created_at":"2026-05-18T02:49:09.992561+00:00"},{"alias_kind":"pith_short_12","alias_value":"3F6T5NIHC6PM","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3F6T5NIHC6PMBS53","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3F6T5NIH","created_at":"2026-05-18T12:27:32.513160+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3F6T5NIHC6PMBS534J3XUORL6M","json":"https://pith.science/pith/3F6T5NIHC6PMBS534J3XUORL6M.json","graph_json":"https://pith.science/api/pith-number/3F6T5NIHC6PMBS534J3XUORL6M/graph.json","events_json":"https://pith.science/api/pith-number/3F6T5NIHC6PMBS534J3XUORL6M/events.json","paper":"https://pith.science/paper/3F6T5NIH"},"agent_actions":{"view_html":"https://pith.science/pith/3F6T5NIHC6PMBS534J3XUORL6M","download_json":"https://pith.science/pith/3F6T5NIHC6PMBS534J3XUORL6M.json","view_paper":"https://pith.science/paper/3F6T5NIH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.1827&json=true","fetch_graph":"https://pith.science/api/pith-number/3F6T5NIHC6PMBS534J3XUORL6M/graph.json","fetch_events":"https://pith.science/api/pith-number/3F6T5NIHC6PMBS534J3XUORL6M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3F6T5NIHC6PMBS534J3XUORL6M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3F6T5NIHC6PMBS534J3XUORL6M/action/storage_attestation","attest_author":"https://pith.science/pith/3F6T5NIHC6PMBS534J3XUORL6M/action/author_attestation","sign_citation":"https://pith.science/pith/3F6T5NIHC6PMBS534J3XUORL6M/action/citation_signature","submit_replication":"https://pith.science/pith/3F6T5NIHC6PMBS534J3XUORL6M/action/replication_record"}},"created_at":"2026-05-18T02:49:09.992561+00:00","updated_at":"2026-05-18T02:49:09.992561+00:00"}