{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ZPQVSVN4U3P7KA6OAAAAUGVTJK","short_pith_number":"pith:ZPQVSVN4","canonical_record":{"source":{"id":"1206.2493","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-06-12T11:33:07Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"c038ed93b53ba67098c1dc00dad08bf68f52dd842bd7af66e40d6f94237d1256","abstract_canon_sha256":"5d4ebd1470789d9558bdd84754e53f499072a089d0bb3a600761510909dbd060"},"schema_version":"1.0"},"canonical_sha256":"cbe15955bca6dff503ce00000a1ab34a8a6ded7747b4dc139670bd73f0997a81","source":{"kind":"arxiv","id":"1206.2493","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.2493","created_at":"2026-05-18T03:53:44Z"},{"alias_kind":"arxiv_version","alias_value":"1206.2493v1","created_at":"2026-05-18T03:53:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2493","created_at":"2026-05-18T03:53:44Z"},{"alias_kind":"pith_short_12","alias_value":"ZPQVSVN4U3P7","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZPQVSVN4U3P7KA6O","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZPQVSVN4","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ZPQVSVN4U3P7KA6OAAAAUGVTJK","target":"record","payload":{"canonical_record":{"source":{"id":"1206.2493","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-06-12T11:33:07Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"c038ed93b53ba67098c1dc00dad08bf68f52dd842bd7af66e40d6f94237d1256","abstract_canon_sha256":"5d4ebd1470789d9558bdd84754e53f499072a089d0bb3a600761510909dbd060"},"schema_version":"1.0"},"canonical_sha256":"cbe15955bca6dff503ce00000a1ab34a8a6ded7747b4dc139670bd73f0997a81","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:44.294941Z","signature_b64":"RSOyBMW2cY5HpHKkRqXOYO2YLUuCVekvIVLAbuSiAxQ/ntKQLyUbTibQgQWZb+4mH3f8Ss8Pp8N4gTDd1JlrCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbe15955bca6dff503ce00000a1ab34a8a6ded7747b4dc139670bd73f0997a81","last_reissued_at":"2026-05-18T03:53:44.294359Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:44.294359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.2493","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-18T03:53:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vAmocyQ4brfMb50VCmHqYekj+QjaNVVORsJFNJ0TLoOs87dj5wWdqPBAyoMS6DTSfh2C7dPVdKxLvzOGm6yrDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:12:53.323067Z"},"content_sha256":"f8f8c945b73852dbfccffb8a96508205b366added0281d64fe3b4302cc73c183","schema_version":"1.0","event_id":"sha256:f8f8c945b73852dbfccffb8a96508205b366added0281d64fe3b4302cc73c183"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ZPQVSVN4U3P7KA6OAAAAUGVTJK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Alternating Least-Squares for Low-Rank Matrix Reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Dave Zachariah, Magnus Jansson, Martin Sundin, Saikat Chatterjee","submitted_at":"2012-06-12T11:33:07Z","abstract_excerpt":"For reconstruction of low-rank matrices from undersampled measurements, we develop an iterative algorithm based on least-squares estimation. While the algorithm can be used for any low-rank matrix, it is also capable of exploiting a-priori knowledge of matrix structure. In particular, we consider linearly structured matrices, such as Hankel and Toeplitz, as well as positive semidefinite matrices. The performance of the algorithm, referred to as alternating least-squares (ALS), is evaluated by simulations and compared to the Cram\\'er-Rao bounds."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2493","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-18T03:53:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N8Ju8fVVomwk8oa2aBbRZs54ypHjr62a68gS9Vt1e2PAQGtQx8bqYy6u3AIeLoD+NIDy+yYC259/GnVvaZYCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:12:53.323802Z"},"content_sha256":"4de37130fb44bcf841ea616539d5300fd511419ac89399e9e262f571a9da6a83","schema_version":"1.0","event_id":"sha256:4de37130fb44bcf841ea616539d5300fd511419ac89399e9e262f571a9da6a83"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZPQVSVN4U3P7KA6OAAAAUGVTJK/bundle.json","state_url":"https://pith.science/pith/ZPQVSVN4U3P7KA6OAAAAUGVTJK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZPQVSVN4U3P7KA6OAAAAUGVTJK/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-25T19:12:53Z","links":{"resolver":"https://pith.science/pith/ZPQVSVN4U3P7KA6OAAAAUGVTJK","bundle":"https://pith.science/pith/ZPQVSVN4U3P7KA6OAAAAUGVTJK/bundle.json","state":"https://pith.science/pith/ZPQVSVN4U3P7KA6OAAAAUGVTJK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZPQVSVN4U3P7KA6OAAAAUGVTJK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ZPQVSVN4U3P7KA6OAAAAUGVTJK","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":"5d4ebd1470789d9558bdd84754e53f499072a089d0bb3a600761510909dbd060","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-06-12T11:33:07Z","title_canon_sha256":"c038ed93b53ba67098c1dc00dad08bf68f52dd842bd7af66e40d6f94237d1256"},"schema_version":"1.0","source":{"id":"1206.2493","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.2493","created_at":"2026-05-18T03:53:44Z"},{"alias_kind":"arxiv_version","alias_value":"1206.2493v1","created_at":"2026-05-18T03:53:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2493","created_at":"2026-05-18T03:53:44Z"},{"alias_kind":"pith_short_12","alias_value":"ZPQVSVN4U3P7","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZPQVSVN4U3P7KA6O","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZPQVSVN4","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:4de37130fb44bcf841ea616539d5300fd511419ac89399e9e262f571a9da6a83","target":"graph","created_at":"2026-05-18T03:53:44Z","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":"For reconstruction of low-rank matrices from undersampled measurements, we develop an iterative algorithm based on least-squares estimation. While the algorithm can be used for any low-rank matrix, it is also capable of exploiting a-priori knowledge of matrix structure. In particular, we consider linearly structured matrices, such as Hankel and Toeplitz, as well as positive semidefinite matrices. The performance of the algorithm, referred to as alternating least-squares (ALS), is evaluated by simulations and compared to the Cram\\'er-Rao bounds.","authors_text":"Dave Zachariah, Magnus Jansson, Martin Sundin, Saikat Chatterjee","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-06-12T11:33:07Z","title":"Alternating Least-Squares for Low-Rank Matrix Reconstruction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2493","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:f8f8c945b73852dbfccffb8a96508205b366added0281d64fe3b4302cc73c183","target":"record","created_at":"2026-05-18T03:53:44Z","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":"5d4ebd1470789d9558bdd84754e53f499072a089d0bb3a600761510909dbd060","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-06-12T11:33:07Z","title_canon_sha256":"c038ed93b53ba67098c1dc00dad08bf68f52dd842bd7af66e40d6f94237d1256"},"schema_version":"1.0","source":{"id":"1206.2493","kind":"arxiv","version":1}},"canonical_sha256":"cbe15955bca6dff503ce00000a1ab34a8a6ded7747b4dc139670bd73f0997a81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cbe15955bca6dff503ce00000a1ab34a8a6ded7747b4dc139670bd73f0997a81","first_computed_at":"2026-05-18T03:53:44.294359Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:44.294359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RSOyBMW2cY5HpHKkRqXOYO2YLUuCVekvIVLAbuSiAxQ/ntKQLyUbTibQgQWZb+4mH3f8Ss8Pp8N4gTDd1JlrCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:44.294941Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.2493","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8f8c945b73852dbfccffb8a96508205b366added0281d64fe3b4302cc73c183","sha256:4de37130fb44bcf841ea616539d5300fd511419ac89399e9e262f571a9da6a83"],"state_sha256":"a86c8d8f1daef7cd4df90e86d07cad815b2980d5c030ceb820ac6b7f411a1bc1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"shDBAkwv8hwBU4RxJwr6aE5c4iFBP+BviMTbqQnLm6TpjAoe7m40OtjnDM9mp4wYo+1Rpr7li+vf5ZZCoMPXBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:12:53.331123Z","bundle_sha256":"5df355f6da6cc1a6ce9ca8df4ef3a8fa81d6ea567c74d7c136d63e9ee31dee73"}}