{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FACI2RMI224WFQGPWGLGUQKTXO","short_pith_number":"pith:FACI2RMI","schema_version":"1.0","canonical_sha256":"28048d4588d6b962c0cfb1966a4153bbac1a644f1d8379bd8c058ad3c9197a57","source":{"kind":"arxiv","id":"1710.02004","version":1},"attestation_state":"computed","paper":{"title":"Alternating Iteratively Reweighted Minimization Algorithms for Low-Rank Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Athanasios A. Rontogiannis, Konstantinos D. Koutroumbas, Paris V. Giampouras","submitted_at":"2017-10-05T13:26:32Z","abstract_excerpt":"Nowadays, the availability of large-scale data in disparate application domains urges the deployment of sophisticated tools for extracting valuable knowledge out of this huge bulk of information. In that vein, low-rank representations (LRRs) which seek low-dimensional embeddings of data have naturally appeared. In an effort to reduce computational complexity and improve estimation performance, LRR has been viewed via a matrix factorization (MF) perspective. Recently, low-rank MF (LRMF) approaches have been proposed for tackling the inherent weakness of MF i.e., the unawareness of the dimension"},"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":"1710.02004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-05T13:26:32Z","cross_cats_sorted":[],"title_canon_sha256":"96757fde8f7159852cb607937fab93c32b220c959b18751c9e20064e69bb80e4","abstract_canon_sha256":"568a7cd46bee09727c77589df42f77982aeb3af7045a2e7b3d5377a01059d7dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:37.827147Z","signature_b64":"2C74Wdb6LZV1ey+6mZh4C7+dimCdfMOvcemp8cKgmrkrxUR8vFiUnNVLbBuSbhTmxsTtaUT3IhzdbZzcDceJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28048d4588d6b962c0cfb1966a4153bbac1a644f1d8379bd8c058ad3c9197a57","last_reissued_at":"2026-05-18T00:33:37.826428Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:37.826428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Alternating Iteratively Reweighted Minimization Algorithms for Low-Rank Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Athanasios A. Rontogiannis, Konstantinos D. Koutroumbas, Paris V. Giampouras","submitted_at":"2017-10-05T13:26:32Z","abstract_excerpt":"Nowadays, the availability of large-scale data in disparate application domains urges the deployment of sophisticated tools for extracting valuable knowledge out of this huge bulk of information. In that vein, low-rank representations (LRRs) which seek low-dimensional embeddings of data have naturally appeared. In an effort to reduce computational complexity and improve estimation performance, LRR has been viewed via a matrix factorization (MF) perspective. Recently, low-rank MF (LRMF) approaches have been proposed for tackling the inherent weakness of MF i.e., the unawareness of the dimension"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02004","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1710.02004","created_at":"2026-05-18T00:33:37.826554+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.02004v1","created_at":"2026-05-18T00:33:37.826554+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02004","created_at":"2026-05-18T00:33:37.826554+00:00"},{"alias_kind":"pith_short_12","alias_value":"FACI2RMI224W","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FACI2RMI224WFQGP","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FACI2RMI","created_at":"2026-05-18T12:31:15.632608+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/FACI2RMI224WFQGPWGLGUQKTXO","json":"https://pith.science/pith/FACI2RMI224WFQGPWGLGUQKTXO.json","graph_json":"https://pith.science/api/pith-number/FACI2RMI224WFQGPWGLGUQKTXO/graph.json","events_json":"https://pith.science/api/pith-number/FACI2RMI224WFQGPWGLGUQKTXO/events.json","paper":"https://pith.science/paper/FACI2RMI"},"agent_actions":{"view_html":"https://pith.science/pith/FACI2RMI224WFQGPWGLGUQKTXO","download_json":"https://pith.science/pith/FACI2RMI224WFQGPWGLGUQKTXO.json","view_paper":"https://pith.science/paper/FACI2RMI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.02004&json=true","fetch_graph":"https://pith.science/api/pith-number/FACI2RMI224WFQGPWGLGUQKTXO/graph.json","fetch_events":"https://pith.science/api/pith-number/FACI2RMI224WFQGPWGLGUQKTXO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FACI2RMI224WFQGPWGLGUQKTXO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FACI2RMI224WFQGPWGLGUQKTXO/action/storage_attestation","attest_author":"https://pith.science/pith/FACI2RMI224WFQGPWGLGUQKTXO/action/author_attestation","sign_citation":"https://pith.science/pith/FACI2RMI224WFQGPWGLGUQKTXO/action/citation_signature","submit_replication":"https://pith.science/pith/FACI2RMI224WFQGPWGLGUQKTXO/action/replication_record"}},"created_at":"2026-05-18T00:33:37.826554+00:00","updated_at":"2026-05-18T00:33:37.826554+00:00"}