{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FACI2RMI224WFQGPWGLGUQKTXO","short_pith_number":"pith:FACI2RMI","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"},"canonical_sha256":"28048d4588d6b962c0cfb1966a4153bbac1a644f1d8379bd8c058ad3c9197a57","source":{"kind":"arxiv","id":"1710.02004","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.02004","created_at":"2026-05-18T00:33:37Z"},{"alias_kind":"arxiv_version","alias_value":"1710.02004v1","created_at":"2026-05-18T00:33:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02004","created_at":"2026-05-18T00:33:37Z"},{"alias_kind":"pith_short_12","alias_value":"FACI2RMI224W","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FACI2RMI224WFQGP","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FACI2RMI","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FACI2RMI224WFQGPWGLGUQKTXO","target":"record","payload":{"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"},"canonical_sha256":"28048d4588d6b962c0cfb1966a4153bbac1a644f1d8379bd8c058ad3c9197a57","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"},"source_kind":"arxiv","source_id":"1710.02004","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:33:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9v27Y6SkXVqfdk4M8Vznk6Ca6UbrM8lFttUmgJW1uvdP0LjDJkMCD4NjplLFEAiU8kc3cXtyPVGoDORqfiNAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:38:08.140943Z"},"content_sha256":"398d0fb58b2d048e2b572b136a8c56b37ddb8f52a534d5954e48292a85e43faf","schema_version":"1.0","event_id":"sha256:398d0fb58b2d048e2b572b136a8c56b37ddb8f52a534d5954e48292a85e43faf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FACI2RMI224WFQGPWGLGUQKTXO","target":"graph","payload":{"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"},"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:33:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z4GzB88uGsK3JfZlF97PHKQp1srmdc2EsE9GEPp0lhXetvpP+cQwL+dFp5jFWu5B9qDKrokawEgw2alqkTpGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:38:08.141469Z"},"content_sha256":"39a1dce631d95cf99ee61a18102faf436d6e9d9393213e1d8ced6f4d54682bfd","schema_version":"1.0","event_id":"sha256:39a1dce631d95cf99ee61a18102faf436d6e9d9393213e1d8ced6f4d54682bfd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FACI2RMI224WFQGPWGLGUQKTXO/bundle.json","state_url":"https://pith.science/pith/FACI2RMI224WFQGPWGLGUQKTXO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FACI2RMI224WFQGPWGLGUQKTXO/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-01T19:38:08Z","links":{"resolver":"https://pith.science/pith/FACI2RMI224WFQGPWGLGUQKTXO","bundle":"https://pith.science/pith/FACI2RMI224WFQGPWGLGUQKTXO/bundle.json","state":"https://pith.science/pith/FACI2RMI224WFQGPWGLGUQKTXO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FACI2RMI224WFQGPWGLGUQKTXO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FACI2RMI224WFQGPWGLGUQKTXO","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":"568a7cd46bee09727c77589df42f77982aeb3af7045a2e7b3d5377a01059d7dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-05T13:26:32Z","title_canon_sha256":"96757fde8f7159852cb607937fab93c32b220c959b18751c9e20064e69bb80e4"},"schema_version":"1.0","source":{"id":"1710.02004","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.02004","created_at":"2026-05-18T00:33:37Z"},{"alias_kind":"arxiv_version","alias_value":"1710.02004v1","created_at":"2026-05-18T00:33:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02004","created_at":"2026-05-18T00:33:37Z"},{"alias_kind":"pith_short_12","alias_value":"FACI2RMI224W","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FACI2RMI224WFQGP","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FACI2RMI","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:39a1dce631d95cf99ee61a18102faf436d6e9d9393213e1d8ced6f4d54682bfd","target":"graph","created_at":"2026-05-18T00:33:37Z","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":"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","authors_text":"Athanasios A. Rontogiannis, Konstantinos D. Koutroumbas, Paris V. Giampouras","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-05T13:26:32Z","title":"Alternating Iteratively Reweighted Minimization Algorithms for Low-Rank Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02004","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:398d0fb58b2d048e2b572b136a8c56b37ddb8f52a534d5954e48292a85e43faf","target":"record","created_at":"2026-05-18T00:33:37Z","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":"568a7cd46bee09727c77589df42f77982aeb3af7045a2e7b3d5377a01059d7dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-05T13:26:32Z","title_canon_sha256":"96757fde8f7159852cb607937fab93c32b220c959b18751c9e20064e69bb80e4"},"schema_version":"1.0","source":{"id":"1710.02004","kind":"arxiv","version":1}},"canonical_sha256":"28048d4588d6b962c0cfb1966a4153bbac1a644f1d8379bd8c058ad3c9197a57","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28048d4588d6b962c0cfb1966a4153bbac1a644f1d8379bd8c058ad3c9197a57","first_computed_at":"2026-05-18T00:33:37.826428Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:37.826428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2C74Wdb6LZV1ey+6mZh4C7+dimCdfMOvcemp8cKgmrkrxUR8vFiUnNVLbBuSbhTmxsTtaUT3IhzdbZzcDceJDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:37.827147Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.02004","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:398d0fb58b2d048e2b572b136a8c56b37ddb8f52a534d5954e48292a85e43faf","sha256:39a1dce631d95cf99ee61a18102faf436d6e9d9393213e1d8ced6f4d54682bfd"],"state_sha256":"bc75d8ca53023ace98f8971001976093b7b69e65d14fffff0d53dc5979d318f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iLwjkW7q205xrj4lFFJdLy3xHosPzIvzYFTgr+ZpF17d4Pe7g5Qx12gNlHOzZeM9/DPw9aSfnrPwo6Ko707lBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:38:08.143767Z","bundle_sha256":"ed8e99d145de961a6f25a9621f4683112de0f606863c46f7301b4652d7052d9a"}}