{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XMCSSPUZRQHQXZ7AUGL6VKV7SF","short_pith_number":"pith:XMCSSPUZ","canonical_record":{"source":{"id":"1703.05038","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-03-15T09:26:52Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"2717fc2a54882ad8e65c4960c88fd52a14cdc99cfcea6a647eea0226f0d95c5d","abstract_canon_sha256":"5ea92241178d00f8c7b077bad804606ff7c36ebeefc85fb1d0e5629f84c57cd4"},"schema_version":"1.0"},"canonical_sha256":"bb05293e998c0f0be7e0a197eaaabf9174cbe45cb2a2279574d8c35d26305792","source":{"kind":"arxiv","id":"1703.05038","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05038","created_at":"2026-05-18T00:22:29Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05038v2","created_at":"2026-05-18T00:22:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05038","created_at":"2026-05-18T00:22:29Z"},{"alias_kind":"pith_short_12","alias_value":"XMCSSPUZRQHQ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XMCSSPUZRQHQXZ7A","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XMCSSPUZ","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XMCSSPUZRQHQXZ7AUGL6VKV7SF","target":"record","payload":{"canonical_record":{"source":{"id":"1703.05038","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-03-15T09:26:52Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"2717fc2a54882ad8e65c4960c88fd52a14cdc99cfcea6a647eea0226f0d95c5d","abstract_canon_sha256":"5ea92241178d00f8c7b077bad804606ff7c36ebeefc85fb1d0e5629f84c57cd4"},"schema_version":"1.0"},"canonical_sha256":"bb05293e998c0f0be7e0a197eaaabf9174cbe45cb2a2279574d8c35d26305792","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:29.442701Z","signature_b64":"kU1eK6wKy8HKa0QDbPsZdHfpvC5/t3RJy9ovLHFT77Iu6YZZJmpd56etCR19sPFVaoJNuDcyadsr5b8aiUydDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb05293e998c0f0be7e0a197eaaabf9174cbe45cb2a2279574d8c35d26305792","last_reissued_at":"2026-05-18T00:22:29.442038Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:29.442038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.05038","source_version":2,"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:22:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tlOEnx44rQcr6dH7cKRJXkreoq4rIysi3nVEvvi1hDdAY9g2SyezlF6XdUCZornP9Z7+R7VA3lPVczx9pGd0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T22:20:48.377870Z"},"content_sha256":"944d947e00a82324ee1e2d626357eb63b27c354b7667691351392374b1336e2d","schema_version":"1.0","event_id":"sha256:944d947e00a82324ee1e2d626357eb63b27c354b7667691351392374b1336e2d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XMCSSPUZRQHQXZ7AUGL6VKV7SF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Harmonic Mean Iteratively Reweighted Least Squares for Low-Rank Matrix Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC"],"primary_cat":"math.NA","authors_text":"Christian K\\\"ummerle, Juliane Sigl","submitted_at":"2017-03-15T09:26:52Z","abstract_excerpt":"We propose a new iteratively reweighted least squares (IRLS) algorithm for the recovery of a matrix $X \\in \\mathbb{C}^{d_1\\times d_2}$ of rank $r \\ll\\min(d_1,d_2)$ from incomplete linear observations, solving a sequence of low complexity linear problems. The easily implementable algorithm, which we call harmonic mean iteratively reweighted least squares (HM-IRLS), optimizes a non-convex Schatten-$p$ quasi-norm penalization to promote low-rankness and carries three major strengths, in particular for the matrix completion setting. First, we observe a remarkable global convergence behavior of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05038","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"},"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:22:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R/GXLq0jln2h2t/UfpN0yuaYoowW3qKbne/Tn1fD/3W/rTEd2Z6ipWiivNSwJpdzqD+zexKTB+PZCoZAvaycDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T22:20:48.378213Z"},"content_sha256":"bb585e11b371f3cee9c3bc32d5c36be480b0e04c207eb436ea7a1d7cc8e57749","schema_version":"1.0","event_id":"sha256:bb585e11b371f3cee9c3bc32d5c36be480b0e04c207eb436ea7a1d7cc8e57749"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XMCSSPUZRQHQXZ7AUGL6VKV7SF/bundle.json","state_url":"https://pith.science/pith/XMCSSPUZRQHQXZ7AUGL6VKV7SF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XMCSSPUZRQHQXZ7AUGL6VKV7SF/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-07-01T22:20:48Z","links":{"resolver":"https://pith.science/pith/XMCSSPUZRQHQXZ7AUGL6VKV7SF","bundle":"https://pith.science/pith/XMCSSPUZRQHQXZ7AUGL6VKV7SF/bundle.json","state":"https://pith.science/pith/XMCSSPUZRQHQXZ7AUGL6VKV7SF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XMCSSPUZRQHQXZ7AUGL6VKV7SF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XMCSSPUZRQHQXZ7AUGL6VKV7SF","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":"5ea92241178d00f8c7b077bad804606ff7c36ebeefc85fb1d0e5629f84c57cd4","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-03-15T09:26:52Z","title_canon_sha256":"2717fc2a54882ad8e65c4960c88fd52a14cdc99cfcea6a647eea0226f0d95c5d"},"schema_version":"1.0","source":{"id":"1703.05038","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05038","created_at":"2026-05-18T00:22:29Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05038v2","created_at":"2026-05-18T00:22:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05038","created_at":"2026-05-18T00:22:29Z"},{"alias_kind":"pith_short_12","alias_value":"XMCSSPUZRQHQ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XMCSSPUZRQHQXZ7A","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XMCSSPUZ","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:bb585e11b371f3cee9c3bc32d5c36be480b0e04c207eb436ea7a1d7cc8e57749","target":"graph","created_at":"2026-05-18T00:22:29Z","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":"We propose a new iteratively reweighted least squares (IRLS) algorithm for the recovery of a matrix $X \\in \\mathbb{C}^{d_1\\times d_2}$ of rank $r \\ll\\min(d_1,d_2)$ from incomplete linear observations, solving a sequence of low complexity linear problems. The easily implementable algorithm, which we call harmonic mean iteratively reweighted least squares (HM-IRLS), optimizes a non-convex Schatten-$p$ quasi-norm penalization to promote low-rankness and carries three major strengths, in particular for the matrix completion setting. First, we observe a remarkable global convergence behavior of the","authors_text":"Christian K\\\"ummerle, Juliane Sigl","cross_cats":["cs.IT","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-03-15T09:26:52Z","title":"Harmonic Mean Iteratively Reweighted Least Squares for Low-Rank Matrix Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05038","kind":"arxiv","version":2},"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:944d947e00a82324ee1e2d626357eb63b27c354b7667691351392374b1336e2d","target":"record","created_at":"2026-05-18T00:22:29Z","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":"5ea92241178d00f8c7b077bad804606ff7c36ebeefc85fb1d0e5629f84c57cd4","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-03-15T09:26:52Z","title_canon_sha256":"2717fc2a54882ad8e65c4960c88fd52a14cdc99cfcea6a647eea0226f0d95c5d"},"schema_version":"1.0","source":{"id":"1703.05038","kind":"arxiv","version":2}},"canonical_sha256":"bb05293e998c0f0be7e0a197eaaabf9174cbe45cb2a2279574d8c35d26305792","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb05293e998c0f0be7e0a197eaaabf9174cbe45cb2a2279574d8c35d26305792","first_computed_at":"2026-05-18T00:22:29.442038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:29.442038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kU1eK6wKy8HKa0QDbPsZdHfpvC5/t3RJy9ovLHFT77Iu6YZZJmpd56etCR19sPFVaoJNuDcyadsr5b8aiUydDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:29.442701Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.05038","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:944d947e00a82324ee1e2d626357eb63b27c354b7667691351392374b1336e2d","sha256:bb585e11b371f3cee9c3bc32d5c36be480b0e04c207eb436ea7a1d7cc8e57749"],"state_sha256":"4e05917a4aca0cf023f42e971e5a792fcf97fa14e1b0589c1baeac61ee366db9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yDHZBYKRRz7xZR9/RPkqBCRuE/dLn+ciCfW6S8EpmUzvBowfaE8ZXWXMlnkHOqq6OC62H4erk413wUPj/5auAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T22:20:48.380127Z","bundle_sha256":"99ab10513a024e8bafde117539476fb201082fc23a68ae3d98c0ff459aaab3fe"}}